Algorithmic theory of random graphs
Random Structures & Algorithms - Special issue: average-case analysis of algorithms
A quantitative comparison of graph-based models for Internet topology
IEEE/ACM Transactions on Networking (TON)
Authoritative sources in a hyperlinked environment
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On k-connectivity for a geometric random graph
Random Structures & Algorithms
A random graph model for massive graphs
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On the minimum node degree and connectivity of a wireless multihop network
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Small-World Phenomenon: An Algorithmic Perspective
The Small-World Phenomenon: An Algorithmic Perspective
Clique is hard to approximate within n1-
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Topology control in wireless ad hoc and sensor networks
ACM Computing Surveys (CSUR)
A Theory of Network Localization
IEEE Transactions on Mobile Computing
Studying vehicle movements on highways and their impact on ad-hoc connectivity
ACM SIGMOBILE Mobile Computing and Communications Review
Decentralised topology control algorithms for connectivity of distributed wireless sensor networks
International Journal of Sensor Networks
Connectivity model of wireless networks via dependency links random graphs
The Journal of Supercomputing
A stability-considered density-adaptive routing protocol in MANETs
Journal of Systems Architecture: the EUROMICRO Journal
| Hi-index | 0.00 |
We lay down the foundations of a new approach for the scalable analysis of ad hoc networks, with special regard to the properties of the random network topology. The proposed methodology is rooted in the theory of random graphs, but we significantly extend the conventional random graph model, as in its original form it would be too "sterile" to capture realistic ad hoc networks. We analyze some fundamental properties of the proposed new, general model and demonstrate that it is capable of solving analysis/design problems which would otherwise be difficult to capture.