
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
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. 361375, March, 2010.  
BibTex  x  
@article{ 10.1109/TMC.2009.137, author = {Hagit Attiya and Alex Kogan and Jennifer L. Welch}, title = {Efficient and Robust Local Mutual Exclusion in Mobile Ad Hoc Networks}, journal ={IEEE Transactions on Mobile Computing}, volume = {9}, number = {3}, issn = {15361233}, year = {2010}, pages = {361375}, doi = {http://doi.ieeecomputersociety.org/10.1109/TMC.2009.137}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Mobile Computing TI  Efficient and Robust Local Mutual Exclusion in Mobile Ad Hoc Networks IS  3 SN  15361233 SP361 EP375 EPD  361375 A1  Hagit Attiya, A1  Alex Kogan, A1  Jennifer L. Welch, PY  2010 KW  Mobile ad hoc networks KW  dining philosophers KW  failure locality. VL  9 JA  IEEE Transactions on Mobile Computing ER   
[1] H. Attiya and J. Welch, Distributed Computing: Fundamentals, Simulations and Advanced Topics, second ed. J. Wiley Interscience, 2004.
[2] J. BarIlan and D. Peleg, “Scheduling Jobs Using Common Resources,” Information and Computation, vol. 125, no. 1, pp. 5261, 1996.
[3] Y. Chen and J.L. Welch, “SelfStabilizing Dynamic Mutual Exclusion for Mobile Ad Hoc Networks,” J. Parallel and Distributed Computing, vol. 65, no. 9, pp. 10721089, 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. 127136, 1992.
[5] M. Choy and A.K. Singh, “Efficient FaultTolerant Algorithms for Distributed Resource Allocation,” ACM Trans. Programming Languages and Systems, vol. 17, pp. 535559, 1995.
[6] E.W. Dijkstra, “Hierarchical Ordering of Sequential Processes,” Acta Informatica, vol. 1, pp. 115138, 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. 230244, 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. 7989, 1985.
[9] E. Gafni and D. Bertsekas, “Distributed Algorithms for Generating LoopFree Routes in Networks with Frequently Changing Topology,” IEEE Trans. Comm., vol. 29, no. 1, pp. 1118, Jan. 1981.
[10] S. Gupta, V. Shankar, and S. Lalwani, “Reliable Multicast MAC Protocol for Wireless LANs,” Proc. Int'l Conf. Comm. (ICC), pp. 9397, 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. 715, 2006.
[13] L. Lamport, “On Interprocess Communication (Part I and II),” Distributed Computing, vols. 1/2, no. 2, pp. 77101, 1986.
[14] N. Linial, “Locality in Distributed Graph Algorithms,” SIAM J. Computing, vol. 21, no. 1, pp. 193201, 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. 268278. 1995.
[16] R. Mellier and J.F. Myoupo, “A Clustering Mutual Exclusion Protocol for MultiHop Mobile Ad Hoc Networks,” Proc. 13th Int'l Conf. Networks (ICON), pp. 250255. 2005.
[17] R. Mellier and J.F. Myoupo, “Fault Tolerant Mutual and KMutual Exclusion Algorithms for SingleHop Mobile Ad Hoc Networks,” Int'l J. Ad Hoc and Ubiquitous Computing, vol. 1, no. 3, pp. 156166, 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. 293308, 1997.
[19] I. Rhee, A. Warrier, and L. Xu, “Randomized Dining Philosophers to TDMA Scheduling in Wireless Sensor Networks,” Technical Report TR200520, Dept. of Computer Science, North Carolina State Univ., 2005.
[20] P.A. Sivilotti, S.M. Pike, and N. Sridhar, “A New Distributed ResourceAllocation Algorithm with Optimal Failure Locality,” Proc. 12th Int'l Conf. Parallel and Distributed Computing and Systems, pp. 524529, 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. 296310, 1994.
[22] J.E. Walter, G. Cao, and M. Mohanty, “A KMutual 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. 585600, 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. 714, 1999.
[25] W. Wu, J. Cao, and M. Raynal, “A DualTokenBased Fault Tolerant Mutual Exclusion Algorithm for MANETs,” Proc. Third Int'l Conf. Mobile AdHoc and Sensor Networks (MSN), pp. 572583, 2007.