A message ferrying approach for data delivery in sparse mobile ad hoc networks

Zhao, Wenrui; Ammar, Mostafa; Zegura, Ellen

doi:10.1145/989459.989483

Cited by 1,051 publications

(647 citation statements)

References 30 publications

Supporting

Mentioning

633

Contrasting

Unclassified

Order By: Relevance

“…Li and Rus [16] consider proactive movement of nodes to deliver messages in a disconnected environment. Zhao et al [26] propose the use of special nodes called message ferries to provide communication services and exploit controlled mobility to improve performance. Burns et al [7] present a multi-objective control approach to determine movement of mobile robotic agents to enhance performance.…”

Section: Related Workmentioning

confidence: 99%

“…DTNs rely on the inherent mobility in the network to deliver packets around frequent and extended network partitions using a store-carry-and-forward paradigm [6], [7], [13], This work was supported in part by the NSF Grant CNS-0519784/CNS-0519881 and DARPA Grant W15P7T-05-C-P213. [22], [26]. While such networks can only support delayinsensitive applications, such as messaging, file transfer, and data dissemination, they enable communication where otherwise there may be none.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Capacity Enhancement using Throwboxes in DTNs

Zhao

Yang

Ammar

et al. 2006

2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems

194

179

View full text Add to dashboard Cite

Abstract-Disruption Tolerant Networks (DTNs) are designed to overcome limitations in connectivity due to conditions such as mobility, poor infrastructure, and short range radios. DTNs rely on the inherent mobility in the network to deliver packets around frequent and extended network partitions using a store-carry-andforward paradigm. However, missed contact opportunities decrease throughput and increase delay in the network. We propose the use of throwboxes in mobile DTNs to create a greater number of contact opportunities, consequently improving the performance of the network. Throwboxes are wireless nodes that act as relays, creating additional contact opportunities in the DTN. We propose algorithms to deploy stationary throwboxes in the network that simultaneously consider routing as well as placement. We also present placement algorithms that use more limited knowledge about the network structure. We perform an extensive evaluation of our algorithms by varying both the underlying routing and mobility models. Our results suggest several findings to guide the design and operation of throwbox-augmented DTNs.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Capacity Enhancement using Throwboxes in DTNs

Zhao

Yang

Ammar

et al. 2006

2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems

194

179

View full text Add to dashboard Cite

show abstract

“…[8,10,11,13]). Most of these works are concentrated on how to disseminate resource information, whereas we study how much benefit the resource information may generate.…”

Section: Relevant Workmentioning

confidence: 99%

Resource Discovery Using Spatio-temporal Information in Mobile Ad-Hoc Networks

Wolfson

Yin

et al. 2005

Web and Wireless Geographical Information Systems

View full text Add to dashboard Cite

Abstract. In this paper we examine the benefit of reports about resources in mobile ad-hoc networks. Each disseminated report represents information about a spatio-temporal event, such as the availability of a parking slot or a cab request. Reports are disseminated by a peer-to-peer broadcast paradigm, in which an object periodically broadcasts the reports it carries to encountered objects. We evaluate the value of resource information in terms of how much time is saved when using the information to discover resources, compared to the case when the information is not used.

show abstract

“…Apart from being a natural adaptive routing problem, AdapTSP has many applications in the setting of message ferrying in ad-hoc networks [ZA03,SRJB03,ZAZ04,ZAZ05,HLS10]. We cite two examples below:…”

Section: Introductionmentioning

confidence: 99%

“…[ZAZ04]). Consider a post-disaster situation, in which usual communication networks have broken down.…”

Section: Introductionmentioning

confidence: 99%

Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems

2017

View full text Add to dashboard Cite

We consider the problem of constructing optimal decision trees: given a collection of tests which can disambiguate between a set of m possible diseases, each test having a cost, and the a-priori likelihood of any particular disease, what is a good adaptive strategy to perform these tests to minimize the expected cost to identify the disease? This problem has been studied in several works, with O(log m)-approximations known in the special cases when either costs or probabilities are uniform. In this paper, we settle the approximability of the general problem by giving a tight O(log m)-approximation algorithm.We also consider a substantial generalization, the adaptive traveling salesman problem. Given an underlying metric space, a random subset S of vertices is drawn from a known distribution, but S is initially unknown-we get information about whether any vertex is in S only when it is visited. What is a good adaptive strategy to visit all vertices in the random subset S while minimizing the expected distance traveled? This problem has applications in routing message ferries in ad-hoc networks, and also models switching costs between tests in the optimal decision tree problem. We give a poly-logarithmic approximation algorithm for adaptive TSP, which is nearly best possible due to a connection to the well-known group Steiner tree problem. Finally, we consider the related adaptive traveling repairman problem, where the goal is to compute an adaptive tour minimizing the expected sum of arrival times of vertices in the random subset S; we obtain a poly-logarithmic approximation algorithm for this problem as well.

show abstract

A message ferrying approach for data delivery in sparse mobile ad hoc networks

Cited by 1,051 publications

References 30 publications

Capacity Enhancement using Throwboxes in DTNs

Capacity Enhancement using Throwboxes in DTNs

Resource Discovery Using Spatio-temporal Information in Mobile Ad-Hoc Networks

Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems

Contact Info

Product

Resources

About