Proceedings Article10.1109/NETWKS.2010.5624941
A new clustering algorithm for MANETs
Kaouther Drira,Hamamache Kheddouci +1 more
- 09 Nov 2010
- pp 1-6
4
TL;DR: In this paper, a methodology for building distributed and dynamic virtual topology in ad hoc networks based on the concept of dominating sets is proposed, where dominating nodes are used to form a tree structure inside the clusters where the root of the tree is the cluster-head.
read more
Abstract: Mobile Ad hoc Network (MANET) is the cooperative engagement of a collection of wireless mobile nodes without the support of any centralized access point or existing infrastructure. The use of virtual topologies is a good alternative to build wireless multi-hop networks. It aims to maintain a topology that optimizes broadcasting or network performances. The problem is to determine an appropriate topology for ad hoc networks. This paper proposes a methodology for building distributed and dynamic virtual topology in ad hoc networks based on the concept of dominating sets. Dominating nodes are used to form a tree structure inside the clusters where the root of the tree is the cluster-head. The idea is to form a clustered network over which communication protocol can be efficiently designed.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Clustering Based Energy Efficient Algorithm Using Max-Heap Tree for MANET
Madhvi Saxena,Neelam Phate,K.J. Mathai,Murtaza Abbas Rizvi +3 more
- 07 Apr 2014
TL;DR: An attempt is made to develop an energy aware algorithm based on clustering for longer life of MANET, which would be an energy efficient clustering algorithm that uses both scalability and energy metric for cluster layout.
26
A Stable K-hop clustering algorithm for routing in mobile ad hoc networks
Badreddine Guizani,Béchir El Ayeb,Abderrafiaa Koukam +2 more
- 01 Aug 2015
TL;DR: The proposed SKCA is a stable K-hop clustering algorithm with the view to provide a stable cluster topology and reduce the control overhead, and introduces a novel two-round cluster-head election that reduces the diffusion of the cluster information in theK-hop neighborhood.
9
A Review: Novel Protocol for Clumping inMobile Ad hoc Networks
TL;DR: The aim of this research work is to enhance the network lifetime, proper balancing the power consumption among mobile nodes and increase the throughput of the networks.
•Journal Article
An Optimization Algorithm for 802.11e EDCA Mechanism
TL;DR: Simulation results show that this optimization algorithm can improve the throughput of traffic, in the growing number of stations, the throughput performance of high and low priority traffics is stable, all kinds of traffic reach the purpose of fairly using channel resources.
1
References
The node distribution of the random waypoint mobility model for wireless ad hoc networks
TL;DR: In this paper, the authors presented a detailed analytical study of the spatial node distribution generated by random waypoint mobility and derived an exact equation of the asymptotically stationary distribution for movement on a line segment and an accurate approximation for a square area.
1.2K
Design and analysis of an MST-based topology control algorithm
Ning Li,Jennifer C. Hou,Lui Sha +2 more
- 09 Jul 2003
TL;DR: This paper analytically prove several important properties of LMST: 1) the topology derived under LMST preserves the network connectivity; 2) the node degree of any node in the resulting topology is bounded by 6; and 3) the bottomology can be transformed into one with bidirectional links after removal of all unidirectional Links.
A Dominating-Set-Based Routing Scheme in Ad Hoc Wireless Networks
TL;DR: A simple and efficient distributed algorithm for calculating connected dominating set in ad hoc wireless networks, where connections of nodes are determined by their geographical distances and an update/recalculation algorithm for theconnected dominating set when the topology of the ad hoc Wireless Network changes dynamically.
355
Ad Hoc Wireless Networking
Xiuzhen Cheng,Xiao H. Huang,Ding-Zhu Du +2 more
- 01 Jan 2004
TL;DR: A Lifetime-Optimizing approach to Routing Messages in Ad-hoc Networks and the Role of Proactivity in Wireless and Ad Hoc Networks is studied.
173
Clustering algorithms for ad hoc wireless networks
Yuanzhu Peter Chen,Arthur L. Liestman,Jiangchuan Liu +2 more
- 01 Jan 2004
TL;DR: This work surveys several clustering algorithms, concentrating on those that are based on graph domination, and describes results that show that building clustered hierarchies is affordable and that clusters can be used to build virtual backbones to enhance network quality of service.