The drinking philosophers problem
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Impact of mobility on distributed computations
ACM SIGOPS Operating Systems Review
MACAW: a media access protocol for wireless LAN's
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Applied operating system concepts
Applied operating system concepts
Location-aided routing (LAR) in mobile ad hoc networks
Wireless Networks
An O(nlog n) Unidirectional Algorithm for the Circular Extrema Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Decentralized extrema-finding in circular configurations of processors
Communications of the ACM
An improved algorithm for decentralized extrema-finding in circular configurations of processes
Communications of the ACM
A Simple, Efficient Algorithm for Maximum Finding on Rings
WDAG '93 Proceedings of the 7th International Workshop on Distributed Algorithms
A Logical Ring Reliable Multicast Protocol for Mobile Nodes
ICNP '99 Proceedings of the Seventh Annual International Conference on Network Protocols
Hop reservation multiple access for multichannel packet radio networks
Computer Communications
Scalable routing strategies for ad hoc wireless networks
IEEE Journal on Selected Areas in Communications
A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks
IEEE Journal on Selected Areas in Communications
Downward communications enhancement using a robust broadcasting mechanism
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
In a mobile ad hoc (multi-hop) wireless network, the logical structure of a ring is likely to become volatile or expensive to maintain over time due to changeable network topology. Additional adverse effects take place when a process joins or leaves the computation in the presence of mobility. This paper presents a distributed algorithm that adapts a ring among mobile nodes to the network dynamics to reflect overall communication efficiency. This is achieved by modifying the ring structure in a localized, mutual exclusive fashion, thereby allowing for concurrent segment-wise modifications to proceed. Remarkably our proposal operates without global knowledge of the logical structure and can be embodied as an underlying protocol stratum that supports transparent deployments of conventional algorithms in mobile environment. Subsequent to correctness proof, simulation results show that our proposal is promising in several regards.