Proximity problems on moving points
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
The analysis of a simple k-means clustering algorithm
Proceedings of the sixteenth annual symposium on Computational geometry
Approximate Connectivity Graph Generation in Mobile Ad Hoc Radio Networks
ANSS '03 Proceedings of the 36th annual symposium on Simulation
| Hi-index | 0.00 |
Simulation is a widely used technique in the design and evaluation of mobile ad hoc networks. However, time and space constraints can often limit the extent of the size, complexity and detail of the networks that can be simulated. Approximations in the system model can possibly alleviate this problem, but we need to be careful about how much accuracy is compromised when employing them.This paper specifically focuses on one aspect of simulation cost that is incurred in the computation of the connectivity graph that is used to describe what mobile nodes can communicate with whom. Since such a graph is re-computed frequently during the simulation, we explore alternatives to computing this graph exactly and their accuracy in capturing the actual graph properties.We investigate three approximation alternatives to compute graph connectivity, and propose metrics for expressing their deviations from the actual graph. In addition, the graphs generated by these approximations are compared to the original by examining several previously proposed graph measures--the degree distribution, clustering coefficient, shortest path distribution and eigenvalue distribution. Such comparisons are conducted not only with static graphs, but also with dynamically changing graphs that are a consequence of clients moving. Results indicate that these approximations can be quite effective in avoiding repeated calculation of exact graph connectivity.