Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
Given a wireless network where some pairs of communication links interfere with each other, we study sufficient conditions for determining whether a given set of minimum bandwidth quality-of-service (QoS) requirements can be satisfied. We are especially interested in algorithms which have low communication overhead and low processing complexity. The interference in the network is modeled using a conflict...
In this paper, we present short communication schedules for broadcast, data aggregation, data gathering, and gossiping in multihop wireless networks subject to physical interference. We assume that all communications proceed in synchronous time-slots, each node can transmit at most one packet of fixed size in each time-slot, and all nodes have fixed and equal transmission power. Under mild assumptions,...
This paper investigates the properties of social choice functions, that represent resource allocation strategies in interference coupled wireless systems. The resources can be physical layer parameters such as power vectors or antenna weights. The paper investigates the permissible social choice functions, which can be implemented by a mechanism in either Nash equilibria or dominant strategy - for...
CSMA policies are examples of simple distributed scheduling algorithms in wireless networks. In this paper, we study the delay properties of CSMA in the limit of large networks. We first define an ideal network under which CSMA becomes memoryless in that the delay to access the channel becomes an exponential r.v. independent of the past. We then show that, in the limit of large bipartite graphs with...
We consider a Gaussian relay channel, with the source and relay operating in different frequency bands. Hence, the received signals at the destination are orthogonal. We also assume that the source reuses the frequency band in which the relay is operating, to communicate with another destination. This results in a scenario that can be modeled in such a way that the relay-destination link suffers from...
Many next generation applications (such as video flows) are likely to have associated minimum data rate requirements to ensure satisfactory quality as perceived by end-users. While there have been prior approaches on supporting quality-of-service (QoS) in mesh networks, they have largely ignored the issues that arise due to self-interference, the interference between different link layer transmissions...
In this paper, we study distributed power control in an interference network. In particular, distributed power control mechanisms are devised by exploiting a one-shot non-cooperative game based on a suitably chosen utility function. The utility is a function of quality of service (QoS) objectives defined in terms of fading-induced outage probabilities. Equilibrium analysis of the resulting power control...
We introduce a model of a generalised multi-receiver radio network with quality-of-service (QoS) constraints. There are two key functions: (1) Ni is non-decreasing and homogeneous and gives i's QoS as function of its carrier-to-interference ratios at each of K receivers, (2) nu_ik is a semi-norm that gives the interference experienced by transmitter i at receiver k as function of the power vector...
Recently, cooperative communication is shown to be a promising approach to achieve spatial diversity. The performance improvement by cooperative communication heavily depends on selecting suitable relay node. Therefore, designing effective relay assignment algorithm becomes critical in wireless cooperative networks. Although many studies focus on relay assignment problem, none of them concerns the...
This paper presents an efficient protocol for reliably exchanging information in a single-hop, multi-channel radio network subject to unpredictable interference. We model the interference by an adversary that can simultaneously disrupt up to t of the C available channels. We assume no shared secret keys or third-party infrastructure. The running time of our protocol depends on the gap between C and...
The correct estimation of the DVB-H (digital video broadcasting, handheld) coverage area is essential part in the pre-planning of the network. In addition to the coverage and respective capacity planning, the in-depth work also requires an estimation of the quality of service levels, which depends mainly on the radio related parameters. This paper presents a simulation method in order to predict the...
We consider the power optimization problem of maximizing the sum rate of a symmetric network of interfering links in Gaussian noise. All transmitters have an average transmit power constraint, the same for all transmitters. We solve this nonconvex problem by identifying some underlying convex structure. In particular, we characterize the maximum sum rate of the network, and show that there are essentially...
We study the maximum weight independent sets of links between nodes distributed as a spatial Poisson process in an infinite plane. Three different definitions of the weight of a link are considered, leading to slight variations of what is essentially a spatial reuse problem in wireless multihop networks. A simple Boolean interference model is assumed with the interference radius equaling the transmission...
Recent studies on spectrum usage reveal poor utilization, both spatially and temporally. Opportunistic use of licensed spectrum while limiting interference to primary users can enhance spectrum reuse and provide orders of magnitude improvement in available channel capacity. This calls for spectrum sharing protocols that are dynamic, flexible, and efficient, in addition to being fair to end users....
We study a distributed algorithm for adapting transmit beamforming vectors in a multi-antenna peer-to-peer wireless network. The algorithm attempts to maximize a sum of per-user utility functions, where each user's utility is a function of his transmission rate, or equivalently the received signal-to-interference plus noise ratio (SINR). This is accomplished by exchanging interference prices, each...
We study a class of population game frameworks called stable games, introduced by Hofbauer and Sandholm (2007). We give several examples of applications of stable population games in the context of wireless networks including resource allocation, impact of malicious users in cognitive radio networks and power control. We model and analyze a base station assignment problem and interference control...
We examine routing over two classes of orthogonal information networks. The first is a relay network with orthogonal inputs. The nodes in this network do not broadcast, but communicate to the different nodes via independent inputs. There is multiple access interference at every node. The second network is the Gaussian broadcast network with no interference. The nodes in this network broadcast, but...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.