Energy efficient sensor, relay and base station placements for coverage, connectivity and routing

Abstract

Abstract-We consider a wireless sensor network made of sensor nodes capable of sensing and communication, relay nodes capable of communication, and base stations responsible for collecting data generated by sensor nodes, to be deployed in sensor field. We address the problem of placing the sensor nodes, relay nodes and base stations in the sensor field such that (i) each point of interest in the sensor field is covered by a subset of sensors of desired cardinality (ii) the resulting sensor network is connected and (iii) the sensor network has sufficient bandwidth. We propose several deployment strategies to determine optimal placements of sensor nodes, relay nodes and base stations for guaranteed coverage, connectivity, bandwidth and robustness. We study several different objectives such as minimizing the number of sensor nodes deployed, minimizing the total cost, minimizing the energy consumption, maximizing the network lifetime and maximizing the network utilization. The placement problems for reliable as well as unreliable/probabilistic detection models are formulated as Integer Linear Programs (ILPs). The practicality, effectiveness and performance of the proposed strategies are illustrated through simulations.

Relay based Clustering Protocol for WSN

“…They also have proposed a polynomial-time approximation algorithm to solve the problem and claimed that the worst-case performance of their solution is bounded by O(Dlog n) times of the size of an optimal solution. In [6], Patel et al addressed the placement problem of sensor nodes, relay nodes and base station in sensor networks and formulated a solution to achieve minimal number of sensor nodes, minimal total cost and energy consumption as well as maximal energy utilization and lifetime of the network. In [7], Hou et al (2005) focused on prolonging the lifetime of sensor networks with energy provisioning and deploying relay nodes within the networks.…”

Maximum Lifetime Scheduling in Wireless Sensor Networks

“…This means that more sensors are deployed than needed to compensate for the lack of exact positioning and to improve fault tolerance in harsh environments. The question of placing an optimal number of sensors in a deterministic deployment has been looked at in [17,26,34]. However, in this dissertation we focus on networks with very dense deployment of sensors so that there is significant overlap in the targets each sensor monitors.…”

Hard Constrained Vertex-Cover Communication Algorithm for WSN

“…Many other researchers have focused on minimizing the number of base stations [2,5,8,13,16], where others used a predefined fixed number of base stations [1,9,11,12,14]. Also, some researchers have focused on maximizing the number of sensors served by a base station [3].…”

“…It enhances the robustness of a system for congested traffic due to moving of the subscribers even if the base station has few channels. The authors in [8] addressed the problem of placing the sensor nodes, relay nodes and base stations in the sensor field such that each point of interest in the sensor field is covered by a subset of sensors of desired cardinality. Several deployment strategies to determine optimal placement of the nodes for guaranteed coverage, connectivity, bandwidth and robustness are considered in this paper.…”

“…k δ represents an allocation variable of a vertex cover; k δ = 1 indicates that a sensor device k has been allocated to be used as a vertex cover. This objective function is subject to a set of constrains (2), (3), (4), (5), (6), (7) and (8).…”