A testbed for MANETs: Implementation, experiences and learned lessons

In this paper, we present the implementation, experiences and lessons learned of our tesbed for Ad-hoc networks and Mobile Ad hoc Networks (MANETs). We used OLSR protocol for real experimental evaluation. We investigate the effect of mobility and topology changing in the throughput of a MANET. We study the impact of best-effort traffic for Mesh Topology and Linear Topology. In this work, we consider eight experimental models and we assess the performance of our testbed in terms of throughput, round trip time and packet loss. We found that some of the OLSR's problems can be solved, for instance the routing loop, but this protocol still has the self-interference problem. Also, there is an intricate interdependence between MAC layer and routing layer. We carried out the experiments considering stationary nodes of an Ad-hoc network and the node mobility of MANETs. We found that throughput of TCP was improved by reducing Link Quality Window Size (LQWS). For TCP data flow, we got better results when the LQWS value was 10. Moreover, we found that the node join and leave operations increase the packet loss. The OLSR protocol has a good performance when the source node is moving. However, the performance is not good when the relay nodes are moving.Peer ReviewedPostprint (published version

Let the Tree Bloom: Scalable Opportunistic Routing with ORPL

Routing in battery-operated wireless networks is challenging, posing a tradeoff between energy and latency. Previous work has shown that opportunistic routing can achieve low-latency data collection in duty-cycled networks. However, applications are now considered where nodes are not only periodic data sources, but rather addressable end points generating traffic with arbitrary patterns. We present ORPL, an opportunistic routing protocol that supports any-to-any, on-demand traffic. ORPL builds upon RPL, the standard protocol for low-power IPv6 networks. By combining RPL's tree-like topology with opportunistic routing, ORPL forwards data to any destination based on the mere knowledge of the nodes' sub-tree. We use bitmaps and Bloom filters to represent and propagate this information in a space-efficient way, making ORPL scale to large networks of addressable nodes. Our results in a 135-node testbed show that ORPL outperforms a number of state-of-the-art solutions including RPL and CTP, conciliating a sub-second latency and a sub-percent duty cycle. ORPL also increases robustness and scalability, addressing the whole network reliably through a 64-byte Bloom filter, where RPL needs kilobytes of routing tables for the same task

Low Power, Low Delay: Opportunistic Routing meets Duty Cycling

Traditionally, routing in wireless sensor networks consists of two steps: First, the routing protocol selects a next hop, and, second, the MAC protocol waits for the intended destination to wake up and receive the data. This design makes it difficult to adapt to link dynamics and introduces delays while waiting for the next hop to wake up. In this paper we introduce ORW, a practical opportunistic routing scheme for wireless sensor networks. In a dutycycled setting, packets are addressed to sets of potential receivers and forwarded by the neighbor that wakes up first and successfully receives the packet. This reduces delay and energy consumption by utilizing all neighbors as potential forwarders. Furthermore, this increases resilience to wireless link dynamics by exploiting spatial diversity. Our results show that ORW reduces radio duty-cycles on average by 50% (up to 90% on individual nodes) and delays by 30% to 90% when compared to the state of the art

Real-life performance of protocol combinations for wireless sensor networks

Wireless sensor networks today are used for many and diverse applications like nature monitoring, or process and wireless building automation. However, due to the limited access to large testbeds and the lack of benchmarking standards, the real-life evaluation of network protocols and their combinations remains mostly unaddressed in current literature. To shed further light upon this matter, this paper presents a thorough experimental performance analysis of six protocol combinations for TinyOS. During these protocol assessments, our research showed that the real-life performance often differs substantially from the expectations. Moreover, we found that combining protocols is far from trivial, as individual network protocols may perform very different in combination with other protocols. The results of our research emphasize the necessity of a flexible generic benchmarking framework, powerful enough to evaluate and compare network protocols and their combinations in different use cases

Efficient Mobile Data Collection with Mobile Collect

WISENET (NES)PromosCONE

Supporting protocol-independent adaptive QoS in wireless sensor networks

Next-generation wireless sensor networks will be used for many diverse applications in time-varying network/environment conditions and on heterogeneous sensor nodes. Although Quality of Service (QoS) has been ignored for a long time in the research on wireless sensor networks, it becomes inevitably important when we want to deliver an adequate service with minimal efforts under challenging network conditions. Until now, there exist no general-purpose QoS architectures for wireless sensor networks and the main QoS efforts were done in terms of individual protocol optimizations. In this paper we present a novel layerless QoS architecture that supports protocol-independent QoS and that can adapt itself to time-varying application, network and node conditions. We have implemented this QoS architecture in TinyOS on TmoteSky sensor nodes and we have shown that the system is able to support protocol-independent QoS in a real life office environment