TY - GEN
T1 - Performance enhancement of medium access control for UWB WPAN
AU - Liu, Kuang-Hao
AU - Cai, Lin
AU - Shen, Xuemin
PY - 2006/12/1
Y1 - 2006/12/1
N2 - With its capability of supporting high data rate services in a short range, the Ultra-Wide Band (UWB) technology is appealing for future wireless personal area networks (WPANs). However, the WPAN Medium Access Control (MAC) protocol in IEEE 802.15.3 standard was originally designed for narrow band communication networks, and it is inherently in-efficient for UWB networks. In this paper, we explore the unique characteristics of UWB communications and propose how to schedule concurrent transmissions in UWB networks, which can significantly improve efficiency and network capacity. Since the optimal scheduling problem for peer-to-peer concurrent transmissions is NP-hard, the induced computation load for solving the problem is not affordable to the network coordinator, commonly a normal UWB device with limited computation power and energy. We propose two simple heuristic scheduling algorithms with polynomial time complexity. Extensive simulations with random network topology demonstrate that, by allowing concurrent transmissions appropriately, the proposed scheduling algorithms can significantly increase the network throughput.
AB - With its capability of supporting high data rate services in a short range, the Ultra-Wide Band (UWB) technology is appealing for future wireless personal area networks (WPANs). However, the WPAN Medium Access Control (MAC) protocol in IEEE 802.15.3 standard was originally designed for narrow band communication networks, and it is inherently in-efficient for UWB networks. In this paper, we explore the unique characteristics of UWB communications and propose how to schedule concurrent transmissions in UWB networks, which can significantly improve efficiency and network capacity. Since the optimal scheduling problem for peer-to-peer concurrent transmissions is NP-hard, the induced computation load for solving the problem is not affordable to the network coordinator, commonly a normal UWB device with limited computation power and energy. We propose two simple heuristic scheduling algorithms with polynomial time complexity. Extensive simulations with random network topology demonstrate that, by allowing concurrent transmissions appropriately, the proposed scheduling algorithms can significantly increase the network throughput.
UR - http://www.scopus.com/inward/record.url?scp=50949103734&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=50949103734&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2006.748
DO - 10.1109/GLOCOM.2006.748
M3 - Conference contribution
AN - SCOPUS:50949103734
SN - 142440357X
SN - 9781424403578
T3 - GLOBECOM - IEEE Global Telecommunications Conference
BT - IEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference
T2 - IEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference
Y2 - 27 November 2006 through 1 December 2006
ER -