Kühne, Alexander and Loch, Adrian and Hollick, Matthias and Klein, Anja (2013):
Node Selection for Corridor-based Routing in OFDMA Multihop Networks.
In: Wireless Communications and Networking Conference (WCNC'13), pp. 2040--2045,
DOI: 10.1109/WCNC.2013.6554877,
[Conference or Workshop Item]
Abstract
In multi-hop networks, conventional forwarding along a unicast route forces the data transmission to follow a fixed sequence of nodes. In previous works, it has been shown that widening this path to create a corridor of forwarding nodes and applying OFDMA to split and merge the data as it travels through the corridor towards the destination node leads to considerable gains in achievable throughput compared to the case forwarding data along a unicast route. However, the problem of selecting potential nodes to act as forwarding nodes within the corridor has not been addressed in the literature, as in general a rather homogeneous network topology with equally spaced relay clusters per hop between source and destination node has been assumed. In this paper, a more realistic heterogeneous network is considered where the nodes in the area between source and destination are randomly distributed instead of being clustered with equal distance. A node selection scheme is presented which selects the forwarding nodes within the corridor based on a given unicast route between source and destination node. In simulations, it is shown that with the proposed node selection scheme, considerable throughput gains of up to 50 % compared to forwarding along unicast route can be achieved applying corridor-based routing in heterogeneous networks especially in sparse networks.
Item Type: | Conference or Workshop Item |
---|---|
Erschienen: | 2013 |
Creators: | Kühne, Alexander and Loch, Adrian and Hollick, Matthias and Klein, Anja |
Title: | Node Selection for Corridor-based Routing in OFDMA Multihop Networks |
Language: | German |
Abstract: | In multi-hop networks, conventional forwarding along a unicast route forces the data transmission to follow a fixed sequence of nodes. In previous works, it has been shown that widening this path to create a corridor of forwarding nodes and applying OFDMA to split and merge the data as it travels through the corridor towards the destination node leads to considerable gains in achievable throughput compared to the case forwarding data along a unicast route. However, the problem of selecting potential nodes to act as forwarding nodes within the corridor has not been addressed in the literature, as in general a rather homogeneous network topology with equally spaced relay clusters per hop between source and destination node has been assumed. In this paper, a more realistic heterogeneous network is considered where the nodes in the area between source and destination are randomly distributed instead of being clustered with equal distance. A node selection scheme is presented which selects the forwarding nodes within the corridor based on a given unicast route between source and destination node. In simulations, it is shown that with the proposed node selection scheme, considerable throughput gains of up to 50 % compared to forwarding along unicast route can be achieved applying corridor-based routing in heterogeneous networks especially in sparse networks. |
Title of Book: | Wireless Communications and Networking Conference (WCNC'13) |
Divisions: | 20 Department of Computer Science 20 Department of Computer Science > Sichere Mobile Netze LOEWE LOEWE > LOEWE-Zentren LOEWE > LOEWE-Zentren > CASED – Center for Advanced Security Research Darmstadt |
Date Deposited: | 31 Dec 2016 11:08 |
DOI: | 10.1109/WCNC.2013.6554877 |
Identification Number: | TUD-CS-2013-0276 |
Export: | |
Suche nach Titel in: | TUfind oder in Google |
![]() |
Send an inquiry |
Options (only for editors)
![]() |
Show editorial Details |