The University of Southampton
University of Southampton Institutional Repository

Energy-Efficient Routing in Ad Hoc Networks Relying on Channel State Information and Limited MAC Retransmissions

Energy-Efficient Routing in Ad Hoc Networks Relying on Channel State Information and Limited MAC Retransmissions
Energy-Efficient Routing in Ad Hoc Networks Relying on Channel State Information and Limited MAC Retransmissions
In ad hoc networks the nodes actively and voluntarily participate in constructing a network and act as relays for other nodes. As a result of node-mobility, the Channel State Information (CSI) varies and hence a substantial amount of control messages have to be exchanged across the network to maintain reliable communications between certain pairs of nodes, which potentially imposes a high energy-consumption. Therefore, minimizing the energy consumption and maximizing the throughput of ad hoc nodes is extremely important. This paper analyzes both the energy consumption and the achievable throughput of a multihop route by exploiting both the CSI quantified, for example in terms of the Frame Error Ratio (FER), as well as the number of Medium Access Control (MAC) retransmissions and the number of hops. Since using limited number of MAC retransmissions in a hop-by-hop retransmission mode imposes dependencies amongst the links of a multi-hop route, a more accurate objective function may be formulated than that which assumes the availability of an infinite number of retransmissions and which considers the links to be independent. Our simulations confirm the improved accuracy of the proposed Objective Function (OF), especially when the FER and the number of hops are high and the number of MAC retransmissions is low. Additionally, a low-complexity routing algorithm is designed, which carries out routing decisions based on the energy consumption predicted by the OF, and strikes a compromise between having ‘few long-distance hops’ and ‘many short-distance hops’ for the sake of energy minimization and throughput maximization.
Zuo, Jing
9710dacc-b814-4912-b2e2-54d2e8e4fe29
Dong, Chen
dac9f067-33fb-47a2-b789-b3d131d8d866
Ng, Soon
e19a63b0-0f12-4591-ab5f-554820d5f78c
Yang, Lie-Liang
ae425648-d9a3-4b7d-8abd-b3cfea375bc7
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1
Zuo, Jing
9710dacc-b814-4912-b2e2-54d2e8e4fe29
Dong, Chen
dac9f067-33fb-47a2-b789-b3d131d8d866
Ng, Soon
e19a63b0-0f12-4591-ab5f-554820d5f78c
Yang, Lie-Liang
ae425648-d9a3-4b7d-8abd-b3cfea375bc7
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1

Zuo, Jing, Dong, Chen, Ng, Soon, Yang, Lie-Liang and Hanzo, Lajos (2011) Energy-Efficient Routing in Ad Hoc Networks Relying on Channel State Information and Limited MAC Retransmissions. VTC2011-Fall, San Francisco, United States. 04 - 07 Sep 2011.

Record type: Conference or Workshop Item (Paper)

Abstract

In ad hoc networks the nodes actively and voluntarily participate in constructing a network and act as relays for other nodes. As a result of node-mobility, the Channel State Information (CSI) varies and hence a substantial amount of control messages have to be exchanged across the network to maintain reliable communications between certain pairs of nodes, which potentially imposes a high energy-consumption. Therefore, minimizing the energy consumption and maximizing the throughput of ad hoc nodes is extremely important. This paper analyzes both the energy consumption and the achievable throughput of a multihop route by exploiting both the CSI quantified, for example in terms of the Frame Error Ratio (FER), as well as the number of Medium Access Control (MAC) retransmissions and the number of hops. Since using limited number of MAC retransmissions in a hop-by-hop retransmission mode imposes dependencies amongst the links of a multi-hop route, a more accurate objective function may be formulated than that which assumes the availability of an infinite number of retransmissions and which considers the links to be independent. Our simulations confirm the improved accuracy of the proposed Objective Function (OF), especially when the FER and the number of hops are high and the number of MAC retransmissions is low. Additionally, a low-complexity routing algorithm is designed, which carries out routing decisions based on the energy consumption predicted by the OF, and strikes a compromise between having ‘few long-distance hops’ and ‘many short-distance hops’ for the sake of energy minimization and throughput maximization.

Other
Energy-Efficiency.PDF - Other
Download (189kB)

More information

Published date: 19 September 2011
Additional Information: Event Dates: 5-8 September 2011
Venue - Dates: VTC2011-Fall, San Francisco, United States, 2011-09-04 - 2011-09-07
Organisations: Southampton Wireless Group

Identifiers

Local EPrints ID: 272115
URI: http://eprints.soton.ac.uk/id/eprint/272115
PURE UUID: 6c5cb18b-c120-4fba-b7a6-ee27bb6f160a
ORCID for Soon Ng: ORCID iD orcid.org/0000-0002-0930-7194
ORCID for Lie-Liang Yang: ORCID iD orcid.org/0000-0002-2032-9327
ORCID for Lajos Hanzo: ORCID iD orcid.org/0000-0002-2636-5214

Catalogue record

Date deposited: 23 Mar 2011 13:37
Last modified: 18 Feb 2021 16:51

Export record

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×