5 research outputs found
Cooperative Coded Data Dissemination for Wireless Sensor Networks
In this poster paper we present a data dissemination transmission abstraction
for over the air programming (OAP) protocol which is fundamentally different
from the previous hop by hop transmission protocols. Instead of imposing the
greedy requirement that at least one node in the ith hop receives all packets
before transmitting packets to the next hop and its neighbours, we take
advantage of the spatial diversity and broadcast nature of wireless
transmission to adopt a cooperative approach in which node broadcast whatever
packets it has received with the expectation that it will recover the lost
packets with high probability by overhearing the broadcast transmissions of its
neighbours. The use of coded transmissions ensures that this does not lead to
the broadcast storm problem. We validate the improved performance our of
proposed transmission scheme with respect to the previous state of the art OAP
protocols on a proof-of-concept two-hops TelosB wireless sensor network
testbed.Comment: This paper appears in: 2016 13th Annual IEEE International Conference
on Sensing, Communication, and Networking (SECON), London, 2016, pp. 1-
Link quality aware channel allocation for multichannel body sensor networks.
Body Sensor Network (BSN) is a typical Internet-of-Things (IoT) application for personalized health care. It consists of economically powered, wireless and implanted medical monitoring sensor nodes, which are designed to continually collect the medical information of the target patients. Multichannel is often used in BSNs to reduce the spectrum competition of the tremendous sensor nodes and the problem of channel assignment has attracted much research attention. The health sensing data in BSNs is often required to be delivered to a sink node (or server) before a certain deadline for real time monitoring or health emergency alarm. Therefore, deadline is of significant importance for multichannel allocation and scheduling. The existing works, though designed to meet the deadline, often overlook the impact of the unreliable wireless links. As a result, the health sensing data can still be overdue because of the scheduled lossy links. Besides, potential collisions in the schedules also incur considerable delay in delivering the sensing data. In this paper, we propose a novel deadline- driven Link quality Aware Channel Assignment scheme (LACA), where link quality, deadlines and collisions are jointly considered. LACA prioritizes links with urgent deadlines and heavy collisions. Besides, LACA allows the exploition of the spare slots for retransmissions on lossy links, which can further reduce the retransmission delay. Extensive simulation experiments show that compared to the existing approaches, LACA can better utilize the wireless spectrum and achieve higher packet delivery ratio before the deadline.N/
Link quality aware code dissemination in wireless sensor networks
Wireless reprogramming is a crucial technique for software deployment in wireless sensor networks (WSNs). Code dissemination is a basic building block to enable wireless repro-gramming. We present ECD, an Efficient Code Dissemination protocol leveraging 1-hop link quality information. Compared to prior works, ECD has three salient features. First, it supports dynamically configurable packet sizes. By increasing the packet size for high PHY rate radios, it significantly improves the transmission efficiency. Second, it employs an accurate sender selection algorithm to mitigate transmission collisions and transmissions over poor links. Third, it employs a simple impact-based backoff timer design to shorten the time spent in coordinating multiple eligible senders so that the largest impact sender is most likely to transmit. We implement ECD based on TinyOS and evaluate its performance extensively. Testbed experiments show that ECD outperforms state-of-the-art protocols, Deluge and MNP, in terms of completion time and data traffic. (e.g., about 20% less traffic and 20-30% shorter completion time compared to Deluge). © 2011 IEEE