2,515 research outputs found
Green Networking in Cellular HetNets: A Unified Radio Resource Management Framework with Base Station ON/OFF Switching
In this paper, the problem of energy efficiency in cellular heterogeneous
networks (HetNets) is investigated using radio resource and power management
combined with the base station (BS) ON/OFF switching. The objective is to
minimize the total power consumption of the network while satisfying the
quality of service (QoS) requirements of each connected user. We consider the
case of co-existing macrocell BS, small cell BSs, and private femtocell access
points (FAPs). Three different network scenarios are investigated, depending on
the status of the FAPs, i.e., HetNets without FAPs, HetNets with closed FAPs,
and HetNets with semi-closed FAPs. A unified framework is proposed to
simultaneously allocate spectrum resources to users in an energy efficient
manner and switch off redundant small cell BSs. The high complexity dual
decomposition technique is employed to achieve optimal solutions for the
problem. A low complexity iterative algorithm is also proposed and its
performances are compared to those of the optimal technique. The particularly
interesting case of semi-closed FAPs, in which the FAPs accept to serve
external users, achieves the highest energy efficiency due to increased degrees
of freedom. In this paper, a cooperation scheme between FAPs and mobile
operator is also investigated. The incentives for FAPs, e.g., renewable energy
sharing and roaming prices, enabling cooperation are discussed to be considered
as a useful guideline for inter-operator agreements.Comment: 15 pages, 9 Figures, IEEE Transactions on Vehicular Technology 201
The Impact of Antenna Height Difference on the Performance of Downlink Cellular Networks
Capable of significantly reducing cell size and enhancing spatial reuse,
network densification is shown to be one of the most dominant approaches to
expand network capacity. Due to the scarcity of available spectrum resources,
nevertheless, the over-deployment of network infrastructures, e.g., cellular
base stations (BSs), would strengthen the inter-cell interference as well, thus
in turn deteriorating the system performance. On this account, we investigate
the performance of downlink cellular networks in terms of user coverage
probability (CP) and network spatial throughput (ST), aiming to shed light on
the limitation of network densification. Notably, it is shown that both CP and
ST would be degraded and even diminish to be zero when BS density is
sufficiently large, provided that practical antenna height difference (AHD)
between BSs and users is involved to characterize pathloss. Moreover, the
results also reveal that the increase of network ST is at the expense of the
degradation of CP. Therefore, to balance the tradeoff between user and network
performance, we further study the critical density, under which ST could be
maximized under the CP constraint. Through a special case study, it follows
that the critical density is inversely proportional to the square of AHD. The
results in this work could provide helpful guideline towards the application of
network densification in the next-generation wireless networks.Comment: conference submission - Mar. 201
Bootstrapping Cognitive Radio Networks
Cognitive radio networks promise more efficient spectrum utilization by leveraging degrees of freedom and distributing data collection. The actual realization of these promises is challenged by distributed control, and incomplete, uncertain and possibly conflicting knowledge bases. We consider two problems in bootstrapping, evolving, and managing cognitive radio networks. The first is Link Rendezvous, or how separate radio nodes initially find each other in a spectrum band with many degrees of freedom, and little shared knowledge. The second is how radio nodes can negotiate for spectrum access with incomplete information. To address the first problem, we present our Frequency Parallel Blind Link Rendezvous algorithm. This approach, designed for recent generations of digital front-ends, implicitly shares vague information about spectrum occupancy early in the process, speeding the progress towards a solution. Furthermore, it operates in the frequency domain, facilitating a parallel channel rendezvous. Finally, it operates without a control channel and can rendezvous anywhere in the operating band. We present simulations and analysis on the false alarm rate for both a feature detector and a cross-correlation detector. We compare our results to the conventional frequency hopping sequence rendezvous techniques. To address the second problem, we model the network as a multi-agent system and negotiate by exchanging proposals, augmented with arguments. These arguments include information about priority status and the existence of other nodes. We show in a variety of network topologies that this process leads to solutions not otherwise apparent to individual nodes, and achieves superior network throughput, request satisfaction, and total number of connections, compared to our baselines. The agents independently formulate proposals based upon communication desires, evaluate these proposals based upon capacity constraints, create ariii guments in response to proposal rejections, and re-evaluate proposals based upon received arguments. We present our negotiation rules, messages, and protocol and demonstrate how they interoperate in a simulation environment
- âŠ