TTL based routing in opportunistic networks
Introduction
Opportunistic Networks (OpNets) fall into a special category of wireless ad-hoc networks where a complete path from the source to the destination does not exist. In today's world, numerous opportunistic networking applications—such as Wildlife Tracking System (Juang et al., 2002, Jiang et al., 2009), Search and Rescue System (Huang and Cenwits, 2009), Underwater Sensor Network (Detweiller et al., 2009, Guo and Cui, 2010), Vehicular Ad-hoc Network (VANET) (Wang and Li, 2009, Harri and Filali, 2009), Pocket Switched Network (Chaintreau et al., 2005, Hui et al., 2005, Díaz et al., 2010), and people networks (Snowdon and Pollen, 2001, Liu and Wu, 2010), etc., are emerging. Disconnections and reconnections are pretty common in such networks. Factors such as high node mobility, low node density, intermittent power from energy management schemes, environmental interference and obstruction, short radio range and malicious attacks (Farrell and Cahill, 2006) etc. can ensue unstable connections in OpNets. In OpNets, the contacts are completely opportunistic, that is neither the meeting schedule nor the contact period of the nodes in the network is known in advance. Therefore, traditional Internet and Mobile Ad-hoc Network (MANET) routing techniques cannot be directly adopted in OpNets. This leads the research community to the development of specialized routing schemes that would better accommodate the characteristics of OpNets.
Generally, the routing algorithms in Wireless Ad-hoc Networks are stratified into two major categories—Forwarding based and Replication based. Forwarding based protocols use single copy of a message and attempt to direct the messages to the destination using the network dynamics. Traditional wireless routing protocols such as—AODV (Perkins and Royer, 1999), DSR (Johnson and Maltz, 1996), etc. are forwarding based protocols. Because of the unpredictability in network dynamics and irregularity in network connections forwarding based protocols are not well suited for OpNets. Still few forwarding based protocols (Spyropoulos et al., 2004, Burns et al., 2005, Henriksson et al., 2007, Liu and Wu, 2009, Guo and Cui, 2010) for opportunistic environments have been proposed. These protocols use the assumptions of network connectivity and environmental knowledge to take routing decisions. But their performance degrades when the environment becomes completely opportunistic.
Because of the inherent randomness in OpNets, most of the OpNet routing protocols employ replication based store and forward strategy. Replication based protocols insert multiple copies of a message into the network to increase the chance of message delivery. Most of the earlier replication based protocols tried to flood the messages to all the nodes in the network. Some examples of these Flooding based protocols are—Epidemic routing (Vahdat and Becker, 2000), PROPHET (Lindgren et al., 2003), MaxProp (Burgess et al., 2006), RAPID (Balasubramanian et al., 2007), PREP (Ramanathan et al., 2007), etc. Flooding based protocols generally replicate as many copies of a message as the resources permit. This approach of injecting many copies of a message may improve the delivery ratio but the approach is vulnerable to high network congestion.
To mitigate this flooding effect another variety of Replication based protocols named Quota based protocols were proposed. Quota based protocols keep the number of replicas of a message independent of the network size by setting up an upper limit on the maximum allowable replicas for a message. Spray and Wait (Spyropoulos et al., 2005), ORWAR (Sandulescu and Nadjm-Tehrani, 2008), Spray and Focus (Spyropoulos et al., 2007), and EBR (Nelson et al., 2009) are examples of some popular quota based protocols. Because of this limited flooding, quota based routing protocols usually fail to achieve delivery ratios as high as that of some of the flooding based protocols. However, they are better steward of network resources and less prone to network congestion.
In this paper, we propose TBR, a new quota based routing protocol for opportunistic networks. TBR introduces a new buffer management strategy and rank the messages in the buffer to schedule the next message to forward or delete. TBR ranks the messages based on message expiry time or TTL, message hop count, message replication count and message size. The use of TTL in ranking the messages allows the message with the earliest deadline to get the preference, while the use of message size allows the shortest message to get the preference. Hop count and replication count are used to ensure network fairness. To evaluate the performance of our protocol, we perform simulation under two different movement models (Keranen et al., 2009)—“Vehicular movement model” and “Random way point movement model” using Opportunistic Network Environment (ONE). We compare our delivery ratios, overheads, and latencies to that of the other popular replication based OpNet routing protocols. Simulation results show that our protocol achieves better delivery ratio than that of all the existing quota based routing protocols while maintaining a low overhead. TBR also achieves better delivery ratios compared to that of the best flooding based protocol with 70 to 75% less overhead and 10–20% less latency.
The rest of the paper is organized as follows. In Section 2, we give a brief background of the existing routing protocols for Opportunistic Networks. Section 3 briefly describes our TBR protocol. Section 4 presents the simulation results and their analysis. Finally, we conclude Section 5 with some future research directions.
Section snippets
Background and related works
Over the years, there have been a huge body of works (Perkins and Royer, 1999, Johnson and Maltz, 1996, DeCouto et al., 2003) on routing protocols for multi-hop wireless networks. These protocols can automatically route messages even when nodes are mobile and the link quality varies. However, these protocols always try to find an end-to-end path, and do not support communication between nodes in different network partitions. Thus, traditional Ad-hoc routing protocols do not fit in the
The TBR algorithm
This section presents the details of TTL Based Routing (TBR) protocol.
Evaluation
To evaluate our protocol, we first present the metrics that we used to evaluate our protocol, followed by a brief description of our simulation setup and mobility model. Finally, we present a comprehensive performance comparison of TBR with four other popular OpNet routing protocols.
Conclusion and future directions
Opportunistic networks aim to provide reliable communications in an intermittently connected environment. The major challenge here is to route messages without an end-to-end connection. To deal with the unpredictability in connections and network partitions, many routing protocols adopt flooding to improve the message delivery. However, this approach suffers from higher network resource consumption. Some other routing protocols such as the quota based protocols utilize network resources
References (30)
- et al.
Dtn routing as a resource allocation problem
SIGCOMM Comput Commun Rev
(2007) - et al.
Maxprop: routing for vehicle-based disruption-tolerant networks
- et al.
Mv routing and capacity building in disruption tolerant networks
- Chaintreau A, Hui P, Crowcroft J, Diot C, Gass R, Scott J. Pocket switched networks: real-world mobility and its...
- Díaz J, Marchetti-Spaccamela A, Mitsche D, Santi P, Stefa J. Social-aware forwarding improves routing performance in...
- et al.
A high-throughput path metric for multi-hop wireless routing
- et al.
An underwater sensor network with dual communications, sensing, and mobility
- et al.
Delay and disruption tolerant networking
(2006) - et al.
Prediction assisted single-copy routing in underwater delay tolerant networks
- et al.
Mobility models for vehicular ad hoc networks: a survey and taxonomy
IEEE Commun Surveys Tutorials
(2009)
A caching-based approach to routing in delay-tolerant networks
A sensor based loosely coupled search and rescue system using witnesses
Pocket switched networks and human mobility in conference environments
Sensearch: Gps and witness assisted tracking for delay tolerant sensor networks
Ad-hoc, mobile and wireless networks lecture notes in computer science
Dynamic source routing in ad hoc wireless networks
Mobile Comput
Cited by (75)
Interest forwarding strategy in Named Data Networks (NDN) using Thompson Sampling
2022, Journal of Network and Computer ApplicationsA twofold sink-based data collection in wireless sensor network for sustainable cities
2019, Sustainable Cities and SocietyCommunity trend message locking routing protocol for delay tolerant network
2023, Peer-to-Peer Networking and ApplicationsOptimizing Blockchain Broadcast with Node-Cluster Tree Routing
2023, ICSAI 2023 - 9th International Conference on Systems and InformaticsBuffer Management Techniques in Delay Tolerant Networks: A Comprehensive Survey
2023, Recent Advances in Computer Science and Communications