𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Model and analysis of path compression for mobile Ad Hoc networks

✍ Scribed by Xu Jia; Li Qian-mu; Zhang Hong; Liu Feng-yu

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
825 KB
Volume
36
Category
Article
ISSN
0045-7906

No coin nor oath required. For personal study only.

✦ Synopsis

a b s t r a c t

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.

πŸ“œ SIMILAR VOLUMES

Routing with adaptive path and limited f
Routing with adaptive path and limited flooding for mobile ad hoc networks
✍ Yun-Sheng Yen; Hung-Chieh Chang; Ruay-Shiung Chang; Han-Chieh Chao πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 870 KB

Self-healing and optimizing routing techniques (SHORT) a b s t r a c t In MANET, each mobile host can freely move around and the network topology is dynamically changing. To send a datagram, a source host broadcasts a route discovery packet to the network. All neighboring nodes receiving this packe

Modelling incentives for collaboration i
Modelling incentives for collaboration in mobile ad hoc networks
✍ Jon Crowcroft; Richard Gibbens; Frank Kelly; Sven Γ–string πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 252 KB

This paper explores a model for the operation of an ad hoc mobile network. The model incorporates incentives for users to act as transit nodes on multi-hop paths and to be rewarded with their own ability to send traffic. The paper explores consequences of the model by means of fluid-level simulation

Algebraic Modeling of an ad Hoc Network
Algebraic Modeling of an ad Hoc Network for Mobile Computing
✍ Panos A. Patsouris πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 310 KB

We develop an algebraic model of an ad hoc network [9] for mobile computing. The ad hoc network's structure and functionality is based (in our approach) on a pathset algebra. A pathset is the set of all paths in the network having specific source(s) and destination(s). The pathsets' set refers to a

Management of mobile ad hoc networks: in
Management of mobile ad hoc networks: information model and probe-based architecture
✍ Remi Badonnel; Radu State; Olivier Festor πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 585 KB

## Abstract The increasing need for mobility in networks and computing leads to the deployment of wireless networks without fixed infrastructure, called ad hoc networks. These networks raise new challenges towards monitoring and managing them to provide optimal performance. We propose in this paper

Robust throughput and routing for mobile
Robust throughput and routing for mobile ad hoc wireless networks
✍ Izhak Rubin; Runhe Zhang πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 346 KB

a b s t r a c t Flows transported across mobile ad hoc wireless networks suffer from route breakups caused by nodal mobility. In a network that aims to support critical interactive real-time data transactions, to provide for the uninterrupted execution of a transaction, or for the rapid transport of