一种最小化干扰数目的多无线电信道分配算法
无线Ad hoc网络中要求链路可以随机处于任何位置进行通信。由于链路位置的随机性,可能会造成某些链路都聚集在某个小范围内,同时通信可能会造成链路间相互干扰。因此需要一种机制来保证链路间实际干扰最小。针对此问题,在信道分配中运用了博弈的思想,利用位势博弈特性构建效用函数,对存在潜在干扰的链路分配信道,使实际干扰最小。算法通过不断循环改变链路无线电的信道,最小化实际干扰数目达到纳什均衡。仿真结果表明,算法能够使信道分配策略达到纳什均衡,使链路间通信拥有更高的吞吐量和更好的鲁棒性。...
Saved in:
| Published in | 计算机应用研究 Vol. 32; no. 4; pp. 1207 - 1210 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | Chinese |
| Published |
重庆大学通信学院,重庆400030
2015
重庆通信学院,重庆,400035%重庆通信学院,重庆400035 |
| Subjects | |
| Online Access | Get full text |
| ISSN | 1001-3695 |
| DOI | 10.3969/j.issn.1001-3695.2015.04.058 |
Cover
| Summary: | 无线Ad hoc网络中要求链路可以随机处于任何位置进行通信。由于链路位置的随机性,可能会造成某些链路都聚集在某个小范围内,同时通信可能会造成链路间相互干扰。因此需要一种机制来保证链路间实际干扰最小。针对此问题,在信道分配中运用了博弈的思想,利用位势博弈特性构建效用函数,对存在潜在干扰的链路分配信道,使实际干扰最小。算法通过不断循环改变链路无线电的信道,最小化实际干扰数目达到纳什均衡。仿真结果表明,算法能够使信道分配策略达到纳什均衡,使链路间通信拥有更高的吞吐量和更好的鲁棒性。 |
|---|---|
| Bibliography: | 51-1196/TP DAI Hao-feng, HE Shi-biao , GUO Yu , TANG Jian-bo , ZHANG Hui（ 1. Chongqing Communication Institute, Chongqing 400035, China ; 2. Communication Institute, Chongqing University, Chongqing 400030 China ） Wireless Ad hoc networks require path links that can communicate with each other in random position. Due to the randomness of the link position,it may appear that some links clustered within a small range,while cause a mutual interference between each other. So it needs a mechanism to minimize the actual interference between the path links. In order to solve the problems above,this paper used the ideas of game theory to realize the channel allocation and built the utility function with the potential game features in order to minimize the actual interference for the channels which existed the potential interference.This algorithm can achieve the Nash equilibrium in circulations by changing the channel of the radio path links. The simulation results show that the algorithm can achieve the Nash equilibriu |
| ISSN: | 1001-3695 |
| DOI: | 10.3969/j.issn.1001-3695.2015.04.058 |