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

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

doi:10.1109/tnet.2007.897964

Cited by 677 publications

(567 citation statements)

References 34 publications

Supporting

Mentioning

564

Contrasting

Unclassified

Order By: Relevance

“…In the paper [12], the authors make use of a semi-Markov chain to analyze the contact probability of two nodes at equilibrium and also the probability that one node meets another at a specific location within certain time period. Spray and Wait protocol [24] derives the relationship between the number of nodes and the amount of copies in order to get the optimal number of copies to spread. By using the two-state Markov model and geometric distribution, the expected hitting time (to a location) and meeting time (of two nodes) are found for time-variant Community mobility model in [27].…”

Section: Related Workmentioning

confidence: 99%

Analysis for bio-inspired thrown-box assisted message dissemination in delay tolerant networks

Hong

Wang

2011

Telecommun Syst

View full text Add to dashboard Cite

Inspired by biological communication, the strategy of deploying communication and storage equipment called thrown box is proposed to increase message delivery probability and to reduce transmission latency in delay tolerant networks. In this paper, we study the thrown-box assisted message dissemination models by analyzing a few cases on the message delivery rate and related latency distribution. We divide such communications into two processes. We first model the message delivering process among thrown boxes and derive time related message distribution on the boxes. Then we investigate the message collection process to obtain the expected number of informed collectors as a function of time. In addition, we analyze the latency distribution for message collection. Our analysis is derived based on a discrete Markov Chain model. The numerical examples are provided to validate our model and to examine the features of message dissemination under different network scenarios. The factors such as message relay and lifetime are considered. The results show that the tradeoff exists between the number of the boxes and the message lifetime, etc. In summary, our results will help storage management and delay management in DTNs and provide guidelines for applications of search and surveillance.

show abstract

Section: Related Workmentioning

confidence: 99%

Analysis for bio-inspired thrown-box assisted message dissemination in delay tolerant networks

Hong

Wang

2011

Telecommun Syst

View full text Add to dashboard Cite

show abstract

“…Spyropoulos et al [11] propose a multi-copy routing scheme to reduce the overhead of epidemic routing by restricting the number of message copies to L. To choose the minimum L value that meets the specific delay constraint, the global network information such as the number of nodes is required. Our approach in AMR uses a similar approach by restricting the number of messages while maintaining the end-to-end delay close to that of epidemic routing.…”

Section: Related Workmentioning

confidence: 99%

“…Otherwise, the multi-copy routing is used to exploit the multi-copy diversity gain. The parameter, α is a constraint that controls the tradeoff between end-to-end delay and overhead, which is a similar concept with the optimality control parameter used in [11]. We first describe the basic assumptions and ideas that AMR employs (Sect.…”

Section: Adaptive Multi-copy Routing (Amr) Protocolmentioning

confidence: 99%

“…VANETs at low densities may get disconnected due to low node density at the time of day such as night times or low deployment rate at market introduction phase [2,5,6,10,14,15]. As a result, a mobile node can be used as a carrier to deliver messages, i.e., store-and-carry forwarding which is a technique developed by the delay tolerant network (DTN) community [1,11].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

The multi-copy diversity for routing in sparse vehicular ad hoc networks

Yoo¹,

Choi

Kim

2010

Telecommun Syst

View full text Add to dashboard Cite

The need for routing based on store-and-carry forwarding has been motivated in sparse vehicular ad hoc networks (VANETs), since the traditional end-to-end unicast routing is infeasible due to the network disconnection problem. In store-and-carry based routing, the end-to-end message delivery delay is dominated by the store-and-carry procedure rather than the wireless transmission. Therefore, the end-to-end delay in such sparse VANETs can be further reduced by replicating multiple copies of the message to other nodes when possible, i.e., multi-copy routing, to increase the chance of finally finding the destination, which we call this gain as multi-copy diversity. In this paper, we present an analytic framework to evaluate the performance of routing by assessing the multi-copy diversity gain in sparse VANETs. By using this model, we first derive an upper and lower-bound of end-to-end routing delay in sparse VANETs. Our analytic results show that a high level of multi-copy diversity gain is achieved when the network is partially connected, which is in contrast to the conventional expectation that multi-copy routing performs better in severely disconnected networks. Second, we propose a new adaptive multi-copy VANET routing scheme called AMR by exploiting these analytic results. AMR adapts to the local J. Yoo ( ) Computer Science Department, UCLA, 420 Westwood Plaza, Los Angeles, CA, 90095, USA e-mail: joonyoo2@ucla.edu S. Choi School of Electrical Engineering, Kookmin University, Seoul 136-702, Republic of Korea C.-k. Kim School of Electrical Engineering and Computer Science, Seoul National University, Seoul 151-742, Republic of Korea network connectivity and increases the level of multi-copy diversity at significantly reduced routing overhead compared to the well known epidemic routing. We validate the accuracy of our analytic model and the performance of AMR via simulation studies.

show abstract

“…Analytical models can avoid these drawbacks providing a fast and broader performance evaluation. Two classes of analytical models have been proposed for modelling this network dynamics: Markovian models [5,6,7,8,9,10] and deterministic models based 35 on Ordinary Differential Equations (ODEs) [6,11,12,13]. Analytical models require anyway a precise and concise description of the mobility scenario, that usually assume that the inter-contact times distribution between pairs of nodes are exponentially distributed with a given contact rate [5].…”

mentioning

confidence: 99%

Analytical evaluation of the performance of contact-Based messaging applications

et al. 2016

View full text Add to dashboard Cite

Communications in mobile opportunistic networks, instead of using the Internet infrastructure, take place upon the establishment of ephemeral contacts among mobile nodes using direct communication. In this paper, we analytically model the performance of mobile opportunistic networks for contact-based messaging applications in city squares or gathering points, a key challenging topic that is required for the effective design of novel services. We take into account several social aspects such as: the density of people, the dynamic of people arriving and leaving a place, the size of the messages and the duration of the contacts. We base our models on Population Processes, an approach commonly used to represent the dynamics of biological populations. We study their stable equilibrium points and obtain analytical expressions for their resolution.The evaluations performed show that these models can reproduce the dynamics of message diffusion applications. We demonstrate that when the density of people increases, the effectiveness of the diffusion is improved. Regarding the arrival and departure of people, their impact is more relevant when the density of people is low. Finally, we prove that for large message sizes the effectiveness of the epidemic diffusion is reduced, and novel diffusion protocols should be considered.

show abstract

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

Cited by 677 publications

References 34 publications

Analysis for bio-inspired thrown-box assisted message dissemination in delay tolerant networks

Analysis for bio-inspired thrown-box assisted message dissemination in delay tolerant networks

The multi-copy diversity for routing in sparse vehicular ad hoc networks

Analytical evaluation of the performance of contact-Based messaging applications

Contact Info

Product

Resources

About