Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Evolving algebras 1993: Lipari guide
Specification and validation methods
A scalable location service for geographic ad hoc routing
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Geometric spanner for routing in mobile networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Internetworking with TCP/IP: Principles, Protocols, and Architecture
Internetworking with TCP/IP: Principles, Protocols, and Architecture
The Railroad Crossing Problem: An Experiment with Instantaneous Actions and Immediate Reactions
CSL '95 Selected Papers from the9th International Workshop on Computer Science Logic
High-Level Executable Specification of the Universal Plug and Play Architecture
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
A survey on position-based routing in mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
Formal description and analysis of a distributed location service for mobile ad hoc networks
Theoretical Computer Science - Abstract state machines and high-level system design and analysis
ASM and SDL models of geographic routing in mobile ad hoc networks
SDL'05 Proceedings of the 12th international conference on Model Driven
Hi-index | 0.00 |
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.