An improved ranging algorithm for ad-hoc relay networks over IEEE 802.16 OFDMA systems

We present a novel ranging scheme with a specific notification code to reduce the complexity of ranging detection while providing a sufficient ranging opportunity for small ranging success time (RST) in ad-hoc relay (AHR) networks over IEEE 802.16 OFDMA systems. Computational complexity and RST are...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE communications letters 2009-05, Vol.13 (5), p.357-359
Hauptverfasser:	AHN, Woo-Geun, KIM, Hyung-Myung
Format:	Artikel
Sprache:	eng
Schlagworte:	Access protocols ad-hoc relay Applied sciences Computational complexity Computational modeling Exact sciences and technology Frequency division multiaccess IEEE 802.16 Information, signal and communications theory Multiaccess communication Multiple access interference Multiplexing OFDMA Physical layer ranging Relays Robustness Signal and communications theory Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Transmission and modulation (techniques and equipments) Wireless networks
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	We present a novel ranging scheme with a specific notification code to reduce the complexity of ranging detection while providing a sufficient ranging opportunity for small ranging success time (RST) in ad-hoc relay (AHR) networks over IEEE 802.16 OFDMA systems. Computational complexity and RST are analyzed. The simulation results show that the proposed scheme outperforms the conventional one and can be a good choice for ranging protocol in battery-powered AHR networks.
ISSN:	1089-7798 1558-2558
DOI:	10.1109/LCOMM.2009.090132