371 research outputs found

    RTXP : A Localized Real-Time Mac-Routing Protocol for Wireless Sensor Networks

    Get PDF
    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

    Let the Tree Bloom: Scalable Opportunistic Routing with ORPL

    Get PDF
    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

    On the Impact of Geometry on Ad Hoc Communication in Wireless Networks

    Full text link
    In this work we address the question how important is the knowledge of geometric location and network density to the efficiency of (distributed) wireless communication in ad hoc networks. We study fundamental communication task of broadcast and develop well-scalable, randomized algorithms that do not rely on GPS information, and which efficiency formulas do not depend on how dense the geometric network is. We consider two settings: with and without spontaneous wake-up of nodes. In the former setting, in which all nodes start the protocol at the same time, our algorithm accomplishes broadcast in O(Dlogn+log2n)O(D\log n + \log^2 n) rounds under the SINR model, with high probability (whp), where DD is the diameter of the communication graph and nn is the number of stations. In the latter setting, in which only the source node containing the original message is active in the beginning, we develop a slightly slower algorithm working in O(Dlog2n)O(D\log^2 n) rounds whp. Both algorithms are based on a novel distributed coloring method, which is of independent interest and potential applicability to other communication tasks under the SINR wireless model

    Deterministic blind radio networks

    Get PDF
    Ad-hoc radio networks and multiple access channels are classical and well-studied models of distributed systems, with a large body of literature on deterministic algorithms for fundamental communications primitives such as broadcasting and wake-up. However, almost all of these algorithms assume knowledge of the number of participating nodes and the range of possible IDs, and often make the further assumption that the latter is linear in the former. These are very strong assumptions for models which were designed to capture networks of weak devices organized in an ad-hoc manner. It was believed that without this knowledge, deterministic algorithms must necessarily be much less efficient. In this paper we address this fundamental question and show that this is not the case. We present deterministic algorithms for blind networks (in which nodes know only their own IDs), which match or nearly match the running times of the fastest algorithms which assume network knowledge (and even surpass the previous fastest algorithms which assume parameter knowledge but not small labels)

    HEH-BMAC: hybrid polling MAC protocol for WBANs operated by human energy harvesting

    Get PDF
    This paper introduces human energy harvesting medium access control (MAC) protocol (HEH-BMAC), a hybrid polling MAC suitable for wireless body area networks powered by human energy harvesting. The proposed protocol combines two different medium access methods, namely polling (ID-polling) and probabilistic contention access, to adapt its operation to the different energy and state (active/inactive) changes that the network nodes may experience due to their random nature and the time variation of the energy harvesting sources. HEH-BMAC exploits the packet inter-arrival time and the energy harvesting rate information of each node to implement an efficient access scheme with different priority levels. In addition, our protocol can be applied dynamically in realistic networks, since it is adaptive to the topology changes, allowing the insertion/removal of wireless sensor nodes. Extensive simulations have been conducted in order to evaluate the protocol performance and study the throughput and energy tradeoffs.Peer ReviewedPostprint (author's final draft

    Energy-efficient wireless sensor networks via scheduling algorithm and radio Wake-up technology

    Get PDF
    One of the most important requirements for wireless sensor networks (WSNs) is the energy efficiency, since sensors are usually fed by a battery that cannot be replaced or recharged. Radio wake-up - the technology that lets a sensor completely turn off and be reactivated by converting the electromagnetic field of radio waves into energy - is now one of the most emergent strategies in the design of wireless sensor networks. This work presents Scheduled on Demand Radio WakeUp (SORW), a flexible scheduler designed for a wireless sensor network where duty cycling strategy and radio wake-up technology are combined in order to optimize the network lifetime. In particular, it tries to keep sensors sleeping as much as possible, still guaranteeing a minimum number of detections per unit of time. Performances of SORW are provided through the use of OMNet++ simulator and compared to results obtained by other basic approaches. Results show that with SORW it is possible to reach a theoretical lifetime of several years, compared to simpler schedulers that only reach days of activity of the network

    Wireless industrial monitoring and control networks: the journey so far and the road ahead

    Get PDF
    While traditional wired communication technologies have played a crucial role in industrial monitoring and control networks over the past few decades, they are increasingly proving to be inadequate to meet the highly dynamic and stringent demands of today’s industrial applications, primarily due to the very rigid nature of wired infrastructures. Wireless technology, however, through its increased pervasiveness, has the potential to revolutionize the industry, not only by mitigating the problems faced by wired solutions, but also by introducing a completely new class of applications. While present day wireless technologies made some preliminary inroads in the monitoring domain, they still have severe limitations especially when real-time, reliable distributed control operations are concerned. This article provides the reader with an overview of existing wireless technologies commonly used in the monitoring and control industry. It highlights the pros and cons of each technology and assesses the degree to which each technology is able to meet the stringent demands of industrial monitoring and control networks. Additionally, it summarizes mechanisms proposed by academia, especially serving critical applications by addressing the real-time and reliability requirements of industrial process automation. The article also describes certain key research problems from the physical layer communication for sensor networks and the wireless networking perspective that have yet to be addressed to allow the successful use of wireless technologies in industrial monitoring and control networks
    corecore