352 research outputs found
Strengths and Weaknesses of Prominent Data Dissemination Techniques in Wireless Sensor Networks
Data dissemination is the most significant task in a Wireless Sensor Network (WSN). From the bootstrapping stage to the full functioning stage, a WSN must disseminate data in various patterns like from the sink to node, from node to sink, from node to node, or the like. This is what a WSN is deployed for. Hence, this issue comes with various data routing models and often there are different types of network settings that influence the way of data collection and/or distribution. Considering the importance of this issue, in this paper, we present a survey on various prominent data dissemination techniques in such network. Our classification of the existing works is based on two main parameters: the number of sink (single or multiple) and the nature of its movement (static or mobile). Under these categories, we have analyzed various previous works for their relative strengths and weaknesses. A comparison is also made based on the operational methods of various data dissemination schemes
A survey of flooding, gossip routing, and related schemes for wireless multi- hop networks
Flooding is an essential and critical service in computer networks that is
used by many routing protocols to send packets from a source to all nodes in
the network. As the packets are forwarded once by each receiving node, many
copies of the same packet traverse the network which leads to high redundancy
and unnecessary usage of the sparse capacity of the transmission medium.
Gossip routing is a well-known approach to improve the flooding in wireless
multi-hop networks. Each node has a forwarding probability p that is either
statically per-configured or determined by information that is available at
runtime, e.g, the node degree. When a packet is received, the node selects a
random number r. If the number r is below p, the packet is forwarded and
otherwise, in the most simple gossip routing protocol, dropped. With this
approach the redundancy can be reduced while at the same time the reachability
is preserved if the value of the parameter p (and others) is chosen with
consideration of the network topology. This technical report gives an overview
of the relevant publications in the research domain of gossip routing and
gives an insight in the improvements that can be achieved. We discuss the
simulation setups and results of gossip routing protocols as well as further
improved flooding schemes. The three most important metrics in this
application domain are elaborated: reachability, redundancy, and management
overhead. The published studies used simulation environments for their
research and thus the assumptions, models, and parameters of the simulations
are discussed and the feasibility of an application for real world wireless
networks are highlighted. Wireless mesh networks based on IEEE 802.11 are the
focus of this survey but publications about other network types and
technologies are also included. As percolation theory, epidemiological models,
and delay tolerant networks are often referred as foundation, inspiration, or
application of gossip routing in wireless networks, a brief introduction to
each research domain is included and the applicability of the particular
models for the gossip routing is discussed
Joint optimization for wireless sensor networks in critical infrastructures
Energy optimization represents one of the main goals in wireless sensor network design
where a typical sensor node has usually operated by making use of the battery with
limited-capacity. In this thesis, the following main problems are addressed: first, the
joint optimization of the energy consumption and the delay for conventional wireless sensor networks is presented. Second, the joint optimization of the information quality and
energy consumption of the wireless sensor networks based structural health monitoring
is outlined. Finally, the multi-objectives optimization of the former problem under several constraints is shown. In the first main problem, the following points are presented:
we introduce a joint multi-objective optimization formulation for both energy and delay
for most sensor nodes in various applications. Then, we present the Karush-Kuhn-Tucker
analysis to demonstrate the optimal solution for each formulation. We introduce a method
of determining the knee on the Pareto front curve, which meets the network designer interest for focusing on more practical solutions. The sensor node placement optimization has
a significant role in wireless sensor networks, especially in structural health monitoring.
In the second main problem of this work, the existing work optimizes the node placement
and routing separately (by performing routing after carrying out the node placement).
However, this approach does not guarantee the optimality of the overall solution. A joint
optimization of sensor placement, routing, and flow assignment is introduced and is solved
using mixed-integer programming modelling. In the third main problem of this study, we
revisit the placement problem in wireless sensor networks of structural health monitoring by using multi-objective optimization. Furthermore, we take into consideration more
constraints that were not taken into account before. This includes the maximum capacity
per link and the node-disjoint routing. Since maximum capacity constraint is essential
to study the data delivery over limited-capacity wireless links, node-disjoint routing is
necessary to achieve load balancing and longer wireless sensor networks lifetime. We list
the results of the previous problems, and then we evaluate the corresponding results
- …