We propose five slot scheduling algorithms for Wireless Mesh Networks (WMNs) using a Time Division Multiple Access (TDMA)-based Medium Access Control (MAC) protocol. A preliminary comparative study is carried out thro...
详细信息
ISBN:
(纸本)9781424425747
We propose five slot scheduling algorithms for Wireless Mesh Networks (WMNs) using a Time Division Multiple Access (TDMA)-based Medium Access Control (MAC) protocol. A preliminary comparative study is carried out through simulation.
In this paper we study the problem of minimum connected dominating set in geometric k-disk graphs. this research is motivated by the problem of virtual backbone construction in wireless ad hoc and sensor networks, whe...
详细信息
ISBN:
(纸本)9781424431748
In this paper we study the problem of minimum connected dominating set in geometric k-disk graphs. this research is motivated by the problem of virtual backbone construction in wireless ad hoc and sensor networks, where the coverage area of nodes are disks with different radii. We derive the size relationship of any maximal independent set and the minimum connected dominating set in geometric k-disk graphs, and apply it to analyze the performances of two distributed connected dominating set algorithms we propose in this paper these algorithms have a bounded performance ratio and low communication overhead, and therefore have the potential to be applied in real ad hoc and sensor networks.
Low power radios, such as the CC2420, have been widely popular with recent sensor platforms. this paper explores the potential for energy savings from adding a high-power high-bandwidth, radio to current sensor platfo...
详细信息
ISBN:
(纸本)9781424431748
Low power radios, such as the CC2420, have been widely popular with recent sensor platforms. this paper explores the potential for energy savings from adding a high-power high-bandwidth, radio to current sensor platforms. High-bandwidth radios consume more power but significantly reduce the time for transmissions. Consequently, they offer net savings in total communication energy when there is enough data to offset wake-up energy overhead. the analysis on energy characteristics of several ieee 802.11 radios show that a feasible crossover point exists (in terms of data size) after which energy savings are possible. Based on this analysis, we present a bulk data transmission protocol for dual radio systems. the results of simulations and prototype implementation show significant energy savings at the expense of introducing acceptable delay.
While symmetric-key schemes are efficient in processing time for sensor networks, they generally require complicated key management, which may introduce large memory and communication overhead. On the contrary, public...
详细信息
ISBN:
(纸本)9781424431748
While symmetric-key schemes are efficient in processing time for sensor networks, they generally require complicated key management, which may introduce large memory and communication overhead. On the contrary, public-key based schemes have simple and clean key management, but cost more computational time. the recent progress of elliptic curve cryptography (ECC) implementation on sensors motivates us to design a public-key scheme and compare its performance withthe symmetric-key counterparts. this paper builds the user access control on commercial off-the-shelf sensor devices as a case study to show that the public-key scheme can be more advantageous in terms of the memory, usage, message complexity, and security resilience. Meanwhile, our work also provides insights in integrating and designing public-key based security protocols for sensor networks.
In sensor network applications, sensors often need to retrieve data from each (other. Information brokerage is a scheme that stores data (or index files of data) at rendezvous nodes, so that every sensor can efficient...
详细信息
ISBN:
(纸本)9781424431748
In sensor network applications, sensors often need to retrieve data from each (other. Information brokerage is a scheme that stores data (or index files of data) at rendezvous nodes, so that every sensor can efficiently finds the data it needs. A very useful property for information brokerage is locality sensitivity, which means that a sensor close the original source of the data should also be able to retrieve the data with c small communication cost. Given the locality sensitivity requirement, the key is to design an information brokerage scheme that minimizes the storage cost. In this paper, we present a locality sensitive information brokerage scheme. It is designed for general locality-sensitive requirements, which include the linear data-retrieval cost (a frequently studied scenario) as a special case. We also prove that for a large class of networks, in the scenario of linear data-retrieval cost, our scheme achieves the asymptotically optimal storage cost. the result also proves the optimality of a few other schemes in the literature.
Wireless sensor Networks (WSNs) are employed in many applications in order to collect data. One key challenge is to minimize energy consumption to prolong network lifetime. A scheme of making some nodes asleep and est...
详细信息
ISBN:
(纸本)9781424431748
Wireless sensor Networks (WSNs) are employed in many applications in order to collect data. One key challenge is to minimize energy consumption to prolong network lifetime. A scheme of making some nodes asleep and estimating their values according to the other active nodes' readings has been proved energy-efficient. For the purpose of improving the precision of estimation, we propose two powerful estimation models, Data Estimation using Physical Model (DEPM) and Data Estimation using Statistical Model (DESM). DEPM estimates the values of sleeping nodes by the physical characteristics of sensed attributes, while DESM estimates the values through the spatial and temporal correlations of the nodes. Experimental results on real sensor networks show that the proposed techniques provide accurate estimations and conserve energy efficiently.
the energy of a sensor network decides how long it will be alive. therefore, energy efficiency is the critical part of network survivability. the most energy consuming action of a sensor network is considered as commu...
详细信息
ISBN:
(纸本)9780769534923
the energy of a sensor network decides how long it will be alive. therefore, energy efficiency is the critical part of network survivability. the most energy consuming action of a sensor network is considered as communication between nodes. For energy efficient communication, many research activities for clustering mechanisms have been conducted But, selecting cluster heads, selecting cluster range and communication mechanism between clusters are not clearly defined, and they are not suitable for applying to practical network environments. So, in the paper, we try to solve these problems and apply a new clustering mechanism for more efficient energy usage in sensor networks.
this paper proposes a novel hybrid cryptographic scheme for the generation of pair-wise network topology authenticated (TAK) keys in a Wireless sensor Network (WSN) using vector algebra in GF(q). the proposed scheme i...
详细信息
ISBN:
(纸本)9781424425747
this paper proposes a novel hybrid cryptographic scheme for the generation of pair-wise network topology authenticated (TAK) keys in a Wireless sensor Network (WSN) using vector algebra in GF(q). the proposed scheme is deterministic, pair-wise keys are not pre-distributed but generated starting from partial key components, keys management exploits benefits from both symmetric and asymmetric schemes (hybrid cryptography) and each key in a pair node can be generated only if nodes have been authenticated (key authentication). Network topology authentication, and hybrid key cryptography are the building blocks for this proposal: the former means that a cryptographic key can be generated if and only if the current network topology is compliant to the "planned network topology", which acts as the authenticated reference;the latter means that the proposed scheme is a combination of features from symmetric (for the ciphering and authentication model) and asymmetric cryptography (for the key generation model). the proposal fits the security requirement of a cryptographic scheme for WSN in a limited computing resource. A deep quantitative security analysis has been carried out. Moreover the cost analysis of the scheme in terms of computational time and memory usage for each node has been carried on and reported for the case of a 128-bit key.
For queries in wireless sensor networks, empty sets may be returned as query results which could confuse users a lot and users obtain no useful information about the monitored objects from the empty sets. To solve the...
详细信息
ISBN:
(纸本)9781424431748
For queries in wireless sensor networks, empty sets may be returned as query results which could confuse users a lot and users obtain no useful information about the monitored objects from the empty sets. To solve the problem, this paper proposes methods to provide users with approximate answer sets in the case where no sensing data satisfies the query conditions. the opproximate answer sets can be used not only to answer the query approximately but also to guide users to modify their queries for further probing the monitored objects. the distance between sensing data and a query and the dominating relationship between sensing data are first defined. then, three algorithms for processing probing queries am proposed, which compute the best approximate answer sets that consist of the sensing data withthe smallest distance from given queries. All the algorithms utilize the dominating relationship to reduce the amount of data transmitted in sensor networks by filtering out the unnecessary data. Experimental results on real and synthetic data sets show that the proposed algorithms have high performance and energy efficiency.
A key challenge in developing distributed real-time embedded (DRE) systems is to meeting critical performance constraints when DRE systems become more difficult to predict in terms of the needs of the application, par...
详细信息
ISBN:
(纸本)9780769534923
A key challenge in developing distributed real-time embedded (DRE) systems is to meeting critical performance constraints when DRE systems become more difficult to predict in terms of the needs of the application, particularly those needs that are likely, to change dynamically during execution of the application. the system design must combine temporal requirements and considerable uncertainty, together withthe ability to swiftly v adapt to changing environmental conditions. this paper proposes a robust DRE model that does not require precise system parameters. A multivariable H infinity controller is developed and provides utilisation and deadline guarantees in an unpredictable environment.
暂无评论