Interference management in dense inband D2D network using spectral clustering & dynamic resource allocation

Device-to-device (D2D) communication has emerged as a promising concept to improve resource utilization in fifth generation cellular networks. D2D network’s architectural capability to offload traffic from the backhaul network to direct links enables it to be used for internet of things (IoT) services. In a densely deployed setting of IoT devices, D2D network may experience critical interferences due to a limited number of spectral resources. To increase the overall signal-to-interference-plus-noise ratio (SINR) of the network while reducing the computational load on a macro base station, a novel decentralized interference management methodology is proposed for dense in-band D2D underlay LTE-A network. The proposed interference management scheme can decouple interference in a network into cross-cluster and intra-cluster interference and tackle with them separately. To mitigate the cross-cluster interference in a dense D2D network we propose dividing the densely deployed D2D user equipments (UEs) network into well-separated clusters using spectral clustering with modified kernel weights. The proposed spectral clustering scheme obtains well-separated clusters with regards to cross-cluster interference, that is, the UEs that offer maximum interference to each other are grouped into the same cluster. Thereafter, a dynamic resource allocation algorithm is proposed within each cluster to reduce the intra-cluster interference. The proposed dynamic resource allocation algorithm uses graph coloring to allocate resources in such a manner that after each spectrum allocation, a small cell base station updates the interference graph and assigns the next largest interference affected UE a spectrum resource that minimizes the overall intra-cluster interference the most. In conventional graph coloring, the adjacent UEs are allocated different spectrum resources without taking into consideration if the allocated spectrum resource might result in increased interference in the cluster. The simulation results show that the proposed clustering strategy considerably reduces the average cross-cluster interference as compared to other benchmark clustering algorithms such as K-means and KPCA. Moreover, the proposed resource allocation algorithm decreases the intra-cluster interference in the network resulting in the overall SINR maximization of the network.

     

超密集分簇网络中基于预测门限滞后余量可调的切换算法

在第五代移动通信(5G)系统中,大规模MIMO天线和超密集部署网络是实现高吞吐量的两种方式。针对超密集网络的切换管理的问题,该文基于网络分簇的思想提出了根据终端设备运动情况动态调节滞后余量的切换管理算法。在该算法中,基于小基站分簇化管理的前提,用户设备在小区间切换分为预切换和正式切换两个阶段,预切换阶段完成最佳目标小区选择、小区资源预留和预鉴权等操作,正式切换阶段根据预切换阶段监测的设备速度动态调节切换门限的滞后余量。仿真结果表明了该算法可以有效降低设备的切换时延和切换失败率。     

Interference graph based adaptive interference coordination method in indoor UDN

An interference graph based adaptive interference coordination method was proposed for indoor scenario of ultra dense network (UDN).The algorithm aimed at maximizing system throughput.Firstly,the interference relationship in the system was modeled as an interference graph,and the iterative coloring algorithm was used to determine the available resources of each small cell base station (SBS).Thereafter,the SBS allocated resources to each user by using a throughput optimizing resource allocation algorithm.The method could adaptively select a resource allocation strategy according to the network topology and channel conditions,thereby mitigating interference in the system.The simulation results show that compared with the existing methods,the proposed method effectively reduces the system outage probability while significantly improving the throughput performance through a small additional signaling overhead.     

面向高动态移动自组织网络的生物启发分簇算法

分簇可以有效地提高大规模移动自组织网络的性能.但高动态的移动自组织网络具有节点移动性强、网络拓扑变化快的特点,应用传统的分簇算法会造成网络性能迅速下降,频繁的簇拓扑更新造成了簇结构的不稳定和控制开销的增加.为了解决传统分簇算法无法适应高动态的大规模移动自组织网络的问题,提出了一种基于生物启发的移动感知分簇算法,该算法对多头绒泡菌的觅食模型进行了改进,使其适用于移动自组织网络领域.由于该算法与节点的移动特性进行了结合,所以该算法可以有效地在高动态移动自组织网络中进行簇的建立与维护.实验结果表明,相较于其他传统分簇算法,本文算法提高了平均链路连接保持时间和平均簇首保持时间,使得簇结构更加稳定,提高了对高动态、大规模移动自组织网络的适应能力.     

Improving broadcast performance by traffic isolation in wireless ad hoc networks

In this paper we propose a new broadcasting algorithm. In the proposed method we significantly reduce the broadcast overhead and also improve the broadcast delivery ratio in mobile networks. A novel traffic isolation method has been used which reduces the control message exchange. The proposed broadcasting method is based on a clustering method called ‘stability‐based clustering algorithm’ which had been proposed before. The broadcasting traffic is divided into internal (flow inside a cluster) and external traffic (flow among the clusters). For internal flooding traffic, cluster‐heads and gateways are responsible for re‐broadcasting but for external type, border nodes may perform the forwarding function as well. This simplifies the gateway selection method through the local selection of gateway nodes by its cluster head. Therefore, a cluster head selects gateway in its own cluster without any knowledge of other clusters. Considering the effect of mobility and node density, simulations have been conducted in a number of wireless environments. Simulation results show the broadcast coverage is close to 100% at different node speeds. Moreover, we study the broadcast parameters in light and dense networks and show improvement of the overhead and the number of forward nodes in comparison to other broadcasting methods. Copyright © 2005 John Wiley & Sons, Ltd.     

Dynamic segmentation of cellular networks for improved handover performance

One of the most important initial steps, inherent in the planning procedure of cellular networks, is their segmentation in operational parts that is performed at different levels corresponding to the hierarchy and topology of the network. The major goal of this procedure is the efficient deployment of the system and management of the distributed segmented parts while minimizing the signaling overhead in the network. As we show here, it can take place even during the operational phase of the network when certain shortcomings appear. In this work, we present an approach based on graph theory for the segmentation of cellular networks at the Base Station Controller (BSC) level that achieves a significant increase in the performance of the network. In particular, with the proposed method, both the handover attempts when a mobile station is moving to a cell belonging to a different BSC as well as the corresponding handover failure rate are decreased significantly, allowing for a continuous network upgrade. Copyright © 2007 John Wiley & Sons, Ltd.     

超密集小峰窝网中基于干扰协调的小区分簇和功率分配算法

干扰的有效管理是超密集小蜂窝网中的一个研究难点。该文提出将超密集小蜂窝网中的小区干扰协调和分簇相结合的算法,通过分配最优的功率降低干扰,最大化系统吞吐量。根据干扰的程度,将干扰强的小蜂窝划为一个簇,同一个簇内的小蜂窝共享频谱资源,协作为用户服务,簇与簇之间实现频谱复用。仿真结果表明,该算法在网络密集部署时,有效地减小干扰,提高系统吞吐量。     

Stability‐aware multi‐metric clustering in mobile ad hoc networks with group mobility

Clustering can help aggregate the topology information and reduce the size of routing tables in a mobile ad hoc network (MANET). The maintenance of the cluster structure should be as stable as possible to reduce overhead and make the network topology less dynamic. Hence, stability measures the goodness of clustering. However, for a complex system like MANET, one clustering metric is far from reflecting the network dynamics. Some prior works have considered multiple metrics by combining them into one weighted sum, which suffers from intrinsic drawbacks as a scalar objective function to provide solution for multi‐objective optimization. In this paper, we propose a stability‐aware multi‐metric clustering algorithm, which can (1) achieve stable cluster structure by exploiting group mobility and (2) optimize multiple metrics with the help of a multi‐objective evolutionary algorithm (MOEA). Performance evaluation shows that our algorithm can generate a stable clustered topology and also achieve optimal solutions in small‐scale networks. For large‐scale networks, it outperforms the well‐known weighted clustering algorithm (WCA) that uses a weighted sum of multiple metrics. Copyright © 2008 John Wiley & Sons, Ltd.     

Channel access-based self-organized clustering in ad hoc networks

An ad hoc network is a self-organized and distributed entity consisting of a number of mobile stations (MS) without the coordination of any centralized access point. Clustering is one of the fundamental problems in ad hoc networks. In this context, we describe a distributed clustering algorithm for multihop ad hoc networks. We first propose a randomized control channel broadcast access method to maximize the worst-case control channel efficiency, based on which a distributed clustering algorithm is proposed. Both theoretical analysis and simulations indicate that the proposed clustering algorithm takes much less time and overhead to cluster a given network with more stable cluster structure, while incurring very small maintenance overhead in a dynamic network resulting from the mobility of the MS.     

小蜂窝网络中不活跃用户的最优能量效率资源分配方案

针对5G网络中因小区重叠覆盖区域的干扰问题,为缓解密集小蜂窝网络中移动用户的业务连续性,提高频谱资源利用率,进而最大化整个网络平均能量效率问题。该文提出一种基于不活跃用户的最优能量效率资源分配方案(EEI)。首先,该方案依据不活跃用户通知区域,建立以用户为中心的虚拟小区,小区内小蜂窝基站可协作为用户提供通信服务,提高用户通信质量,缓解小蜂窝同层干扰,减少切换信令开销。其次,基于Lyapunov优化理论,该方案将整体网络平均能量效率优化问题,转换为用户最优传输资源分配和最优功率分配两个子问题,在最大化系统平均能量效率同时保证系统队列稳定性。由于该文将原优化问题进行了松弛,所得结果是局部最优解,而不是全局最优解。仿真结果表明,该文提出的基于不活跃用户的最优能量效率资源分配算法,其系统能量效率优于对比算法而计算复杂度较高。     

MSC POOL核心网性能分析

为了减少移动核心网的信令链路负荷,提高资源利用率,提出了一种核心网的组网方案。通过MSC POOL组网实现该方案,并对接入到MSC POOL核心网中的随机移动用户建立概率模型,利用泊松概率分布模型对MSC POOL网络进行理论定性分析和实验。实验结果表明,与传统组网相比,该方案降低了网络负载率,提高了切换成功率和位置更新成功率,对于移动网络结构和性能有着整体的提升。     

Stable routing protocol based on fuzzy logic system in vehicular ad hoc networks

Vehicular ad‐hoc networks have several roles in alert messages dissemination between vehicles in danger, the most important role is to provide helpful information for drivers (eg, road traffic state). But, some performance improvements are frequently needed in terms of routing. Hence, several clustering approaches have been proposed to optimize the network services. These approaches are based on increasing data delivery, reducing data congestion, and dividing the traffic into clusters. However, a stable clustering algorithm is always required in order to ensure the data dissemination in a dense, mobile, or a large‐scale environment. Therefore, in this paper, we have proposed a stable routing protocol based on the fuzzy logic system, which can deliver alert messages with minimum delay and improve the stability of clusters structure by generating only a small number of clusters in the network. In this work, the fuzzy logic system has been used to create the clusters and select a cluster head for each cluster. We have used the network simulator (NS2) to generate the results. As a result, we could reduce the cluster head changes and increase the cluster member lifetime compared with recent approaches.     

Graph cut based clustering for cognitive radio ad hoc networks without common control channels

Clustering is an efficient tool to improve the routing and data transmission performance in large scale networks. However, in cognitive radio ad hoc networks (CRAHNs), clustering design is challenging due to the dynamic spectrum access and the blind information environment. In this paper, we propose a novel distributed clustering algorithm for CRAHNs, where neither a dedicated common control channel (CCC) nor prior topology information is required. First, a neighbor discovery protocol without relying on CCC is proposed to construct the local topology. Then, we model the network as a undirected graph and formulate the clustering process as a graph cut problem. We design a mincut based heuristic algorithm to approximate the optimal clustering solution. After this, we also present a synchronize protocol to achieve the global consistency of cluster memberships. Finally, we propose a proactive cluster maintenance mechanism to reduce the interferences caused by PU activities. We validate our work through comparisons with other clustering methods. The simulation results show that, by adjusting the cluster structure according to the changing spectrum, the proposed method reduces the interference and improves the network efficiency.     

A distributed mobility control scheme in LISP networks

The locator identifier separation protocol (LISP) has been made as an identifier-locator separation scheme for scalable Internet routing. However, the LISP was originally designed for fixed network environment, rather than for mobile network environment. In particular, the existing LISP mobility control schemes use a centralized map server to process all the control traffics, and thus they are intrinsically subject to some limitations in mobile environment, such as large overhead of mapping control traffics at central map server and degradation of handover performance. To overcome these problems, we propose a distributed mobility control scheme in LISP networks. In the proposed scheme, we assume that a mobile host has a hierarchical endpoint identifier which contains the information of its home network domain. Each domain has a distributed map server (DMS) for distributed mapping management of Endpoint Identifiers (EIDs) and Locators (LOCs). For roaming support, each DMS maintains a home EID register and a visiting EID register which are used to keep the EID-LOC mappings for mobile hosts in the distributed manner. For performance analysis, we compare the control traffic overhead (CTO) at map servers, the signaling delay required for EID-LOC mapping management, and the handover delay for the existing and proposed schemes. From numerical results, it is shown that the proposed distributed scheme can give better performance than the existing centralized schemes in terms of CTO, total signaling delay for EID-LOC mapping management, and handover delay.     

宏微协同组网下基于小区分簇的联合传输与无线资源分配

针对宏微协同组网下小区间无线资源管理问题,文章提出一种大规模多入多出系统下基于微小区分簇的联合传输和动态频谱分配策略,该策略分两步执行以优化网络加权和速率.首先,所提算法根据各用户当前的信道状态执行微小区分簇,以尽可能地降低小区间干扰,提升系统容量.接着,宏基站和各微小区簇根据所服务用户当前的业务请求信息分别为其动态分配子载波,以最大化网络加权和速率,并提升资源利用率.仿真结果显示,该文提出的微小区分簇和动态频谱分配策略能在尽可能降低宏微协同组网中用户间干扰的同时,有效地提升系统吞吐量.     

Dynamic resource allocation in mobile heterogeneous cellular networks

User mobility is a challenging issue in macro and femto cellular networks for the fifth-generation and newer mobile communications due to the time-varying interference and topology experienced. In this paper, we consider an OFDMA-based two-tier network with one macro cell and several femto cells, wherein each macro user and/or femto user can leave or enter its serving cell frequently, referred to as user mobility. A resource allocation problem with different rate requirements of mobile users is then formulated. Assuming well knowledge of the user locations and the channel state information, we propose a dynamic algorithm with static and dynamic parts for a better trade-of between computational complexity and system throughput. The static algorithm, named interference weighted cluster algorithm in this paper, is based on the graph theory to cluster the femtocells by minimizing the interference between clusters, while the dynamic algorithm is to deal with the user mobility by sharing the resource blocks under the constraints of rate requirements. Numerical results are demonstrated to show the effectiveness of the proposed dynamic resource allocation algorithm in terms of capacity, computational time, and outage probability.

     

面向负载均衡的主动切换

为了解决超密集网络中用户在移动过程中由于小区间干扰和负载不均衡导致的用户服务质量下降的问题,本文研究了一种面向负载均衡的主动切换策略,设计了一种基于双门限的移动切换策略,包含小区内的切换与小区间的切换.通过优化小区内的切换门限,可以最小化系统总资源开销.通过优化小区间的切换门限,能够保证用户实时业务需求的同时均衡网络负...     

Mobility Management in WLAN-Based Virtualized Networks

Traditional network architectures are about to reach the limits of sustainable development for future service innovation and growth. To overcome the limitation of current architectures and efficiently redesign the future network architecture, a new technology called “network virtualization” is under development. In particular, wireless network virtualization is expected to become an emerging architectural choice to support concurrent heterogeneous services with finer controls over quality of service (QoS) features on the shared wireless network. We note that mobility management has a great influence on user-perceived QoS due to the service disruption during a handover process, and one of the main advantages of wireless network virtualization is to allow for finer-grained control of mobility policy. Although there have been several studies on wireless network virtualization, they focus on virtualizing the radio resources and the network devices. Therefore, in this paper, we propose a detailed protocol to support seamless mobility using the virtualization approach in the IEEE 802.11 wireless networks. We analyze the performance of the proposed mobility management scheme in terms of the handover latency and the signaling overhead. Analytical and simulation results demonstrate that the proposed scheme can significantly reduce handover latency with reasonable signaling cost compared to proxy mobile IP (PMIP) and fast handover for PMIP (FPMIP) in the traditional network.     

Affinity Propagation Based CoMP Clusters for Dense Small Cell Networks with Backhaul Constraints

Dense small cells have been considered as a promising solution for improving system throughput in 5G networks. When a large number of small cells are overlapped, serious inter-cell interference (ICI) becomes one of the major technical challenges. Coordinated multi-point (CoMP) is an effective technology to mitigate ICI. In this paper, we study affinity propagation based CoMP cluster for dense small cell networks with backhaul constrains. The graph based static clusters and affinity propagation based clusters are formed so as to achieve good performance and reduce complexity. By taking into account the hybrid CoMP mode, the optimal problem which maximizes the system throughput with the limit-capacity backhaul has been formulated. An effective hybrid CoMP cluster strategy is gained by solving the optimal problem. The simulation results demonstrate that the proposed scheme could enhance average throughput.     

Efficient handover measurement technique for small‐cell networks using a virtual cell synchronization signal

A small‐cell network (SCN) constructed by splitting a macro‐cell into numerous small cells using an active antenna array system is studied. A synchronization signal appropriate for the SCN, virtually generated by an eNodeB with 3D beamforming, is proposed for efficient handover in SCNs. The virtual cell synchronization signal (VCSS) carries a macro‐cell ID (MCID) and virtual‐cell ID (VCID) in a hierarchical manner, allowing us to distinguish between an intra‐cell handover (virtual cell handover within a cell without changing the serving eNodeB) and inter‐cell handover (virtual cell handovers across cells while changing the serving eNodeB) in SCNs. Using the signal metrics obtained by the VCSS, an efficient handover measurement technique is proposed which can significantly reduce the processing time and overhead by distinguishing between the intra‐cell/inter‐cell handovers. The performance of the proposed technique is evaluated by simulating two different deployment scenarios of LTE‐based SCN with 3D beamforming. Copyright © 2017 John Wiley & Sons, Ltd.