Efficient clusterhead rotation via domatic partition in self-organizing sensor networks

Wireless Communications and Mobile Computing

Volumn 9, Issue 8, 2009, Pages 1040-1058

  Misra, Rajiv ^a   Mandal, Chittaranjan ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY   (India)

Author keywords

Clustering; Domatic partition; Energy efficient protocols; Self organization; Wireless sensor networks

Indexed keywords

APPROXIMATION FACTOR; CLUSTER HEAD; CLUSTER-HEAD NODES; CLUSTERING; CLUSTERING PROTOCOL; CLUSTERING SCHEME; DATA GATHERING; DESIGN GOAL; DOMATIC PARTITION; ENERGY-EFFICIENT PROTOCOLS; EXCESSIVE ENERGY; EXTERNAL CONTROL; GRAPH-THEORETIC PROBLEM; LOAD-BALANCING; NETWORK LIFETIME; NODE CLUSTERING; NP COMPLETE; SELF ORGANIZING; SELF-ORGANIZATION; SELF-ORGANIZATIONS; SELF-ORGANIZING SENSORS;

CLUSTERING ALGORITHMS; DYNAMIC POSITIONING; ENERGY EFFICIENCY; NETWORK PROTOCOLS; PERCOLATION (SOLID STATE); ROTATION; ROUTING PROTOCOLS; SENSOR NETWORKS; SPEECH RECOGNITION; WIRELESS TELECOMMUNICATION SYSTEMS;

WIRELESS SENSOR NETWORKS;

EID: 68349088154     PISSN: 15308669     EISSN: None     Source Type: Journal    
DOI: 10.1002/wcm.662     Document Type: Article

References (25)

1. Blough DM, Santi P. Investigating upper bounds on network lifetime extension for cell-based energy conservation techniques in stationary ad hoc networks. In Proceedings of ACM/IEEE International Conference on Mobile Computing and Networking (Mobicom), 2002.
2. Heinzelman WB, Chandrakasan AP, Balakrishnan H. An application-specific protocol architecture for wireless microsensor networks. IEEE Transactions on Wireless Communications 2002; 1(4): 660-670.
3. Heinzelman WR, Chandrakasan AP, Balakrishnan H. Energyefficient communication protocol for wireless microsensor networks. In Proceedings of 33rd Hawaii International Conference on System Sciences, January 2000.
4. Younis O, Fahmy S. HEED: a hybrid, energy-efficient, distributed clustering approach for ad-hoc sensor networks. IEEE Transactions on Mobile Computing 2004; 3(4): 366-379.
5. Cockayne EJ, Hedetniemi ST. Towards a theory of domination in graphs. Networks 1997; 7: 247-261.
6. Cardei M, Diu D. Improving wireless sensor network lifetime through power aware organization. Wireless Networks 2005; 11(3): 333-340.
7. Moscibroda T, Wattenhofer R. Maximizing the lifetime of dominating sets. In Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05), 2005.
8. Kuhn F, Moscibroda T, Nieberg T, Wattenhofer R. Fast deterministic distributed maximal independent set computation on growth-bounded graphs. In 19th International Symposium on Distributed Computing (DISC), Cracow, Poland, September 2005.
9. Clark BN, Colbourn CJ, Johnson DS. Unit disk graphs. Discrete Mathematics 1990; 86(1-3): 165-177.
10. Kuhn F, Moscibroda T, Wattenhofer R. On locality of bounded growth. In Proceedings of ACM-PODC, 2005.
11. Haynes TW, Hedetniemi ST, Slater PJ. Fundamentals of Domination in Graphs. Marcel Dekker: New York, 1998.
12. Wang P, Li C, Zheng J. Distributed minimum-cost clustering protocol for underwater sensor networks (UWSNs). In IEEE International Conference on Communications (ICC'07), June 2007; pp. 3510-3515. (Pubitemid 351146075)
13. Younis O, Krunz M, Ramasubramanian S. Node clustering in wireless sensor networks: recent developments and deployment challenges. IEEE Network-Special Issue on Wireless Sensor Networking 2006; 20(3): 20-25.
14. Bandyopadhyay S, Coyle E. An energy efficient hierarchical clustering algorithm for wireless sensor networks. In Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom 2003), 2003.
15. Soro S, Heinzelman W. Prolonging the lifetime of wireless sensor networks via unequal clustering. In Proceedings of the 5th International Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks (IEEE WMAN'05), April 2005.
16. Ghiasi S, Srivastava A, Yang X, Sarrafzadeh M. Optimal energy aware clustering in sensor network. Sensors 2002; 2: 258-269.
17. Chatterjee M, Das S, Turgut D. WCA: a weighted clustering algorithm for mobile ad hoc networks. Journal of Cluster Computing (Special Issue on Mobile Ad hoc Networks) 2002; 5: 193-204.
18. Basagni S. Distributed clustering for ad hoc networks. In Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN'99), 1999; p. 310.
19. Pemmaraju SV, Pirwani IA. Energy conservation via domatic partitions. In Proceedings of Mobihoc'06, May 2006.
20. Pach J, Agrawal PK. Combinatorial Geometry. John Wiley & Sons: New York, USA, 1995.
21. Simon G, Volgyesi P, Maroti M, Ledeczi A. Simulationbased optimization of communication protocols for large-scale wireless sensor neworks. In IEEE Aerospace Conference, Big Sky, MT, March 2003.
22. Schmid S, Wattenhofer R. Algorithmic models for sensor networks. In 14th International Workshop on Parallel and Distributed Real-Time Systems (WPDRTS), Island of Rhodes, Greece, April 2006.
23. Feige U, Halldorsson MM, Kortsarz G, Srinivasan A. Approximating the domatic number. SIAM Journal of Computing 2002; 32(1): 172-195.
24. Alzoubi K, Li X-Y, Wang Y, Wan PJ, Frieder O. Geometric spanners for wireless ad hoc networks. IEEE Transactions on Parallel and Distributed Systems 2003; 14(5): 408-421.
25. Garey MR, Johnson DS. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, & Co.: New York, USA, 1979.