NDLI: Lowest-ID with adaptive ID reassignment: a novel mobile ad-hoc networks clustering algorithm

Content Provider	IEEE Xplore Digital Library
Author	Gavalas, D. Pantziou, G. Konstantopoulos, C. Mamalis, B.
Copyright Year	2006
Description	Author affiliation: Dept. of Cultural Technol. & Commun., Aegean Univ., Greece (Gavalas, D.)
Abstract	Clustering is a promising approach for building hierarchies and simplifying the routing process in mobile ad-hoc network environments. The main objective of clustering is to identify suitable node representatives, i.e. cluster heads (CHs), to store routing and topology information and maximize clusters stability. Traditional clustering algorithms suggest CH election exclusively based on node IDs or location information and involve frequent broadcasting of control packets, even when network topology remains unchanged. More recent works take into account additional metrics (such as energy and mobility) and optimize initial clustering. However, in many situations (e.g. in relatively static topologies) re-clustering procedure is hardly ever invoked; hence initially elected CHs soon reach battery exhaustion. Herein, we introduce an efficient distributed clustering algorithm that uses both mobility and energy metrics to provide stable cluster formations. CHs are initially elected based on the time and cost-efficient lowest-ID method. During clustering maintenance phase though, node IDs are re-assigned according to nodes mobility and energy status, ensuring that nodes with low-mobility and sufficient energy supply are assigned low IDs and, hence, are elected as CHs. Our algorithm also reduces control traffic volume since broadcast period is adjusted according to the nodes mobility pattern: we employ infrequent broadcasting for relative static network topologies, and increase broadcast frequency for highly mobile network configurations. Simulation results verify that energy consumption is uniformly distributed among network nodes and that signaling overhead is significantly decreased.
Starting Page	5
Ending Page	5
File Size	5029340
Page Count	1
File Format	PDF
ISBN	0780394100
DOI	10.1109/ISWPC.2006.1613559
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2006-01-16
Publisher Place	Thailand
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Ad hoc networks Clustering algorithms Network topology Broadcasting Intrusion detection Routing Stability Nominations and elections Batteries Communication system traffic control
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Connectivity, Energy and Mobility Driven Clustering Algorithm for Mobile Ad Hoc Networks

A Distributed Clustering Algorithm Based on Cluster Stability for Mobile Ad Hoc Networks

A Stable K-hop clustering algorithm for routing in mobile ad hoc networks

A Novel Cluster-Based Routing Algorithm in Ad Hoc Networks

SBCA: Score Based Clustering Algorithm for Mobile AD-hoc Networks

An Enhanced Performance Clustering Algorithm for MANET

A Stable Clustering Algorithm for Highly Mobile Ad Hoc Networks

A clustering algorithm to improve routing stability in mobile ad-hoc networks

Bandwidth-adaptive Clustering for Mobile Ad Hoc Networks

Lowest-ID with adaptive ID reassignment: a novel mobile ad-hoc networks clustering algorithm

Similar Documents

Connectivity, Energy and Mobility Driven Clustering Algorithm for Mobile Ad Hoc Networks

A Distributed Clustering Algorithm Based on Cluster Stability for Mobile Ad Hoc Networks

A Stable K-hop clustering algorithm for routing in mobile ad hoc networks

A Novel Cluster-Based Routing Algorithm in Ad Hoc Networks

SBCA: Score Based Clustering Algorithm for Mobile AD-hoc Networks

An Enhanced Performance Clustering Algorithm for MANET

A Stable Clustering Algorithm for Highly Mobile Ad Hoc Networks

A clustering algorithm to improve routing stability in mobile ad-hoc networks

Bandwidth-adaptive Clustering for Mobile Ad Hoc Networks

Lowest-ID with adaptive ID reassignment: a novel mobile ad-hoc networks clustering algorithm