Abstract
We define here a distributed abstract state machine (DASM) [7] of the network or routing layer of mobile ad hoc networks [13]. Such networks require routing strategies substantially different from those used in static communication networks, since storing and updating large routing tables at mobile hosts would congest the network with administration packets very fast. In [1], the hypercubic location service is presented, which considers a very strong definition of fault-tolerance thereby improving state-of-the-art ad hoc routing protocols in several respects. Our goal in modeling the protocols for the distributed location service and the position based routing is twofold. First, we support the definition and validation of wireless communication protocols and implementations based thereon. Second, we feel that the abstract computation model naturally reflects the layering principle of communication architectures in combination with an uncompromisingly local view of the application domain. Thus we can identify fundamental semantic concepts, such as concurrency, reactivity and asynchronism, directly with the related concepts as imposed by the given application context.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Benczúr and T. Lukovszki. 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, Germany, June 2002
D. E. Comer. Internetworking with TCP/IP, Principles, Protocols, and Archi-tectures. Prentice Hall, 2000
R. Eschbach, U. Glässer, R. Gotzhein, M. von Löwis and A. Prinz. Formal Definition of SDL-2000. Journal of Universal Computer Science, 11 (7): 1025–1050, Springer Pub. Co., 2001
J. Gao, L. J. Guibas, J. Hershberger, L. Zhang, and A. Zhu. Geometric Spanner for Routing in Mobile Networks. In ACM Symposium on Mobile Ad Hoc Net-working and Computing (MOBIHOC.01), pages 45–55, 2001
U. Glässer, Y. Gurevich and M. Veanes. High-Level Executable Specification of the Universal Plug and Play Architecture. In Proc. 35th Hawaii International Conference on System Sciences, Software Technology, IEEE Press, 2002
U. Glässer, Y. Gurevich and M. Veanes. An Abstract Communication Model. Microsoft Research Technical Report, MSR-TR-2002-55, May 2002
Y. Gurevich. Evolving Algebras 1993:Lipari Guide. In E. Börger (Ed.), Speci-fication and Validation Methods, Oxford University Press, 1995, 9–36
Y. Gurevich and J. Huggins. The Railroad Crossing Problem: An Experiment with Instantaneous Actions and Immediate Reactions. In H. Kleine Büning (Ed.), Computer Science Logic, LNCS 1092, 266–290, Springer, 1995
D. B. Johnson and D. A. Malz: Dynamic Source Routing in Ad Hoc Wireless Networks. Mobile Computing, Vol.: 353, Kluwer Academic Publishers, 1996.
T. Leighton. Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, 1992.
J. Li et al. A Scalable Location Service for Geographic Ad Hoc Routing. ACM International Conference on Mobile Computing and Networking (Mobi-Com’00), 120–130, 2000.
X.-Y. Li and P.-J. Wan and Y. Wang. Power Efficient and Sparse Spanner for Wireless Ad Hoc Networks. IEEE International Conference on Computer Communications and Networks (ICCCN’01), 2001.
M. Mauve, J. Widmer and H. Hartenstein. A Survey on Position-Based Routing in Mobile Ad-Hoc Networks. IEEE Network, 15(6): 30–39, 2001
V. D. Park and M. S. Corson. A Highly Adaptive Distributed Routing Algo-rithm for Mobile Wireless Networks. IEEE INFOCOM, 1405–1413, 1997
E. Perkins and P. Bhagwar. Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers. ACM SIGCOMM’94, 234–244, 1994
R. Wattenhofer et al. Distributed Topology Control for Power Efficient Op-eraion in Wireless Multihop Ad Hoc Networks, IEEE INFOCOM, 2001
C. Yao. On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems. SIAM Journal on Comp., 11(4): 721–736, 1982
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Benczúr, A., Glässer, U., Lukovszki, T. (2003). Formal Description of a Distributed Location Service for Mobile Ad Hoc Networks. In: Börger, E., Gargantini, A., Riccobene, E. (eds) Abstract State Machines 2003. ASM 2003. Lecture Notes in Computer Science, vol 2589. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36498-6_11
Download citation
DOI: https://doi.org/10.1007/3-540-36498-6_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00624-4
Online ISBN: 978-3-540-36498-6
eBook Packages: Springer Book Archive