Quantitative analysis for the quality of ad hoc networks

Authors:
Henning Bostelmann;Jörg Roth
Affiliations:
University of Florida, Gainesville, FL;University of Applied Sciences Nuremberg, Nuremberg, Germany
Venue:
ACM SIGMOBILE Mobile Computing and Communications Review
Year:
2006

Citing 7
Cited 0

On k-connectivity for a geometric random graph

Random Structures & Algorithms
On the minimum node degree and connectivity of a wireless multihop network

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks

IEEE Transactions on Mobile Computing
The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks

IEEE Transactions on Mobile Computing
The number of neighbors needed for connectivity of wireless networks

Wireless Networks
The capacity of wireless networks

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates methods to measure the connection-level quality of mobile ad hoc networks. Using an exactly solvable 1-dimensional model, we derive a set of closed formulas that describe the quality of MANETs concerning connectivity, stability, and coverage. These results allow us to predict the minimum number of network nodes for a certain quality level (the "critical mass") without the need for numerical simulations.