12,794 research outputs found
Design Aspects of An Energy-Efficient, Lightweight Medium Access Control Protocol for Wireless Sensor Networks
This document gives an overview of the most relevant design aspects of the lightweight medium access control (LMAC) protocol [16] for wireless sensor networks (WSNs). These aspects include selfconfiguring and localized operation of the protocol, time synchronization in multi-hop networks, network setup and strategies to reduce latency.\ud
The main goal in designing a MAC protocol for WSNs is to minimize energy waste - due to collisions of messages and idle listening - , while limiting latency and loss of data throughput. It is shown that the LMAC protocol performs well on energy-efficiency and delivery ratio [19] and can\ud
ensure a long-lived, self-configuring network of battery-powered wireless sensors.\ud
The protocol is based upon scheduled access, in which each node periodically gets a time slot, during which it is allowed to transmit. The protocol does not depend on central managers to assign time slots to nodes.\ud
WSNs are assumed to be multi-hop networks, which allows for spatial reuse of time slots, just like frequency reuse in GSM cells. In this document, we present a distributed algorithm that allows nodes to find unoccupied time slots, which can be used without causing collision or interference to other nodes. Each node takes one time slot in control to\ud
carry out its data transmissions. Latency is affected by the actual choice of controlled time slot. We present time slot choosing strategies, which ensure a low latency for the most common data traffic in WSNs: reporting of sensor readings to central sinks
Performance Evaluation of IEEE 802.15.4 for Mobile Sensor Network
The IEEE 802.15.4 standard medium access control (MAC) protocol for low rate wireless personal area networks (LRWPAN) is design mainly for static sensor networks and its capability to support mobile sensor networks has not yet been established. To the best knowledge of authors, this is the first paper that evaluates the suitability of IEEE 802.15.4 MAC in mobile sensor networks environment. We evaluate the performance based on node\u27s speed and beacon order, and observe the effect on energy usage, packet delivery ratio and time required to associate with its coordinator. From the experiment we observe that the moving nodes experienced serious problems in association and synchronization and show results on energy usage, throughput , association and reassociation rate with different speeds of moving node. We also identify some key research problems that need to be addressed for successful implementations of IEEE 802.15..4 in mobile sensor networks environment
Homomorphic Filtering for Improving Time Synchronization in Wireless Networks
Wireless sensor networks are used to sample the environment in a distributed way.
Therefore, it is mandatory for all of the measurements to be tightly synchronized in order to guarantee
that every sensor is sampling the environment at the exact same instant of time. The synchronization
drift gets bigger in environments suffering from temperature variations. Thus, this work is focused
on improving time synchronization under deployments with temperature variations. The working
hypothesis demonstrated in this work is that the clock skew of two nodes (the ratio of the real
frequencies of the oscillators) is composed of a multiplicative combination of two main components:
the clock skew due to the variations between the cut of the crystal of each oscillator and the clock
skew due to the different temperatures affecting the nodes. By applying a nonlinear filtering,
the homomorphic filtering, both components are separated in an effective way. A correction factor
based on temperature, which can be applied to any synchronization protocol, is proposed. For testing
it, an improvement of the FTSP synchronization protocol has been developed and physically
tested under temperature variation scenarios using TelosB motes flashed with the IEEE 802.15.4
implementation supplied by TinyOS
Comparison of CSMA based MAC protocols of wireless sensor networks
Energy conservation has been an important area of interest in Wireless Sensor
networks (WSNs). Medium Access Control (MAC) protocols play an important role
in energy conservation. In this paper, we describe CSMA based MAC protocols for
WSN and analyze the simulation results of these protocols. We implemented
S-MAC, T-MAC, B-MAC, B-MAC+, X-MAC, DMAC and Wise-MAC in TOSSIM, a simulator
which unlike other simulators simulates the same code running on real hardware.
Previous surveys mainly focused on the classification of MAC protocols
according to the techniques being used or problem dealt with and presented a
theoretical evaluation of protocols. This paper presents the comparative study
of CSMA based protocols for WSNs, showing which MAC protocol is suitable in a
particular environment and supports the arguments with the simulation results.
The comparative study can be used to find the best suited MAC protocol for
wireless sensor networks in different environments.Comment: International Journal of AdHoc Network Systems, Volume 2, Number 2,
April 201
RTXP : A Localized Real-Time Mac-Routing Protocol for Wireless Sensor Networks
Protocols developed during the last years for Wireless Sensor Networks (WSNs)
are mainly focused on energy efficiency and autonomous mechanisms (e.g.
self-organization, self-configuration, etc). Nevertheless, with new WSN
applications, appear new QoS requirements such as time constraints. Real-time
applications require the packets to be delivered before a known time bound
which depends on the application requirements. We particularly focus on
applications which consist in alarms sent to the sink node. We propose
Real-Time X-layer Protocol (RTXP), a real-time communication protocol. To the
best of our knowledge, RTXP is the first MAC and routing real-time
communication protocol that is not centralized, but instead relies only on
local information. The solution is cross-layer (X-layer) because it allows to
control the delays due to MAC and Routing layers interactions. RTXP uses a
suited hop-count-based Virtual Coordinate System which allows deterministic
medium access and forwarder selection. In this paper we describe the protocol
mechanisms. We give theoretical bound on the end-to-end delay and the capacity
of the protocol. Intensive simulation results confirm the theoretical
predictions and allow to compare with a real-time centralized solution. RTXP is
also simulated under harsh radio channel, in this case the radio link
introduces probabilistic behavior. Nevertheless, we show that RTXP it performs
better than a non-deterministic solution. It thus advocates for the usefulness
of designing real-time (deterministic) protocols even for highly unreliable
networks such as WSNs
Slotted ALOHA Overlay on LoRaWAN: a Distributed Synchronization Approach
LoRaWAN is one of the most promising standards for IoT applications.
Nevertheless, the high density of end-devices expected for each gateway, the
absence of an effective synchronization scheme between gateway and end-devices,
challenge the scalability of these networks. In this article, we propose to
regulate the communication of LoRaWAN networks using a Slotted-ALOHA (S-ALOHA)
instead of the classic ALOHA approach used by LoRa. The implementation is an
overlay on top of the standard LoRaWAN; thus no modification in pre-existing
LoRaWAN firmware and libraries is necessary. Our method is based on a novel
distributed synchronization service that is suitable for low-cost IoT
end-nodes. S-ALOHA supported by our synchronization service significantly
improves the performance of traditional LoRaWAN networks regarding packet loss
rate and network throughput.Comment: 4 pages, 8 figure
Fundamentals of Large Sensor Networks: Connectivity, Capacity, Clocks and Computation
Sensor networks potentially feature large numbers of nodes that can sense
their environment over time, communicate with each other over a wireless
network, and process information. They differ from data networks in that the
network as a whole may be designed for a specific application. We study the
theoretical foundations of such large scale sensor networks, addressing four
fundamental issues- connectivity, capacity, clocks and function computation.
To begin with, a sensor network must be connected so that information can
indeed be exchanged between nodes. The connectivity graph of an ad-hoc network
is modeled as a random graph and the critical range for asymptotic connectivity
is determined, as well as the critical number of neighbors that a node needs to
connect to. Next, given connectivity, we address the issue of how much data can
be transported over the sensor network. We present fundamental bounds on
capacity under several models, as well as architectural implications for how
wireless communication should be organized.
Temporal information is important both for the applications of sensor
networks as well as their operation.We present fundamental bounds on the
synchronizability of clocks in networks, and also present and analyze
algorithms for clock synchronization. Finally we turn to the issue of gathering
relevant information, that sensor networks are designed to do. One needs to
study optimal strategies for in-network aggregation of data, in order to
reliably compute a composite function of sensor measurements, as well as the
complexity of doing so. We address the issue of how such computation can be
performed efficiently in a sensor network and the algorithms for doing so, for
some classes of functions.Comment: 10 pages, 3 figures, Submitted to the Proceedings of the IEE
Overlapping Multi-hop Clustering for Wireless Sensor Networks
Clustering is a standard approach for achieving efficient and scalable
performance in wireless sensor networks. Traditionally, clustering algorithms
aim at generating a number of disjoint clusters that satisfy some criteria. In
this paper, we formulate a novel clustering problem that aims at generating
overlapping multi-hop clusters. Overlapping clusters are useful in many sensor
network applications, including inter-cluster routing, node localization, and
time synchronization protocols. We also propose a randomized, distributed
multi-hop clustering algorithm (KOCA) for solving the overlapping clustering
problem. KOCA aims at generating connected overlapping clusters that cover the
entire sensor network with a specific average overlapping degree. Through
analysis and simulation experiments we show how to select the different values
of the parameters to achieve the clustering process objectives. Moreover, the
results show that KOCA produces approximately equal-sized clusters, which
allows distributing the load evenly over different clusters. In addition, KOCA
is scalable; the clustering formation terminates in a constant time regardless
of the network size
- …