Article

On Combining Shortest-Path and Back-Pressure Routing Over Multihop Wireless Networks

Dept. of Electr. & Comput. Eng., Iowa State Univ., Ames, IA, USA
IEEE/ACM Transactions on Networking (Impact Factor: 1.99). 07/2011; 19(3):841 - 854. DOI: 10.1109/TNET.2010.2094204
Source: DBLP

ABSTRACT Back-pressure-type algorithms based on the algorithm by Tassiulas and Ephremides have recently received much attention for jointly routing and scheduling over multihop wireless networks. However, this approach has a significant weakness in routing because the traditional back-pressure algorithm explores and exploits all feasible paths between each source and destination. While this extensive exploration is essential in order to maintain stability when the network is heavily loaded, under light or moderate loads, packets may be sent over unnecessarily long routes, and the algorithm could be very inefficient in terms of end-to-end delay and routing convergence times. This paper proposes a new routing/scheduling back-pressure algorithm that not only guarantees network stability (throughput optimality), but also adaptively selects a set of optimal routes based on shortest-path information in order to minimize average path lengths between each source and destination pair. Our results indicate that under the traditional back-pressure algorithm, the end-to-end packet delay first decreases and then increases as a function of the network load (arrival rate). This surprising low-load behavior is explained due to the fact that the traditional back-pressure algorithm exploits all paths (including very long ones) even when the traffic load is light. On the other-hand, the proposed algorithm adaptively selects a set of routes according to the traffic load so that long paths are used only when necessary, thus resulting in much smaller end-to-end packet delays as compared to the traditional back-pressure algorithm .

1 Follower
 · 
177 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The increase of demand for mobile data services requires a massive network densification. A cost-effective solution to this problem is to reduce cell size by deploying a low-cost all-wireless Network of Small Cells (NoS). These hyper-dense deployments create a wireless mesh backhaul among Small Cells (SCs) to transport control and data plane traffic. The semi-planned nature of SCs can often lead to dynamic wireless mesh backhaul topologies. This paper presents a self-organized backpressure routing scheme for dynamic SC deployments (BS) that combines queue backlog and geographic information to route traffic in dynamic NoS deployments. BS aims at relieving network congestion, while having a low routing stretch (i.e., the ratio of the hop count of the selected paths to that of the shortest path). Evaluation results show that, under uncongested conditions, BS shows similar performance to that of an Idealized Shortest PAth routing protocol (ISPA), while outperforming Greedy Perimeter Stateless Routing (GPSR), a state of the art geographic routing scheme. Under more severe traffic conditions, BS outperforms both GPSR and ISPA in terms of average latency by up to a 85% and 70%, respectively. We conducted ns-3 simulations in a wide range of sparse NoS deployments and workloads to support these performance claims.
    Ad Hoc Networks 02/2015; 25(A):130-140. DOI:10.1016/j.adhoc.2014.10.002 · 1.94 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The delay guarantee is a challenge in wireless sensor networks (WSNs), where energy constraints must be considered. The coexistence of renewable energy and electricity grid is expected as a promising energy supply manner for WSNs to remain function for a potentially infinite lifetime. In this paper, we address cross-layer control to guarantee worse case delay for Heterogeneous Powered (HP) WSNs. We design a novel virtual delay queue structure, and apply the Lyapunov optimization technique to develop cross-layer control algorithm only requiring knowledge of the instantaneous system state, which provides efficient throughput-utility, and guarantees bounded worst-case delay. We analyze the performance of the proposed algorithm and verify the theoretic claims through the simulation results. Compared to the existing work, the algorithm presented in this paper achieves much higher optimal objective value with ultralow data drop due to the proposed novel virtual queue structure.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Packet scheduling/routing in wireless ad hoc networks is a fundamental problem for ad hoc networking. Backpressure routing is a solid and throughput optimal policy for such networks, but suffers from increased delays. In this article, we present two holistic approaches to improve upon the delay problems of backpressure - type algorithms. We develop two scheduling algorithms, namely Voting backpressure and Layered backpressure routing, which are throughput optimal. We experimentally compare the proposed algorithms against state-of-the-art delay-aware backpressure algorithms, which provide optimal throughput, for different payloads and network topologies, for both static and mobile networks. The experimental evaluation of the proposed delay reduction algorithms attest their superiority in terms of QoS, robustness, low computational complexity and simplicity.

Preview (2 Sources)

Download
3 Downloads
Available from