Bibliographic Details
| Title: |
On the minimum hop count and connectivity in one-dimensional ad hoc wireless networks. |
| Authors: |
Nelson Antunes1, Gonçalo Jacinto2, António Pacheco3 |
| Source: |
Telecommunication Systems. Oct2008, Vol. 39 Issue 2, p137-143. 7p. 1 Diagram, 3 Graphs. |
| Subjects: |
Ad hoc computer networks, RADIUS (Computer network protocol), TCP/IP, Computer networks, Wireless communications, Telecommunication systems |
| Abstract: |
Abstract This paper investigates connectivity in one-dimensional ad hoc networks by means of the distribution of the minimum hop count between source and destination nodes. We derive the exact probability distribution of the minimum hop count from the location density of relay nodes in the multihop path selected with the Most Forward within Radius (MFR) scheme. The probability that the source and destination nodes are connected (provided by Ghasemi and Nader-Esfahani [IEEE Commun. Lett. 10(4):251–253, 2006]) can be obtained by summing the probability masses for each possible value of the minimum hop count, which provides new insights to the connectivity probability. Numerical results show the effect of the number of nodes and the transmission range on the minimum hop count. [ABSTRACT FROM AUTHOR] |
|
Copyright of Telecommunication Systems is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
