Greedy sub-channel redistribution routing scheme in multi-hop wireless OFDMA networks

Authors:
Weiwei Wang;Jun Cai;Attahiru S. Alfa
Affiliations:
Department of Electrical and Computer Engineering, University of Manitoba, Winnipeg, Manitoba, Canada;Department of Electrical and Computer Engineering, University of Manitoba, Winnipeg, Manitoba, Canada;Department of Electrical and Computer Engineering, University of Manitoba, Winnipeg, Manitoba, Canada
Venue:
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Year:
2009

Citing 5
Cited 0

Introduction to Algorithms

Introduction to Algorithms
Distributed routing schemes for multi-hop fixed relay networks

Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Routing techniques in wireless sensor networks: a survey

IEEE Wireless Communications
Distributed Channel Assignment and Routing in Multiradio Multichannel Multihop Wireless Networks

IEEE Journal on Selected Areas in Communications
Routing Metrics and Protocols for Wireless Mesh Networks

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a greedy sub-channel redistribution routing scheme (GSRRS) is proposed for multi-hop wireless OFDMA networks. In GSRRS, between any two neighboring nodes, different sub-channels are routed over different paths including the direct one-hop path and the two-hop path with one intermediate node. Compared to the traditional routing scheme where all the sub-channels route over the same path, GSRRS can improve not only the link rate between two neighboring nodes but also the capacity of the shortest path derived by the Dijkstra's algorithm between any source-destination pair.