A Message-Efficient, Distributed Clustering Algorithm for Wireless Sensor and Actor Networks

摘要: Lifetime of sensor nodes determines lifetime the network and is crucial for sensing capability. Among important techniques proposed prolonging by exploiting redundant deployment using hierarchical architecture or clustering. However, primary drawback control message overhead; it essential that overhead does not dominate operations cost. The clustering algorithm should also scale to sizes are awake at any point in time must preserve desired coverage entire utilizing deployment. Also, has been shown networks, a fundamental tradeoff exists between energy latency data delivery (Y. Yu et al., 2004). If lead efficient MAC routing protocols could effectively address real-time requirements posed WSAN. principle contributions this paper as follows. We propose an extremely lightweight scalable WSN. Inspired cellular infrastructure model, we produced clusters bounded geographic size (given certain node distribution density guarantees bound on number cluster well), handles perturbations locally space time. novelty lies its deterministic operation optimally exploit produce balanced while retaining with minimum possible overhead. Extensive simulation conducted results presented show superiority our