PATM: Priority-based adaptive topology management for efficient routing in ad hoc networks

14Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We propose a distributed and adaptive topology management algorithm, called PATM (Priority-based Adaptive Topology Management), that constructs and maintains a connected backbone topology based on a minimal dominating set of the network. PATM provides a succinct presentation of the network topology to routing protocols, and therefore reduces the control overhead in routing updates. Two optimizations are proposed to further reduce the topological information exchanges among the nodes by piggybacking topology updates in packets transmitted by each node, and adaptively adjusting the topology update intervals. The efficiency of the algorithm is validated by simulations based on DSR (Dynamic Source Routing) protocol. The simulation results demonstrate that PATM not only significantly reduces the routing control overhead, but also substantially improves the network data forwarding performance. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Tan, H., Zeng, W., & Bao, L. (2005). PATM: Priority-based adaptive topology management for efficient routing in ad hoc networks. In Lecture Notes in Computer Science (Vol. 3515, pp. 485–492). Springer Verlag. https://doi.org/10.1007/11428848_64

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free