article

Constrained relay node placement in wireless sensor networks: formulation and approximations

Authors:

Satyajayant Misra,

Seung Don Hong,

Jian TangAuthors Info & Claims

IEEE/ACM Transactions on Networking (TON), Volume 18, Issue 2

Pages 434 - 447

https://doi.org/10.1109/TNET.2009.2033273

Published: 01 April 2010 Publication History

Abstract

One approach to prolong the lifetime of a wireless sensor network (WSN) is to deploy some relay nodes to communicate with the sensor nodes, other relay nodes, and the base stations. The relay node placement problem for wireless sensor networks is concerned with placing a minimum number of relay nodes into a wireless sensor network to meet certain connectivity or survivability requirements. Previous studies have concentrated on the unconstrained version of the problem in the sense that relay nodes can be placed anywhere. In practice, there may be some physical constraints on the placement of relay nodes. To address this issue, we study constrained versions of the relay node placement problem, where relay nodes can only be placed at a set of candidate locations. In the connected relay node placement problem, we want to place a minimum number of relay nodes to ensure that each sensor node is connected with a base station through a bidirectional path. In the survivable relay node placement problem, we want to place a minimum number of relay nodes to ensure that each sensor node is connected with two base stations (or the only base station in case there is only one base station) through two node-disjoint bidirectional paths. For each of the two problems, we discuss its computational complexity and present a framework of polynomial time O(1)-approximation algorithms with small approximation ratios. Extensive numerical results showthat our approximation algorithms can produce solutions very close to optimal solutions.

References

[1]

I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, "Wireless sensor networks: A survey," Comput. Netw., vol. 38, pp. 393-422, 2002.

Digital Library

[2]

J. Bredin, E. Demaine, M. Hajiaghayi, and D. Rus, "Deploying sensor networks with guaranteed capacity and fault tolerance," in Proc. ACM MobiHoc, 2005, pp. 309-319.

Digital Library

[3]

D. Chen, D. Z. Du, X. D. Hu, G. Lin, L. Wang, and G. Xue, "Approximations for Steiner trees with minimum number of Steiner points," J. Global Optimization, vol. 18, pp. 17-33, 2000.

Digital Library

[4]

P. Cheng, C. N. Chuah, and X. Liu, "Energy-aware node placement in wireless sensor networks," in Proc. IEEE Globecom, 2004, pp. 3210-3214.

[5]

X. Cheng, D. Z. Du, L. Wang, and B. Xu, "Relay sensor placement in wireless sensor networks," Wireless Netw., vol. 14, pp. 347-355, 2008.

Digital Library

[6]

T. Cormen, C. Leiserson, R. Rivest, and C. Stein, Introduction to Algorithms, 2nd ed. Cambridge, MA: MIT Press and McGraw-Hill, 2001.

Digital Library

[7]

L. Fleischer, "A 2-Approximation for minimum cost {0, 1, 2} vertex connectivity," in Proc. IPCO, 2001, pp. 115-129.

Digital Library

[8]

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.

Digital Library

[9]

G. Gupta and M. Younis, "Fault tolerant clustering of wireless sensor networks," in Proc. WCNC, 2003, pp. 1579-1584.

[10]

X. Han, X. Cao, E. L. Lloyd, and C.-C. Shen, "Fault-tolerant relay node placement in heterogeneous wireless sensor networks," in Proc. IEEE INFOCOM, 2007, pp. 1649-1657.

[11]

B. Hao, J. Tang, and G. Xue, "Fault-tolerant relay node placement in wireless sensor networks: Formulation and approximation," in Proc. IEEE HPSR, 2004, pp. 246-250.

[12]

Y. T. Hou, Y. Shi, H. D. Sherali, and S. F. Midkiff, "Prolonging sensor network lifetime with energy provisioning and relay node placement," in Proc. IEEE Secon, 2005, pp. 295-304.

[13]

F. K. Hwang, D. S. Richards, and P. Winter, The Steiner Tree Problem. Amsterdam, The Netherlands: North Holland, 1992, Annals of Discrete Mathematics.

[14]

B. Karp and H. Kung, "GPSR: Greedy perimeter stateless routing for wireless networks," in Proc. ACM Mobicom, 2001, pp. 243-254.

Digital Library

[15]

A. Kashyap, S. Khuller, and M. Shayman, "Relay placement for higher order connectivity in wireless sensor networks," in Proc. IEEE INFOCOM, pp. 1-12.

[16]

W.-C. Ke, B.-H. Liu, and M.-J. Tsai, "Constructing a wireless sensor network to fully cover critical grids by deploying minimum sensors on grid points is NP-complete," IEEE Trans. Comput., vol. 56, no. 5, pp. 710-715, May 2007.

Digital Library

[17]

L. T.Kou, G. Markowsky, and L. Berman, "A fast algorithm for Steiner trees," Acta Informatica, vol. 15, pp. 141-145, 1981.

Digital Library

[18]

Q. Li, J. Aslam, and D. Rus, "Online power-aware routing in wireless ad-hoc networks," in Proc. ACM Mobicom, 2001, pp. 97-107.

Digital Library

[19]

G. Lin and G. Xue, "Steiner tree problem with minimum number of Steiner points and bounded edge-length," Inf. Process. Lett., vol. 69, pp. 53-57, 1999.

Digital Library

[20]

H. Liu, P. J. Wan, and X. H. Jia, "Fault-tolerant relay node placement in wireless sensor networks," LNCS, vol. 3595, pp. 230-239, 2005.

Digital Library

[21]

E. Lloyd and G. Xue, "Relay node placement in wireless sensor networks," IEEE Trans. Comput., vol. 56, no. 1, pp. 134-138, Jan. 2007.

Digital Library

[22]

W. Lou, W. Liu, and Y. Fang, "SPREAD: Enhancing data confidentiality in mobile ad hoc networks," in Proc. IEEE INFOCOM, 2004, pp. 2404-2413.

[23]

S. Misra, D. Hong, G. Xue, and J. Tang, "Constrained relay node placement in wireless sensor networks to meet connectivity and survivability requirements," in Proc. IEEE INFOCOM, 2008, pp. 281-285.

[24]

J. Pan, Y. T. Hou, L. Cai, Y. Shi, and S. X. Shen, "Topology control for wireless sensor networks," in Proc. ACM Mobicom, 2003, pp. 286-299.

Digital Library

[25]

S. Plotkin, D. Shmoys, and E. Tardos, "Fast approximation algorithms for fractional packing and covering problems," Math. Oper. Res., vol. 20, pp. 257-301, 1995.

Digital Library

[26]

R. Ravi and D. P. Williamson, "An approximation algorithm for minimum-cost vertex-connectivity problems," Algorithmica, vol. 18, pp. 21-43, 1997.

Digital Library

[27]

R. Ravi and D. P. Williamson, "Erratum: An approximation algorithm for minimum-cost vertex-connectivity problems," Algorithmica, vol. 34, pp. 98-107, 2002.

Digital Library

[28]

G. Robins and A. Zelikovsky, "Tighter bounds for graph Steiner tree approximation," SIAM J. Discrete Math., vol. 19, pp. 122-134, 2005.

Digital Library

[29]

A. Srinivas, G. Zussman, and E. Modiano, "Mobile backbone networks-Construction and maintenance," in Proc. ACM Mobihoc, 2006, pp. 166-177.

Digital Library

[30]

J. Tang, B. Hao, and A. Sen, "Relay node placement in large scale wireless sensor networks," Comput. Commun., vol. 29, pp. 490-501, 2006.

Digital Library

[31]

D. B. West, Introduction to Graph Theory. Englewood Cliffs, NJ: Prentice Hall, 1996.

[32]

K. Xu, H. Hassanein, and G. Takahara, "Relay node deployment strategies in heterogeneous wireless sensor networks: multiple-hop communication case," in Proc. IEEE Secon, 2005, pp. 575-585.

[33]

O. Younis and S. Fahmy, "Distributed clustering for ad-hoc sensor networks: A hybrid, energy-efficient approach," in Proc. IEEE INFOCOM, 2004, pp. 269-640.

[34]

W. Zhang, G. Xue, and S. Misra, "Fault-tolerant relay node placement in wireless sensor networks: Problems and algorithms," in Proc. IEEE INFOCOM, 2007, pp. 1649-1657.

Digital Library

[35]

"ILOG CPLEX: Software for mathematical programming and optimization," ver. 8.1, 2002 {Online}. Available: http://www.ilog.com/ products/cplex/

Cited By

Banerjee PMandal SDe DMaiti B(2024)CGARP: Chaos genetic algorithm-based relay node placement for multifaceted heterogeneous wireless sensor networksInnovations in Systems and Software Engineering10.1007/s11334-022-00439-520:4(689-704)Online publication date: 1-Dec-2024
https://dl.acm.org/doi/10.1007/s11334-022-00439-5
Ma CLiang WZheng MXia XChen L(2023)A Voronoi Diagram and Q-Learning based Relay Node Placement Method Subject to Radio IrregularityACM Transactions on Sensor Networks10.1145/361712420:1(1-27)Online publication date: 20-Oct-2023
https://dl.acm.org/doi/10.1145/3617124
Mei WZhang R(2023)Joint Base Station and IRS Deployment for Enhancing Network Coverage: A Graph-Based Modeling and Optimization ApproachIEEE Transactions on Wireless Communications10.1109/TWC.2023.326080522:11(8200-8213)Online publication date: 1-Nov-2023
https://dl.acm.org/doi/10.1109/TWC.2023.3260805
Show More Cited By

Index Terms

Constrained relay node placement in wireless sensor networks: formulation and approximations
1. General and reference
  1. Cross-computing tools and techniques
    1. Design
    2. Performance
2. Networks
  1. Network services
    1. Network management

Recommendations

Relay Node Placement in Wireless Sensor Networks

A wireless sensor network consists of many low-cost, low-power sensor nodes, which can perform sensing, simple computation, and transmission of sensed information. Long distance transmission by sensor nodes is not energy efficient since energy ...
Relay node placement in large scale wireless sensor networks

Scalability and extended lifetime are two critical design goals of any large scale wireless sensor network. A two-tiered network model has been proposed recently for this purpose. This is a cluster-based network model composed of relay and sensor nodes. ...
Two-Tiered Constrained Relay Node Placement in Wireless Sensor Networks: Computational Complexity and Efficient Approximations

In wireless sensor networks, relay node placement has been proposed to improve energy efficiency. In this paper, we study two-tiered constrained relay node placement problems, where the relay nodes can be placed only at some prespecified candidate ...

Comments

comments powered by Disqus.

Information & Contributors

Information

Published In

IEEE/ACM Transactions on Networking Volume 18, Issue 2

April 2010

339 pages

ISSN:1063-6692

Issue’s Table of Contents

Publisher

IEEE Press

Publication History

Published: 01 April 2010

Revised: 20 March 2009

Received: 16 July 2008

Published in TON Volume 18, Issue 2

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

33
Total Citations
View Citations
533
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 21 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Banerjee PMandal SDe DMaiti B(2024)CGARP: Chaos genetic algorithm-based relay node placement for multifaceted heterogeneous wireless sensor networksInnovations in Systems and Software Engineering10.1007/s11334-022-00439-520:4(689-704)Online publication date: 1-Dec-2024
https://dl.acm.org/doi/10.1007/s11334-022-00439-5
Ma CLiang WZheng MXia XChen L(2023)A Voronoi Diagram and Q-Learning based Relay Node Placement Method Subject to Radio IrregularityACM Transactions on Sensor Networks10.1145/361712420:1(1-27)Online publication date: 20-Oct-2023
https://dl.acm.org/doi/10.1145/3617124
Mei WZhang R(2023)Joint Base Station and IRS Deployment for Enhancing Network Coverage: A Graph-Based Modeling and Optimization ApproachIEEE Transactions on Wireless Communications10.1109/TWC.2023.326080522:11(8200-8213)Online publication date: 1-Nov-2023
https://dl.acm.org/doi/10.1109/TWC.2023.3260805
Mazumder AChenyang Zhou Das ASen A(2021)Budget constrained relay node placement problem for maximal “connectedness”MILCOM 2016 - 2016 IEEE Military Communications Conference10.1109/MILCOM.2016.7795435(849-854)Online publication date: 10-Mar-2021
https://dl.acm.org/doi/10.1109/MILCOM.2016.7795435
Yao HFu XYang YUngurean IPostolache O(2021)An Efficient Multi-constraint Relay Deployment Strategy for Wireless Sensor NetworkWireless Personal Communications: An International Journal10.1007/s11277-021-08133-8118:4(2423-2444)Online publication date: 1-Jun-2021
https://dl.acm.org/doi/10.1007/s11277-021-08133-8
Amron KKusumawinahyu WAnam SMahmudy WBudi AAdinugroho S(2020)Relay nodes placement for optimal coverage, connectivity, and communication of wireless sensor networksProceedings of the 5th International Conference on Sustainable Information Engineering and Technology10.1145/3427423.3427452(177-182)Online publication date: 16-Nov-2020
https://dl.acm.org/doi/10.1145/3427423.3427452
Zafer MSenouci MAissani M(2019)A practical data driven approach for the deployment of WSNs on realistic terrainsTransactions on Emerging Telecommunications Technologies10.1002/ett.355830:8Online publication date: 14-Aug-2019
https://dl.acm.org/doi/10.1002/ett.3558
Shah Sda Costa DChoi KChung M(2018)Dynamic Wireless Energy Harvesting and Optimal Distribution in Multipair DF Relay Network with Nonlinear Energy Conversion ModelWireless Communications & Mobile Computing10.1155/2018/76382152018Online publication date: 6-Aug-2018
https://dl.acm.org/doi/10.1155/2018/7638215
Zhou CMazumder ADas ABasu KMatin-Moghaddam NMehrani SSen A(2018)Relay Node Placement Under Budget ConstraintProceedings of the 19th International Conference on Distributed Computing and Networking10.1145/3154273.3154302(1-11)Online publication date: 4-Jan-2018
https://dl.acm.org/doi/10.1145/3154273.3154302
Ma CLiang WZheng M(2018)CRNP: A cover-based relay node placement algorithm to delay-constrained wireless sensor networks2018 IEEE Wireless Communications and Networking Conference (WCNC)10.1109/WCNC.2018.8377112(1-6)Online publication date: 15-Apr-2018
https://dl.acm.org/doi/10.1109/WCNC.2018.8377112
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.

Alternative Proxies:

Alternative Proxy