2,013 research outputs found
QoS Constrained Optimal Sink and Relay Placement in Planned Wireless Sensor Networks
We are given a set of sensors at given locations, a set of potential
locations for placing base stations (BSs, or sinks), and another set of
potential locations for placing wireless relay nodes. There is a cost for
placing a BS and a cost for placing a relay. The problem we consider is to
select a set of BS locations, a set of relay locations, and an association of
sensor nodes with the selected BS locations, so that number of hops in the path
from each sensor to its BS is bounded by hmax, and among all such feasible
networks, the cost of the selected network is the minimum. The hop count bound
suffices to ensure a certain probability of the data being delivered to the BS
within a given maximum delay under a light traffic model. We observe that the
problem is NP-Hard, and is hard to even approximate within a constant factor.
For this problem, we propose a polynomial time approximation algorithm
(SmartSelect) based on a relay placement algorithm proposed in our earlier
work, along with a modification of the greedy algorithm for weighted set cover.
We have analyzed the worst case approximation guarantee for this algorithm. We
have also proposed a polynomial time heuristic to improve upon the solution
provided by SmartSelect. Our numerical results demonstrate that the algorithms
provide good quality solutions using very little computation time in various
randomly generated network scenarios
Wireless Backhaul Node Placement for Small Cell Networks
Small cells have been proposed as a vehicle for wireless networks to keep up
with surging demand. Small cells come with a significant challenge of providing
backhaul to transport data to(from) a gateway node in the core network. Fiber
based backhaul offers the high rates needed to meet this requirement, but is
costly and time-consuming to deploy, when not readily available. Wireless
backhaul is an attractive option for small cells as it provides a less
expensive and easy-to-deploy alternative to fiber. However, there are multitude
of bands and features (e.g. LOS/NLOS, spatial multiplexing etc.) associated
with wireless backhaul that need to be used intelligently for small cells.
Candidate bands include: sub-6 GHz band that is useful in non-line-of-sight
(NLOS) scenarios, microwave band (6-42 GHz) that is useful in point-to-point
line-of-sight (LOS) scenarios, and millimeter wave bands (e.g. 60, 70 and 80
GHz) that are recently being commercially used in LOS scenarios. In many
deployment topologies, it is advantageous to use aggregator nodes, located at
the roof tops of tall buildings near small cells. These nodes can provide high
data rate to multiple small cells in NLOS paths, sustain the same data rate to
gateway nodes using LOS paths and take advantage of all available bands. This
work performs the joint cost optimal aggregator node placement, power
allocation, channel scheduling and routing to optimize the wireless backhaul
network. We formulate mixed integer nonlinear programs (MINLP) to capture the
different interference and multiplexing patterns at sub-6 GHz and microwave
band. We solve the MINLP through linear relaxation and branch-and-bound
algorithm and apply our algorithm in an example wireless backhaul network of
downtown Manhattan.Comment: Invited paper at Conference on Information Science & Systems (CISS)
201
Coverage Protocols for Wireless Sensor Networks: Review and Future Directions
The coverage problem in wireless sensor networks (WSNs) can be generally
defined as a measure of how effectively a network field is monitored by its
sensor nodes. This problem has attracted a lot of interest over the years and
as a result, many coverage protocols were proposed. In this survey, we first
propose a taxonomy for classifying coverage protocols in WSNs. Then, we
classify the coverage protocols into three categories (i.e. coverage aware
deployment protocols, sleep scheduling protocols for flat networks, and
cluster-based sleep scheduling protocols) based on the network stage where the
coverage is optimized. For each category, relevant protocols are thoroughly
reviewed and classified based on the adopted coverage techniques. Finally, we
discuss open issues (and recommend future directions to resolve them)
associated with the design of realistic coverage protocols. Issues such as
realistic sensing models, realistic energy consumption models, realistic
connectivity models and sensor localization are covered
Resilient Wireless Sensor Networks Using Topology Control: A Review
Wireless sensor networks (WSNs) may be deployed in failure-prone environments, and WSNs nodes easily fail due to unreliable wireless connections, malicious attacks and resource-constrained features. Nevertheless, if WSNs can tolerate at most losing k − 1 nodes while the rest of nodes remain connected, the network is called k − connected. k is one of the most important indicators for WSNs’ self-healing capability. Following a WSN design flow, this paper surveys resilience issues from the topology control and multi-path routing point of view. This paper provides a discussion on transmission and failure models, which have an important impact on research results. Afterwards, this paper reviews theoretical results and representative topology control approaches to guarantee WSNs to be k − connected at three different network deployment stages: pre-deployment, post-deployment and re-deployment. Multi-path routing protocols are discussed, and many NP-complete or NP-hard problems regarding topology control are identified. The challenging open issues are discussed at the end. This paper can serve as a guideline to design resilient WSNs
- …