Abstract:
A prominent source of complexity in the verification of ad hoc network (AHN) protocols is the fact that the number of network topologies grows exponentially with the square of the number of nodes. To combat this instance explosion problem, we present a query-based verification framework for AHN protocols that utilizes symbolic reachability analysis. Specifically we consider AHN nodes of the form P:I, where P is a process and I is an interface: a set of groups, where each group represents a multicast port. Two processes can communicate if their interfaces share a common group. To achieve a symbolic representation of network topologies, we treat process interfaces as variables and introduce a constraint language for representing topologies. Terms of the language are simply conjunctions of connection and disconnection constraints of the form conn(i,j) and dconn(i, j), where i and j are interface variables. Our symbolic reachability algorithm explores the symbolic state space of an AHN in breadth-first order, accumulating topology constraints as multicast-transmit and multicast-receive transitions are encountered. We demonstrate the practical utility of our framework by applying it to the problem of detecting unresolved collisions in the LMAC protocol for sensor networks.
Bibtex Entry:
@inproceedings{SRS:CONCUR09, author = {Anu Singh and C. R. Ramakrishnan and Scott A. Smolka}, title = {Query-Based Model Checking of Ad Hoc Network Protocols}, booktitle = {Concurrency Theory (CONCUR)}, address = {Bologna, Italy}, month = {Aug}, series = {Lecture Notes in Computer Science}, volume = {5710}, pages = {603--619}, publisher = {Springer}, year = {2009} }
| Full Paper: | [pdf] |
C. R. Ramakrishnan
(cram@cs.sunysb.edu)