On the connectivity properties of wireless multi-hop networks

Xiaoyuan Ta*, Guoqiang Mao, Brian D.O. Anderson

*Corresponding author for this work

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    3 Citations (Scopus)

    Abstract

    Given a multi-hop network in which a total of n nodes are randomly and independently distributed in a unit square following a uniform distribution and each node has a uniform transmission range r(n), and two distinct nodes can directly communicate with each other if and only if their Euclidean distance is at most r(n), this paper investigates the characteristics of the minimum transmission range rc(n), at which the network is connected with a high probability. We show that for small values of n, rc 2(n) grows approximately linearly with 1/n; and as n goes to infinity, rc2(n) scales with log n/n. Simulations are performed to verify the theoretical analysis. The results of this paper are very useful in the design and dimensioning of wireless sensor networks and wireless ad hoc networks.

    Original languageEnglish
    Title of host publication3rd International Conference on Communications and Networking in China, ChinaCom 2008
    PublisherIEEE Computer Society
    Pages959-963
    Number of pages5
    ISBN (Print)9781424423736
    DOIs
    Publication statusPublished - 2008
    Event3rd International Conference on Communications and Networking in China, ChinaCom 2008 - Hangzhou, China
    Duration: 25 Aug 200827 Aug 2008

    Publication series

    Name3rd International Conference on Communications and Networking in China, ChinaCom 2008

    Conference

    Conference3rd International Conference on Communications and Networking in China, ChinaCom 2008
    Country/TerritoryChina
    CityHangzhou
    Period25/08/0827/08/08

    Fingerprint

    Dive into the research topics of 'On the connectivity properties of wireless multi-hop networks'. Together they form a unique fingerprint.

    Cite this