Abstract

In Delay Tolerant Mobile Sensor Networks (DTMSNs) that have the inherent features of intermitted connectivity and frequently changing network topology it is reasonable to utilize multi-replica schemes to improve the data gathering performance. However, most existing multi-replica approaches inject a large amount of message copies into the network to increase the probability of message delivery, which may drain each mobile node’s limited battery supply faster and result in too much contention for the restricted resources of the DTMSN, so a proper data gathering scheme needs a trade off between the number of replica messages and network performance. In this paper, we propose a new data gathering protocol called DRADG (for Distance-aware Replica Adaptive Data Gathering protocol), which economizes network resource consumption through making use of a self-adapting algorithm to cut down the number of redundant replicas of messages, and achieves a good network performance by leveraging the delivery probabilities of the mobile sensors as main routing metrics. Simulation results have shown that the proposed DRADG protocol achieves comparable or higher message delivery ratios at the cost of the much lower transmission overhead than several current DTMSN data gathering schemes.

Highlights

  • Delay Tolerance Mobile Sensor Networks (DTMSNs) [1,2,3,4,5] have several unique characteristics such as sparse network density, short range radio and sensor node mobility, energy limits and so on, which result in intermittent connectivity and frequently changing network topology

  • The main reason is that their high demands on network resources that are typically unavailable in such challenging environments as DTMSNs

  • Data gathering schemes that can efficiently and effectively delivery data through intermittently connected networks are of critical importance to DTMSNs

Read more

Summary

Introduction

Delay Tolerance Mobile Sensor Networks (DTMSNs) [1,2,3,4,5] have several unique characteristics such as sparse network density, short range radio and sensor node mobility, energy limits and so on, which result in intermittent connectivity and frequently changing network topology. Though these protocols can effectively reduce the number of duplicate messages compared with the basic flooding algorithm, they usually fail to work well in DTMSNs. The main reason is that their high demands on network resources that are typically unavailable in such challenging environments as DTMSNs. Different from flooding-based routings, quota-based protocols such as Spray-and-Wait [10] and Spray-and-Focus [11] use fixed numbers of duplicate messages, which effectively limits network resource expansion and make them attain better performance than flooding-based routing schemes. Gathering protocol (DRADG), which is tailored for DTMSNs. By elaborately adapting the number of duplicates for every data message and computing the delivery probability so that data messages are forwarded to nodes with higher delivery capability, DRADG can achieve high network performance with low transmission overhead cost. DRADG protocol achieves comparable or higher message delivery ratios at the cost of the lower transmission overhead than the existing schemes.

Related Work
Distance-Aware Replica Adaptive Data Delivery Scheme
Network Model
Message Replica Number Calculation
Node Delivery Probability Calculation
Data Delivery Algorithm
Queue Management
Simulation
Impact of Message Generation Rate
Impact of Node Density
Data Traffic Overhead
Network Life
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.