Journal ArticleDOI
Scalable routing protocols for mobile ad hoc networks
TLDR
The article compares the scalability properties and operational features of the protocols and discusses challenges in future routing protocol designs.Abstract:
The growing interest in mobile ad hoc network techniques has resulted in many routing protocol proposals. Scalability issues in ad hoc networks are attracting increasing attention these days. We survey the routing protocols that address scalability. The routing protocols included in the survey fall into three categories: flat routing protocols; hierarchical routing approaches; GPS augmented geographical routing schemes. The article compares the scalability properties and operational features of the protocols and discusses challenges in future routing protocol designs.read more
Citations
More filters
Range-Free Localization Schemes for Large Scale Sensor Networks 1
TL;DR: This paper presents APIT, a novel localization algorithm that is range-free, and shows that the APIT scheme performs best when an irregular radio pattern and random node placement are considered, and low communication overhead is desired.
Proceedings ArticleDOI
Range-free localization schemes for large scale sensor networks
TL;DR: In this paper, the authors present APIT, a novel localization algorithm that is range-free, which performs best when an irregular radio pattern and random node placement are considered, and low communication overhead is desired.
Journal ArticleDOI
CRAHNs: Cognitive radio ad hoc networks
TL;DR: In this article, spectrum management functionalities such as spectrum sensing, spectrum sharing and spectrum decision, and spectrum mobility are introduced from the viewpoint of a network requiring distributed coordination, and a particular emphasis is given to distributed coordination between CR users through the establishment of a common control channel.
Journal ArticleDOI
A survey of clustering schemes for mobile ad hoc networks
J.Y. Yu,Peter Han Joo Chong +1 more
TL;DR: This article presents a comprehensive survey of recently proposed clustering algorithms, which are classified based on their objectives and descriptions of the mechanisms, evaluations of their performance and cost, and discussions of advantages and disadvantages of each clustering scheme.
Journal ArticleDOI
Survey paper: A survey on routing algorithms for wireless Ad-Hoc and mesh networks
TL;DR: A survey of the routing algorithms proposed for wireless networks is presented, which offers a comprehensive review of various categories such as Geographical, Geo-casting, Hierarchical, Multi-path, Power-aware, and Hybrid routing algorithms.
References
More filters
Proceedings ArticleDOI
Ad-hoc on-demand distance vector routing
C.E. Perkins,E.M. Royer +1 more
TL;DR: An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure and the proposed routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad- hoc networks.
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
GPSR: greedy perimeter stateless routing for wireless networks
Brad Karp,Hsiang-Tsung Kung +1 more
TL;DR: Greedy Perimeter Stateless Routing is presented, a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet's destination to make packet forwarding decisions and its scalability on densely deployed wireless networks is demonstrated.
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.