Relocation analysis of stabilizing mac algorithms for large-scale mobile ad hoc networks (Extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5804 LNCS, Issue , 2009, Pages 203-217

  Leone, Pierre ^a   Papatriantafilou, Marina ^b   Schiller, Elad M ^b  

^a UNIVERSITY OF GENEVA   (Switzerland)

^b CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION EFFICIENCY; DATA PROPAGATION; EVOLVING GRAPHS; EXTENDED ABSTRACTS; FAULT-TOLERANT ALGORITHMS; GUARANTEED THROUGHPUTS; IMPOSSIBILITY RESULTS; INTERLEAVING MODEL; LOWER BOUNDS; MAC ALGORITHMS; MEDIA ACCESS CONTROL; MOBILE NODES; WIRELESS BROADCAST;

ACCESS CONTROL; ALGORITHMS; COMMERCE; MOBILE AD HOC NETWORKS; NETWORK PROTOCOLS; SENSOR NETWORKS; TELECOMMUNICATION NETWORKS; THROUGHPUT; WIRELESS SENSOR NETWORKS;

AD HOC NETWORKS;

EID: 77049099835     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-05434-1_21     Document Type: Conference Paper

References (23)

1. Abramson, N.: Development of the ALOHANET. IEEE Information Theory 31(2), 119-123 (1985)
2. Angluin, D., Aspnes, J., Fischer,M.J., Jiang, H.: Self-stabilizing population protocols. ACM Transactions on Autonomous and Adaptive Systems (TAAS) 3(4) (2008)
3. Avin, C., Koucký, M., Lotker, Z.: How to explore a fast-changing world (cover time of a simple random walk on evolving graphs). In: Aceto, L., Damg̊ard, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 121-132. Springer, Heidelberg (2008)
4. Bettstetter, C.: Smooth is better than sharp: a random mobility model for simulation of wireless networks. In: Meo, M., Dahlberg, T.A., Donatiello, L. (eds.) MSWiM, pp. 19-27. ACM, New York (2001)
5. Díaz, J., Mitsche, D., Pérez-Giménez, X.: On the connectivity of dynamic random geometric graphs. In: SODA 2008, pp. 601-610 (2008)
6. Dolev, S.: Self-Stabilization. MIT Press, Cambridge (2000)
7. Efraimidis, P., Spirakis, P.G.: Weighted random sampling with a reservoir. Inf. Process. Lett. 97(5), 181-185 (2006)
8. Ferreira, A.: Building a reference combinatorial model for MANETs. Network 18(5), 24-29 (2004)
9. Fullmer, C.L., Garcia-Luna-Aceves, J.J.: Solutions to hidden terminal problems in wireless networks. In: SIGCOMM, pp. 39-49 (1997)
10. Haas, Z.J., Deng, J.: Dual busy tone multiple access (DBTMA)-a multiple access control-scheme for ad hoc networks. IEEE Transactions on Communications 50(6), 975-985 (2002)
11. Herman, T., Tixeuil, S.: A distributed TDMA slot assignment algorithm for wireless sensor networks. In: Nikoletseas, S.E., Rolim, J.D.P. (eds.) ALGOSENSORS 2004. LNCS, vol. 3121, pp. 45-58. Springer, Heidelberg (2004)
12. Jarry, A., Lotker, Z.: Connectivity in evolving graph with geometric properties. In: Basagni, S., Phillips, C.A. (eds.) DIALM-POMC, pp. 24-30. ACM, New York (2004)
13. Jhumka, A., Kulkarni, S.S.: On the design of mobility-tolerant TDMA-based media access control (MAC) protocol for mobile sensor networks. In: Janowski, T., Mohanty, H. (eds.) ICDCIT 2007. LNCS, vol. 4882, pp. 42-53. Springer, Heidelberg (2007)
14. Leone, P., Papatriantafilou, M., Schiller, E.M.: Relocation adaptive and stable MAC algorithm for large-scale and highly mobile ad hoc networks. Technical Report 2008:23, Department of Computer Science, and Engineering, Chalmers University of Technology (Sweden) (September 2008)
15. Luby, M.: Removing randomness in parallel computation without a processor penalty. J. Comput. Syst. Sci. 47(2), 250-286 (1993)
16. Penrose, M.D.: Random Geometric Graphs. Oxford University Press, Oxford (2003)
17. Schmidt, W.G.: Satellite time-division multiple access systems: Past, present and future. Telecommunications 7, 21-24 (1974)
18. Schneider, J., Wattenhofer, R.: Coloring Unstructured Wireless Multi-Hop Networks. In: 28th ACM Symposium on Principles of Distributed Computing (PODC), Calgary, Canada (August 2009)
19. Takagi, H., Kleinrock, L.: Throughput analysis for persistent CSMA systems. IEEE Transactions on Communications 33(7), 627-638 (1985)
20. Tobagi, F.A., Kleinrock, L.: Packet Switching in Radio Channels: Part II-The Hidden Terminal Problem in CSMA and the Busy-Tone Solution. IEEE Transactions on Communications 23(12), 1417-1433 (1975)
21. Vizing, V.G.: On an estimate of the chromatic class of a p-graph. Diskret. Analiz 3(7), 25-30 (1964)
22. Wattenhofer, R.:Ad hoc and sensor networks (hs 2008). Lecture notes/slides (October 2008), http://www.dcg.ethz.ch/lectures/hs08/asn/lecture/6/ chapter06mediaaccess.ppt
23. Yuichi Sudo, J.N., Yamauchi, Y., Ooshita, F., Kakugawa, H., Masuzawa, T.: Loosely-stabilizing Leader Election in Population Protocol Model. In: SIROCCO (to appear, 2009)