SCIRP Mobile Website
Paper Submission

Why Us? >>

  • - Open Access
  • - Peer-reviewed
  • - Rapid publication
  • - Lifetime hosting
  • - Free indexing service
  • - Free promotion service
  • - More citations
  • - Search engine friendly

Free SCIRP Newsletters>>

Add your e-mail address to receive free newsletters from SCIRP.

 

Contact Us >>

WhatsApp  +86 18163351462(WhatsApp)
   
Paper Publishing WeChat
Book Publishing WeChat
(or Email:book@scirp.org)

Article citations

More>>

M. Gerla, T. J. Kwon and G. Pei, “On Demand Routing in Large Ad Hoc Wireless Networks with Passive Clustering,” Proceedings of IEEE WCNC, Chicago, Vol. 1, 2000, pp. 100-105.

has been cited by the following article:

  • TITLE: Stable Sensor Network (SSN): A Dynamic Clustering Technique for Maximizing Stability in Wireless Sensor Networks

    AUTHORS: A. B. M. Alim Al Islam, Chowdhury Sayeed Hyder, Humayun Kabir, Mahmuda Naznin

    KEYWORDS: Network Stability Period, Clustering, Energy Consumption Rate

    JOURNAL NAME: Wireless Sensor Network, Vol.2 No.7, July 9, 2010

    ABSTRACT: Stability is one of the major concerns in advancement of Wireless Sensor Networks (WSN). A number of applications of WSN require guaranteed sensing, coverage and connectivity throughout its operational period. Death of the first node might cause instability in the network. Therefore, all of the sensor nodes in the network must be alive to achieve the goal during that period. One of the major obstacles to ensure these phenomena is unbalanced energy consumption rate. Different techniques have already been proposed to improve energy consumption rate such as clustering, efficient routing, and data aggregation. However, most of them do not consider the balanced energy consumption rate which is required to improve network stability. In this paper, we present a novel technique, Stable Sensor Network (SSN) to achieve balanced energy consumption rate using dynamic clustering to guarantee stability in WSN. Our technique is based on LEACH (Low-Energy Adaptive Clustering Hierarchy), which is one of the most widely deployed simple and effective clustering solutions for WSN. We present three heuristics to increase the time before the death of first sensor node in the network. We devise the algorithm of SSN based on those heuristics and also formulate its complete mathematical model. We verify the efficiency of SSN and correctness of the mathematical model by simulation results. Our simulation results show that SSN significantly improves network stability period compared to LEACH and its best variant.