On the connectivity in finite ad hoc networks (vol 6, pg 437, 2002)

dc.contributor.author	GORE, AD
dc.date.accessioned	2011-10-10T07:51:15Z
dc.date.accessioned	2011-12-15T09:02:35Z
dc.date.available	2011-10-10T07:51:15Z
dc.date.available	2011-12-15T09:02:35Z
dc.date.issued	2006
dc.identifier.citation	IEEE COMMUNICATIONS LETTERS,10(5)359-359	en_US
dc.identifier.issn	1089-7798
dc.identifier.uri	http://dx.doi.org/10.1109/LCOMM.2006.1633322
dc.identifier.uri	en	en_US
dc.identifier.uri	http://dspace.library.iitb.ac.in/xmlui/handle/10054/13048
dc.identifier.uri	http://hdl.handle.net/100/51
dc.description.abstract	The probability of connectivity of a one-dimensional finite ad hoc network was derived in [1] by Desai and Manjunath, and further analyzed in [2] by Gore. In this letter, we point out a discrepancy in [2], thus corroborating the original results of [1]. However, [2] provides the exact interpretation of the recursion in [1] and derives the probability of connectivity of a one-dimensional finite sensor network.	en_US
dc.language.iso	IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC	en_US
dc.subject.other	On The Connectivity In Finite Ad Hoc Networks (Vol 6, Pg 437, 2002)	en_US
dc.title	On the connectivity in finite ad hoc networks (vol 6, pg 437, 2002)	en_US
dc.type	Correction	en_US