Meeting connectivity requirements in a wireless multihop network

This paper investigates the connectivity probability of 1-dimensional ad hoc networks in which nodes have random, non-identically distributed locations, this leads to optimization of the number of nodes required. An empirical approach is used. We fit a parametric distribution to the CDF of the maxim...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters 2006-01, Vol.10 (1), p.19-21
Main Authors: Li, J., Andrew, L.L.H., Chuan Heng Foh, Zukerman, M., Neuts, M.F.
Format: Article
Language:English
Subjects:
Ad hoc networks
Applied sciences
Australia Council
Curve fitting
Exact sciences and technology
Floods
Intelligent networks
Probability distribution
Shadow mapping
Spread spectrum communication
Telecommunications
Telecommunications and information theory
Teleprocessing networks. Isdn
Testing
Valuation and optimization of characteristics. Simulation
Wireless sensor networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper investigates the connectivity probability of 1-dimensional ad hoc networks in which nodes have random, non-identically distributed locations, this leads to optimization of the number of nodes required. An empirical approach is used. We fit a parametric distribution to the CDF of the maximum distance between adjacent nodes. Special and extreme cases which are not covered by the empirical approach are treated separately.
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2006.1576556