Two-Tiered Constrained Relay Node Placement in Wireless Sensor Networks: Computational Complexity and Efficient Approximations

Yang, Dejun; Misra, Satyajayant; Fang, Xi; Xue, Guoliang; Zhang, Junshan

doi:10.1109/tmc.2011.126

Cited by 122 publications

(97 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Q. Wang et al [18] proposed three algorithms to build the network connectivity subject to lifetime constraint. Yang et al [19] first studied the constrained RNP problem in two-tiered WSNs and proposed an algorithm with O(1)-approximation ratio for CRNSC problem. Then, they respectively proposed two algorithms with O(1)-approximation ratio and O(ln n)-approximation ratio under different settings for 2CRNDC problem, where n is the number of SNs.…”

Section: Two-tiered Rnp Problemmentioning

confidence: 99%

“…However, different from the RNP problem that has been extensively studied [8][9][10][11][12][13][14][15][16][17][18][19][20], the works on the DCRNP problem are very limited [21][22][23][24][25]. Moreover, published works only concentrate on the DCRNP problem in single-tiered WSNs.…”

Section: Introductionmentioning

confidence: 99%

“…Similar to the traditional two-tiered RNP algorithms [16][17][18][19], PSH solves this problem in two phases, i.e., the covering phase and the connecting phase, in which the shortest-path-based algorithm (SPA) and the tree-based connecting algorithm (TCA) are employed, respectively. In the covering phase, SPA deploys RNs to fully cover SNs with respect to delay constraints, and the deployment locations are carefully selected so as to further save RNs deployed in the next phase.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

PSH: A Pruning and Substitution Based Heuristic Algorithm for Relay Node Placement in Two-Tiered Wireless Sensor Networks

Liang

Zheng

2016

Wireless Pers Commun

View full text Add to dashboard Cite

Delay constrained relay node placement (DCRNP) problem minimizes the quantity of deployed relays that are employed to build at least one path between the sink and each sensor, while guaranteeing that the delay constraints for the built paths are fulfilled. Published literature only focus on the DCRNP problem in single-tiered wireless sensor networks (WSNs). Considering the benefits in terms of network scalability and energy consumption by the two-tiered network topology, this paper studies the DCRNP problem in two-tiered WSNs and proposes a pruning-and-substitution-based-heuristic (PSH) algorithm to solve the DCRNP problem. PSH consists of two phases, i.e., the covering phase and the connecting phase. In the covering phase, a shortest-path-based algorithm (SPA) is proposed to deploy relays at a subset of predetermined deployment locations such that each sensor is covered by at least one relay, meanwhile ensuring the obedience of delay constraints. Then, in the connecting phase, a tree-based connecting algorithm (TCA) is proposed to build the high-tier network connectivity. TCA first builds a shortest path tree to connect the relays deployed by SPA to the sink, and then, saves the deployed relays by gradually pruning or substituting them by the relays placed at the locations that several feasible paths pass through. The time complexity and the approximation ratio of this work are explicitly analyzed and extensive simulations are implemented to demonstrate its effectiveness.

show abstract

Section: Two-tiered Rnp Problemmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

PSH: A Pruning and Substitution Based Heuristic Algorithm for Relay Node Placement in Two-Tiered Wireless Sensor Networks

Liang

Zheng

2016

Wireless Pers Commun

View full text Add to dashboard Cite

show abstract

“…In particular, there are some published work about the node and AP placement problem in wireless sensor networks [19][20][21][22][23][24][25][26][27][28]. Liu et al [20] investigated the relay node placement in two-tiered wireless sensor networks and proposed several approximation algorithms to solve the minimum relay-node placement problem.…”

Section: Related Workmentioning

confidence: 99%

Delay Bounded Roadside Unit Placement in Vehicular Ad Hoc Networks

Huang

Liu

2015

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

The placement of roadside units (RSUs) is a difficult and yet important issue in vehicular networks. If too few RSUs are placed, the system performance would be very poor. However, with too many RSUs, it would incur high installation cost and maintenance cost of these RSUs. In this paper, we study the problem of delay bounded roadside unit placement (DRP) in vehicular networks. For a given delay bound, our objective is to place the minimal number of RSUs in the system such that a message from any of RSUs in the region can be disseminated to all vehicles within the given delay bound. We consider two cases of RSUs, the case that all RSUs are interconnected through wired lines (called DRP-L problem) and the case that RSUs connect to other RSUs through wireless link (called DRP-W problem). We first prove that both DRP-L and DRP-W problems are NP-hard. Then, we propose several heuristic algorithms to solve DRP-L and DRP-W problems, respectively. Extensive simulations have been conducted to show that the performance of our proposed methods is superior to the other methods.

show abstract

“…Due to the high costs of RNs, a minimum number of RNs are expected to be placed for building the connectivity, which is termed as the Relay Node Placement (RNP) problem. In recent years, the RNP problem has been extensively studied (Lin and Xue, 1999;Ma et al, 2016a;Cheng et al, 2007;Lloyd and Xue, 2007;Misra et al, 2010;Srinivas et al, 2009;Yang et al, 2012;Han et al, 2010).…”

Section: Introductionmentioning

confidence: 99%

Delay constrained relay node placement in two-tiered wireless sensor networks: A set-covering-based algorithm

Liang

Zheng

2017

Journal of Network and Computer Applications

View full text Add to dashboard Cite

Two-Tiered Constrained Relay Node Placement in Wireless Sensor Networks: Computational Complexity and Efficient Approximations

Cited by 122 publications

References 27 publications

PSH: A Pruning and Substitution Based Heuristic Algorithm for Relay Node Placement in Two-Tiered Wireless Sensor Networks

PSH: A Pruning and Substitution Based Heuristic Algorithm for Relay Node Placement in Two-Tiered Wireless Sensor Networks

Delay Bounded Roadside Unit Placement in Vehicular Ad Hoc Networks

Delay constrained relay node placement in two-tiered wireless sensor networks: A set-covering-based algorithm

Contact Info

Product

Resources

About