Coloured Petri nets: basic concepts, analysis methods and practical use, volume 3
Coloured Petri nets: basic concepts, analysis methods and practical use, volume 3
QoS routing in networks with uncertain parameters
IEEE/ACM Transactions on Networking (TON)
Verisim: Formal Analysis of Network Simulations
IEEE Transactions on Software Engineering
Associativity-Based Routing for Ad Hoc Mobile Networks
Wireless Personal Communications: An International Journal
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
QoS-based Routing in Networks with Inaccurate Information: Theory and Algorithms
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Inquiry and Introspection for Non-deterministic Queries in Mobile Networks
FASE '09 Proceedings of the 12th International Conference on Fundamental Approaches to Software Engineering: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Performance Evaluation of Sensor Medium Access Control Protocol Using Coloured Petri Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
Performance evaluation of a hybrid MAC protocol for wireless sensor networks
Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems
Ad hoc routing protocol verification through broadcast abstraction
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
A state-based model of sensor protocols
Theoretical Computer Science
| Hi-index | 0.00 |
In a mobile ad hoc network (MANET), mobile nodes directly send messages to each other via wireless transmission. A node can send a message to a destination node beyond its transmission range by using other nodes as relay points, and thus a node can function as a router. Typical applications of MANETs include defense systems such as battlefield survivability, and disaster recovery. The research on MANETs originates from part of the Advanced Research Projects Agency (ARPA) project in the 1970s. With the explosive growth of the Internet and mobile communication networks, challenging requirements have been introduced into MANETs and designing routing protocols has become more complex. For a successful application of MANETs, it is very important to ensure that a routing protocol is unambiguous, complete and functionally correct. One approach to ensuring correctness of an existing routing protocol is to create a formal model for the protocol, and analyze the model to determine if indeed the protocol provides the defined service correctly. Colored Petri Nets (CPNs) are a suitable modeling language for this purpose, as it can conveniently express non-determinism, concurrency and different levels of abstraction that are inherent in routing protocols. However, it is not easy to build a CPN model of a MANET because a node can move in and out of its transmission range and thus the MANET's topology (graph) dynamically changes. In this paper, we proposes a topology approximation (TA) mechanism to address this problem of mobility and perform simulations of a typical routing protocol called Ad Hoc On-Demand Distance Vector Routing (AODV). Our simulation results show that our proposed TA mechanism can indeed mimic the dynamically changing graph (mobility) of a MANET.