Energy-Efficient Data Transmission in Mobility-Aware Wireless Networks

Abstract

Data transmission scheme is an effective mode to improve the energy-efficiency in packet delivery. In this paper, we investigate the energy-efficient data transmission over reliable links and unreliable links in mobility-aware wireless networks. The network topologies in mobility-aware wireless networks are changed from one time slot to another, and they could be described by a sequence of static graphs. We first model these network topologies in a time period as a virtual space-time graph. On the virtual space-time graph, energy-efficient data transmission problems over reliable links and unreliable links are defined. The aim of the two data transmission problems is to find a spatial-temporal path with the minimum energy cost. Next, we propose an Energy-Efficient Data Transmission algorithm over Reliable Links (EEDT-RL) to find the optimal space-time path. Based on EEDT-RL, we also develop a heuristic data transmission protocol over unreliable links (named EEDT-UL), in which the path reliability is taken into consideration. Simulation results show that our proposed algorithms perform well in terms of energy cost and transmission count compared with some existing algorithms.

Delay bounded routing with the maximum belief degree for dynamic uncertain networks

“…By applying the virtual topology strategy [5,29], the operation time of the MCN can be divided into discrete time slices , , , , where is the initial time, and is the time interval. The value of is determined by the network change speed, as the connection relationship in the network should be stable in each time slice, and the distance between nodes should not change significantly.…”

“…In the MCN, the topology is dynamically changing, and several routing schemes have been proposed, such as shortest path first algorithm based on space-time graph [5,6], distributed routing algorithm [7], multicast routing algorithm [8], weighted semi-distributed routing algorithm [9], and multi-constraint quality of service routing algorithm [10].…”