Skip navigation
Skip navigation

Properties of 1-D Infrastructure-based Wireless Multi-hop Networks

Ng, Seh Chun; Mao, Guoqiang; Anderson, Brian

Description

Many real wireless multi-hop networks are deployed with some infrastructure support, where the results on ad-hoc networks cannot be readily extended to understand the properties of those networks. In this paper, we study those networks in 1-D. Specifically, we consider two types of nodes in the networks: ordinary nodes and powerful nodes, where ordinary nodes are i.i.d and Poissonly distributed in a unit interval and powerful nodes are arbitrarily distributed within the same unit interval....[Show more]

dc.contributor.authorNg, Seh Chun
dc.contributor.authorMao, Guoqiang
dc.contributor.authorAnderson, Brian
dc.coverage.spatialCape Town South Africa
dc.date.accessioned2015-12-10T22:53:32Z
dc.date.createdMay 23-27 2010
dc.identifier.urihttp://hdl.handle.net/1885/59393
dc.description.abstractMany real wireless multi-hop networks are deployed with some infrastructure support, where the results on ad-hoc networks cannot be readily extended to understand the properties of those networks. In this paper, we study those networks in 1-D. Specifically, we consider two types of nodes in the networks: ordinary nodes and powerful nodes, where ordinary nodes are i.i.d and Poissonly distributed in a unit interval and powerful nodes are arbitrarily distributed within the same unit interval. These powerful nodes are inter-connected via some backbone infrastructure. The network is said to be connected, i.e. any two nodes can communicate with each other, if each ordinary node is connected to at least one of the powerful nodes. We call this type of connectivity type-II connectivity. Exact and simplified asymptotic formulas for type-II connectivity probability and the average hop count between two arbitrary nodes are obtained. Further we prove that equi-distant powerful nodes deployment delivers the optimum performance which maximizes the type-II connectivity probability. These results are important for the design and deployment of 1-D infrastructure-based networks and provide useful insights into the analysis of higher dimensional networks.
dc.publisherIEEE Communications Society
dc.relation.ispartofseriesIEEE International Conference on Communications (ICC 2010)
dc.sourceProceedings of IEEE International Conference on Communications (ICC 2010)
dc.subjectKeywords: Asymptotic formula; Connectivity probability; Higher-dimensional; Hop count; Hop counts; Optimum performance; Random geometric graphs; Unit intervals; Wireless multi-hop network; Telecommunication networks; Ad hoc networks 1-D networks; Hop counts; Random geometric graph; Type-II connectivity; Wireless networks
dc.titleProperties of 1-D Infrastructure-based Wireless Multi-hop Networks
dc.typeConference paper
local.description.notesImported from ARIES
local.description.refereedYes
dc.date.issued2010
local.identifier.absfor080503 - Networking and Communications
local.identifier.ariespublicationu4334215xPUB488
local.type.statusPublished Version
local.contributor.affiliationNg, Seh Chun, University of Sydney
local.contributor.affiliationMao, Guoqiang , University of Sydney
local.contributor.affiliationAnderson, Brian, College of Engineering and Computer Science, ANU
local.description.embargo2037-12-31
local.bibliographicCitation.startpage1
local.bibliographicCitation.lastpage6
local.identifier.doi10.1109/ICC.2010.5502435
local.identifier.absseo890103 - Mobile Data Networks and Services
dc.date.updated2016-02-24T11:01:21Z
local.identifier.scopusID2-s2.0-77955393140
CollectionsANU Research Publications

Download

File Description SizeFormat Image
01_Ng_Properties_of_1-D_2010.pdf522.4 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator