Página 16 dos resultados de 2591 itens digitais encontrados em 0.032 segundos

PLASMA – a high-performing and open platform for the integration of heterogeneous sensor networks

Manso, M.; Silva, Hugo Gonçalves; Bezzeghoud, Mourad
Fonte: ISBN: 978-989-20-2606-0 (2011). Publicador: ISBN: 978-989-20-2606-0 (2011).
Tipo: Aula
Português
Relevância na Pesquisa
35.71%
The use of sensors to capture disparate types of information from the environment has been increasing and they cover a wide range of applications, such as climate monitoring (e.g., seismic activity and climate), water quality monitoring, area surveillance, intelligent buildings, energy management, automotive industry and scientific purposes. Additionally, the Information Age has provided rapid and ubiquitous access to information produced by heterogeneous sources. Thus, the development of sensor networks has emerged as a way to exploit the Information Age capabilities into sensor applications. A major outcome of this combination is the capability to remotely receive and process sensor data (covering large areas) in real-time therefore allowing the development of new studies and algorithms aiming at anticipating and predicting (with high- reliability) events, such as storms (already state-of-the-art) and earthquakes (not yet possible). The developments in the scientific and industry communities were proficient in creating a large number of sensor networks that, nonetheless, (i) were designed to fit specific needs, (ii) were usually deployed in closed networks (not accessible to external parties), and/or (iii) do not interoperate with each-other...

Open Data for Resilience Initiative : Planning an Open Cities Mapping Project

World Bank Group; Global Facility for Disaster Reduction and Recovery
Fonte: World Bank, Washington, DC Publicador: World Bank, Washington, DC
Português
Relevância na Pesquisa
35.72%
This guide offers a comprehensive understanding of the design and implementation of an Open Cities mapping project for both practitioners in the field and those interested in a higher-level understanding of the process. The guideapos;s content is based on experience in implementing the initial Open Cities projects in Bangladesh, Nepal, and Sri Lanka as well as on previous mapping project experience. Where relevant, it provides relevant examples from those projects in the text and full case studies at the end of guide. The Open Cities Project launched its efforts in three cities: Batticaloa, Sri Lanka; Dhaka, Bangladesh; and Kathmandu, Nepal. These cities were chosen for: 1) their high levels of disaster risk; 2) the presence of World Bank-lending activities related to urban planning and disaster management that would benefit from access to better data; and 3) the willingness of government counterparts to participate in and help guide the interventions. Chapter 2, quot;Project Design and Preparation,quot; covers how a project design process begins: by identifying partners...

Data Collection by a Mobile Observer in a Single-hop Sensor Network

Chakrabarti, Arnab; Sabharwal, Ashutosh; Aazhang, Behnaam; Chakrabarti, Arnab; Sabharwal, Ashutosh; Aazhang, Behnaam
Fonte: Universidade Rice Publicador: Universidade Rice
Tipo: Artigo de Revista Científica
Português
Relevância na Pesquisa
35.72%
Journal Paper; In this paper, we demonstrate significant reduction in communication power by using a mobile observer to collect data from a wireless single-hop network of static sensors. The key challenge in using a mobile observer is that it remains within range of any sensor for a limited period, and inability to transfer data in this period causes data loss. This prompts us to choose the fraction of nodes successful in communicating data as our performance constraint as we try to minimize network power. First, we establish that the process of data collection by a mobile observer is analogous to a queue. The queuing-based data collection model is then used as a design tool to identify the combination of system parameters that satisfies the performance metric with minimum power. Second, we derive a sufficient condition on node placement for zero data loss in a mobile observer network. As our third contribution, we demonstrate that in a dense network, the data collection analysis is much simpler, which allows us to obtain closed expressions for the network power. Power comparisons with static observer networks show that power reduction by multiple orders of magnitude is typical. The scenarios chosen for power comparisons also provide guidelines on the choice of path...

Contribution to the cross-layer optimization of intra-cluster communication mechanisms in personal networks; Contribución a la optimización intercapa de los mecanismos de comunicación intra-cluster en redes personales

Sánchez González, Luis
Fonte: Universidad de Cantabria Publicador: Universidad de Cantabria
Tipo: Tese de Doutorado
Português
Relevância na Pesquisa
35.71%
RESUMEN: En el futuro, los dispositivos digitales formarán parte del entorno en el que las personas se desenvuelvan, participarán en nuestros objetivos y necesidades y nos ayudarán a "hacer más haciendo menos". A través de los dispositivos portátiles o aquellos que estén embebidos a nuestro alrededor el usuario será capaz de interactuar con el futuro universo de servicios e infraestructuras ubicuas. El principal paradigma que se seguirá se basa en que este universo estará centrado en el usuario ya que éste demandará los servicios que más le convengan en cualquier momento y lugar, todo ello preservando nuestra privacidad y seguridad. Este nuevo concepto no sólo se aplica a un entorno de ocio sino que en el campo profesional las redes inalámbricas de próxima generación permitirán incrementar nuestra productividad, reduciendo el peso de tareas repetitivas, poniendo a nuestra disposición la información relevante en el momento adecuado y según sean las necesidades particulares del usuario en ese momento y permitiéndonos trabajar con otras personas independientemente de donde se encuentren. En particular, se intuye que las redes de próxima generación se diseñen de forma que aglutinen todos los servicios disponibles a través de los diferentes sistemas que existan de forma que las posibles deficiencias de alguno de ellos se vean compensadas por otro. Lo que se pretende conseguir es que el usuario pueda disfrutar en todo momento y lugar de los servicios que desee sin que ello suponga un esfuerzo. Este concepto implica diferentes retos tecnológicos y la integración de múltiples sistemas. Dentro de estos retos tecnológicos esta Tesis aborda los siguientes: soporte de la heterogeneidad en lo referente a las tecnologías de acceso radio que existen y que eventualmente aparecerán en el futuro y que coexistirán en un mismo terminal; desarrollo de técnicas de optimización basadas en la cooperación entre diferentes capas de la pila de protocolos; implementación de estrategias de selección de la red que mejor pueda soportar un determinado servicio ante la posibilidad de utilización de múltiples tecnologías de acceso; optimización del uso de recursos energéticos en las comunicaciones dentro de la red; protección de la privacidad y la seguridad de las comunicaciones personales del usuario. Desde el punto de vista de las aportaciones...

A generic software architecture for portable applications in heterogeneous wireless sensor networks

Escolar Díaz, María Soledad
Fonte: Universidade Carlos III de Madrid Publicador: Universidade Carlos III de Madrid
Tipo: info:eu-repo/semantics/doctoralThesis; info:eu-repo/semantics/doctoralThesis Formato: application/octet-stream; application/octet-stream; application/pdf
Português
Relevância na Pesquisa
35.71%
In the last years, wireless sensor networks (WSNs) are acquiring more importance as a promising technology based on tiny devices called sensor nodes or motes able to monitor a wide range of physical phenomenon through sensors. Numerous branches of science are being benefited. The intrinsic ubiquity of sensor nodes and the absence of network infrastructure make possible their deployment in hostile or, up to now, unknown environments which have been typically unaccessible for humans such as volcanos or glaciers, providing precise and up-to-date data. As potential applications continue arising, both new technical and conceptual challenges appear. The severe hardware restrictions of sensor nodes in relation to computation, communication and specifically, energy, have posed new and exciting requirements. In particular, research is moving towards heterogeneous networks that will contain different devices running custom WSN operating systems. Operating systems specifically designed for sensor nodes are intended to efficiently manage the hardware resources and facilitate the programming. Nevertheless, they often lack the generality and the high-level abstractions expected at this abstraction layer. Consequently, they do not completely hide either the underlying platform or its execution model...

A Feasible Configuration of AFDX Networks for Real-Time Flows in Avionics Systems

An, Dongha; Jeon, Hyun Wook; Kim, Kyong Hoon; Kim, Ki-Il
Fonte: Universidad Carlos III de Madrid Publicador: Universidad Carlos III de Madrid
Tipo: info:eu-repo/semantics/publishedVersion; info:eu-repo/semantics/conferenceObject
Publicado em 03/12/2013 Português
Relevância na Pesquisa
35.71%
AFDX (Avionics Full Duplex Switched Ethernet) Networks have been proposed to meet unique ADN (Aircraft Data Networks) characteristics and then standardized as a Part 7 in ARNIC 664. As for this new communication technology, some research works have been conducted to address design issues such as optimizing virtual links as well as analytic modeling including response time. Despite of their research efforts, configuration problem for both MTU (Maximum Transmission Unit) and BAG (Bandwidth Allocation Gap) over virtual links in AFDX networks remains unsolved yet. In this paper, we propose how to set MTU and BAG value on each virtual link according to both application requirements and AFDX switch constraints. We define a new problem of feasible configurations of virtual links in an AFDX switch and propose an algorithm to derive feasible BAG and MTU pairs based on the branch-and-bound technique. Throughout simulations, we evaluate the proposed algorithm and analyze the effect of parameters in AFDX networks.; This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (No. NRF- 2012R1A1A1015096) and BK21+ Program.; REACTION 2013. 2nd International Workshop on Real-time and distributed computing in emerging applications. December 3rd...

Evolutionary algorithms for some problems in telecommunications = : Algoritmos evolutivos para alguns problemas em telecomunicações; Algoritmos evolutivos para alguns problemas em telecomunicações

Carlos Eduardo de Andrade
Fonte: Biblioteca Digital da Unicamp Publicador: Biblioteca Digital da Unicamp
Tipo: Tese de Doutorado Formato: application/pdf
Publicado em 05/03/2015 Português
Relevância na Pesquisa
35.71%
Nos últimos anos, as redes de telecomunicação tem experienciado um grande aumento no fluxo de dados. Desde a utilização massiva de vídeo sob demanda até o incontável número de dispositivos móveis trocando texto e vídeo, o tráfego alcançou uma escala capaz de superar a capacidade das redes atuais. Portanto, as companhias de telecomunicação ao redor do mundo tem sido forçadas a aumentar a capacidade de suas redes para servir esta crescente demanda. Como o custo de instalar uma infraestrutura de rede é geralmente muito grande, o projeto de redes usa fortemente ferramentas de otimização para manter os custos tão baixos quanto possível. Nesta tese, nós analisamos vários aspectos do projeto e implementação de redes de telecomunicação. Primeiramente, nós apresentamos um novo problema de projeto de redes usado para servir demandas sem fio de dispositivos móveis e rotear tal tráfego para a rede principal. Tais redes de acesso são baseadas em tecnologias sem fio modernos como Wi-Fi, LTE e HSPA. Este problema consideramos várias restrições reais e é difícil de ser resolvido. Nós estudamos casos reais nas vizinhanças de uma grande cidade nos Estados Unidos. Em seguida, nós apresentamos uma variação do problema de localização de hubs usado para modelar as redes principais (backbones ou laços centrais). Este problema também pode ser utilizado para modelar redes de transporte de cargas e passageiros. Nós também estudamos o problema de clusterização correlacionada com sobreposições usado para modelar o comportamento dos usuários quando utilizam seus equipamentos móveis. Neste problema...

Visualising network communications to evaluate a data dissemination method for ubiquitous systems

Shannon, Ross; Williamson, Graham; Quigley, Aaron; Nixon, Paddy
Fonte: University of Limerick Publicador: University of Limerick
Tipo: info:eu-repo/semantics/conferenceObject; all_ul_research; ul_published_reviewed
Português
Relevância na Pesquisa
35.72%
peer-reviewed; Ubiquitous computing systems which include wireless devices in their networks rely on sometimes frag- ile ah-hoc communication channels between heteroge- neous devices to operate. To maintain stability and ro- bustness, the contextual information contained on each node present in the system needs to be disseminated be- tween nodes, so that in the event of a node failure, the data is still available to the wider network. One approach to disseminating information around topologically un- stable networks is a type of epidemic algorithm called gossiping. However, developing an e cient, resilient al- gorithm to operate e ectively in such an environment is an ongoing challenge. We have developed a visualisation tool that supports the evaluation of gossiping methods by enabling the algorithm designer to view the visual evolution of a network of nodes, from which they can monitor the stability of information within the network. By using this tool the designer can watch as information is propagated throughout their network, and see the ef- fects of events such as node failures, so that they can make informed changes to the design of their algorithms.

Bicomponents and the robustness of networks to failure

Newman, M. E. J.; Ghoshal, Gourab
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Publicado em 20/08/2007 Português
Relevância na Pesquisa
35.71%
A common definition of a robust connection between two nodes in a network such as a communication network is that there should be at least two independent paths connecting them, so that the failure of no single node in the network causes them to become disconnected. This definition leads us naturally to consider bicomponents, subnetworks in which every node has a robust connection of this kind to every other. Here we study bicomponents in both real and model networks using a combination of exact analytic techniques and numerical methods. We show that standard network models predict there to be essentially no small bicomponents in most networks, but there may be a giant bicomponent, whose presence coincides with the presence of the ordinary giant component, and we find that real networks seem by and large to follow this pattern, although there are some interesting exceptions. We study the size of the giant bicomponent as nodes in the network fail, using a specially developed computer algorithm based on data trees, and find in some cases that our networks are quite robust to failure, with large bicomponents persisting until almost all vertices have been removed.; Comment: 5 pages, 1 figure, 1 table

Broadcast Throughput in Radio Networks: Routing vs. Network Coding

Alon, Noga; Ghaffari, Mohsen; Haeupler, Bernhard; Khabbazian, Majid
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Português
Relevância na Pesquisa
35.71%
The broadcast throughput in a network is defined as the average number of messages that can be transmitted per unit time from a given source to all other nodes when time goes to infinity. Classical broadcast algorithms treat messages as atomic tokens and route them from the source to the receivers by making intermediate nodes store and forward messages. The more recent network coding approach, in contrast, prompts intermediate nodes to mix and code together messages. It has been shown that certain wired networks have an asymptotic network coding gap, that is, they have asymptotically higher broadcast throughput when using network coding compared to routing. Whether such a gap exists for wireless networks has been an open question of great interest. We approach this question by studying the broadcast throughput of the radio network model which has been a standard mathematical model to study wireless communication. We show that there is a family of radio networks with a tight $\Theta(\log \log n)$ network coding gap, that is, networks in which the asymptotic throughput achievable via routing messages is a $\Theta(\log \log n)$ factor smaller than that of the optimal network coding algorithm. We also provide new tight upper and lower bounds that show that the asymptotic worst-case broadcast throughput over all networks with $n$ nodes is $\Theta(1 / \log n)$ messages-per-round for both routing and network coding.

Multiscale Analysis of Spreading in a Large Communication Network

Kivelä, Mikko; Pan, Raj Kumar; Kaski, Kimmo; Kertész, János; Saramäki, Jari; Karsai, Márton
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Publicado em 19/12/2011 Português
Relevância na Pesquisa
35.72%
In temporal networks, both the topology of the underlying network and the timings of interaction events can be crucial in determining how some dynamic process mediated by the network unfolds. We have explored the limiting case of the speed of spreading in the SI model, set up such that an event between an infectious and susceptible individual always transmits the infection. The speed of this process sets an upper bound for the speed of any dynamic process that is mediated through the interaction events of the network. With the help of temporal networks derived from large scale time-stamped data on mobile phone calls, we extend earlier results that point out the slowing-down effects of burstiness and temporal inhomogeneities. In such networks, links are not permanently active, but dynamic processes are mediated by recurrent events taking place on the links at specific points in time. We perform a multi-scale analysis and pinpoint the importance of the timings of event sequences on individual links, their correlations with neighboring sequences, and the temporal pathways taken by the network-scale spreading process. This is achieved by studying empirically and analytically different characteristic relay times of links, relevant to the respective scales...

Extraction of Multi-layered Social Networks from Activity Data

Musial, Katarzyna; Bródka, Piotr; Kazienko, Przemysław; Gaworecki, Jarosław
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Publicado em 03/07/2014 Português
Relevância na Pesquisa
35.72%
The data gathered in all kind of web-based systems, which enable users to interact with each other, provides an opportunity to extract social networks that consist of people and relationships between them. The emerging structures are very complex due to the number and type of discovered connections. In webbased systems, the characteristic element of each interaction between users is that there is always an object that serves as a communication medium. This can be e.g. an email sent from one user to another or post at the forum authored by one user and commented by others. Based on these objects and activities that users perform towards them, different kinds of relationships can be identified and extracted. Additional challenge arises from the fact that hierarchies can exist between objects, e.g. a forum consists of one or more groups of topics, and each of them contains topics that finally include posts. In this paper, we propose a new method for creation of multi-layered social network based on the data about users activities towards different types of objects between which the hierarchy exists. Due to the flattening, preprocessing procedure new layers and new relationships in the multi-layered social network can be identified and analysed.; Comment: 20 pages...

Impact of the spatial context on human communication activity

Dashdorj, Zolzaya; Sobolevsky, Stanislav
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Publicado em 11/06/2015 Português
Relevância na Pesquisa
35.72%
Technology development produces terabytes of data generated by hu- man activity in space and time. This enormous amount of data often called big data becomes crucial for delivering new insights to decision makers. It contains behavioral information on different types of human activity influenced by many external factors such as geographic infor- mation and weather forecast. Early recognition and prediction of those human behaviors are of great importance in many societal applications like health-care, risk management and urban planning, etc. In this pa- per, we investigate relevant geographical areas based on their categories of human activities (i.e., working and shopping) which identified from ge- ographic information (i.e., Openstreetmap). We use spectral clustering followed by k-means clustering algorithm based on TF/IDF cosine simi- larity metric. We evaluate the quality of those observed clusters with the use of silhouette coefficients which are estimated based on the similari- ties of the mobile communication activity temporal patterns. The area clusters are further used to explain typical or exceptional communication activities. We demonstrate the study using a real dataset containing 1 million Call Detailed Records. This type of analysis and its application are important for analyzing the dependency of human behaviors from the external factors and hidden relationships and unknown correlations and other useful information that can support decision-making.; Comment: 12 pages...

Flexible Data Dissemination Strategy for Effective Cache Consistency in Mobile Wireless Communication Networks

Tabassum, Kahkashan; Sultana, Asia; Damodaram, A.
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Publicado em 08/06/2012 Português
Relevância na Pesquisa
35.71%
In mobile wireless communication network, caching data items at the mobile clients is important to reduce the data access delay. However, efficient cache invalidation strategies are used to ensure the consistency between the data in the cache of mobile clients and at the database server. Servers use invalidation reports (IRs) to inform the mobile clients about data item updates. This paper proposes and implements a multicast based strategy to maintain cache consistency in mobile environment using AVI as the cache invalidation scheme. The proposed algorithm is outlined as follows - To resolve a query, the mobile client searches its cache to check if its data is valid. If yes, then query is answered, otherwise the client queries the DTA (Dynamic Transmitting Agent) for latest updates and the query is answered. If DTA doesn't have the latest updates, it gets it from the server. So, the main idea here is that DTA will be multicasting updates to the clients and hence the clients need not uplink to the server individually, thus preserving the network bandwidth. The scenario of simulation is developed in Java. The results demonstrate that the traffic generated in the proposed multicast model is simplified and it also retains cache consistency when compared to the existing methods that used broadcast strategy.; Comment: 14 pages and 14 figures

Tracking Traders' Understanding of the Market Using e-Communication Data

Saavedra, Serguei; Duch, Jordi; Uzzi, Brian
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Publicado em 26/10/2011 Português
Relevância na Pesquisa
35.72%
Tracking the volume of keywords in Internet searches, message boards, or Tweets has provided an alternative for following or predicting associations between popular interest or disease incidences. Here, we extend that research by examining the role of e-communications among day traders and their collective understanding of the market. Our study introduces a general method that focuses on bundles of words that behave differently from daily communication routines, and uses original data covering the content of instant messages among all day traders at a trading firm over a 40-month period. Analyses show that two word bundles convey traders' understanding of same day market events and potential next day market events. We find that when market volatility is high, traders' communications are dominated by same day events, and when volatility is low, communications are dominated by next day events. We show that the stronger the traders' attention to either same day or next day events, the higher their collective trading performance. We conclude that e-communication among traders is a product of mass collaboration over diverse viewpoints that embodies unique information about their weak or strong understanding of the market.

On Graph Stream Clustering with Side Information

Zhao, Yuchen; Yu, Philip S.
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Publicado em 28/01/2013 Português
Relevância na Pesquisa
35.72%
Graph clustering becomes an important problem due to emerging applications involving the web, social networks and bio-informatics. Recently, many such applications generate data in the form of streams. Clustering massive, dynamic graph streams is significantly challenging because of the complex structures of graphs and computational difficulties of continuous data. Meanwhile, a large volume of side information is associated with graphs, which can be of various types. The examples include the properties of users in social network activities, the meta attributes associated with web click graph streams and the location information in mobile communication networks. Such attributes contain extremely useful information and has the potential to improve the clustering process, but are neglected by most recent graph stream mining techniques. In this paper, we define a unified distance measure on both link structures and side attributes for clustering. In addition, we propose a novel optimization framework DMO, which can dynamically optimize the distance metric and make it adapt to the newly received stream data. We further introduce a carefully designed statistics SGS(C) which consume constant storage spaces with the progression of streams. We demonstrate that the statistics maintained are sufficient for the clustering process as well as the distance optimization and can be scalable to massive graphs with side attributes. We will present experiment results to show the advantages of the approach in graph stream clustering with both links and side information over the baselines.; Comment: Full version of SIAM SDM 2013 paper

Temporal Networks

Holme, Petter; Saramäki, Jari
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Português
Relevância na Pesquisa
35.71%
A great variety of systems in nature, society and technology -- from the web of sexual contacts to the Internet, from the nervous system to power grids -- can be modeled as graphs of vertices coupled by edges. The network structure, describing how the graph is wired, helps us understand, predict and optimize the behavior of dynamical systems. In many cases, however, the edges are not continuously active. As an example, in networks of communication via email, text messages, or phone calls, edges represent sequences of instantaneous or practically instantaneous contacts. In some cases, edges are active for non-negligible periods of time: e.g., the proximity patterns of inpatients at hospitals can be represented by a graph where an edge between two individuals is on throughout the time they are at the same ward. Like network topology, the temporal structure of edge activations can affect dynamics of systems interacting through the network, from disease contagion on the network of patients to information diffusion over an e-mail network. In this review, we present the emergent field of temporal networks, and discuss methods for analyzing topological and temporal structure and models for elucidating their relation to the behavior of dynamical systems. In the light of traditional network theory...

Greedy routing on networks of mobile agents

Yang, Han-Xin; Wang, Wen-Xu; Lai, Ying-Cheng; Wang, Bing-Hong
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Publicado em 20/12/2011 Português
Relevância na Pesquisa
35.71%
In this paper, we design a greedy routing on networks of mobile agents. In the greedy routing algorithm, every time step a packet in agent $i$ is delivered to the agent $j$ whose distance from the destination is shortest among searched neighbors of agent $i$. Based on the greedy routing, we study the traffic dynamics and traffic-driven epidemic spreading on networks of mobile agents. We find that the transportation capacity of networks and the epidemic threshold increase as the communication radius increases. For moderate moving speed, the transportation capacity of networks is the highest and the epidemic threshold maintains a large value. These results can help controlling the traffic congestion and epidemic spreading on mobile networks.

SuperNova: Super-peers Based Architecture for Decentralized Online Social Networks

Sharma, Rajesh; Datta, Anwitaman
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Português
Relevância na Pesquisa
35.72%
Recent years have seen several earnest initiatives from both academic researchers as well as open source communities to implement and deploy decentralized online social networks (DOSNs). The primary motivations for DOSNs are privacy and autonomy from big brotherly service providers. The promise of decentralization is complete freedom for end-users from any service providers both in terms of keeping privacy about content and communication, and also from any form of censorship. However decentralization introduces many challenges. One of the principal problems is to guarantee availability of data even when the data owner is not online, so that others can access the said data even when a node is offline or down. In this paper, we argue that a pragmatic design needs to explicitly allow for and leverage on system heterogeneity, and provide incentives for the resource rich participants in the system to contribute such resources. To that end we introduce SuperNova - a super-peer based DOSN architecture. While proposing the SuperNova architecture, we envision a dynamic system driven by incentives and reputation, however, investigation of such incentives and reputation, and its effect on determining peer behaviors is a subject for our future study. In this paper we instead investigate the efficacy of a super-peer based system at any time point (a snap-shot of the envisioned dynamic system)...

Privacy preserving telecardiology sensor networks: towards a low-cost portable wireless hardware/software co-design

Hu, Fei; Jiang, Meng; Wagner, Mark; Dong, Decun
Fonte: Institute of Electrical and Electronics Engineers Publicador: Institute of Electrical and Electronics Engineers
Tipo: Postprint
Português
Relevância na Pesquisa
35.72%
Recently, a remote-sensing platform based on wireless interconnection of tiny ECG sensors called Telecardiology Sensor Networks (TSN) provided a promising approach to perform lowcost real-time cardiac patient monitoring at any time in community areas (such as elder nursing homes or hospitals). The contribution of this research is the design of a practical TSN hardware/software platform for a typical U.S. healthcare community scenario (such as large nursing homes with many elder patients) to perform realtime healthcare data collections. On the other hand, due to the radio broadcasting nature ofMANET, a TSN has the risk of losing the privacy of patients’ data. Medical privacy has been highly emphasized by U.S. Department of Health and Human Services. This research also designs a medical security scheme with low communication overhead to achieve confidential electrocardiogram data transmission in wireless medium.