Abstract

It is a challenging work to develop efficient routing protocols for Delay Tolerant Mobile Sensor Networks (DTMSNs), which have several unique characteristics such as sensor mobility, intermittent connectivity, energy limit, and delay tolerability. In this paper, we propose a new routing protocol called Minimum Expected Delay-based Routing (MEDR) tailored for DTMSNs. MEDR achieves a good routing performance by finding and using the connected paths formed dynamically by mobile sensors. In MEDR, each sensor maintains two important parameters: Minimum Expected Delay (MED) and its expiration time. According to MED, messages will be delivered to the sensor that has at least a connected path with their hosting nodes, and has the shortest expected delay to communication directly with the sink node. Because of the changing network topology, the path is fragile and volatile, so we use the expiration time of MED to indicate the valid time of the path, and avoid wrong transmissions. Simulation results show that the proposed MEDR achieves a higher message delivery ratio with lower transmission overhead and data delivery delay than other DTMSN routing approaches.

Highlights

  • To deal with data gathering in mobile and extreme environments lacking continuous connectivity, Delay Tolerant Mobile Sensor Networks (DTMSNs) [1,2,3,4,5] have been proposed in recent years.DTMSNs belongs to the general category of Delay Tolerant Networks (DTNs) [6,7,8,9,10,11,12], occasionally connected networks that may suffer from frequent partitions

  • We propose a new routing protocol called Minimum Expected Delay-based Routing (MEDR), which can efficiently find out and utilize temporary and local multiple-hop connected paths which are dynamically formed by moving nodes to improve the performance of data gathering

  • We propose a novel routing protocol called MEDR tailored for DTMSNs

Read more

Summary

Introduction

To deal with data gathering in mobile and extreme environments lacking continuous connectivity, Delay Tolerant Mobile Sensor Networks (DTMSNs) [1,2,3,4,5] have been proposed in recent years. Traditional data gathering approaches, which usually rely on a large number of densely deployed sensor nodes with short range radio to form a well connected end-to-end network, and collect the target data and transmit them to the sink nodes by collaborating together, cannot work effectively in DTMSNs. how to develop efficient routing protocols, which can achieve high data delivery ratios with low transmission overhead and acceptable delay for DTMSNs, becomes the key issue. We propose a new routing protocol called MEDR, which can efficiently find out and utilize temporary and local multiple-hop connected paths which are dynamically formed by moving nodes to improve the performance of data gathering.

Related Work
Minimum Expected Delay Based Routing Protocol
The Expected Time of Meeting and Departing the Sink Node
The Minimum Expected Delay
The Update Scheme of MED
Data Transmission Algorithm
Simulation
Impact of Message Generation Ratio
Impact of Node Density
Impact of Moving Speed
Network Life
Impact of the parameter thop
Conclusions
Full Text
Paper version not known

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.