• Title/Summary/Keyword: Poisson cluster process

Search Result 12, Processing Time 0.015 seconds

Hybrid-clustering game Algorithm for Resource Allocation in Macro-Femto HetNet

  • Ye, Fang;Dai, Jing;Li, Yibing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.4
    • /
    • pp.1638-1654
    • /
    • 2018
  • The heterogeneous network (HetNet) has been one of the key technologies in Long Term Evolution-Advanced (LTE-A) with growing capacity and coverage demands. However, the introduction of femtocells has brought serious co-layer interference and cross-layer interference, which has been a major factor affecting system throughput. It is generally acknowledged that the resource allocation has significant impact on suppressing interference and improving the system performance. In this paper, we propose a hybrid-clustering algorithm based on the $Mat{\acute{e}}rn$ hard-core process (MHP) to restrain two kinds of co-channel interference in the HetNet. As the impracticality of the hexagonal grid model and the homogeneous Poisson point process model whose points distribute completely randomly to establish the system model. The HetNet model based on the MHP is adopted to satisfy the negative correlation distribution of base stations in this paper. Base on the system model, the spectrum sharing problem with restricted spectrum resources is further analyzed. On the basis of location information and the interference relation of base stations, a hybrid clustering method, which takes into accounts the fairness of two types of base stations is firstly proposed. Then, auction mechanism is discussed to achieve the spectrum sharing inside each cluster, avoiding the spectrum resource waste. Through combining the clustering theory and auction mechanism, the proposed novel algorithm can be applied to restrain the cross-layer interference and co-layer interference of HetNet, which has a high density of base stations. Simulation results show that spectral efficiency and system throughput increase to a certain degree.

A Study on Energy Conservative Hierarchical Clustering for Ad-hoc Network (애드-혹 네트워크에서의 에너지 보존적인 계층 클러스터링에 관한 연구)

  • Mun, Chang-Min;Lee, Kang-Whan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.12
    • /
    • pp.2800-2807
    • /
    • 2012
  • An ad-hoc wireless network provides self-organizing data networking while they are routing of packets among themselves. Typically multi-hop and control packets overhead affects the change of route of transmission. There are numerous routing protocols have been developed for ad hoc wireless networks as the size of the network scale. Hence the scalable routing protocol would be needed for energy efficient various network routing environment conditions. The number of depth or layer of hierarchical clustering nodes are analyzed the different clustering structure with topology in this paper. To estimate the energy efficient number of cluster layer and energy dissipation are studied based on distributed homogeneous spatial Poisson process with context-awareness nodes condition. The simulation results show that CACHE-R could be conserved the energy of node under the setting the optimal layer given parameters.