Distributed clustering algorithms for data-gathering in wireless mobile sensor networks

摘要: One critical issue in wireless sensor networks is how to gather sensed information an energy-efficient way since the energy a scarce resource node. Cluster-based architecture effective for data-gathering networks. However, mobile environment, dynamic topology poses challenge design protocol. In this paper, we consider cluster-based and provide distributed clustering algorithms nodes which minimize dissipation network. There are two steps algorithm: cluster-head election step cluster formation step. We first propose election. Then, by considering impact of node mobility, mechanism have select proper join formation. Our will achieve following three objectives: (1) there at least one elected, (2) number cluster-heads generated uniform, (3) all clusters same size. Last, validate our through extensive experimental analysis with Random Walk Mobility (RWM) model, Direction (RDM) Simple (SM) model as well present findings.