Search

Clustering in mobile ad hoc network (MANET) play a vital role in improving its basic network performance parameters like routing delay, bandwidth consumption and throughput. One-hop clustering scheme adopts the simple mechanism to make the logical partition of the dynamic network where the network topology changes constantly resulting an unstable clustering. This paper makes a comprehensive survey of some bench-mark one-hop clustering algorithms to understand the research trends in this area. The literature provides the logic of cluster formation for different algorithms in achieving a linked cluster architecture and an intensive simulation survey of their performance on the cluster maintenance aspects such as cluster density, frequency of cluster reelection, frequency of cluster changes by the nodes and the granularity of cluster heads. This paper should facilitate the researchers as well as practitioners in choosing a suitable clustering algorithm on the basis of their formation and maintenance overhead, before any routing scheme is adopted in the mobile ad hoc network. [ABSTRACT FROM AUTHOR]

This paper proposes a differentiated service (DiffServ)-based bandwidth-constrained network layer anycast routing for a mobile IPv6 network. The proposed algorithm comprises three steps: (1) When moving into a new foreign network, the mobile node (MN) chooses a feasible path to easily locate the nearest server that can serve it. To perform path selection, a multi-level list structure (MLLS) is defined and used to store the available bandwidth and hop count of a path. (2) An ingress extended edge router (E-ER) uses the multi-level list algorithm (MLLA) to examine the MLLS for selecting the feasible path with the smallest number of hops that satisfies the MN bandwidth request. (3) The E-ER uses a condition of path change (CPC) variable to determine whether it should optimize the route between itself and the server. Simulation results indicate that the proposed algorithm offers better performance than the existing related approaches in terms of the average running time, request blocking rate, and reducing the control overhead of the simulated network. Copyright © 2010 John Wiley & Sons, Ltd. A DiffServ-based bandwidth constrained anycast routing is used to select a new feasible path satisfying an MN QoS request when the MN changes its point of attachment. Copyright © 2010 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]