๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Modeling and Evaluation of a Policy Provisioning Architecture for Mobile Ad-Hoc Networks

โœ Scribed by Kaustubh S. Phanse; Aniket Bhat; Luiz A. DaSilva

Publisher
Springer US
Year
2006
Tongue
English
Weight
855 KB
Volume
14
Category
Article
ISSN
1064-7570

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Geomulticast: architectures and protocol
Geomulticast: architectures and protocols for mobile ad hoc wireless networks
โœ Beongku An; Symeon Papavassiliou ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 312 KB

Geomulticast is a specialized location-dependent multicasting technique, where messages are multicast to some specific user groups within a specific zone. In this paper, we propose architectures and protocols for supporting geomulticast services in a cost effective way and with high message delivery

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

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

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