Formal description and analysis of a distributed location service for mobile ad hoc networks

Theoretical Computer Science

Volumn 336, Issue 2, 2005, Pages 285-309

  Glässer, Uwe ^a   Gu, Qian Ping ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Distributed abstract state machine; Geographic routing; Location service; Logical topology; Mobile ad hoc networks; Wireless communication

Indexed keywords

COMPUTER NETWORKS; ELECTRIC NETWORK TOPOLOGY; FAULT TOLERANT COMPUTER SYSTEMS; FORMAL LANGUAGES; INFORMATION ANALYSIS; MOBILE TELECOMMUNICATION SYSTEMS; NETWORK PROTOCOLS; PACKET NETWORKS; ROUTERS; SELF ORGANIZING MAPS; WIRELESS TELECOMMUNICATION SYSTEMS;

DISTRIBUTED ABSTRACT STATE MACHINES (DASM); GEOGRAPHIC ROUTING; LOCATION SERVICE; LOGICAL TOPOLOGY; MOBILE AD HOC NETWORKS; WIRELESS COMMUNICATION;

COMPUTER HARDWARE DESCRIPTION LANGUAGES;

EID: 18144430647     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.11.009     Document Type: Conference Paper

References (31)

1. Asml for microsoft. net. http://www.research.microsoft.com/foundations/asml.
2. S. Basagni, I. Chlamtac, V. Syrotiuk, B. Woodward, A distance routing effect algorithm for mobility (DREAM), in: Proc. 4th Ann. ACM/IEEE Internat. Conf. on Mobile Computing and Networking (MOBICOM), 1998, pp. 76-84.
3. A. Benczur, U. Glässer, T. Lukovszki, Formal description of a distributed location service for ad hoc mobile networks, in: Abstract State Machines 2003 - Advances in Theory and Practice, Lecture Notes in Computer Science, Vol. 2589, Springer, Berlin, 2003, pp. 204-217.
4. A. Benczúr, T. Lukovski. A degree O(log log n) fault tolerant distributed location service for geographic ad-hoc routing, Technical Report, TR-RI-02-231, Heinz Nixdorf Institute, Paderborn University, Germany, June 2002.
5. E. Börger The origins and the development of the ASM method for high level system design and analysis J. Universal Comput. Sci. 8 1 2003 2 74
6. E. Börger, and R. Stärk Abstract State Machines A Method for High-Level System Design and Analysis 2003 Springer Berlin
7. D.E. Comer Internetworking with TCP/IP, Principles, Protocols, and Architectures 2000 Prentice Hall Englewood Cliffs, NJ
8. S.R. Das, R. Castaneda, J. Yan, Simulation based performance evaluation of mobile ad hoc network routing protocols, ACM/Baltzer Mobile Networks and Appl. J., July 2000, pp. 179-189.
9. J. Ellsberger, D. Hogrefe, A. Sarma, SDL - Formal Object-Oriented Language for Communication Systems, Prentice Hall, Europe, 1997.
10. R. Eschbach, U. Glässer, R. Gotzhein, M. von Löwis, A. Prinz, Formal definition of SDL-2000 - compiling and running SDL specifications as ASM models, J. Universal Comput. Sci. 7(11): 1025-1050, Springer Pub. Co., Nov. 2001.
11. J. Gao, L.J. Guibas, J. Hershberger, L. Zhang, A. Zhu, Geometric spanner for routing in mobile networks, in: Proc. ACM Symp. on Mobile Ad Hoc Networking and Computing, 2001, pp. 45-55.
12. S. Giordano, M. Hamdi, The virtual home page region, Technical Report, 1999.
13. U. Glässer, Q. Gu, Formal description and analysis of a distributed location service for mobile ad hoc networks, Technical Report, SFU-CMPT TR-12, October 2003.
14. U. Glässer, Y. Gurevich, and M. Veanes Abstract Communication Model for Distributed Systems IEEE Trans. on Software Engineering 30 2004 458 472
15. U. Glässer, M. Veanes, Universal plug and play machine models: modeling with distributed abstract state machines, in: B. Kleinjohann, K.H. Kim, L. Kleinjohann, A. Rettberg (Eds.), Design and Analysis of Distributed Embedded Systems, IFIP 17th World Computer Congress - TC10 Stream on Distributed and Parallel Embedded Systems (DIPES 2002), IFIP Conference Proceedings 219, Kluwer Academic Publishers, 2002.
16. J. Gross, and J. Yellen Graph Theory and Its Applications 1998 CRC Press Boca Raton
17. Y. Gurevich Evolving algebras 1993 Lipari guide E. Börger Specification and Validation Methods 1995 Oxford University Press Oxford 9 36
18. Y. Gurevich, J. Huggins, The railroad crossing problem: an experiment with instantaneous actions and immediate reactions, in: H. Kleine Büning (Ed.), Computer Science Logic, Lecture Notes in Computer Science 1092, 1995, 266-290.
19. Z. Haas, and M. Pearlman The performance of query control schemes for the zone routing protocol IEEE/ACM Trans. on Networking 9 4 2001 427 438
20. Z.J. Haas, and B. Liang Ad hoc mobility management with uniform quorum systems IEEE/ACM Trans. on Networking 7 2 1999 228 240
21. D. Johnson, and D. Maltz Mobile Computing 1996 Kluwer Academic Publishers Dordrecht
22. J. Li, J. Jannotti, D.S.J. De Couto, D.R. Karger, R. Morris, A scalable location service for geographic ad hoc routing, in: Proc. of the 6th Ann. ACM/IEEE Internat. Conf. on Mobile Computing and Networking (MOBICOM), 2000, pp. 120-130.
23. X.-Y. Li, P.-J. Wang, Y. Wang, Power efficient and sparse spanner for wireless ad hoc networks, in: Proc. of IEEE Internat. Conf. on Computer Communications and Networks, 2001.
24. M. Mauve, J. Widmer, and H. Hartenstein A survey on position-based routing in mobile ad-hoc networks IEEE Network 15 2001 30 39
25. R. Morris, J. Jannotti, F. Kaashoek, J. Li, D.J. De Couto, Carnet: a scalable ad hoc wireless network system, in: Proc. of the 9th ACM SIGOPS European Workshop: Beyond the PC: New Challenges for the Operating System, 2000.
26. V. Park, M. Corson, A highly adaptive distributed routing algorithm for mobile wireless networks, in: Proc. IEEE INFOCOM, 1997.
27. C. Perkins, P. Bhagwat, Highly dynamic destination-sequenced distance-vector routing (dsdv) for mobile computers, Comput. Commun. Rev. 1994, pp. 234-244.
28. C. Perkins, E. Royer, Ad-hoc on-demand distance vector routing, in: Proc. of the 2nd Workshop on Mobile Computing Systems and Applications, February 1999, pp. 90-100.
29. I. Stojmenovic, Home agent based location update and destination search schemes in ad hoc networks, Technical report, Department of Computer Science, University of Ottawa, TR-99-10, 1999.
30. R. Wattenhofer, et al., Distributed topology control for power efficient operation in wireless multihop ad hoc networks, in: Proc. of IEEE INFOCOM, 2001.
31. A.C. Yao On constructing minimum spanning trees in k -dimensional spaces and related problems SIAM J. Computing 11 4 1982 721 736