Parameter Tuning of the Protocol Interference Model Using SINR for Time Slot Assignment in Wireless Mesh Networks

被引：1

作者：

Kang, Gyeongyeon ^{[1
]}

Taniguchi, Yoshiaki ^{[2
]}

Hasegawa, Go ^{[2
]}

Nakano, Hirotaka ^{[2
]}

机构：

[1] Osaka Univ, Grad Sch Informat Sci & Technol, Suita, Osaka 5650871, Japan

[2] Osaka Univ, Cybermedia Ctr, Suita, Osaka 5650871, Japan

来源：

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS | 2011年 / E94D卷 / 11期

关键词：

wireless mesh networks; protocol interference model; SINR model; TDMA; parameter tuning;

D O I：

10.1587/transinf.E94.D.2191

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In time division multiple access (TDMA)-based wireless mesh networks, interference relationships should be considered when time slots are assigned to links. In graph theory-based time slot assignment algorithms, the protocol interference model is widely used to determine radio interference information, although it is an inaccurate model of actual radio interference. On the other hand, the signal-to-interference-plus-noise-ratio model (SINR model) gives more accurate interference relationships but is difficult to apply to time slot assignment algorithms since the radio interference information cannot be determined before time slot assignment. In this paper, we investigate the effect of the parameters of the protocol interference model on the accuracy of the interference relationships determined using this model. Specifically, after assigning time slots to links based on the protocol interference model with various interference ratios, which is the major parameter of the protocol interference model, we compare the interference relationship among links in the protocol interference and SINR models. Through simulation experiments, we show that accuracy of the protocol interference model is improved by up to 15% by adjusting the interference ratios of the protocol interference model.

引用

页码：2191 / 2200

页数：10

共 22 条

[1] Wireless mesh networks: a survey [J].

Akyildiz, IF ;

Wang, XD ;

Wang, WL .

COMPUTER NETWORKS, 2005, 47 (04) :445-487

[2]

Alicherry M., 2005, Proc. ACM Mobicom'05, P58

[3]

Anil Kumar V. S., 2005, Performance Evaluation Review, V33, P133, DOI 10.1145/1071690.1064228

[4]

AURENHAMMER F, 1991, COMPUT SURV, V23, P345, DOI 10.1145/116873.116880

[5] Throughput and fairness guarantees through maximal scheduling in wireless networks [J].

Chaporkar, Prasanna ;

Kar, Koushik ;

Luo, Xiang ;

Sarkar, Saswati .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (02) :572-594

[6]

Che X., 2010, P 7 ANN IEEE COMM SO, P1, DOI [DOI 10.1109/ICC.2010.5502421, 10.1109/SECON.2010.5508292, DOI 10.1109/SECON.2010.5508292]

[7] A Graph Theory Based Opportunistic Link Scheduling for Wireless Ad Hoc Networks [J].

Chen, Qing ;

Zhang, Qian ;

Niu, Zhisheng .

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2009, 8 (10) :5075-5085

[8] Performance of a wireless access protocol on correlated Rayleigh-fading channels with capture [J].

Chockalingam, A ;

Zorzi, M ;

Milstein, LB ;

Venkataram, P .

IEEE TRANSACTIONS ON COMMUNICATIONS, 1998, 46 (05) :644-655

[9] UNIT DISK GRAPHS [J].

CLARK, BN ;

COLBOURN, CJ ;

JOHNSON, DS .

DISCRETE MATHEMATICS, 1990, 86 (1-3) :165-177

[10] The capacity of wireless networks [J].

Gupta, P ;

Kumar, PR .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (02) :388-404

← 1 2 3 →