Name
Title | ||
|---|---|---|
On Maximizing the Lifetime of Wireless Sensor Networks Using Virtual Backbone Scheduling |
Abstract | ||
|---|---|---|
Wireless Sensor Networks (WSNs) are key for various applications that involve long-term and low-cost monitoring and actuating. In these applications, sensor nodes use batteries as the sole energy source. Therefore, energy efficiency becomes critical. We observe that many WSN applications require redundant sensor nodes to achieve fault tolerance and Quality of Service (QoS) of the sensing. However, the same redundancy may not be necessary for multihop communication because of the light traffic load and the stable wireless links. In this paper, we present a novel sleep-scheduling technique called Virtual Backbone Scheduling (VBS). VBS is designed for WSNs has redundant sensor nodes. VBS forms multiple overlapped backbones which work alternatively to prolong the network lifetime. In VBS, traffic is only forwarded by backbone sensor nodes, and the rest of the sensor nodes turn off their radios to save energy. The rotation of multiple backbones makes sure that the energy consumption of all sensor nodes is balanced, which fully utilizes the energy and achieves a longer network lifetime compared to the existing techniques. The scheduling problem of VBS is formulated as the Maximum Lifetime Backbone Scheduling (MLBS) problem. Since the MLBS problem is NP-hard, we propose approximation algorithms based on the Schedule Transition Graph (STG) and Virtual Scheduling Graph (VSG). We also present an Iterative Local Replacement (ILR) scheme as a distributed implementation. Theoretical analyses and simulation studies verify that VBS is superior to the existing techniques. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/TPDS.2011.305 | IEEE Trans. Parallel Distrib. Syst. |
Keywords | Field | DocType |
virtual backbone scheduling,energy consumption,existing technique,backbone sensor node,sensor node,maximum lifetime backbone scheduling,redundant sensor node,wireless sensor networks,sole energy source,mlbs problem,energy efficiency,approximation theory,energy states,scheduling algorithm,schedules,quality of service,wireless sensor network,graph theory,iterative methods,algorithm design and analysis,computational complexity,connected dominating set,scheduling problem,approximation algorithms,scheduling,energy efficient,fault tolerant | Key distribution in wireless sensor networks,Job shop scheduling,Computer science,Efficient energy use,Scheduling (computing),Computer network,Real-time computing,Schedule,Fault tolerance,Energy source,Wireless sensor network,Distributed computing | Journal |
Volume | Issue | ISSN |
23 | 8 | 1045-9219 |
Citations | PageRank | References |
45 | 1.17 | 9 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yaxiong Zhao | 1 | 115 | 7.18 |
| Jie Wu | 2 | 8307 | 592.07 |
| Feng Li | 3 | 161 | 16.37 |
| Sanglu Lu | 4 | 1380 | 144.07 |