sensor network nodes are often limited in battery capacity and processing power. Thus, it is imperative to develop solutions that are both energy and computationally efficient. In this work, we present a simple static...
详细信息
sensor network nodes are often limited in battery capacity and processing power. Thus, it is imperative to develop solutions that are both energy and computationally efficient. In this work, we present a simple static multi-path routing approach that is optimal in the large system limit. In a network with energy replenishment, the largeness comes into play because the energy claimed by each packet is small compared to the battery capacity. Compared to the other routing algorithms in the literature, this static routing scheme exploits the knowledge on the patterns of traffic and energy replenishment, and does not need to collect instantaneous information on node energy. We also outline possible approaches for a distributed computation of the optimal policy, and propose heuristics to build the set of pre-computed paths. The simulations verify that the static scheme outperforms leading dynamic routing algorithms in the literature, and is close to optimal when the energy claimed by each packet is relatively small compared to the battery capacity.
The lifetime optimization is a key challenge of sensor networks. Since data transmission is the main energy consumer, it is important to make use of energy efficient communication protocols to prolong the network life...
详细信息
ISBN:
(纸本)3540380914
The lifetime optimization is a key challenge of sensor networks. Since data transmission is the main energy consumer, it is important to make use of energy efficient communication protocols to prolong the network lifetime. We formalize the lifetime optimization problem to a max flow problem in a directed graph with capacity powers on arcs and vertices. Then we propose a fast algorithm to solve this problem. The method gives the value of maximum lifetime exactly. The time complexity is O(vertical bar V vertical bar(2) (.) vertical bar A vertical bar).
In this paper, an information-driven sensor selection algorithm is proposed to select sensors to participate in Kalman filtering for target state estimation in sensor networks. The mutual information between the measu...
详细信息
ISBN:
(纸本)3540380914
In this paper, an information-driven sensor selection algorithm is proposed to select sensors to participate in Kalman filtering for target state estimation in sensor networks. The mutual information between the measurements of sensors and the estimated distribution of the target state is considered as the information utility function to evaluate the information contribution of sensors. And only those sensors with larger mutual information are selected to participate in the Kalman filtering iterations. Then the geographic routing mechanism is utilized to visit these selected sensors sequentially and set up a path to transport the state estimation information to the sink node. Simulation results show that compared with the shortest path tree algorithm, the information-driven sensor selection algorithm involves smaller participated sensors, and shorter total communication distance, while the estimation performance approaches the same bound.
Research activity in the area of medium-access control protocols of wireless sensor networks (WSN) has grown dramatically in the past few years. A number of MAC protocols are proposed to achieve energy efficiency upon...
详细信息
ISBN:
(纸本)3540380914
Research activity in the area of medium-access control protocols of wireless sensor networks (WSN) has grown dramatically in the past few years. A number of MAC protocols are proposed to achieve energy efficiency upon the limitation of WSN which are usually deployed in a special environment, assigned with long-term work, and supported by limited battery. It is found that there is a trade-off between energy efficiency and transmission delay, thus duty cycle of fixed sleep/listening MAC protocols has to be adjusted carefully to achieve the best performance. Taking the challenge to design an adapted listening mechanism, A-MAC is designed to adaptively and dynamically adjust the duty listening time based on traffic load. With A-MAC, it can achieve more power efficiency in low traffic load and much less transmission latency comparing to existing MAC protocols. We simulate A-MAC, and the simulation result shows that A-MAC can significantly prolong the lifetime of network when traffic is low and reduce packet delivery latency.
We have developed a new on-line error modeling and optimization-based localization approach for sensor networks in the presence of distance measurement noise. The approach is solely based on the concept of consistency...
详细信息
Mobile entity navigation in dynamic environments is an essential part of many mission critical applications like search and rescue and fire fighting. The dynamism of the environment necessitates the mobile entity to c...
详细信息
Pipelining the messaging between sensor nodes increases the overall throughput of the querying system, however at the cost of extra communication. But for long running queries, the messages communicated in pipelined a...
详细信息
ISBN:
(纸本)3540380914
Pipelining the messaging between sensor nodes increases the overall throughput of the querying system, however at the cost of extra communication. But for long running queries, the messages communicated in pipelined architecture are even less than the normal count of messages in any query processing methodology in sensor networks, as also pointed out in previous work. In this paper we device a novel methodology to process aggregation queries in sensor networks by using the systolic architecture. We explicitly define and stipulate the use of systolic message communication as aggregation query processing technique to yield increased response time with the saving of energy by reduced message communication when considering long running queries. We show through simulation the two-fold gain using the proposed technique as compared to methods without pipelining.
Secure key management in sensor networks is fundamental for data protection. However securing key management process is not a trivial task. Especially key generation and key distribution phases require extreme care. M...
详细信息
ISBN:
(纸本)9781424406739
Secure key management in sensor networks is fundamental for data protection. However securing key management process is not a trivial task. Especially key generation and key distribution phases require extreme care. Most cited current research work focuses on finding appropriate methods to securely transmit a key generated by some master node in the insecure wireless sensor network. This work presents a novel approach in which original keys to be used for securing communication are never transmitted across the insecure medium. Instead methods for generating these keys are distributed across the network in such a way that nodes in single cluster are able to generate the same cluster wide key. This approach not only saves energy by minimizing the communication overhead in establishing keys among sensor nodes but also provides high connectivity even when some nodes are in sleep state.
Coverage is a central issue in the design of wireless sensor networks. There are many measures for coverage, based on what aspect of surveillance quality we wish to address. Designing a network that achieves desired s...
详细信息
Reprogramming the sensor networks in place is an important and challenging problem. One way suggested for reprogramming is with the help of an UAV (Unmanned Ariel Vehicle). To reprogram a sensor network with the help ...
详细信息
暂无评论