No 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.

Abstract-The development of small-size, low-cost, and low-power sensors that possess sensing, signal processing and wireless communication capabilities is becoming popular for the wireless sensor networks. Cluster-based routing protocol is a good choice to achieve the energy efficiency for the wireless sensor networks. Due to the limited resources and energy constraints, complex security algorithms cannot be employed in sensor networks. In this paper, we propose a cluster-based routing protocol with a key pre-distribution scheme which improves the resilience of the network. In addition, our scheme is suitable for link error-prone environments. We describe the details of the algorithm and compare it with other schemes. Simulation results show that the proposed scheme achieves better performance in terms of security, efficiency and key connectivity.Index Terms-Cluster, key pre-distribution, security, wireless sensor networks.

Abstract-To exploit in answering queries generated by the sink for the sensor networks, we propose an efficient routing protocol called energy-efficient dynamic routing tree (EDRT) algorithm. The idea of EDRT is to maximize in-network processing opportunities using the parent nodes and sibling nodes. Innetwork processing reduces the number of message transmission by partially aggregating results of an aggregate query in intermediate nodes, or merging the results in one message. This results in reduction of communication cost. Our experimental results based on simulations prove that our proposed method can reduce message transmissions more than query specific routing tree (QSRT) and flooding-based routing tree (FRT).

No abstract