Combined Coverage Area Reporting and Geographical Routing in Wireless Sensor-Actuator Networks for Cooperating with Unmanned Aerial Vehicles

In wireless sensor network (WSN) applications with multiple gateways, it is key to route location dependent subscriptions efficiently at two levels in the system. At the gateway level, data sinks must not waste the energy of the WSN by injecting subscriptions that are not relevant for the nodes in their coverage area and at WSN level, energy-efficient delivery of subscriptions to target areas is required. In this paper, we propose a mechanism in which (1) the WSN provides an accurate and up-to-date coverage area description to gateways and (2) the wireless sensor network re-uses the collected coverage area information to enable efficient geographical routing of location dependent subscriptions and other messages. The latter has a focus on routing of messages injected from sink nodes to nodes in the region of interest. Our proposed mechanisms are evaluated in simulation

Void Traversal for Guaranteed Delivery in Geometric Routing

Geometric routing algorithms like GFG (GPSR) are lightweight, scalable algorithms that can be used to route in resource-constrained ad hoc wireless networks. However, such algorithms run on planar graphs only. To efficiently construct a planar graph, they require a unit-disk graph. To make the topology unit-disk, the maximum link length in the network has to be selected conservatively. In practical setting this leads to the designs where the node density is rather high. Moreover, the network diameter of a planar subgraph is greater than the original graph, which leads to longer routes. To remedy this problem, we propose a void traversal algorithm that works on arbitrary geometric graphs. We describe how to use this algorithm for geometric routing with guaranteed delivery and compare its performance with GFG

Impact of Correlated Mobility on Delay-Throughput Performance in Mobile Ad-Hoc Networks

Abstract—We extend the analysis of the scaling laws of wireless ad hoc networks to the case of correlated nodes movements, which are commonly found in real mobility processes. We consider a simple version of the Reference Point Group Mobility model, in which nodes belonging to the same group are constrained to lie in a disc area, whose center moves uniformly across the network according to the i.i.d. model. We assume fast mobility conditions, and take as primary goal the maximization of pernode throughput. We discover that correlated node movements have huge impact on asymptotic throughput and delay, and can sometimes lead to better performance than the one achievable under independent nodes movements. I. INTRODUCTION AND RELATED WORK In the last few years the store-carry-forward communication paradigm, which allows nodes to physically carry buffered dat

Restricted Mobility Improves Delay-Throughput Trade-offs in Mobile Ad-Hoc Networks

In this paper we revisit two classes of mobility models which are widely used to repre-sent users ’ mobility in wireless networks: Random Waypoint (RWP) and Random Direction (RD). For both models we obtain systems of partial differential equations which describe the evolution of the users ’ distribution. For the RD model, we show how the equations can be solved analytically both in the stationary and transient regime adopting standard mathematical techniques. Our main contributions are i) simple expressions which relate the transient dura-tion to the model parameters; ii) the definition of a generalized random direction model whose stationary distribution of mobiles in the physical space corresponds to an assigned distribution