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 this work, we consider a cellular cell with D2D links being activated. Besides, the transmission scheme is assumed to be OFDM. With the underlay in-band spectrum sharing scheme, the D2D links can access the spectrum occupied by the cellular links. Hence, the D2D links may interfere with the existing cellular links. Moreover, since the D2D links' channels could overlap, the D2D links are modeled...
A new cross-layer proportional fair scheduling algorithm suited for delay tolerant traffic in both saturated and non-saturated regimes is presented. Unlike the classical proportional fair scheduling algorithm where the instantaneous rate is normalized by the past average throughput, in the proposed algorithm the normalization is done with respect to the past maximal values. And unlike cumulative distribution...
This paper focuses on mitigation of cross-tier and co-tier interference for dense deployment of the femtocells (FAPs). We propose a centralized dynamic radio resource allocation scheme exploiting graph theory approach. The FAPs either utilize an overlapping allocation mode (OAM) or a non-overlapping allocation mode (NAM). The allocation mode is dynamically selected by a control unit (CU) depending...
Transmission Opportunity (TXOP) which is specified in the IEEE 802.11e enables a Wi-Fi station to transmit multiple frames consecutively. In this paper, we propose an adaptive transmission scheme based on the Dynamic Aggregation and Fragmentation (DAF) algorithm. With real-time scheduling and adaptive TXOP allocation being the main focus of the suggested adaptive transmission scheme, optimum transmission...
In this paper, we propose distributed static and dynamic optimal policies in a random access environment, comprised of energy harvesting (EH) nodes, in order to maximize the sum throughput. In static approach, each EH node exploits an optimal constant power to transmit its packets. However in dynamic one, the EH nodes adjust their transmission powers based on their network information, leading to...
We present the Dynamic Inhibition Areas Reaction-Diffusion (DIA-RD) algorithm, a distributed medium access control protocol that globally maximizes the spatial reusability (number of simultaneous transmissions per unit area) of wireless sensor networks. This algorithm is able, in consequence, to minimize the number of time slots needed to schedule the set of demanded links, making it very efficient...
This paper studies quality-of-service (QoS)-aware frequency provisioning schemes for a downlink multi-user multi-carrier system in a frequency-selective fading environment with diverse user-QoS requirements in terms of target delay and effective capacity (EC). Since a jointly optimal power and sub-carrier allocation requires an exponential-time exhaustive search, we explore an alternative simpler...
Wireless Virtualization enables multiple concurrent virtual networks running on shared wireless substrate resource, which makes networks more flexible, efficient and customizable. Efficiently allocating physical wireless spectrum to multiple virtual networks to enhance the resource utilization is a fundamental challenge. Different from previous works focusing on only one physical wireless network,...
In dynamic cognitive radio networks (CRNs), unlicensed secondary users (SUs) opportunistically transmit in the spectrum holes left available by licensed primary users (PUs), without knowing in advance their presence on the channels. For SUs with multi-channel transmission capability, the process of selecting the channels to use by sequentially sensing the presence of PUs and evaluating the channel...
We consider a cellular network in which base station positions, power levels and coverage areas are highly inhomogeneous or irregular — referred to in this paper as an irregular network. An adaptive algorithmic framework for resource allocation in irregular networks is discussed. Specifically, the framework is based on dynamically forming clusters of coordinating cells. As part of the overall framework,...
Mobile applications are providing increasingly richer functionalities, which generally result in high computational complexity and thus high energy consumption of mobile devices. In this article, to alleviate the computational burden of mobile devices, we present a Dynamic Programming based Offloading Algorithm (DPOA) to quickly find the optimal partitioning between executing subcomponents of a mobile...
The deployment of small cells is expected to gain huge momentum in the near future, as a solution for managing the skyrocketing mobile data demand growth. Local caching of popular files at the small cell base stations has been recently proposed, aiming at reducing the traffic incurred when transferring the requested content from the core network to the users. In this paper, we propose and analyze...
WiFi access points (APs) are nowadays ubiquitous in multi-level buildings to provide uninterrupted network access to mobile users. WiFi signals are the widely recognized option to provide feasible indoor positioning system (IPS). However majority of IP research concentrates on 2D positioning compared to vertical or floor level determination. To date the most reliable floor determination techniques...
In wireless sensor networks, the connectivity-based localization protocols are widely studied due to low cost and no requirement for special hardware. Many connectivity-based algorithms rely on distance estimation between nodes according to their hop count, which often yields large errors in anisotropic sensor network. In this paper, we propose a virtual potential field algorithm, in which the estimated...
Targeting for providing communication services in the Intermittently Connected Vehicular Networks (ICVN) where there are no end-to-end communication and routing paths between vehicles, many relaying algorithms and routing protocol have been proposed under the assumption that vehicular nodes in the network are homogeneously distributed in the network with the same contact rate and delivery cost. However,...
Electric vehicle (EV) is a promising transportation with plenty of advantages, e.g., low carbon emission, high energy efficiency. However, it requires frequent and long time charging. In public charging stations, EVs spend long time on queuing especially during peak hours. Hence, it requires an efficient method to reduce the total charging time for EVs. We study the Electric Vehicle Charging-Scheduling...
This paper focuses on the coverage of specific Zones of Interest that can change dynamically over time by using a swarm of flying robots. The mobility of the flying devices is achieved by the design of two distributed and local algorithms. The first algorithm is based on Particle Swarm Optimization (PSO) and Virtual Forces Algorithm (VFA). We modify the classical PSO approach to propose a totally...
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.