The general message ferry route (MFR*) problem and the An-Improved-Route (AIR) scheme

Authors:
Ting Wang;Chor Ping Low
Affiliations:
School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore and Infocomm Research Lab, S2.1 B4-03, Nanyang Technological University, Singapore 639798, Singapore;School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2012

Citing 7
Cited 0

The minimum latency problem

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Proof verification and the hardness of approximation problems

Journal of the ACM (JACM)
Message Ferrying: Proactive Routing in Highly-Partitioned Wireless Ad Hoc Networks

FTDCS '03 Proceedings of the The Ninth IEEE Workshop on Future Trends of Distributed Computing Systems
A message ferrying approach for data delivery in sparse mobile ad hoc networks

Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Virtual data mules for data collection in road-side sensor networks

MobiOpp '10 Proceedings of the Second International Workshop on Mobile Opportunistic Networking
Message ferry route design based on clustering for sparse ad hoc networks

KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part II
Multiple controlled mobile elements (data mules) for data collection in sensor networks

DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In existing studies of message ferry (MF) schemes in wireless ad hoc networks, routes for message ferries are often adopted from the solutions of the Traveling Salesman Problem (TSP) and its variants. In such existing solutions, a message ferry route is often assumed to be a simple cycle which has no repeated vertices nor edges. In this paper, we consider a more general case, where the route is a closed walk. In doing so, we generalize the massage ferry route (MFR) problem as the MFR^* problem, and propose the An-Improved-Route (AIR) scheme to construct routes for the ferry. Simulation proves that the AIR scheme effectively reduces the delay of the MF schemes. Moreover, our studies and schemes in this paper can easily be extended to operation research problems in other related fields, such as transportation and traffic coordination etc.