On Clustering Algorithm Studies for Ad Hoc Wireless Sensor Network

Network load is balanced and energy is in stable and sustainable is the important guarantee for the stability of the network. Traditional clustering algorithm for ad hoc network can effectively achieve a single point of network stability, and there is no efficient algorithm for long-term stability. Improvements have been made in this context traditional network clustering algorithm, based on efficient cluster head node using residual energy and communications networking sensor networks nodes remaining weaknesses in the energy networks and strengthening, improving the overall balance and effectiveness of the network, and ultimately to improve the long-term stability in wireless ad hoc networks sensor networks.

[1]  R. Ramanujan,et al.  Intrusion-resistant ad hoc wireless networks , 2002, MILCOM 2002. Proceedings.

[2]  C.-H. Chu,et al.  Tactical bandwidth exhaustion in ad hoc networks , 2004, Proceedings from the Fifth Annual IEEE SMC Information Assurance Workshop, 2004..

[3]  Yih-Chun Hu Packet Leashes : A Defense against Wormhole Attacks in Wireless Ad Hoc Networks , 2001 .

[4]  Yih-Chun Hu,et al.  Packet leashes: a defense against wormhole attacks in wireless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[5]  Edward W. Knightly,et al.  Denial of service resilience in ad hoc networks , 2004, MobiCom '04.

[6]  Min Tan,et al.  A Power Efficient Routing Protocol for Wireless Sensor Network , 2007, 2007 IEEE International Conference on Networking, Sensing and Control.