Published January 2006
| Published
Journal Article
Open
Meeting connectivity requirements in a wireless multihop network
Abstract
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.
Additional Information
© 2006 IEEE. Manuscript received June 2, 2005. The associate editor coordinating the review of this letter and approving it for publication was Dr. Aleksandar Kolarov. This research has been supported by the Australian Research Council.Attached Files
Published - 01576556.pdf
Files
01576556.pdf
Files
(257.3 kB)
Name | Size | Download all |
---|---|---|
md5:666136e40ee9d0cb5356e4e89a2a3549
|
257.3 kB | Preview Download |
Additional details
- Eprint ID
- 80214
- Resolver ID
- CaltechAUTHORS:20170810-134301150
- Australian Research Council
- Created
-
2017-08-11Created from EPrint's datestamp field
- Updated
-
2021-11-15Created from EPrint's last_modified field