Hierarchical Probabilistic Routing Algorithm for Wireless Sensor Network

Hierarchical Probabilistic Routing Algorithm for Wireless Sensor Network

Kalyan Das, Souvik Patra, Aromita Sen, Prof. Samir Kumar Bandyopadhyay

Abstract

 In wireless sensor networks (WSNs), collecting sensed information and transforming the information to the base station in an efficient manner and lengthening the network life time are important issues. Clustering is an efficient way that divides the sensor nodes in many clusters, each which has a cluster head. In this thesis we propose a Hierarchical Probabilistic Routing Algorithm for WSN. We divide the whole network into different cluster having single cluster head. Each cluster head aggregate the data from its member nodes (non cluster head nodes). The Base Station is treated as the Super Cluster Head which receive all the information coming from other Cluster Head’s. Finally, routing will be done within the cluster head’s. In our thesis the Destination is always the Base Station. The routing parameter is the radio range of the sensor node and the probability of successful communication between Source Cluster Head and the Base Station (Here the probability of successful communication means the probability of communication between the source nodes to the Base Station via another Cluster Head node). In our thesis we want to develop a Routing mechanism to minimize the routing overhead by using Clustering, Aggregation and maximize the probability of successful communication from source Cluster Head to the Base Station..

Keywords

WSN; Hierarchical; Probabilistic; Clustering; Aggregation; Cluster Head; Base Station; Radio Range;