Energy Efficient Routing in Wireless Sensor Networks through Virtual Backbone

Authors:
Sajid Hussain;Mubashsharul I. Shafique
Affiliations:
-;-
Venue:
CNSR '09 Proceedings of the 2009 Seventh Annual Communication Networks and Services Research Conference
Year:
2009

Citing 4
Cited 0

The broadcast storm problem in a mobile ad hoc network

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Span: an energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks

Wireless Networks
On constructing k-connected k-dominating set in wireless ad hoc and sensor networks

Journal of Parallel and Distributed Computing - 19th International parallel and distributed processing symposium
Incremental construction of k-dominating sets in wireless sensor networks

OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work we construct a graph model for a dense Wireless Sensor Network (WSN) in an industrial facility and investigate energy efficient routing path for network communication. The main objective is to conserve the overall energy of network so that it can last longer. We used Connected Dominating Set (CDS) because it provides smaller network backbone compared to Minimum Spanning Tree (MST). We designed a distributed CDS construction algorithm. The simulation results show that the proposed algorithm creates more efficient CDS as compared to the traditional CDS generating algorithm such as BFS.