Abstract | ||
---|---|---|
Power- and location-unaware topology control protocols for wireless sensor networks (WSNs) generally conserve energy by forming node clusters using the connected dominating set (CDS) principle. CDS-based clustering allows nodes lying outside the CDS to enter the sleep mode thereby extending node and network lifetimes. In this paper, we introduce a simple, distributed and efficient graph-theoretic topology construction protocol that uses sensor cliques to discover a CDS in an energy efficient manner. Our simulation results show that the proposed protocol consistently outperforms existing solutions (Rule K, EECDS and A3) in terms of energy efficiency, message complexity and residual energy present in the CDS. |
Year | DOI | Venue |
---|---|---|
2010 | 10.1109/CISS.2010.5464724 | Information Sciences and Systems |
Keywords | Field | DocType |
communication complexity,graph theory,routing protocols,telecommunication network topology,wireless sensor networks,CDS-based clustering,clique-based CDS discovery protocol,connected dominating set principle,graph-theoretic topology,location-unaware topology control protocols,message complexity,wireless sensor networks | Key distribution in wireless sensor networks,Topology control,Computer science,Efficient energy use,Computer network,Network topology,Connected dominating set,Wireless Application Protocol,Wireless sensor network,Routing protocol,Distributed computing | Conference |
ISBN | Citations | PageRank |
978-1-4244-7417-2 | 0 | 0.34 |
References | Authors | |
0 | 6 |
Name | Order | Citations | PageRank |
---|---|---|---|
Hassaan Khaliq Qureshi | 1 | 95 | 18.16 |
Sajjad Rizvi | 2 | 68 | 6.11 |
Muhammad Saleem | 3 | 17 | 3.43 |
Syed Ali Khayam | 4 | 450 | 33.86 |
Muttukrishnan Rajarajan | 5 | 593 | 61.50 |
Veselin Rakocevic | 6 | 199 | 28.20 |