The Community for Technology Leaders
RSS Icon
Issue No.03 - March (2010 vol.9)
pp: 361-375
Hagit Attiya , Technion, Haifa
Alex Kogan , Technion, Haifa
Jennifer L. Welch , Texas A&M University, College Station
In a mobile ad hoc network, nodes that are geographically close may need to compete for exclusive access to a shared resource. This paper proposes an abstraction of this problem, called local mutual exclusion; it is an extension to mobile networks of the dining philosophers problem, which has been well studied in static networks. The desirable feature of an algorithm for this problem is having response time and failure locality independent of the total number of nodes, thus providing a scalable and robust solution. The paper presents two algorithms, exhibiting trade-offs between simplicity, failure locality and response time. The first algorithm has two variations, one of which has response time that depends very weakly on the number of nodes in the entire system and is polynomial in the maximum number of neighboring nodes; the failure locality, although not optimal, is small and grows very slowly with system size. The second algorithm has optimal failure locality and response time that is quadratic in the number of nodes. A pleasing aspect of the latter algorithm is that when nodes do not move, it has linear response time, improving on previous results for static algorithms with optimal failure locality.
Mobile ad hoc networks, dining philosophers, failure locality.
Hagit Attiya, Alex Kogan, Jennifer L. Welch, "Efficient and Robust Local Mutual Exclusion in Mobile Ad Hoc Networks", IEEE Transactions on Mobile Computing, vol.9, no. 3, pp. 361-375, March 2010, doi:10.1109/TMC.2009.137
[1] H. Attiya and J. Welch, Distributed Computing: Fundamentals, Simulations and Advanced Topics, second ed. J. Wiley Interscience, 2004.
[2] J. Bar-Ilan and D. Peleg, “Scheduling Jobs Using Common Resources,” Information and Computation, vol. 125, no. 1, pp. 52-61, 1996.
[3] Y. Chen and J.L. Welch, “Self-Stabilizing Dynamic Mutual Exclusion for Mobile Ad Hoc Networks,” J. Parallel and Distributed Computing, vol. 65, no. 9, pp. 1072-1089, 2005.
[4] M. Choy and A.K. Singh, “Tight Lower Bounds on Failure Locality of Distributed Synchronization,” Proc. 30th Ann. Allerton Conf. Comm., Control, and Computing, pp. 127-136, 1992.
[5] M. Choy and A.K. Singh, “Efficient Fault-Tolerant Algorithms for Distributed Resource Allocation,” ACM Trans. Programming Languages and Systems, vol. 17, pp. 535-559, 1995.
[6] E.W. Dijkstra, “Hierarchical Ordering of Sequential Processes,” Acta Informatica, vol. 1, pp. 115-138, 1971.
[7] S. Dolev, S. Gilbert, N.A. Lynch, E. Schiller, A.A. Shvartsman, and J. Welch, “Virtual Mobile Nodes for Mobile Ad Hoc Networks,” Proc. 18th Int'l Conf. Distributed Computing (DISC), pp. 230-244, 2004.
[8] P. Erdõs, P. Frankl, and Z. Füredi, “Families of Finite Sets in Which No Set Is Covered by the Union of $r$ Others,” Israel J. Math., vol. 51, pp. 79-89, 1985.
[9] E. Gafni and D. Bertsekas, “Distributed Algorithms for Generating Loop-Free Routes in Networks with Frequently Changing Topology,” IEEE Trans. Comm., vol. 29, no. 1, pp. 11-18, Jan. 1981.
[10] S. Gupta, V. Shankar, and S. Lalwani, “Reliable Multicast MAC Protocol for Wireless LANs,” Proc. Int'l Conf. Comm. (ICC), pp. 93-97, 2003.
[11] A. Kogan, “Efficient and Robust Local Mutual Exclusion in Mobile Ad Hoc Networks,” master's thesis, Dept. of Computer Science, Technion, 2008.
[12] F. Kuhn and R. Wattenhofer, “On the Complexity of Distributed Graph Coloring,” Proc. 25th Symp. Principles of Distributed Computing (PODC), pp. 7-15, 2006.
[13] L. Lamport, “On Interprocess Communication (Part I and II),” Distributed Computing, vols. 1/2, no. 2, pp. 77-101, 1986.
[14] N. Linial, “Locality in Distributed Graph Algorithms,” SIAM J. Computing, vol. 21, no. 1, pp. 193-201, 1992.
[15] A. Mayer, M. Naor, and L. Stockmeyer, “Local Computations on Static and Dynamic Graphs,” Proc. Third Israeli Symp. Theory of Computing and Systems (ISTCS), pp. 268-278. 1995.
[16] R. Mellier and J.-F. Myoupo, “A Clustering Mutual Exclusion Protocol for Multi-Hop Mobile Ad Hoc Networks,” Proc. 13th Int'l Conf. Networks (ICON), pp. 250-255. 2005.
[17] R. Mellier and J.-F. Myoupo, “Fault Tolerant Mutual and K-Mutual Exclusion Algorithms for Single-Hop Mobile Ad Hoc Networks,” Int'l J. Ad Hoc and Ubiquitous Computing, vol. 1, no. 3, pp. 156-166, 2006.
[18] M. Papatriantafilou and P. Tsigas, “On Distributed Resource Handling: Dining, Drinking and Mobile Philosophers,” Proc. Int'l Conf. Principles of Distributed Systems (OPODIS), pp. 293-308, 1997.
[19] I. Rhee, A. Warrier, and L. Xu, “Randomized Dining Philosophers to TDMA Scheduling in Wireless Sensor Networks,” Technical Report TR-2005-20, Dept. of Computer Science, North Carolina State Univ., 2005.
[20] P.A. Sivilotti, S.M. Pike, and N. Sridhar, “A New Distributed Resource-Allocation Algorithm with Optimal Failure Locality,” Proc. 12th Int'l Conf. Parallel and Distributed Computing and Systems, pp. 524-529, 2000.
[21] Y.-K. Tsay and R. Bagrodia, “An Algorithm with Optimal Failure Locality for the Dining Philosophers Problem,” Proc. Eighth Int'l Workshop Distributed Algorithms (WDAG), pp. 296-310, 1994.
[22] J.E. Walter, G. Cao, and M. Mohanty, “A K-Mutual Exclusion Algorithm for Wireless Ad Hoc Networks,” Proc. ACM Workshop Principles of Mobile Computing (POMC), 2001.
[23] J.E. Walter, J.L. Welch, and N.H. Vaidya, “A Mutual Exclusion Algorithm for Ad Hoc Mobile Networks,” Wireless Networks, vol. 7, no. 6, pp. 585-600, 2001.
[24] J. Wu and H. Li, “On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks,” Proc. Third Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm. (DIALM), pp. 7-14, 1999.
[25] W. Wu, J. Cao, and M. Raynal, “A Dual-Token-Based Fault Tolerant Mutual Exclusion Algorithm for MANETs,” Proc. Third Int'l Conf. Mobile Ad-Hoc and Sensor Networks (MSN), pp. 572-583, 2007.
4 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool