Conference Paper

An efficient management algorithm for clustering in mobile ad hoc network

DOI: 10.1145/1163653.1163660 Conference: Proceedings of the 1st ACM Workshop on Performance Monitoring and Measurement of Heterogeneous Wireless and Wired Networks, PM2HW2N 2006, Terromolinos, Spain, October 2, 2006
Source: DBLP


Clustering of mobile nodes among separate domains has been proposed as an efficient approach to mimic the operation of the fixed infrastructure and manage the resources in multi-hop networks. In this work, we propose a new clustering algorithm, namely Efficient Management Algorithm for Clustering (EMAC) based on weighting parameters. The goals are yielding low number of clusters, maintaining stable clusters, minimizing the number of invocations for the algorithm and maximizing lifetime of mobile nodes in the system. Through simulations we have compared the performance of our algorithm with that of WCA in terms of the number of clusters formed and number of states transitions on each clusterhead. The results demonstrate the superior performance of the proposed algorithm.

Download full-text


Available from: Michel Kadoch
  • Source
    • "The algorithm chooses a node as a clusterhead if the node is expected to from a cluster of proper size based on battery power and the movement distance of the node. Bazzal et al. proposed a method to reduce the number of clusters by selecting a node with more neighbors as a clusterhead [7]. Chinara et al. proposed a clustering algorithm to extend the life time of the network [8]. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Clustering is a method for hierarchical management of a network. Especially, clustering is often used in MANETs. Johnen et al. proposed a self-stabilizing clustering algorithm which treats a MANET as a vertex-weighted graph. The algorithm has autonomous adaptability against topology changes and weight changes, while it does not consider the stability of clusters. In this paper, we present a weight assignment method that reflects the mobility of each node to its weight so that the stability of clusters is improved. The proposed method makes nodes that move together maintain a cluster by considering mobility groups of nodes. Simulation results show that the proposed method has improved the number of changes in clusterheads of the existing method by 50%.
    Preview · Conference Paper · Mar 2011
  • Source
    • "Routing in [4] is based on nodes physical position, requiring GPS or another positioning system. [11] is proven to be robust to sensor failures in static networks but it was observed by the same authors that the introduction of mobility creates problems that are hard to solve while keeping the solution scalable, mainly due to implicit hard coupling between single nodes and virtual coordinates which is problematic when wireless links are dynamic. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Sensor networks are usually composed by spatially distributed devices able to monitor physical or environmental conditions (pressure, temperature, motion, etc.). This kind of networks were originally built with the idea of transmitting elementary information to external sinks for further processing and querying. Nowadays, the growth of sensors memory and computational capability together with the significant reduction of energy consumptions have changing the potential of sensor networks allowing in-network storage and processing. The W-Grid infrastructure follows a Data Centric approach that indexes data according to any number of attributes so that it is possible to query events of interest through multi-dimensional range queries. Differently from existing Data Centric solutions W-Grid does not use either sensors physical position (i.e. GPS) nor estimation of their positions. For this reason W-Grid can be applied to a wider number of scenarios than existing solutions, as it works both indoor and outdoor, and can be easily suitable to other kind of ad-hoc networks, such as mesh networks and wireless community networks. In this paper we describe how W-Grid is able to efficiently managing and querying data in wireless sensor networks and we report, by means of an extensive number of simulations, several performance measures of its efficiency in comparison with a well-know competitor solution in literature.
    Full-text · Conference Paper · Oct 2008
  • Source
    • "The Efficient Management Algorithm for Clustering (EMAC) [9] "
    [Show abstract] [Hide abstract]
    ABSTRACT: Mobile ad-hoc network (MANET) is a type of communication network which is used for data communication between a group of mobile nodes using wireless channels. Clustering has evolved as an important research topic in MANETs as it improves the system performance of large MANETs. Clustering is a process that divides the network into interconnected substructures, called clusters. Each cluster has a cluster head as coordinator within the substructure. In this paper, we propose a new clustering protocol for MANET. The proposed algorithm is a very quick clustering algorithm and creates minimum clusters with maximum member node in each cluster. The simulation results show that the proposed algorithm provides better performance in terms of the number of formed clusters and average number of transition (state change) on cluster heads when compared to that of other weight based algorithms such as weighted clustering algorithm (WCA).
    Full-text · Conference Paper · Sep 2008
Show more