19,086 research outputs found

    Energy Efficient Relay-Assisted Cellular Network Model using Base Station Switching

    Get PDF
    Cellular network planning strategies have tended to focus on peak traffic scenarios rather than energy efficiency. By exploiting the dynamic nature of traffic load profiles, the prospect for greener communications in cellular access networks is evolving. For example, powering down base stations (BS) and applying cell zooming can significantly reduce energy consumption, with the overriding design priority still being to uphold a minimum quality of service (QoS). Switching off cells completely can lead to both coverage holes and performance degradation in terms of increased outage probability, greater transmit power dissipation in the up and downlinks, and complex interference management, even at low traffic loads. In this paper, a cellular network model is presented where certain BS rather than being turned off, are switched to low-powered relay stations (RS) during zero-to-medium traffic periods. Neighbouring BS still retain all the baseband signal processing and transmit signals to corresponding RS via backhaul connections, under the assumption that the RS covers the whole cell. Experimental results demonstrate the efficacy of this new BS-RS Switching technique from both an energy saving and QoS perspective, in the up and downlinks

    Efficiency Resource Allocation for Device-to-Device Underlay Communication Systems: A Reverse Iterative Combinatorial Auction Based Approach

    Full text link
    Peer-to-peer communication has been recently considered as a popular issue for local area services. An innovative resource allocation scheme is proposed to improve the performance of mobile peer-to-peer, i.e., device-to-device (D2D), communications as an underlay in the downlink (DL) cellular networks. To optimize the system sum rate over the resource sharing of both D2D and cellular modes, we introduce a reverse iterative combinatorial auction as the allocation mechanism. In the auction, all the spectrum resources are considered as a set of resource units, which as bidders compete to obtain business while the packages of the D2D pairs are auctioned off as goods in each auction round. We first formulate the valuation of each resource unit, as a basis of the proposed auction. And then a detailed non-monotonic descending price auction algorithm is explained depending on the utility function that accounts for the channel gain from D2D and the costs for the system. Further, we prove that the proposed auction-based scheme is cheat-proof, and converges in a finite number of iteration rounds. We explain non-monotonicity in the price update process and show lower complexity compared to a traditional combinatorial allocation. The simulation results demonstrate that the algorithm efficiently leads to a good performance on the system sum rate.Comment: 26 pages, 6 fgures; IEEE Journals on Selected Areas in Communications, 201

    Opportunistic Third-Party Backhaul for Cellular Wireless Networks

    Full text link
    With high capacity air interfaces and large numbers of small cells, backhaul -- the wired connectivity to base stations -- is increasingly becoming the cost driver in cellular wireless networks. One reason for the high cost of backhaul is that capacity is often purchased on leased lines with guaranteed rates provisioned to peak loads. In this paper, we present an alternate \emph{opportunistic backhaul} model where third parties provide base stations and backhaul connections and lease out excess capacity in their networks to the cellular provider when available, presumably at significantly lower costs than guaranteed connections. We describe a scalable architecture for such deployments using open access femtocells, which are small plug-and-play base stations that operate in the carrier's spectrum but can connect directly into the third party provider's wired network. Within the proposed architecture, we present a general user association optimization algorithm that enables the cellular provider to dynamically determine which mobiles should be assigned to the third-party femtocells based on the traffic demands, interference and channel conditions and third-party access pricing. Although the optimization is non-convex, the algorithm uses a computationally efficient method for finding approximate solutions via dual decomposition. Simulations of the deployment model based on actual base station locations are presented that show that large capacity gains are achievable if adoption of third-party, open access femtocells can reach even a small fraction of the current market penetration of WiFi access points.Comment: 9 pages, 6 figure
    • …
    corecore