Scheduling mobile nodes for cooperative data transport in sensor networks

Authors:
Reza Moazzez-Estanjini;Jing Wang;Ioannis Ch. Paschalidis
Affiliations:
Center for Information and Systems Engineering, Boston University, Boston, MA;Center for Information and Systems Engineering, Boston University, Boston, MA;Department of Electrical and Computer Engineering and Division of Systems Engineering, Boston University, Boston, MA
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2013

Citing 11
Cited 0

Probabilistic and worst case analyses of classical problems of combinatorial optimization in euclidean space

Mathematics of Operations Research
Transformation of the generalized traveling-salesman problem into the standard traveling-salesman problem

Information Sciences: an International Journal
An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs

Information Sciences: an International Journal
Smart-tag based data dissemination

WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet

Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
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
DakNet: Rethinking Connectivity in Developing Nations

Computer
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
Hedonic Coalition Formation for Distributed Task Allocation among Wireless Agents

IEEE Transactions on Mobile Computing
The capacity of wireless networks

IEEE Transactions on Information Theory
Capacity and delay tradeoffs for ad hoc mobile networks

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Message ferrying has been shown to be an effective approach to support routing in sparse ad hoc or sensor networks. Considering a generic network model where each node in the network wishes to send data to some (or possibly all) other nodes with known (and possibly different) rates, we propose three schemes enabling multiple ferries to coordinate in collecting and delivering the data. We analyze the performance of each scheme and establish bounds on the average and worst-case delay. The latter bounds are useful in offering performance guarantees. We establish that under one of our schemes, constant per-node throughput is achievable within constant maximum (worst-case) delay as the network size grows. Using simulation, we compare our proposed schemes with an alternative, the Ferry Relaying algorithm proposed earlier in the literature. The results show that our schemes perform better and provide guidance on which scheme to use given performance preferences and the number of available ferries.