Distributed Domain Generation Based on the Network Environment Characteristics for Dynamic Ad-Hoc Networks
Abstract
Ad hoc networks are very important for scenarios where there is not fixed network infrastructure. These scenarios may appear both in the military and the commercial world. Even though there is much advancement in the area of these networks, the main drawback is that ad hoc networks do not scale well because the existing protocols (e.g., MAC, routing, security) cannot tolerate their dynamics. A remedy to this problem could exist if these protocols were applied in hierarchical manner. The hierarchy generation in these dynamic environments can be advantageous since the numerous topological changes can be tolerated easier and the various protocols can perform better when dealing with smaller groups of nodes. On the other hand, hierarchy has to be generated carefully in order to be beneficial for the network otherwise it may harm it, because of the imposed maintenance overhead. The weakness of the existing network clustering algorithms is that they do not take into consideration the dynamics of the network environment, so in cases of increased mobility their overhead may deteriorate network performance instead of improving it. In this paper we present a new dynamic distributed clustering (DDC) algorithm. The basic characteristic of this algorithm is that it takes into consideration the network dynamics for the generation of robust and efficient clusters. DDC can be applied in highly mobile networks and we show that it presents better scalability and robustness characteristics from well known existing clustering algorithms.
Document Details
- Document Type
- Technical Report
- Publication Date
- Dec 01, 2004
- Accession Number
- ADA432323
Entities
People
- John Baras
- Kyriakos Manousakis
Organizations
- University of Maryland