Dynamic election-based sensing and routing in wireless sensor networks

Authors:
Sharief M. A. Oteafy;Hosam M. AboElFotoh;Hossam S. Hassanein
Affiliations:
School of Computing, Queen's University;Dept. of Math. and Computer Sci., Kuwait University;School of Computing, Queen's University
Venue:
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Year:
2009

Citing 9
Cited 0

Inversive and linear congruential pseudorandom number generators in empirical tests

ACM Transactions on Modeling and Computer Simulation (TOMACS)
Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Energy-Efficient Communication Protocol for Wireless Microsensor Networks

HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Protocols for data propagation in wireless sensor networks

Wireless communications systems and networks
Reliable Energy Aware Routing In Wireless Sensor Networks

DSSNS '06 Proceedings of the Second IEEE Workshop on Dependability and Security in Sensor Networks and Systems
Routing techniques in wireless sensor networks: a survey

IEEE Wireless Communications
Communication paradigms for sensor networks

IEEE Communications Magazine
MAC protocols for wireless sensor networks: a survey

IEEE Communications Magazine
On lifetime-oriented device provisioning in heterogeneous wireless sensor networks: approaches and challenges

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Decentralized protocols offer high adaptability to topology changes prominent in Wireless Sensor Networks (WSN). Protocols resilient to topology changes stemming from nodes dying, being added, relocating or duty cycling, improve network performance in terms of lifetime and percent of events sensed and reported. Topology dependant protocols, such as cluster-based, face many hindrances especially in terms of scalability, dynamicity, and adapting to varying traffic rates. Accordingly, a novel approach is introduced in sensing, whereby a single node is elected to report a sensed event, in a decentralized manner, thereby avoiding redundant reports by other nodes which exhaust network resources. Election is based on the node with the highest likelihood of successfully reporting the event. This protocol is coupled with a localized multi-hop routing protocol, to route that report back to the sink, by electing the most reliable next-hop neighbor to relay the report. Simulation results demonstrate the increase in network lifetime, detection/reporting efficiency, and resilience to varying node density.