Journal ArticleDOI
A mobility-based framework for adaptive clustering in wireless ad hoc networks
A.B. McDonald,Taieb Znati +1 more
Reads0
Chats0
TLDR
A novel framework for dynamically organizing mobile nodes in wireless ad hoc networks into clusters in which the probability of path availability can be bounded is presented, which supports an adaptive hybrid routing architecture that can be more responsive and effective when mobility rates are low and more efficient when Mobility rates are high.Abstract:
This paper presents a novel framework for dynamically organizing mobile nodes in wireless ad hoc networks into clusters in which the probability of path availability can be bounded. The purpose of the (/spl alpha/, t) cluster is to help minimize the far-reaching effects of topological changes while balancing the need to support more optimal routing. A mobility model for ad hoc networks is developed and is used to derive expressions for the probability of path availability as a function of time. It is shown how this model provides the basis for dynamically grouping nodes into clusters using an efficient distributed clustering algorithm. Since the criteria for cluster organization depends directly upon path availability, the structure of the cluster topology is adaptive with respect to node mobility. Consequently, this framework supports an adaptive hybrid routing architecture that can be more responsive and effective when mobility rates are low and more efficient when mobility rates are high.read more
Citations
More filters
Journal ArticleDOI
An application-specific protocol architecture for wireless microsensor networks
TL;DR: This work develops and analyzes low-energy adaptive clustering hierarchy (LEACH), a protocol architecture for microsensor networks that combines the ideas of energy-efficient cluster-based routing and media access together with application-specific data aggregation to achieve good performance in terms of system lifetime, latency, and application-perceived quality.
Journal ArticleDOI
A survey on clustering algorithms for wireless sensor networks
TL;DR: A taxonomy and general classification of published clustering schemes for WSNs is presented, highlighting their objectives, features, complexity, etc and comparing of these clustering algorithms based on metrics such as convergence rate, cluster stability, cluster overlapping, location-awareness and support for node mobility.
Proceedings ArticleDOI
An energy efficient hierarchical clustering algorithm for wireless sensor networks
Seema Bandyopadhyay,E.J. Coyle +1 more
TL;DR: This paper proposes a distributed, randomized clustering algorithm to organize the sensors in a wireless sensor network into clusters, and extends this algorithm to generate a hierarchy of clusterheads and observes that the energy savings increase with the number of levels in the hierarchy.
Journal ArticleDOI
Mobile ad hoc networking: imperatives and challenges
TL;DR: The important role that mobile ad hoc networks play in the evolution of future wireless technologies is explained and the latest research activities in these areas are reviewed, including a summary of MANETs characteristics, capabilities, applications, and design constraints.
Journal ArticleDOI
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks
TL;DR: An on-demand distributed clustering algorithm for multi-hop packet radio networks that takes into consideration the ideal degree, transmission power, mobility, and battery power of mobile nodes, and is aimed to reduce the computation and communication costs.
References
More filters
Dynamic Source Routing in Ad Hoc Wireless Networks.
David B. Johnson,David A. Maltz +1 more
TL;DR: In this article, the authors present a protocol for routing in ad hoc networks that uses dynamic source routing, which adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Book ChapterDOI
Dynamic Source Routing in Ad Hoc Wireless Networks
David B. Johnson,David A. Maltz +1 more
TL;DR: This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing that adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Proceedings ArticleDOI
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
TL;DR: The modifications address some of the previous objections to the use of Bellman-Ford, related to the poor looping properties of such algorithms in the face of broken links and the resulting time dependent nature of the interconnection topology describing the links between the Mobile hosts.
Proceedings ArticleDOI
A performance comparison of multi-hop wireless ad hoc network routing protocols
TL;DR: The results of a derailed packet-levelsimulationcomparing fourmulti-hopwirelessad hoc networkroutingprotocols, which cover a range of designchoices: DSDV,TORA, DSR and AODV are presented.
Book
Queueing Systems. Volume 1: Theory
TL;DR: The purpose of this document is to summarize the main points of the book written by Leonard Kleinrock, titled, ‘Queueing Systems’, which is about queueing systems.