The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In underlay heterogeneous networks (HetNets), the distance between a macro base station (MBS) and a macro user (MU) is crucial for a small-cell base station (SBS) to control the interference to the MU and achieve the coexistence. To obtain the distance between the MBS and the MU, the SBS needs a backhaul link from the macro system, such that the macro system is able to transmit the information of...
Control data separation architecture (CDSA) is a more efficient architecture to overcome the overhead issue than the conventional cellular networks, especially for the huge bursty traffic like Internet of Things, and over-the-top (OTT) content service. In this paper, we study the optimization issue of network energy efficiency of the CDSA-based heterogeneous cloud radio access networks (H-CRAN) networks,...
Cloud radio access network (Cloud-RAN) has been recognized as one of the most promising architectures for next generation wireless network. The features of Cloud-RAN include the central signal processing mechanism and the flexible information interaction among cloud platforms. The General- Purpose Processors (GPP) are a more efficient to multiplex computing resource in the cloud platform. In this...
We study a one-hop device-to-device (D2D)-assisted wireless caching network, where popular files are randomly and independently cached in the memory of end users. Each user may obtain the requested files from its own memory without any transmission, or from a helper through a one-hop D2D transmission, or from the base station. We formulate a joint D2D link scheduling and power allocation problem to...
Aiming at the shortcomings of the low energy adaptive clustering hierarchy (LEACH) routing protocol, an improved protocol in scenario with uneven clustering is proposed. In order to choose the right cluster-head, it considers many factors, including the residual energy of sensor nodes, the distance between the nodes and the base station, the difference of each node and the time of the node as a cluster-head...
In this paper, we propose a coordinated scheduling scheme with adaptive user feedback to mitigate inter-cell interference (ICI). Concretely, we analyze the ICI incurred by quantized error for optimal user sorting, which decides whether the user should feedback the interfering CSI or not. Our proposed scheme can improve the feedback efficiency and reduce the backhaul overhead. Meanwhile, the scheduling...
In this paper, we investigate power control and resource allocation for long-term evolution (LTE) uplink. We develop an efficient way to improve system performance, especially for those users at cell-edge by taking interference to and from adjacent cells into consideration. Simulation results show that the spectrum efficiency of edge users is improved by about 20% over the independent resource allocation...
In order to prevent the malicious attack from reducing the accuracy of aggregation result in wireless sensor networks, it is necessary to perform the attack detection in the received readings of all the sensor nodes before the resilient aggregation processing. However, the detection probability of the attack detection algorithm presented in the literature is small, and its computation complexity is...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.