12,463 research outputs found
The Three Node Wireless Network: Achievable Rates and Cooperation Strategies
We consider a wireless network composed of three nodes and limited by the
half-duplex and total power constraints. This formulation encompasses many of
the special cases studied in the literature and allows for capturing the common
features shared by them. Here, we focus on three special cases, namely 1) Relay
Channel, 2) Multicast Channel, and 3) Conference Channel. These special cases
are judicially chosen to reflect varying degrees of complexity while
highlighting the common ground shared by the different variants of the three
node wireless network. For the relay channel, we propose a new cooperation
scheme that exploits the wireless feedback gain. This scheme combines the
benefits of decode-and-forward and compress-and-forward strategies and avoids
the idealistic feedback assumption adopted in earlier works. Our analysis of
the achievable rate of this scheme reveals the diminishing feedback gain at
both the low and high signal-to-noise ratio regimes. Inspired by the proposed
feedback strategy, we identify a greedy cooperation framework applicable to
both the multicast and conference channels. Our performance analysis reveals
several nice properties of the proposed greedy approach and the central role of
cooperative source-channel coding in exploiting the receiver side information
in the wireless network setting. Our proofs for the cooperative multicast with
side-information rely on novel nested and independent binning encoders along
with a list decoder.Comment: 52 page
Analysis of a Cooperative Strategy for a Large Decentralized Wireless Network
This paper investigates the benefits of cooperation and proposes a relay
activation strategy for a large wireless network with multiple transmitters. In
this framework, some nodes cooperate with a nearby node that acts as a relay,
using the decode-and-forward protocol, and others use direct transmission. The
network is modeled as an independently marked Poisson point process and the
source nodes may choose their relays from the set of inactive nodes. Although
cooperation can potentially lead to significant improvements in the performance
of a communication pair, relaying causes additional interference in the
network, increasing the average noise that other nodes see. We investigate how
source nodes should balance cooperation vs. interference to obtain reliable
transmissions, and for this purpose we study and optimize a relay activation
strategy with respect to the outage probability. Surprisingly, in the high
reliability regime, the optimized strategy consists on the activation of all
the relays or none at all, depending on network parameters. We provide a simple
closed-form expression that indicates when the relays should be active, and we
introduce closed form expressions that quantify the performance gains of this
scheme with respect to a network that only uses direct transmission.Comment: Updated version. To appear in IEEE Transactions on Networkin
Information Structure Design in Team Decision Problems
We consider a problem of information structure design in team decision
problems and team games. We propose simple, scalable greedy algorithms for
adding a set of extra information links to optimize team performance and
resilience to non-cooperative and adversarial agents. We show via a simple
counterexample that the set function mapping additional information links to
team performance is in general not supermodular. Although this implies that the
greedy algorithm is not accompanied by worst-case performance guarantees, we
illustrate through numerical experiments that it can produce effective and
often optimal or near optimal information structure modifications
Policies for Self Tuning Home Networks
A home network (HN) is usually managed by a user who does not possess knowledge and skills required to perform management tasks. When abnormalities are detected, it is desirable to let the network tune itself under the direction of certain policies. However, self tuning tasks usually require coordination between several network components and most of the network management policies can only specify local tasks. In this paper, we propose a state machine based policy framework to address the problem of fault and performance management in the context of HN.
Policies can be specified for complex management
tasks as global state machines which incorporate global system behaviour monitoring and reactions. We demonstrate the policy framework through a case study in which policies are specified for dynamic selection of frequency channel in order to improve wireless link quality in the presence of RF interference
Supporting development and management of smart office applications: a DYAMAND case study
To realize the Internet of Things (IoT) vision, tools are needed to ease the development and deployment of practical applications. Several standard bodies, companies, and ad-hoc consortia are proposing their own solution for inter-device communication. In this context, DYnamic, Adaptive MAnagement of Networks and Devices (DYAMAND) was presented in a previous publication to solve the interoperability issues introduced by the multitude of available technologies.
In this paper a DYAMAND case study is presented: in cooperation with a large company, a monitoring application was developed for flexible office spaces in order to reliably reorganize an office environment and give real-time feedback on the usage of meeting rooms. Three wireless sensor technologies were investigated to be used in the pilot. The solution was deployed in a "friendly user" setting at a research institute (iMinds) prior to deployment at the large company's premises. Based on the findings of both installations, requirements for an application platform supporting development and management of smart (office) applications were listed. DYAMAND was used as the basis of the implementation. Although the local management of networked devices as provided by DYAMAND enables easier development of intelligent applications, a number of remote services discussed in this paper are needed to enable reliable and up-to-date support (of new technologies)
Principles of Physical Layer Security in Multiuser Wireless Networks: A Survey
This paper provides a comprehensive review of the domain of physical layer
security in multiuser wireless networks. The essential premise of
physical-layer security is to enable the exchange of confidential messages over
a wireless medium in the presence of unauthorized eavesdroppers without relying
on higher-layer encryption. This can be achieved primarily in two ways: without
the need for a secret key by intelligently designing transmit coding
strategies, or by exploiting the wireless communication medium to develop
secret keys over public channels. The survey begins with an overview of the
foundations dating back to the pioneering work of Shannon and Wyner on
information-theoretic security. We then describe the evolution of secure
transmission strategies from point-to-point channels to multiple-antenna
systems, followed by generalizations to multiuser broadcast, multiple-access,
interference, and relay networks. Secret-key generation and establishment
protocols based on physical layer mechanisms are subsequently covered.
Approaches for secrecy based on channel coding design are then examined, along
with a description of inter-disciplinary approaches based on game theory and
stochastic geometry. The associated problem of physical-layer message
authentication is also introduced briefly. The survey concludes with
observations on potential research directions in this area.Comment: 23 pages, 10 figures, 303 refs. arXiv admin note: text overlap with
arXiv:1303.1609 by other authors. IEEE Communications Surveys and Tutorials,
201
- …