A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
An optimal algorithm for mutual exclusion in computer networks
Communications of the ACM
A Distributed Mutual Exclusion Algorithm for Mobile Ad-Hoc Networks
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
Probabilistic routing in intermittently connected networks
ACM SIGMOBILE Mobile Computing and Communications Review
Distributed Token Circulation in Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
A fault tolerant mutual exclusion algorithm for mobile ad hoc networks
Pervasive and Mobile Computing
Bubble rap: social-based forwarding in delay tolerant networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
ICDT '08 Proceedings of the 2008 The Third International Conference on Digital Telecommunications
A Simulation Study of Common Mobility Models for Opportunistic Networks
ANSS-41 '08 Proceedings of the 41st Annual Simulation Symposium (anss-41 2008)
A distributed mutual exclusion algorithm over multi-routing protocol for mobile ad hoc networks
International Journal of Parallel, Emergent and Distributed Systems
Token based algorithm for supporting mutual exclusion in opportunistic networks
MobiOpp '10 Proceedings of the Second International Workshop on Mobile Opportunistic Networking
A dual-token-based fault tolerant mutual exclusion algorithm for MANETs
MSN'07 Proceedings of the 3rd international conference on Mobile ad-hoc and sensor networks
| Hi-index | 0.00 |
Opportunistic networks are essentially distributed networks with transient connectivity among nodes. Nodes in opportunistic networks are resource constrained, mobile and opportunistically come in contact with each other. In such a distributed network, nodes may require exclusive access to a shared object or resource. Ensuring freedom from starvation is a challenging problem in opportunistic networks due to limited pairwise connectivity and node failures. In this paper, we review mutual exclusion algorithms proposed for generic mobile ad hoc networks (MANETs) and discuss their applicability to opportunistic networks. Further, we propose a novel token based algorithm and prove its correctness. Simulation results show that our algorithm is communication efficient as compared to other algorithms proposed for generic mobile ad hoc networks. We also propose a timeout based fault detection algorithm that exploits the intercontact time distributions.