Abstract
One of the most challenging issues in wireless sensor networks is to meet the requirements of coverage and connectivity under given energy constraints. Most existing coverage and connectivity algorithms work to form tree networks when sensor nodes do not have location information of themselves. However, a tree topology network does not perform well in terms of energy efficiency and scalability if compared with a cluster network. In this paper, a novel topology control algorithm called Adaptive Random Clustering (ARC) is proposed to form a cluster network with required coverage and connectivity without location information. The performance of its coverage intensity and connectivity is analyzed based on the characteristics of cluster topology, and their proper parameters are determined. ARC inherits an excellent energy efficiency from cluster topology and avoids the collisions and overhearing of data packets. A good scalability can be achieved as only a limited number of channels are needed in ARC for a large-scale network. Furthermore, ARC can adjust the number of active nodes adaptively according to the required coverage to balance the energy consumption. Simulation results demonstrate that required coverage and connectivity can be satisfied and network lifetime is prolonged significantly.
Original language | English |
---|---|
Pages (from-to) | 23-32 |
Number of pages | 10 |
Journal | Wireless Communications and Mobile Computing |
Volume | 12 |
Issue number | 1 |
DOIs | |
Publication status | Published - 2012 Jan |
All Science Journal Classification (ASJC) codes
- Information Systems
- Computer Networks and Communications
- Electrical and Electronic Engineering