In the Disk Multicover problem the input consists of a set P of n points in the plane, where each point p ∈ P has a covering requirement k(p), and a set B of m base stations, where each base station b ∈ B has a weight w(b). If a base station b ∈ B is assigned a radius r(b), it covers all points in the disk of radius r(b) centered at b. The weight of a radii assignment r : B → R is defined as ∑ ...

In cellular wireless communication systems, transmitted power is regulated to provide each user an acceptable connection by limiting the interference caused by other users. Several models have been considered including: (1) xed base station assignment where the assignment of users to base stations is xed, (2) minimum power assignment where a user is iteratively assigned to the base station at w...

The era of sustainable development has brought Electric Vehicles (EVs) to the spotlight. Since recharging an electric vehicle can take up to ten or more times the power consumption of a household, an increasing EV penetration in the market poses a challenge for the electricity companies. Using the Internet of Things (IoT) approach, we propose a model where electric vehicles communicate with the...

A framework for assessing the usage and level-of-service of rail access facilities is presented. It consists of two parts. A dynamic demand estimator allows to obtain time-dependent origin-destination flows within pedestrian facilities. Using that demand, a traffic assignment model describes the propagation of pedestrians through the station, providing an estimate of prevalent traffic condition...

We study new access schemes for a population of geographically distributed data users who communicate with each other and/or with a central station over a multiple-access broadcast ground radio packet-switching channel. We introduce and analyze alternating priorities (AP), round robin (RR), and random order (RO) as new conflict-free methods for multiplexing buffered users wititour corirrol from...

In this paper we consider the joint channel assignment and routing problem in multi-channel wireless sensor networks for maximizing the worst case network lifetime. We assume a data collection traffic pattern where all sensor nodes forward data to a centralized base station (sink). The proposed solutions lead to a tree rooted at the sink, comprising of sub-trees that operate over distinct chann...

This paper proposes the assignment of resource blocks (RBs) to reduce the peak-to-average power ratio (PAPR) of orthogonal frequency division multiplexing (OFDM) in a multi-user OFDM system. This system ranks the users according to the channel state information (CSI) for RB assignment. In our proposed technique, an RB is assigned to either the firstor second-ranked mobile station (MS) to minimi...

Heterogeneous networks constitute a promising solution to the emerging challenges of 5G networks. According to the specific network architecture, a macro-cell base station (MBS) shares the same spectral resources with a number of small cell base stations (SBSs), resulting in increased co-channel interference (CCI). The efficient management of CCI has been studied extensively in the literature a...

Recently, we proposed an interference-aware channel segregation based dynamic channel assignment (IACS-DCA). In IACS-DCA, each base station (BS) measures the instantaneous co-channel interference (CCI) power on each available channel, computes the moving average CCI power using past CCI measurement results, and selects the channel having the lowest moving average CCI power. In this way, the CCI...

Due to its fixed assignment nature, the well-known TDMA protocol suffers from poor performance when the offered traffic is bursty. In this paper, a Learning-Automata-Based Time Division Multiple Access protocol, which is capable of operating efficiently under bursty traffic conditions, is introduced. According to the proposed protocol, the station which grants permission to transmit at each tim...