Fifth International Conference on Computer and Information Technology (CIT'05) Specification and Verification of Position Based Routing for Mobile Ad Hoc System Shanghai, China September 21-September 23 ISBN: 0-7695-2432-X
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CIT.2005.173
This paper focus on the decidability of the position based routing in mobile ad hoc system. Based on the Abstract State Machines theory, we provide a formal model ASM PBRAgent for mobile ad hoc system, on which the position based routing runs as a query. In the result, it is shown that the problem of position based routing is PSPACE-complete when the arity of each node?s outgoing edges has a fixed upper bound, and the Yao-graph topology is an instance; on the other hand, the problem is EXPSPACE-complete if there is no fixed upper bound on the arity.
Citation:
Jinkui Xie, Linpeng Huang, "Specification and Verification of Position Based Routing for Mobile Ad Hoc System," cit, pp.406-409, Fifth International Conference on Computer and Information Technology (CIT'05), 2005 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||