Hailong Huang

I-UMDPC: The Improved-Unusual Message Delivery Path Construction for Wireless Sensor Networks With Mobile Sinks

This paper considers the data delivery delay problem in wireless sensor networks. The delivery delay is a significant measure when the data freshness is the first concern of users. The goal of this paper is to route delay-sensitive data to mobile nodes (M nodes) within an allowed latency. The data collection system is composed of a set of M nodes amounted on buses, a set of sensor nodes to detect the interested phenomenon and a set of special nodes deployed at bus stops to assist data routing. An optimization-based approach called improved-unusual message delivery path construction (I-UMDPC) is proposed. Considering the actual features of bus operation, two aspects of uncertainties are accounted in our approach: 1) the bus arrival time and 2) the stop duration. Extensive simulations as well as practical experiments on our testbed demonstrate that I-UMDPC is able to route delay-sensitive data reliably and efficiently and performs better than existing work.

Viable path planning for data collection robots in a sensing field with obstacles

Abstract Introducing mobile robots into wireless sensor networks to collect data can balance the energy dissipation through the entire network and then improve the network lifetime. In this context, path management is a crucial problem since it impacts on the system performance such as data delivery delay and energy consumption. In this paper, we consider the problem of planning paths for unicycle robots (with constant speed and bounded angular velocity) to visit a set of sensor nodes in a sensing field with obstacles while minimizing the path lengths. Several practical issues that have not been sufficiently addressed so far are taken into account. As the combination of concerns from robotics and sensor networks, a viable path is defined, which is smooth, collision free with sensor nodes and obstacles, closed and let the robot to read all the data from sensor nodes. To design the shortest viable path for the underlying robots, a Shortest Viable Path Planning (SVPP) algorithm is first developed for single robot. Due to the physical speed, using single robot to collect data in a large scale network may result in a long collection time. Then, a k -Shortest Viable Path Planning ( k -SVPP) algorithm to construct k paths of approximately equal lengths is proposed. Through extensive simulations, we demonstrate the effectiveness of the proposed algorithms and show their advantages over the alternatives.

Data Collection in Nonuniformly Deployed Wireless Sensor Networks by Public Transportation Vehicles

This paper studies the problem of using path constrained mobile sinks (MSs) to collect data in Wireless Sensor Networks (WSNs). Accounting the feature of nonuniform node distribution, the proposed protocol aims at balancing the energy consumption, including energy expenditure to transmit data packet and network overhead, to make the network operate as long as possible with all nodes alive. We propose an energy-aware unequal clustering algorithm and an energy-aware routing algorithm. Through simulations, we confirm that the proposed approach achieves longer network lifetime against alternatives.

Optimal Aircraft Planar Navigation in Static Threat Environments

We consider the problem of navigating a military aircraft in a threat environment to its final destination while minimizing the maximum threat level and the length of the aircraft path. The proposed method to construct optimal low-risk aircraft paths involves a simple geometric procedure and is very computationally efficient. The effectiveness of the developed algorithm is illustrated by a number of examples and comparisons with a fuzzy logic based algorithm.