Coverage in One-Dimensional Wireless Networks with Infrastructure Nodes and Relay Extensions

Naveen, KP and Kumar, A (2020) Coverage in One-Dimensional Wireless Networks with Infrastructure Nodes and Relay Extensions. In: IEEE/ACM Transactions on Networking, 28 (1). pp. 140-153.

PDF IEEE_ACM_Tra_Net_28-1_140-153_2020.pdf - Published Version Restricted to Registered users only Download (2MB) | Request a copy

Abstract

We consider a wireless network comprising two types of nodes, namely, sinks and relays. The sink nodes are connected to a wireline infrastructure, while the relay nodes are used to extend the region covered by providing multi-hop paths to the sink nodes. Restricting to the one-dimensional setting, our objective is to characterize the fraction of covered region as a function of sink and relay node densities. We first compare and contrast our infrastructure-based model with the traditional setting where every node is a sink, and hence a location is covered if it simply lies within the range of some node. Then, drawing an analogy between the connected components of the network and the busy periods of an M/D/\infty queue (and using renewal theoretic arguments) we derive a closed-form expression for the average vacancy (complement of coverage). We also compute an upper bound for vacancy by introducing the notion of left-coverage (i.e., coverage by a node on the left); a lower bound is derived by coupling our model with an independent-disk model, where the sinks' coverage regions are independent and identically distributed. Through an extensive theoretical and numerical study, we investigate the problem of minimizing network deployment cost subject to a constraint on the average vacancy. We also conduct simulations to understand the properties of a general notion of coverage, obtained by introducing hop-counts into the definition. Parameterized approximations for the hop-constrained cluster lengths (around a sink) are proposed, whose efficacy is evaluated numerically. In particular, there exists a range of parameter values where our cluster-length approximation is good. Finally, hop-constrained cost optimization is conducted to demonstrate the efficacy of the infrastructure-based design

Item Type:	Journal Article
Publication:	IEEE/ACM Transactions on Networking
Publisher:	Institute of Electrical and Electronics Engineers Inc.
Additional Information:	The copyright for this article belongs to the Institute of Electrical and Electronics Engineers Inc.
Keywords:	Constrained optimization, Closed-form expression; Connected component; Cost optimization; Lower bounds; Multi-hop path; Multihop wireless network; Network deployment cost; Parameterized, Wireless networks
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	02 Feb 2023 07:16
Last Modified:	02 Feb 2023 07:16
URI:	https://eprints.iisc.ac.in/id/eprint/79738

Actions (login required)

View Item