Cluster head election techniques for coverage preservation in wireless sensor networks

✍ Scribed by Stanislava Soro; Wendi B. Heinzelman

• Publisher: Elsevier Science
• Year: 2009
• Tongue: English
• Weight: 622 KB
• Volume: 7
• Category: Article
• ISSN: 1570-8705
• DOI: 10.1016/j.adhoc.2008.08.006

✦ Synopsis

Coverage preservation is one of the basic QoS requirements of wireless sensor networks, yet this problem has not been sufficiently explored in the context of cluster-based sensor networks. Specifically, it is not known how to select the best candidates for the cluster head roles in applications that require complete coverage of the monitored area over long periods of time. In this paper, we take a unique look at the cluster head election problem, specifically concentrating on applications where the maintenance of full network coverage is the main requirement. Our approach for cluster-based network organization is based on a set of coverage-aware cost metrics that favor nodes deployed in densely populated network areas as better candidates for cluster head nodes, active sensor nodes and routers. Compared with using traditional energy-based selection methods, using coverage-aware selection of cluster head nodes, active sensor nodes and routers in a clustered sensor network increases the time during which full coverage of the monitored area can be maintained anywhere from 25% to 4.5Â, depending on the application scenario.