...
首页> 外文期刊>IEEE Journal on Selected Areas in Communications >Distributed fault-tolerant channel allocation for cellular networks
【24h】

Distributed fault-tolerant channel allocation for cellular networks

机译:蜂窝网络的分布式容错信道分配

获取原文
获取原文并翻译 | 示例
           

摘要

A channel allocation algorithm includes channel acquisition andnchannel selection algorithms. Most of the previous work concentrates onnthe channel selection algorithm since early channel acquisitionnalgorithms are centralized and rely on a mobile switching center (MSC)nto accomplish channel acquisition. Distributed channel acquisitionnalgorithms have received considerable attention due to their highnreliability and scalability. However, in these algorithms, a borrowernneeds to consult with its interference neighbors in order to borrow anchannel. Thus, the borrower fails to borrow channels when it cannotncommunicate with any interference neighbor. In real-life networks, undernheavy traffic load, a cell has a large probability to experience annintermittent network congestion or even a communication link failure. Innexisting distributed algorithms, since a cell has to consult with anlarge number of interference neighbors to borrow a channel, the failurenrate will be much higher under heavy traffic load. Therefore, previousndistributed channel allocation algorithms are not suitable for real-lifennetworks. We first propose a fault-tolerant channel acquisitionnalgorithm which tolerates communication link failures and node (MH ornMSS) failures. Then, we present a channel selection algorithm andnintegrate it into the distributed acquisition algorithm. Detailednsimulation experiments are carried out in order to evaluate our proposednmethodology. Simulation results show that our algorithm significantlynreduces the failure rate under network congestion, communication linknfailures, and node failures compared to nonfault-tolerant channelnallocation algorithms. Moreover, our algorithm has low message overheadncompared to known distributed channel allocation algorithms, andnoutperforms them in terms of failure rate under uniform as well asnnonuniform traffic distribution
机译:信道分配算法包括信道获取和n信道选择算法。由于早期的信道获取算法是集中的,并且依赖于移动交换中心(MSC)来完成信道获取,因此以前的大多数工作都集中在信道选择算法上。分布式信道获取算法由于其高度的可靠性和可扩展性而受到了广泛的关注。然而,在这些算法中,借用者需要与其干扰邻居协商以便借用信道。因此,当借款人无法与任何干扰邻居通信时,借款人将无法借用信道。在实际的网络中,在流量负载不足的情况下,小区很有可能会经历间歇性的网络拥塞甚至发生通信链路故障。现有的分布式算法,由于小区必须与大量干扰邻居协商才能借用信道,因此在繁重的业务负载下故障率会更高。因此,先前的分布式信道分配算法不适用于现实网络。我们首先提出一种容错的信道获取算法,该算法可以容忍通信链路故障和节点(MH ornMSS)故障。然后,我们提出了一种信道选择算法,并将其集成到分布式采集算法中。为了评估我们提出的方法,进行了详细的模拟实验。仿真结果表明,与非容错信道分配算法相比,该算法在网络拥塞,通信链路故障和节点故障下的故障率显着降低。而且,与已知的分布式信道分配算法相比,我们的算法具有较低的消息开销,并且在均匀和非均匀流量分布下的故障率方面均不优于它们。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号