Energy-aware routing algorithms for wireless ad hoc networks with heterogeneous power supplies

2011-10-27
Vazifehdan, Javad
Prasad, R. Venkatesha
Onur, Ertan
Niemegeers, Ignas
Although many energy-aware routing schemes have been proposed for wireless ad hoc networks, they are not optimized for networks with heterogeneous power supplies, where nodes may run on battery or be connected to the mains (grid network). In this paper, we propose several energy-aware routing algorithms for such ad hoc networks. The proposed algorithms feature directing the traffic load dynamically towards mains-powered devices keeping the hop count of selected routes minimal. We unify these algorithms into a framework in which the route selection is formulated as a bi-criteria decision making problem. Minimizing the energy cost for end-to-end packet transfer and minimizing the hop count are the two criteria in this framework. Various algorithms that we propose differ in the way they define the energy cost for end-to-end packet traversal or the way they solve the bi-criteria decision making problem. Some of them consider the energy consumed to transmit and receive packets, while others also consider the residual battery energy of battery-enabled nodes. The proposed algorithms use either the weighted sum approach or the lexicographic method to solve the bi-criteria decision making problem. We evaluate the performance of our algorithms in static and mobile ad hoc networks, and in networks with and without transmission power control. Through extensive simulations we show that our algorithms can significantly enhance the lifetime of battery-powered nodes while the hop count is kept close to its optimal value. We also discuss the scenarios and conditions in which each algorithm could be suitably deployed.
COMPUTER NETWORKS

Suggestions

Mobile multi-access IP: a proposal for mobile multi-access management in future wireless IP networks
Altuntas, S; Baykal, Buyurman (Elsevier BV, 2005-03-15)
As the wireless networking technologies advance rapidly, providing mobile users with roaming freely in heterogeneous wireless access domains, the need for multi-access arises. This paper introduces the Mobile Multi-Access Management Architecture (MMA-IP) for IP-based future wireless networks. MMA-IP enables mobile users to utilize multiple access domains synchronously and to switch between different access domains. In order to handle multi-access operations, MMA-IP defines a new special mobility agent, call...
Optimal number of routing paths in multi-path routing to minimize energy consumption in wireless sensor networks
İncebacak, Davut; Tavlı, Bulent; Bıcakçı, Kemal; Altın-Kayhan, Ayşegül (Springer Science and Business Media LLC, 2013-10-30)
In wireless sensor networks, multi-path routing is proposed for energy balancing which prolongs the network lifetime as compared to single-path routing where utilization of a single route between a source node and the base station results in imbalanced energy dissipation. While it is evident that increasing the number of routing paths mitigates the problem of energy over-utilization in a subset of nodes acting as relays, the net effect of the proliferation of multiple routing paths on energy balancing remai...
A simple and effective mechanism for stored video streaming with TCP transport and server-side adaptive frame discard
Gurses, E; Akar, Gözde; Akar, N (Elsevier BV, 2005-07-15)
Transmission control protocol (TCP) with its well-established congestion control mechanism is the prevailing transport layer protocol for non-real time data in current Internet Protocol (IP) networks. It would be desirable to transmit any type of multimedia data using TCP in order to take advantage of the extensive operational experience behind TCP in the Internet. However, some features of TCP including retransmissions and variations in throughput and delay, although not catastrophic for non-real time data...
Path planning for mobile-anchor based wireless sensor network localization: Static and dynamic schemes
Erdemir, Ecenaz; Tuncer, Temel Engin (Elsevier BV, 2018-08-01)
In wireless sensor networks, node locations are required for many applications. Usually, anchors with known positions are employed for localization. Sensor positions can be estimated more efficiently by using mobile anchors (MAs). Finding the best MA trajectory is an important problem in this context. Various path planning algorithms are proposed to localize as many sensors as possible by following the shortest path with minimum number of anchors. In this paper, path planning algorithms for MA assisted loca...
Lifetime extension for surveillance wireless sensor networks with intelligent redeployment
Kosar, Rabun; Bojaxhiu, Ilir; Onur, Ertan; Ersoy, Cem (Elsevier BV, 2011-11-01)
For wireless sensor networks (WSNs), uneven energy consumption is a major problem. A direct consequence of this is the energy hole problem, formation of sensing voids within the network field due to battery depleted sensors in the corresponding region. Hole formations are inherent in the network topology, yet it is possible to develop strategies to delay the hole formations to later stages of the network operation and essentially extend the network lifetime without sensing quality loss. In this work, we ini...
Citation Formats
J. Vazifehdan, R. V. Prasad, E. Onur, and I. Niemegeers, “Energy-aware routing algorithms for wireless ad hoc networks with heterogeneous power supplies,” COMPUTER NETWORKS, pp. 3256–3274, 2011, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/41000.