Model and Algorithm: K-extended Constrain Independent Relay Node Placement Solution with Base Stations in Two-tiered Wireless Sensor Network

No abstract is available for this paper.

• Publication year

  2017

• Venue

  Unknown venue

• Publication date

  2017-08-01

• Fields of study

  Computer Science, Engineering

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

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

  2012cited by this paper
• Design of fault tolerant wireless sensor networks satisfying survivability and lifetime requirements

  2012cited by this paper
• Optimized relay node placement for connecting disjoint wireless sensor networks

  2012cited by this paper
• Relay Node Placement in Wireless Sensor Networks

  2011cited by this paper
• Bio-Inspired Relay Node Placement Heuristics for Repairing Damaged Wireless Sensor Networks

  2011cited by this paper
• Optimized relay placement for wireless sensor networks federation in environmental applications

  2011cited by this paper
• The 3-connected 3-coverage Problem in Two-tiered Wireless Sensor Network with Basestations

  2011cited by this paper
• Relay placement for fault tolerance in wireless networks in higher dimensions

  2011cited by this paper
• Constrained Relay Node Placement in Wireless Sensor Networks: Formulation and Approximations

  2010cited by this paper
• Relay sensor placement in wireless sensor networks

  2008cited by this paper
• Constrained Relay Node Placement in Wireless Sensor Networks to Meet Connectivity and Survivability Requirements

  2008cited by this paper
• Fault-Tolerant Relay Node Placement in Wireless Sensor Networks: Problems and Algorithms

  2007influential reference
• Relay Placement for Higher Order Connectivity in Wireless Sensor Networks

  2006cited by this paper
• Relay node placement in large scale wireless sensor networks

  2006influential reference
• Wireless sensor networks: a survey

  2002cited by this paper
• A 2-Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity

  2001cited by this paper
• Approximations for Steiner Trees with Minimum Number of Steiner Points

  2000cited by this paper
• Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs

  1999cited by this paper
• Introduction to algorithms

  1996cited by this paper
• Improved approximation algorithms for uniform connectivity problems

  1995cited by this paper
• Biconnectivity approximations and graph carvings

  1994cited by this paper
• An application of submodular flows

  1989cited by this paper
• Approximation schemes for covering and packing problems in image processing and VLSI

  1985cited by this paper

• No citing papers are available for this paper.