22-06-2013, 02:45 PM
PROJECT PRESENTATION ON LARGE CONNECTIVITY FOR DYNAMIC RANDOM GEOMETRIC GRAPHS
LARGE CONNECTIVITY.doc (Size: 47 KB / Downloads: 18)
ABSTRACT:
We provide the first rigorous analytical results for the connectivity of dynamic random geometric graphs a model for mobile wireless networks in which vertices move in random directions in the unit torus.
We provide precise asymptotic results for the expected length of the connectivity and disconnectivity periods of the network. We believe that the formal tools developed in this work could be extended to be used in more concrete settings and in more realistic models, in the same manner as the development of the connectivity threshold for static random geometric graphs has affected a lot of research done on ad hoc networks.
EXISTING SYSTEM:
In all these models, the connections in the network are created and destroyed as the vertices move closer together or further apart. Many empirical results have been obtained for connectivity issues and routing performance and the different MANET models. The paper also deals with the problem of maintaining connectivity of mobile vertices communicating by radio, but from an orthogonal perspective to the one in the present paper.
PROPOSED SYSTEM:
The paper deals with the problem of maintaining connectivity of mobile vertices communicating by radio, but from an orthogonal perspective to the one in the present paper: it describes a kinetic data structure to maintain the connected components of the union of unit-radius disks moving in the plane.