On the minimum hop count and connectivity in one-dimensional ad hoc wireless networks Export

@article{citeulike:3008058, 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.}, author = {Antunes, Nelson and Jacinto, Gon\c{c}alo and Pacheco, Ant\'{o}nio}, citeulike-article-id = {3008058}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/s11235-008-9118-9}, doi = {10.1007/s11235-008-9118-9}, journal = {Telecommunication Systems}, keywords = {connectivity, count, distribution, hop, minimum, probability, wirelesss}, posted-at = {2008-07-16 12:06:35}, priority = {3}, title = {On the minimum hop count and connectivity in one-dimensional ad hoc wireless networks}, url = {http://dx.doi.org/10.1007/s11235-008-9118-9} }

TY - JOUR ID - citeulike:3008058 L3 - citeulike-article-id:3008058 N2 - 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. JF - Telecommunication Systems TI - On the minimum hop count and connectivity in one-dimensional ad hoc wireless networks KW - connectivity KW - count KW - distribution KW - hop KW - minimum KW - probability KW - wirelesss AU - Antunes, Nelson AU - Jacinto, Gonçalo AU - Pacheco, António UR - http://dx.doi.org/10.1007/s11235-008-9118-9 ER -