Skip to main content
Article thumbnail
Location of Repository

Secure Cluster Head Sensor Elections Using Signal Strength Estimation and Ordered Transmissions

By Gicheol Wang and Gihwan Cho


In clustered sensor networks, electing CHs (Cluster Heads) in a secure manner is very important because they collect data from sensors and send the aggregated data to the sink. If a compromised node is elected as a CH, it can illegally acquire data from all the members and even send forged data to the sink. Nevertheless, most of the existing CH election schemes have not treated the problem of the secure CH election. Recently, random value based protocols have been proposed to resolve the secure CH election problem. However, these schemes cannot prevent an attacker from suppressing its contribution for the change of CH election result and from selectively forwarding its contribution for the disagreement of CH election result. In this paper, we propose a modified random value scheme to prevent these disturbances. Our scheme dynamically adjusts the forwarding order of contributions and discards a received contribution when its signal strength is lower than the specified level to prevent these malicious actions. The simulation results have shown that our scheme effectively prevents attackers from changing and splitting an agreement of CH election result. Also, they have shown that our scheme is relatively energy-efficient than other schemes

Topics: Article
Publisher: Molecular Diversity Preservation International (MDPI)
OAI identifier:
Provided by: PubMed Central
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://www.pubmedcentral.nih.g... (external link)
  • Suggested articles


    1. An application-specific protocol architecture for wireless microsensor networks.
    2. HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks.
    3. (2003). Performance evaluation of load-balanced clustering of wireless sensor networks.
    4. A low-energy key management protocol for wireless sensor networks.
    5. (2006). Dynamic key management in sensor networks.
    6. (2000). An on-demand weighted clustering algorithm (WCA) for ad hoc networks.
    7. (1995). mobile, multimedia radio network. ACM-Baltzer J. Wireless Netw.
    8. (2001). A mobility based metric for clustering in mobile ad hoc networks.
    9. (2005). An energy-efficient voting-based clustering algorithm for sensor networks.
    10. (2007). Non-manipulable aggregator node election protocols for wireless sensor networks.
    11. (2002). A key management scheme for distributed sensor networks.
    12. (2003). Random key predistribution schemes for distributed sensor networks.
    13. (2005). On the security of cluster-based communication protocols for wireless sensor networks.
    14. (2002). SPINS: Security protocols for sensor networks. Wireless Netw.
    15. (2006). SecLEACH - A random key distribution solution for securing clustered sensor networks.
    16. (2003). Two phases based cluster formation scheme for mobile ad hoc networks.
    17. TinySeRSync: secure and resilient time synchronization in wireless sensor networks.

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.