Model and analysis of path compression for mobile Ad Hoc networks

Authors:
Xu Jia;Li Qian-mu;Zhang Hong;Liu Feng-yu
Affiliations:
College of Computer Science and Technology, Nanjing University of Science and Technology, Nanjing 210094, China;College of Computer Science and Technology, Nanjing University of Science and Technology, Nanjing 210094, China;College of Computer Science and Technology, Nanjing University of Science and Technology, Nanjing 210094, China;College of Computer Science and Technology, Nanjing University of Science and Technology, Nanjing 210094, China
Venue:
Computers and Electrical Engineering
Year:
2010

Citing 6
Cited 1

Capacity of Ad Hoc wireless networks

Proceedings of the 7th annual international conference on Mobile computing and networking
SHORT: self-healing and optimizing routing techniques for mobile ad hoc networks

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
A Proximity-Based Dynamic Path Shortening Scheme for Ubiquitous Ad Hoc Networks

ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
A framework for self-healing and optimizing routing techniques for mobile ad hoc networks

Wireless Networks
A Stability Module of Path Compression Techniques for On-Demand Ad-hoc Routing Protocols

ISBIM '08 Proceedings of the 2008 International Seminar on Business and Information Management - Volume 01
Neighbor-aware optimizing routing for wireless ad hoc networks

UIC'07 Proceedings of the 4th international conference on Ubiquitous Intelligence and Computing

Only the short die old: route optimization in MANETs by dynamic subconnection shrinking

Proceedings of the 6th International Wireless Communications and Mobile Computing Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

Path compression techniques are efficient on-demand routing optimizing techniques for mobile Ad Hoc networks. However, there is no efficient model for path compression techniques. This paper analyzed the principles and characteristics of path compression algorithms and proposed dynamic model which provided theoretical basis to improve or propose path compression algorithms. This model took the mobility and expansibility of Ad Hoc networks into account and was efficient to analyze or evaluate path compression algorithms. The quantitative relationship and probability expression for pivotal compression events were given based on the model. The simulation results of SHORT (self-healing and optimizing routing techniques) and PCA (path compression algorithm) show that it is a correct and efficient dynamic model for path compression. Finally, some suggestions and application scenarios about the model were proposed.