On Leveraging Partial Paths in Partially-Connected Networks

Mobile wireless network research focuses on scenarios at the extremes of the network connectivity continuum where the probability of all nodes being connected is either close to unity, assuming connected paths between all nodes (mobile ad hoc networks), or it is close to zero, assuming no multi-hop paths exist at all (delay-tolerant networks). In this paper, we argue that a sizable fraction of networks lies between these extremes and is characterized by the existence of partial paths, i.e. multi-hop path segments that allow forwarding data closer to the destination even when no end-to-end path is available. A fundamental issue in such networks is dealing with disruptions of end-to-end paths. Under a stochastic model, we compare the performance of the established end-to-end retransmission (ignoring partial paths), against a forwarding mechanism that leverages partial paths to forward data closer to the destination even during disruption periods. Perhaps surprisingly, the alternative mechanism is not necessarily superior. However, under a stochastic monotonicity condition between current v.s. future path length, which we demonstrate to hold in typical network models, we manage to prove superiority of the alternative mechanism in stochastic dominance terms. We believe that this study could serve as a foundation to design more efficient data transfer protocols for partially-connected networks, which could potentially help reducing the gap between applications that can be supported over disconnected networks and those requiring full connectivity.Comment: Extended version of paper appearing at IEEE INFOCOM 2009, April 20-25, Rio de Janeiro, Brazi

The impact of mobility models on the performance of mobile Ad Hoc network routing protocol

A mobility model represents nodes distribution and movement over the network. Several research works have shown that a selection of mobility model can affect the outcome of routing performance simulation in Mobile Ad Hoc Networks. Thus, a routing protocol may only be effective in a particular mobility model or scenario but performs inferiorly in another. As a result, analyses of routing protocol performance are often based on inadequate information leading to inaccurate argument and conclusion. In this paper, three different mobility models have been selected, where each of them is highly distinctive in terms of nodes movement behavior. In addition, a new measurement technique called probability of route connectivity is introduced. The technique is used to quantify the success rate of route established by a routing protocol. Extensive simulation runs are done and results are compared between each mobility model

Energy managed reporting for wireless sensor networks

In this paper, we propose a technique to extend the network lifetime of a wireless sensor network, whereby each sensor node decides its individual network involvement based on its own energy resources and the information contained in each packet. The information content is ascertained through a system of rules describing prospective events in the sensed environment, and how important such events are. While the packets deemed most important are propagated by all sensor nodes, low importance packets are handled by only the nodes with high energy reserves. Results obtained from simulations depicting a wireless sensor network used to monitor pump temperature in an industrial environment have shown that a considerable increase in the network lifetime and network connectivity can be obtained. The results also show that when coupled with a form of energy harvesting, our technique can enable perpetual network operatio

Implementation of a herd management system with wireless sensor networks

This paper investigates an adaptation of Wireless Sensor Networks (WSNs) to cattle monitoring applications. The proposed solution facilitates the requirement for continuously assessing the condition of individual animals, aggregating and reporting this data to the farm manager. There are several existing approaches to achieving animal monitoring, ranging from using a store and forward mechanism to employing GSM-based techniques; these approaches only provide sporadic information and introduce a considerable cost in staffing and physical hardware. The core of this study is to overcome the aforementioned drawbacks by using alternative cheap, low power consumption sensor nodes capable of providing real-time communication at a reasonable hardware cost. In this paper, both the hardware and software has been designed to provide a solution which can obtain real-time data from dairy cattle whilst conforming to the limitations associated with WSNs implementations

The Bus Goes Wireless: Routing-Free Data Collection with QoS Guarantees in Sensor Networks

Abstract—We present the low-power wireless bus (LWB), a new communication paradigm for QoS-aware data collection in lowpower sensor networks. The LWB maps all communication onto network floods by using Glossy, an efficient flooding architecture for wireless sensor networks. Therefore, unlike current solutions, the LWB requires no information of the network topology, and inherently supports networks with mobile nodes and multiple data sinks. A LWB prototype implemented in Contiki guarantees bounded end-to-end communication delay and duplicate-free, inorder packet delivery—key QoS requirements in many control and mission-critical applications. Experiments on two testbeds demonstrate that the LWB prototype outperforms state-of-theart data collection and link layer protocols, in terms of reliability and energy efficiency. For instance, we measure an average radio duty cycle of 1.69 % and an overall data yield of 99.97 % in a typical data collection scenario with 85 sensor nodes on Twist. I