Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case

Spyropoulos, Thrasyvoulos; Psounis, Konstantinos; Raghavendra, C.S.

doi:10.1109/tnet.2007.897962

Cited by 769 publications

(539 citation statements)

References 33 publications

Supporting

Mentioning

538

Contrasting

Order By: Relevance

“…Any change in the current assumptions is expected to affect the performance of compared algorithms in the same way since they use one copy of the message. Moreover, we used a simplified slotted CSMA MAC model as in [7]. We ran each simulation 10 times with different seeds and in each run, we collect statistics by running each algorithm on the same set of messages.…”

Section: Simulation Resultsmentioning

confidence: 99%

“…Even though the previous studies modeled the node relations (i.e., intermeeting times) using different distributions (exponential [7] [31], log-normal [15]) and developed their routing metrics accordingly, they assumed that the meetings of a node with other nodes is independent of each other. The future meetings of two nodes are predicted looking at the meetings of only these two nodes in the past.…”

Section: Conditional Intermeeting Timementioning

confidence: 99%

“…Note that when the node meets any node m, a timer is started for every other possible node (lines 1-3). Since meeting with node m will also end the conditional meeting time process for some other nodes, the corresponding timers whose clock has started at meeting with other nodes but is scheduled to end at meeting with m stop and their values are recorded (lines [4][5][6][7][8]. CIT values are then updated for all possible cases and the timers are deleted (lines 9-12).…”

Section: Conditional Intermeeting Timementioning

confidence: 99%

See 2 more Smart Citations

Utilizing correlated node mobility for efficient DTN routing

Bulut

Geyik

Szymanski

2014

Pervasive and Mobile Computing

View full text Add to dashboard Cite

In a delay tolerant network (DTN), nodes are connected intermittently and the future node connections are mostly not known. Therefore, effective forwarding based on limited knowledge of contact behavior of nodes is challenging. Most of the previous studies assumed that mobility of a node is independent from mobility of other nodes and looked at only the pairwise node relations to decide routing. In contrast, in this paper, we analyze the temporal correlation between the meetings of each node with other nodes and utilize this correlation for efficient routing. We introduce a new metric called conditional intermeeting time (CIT), which computes the average intermeeting time between two nodes relative to a meeting with a third node. Then, we modify existing DTN routing protocols using the proposed metric to improve their performance. Extensive simulations based on real and synthetic DTN traces show that the modified algorithms perform better than the original ones.

show abstract

Section: Simulation Resultsmentioning

confidence: 99%

Section: Conditional Intermeeting Timementioning

confidence: 99%

Section: Conditional Intermeeting Timementioning

confidence: 99%

See 1 more Smart Citation

Utilizing correlated node mobility for efficient DTN routing

Bulut

Geyik

Szymanski

2014

Pervasive and Mobile Computing

View full text Add to dashboard Cite

show abstract

“…Most importantly, these schemes inevitably take a large amount of transmission bandwidth and nodal memory space, which could easily dominate the network resource consumption [15]. Further, they suffer from contention in case of high traffic loads, in which packet drops could result in a significant degradation of performance and scalability.…”

Section: Introductionmentioning

confidence: 99%

Contention aware mobility prediction routing for intermittently connected mobile networks

Elwhishi

Shihada

2013

Wireless Netw

View full text Add to dashboard Cite

Abstract-This paper introduces a novel multi-copy routing protocol, called Predict and Forward (PF), for Delay Tolerant Networks (DTNs), which aims to explore the possibility of taking mobile nodes as message carriers for end-to-end delivery of the messages. With PF, the message forwarding decision is made by manipulating the probability distribution of future intercontact and contact durations based on the network status, including wireless link condition and nodal buffer availability. In particular, PF is based on the observations that the node mobility behavior is semi-deterministic and could be predicted once there is sufficient mobility history information. We implemented the proposed protocol and compared it with a number of existing encounter-based routing approaches in terms of delivery delay, delivery ratio, and the number of transmissions required for message delivery. The simulation results show that the proposed PF outperforms all the counterpart multi-copy encounter-based routing protocols considered in the study.

show abstract

“…Opportunistic Networks (ONs) are a newly emerging type of DTNs systems that can opportunistically exploit unplanned contacts between nodes to share information. In general, there are many recent proposed routing algorithms [3][4][5][6] to address the problem. In the case of limited buffer resources, the node carrying a copy of each message will be quickly saturated its cache, and can not continue to store copies of incoming messages.…”

Section: Introductionmentioning

confidence: 99%

Advanced Optimal Buffer Scheduling Policy in Opportunistic Networks

Liu

et al. 2012

AEF

View full text Add to dashboard Cite

Abstract. Opportunistic Networks (ONs) are the newly emerging type of Delay Tolerant Network (DTN) systems that opportunistically exploit unpredicted contacts among nodes to share information. As with all DTN environments ONs experience frequent and large delays, and an end-to-end path may only exist for a brief and unpredictable time. In this paper, we employ optimal theory to propose a novel buffer management strategy named Optimal Buffer Scheduling Policy (OBSP) to optimize the sequence of message forwarding and message discarding. In OBSP, global optimization considering delivery ratio, transmission delay, and overhead is adopted to improve the overall performance of routing algorithms. The simulation results show that the OBSP is much better than the existing ones.

show abstract

Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case

Cited by 769 publications

References 33 publications

Utilizing correlated node mobility for efficient DTN routing

Utilizing correlated node mobility for efficient DTN routing

Contention aware mobility prediction routing for intermittently connected mobile networks

Advanced Optimal Buffer Scheduling Policy in Opportunistic Networks

Contact Info

Product

Resources

About