Route Swarm: Wireless Network Optimization through Mobility

In this paper, we demonstrate a novel hybrid architecture for coordinating networked robots in sensing and information routing applications. The proposed INformation and Sensing driven PhysIcally REconfigurable robotic network (INSPIRE), consists of a Physical Control Plane (PCP) which commands agent position, and an Information Control Plane (ICP) which regulates information flow towards communication/sensing objectives. We describe an instantiation where a mobile robotic network is dynamically reconfigured to ensure high quality routes between static wireless nodes, which act as source/destination pairs for information flow. The ICP commands the robots towards evenly distributed inter-flow allocations, with intra-flow configurations that maximize route quality. The PCP then guides the robots via potential-based control to reconfigure according to ICP commands. This formulation, deemed Route Swarm, decouples information flow and physical control, generating a feedback between routing and sensing needs and robotic configuration. We demonstrate our propositions through simulation under a realistic wireless network regime.Comment: 9 pages, 4 figures, submitted to the IEEE International Conference on Intelligent Robots and Systems (IROS) 201

Nodes Placement for reducing Energy Consumption in Multimedia Transmissions

International audiencePower consumption is an essential issue in wireless multimedia sensor networks (WMSNs) due to the elevated processing capabilities requested by the video acquisition hardware installed on the generic sensor node. Hence, node placement scheme in WMSNs greatly impacts the overall network lifetime. In this context, the paper first proposes a suitable hardware architecture to implement a feasible WMS node based on off-the-shelf technology, then it evaluates the energy consumption obtained throughout a wise "energy-spaced" placement of the wireless nodes without affecting the video quality of multimedia traffic

A FRAMEWORK FOR CONSERVING POWER IN MANETS

The idea of using controllable relay nodes for designing mobile systems has been explored by several researchers. The main objective of this paper is to design a framework for deploying relay nodes with controlled mobility to conserve power in MANET. To meet out this proposal, a heterogeneous network consisting of traditional nodes with limited energy and relay nodes with more energy resources are considered. The deployment of relay nodes are based on the following two methods: 1. Min-Total, aims to minimize the total energy consumption of all the traditional nodes in the network. 2. Min-Max, aims to minimize the energy consumed by a traditional node in the network. The solution of these two methods can be used to prioritize each individual node in the network. The trade-offs involved in deploying an increasing/decreasing fraction of relay nodes, varying node weights, varying epoch duration is analyzed. This framework aims at dynamically combining both Min-Total and Min-Max based on the characteristics and requirements of the network

Simulations of the Impact of Controlled Mobility for Routing Protocols

This paper addresses mobility control routing in wireless networks. Given a data flow request between a source-destination pair, the problem is to move nodes towards the best placement, such that the performance of the network is improved. Our purpose is to find the best nodes selection depending on the minimization of the maximum distance that nodes have to travel to reach their final position. We propose a routing protocol, the Routing Protocol based on Controlled Mobility (RPCM), where the chosen nodes' path minimizes the total travelled distance to reach desirable position. Specifically, controlled mobility is intended as a new design dimension network allowing to drive nodes to specific best position in order to achieve some common objectives. The main aim of this paper is to show by simulation the effectiveness of controlled mobility when it is used as a new design dimension in wireless networks. Extensive simulations are conducted to evaluate the proposed routing algorithm. Results show how our protocol outperforms a well-known routing protocol, the Ad hoc On Demand Distance Vector routing (AODV), in terms of throughput, average end-to-end data packet delay and energy spent to send a packet unit

Optimal Guidance of a Relay Aircraft to Extend Small Unmanned Aircraft Range

This paper developed guidance laws to optimally and autonomously position a relay Micro Aerial Vehicle (MAV) to provide an operator with real-time Intelligence, Surveillance, and Reconnaissance (ISR) by relaying communication and video signals from a rover MAV to the base, thus extending the rover\u27s reach. The ISR system is comprised of two MAVs, the Relay and the Rover, and a Base. The Relay strives to position itself so as to minimize the radio frequency (RF) power required for maintaining communications between the Rover and the Base, while the Rover performs the ISR mission, which may maximize the required RF power. The optimal control of the Relay MAV then entails the solution of a differential game. Applying Pontryagin\u27s Maximum Principle yields a standard, albeit nonlinear, Two-Point Boundary Value Problem (TPBVP). Suboptimal solutions are first obtained as an aid in solving the TPBVP which yields the solution of the differential game. One suboptimal approach is based upon the geometry of the ISR system: The midpoint between the Rover and the Base is the ideal location which minimizes the RF power required, so the Relay heads toward that point—assuming that the Rover is stationary. At the same time, to maximize the rate of required RF power, the Rover moves in the opposite direction of the Relay—assuming the Relay is stationary. These are optimal strategies in the end-game, but it is suboptimal to use them throughout the game. Another suboptimal approach investigated envisions the Rover to remain stationary and solves for the optimal path for the Relay to minimize the RF power requirement. This one-sided optimization problem is analyzed using a Matlab-based optimization program, GPOCS, which uses the Gauss pseudospectral method of discretization. The results from GPOCS corroborated with the geometry-based suboptimal Relay strategy of heading straight toward the midpoint between the Rover and the Base. The suboptimal solutions are readily implementable for real-time operation and are used to facilitate the solutions of the TPBVP