Connectivity with backbone structures in obstructed wireless networks

Connectivity with backbone structures in obstructed wireless networks

In this work we consider a wireless ad-hoc network deployed on a finite street grid, where communication between nodes is disrupted by regularly spaced obstacles. The critical transmission range for connectivity in such networks grows with the size of the grid, which might impair the feasibility of...

Full description

Saved in:
Bibliographic Details
Published in:Computer networks (Amsterdam, Netherlands : 1999) Vol. 127; pp. 266 - 281
Main Authors: Neto, Manassés Ferreira, Goussevskaia, Olga, Santos, Vinícius Fernandes dos
Format: Journal Article
Language:English
Published: Amsterdam Elsevier B.V 09-11-2017
Elsevier Sequoia S.A
Subjects:
Ad hoc networks
Algorithms
Approximation
Approximation algorithms
Backbone
Computer simulation
Connectivity
Feasibility studies
Lower bounds
Mathematical analysis
NP-completeness
Obstructed wireless networks
Wireless communications
Wireless networks
Backbone
Connectivity
Approximation algorithms
Obstructed wireless networks
Ad-hoc networks
NP-completeness
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this work we consider a wireless ad-hoc network deployed on a finite street grid, where communication between nodes is disrupted by regularly spaced obstacles. The critical transmission range for connectivity in such networks grows with the size of the grid, which might impair the feasibility of low-power wireless technologies in large networks. We therefore analyze how the connectivity of such networks in sub-critical scenarios, where the transmission range is insufficient to establish connectivity, can be improved by introducing a global backbone with a set of access points. We formulate the problem of positioning a minimum number of access points, such that every connected component is covered by at least one access point, and refer to it as the Obstructed Wireless Network Backbone Cover Problem (OWN-BC). We prove that OWN-BC is NP-complete and present a 2-approximation algorithm to find solutions with guaranteed quality. Furthermore, we derive a lower bound on the probability of finding optimal solutions in random network scenarios. Finally, we perform a series of simulations to illustrate the performance of the approximation algorithm and characterize scenarios in which the proposed algorithm obtains optimal solutions in polynomial time.
ISSN:1389-1286
1872-7069
DOI:10.1016/j.comnet.2017.08.023