1,028 research outputs found
Optimal CSMA-based Wireless Communication with Worst-case Delay and Non-uniform Sizes
Carrier Sense Multiple Access (CSMA) protocols have been shown to reach the
full capacity region for data communication in wireless networks, with
polynomial complexity. However, current literature achieves the throughput
optimality with an exponential delay scaling with the network size, even in a
simplified scenario for transmission jobs with uniform sizes. Although CSMA
protocols with order-optimal average delay have been proposed for specific
topologies, no existing work can provide worst-case delay guarantee for each
job in general network settings, not to mention the case when the jobs have
non-uniform lengths while the throughput optimality is still targeted. In this
paper, we tackle on this issue by proposing a two-timescale CSMA-based data
communication protocol with dynamic decisions on rate control, link scheduling,
job transmission and dropping in polynomial complexity. Through rigorous
analysis, we demonstrate that the proposed protocol can achieve a throughput
utility arbitrarily close to its offline optima for jobs with non-uniform sizes
and worst-case delay guarantees, with a tradeoff of longer maximum allowable
delay
Topology Construction in RPL Networks over Beacon-Enabled 802.15.4
In this paper, we propose a new scheme that allows coupling beacon-enabled
IEEE 802.15.4 with the RPL routing protocol while keeping full compliance with
both standards. We provide a means for RPL to pass the routing information to
Layer 2 before the 802.15.4 topology is created by encapsulating RPL DIO
messages in beacon frames. The scheme takes advantage of 802.15.4 command
frames to solicit RPL DIO messages. The effect of the command frames is to
reset the Trickle timer that governs sending DIO messages. We provide a
detailed analysis of the overhead incurred by the proposed scheme to understand
topology construction costs. We have evaluated the scheme using Contiki and the
instruction-level Cooja simulator and compared our results against the most
common scheme used for dissemination of the upper-layer information in
beacon-enabled PANs. The results show energy savings during the topology
construction phase and in the steady state
Markov Decision Processes with Applications in Wireless Sensor Networks: A Survey
Wireless sensor networks (WSNs) consist of autonomous and resource-limited
devices. The devices cooperate to monitor one or more physical phenomena within
an area of interest. WSNs operate as stochastic systems because of randomness
in the monitored environments. For long service time and low maintenance cost,
WSNs require adaptive and robust methods to address data exchange, topology
formulation, resource and power optimization, sensing coverage and object
detection, and security challenges. In these problems, sensor nodes are to make
optimized decisions from a set of accessible strategies to achieve design
goals. This survey reviews numerous applications of the Markov decision process
(MDP) framework, a powerful decision-making tool to develop adaptive algorithms
and protocols for WSNs. Furthermore, various solution methods are discussed and
compared to serve as a guide for using MDPs in WSNs
Unified clustering and communication protocol for wireless sensor networks
In this paper we present an energy-efficient cross layer protocol for providing application specific reservations in wireless senor networks called the “Unified Clustering and Communication Protocol ” (UCCP). Our modular cross layered framework satisfies three wireless sensor network requirements, namely, the QoS requirement of heterogeneous applications, energy aware clustering and data forwarding by relay sensor nodes. Our unified design approach is motivated by providing an integrated and viable solution for self organization and end-to-end communication is wireless sensor networks. Dynamic QoS based reservation guarantees are provided using a reservation-based TDMA approach. Our novel energy-efficient clustering approach employs a multi-objective optimization technique based on OR (operations research) practices. We adopt a simple hierarchy in which relay nodes forward data messages from cluster head to the sink, thus eliminating the overheads needed to maintain a routing protocol. Simulation results demonstrate that UCCP provides an energy-efficient and scalable solution to meet the application specific QoS demands in resource constrained sensor nodes. Index Terms — wireless sensor networks, unified communication, optimization, clustering and quality of service
WisperNet: Anti-Jamming for Wireless Sensor Networks
Resilience to electromagnetic jamming and its avoidance are difficult problems. It is often both hard to distinguish malicious jamming from congestion in the broadcast regime and a challenge to conceal the activity patterns of the legitimate communication protocol from the jammer. In the context of energy-constrained wireless sensor networks, nodes are scheduled to maximize the common sleep duration and coordinate communication to extend their battery life. This results in well-defined communication patterns with possibly predictable intervals of activity that are easily detected and jammed by a statistical jammer. We present an anti-jamming protocol for sensor networks which eliminates spatio-temporal patterns of communication while maintaining coordinated and contention-free communication across the network. Our protocol, WisperNet, is time-synchronized and uses coordinated temporal randomization for slot schedules and slot durations at the link layer and adapts routes to avoid jammers in the network layer. Through analysis, simulation and experimentation we demonstrate that WisperNet reduces the efficiency of any statistical jammer to that of a random jammer, which has the lowest censorship-to-link utilization ratio. WisperNet is more energy efficient than low-power listen CSMA protocols such as B-mac and is simple to analyze in terms of effective network throughput, reliability and delay. WisperNet has been implemented on the FireFly sensor network platform
A Case for Time Slotted Channel Hopping for ICN in the IoT
Recent proposals to simplify the operation of the IoT include the use of
Information Centric Networking (ICN) paradigms. While this is promising,
several challenges remain. In this paper, our core contributions (a) leverage
ICN communication patterns to dynamically optimize the use of TSCH (Time
Slotted Channel Hopping), a wireless link layer technology increasingly popular
in the IoT, and (b) make IoT-style routing adaptive to names, resources, and
traffic patterns throughout the network--both without cross-layering. Through a
series of experiments on the FIT IoT-LAB interconnecting typical IoT hardware,
we find that our approach is fully robust against wireless interference, and
almost halves the energy consumed for transmission when compared to CSMA. Most
importantly, our adaptive scheduling prevents the time-slotted MAC layer from
sacrificing throughput and delay
- …