Abstract

The extensive usage of wireless sensor networks (WSNs) has led to the development of many power- and energy-efficient routing protocols. Cooperative routing in WSNs can improve performance in these types of networks. In this paper we discuss the existing proposals and we propose a routing algorithm for wireless sensor networks called Power Efficient Location-based Cooperative Routing with Transmission Power-upper-limit (PELCR-TP). The algorithm is based on the principle of minimum link power and aims to take advantage of nodes cooperation to make the link work well in WSNs with a low transmission power. In the proposed scheme, with a determined transmission power upper limit, nodes find the most appropriate next nodes and single-relay nodes with the proposed algorithm. Moreover, this proposal subtly avoids non-working nodes, because we add a Bad nodes Avoidance Strategy (BAS). Simulation results show that the proposed algorithm with BAS can significantly improve the performance in reducing the overall link power, enhancing the transmission success rate and decreasing the retransmission rate.

Highlights

  • Cooperative routing has been identified as an effective and useful method of reducing the negative effects of fading in Wireless Sensor Networks (WSNs)

  • Node location information analysis and selection policy based on the Request to Send/Clear to Send (RTS/CTS) handshaking mechanism is the core part of the algorithm

  • The main idea of the algorithm is that each node uses its transmit power upper limit as its transmit power in order to ensure enough transmission distance in case of low power

Read more

Summary

Introduction

Cooperative routing has been identified as an effective and useful method of reducing the negative effects of fading in Wireless Sensor Networks (WSNs). More and more people began to pay attention to and research cooperative routing algorithms in WSNs. Because cooperative links can mitigate fading, achieve high spectral efficiency and improve transmission capacity for wireless networks by means of spatial diversity, and their realization is easier than that of the multiple-input multiple-output (MIMO) technique for small mobile terminals, it is theoretically possible to better adapt to the common WSNs where the node power is relatively low. Location based cooperative routing protocols assume that nodes know their location information as well as that of the surrounding nodes Sending nodes use this location information as the basis of the selection of nodes and relay nodes and for forwarding the data to the target area in accordance with a certain strategy, depending on the network structure [27,28].

Location-Based Cooperative Routing
Related Work
Network Model
Basic Assumptions
Direct Link Model
Cooperative Link Model
Pelcr-Tp Algorithm
Direct Link
Next Hop Node Selection
Performance Evaluation
Simulation Environment
Total Link Power
Transmission Success Rate
Retransmission Rate
Path Nodes
Conclusions and Future Work
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call