Application oriented connected dominating set-based cluster formation in wireless sensor networks
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
Clustering is a fundamental mechanism used in the design of Wireless Sensor Network (WSN) protocols. The performance of WSNs can be improved by selecting the most suitable nodes to form a stable backbone structure with guaranteed network coverage. This paper proposes a base station-controlled centralized algorithm for static sensor networks and a distributed, weighted algorithm for dynamic sensor networks. The solutions are based on a (k,r)-Connected Dominating Set, which is suitable for cluster-based hierarchical routing. The clusterhead redundancy parameter k improves reliability, the multi-hop parameter r addresses the scalability issue and the combined weight metric improves the network lifespan and reduces the number of re-affiliations. To create a stable and efficient backbone structure, the backbone sensor nodes are selected based on quality, which is a function of the residual battery power, node degree, transmission range, and mobility of the sensor nodes. Simulation experiments are conducted to evaluate the performance of both the algorithms in terms of the number of elements in the backbone structure, re-affiliation frequency, load balancing, network lifespan, and the power dissipation. The results establish the potential of these algorithms for use in WSNs.
- Agre, J, Clare, L (2000) An integrated architecture for cooperative sensing networks. Computer 33: pp. 106-108 CrossRef
- Akkaya, K, Younis, M (2005) A survey on routing protocols for wireless sensor networks. Ad Hoc Netw 3: pp. 325-349 CrossRef
- Akyildiz IF, Su W, Sankaraubramaniam Y, Cayirci E (2002) A survey on sensor networks. IEEE Commun Mag
- Akylidiz, IF, Su, W, Sankarasubramanian, Y, Cayirci, E (2002) Wireless sensor network: A survey on sensor network. IEEE Commun Mag 40: pp. 102-114 CrossRef
- Anitha, VS, Sebastian, MP (2009) Scenario-based cluster formationand management in mobile ad hoc networks. Int J Mobile Comput Multimedia Commun 1: pp. 1-15
- Anitha, VS, Sebastian, MP (2009) Scenario-based diameter-bounded algorithm for cluster creation and management in mobile ad hoc networks. 13th IEEE/ACM international symposium on distributed simulation and real time applications. pp. 97-104 CrossRef
- Blum, J, Ding, M, Thaeler, A, Cheng, X Connected dominating set in sensor networks and MANETs. In: Du, D-Z, Pardalos, P eds. (2004) Handbook of combinatorial optimization. Kluwer Academic, Amsterdam
- Bonnet, P, Gehrke, J, Seshadri, P (2000) Querying the physical world. IEEE Pers Commun 7: pp. 10-15 CrossRef
- Bulusu, N, Estrin, D, Girod, L, Heidemann, J (2001) Scalable coordination for wireless sensor networks: self-configuring localization systems. International symposium on communication theory and applications (ISCTA 2001).
- Buratti, C, Conti, A, Dardari, D, Verdone, R (2009) An overview on wireless sensor networks technology and evolution. Sensors 9: pp. 6869-6896 CrossRef
- Chatterjee, M, Das, SK, Turgut, D (2002) Wca: a weighted clustering algorithm for mobile ad hoc networks. Clust Comput 5: pp. 193-204 CrossRef
- Chen, Y, Lieshman, AL (2002) Approximating minimum size weakly connected dominating sets for clustering mobile ad hoc networks. MobiHoc. ACM Press, New York, pp. 165-172
- Das, B, Bhargavan, V (1997) Routing in ad hoc networks using minimum connected dominating set. ICE. pp. 371-380
- Das, B, Sivakumar, E, Bhargavan, V (1997) Routing in ad hoc networks using a virtual backbone. Proceedings for the 6th international conference on computer communications and networks (IC3N’97). pp. 22-25
- Das, B, Sivakumar, R, Bharghavan, V (1997) Routing in ad-hoc networks using a spine. Proc of international conference on computers and communications networks, ICCCN.
- Ding, P, Holliday, J, Celek, A (2005) Distributed energy efficient hierarchical clustering for wireless sensor networks. Proc of the IEEE international conference on distributed computing in sensor systems.
- Friis, (1946) A note on simple transmission formula. Proceedings of IRE. pp. 254-256
- Garey M, Johnson D (1978) Computers and intractability: a guide to NP-completeness
- Guha, S, Khuller, S (1998) Approximation algorithms for connected dominating sets. Algorithmica 20: pp. 374-387 CrossRef
- Halweil, B (2001) Study finds modern farming is costly. World Watch 14: pp. 9-10
- Heinzelman, W, Chandrakasan, A, Balakrishnan, H (2002) An application-specific protocol architecture for wireless microsensor networks. IEEE Trans Wirel Commun 1: pp. 660-670 CrossRef
- Johnson, P, Andrews, DC (1996) Remote continuous physiological monitoring in the home. J Telemed Telecare 2: pp. 107-113 CrossRef
- Kahn, J, Katz, R, Pister, K (1999) Next century challenges: mobile networking for smart dust. Proceedings of the ACM MobiCom’99. pp. 271-278
- Li J, Andrew LL, Foh CH, Zukerman M, Chen HH (2009) Connectivity, coverage and placement in wireless sensor networks. Sensors
- Lindsey, S, Raghavendra, CS (2002) Pegasis: power efficient gathering in sensor information systems. Proc of IEEE aerospace conference.
- Noury, N, Herve, T, Rialle, V, Virone, G, Mercier, E, Morey, G, Moro, A, Porcheron, T (2000) Monitoring behavior in home using a smart fall sensor. IEEE-EMBS special topic conference on microtechnologies in medicine and biology. pp. 607-610
- Paruchuri, V, Durresi, A, Durresi, M, Barolli, L (2005) Routing through back bone structures in sensor networks. Proceedings ICPADS. pp. 397-401
- Rabaey J, Ammer M, da Silva J Jr, Patel D, Roundy S (2000) Picoradio supports ad hoc ultra-low power wireless networking. IEEE Comput Mag
- Ryl, DS, Stojmenovic, I, Wu, J (2005) Energy-efficient backbone construction, broadcasting, and area coverage in sensor networks. Wiley, New York
- Sinha, P, Sivakumar, R, Bharghavan, V (2001) Enhancing ad hoc routing with dynamic virtual infrastructures. 20th annual joint conference of the IEEE computer and communications societies.
- Stojmenovic, I, Wu, J Broadcasting and activity scheduling in AD HOC networks. In: Basagni, S, Conti, M, Giordano, S, Stojmenovic, I eds. (2004) Mobile ad hoc networking. IEEE, New York
- Wan, PJ, Alzoubi, KM, Frieder, O (2004) Distributed construction of connected dominating set in wireless ad hoc networks. Mobile Netw Appl 9: pp. 141-149 CrossRef
- Warneke, B, Liebowitz, B, Pister, K (2001) Smart dust: communicating with a cubic-millimeter computer. IEEE Computer, New York
- Wu J, Li H On calculating connected dominating set for efficient routing in ad hoc wireless networks. In: Proc of proceedings of the 3rd ACM international workshop on discrete algorithms and methods for mobile computing and communications, pp. 7–14. ACM, New York
- Wu, Y, Li, Y (2008) Construction algorithms for k-connected m-dominating sets in wireless sensor networks. Mobihoc 2008.
- Wu, Y, Wang, F, Thai, MT, Li, Y (2007) Constructing k-connected m-dominating sets in wireless sensor networks. Military communications conference. MILCOM, Orlando, pp. 29-31
- Younis, O, Fahmy, S (2004) Heed: A hybrid energy-efficient distributed clustering approach for ad hoc sensor networks. IEEE Trans Mob Comput 3: pp. 366-379 CrossRef
- Application oriented connected dominating set-based cluster formation in wireless sensor networks
Journal of the Brazilian Computer Society
Volume 17, Issue 1 , pp 3-18
- Cover Date
- Print ISSN
- Online ISSN
- Additional Links
- Sensor network
- Weighted clustering
- Connected dominating set
- Load balancing