GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
Regular Article: The Diameter of Sparse Random Graphs
Advances in Applied Mathematics
A key-management scheme for distributed sensor networks
Proceedings of the 9th ACM conference on Computer and communications security
Worst-Case optimal and average-case efficient geometric ad-hoc routing
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Random Key Predistribution Schemes for Sensor Networks
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
On Random Intersection Graphs: The Subgraph Problem
Combinatorics, Probability and Computing
Revisiting random key pre-distribution schemes for wireless sensor networks
Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks
Asymptotic critical transmission radius for greedy forward routing in wireless ad hoc networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Efficient geographic routing over lossy links in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Random key predistribution for wireless sensor networks using deployment knowledge
Computing - Special Issue on the occasion of the 8th Central European Conference on Cryptography
| Hi-index | 0.00 |
In the article we study important properties of random geometric graphs with randomly deleted edges which are natural models of wireless ad hoc networks with communication constraints. We concentrate on two problems which are most important in the context of theoretical studies on wireless ad hoc networks. The first is how to set parameters of the network (graph) to have it connected. The second is the problem of an effective message transmition i.e. the problem of construction of routing protocols in wireless networks. We provide a thorough mathematical analysis of connectivity property and a greedy routing protocol. The models we use are: an intersection of a random geometric graph with an Erdös-Rényi random graph and an intersection of a random geometric graph with a uniform random intersection graph. The obtained results are asymptotically tight up to a constant factor.