No abstract

The paper aims to provide an energy efficient routing algorithm for Wireless Sensor Networks (WSNs). Clustering is a technique widely adopted in WSNs. It divides the network into clusters and the cluster heads are responsible for forwarding the aggregated data to the sink. There are many algorithms for forwarding the data to the sink. In this paper, a Game theory based Energy efficient Routing Algorithm (GERA) is proposed. As a clustering algorithm GERA adopts game theory and set a utility function based on the benefit and energy consumption of the node. Cluster heads are selected based on the utility function of the node iteratively. The cluster formation is done based on the cost function of the node in the network. Also an intra-cluster and multi-hop inter-cluster routing algorithms are designed and the simulation results shows that cluster heads are evenly distributed. The proposed routing algorithm consumes less energy than other existing algorithms such as Low Energy Adaptive Clustering Hierarchy (LEACH) and Density-based Energy-efficient Game-theoretic Routing Algorithm (DEGRA). Also the network lifetime is largely prolonged.

No abstract

In wireless sensor network, there are many hurdles takes place in providing quality of service routing to a desired level. The majority of routing protocols in wireless sensor networks concentrates only on energy efficiency as a prime factor, and only very few approaches focus on Quality of Service (QoS). Even few protocols provides QoS routing takes traditional parameters like bandwidth, delay and jitter . This proposed protocol provides an approach in a different way such that QoS routing can be a blend of some modern metrics. A novel protocol named Coverage Preserving Routing (CPR), has been designed which provides a complete and effective coverage of the network with minimum active nodes for a expected lifetime. This coverage based routing protocol consists of three phases namely cluster head selection , node self-scheduling and optimal routing. Cluster head selection phase preserves the coverage area of the network using a coverage preserving cluster head selection algorithm. This algorithm finds the node with minimum sensitivity area in a cluster has been elected as cluster head for every round. Node self-scheduling phase takes care of off-duty eligibility nodes of a round and performs a coordinated sleeping among nodes. Optimal routing phase has been developed based on multi path routing algorithm and it finds multiple shortest paths and performs each round of routing depends upon the energy levels of the nodes. Simulation results shows that the protocol provides a better coverage of the network. The lifetime is assured due to coordinative sleeping and multi path routing to some extent.

Many prominent applications in wireless sensor networks which require collected information have to be routed to end nodes in an efficient manner. In general, weighted connected dominating Sets (WCDS) based routing is a promising approach for enhancing the routing efficiency in sensor networks. Backbone has been used extensively in routing. Here an efficient WCDS algorithm for constructing a virtual backbone with low total cost, hop spanning ratio, and minimum number of dominators is proposed. We report a systematic approach, which has three phases. Initial phase considers the issues of revoking a partial CDS tree from a complete CDS tree. Secondary and final phases make the design of the complete algorithm by considering the determination of dominators using an iteration process. Our findings reveal better performance than the existing algorithms in terms of total cost, hop spanning ratio, and number of dominators.