Performance evaluation of the beacon period contraction algorithm in UWB MBOA MAC

Qi Wu; Yongqiang Xiong; Haitao Wu; Zihua Guo; Xiang Gen Xia; Qian Zhang; Zhongcheng Li

doi:10.1109/LCOMM.2005.10024

Performance evaluation of the beacon period contraction algorithm in UWB MBOA MAC

Qi Wu^*, Yongqiang Xiong, Haitao Wu, Zihua Guo, Xiang Gen Xia, Qian Zhang, Zhongcheng Li

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

8 Citations (Scopus)

Abstract

Beacon period (BP) is an overhead in UWB MBOA MAC, since no data frame is allowed during a BP. In this letter, we model the current BP contraction scheme in MBOA spec as a greedy distance-2 graph coloring algorithm, and formulate the BP contraction problem as a 0-1 programming problem. The theoretical numerical results show that the current BP contraction algorithm has good performance. Furthermore, we study the impact of device joining/leaving order on the performance of the algorithm. Simulation results demonstrate that the impact is not significant and the performance of the algorithm is stable with varied device ordering. Therefore, we conclude that there is no much room for any further significant improvement over the current BP contraction algorithm in MBOA spec.

Original language	English
Pages (from-to)	933-935
Number of pages	3
Journal	IEEE Communications Letters
Volume	9
Issue number	10
DOIs	https://doi.org/10.1109/LCOMM.2005.10024
Publication status	Published - Oct 2005
Externally published	Yes

Keywords

Beacon
Beacon period contraction
Multi-band OFDM alliance
Performance evaluation
UWB

Access to Document

10.1109/LCOMM.2005.10024

Cite this

@article{845b659ad39642c99c0cf11cf601a136,

title = "Performance evaluation of the beacon period contraction algorithm in UWB MBOA MAC",

abstract = "Beacon period (BP) is an overhead in UWB MBOA MAC, since no data frame is allowed during a BP. In this letter, we model the current BP contraction scheme in MBOA spec as a greedy distance-2 graph coloring algorithm, and formulate the BP contraction problem as a 0-1 programming problem. The theoretical numerical results show that the current BP contraction algorithm has good performance. Furthermore, we study the impact of device joining/leaving order on the performance of the algorithm. Simulation results demonstrate that the impact is not significant and the performance of the algorithm is stable with varied device ordering. Therefore, we conclude that there is no much room for any further significant improvement over the current BP contraction algorithm in MBOA spec.",

keywords = "Beacon, Beacon period contraction, Multi-band OFDM alliance, Performance evaluation, UWB",

author = "Qi Wu and Yongqiang Xiong and Haitao Wu and Zihua Guo and Xia, {Xiang Gen} and Qian Zhang and Zhongcheng Li",

year = "2005",

month = oct,

doi = "10.1109/LCOMM.2005.10024",

language = "English",

volume = "9",

pages = "933--935",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "10",

}

TY - JOUR

T1 - Performance evaluation of the beacon period contraction algorithm in UWB MBOA MAC

AU - Wu, Qi

AU - Xiong, Yongqiang

AU - Wu, Haitao

AU - Guo, Zihua

AU - Xia, Xiang Gen

AU - Zhang, Qian

AU - Li, Zhongcheng

PY - 2005/10

Y1 - 2005/10

N2 - Beacon period (BP) is an overhead in UWB MBOA MAC, since no data frame is allowed during a BP. In this letter, we model the current BP contraction scheme in MBOA spec as a greedy distance-2 graph coloring algorithm, and formulate the BP contraction problem as a 0-1 programming problem. The theoretical numerical results show that the current BP contraction algorithm has good performance. Furthermore, we study the impact of device joining/leaving order on the performance of the algorithm. Simulation results demonstrate that the impact is not significant and the performance of the algorithm is stable with varied device ordering. Therefore, we conclude that there is no much room for any further significant improvement over the current BP contraction algorithm in MBOA spec.

AB - Beacon period (BP) is an overhead in UWB MBOA MAC, since no data frame is allowed during a BP. In this letter, we model the current BP contraction scheme in MBOA spec as a greedy distance-2 graph coloring algorithm, and formulate the BP contraction problem as a 0-1 programming problem. The theoretical numerical results show that the current BP contraction algorithm has good performance. Furthermore, we study the impact of device joining/leaving order on the performance of the algorithm. Simulation results demonstrate that the impact is not significant and the performance of the algorithm is stable with varied device ordering. Therefore, we conclude that there is no much room for any further significant improvement over the current BP contraction algorithm in MBOA spec.

KW - Beacon

KW - Beacon period contraction

KW - Multi-band OFDM alliance

KW - Performance evaluation

KW - UWB

UR - http://www.scopus.com/inward/record.url?scp=27644571536&partnerID=8YFLogxK

U2 - 10.1109/LCOMM.2005.10024

DO - 10.1109/LCOMM.2005.10024

M3 - Article

AN - SCOPUS:27644571536

SN - 1089-7798

VL - 9

SP - 933

EP - 935

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 10

ER -

Performance evaluation of the beacon period contraction algorithm in UWB MBOA MAC

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this