Introduction to algorithms
CCS expressions finite state processes, and three problems of equivalence
Information and Computation
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
The network inhibition problem
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Ad Hoc Wireless Networks: Protocols and Systems
Ad Hoc Wireless Networks: Protocols and Systems
Communication and Concurrency
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Ad Hoc Wireless Networks
On the severity of Braess's paradox: designing networks for selfish users is hard
Journal of Computer and System Sciences - Special issue on FOCS 2001
A framework for security analysis of mobile wireless networks
Theoretical Computer Science - Automated reasoning for security protocol analysis
An Observational Theory for Mobile Ad Hoc Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
Formal Techniques for the Analysis of Wireless Networks
ISOLA '06 Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation
Algorithms and Protocols for Wireless Sensor Networks
Algorithms and Protocols for Wireless Sensor Networks
Towards a Calculus For Wireless Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
A calculus for mobile ad hoc networks
COORDINATION'07 Proceedings of the 9th international conference on Coordination models and languages
A process calculus for mobile ad hoc networks
COORDINATION'08 Proceedings of the 10th international conference on Coordination models and languages
A timed calculus for wireless systems
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Verifying a structured peer-to-peer overlay network: the static case
GC'04 Proceedings of the 2004 IST/FET international conference on Global Computing
IEEE Communications Magazine
| Hi-index | 0.00 |
A simple model of multi-hop communication in ad-hoc networks is considered. Similar models are often adopted for studying energy efficiency and load balancing of different routing protocols. We address an orthogonal question never considered by the networking community: whether, regardless of specific protocols, two networks may be considered as equivalent from the viewpoint of the communication service they provide. In particular, we consider equivalent two networks with identical maximum and minimum inhibiting flow, and prove that this notion of equivalence coincides with a standard trace-based notion of equivalence borrowed from the theory of concurrency. We finally study the computational complexity of the proposed equivalence and discuss possible alternatives.