BibTeX:

@article{IJIRSTV1I10057,
     title={Connected Dominant Set Based Virtual Backbone Path Routing For Wireless Sensor Network},
     author={K.Malini and G.Surya},
     journal={International Journal for Innovative Research in Science & Technology},
     volume={1},
     number={10},
     pages={186--191},
     year={},
     url={http://www.ijirst.org/articles/IJIRSTV1I10057.pdf},
     publisher={IJIRST (International Journal for Innovative Research in Science & Technology)},
}

Wireless Sensor Networks (WSNs) are key for various applications that involve longstanding and low-cost monitoring and actuating. In these applications, sensor nodes use batteries as the exclusive source of energy. Therefore, energy proficiency becomes critical. In this paper, we present a novel sleep-scheduling technique called Virtual Backbone Scheduling (VBS). VBS forms multiple overlapped backbones which work alternatively to elongate 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 well-adjusted. Approximation algorithms are proposed based on the Schedule Transition Graph (STG), Virtual Scheduling Graph (VSG) and Iterative Local Replacement (ILR). Ad-hoc On Demand Vector (AODV) protocol is used here to find an efficient routing path. Theoretical analyses and simulation studies verify that VBS is superior to the existing techniques.

Wireless sensor networks (WSNs), backbone scheduling, sleep scheduling, virtual backbone, connected dominating set