Approximation schemes for covering and packing problems in image processing and VLSI
Journal of the ACM (JACM)
Steiner tree problem with minimum number of Steiner points and bounded edge-length
Information Processing Letters
Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Topology management for sensor networks: exploiting latency and density
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
A coverage-preserving node scheduling scheme for large wireless sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Data Gathering Algorithms in Sensor Networks Using Energy Metrics
IEEE Transactions on Parallel and Distributed Systems
Connected sensor cover: self-organization of sensor networks for efficient query execution
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Minimum energy disjoint path routing in wireless ad-hoc networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Topology control for wireless sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Analysis on the redundancy of wireless sensor networks
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Graph Theory With Applications
Graph Theory With Applications
Relay sensor placement in wireless sensor networks
Wireless Networks
QoS for data relaying in hierarchical wireless sensor networks
Proceedings of the 1st ACM international workshop on Quality of service & security in wireless and mobile networks
Mobile backbone networks --: construction and maintenance
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Relay Node Placement in Wireless Sensor Networks
IEEE Transactions on Computers
QoS and data relaying for wireless sensor networks
Journal of Parallel and Distributed Computing
Relay sensor placement in wireless sensor networks
Wireless Networks
Clustering strategies for improving the lifetime of two-tiered sensor networks
Computer Communications
Design of sensor networks with guaranteed connectivity and lifetime
WICON '07 Proceedings of the 3rd international conference on Wireless internet
Minimum Power Minimum D-Hop Dominating Sets in Wireless Sensor Networks
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Relay Nodes in Wireless Sensor Networks
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Distributed Clustering Techniques for Improving Lifetime in Two-Tiered Sensor Networks
CNSR '09 Proceedings of the 2009 Seventh Annual Communication Networks and Services Research Conference
Optimal Placement of Multiple Interconnected Gateways in Heterogeneous Wireless Sensor Networks
NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
Construction and Maintenance of Wireless Mobile Backbone Networks
IEEE/ACM Transactions on Networking (TON)
On Performance of Node Placement Approaches for Hierarchical Heterogeneous Sensor Networks
Mobile Networks and Applications
Recovery from multiple simultaneous failures in wireless sensor networks using minimum Steiner tree
Journal of Parallel and Distributed Computing
Integrated clustering and routing strategies for large scale sensor networks
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Constrained relay node placement in wireless sensor networks: formulation and approximations
IEEE/ACM Transactions on Networking (TON)
Minimum energy strong bidirectional topology for ad hoc wireless sensor networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
QoS-aware relay node placement in a segmented wireless sensor network
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Optimized relay placement to federate segments in wireless sensor networks
IEEE Journal on Selected Areas in Communications
Selection of time synchronizing nodes in wireless sensor network
COMSNETS'10 Proceedings of the 2nd international conference on COMmunication systems and NETworks
ISWPC'10 Proceedings of the 5th IEEE international conference on Wireless pervasive computing
On improved relay nodes placement in two-tiered wireless sensor networks
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Augmenting ad hoc networks for data aggregation and dissemination
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
International Journal of Sensor Networks
Relay placement problem in smart grid deployment
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Fast track article: Designing hierarchical sensor networks with mobile data collectors
Pervasive and Mobile Computing
Energy aware fault tolerant routing in two-tiered sensor networks
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
A uniform airdrop deployment method for large-scale wireless sensor networks
International Journal of Sensor Networks
A new architecture for hierarchical sensor networks with mobile data collectors
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Minimum data-latency-bound k-sink placement problem in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Resource optimization algorithm for sparse time-driven sensor networks
NETWORKING'10 Proceedings of the 9th IFIP TC 6 international conference on Networking
MAX–MIN aggregation in wireless sensor networks: mechanism and modeling
Wireless Communications & Mobile Computing
Optimized relay node placement for connecting disjoint wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Multi-layer hybrid wired-cum-wireless sensor network design
International Journal of Communication Networks and Distributed Systems
Handling large-scale node failures in mobile sensor/robot networks
Journal of Network and Computer Applications
Efficient deployment of wireless sensor networks targeting environment monitoring applications
Computer Communications
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Establishing connectivity among disjoint terminals using a mix of stationary and mobile relays
Computer Communications
Wireless Personal Communications: An International Journal
Computer Networks: The International Journal of Computer and Telecommunications Networking
Relay node placement in two-tiered wireless sensor networks with base stations
Journal of Combinatorial Optimization
Hi-index | 0.25 |
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. Relay nodes are placed in the playing field to serve as cluster heads and to form a connected network topology for information dissemination at the higher tier. The relay nodes are capable of aggregating data packets from the sensor nodes in their clusters and transmitting them to the sink node via wireless multi-hop paths. In this paper, we study the relay node placement problem in large scale wireless sensor networks. Our objective is to place the fewest number of relay nodes in the playing field of a sensor network such that (1) each sensor node can communicate with at least one relay node and (2) the network of relay nodes is connected. However, placement strategies realizing goals (1) and (2) do not provide any fault-tolerance as the network may lose functionality after failure of some of the relay nodes. In order to incorporate fault-tolerance in such a network, we ensure that every sensor node is able to communicate with at least two relay nodes and the induced network topology is 2-connected. This strategy will ensure survivability of the network in the event of single fault, in lieu of higher relay node placement cost. We formulate the relay node placement in wireless sensor networks as two optimization problems: (i) Connected Relay Node Single Cover (CRNSC) problem and (ii) 2-Connected Relay Node Double Cover (2CRNDC) problem. We present two polynomial time approximation algorithms to solve the CRNSC problem. We prove that the ratio of the number of relay nodes needed by the approximation algorithm to the number of relay nodes needed by the optimal algorithm is bounded by 8 for the first algorithm and 4.5 for the second. In addition, for the 2CRNDC problem we provide two approximation algorithms with performance bounds 6 and 4.5, respectively.