Reliable Cluster-Based Routing Algorithms in Wireless Sensor Networks

Abstract

With advanced micro-electromechanical technology, the development of small-size, low-cost, and low-power sensors that possess sensing, signal processing and wireless communication capabilities is becoming popular than ever. To achieve the energy efficiency in the wireless sensor networks, LEACH has been proposed as a routing protocol, composing of a few clusters, each of which consists of member nodes that sense the data, and head nodes that deliver the collected data from member nodes to a sink node. When wireless link error occurs, LEACH may miss some messages because of only one cluster head. As our proposed scheme manages two cluster heads for each cluster, there should be higher probabilities for messages to reach the sink node. Simulation results show that our proposed algorithm provides more robust than LEACH when wireless link error occurs.

Reliable Random Key Pre-Distribution Schemes for Wireless Sensor Networks

“…In this paperwe suggesta random key pre-distribution scheme based on our previous cluster head selection algorithms [6] to improve the security issues. The suggested cluster head selection algorithm selects two cluster heads in a cluster for each round to increase of probability sending message of member node to sink node so as to reduce the number of generated orphan nodes and then to improve the message delivery ratio.…”