Maintaining information about nearby processors in a mobile environment

Authors:
Faith Ellen;Sivaramakrishnan Subramanian;Jennifer Welch
Affiliations:
-;-;-
Venue:
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Year:
2006

Citing 6
Cited 2

On the time-complexity of broadcast in multi-hop radio networks: an exponential gap between determinism and randomization

Journal of Computer and System Sciences
MACAW: a media access protocol for wireless LAN's

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
A performance comparison of multi-hop wireless ad hoc network routing protocols

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Mobile communications

Mobile communications
Lower bounds for the broadcast problem in mobile radio networks

Distributed Computing
Distributed Token Circulation in Mobile Ad Hoc Networks

IEEE Transactions on Mobile Computing

Deterministic collision free communication despite continuous motion

Ad Hoc Networks
Gossiping in one-dimensional synchronous ad hoc wireless radio networks

Proceedings of the 4th International Workshop on Theoretical Aspects of Dynamic Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of maintaining information about the location of nearby processors in a mobile adhoc network is considered. A new scalable, deterministic algorithm is presented, provided processors can only move along a line. Many open questions and directions for future work are discussed.