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 paper, we consider the balance between the energy efficiency (EE) and the short-term fairness among individual users in a muiticell MISO downlink. Firstly, the power consumption and sum proportional rate are utilized jointly to construct an objective function. Then a transmit beamformer optimization problem for the objective maximization subject to transmit power constraints is formulated...
We are considering problem of estimating autoregressive signal coefficients over a network of agents. Noise and/or multipath are disturbing reception of the signals in network nodes. The autoregressive signals have different powers and delays at different nodes. Least-mean-square algorithms are used in nodes for the estimation as well as the cooperation strategy based on the adapt-then-combine diffusion...
We consider distributed prediction of signals modeled as autoregressive processes. A signal from this class is assumed to be received in different network nodes with different delays and attenuations. Each node can be affected by additive noise of different strength. Additionally, some nodes are affected by multipath effects and interference. Nodes cooperate using the adapt-then-combine least mean...
We consider a network comprised of multiple primary users (PUs) and multiple secondary users (SUs), where the SUs seek access to a set of orthogonal channels each occupied by one PU. Only one SU is allowed to coexist with a given PU. We propose a distributed matching algorithm to pair the network users, where a Stackelberg game model is assumed for the interaction between the paired PU and SU. The...
Driven by green communications, energy efficiency (EE) has become a new important criterion for designing wireless communication systems. However, high EE often leads to low spectral efficiency (SE), which spurs the research on EE-SE tradeoff. In this paper, we focus on how to maximize the utility in physical layer for an uplink multi-user multiple-input multiple-output (MU-MIMO) system, where we...
In wireless sensor networks, network lifetime is among the most important criteria. Network lifetime mainly depends on the link scheduling established at the Medium Access Control layer. Indeed, the avoidance of transmission conflicts enables energy savings since there are no message retransmissions. We are interested in deterministic allocation of the wireless medium for data collection in tree based...
We describe new Bayesian algorithms for cooperative blind equalization in a network in which the signal broadcast by a single transmitter is received by multiple remote nodes through distinct frequency-selective channels. The algorithms are based on Rao-Blackwellized point mass filters, and approximate the posterior densities of the unknown channel parameters by Gaussian mixtures of fixed order. To...
We consider a wireless communication system in which N transmitter-receiver pairs want to communicate with each other. Each transmitter transmits data at a certain rate using a power that depends on the channel gain to its receiver. If a receiver can successfully receive the message, it sends an acknowledgement (ACK), else it sends a negative ACK (NACK). Each user aims to maximize its probability...
We consider a Gaussian interference channel with independent direct and cross link channel gains, each of which is independent and identically distributed across time. Each transmitter-receiver user pair aims to maximize its long-term average transmission rate subject to an average power constraint. We formulate a stochastic game for this system in three different scenarios. First, we assume that...
In cognitive radio (CR) networks, due to the uncertainty of primary users' (PUs) traffic, there are vacant bandwidths that can be accessed by secondary users (SUs). Thus, this provides mutual benefit opportunities for both PUs and SUs. In this paper, the objective is to select the optimal channel utilization for maximizing the system utility. To solve the problem, we employ the matching theory as...
Community structure is one of the most important and characteristic features of social networks. Numerous methods for discovering implicit user communities from a social graph of users have been proposed in recent years. However, most of them have performance and scalability issues which make them hardly applicable to population-wide analysis of modern social networks (billions of users and growing)...
Transparent coexistence, also known as underlay, offers much more efficient spectrum sharing than traditional interweave coexistence paradigm. In a previous work, the transparent coexistence for a multi-hop secondary networks is studied. In this paper, we design a distributed solution to achieve this paradigm. In our design, we show how to increase the number of data streams iteratively while meeting...
This paper studies a two-link interference channel (IFC) with simultaneous wireless information and power transfer (SWIPT). We aim to maximize the minimum signal to interference plus noise ratio (SINR) of the two links by jointly designing the power allocations at the transmitters and the power splitting (PS) ratios at the receivers under both the individual minimum energy harvesting (EH) constraints...
Future wide-area measurement and control applications in large electric power systems will require a new decentralized architecture that scales up with the rapidly growing deployment of Phasor Measurement Units (PMUs). The emerging cloud computing paradigm that allows dynamic creation of virtual machines to form virtual data centers would help better support this new architecture through more efficient...
This paper deals with the design of pre-coding and decorrelation matrices in the constant MIMO interference channel. First, we propose a distributed algorithm that enables all the streams of the links in the network to reach a set of target signal to interference plus noise ratios (SINRs). Depending on the chosen SINR targets, it is shown that the algorithm performs either perfect interference alignment...
Interference Alignment and Cancelation (IAC) aims at significantly improving the wireless channel capacity. Existing algorithms for IAC are computationally intensive, which may lead to long execution times. A practical implementation of IAC is infeasible for fast-varying channels (when the coherence time is small, e.g., less than 0.5 s). This is because a significant amount of time has to be spent...
Real time media distribution services such as live streaming and video on demand (VoD) have gained great popularity among users. Specifically, it has been noted that VoD generates a respectable percentage of the internet traffic. On the other hand major VoD service providers (i.e. youtube) are not scalable, and thus not profitable due to bandwidth costs. Additionally, their servers consume a vast...
In wireless sensor networks, nodes are deployed in sensor field for various monitoring applications such as tracking, rescue operations, disaster relief, traffic monitoring, etc. So node localization is one of the fundamental challenges in the wireless sensor network. This study presented an overview of the various localization techniques used to find the position of a sensor node in wireless sensor...
A new distributed algorithm for outerplanar network recognition and embedding is presented. The algorithm requires 2n-2 time and transmits at most 5m messages of O(lg n) length, where m is the number of links and n is the number of nodes in the network. In addition, if the network is indeed outerplanar, the algorithm will run in 2n-2 time and transmit at most 10n-15 messages. This time bound is the...
Multi-layered video streaming considers different quality requirements of the receivers. Network coding has been shown to be a useful tool to increase throughput of multi-layered service compared to simple multicasting. Kim et al. gave a simple effective algorithm using network coding. We generalize their approach and give an algorithm that solves the problem for two layers optimally for certain natural...
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.