1,617 research outputs found
Link Expiration Time and Minimum Distance Spanning Trees based Distributed Data Gathering Algorithms for Wireless Mobile Sensor Networks
The high-level contributions of this paper are the design and development of two distributed spanning tree-based data gathering algorithms for wireless mobile sensor networks and their exhaustive simulation study to investigate a complex stability vs. node-network lifetime tradeoff that has been hitherto not explored in the literature. The topology of the mobile sensor networks changes dynamically with time due to random movement of the sensor nodes. Our first data gathering algorithm is stability-oriented and it is based on the idea of finding a maximum spanning tree on a network graph whose edge weights are predicted link expiration times (LET). Referred to as the LET-DG tree, the data gathering tree has been observed to be more stable in the presence of node mobility. However, stability-based data gathering coupled with more leaf nodes has been observed to result in unfair use of certain nodes (the intermediate nodes spend more energy compared to leaf nodes), triggering pre-mature node failures eventually leading to network failure (disconnection of the network of live nodes). As an alternative, we propose an algorithm to determine a minimum-distance spanning tree (MST) based data gathering tree that is more energy-efficient and prolongs the node and network lifetimes, at the cost frequent tree reconfigurations
Airborne Directional Networking: Topology Control Protocol Design
This research identifies and evaluates the impact of several architectural design choices in relation to airborne networking in contested environments related to autonomous topology control. Using simulation, we evaluate topology reconfiguration effectiveness using classical performance metrics for different point-to-point communication architectures. Our attention is focused on the design choices which have the greatest impact on reliability, scalability, and performance. In this work, we discuss the impact of several practical considerations of airborne networking in contested environments related to autonomous topology control modeling. Using simulation, we derive multiple classical performance metrics to evaluate topology reconfiguration effectiveness for different point-to-point communication architecture attributes for the purpose of qualifying protocol design elements
Network coding for reliable wireless sensor networks
Wireless sensor networks are used in many applications and are now a key element
in the increasingly growing Internet of Things. These networks are composed of
small nodes including wireless communication modules, and in most of the cases
are able to autonomously con gure themselves into networks, to ensure sensed data
delivery. As more and more sensor nodes and networks join the Internet of Things,
collaboration between geographically distributed systems are expected. Peer to peer
overlay networks can assist in the federation of these systems, for them to collaborate.
Since participating peers/proxies contribute to storage and processing, there is no
burden on speci c servers and bandwidth bottlenecks are avoided.
Network coding can be used to improve the performance of wireless sensor networks.
The idea is for data from multiple links to be combined at intermediate encoding
nodes, before further transmission. This technique proved to have a lot of potential
in a wide range of applications. In the particular case of sensor networks, network
coding based protocols and algorithms try to achieve a balance between low packet
error rate and energy consumption. For network coding based constrained networks
to be federated using peer to peer overlays, it is necessary to enable the storage
of encoding vectors and coded data by such distributed storage systems. Packets
can arrive to the overlay through any gateway/proxy (peers in the overlay), and lost
packets can be recovered by the overlay (or client) using original and coded data that
has been stored. The decoding process requires a decoding service at the overlay
network. Such architecture, which is the focus of this thesis, will allow constrained
networks to reduce packet error rate in an energy e cient way, while bene ting from an e ective distributed storage solution for their federation. This will serve as
a basis for the proposal of mathematical models and algorithms that determine the
most e ective routing trees, for packet forwarding toward sink/gateway nodes, and
best amount and placement of encoding nodes.As redes de sensores sem fios são usadas em muitas aplicações e são hoje consideradas um elemento-chave para o desenvolvimento da Internet das Coisas. Compostas por nós de pequena dimensão que incorporam módulos de comunicação sem fios, grande parte destas redes possuem a capacidade de se configurarem de forma autónoma, formando sistemas em rede para garantir a entrega dos dados recolhidos. (…
Efficient Passive Clustering and Gateways selection MANETs
Passive clustering does not employ control packets to collect topological information in ad hoc networks. In our proposal, we avoid making frequent changes in cluster architecture due to repeated election and re-election of cluster heads and gateways. Our primary objective has been to make Passive Clustering more practical by employing optimal number of gateways and reduce the number of rebroadcast packets
Topology control and data handling in wireless sensor networks
Our work in this thesis have provided two distinctive contributions to WSNs in the
areas of data handling and topology control.
In the area of data handling, we have demonstrated a solution to improve the
power efficiency whilst preserving the important data features by data compression
and the use of an adaptive sampling strategy, which are applicable to the specific
application for oceanography monitoring required by the SECOAS project. Our work
on oceanographic data analysis is important for the understanding of the data we are
dealing with, such that suitable strategies can be deployed and system performance
can be analysed. The Basic Adaptive Sampling Scheduler (BASS) algorithm uses
the statistics of the data to adjust the sampling behaviour in a sensor node according
to the environment in order to conserve energy and minimise detection delay.
The motivation of topology control (TC) is to maintain the connectivity of the
network, to reduce node degree to ease congestion in a collision-based medium access
scheme; and to reduce power consumption in the sensor nodes. We have developed
an algorithm Subgraph Topology Control (STC) that is distributed and does not
require additional equipment to be implemented on the SECOAS nodes. STC uses
a metric called subgraph number, which measures the 2-hops connectivity in the
neighbourhood of a node. It is found that STC consistently forms topologies that
have lower node degrees and higher probabilities of connectivity, as compared to k-Neighbours, an alternative algorithm that does not rely on special hardware on sensor
node. Moreover, STC also gives better results in terms of the minimum degree in the
network, which implies that the network structure is more robust to a single point
of failure. As STC is an iterative algorithm, it is very scalable and adaptive and is
well suited for the SECOAS applications
- …