✦ LIBER ✦

Markov model of link connectivity in mobile ad hoc networks

✍ Scribed by Seok K. Hwang; Dongsoo S. Kim

Publisher: Springer US
Year: 2006
Tongue: English
Weight: 380 KB
Volume: 34
Category: Article
ISSN: 1018-4864
DOI: 10.1007/s11235-006-9025-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Analysis of reactive routing protocols f

Analysis of reactive routing protocols for mobile ad hoc networks in Markov models

✍ Han-xing Wang; Xi Hu; Jian-chao Fang; Wei-jia Jia 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 248 KB

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

Relaying in mobile ad hoc networks: The

Relaying in mobile ad hoc networks: The Brownian motion mobility model

✍ R. Groenevelt; E. Altman; P. Nain 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 420 KB

A Framework for Optimizing End-to-End Co

A Framework for Optimizing End-to-End Connectivity Degree in Mobile Ad-Hoc Networks

✍ Remi Badonnel; Radu State; Olivier Festor; Andre Schaff 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 686 KB

Connectivity in Wireless Ad-hoc Networks

Connectivity in Wireless Ad-hoc Networks with a Log-normal Radio Model

✍ R. Hekmat; P. Van Mieghem 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 346 KB

Model and analysis of path compression f

Model and analysis of path compression for mobile Ad Hoc networks

✍ Xu Jia; Li Qian-mu; Zhang Hong; Liu Feng-yu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 825 KB

## 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