5,964 research outputs found
Splitting Algorithms for Fast Relay Selection: Generalizations, Analysis, and a Unified View
Relay selection for cooperative communications promises significant
performance improvements, and is, therefore, attracting considerable attention.
While several criteria have been proposed for selecting one or more relays,
distributed mechanisms that perform the selection have received relatively less
attention. In this paper, we develop a novel, yet simple, asymptotic analysis
of a splitting-based multiple access selection algorithm to find the single
best relay. The analysis leads to simpler and alternate expressions for the
average number of slots required to find the best user. By introducing a new
`contention load' parameter, the analysis shows that the parameter settings
used in the existing literature can be improved upon. New and simple bounds are
also derived. Furthermore, we propose a new algorithm that addresses the
general problem of selecting the best relays, and analyze and
optimize it. Even for a large number of relays, the algorithm selects the best
two relays within 4.406 slots and the best three within 6.491 slots, on
average. We also propose a new and simple scheme for the practically relevant
case of discrete metrics. Altogether, our results develop a unifying
perspective about the general problem of distributed selection in cooperative
systems and several other multi-node systems.Comment: 20 pages, 7 figures, 1 table, Accepted for publication in IEEE
Transactions on Wireless Communication
Green Cellular Networks: A Survey, Some Research Issues and Challenges
Energy efficiency in cellular networks is a growing concern for cellular
operators to not only maintain profitability, but also to reduce the overall
environment effects. This emerging trend of achieving energy efficiency in
cellular networks is motivating the standardization authorities and network
operators to continuously explore future technologies in order to bring
improvements in the entire network infrastructure. In this article, we present
a brief survey of methods to improve the power efficiency of cellular networks,
explore some research issues and challenges and suggest some techniques to
enable an energy efficient or "green" cellular network. Since base stations
consume a maximum portion of the total energy used in a cellular system, we
will first provide a comprehensive survey on techniques to obtain energy
savings in base stations. Next, we discuss how heterogeneous network deployment
based on micro, pico and femto-cells can be used to achieve this goal. Since
cognitive radio and cooperative relaying are undisputed future technologies in
this regard, we propose a research vision to make these technologies more
energy efficient. Lastly, we explore some broader perspectives in realizing a
"green" cellular network technologyComment: 16 pages, 5 figures, 2 table
Minimizing Outage Probability by Exploiting CSI in Wireless Powered Cooperative Networks
In this work, we address the relay selection problem for the wireless powered
communication networks, where the relays harvest energy from the source radio
frequency signals. A single source-destination pair is considered without a
direct link. The connecting relay nodes are equipped with storage batteries of
infinite size. We assume that the channel state information (CSI) on the
source-relay link is available at the relay nodes. Depending on the
availability of the CSI on the relay-destination link at the relay node, we
propose different relay selection schemes and evaluate the outage probability.
The availability of the CSI at the relay node on the relay-destination link
considerably improves the performance due to additional flexibility in the
relay selection mechanism. We numerically quantify the performance for the
proposed schemes and compare the outage probability for fixed and equal number
of wireless powered forwarding relays.Comment: accepted in IEEE Globecom 201
Information exchange in randomly deployed dense WSNs with wireless energy harvesting capabilities
©2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.As large-scale dense and often randomly deployed wireless sensor networks (WSNs) become widespread, local information exchange between colocated sets of nodes may play a significant role in handling the excessive traffic volume. Moreover, to account for the limited life-span of the wireless devices, harvesting the energy of the network transmissions provides significant benefits to the lifetime of such networks. In this paper, we study the performance of communication in dense networks with wireless energy harvesting (WEH)-enabled sensor nodes. In particular, we examine two different communication scenarios (direct and cooperative) for data exchange and we provide theoretical expressions for the probability of successful communication. Then, considering the importance of lifetime in WSNs, we employ state-of-the-art WEH techniques and realistic energy converters, quantifying the potential energy gains that can be achieved in the network. Our analytical derivations, which are validated by extensive Monte-Carlo simulations, highlight the importance of WEH in dense networks and identify the tradeoffs between the direct and cooperative communication scenarios.Peer ReviewedPostprint (author's final draft
Splitting algorithm for DMT optimal cooperative MAC protocols in wireless mesh networks
A cooperative protocol for wireless mesh networks is proposed in this paper. The protocol implements both on-demand relaying and a selection of the best relay terminal so only one terminal is relaying the source message when cooperation is needed. Two additional features are also proposed. The best relay is selected with a splitting algorithm. This approach allows fast relay selection within less than three time-slots, on average. Moreover, a pre-selection of relay candidates is performed prior to the splitting algorithm. Only terminals that are able to improve the direct path are pre-selected. So efficient cooperation is now guaranteed. We prove that this approach is optimal in terms of diversity-multiplexing trade-off. The protocol has been designed in the context of Nakagami-mfading channels. Simulation results show that the performance of the splitting algorithm does not depend on channel statistics
Optimal Timer Based Selection Schemes
Timer-based mechanisms are often used to help a given (sink) node select the
best helper node among many available nodes. Specifically, a node transmits a
packet when its timer expires, and the timer value is a monotone non-increasing
function of its local suitability metric. The best node is selected
successfully if no other node's timer expires within a 'vulnerability' window
after its timer expiry, and so long as the sink can hear the available nodes.
In this paper, we show that the optimal metric-to-timer mapping that (i)
maximizes the probability of success or (ii) minimizes the average selection
time subject to a minimum constraint on the probability of success, maps the
metric into a set of discrete timer values. We specify, in closed-form, the
optimal scheme as a function of the maximum selection duration, the
vulnerability window, and the number of nodes. An asymptotic characterization
of the optimal scheme turns out to be elegant and insightful. For any
probability distribution function of the metric, the optimal scheme is
scalable, distributed, and performs much better than the popular inverse metric
timer mapping. It even compares favorably with splitting-based selection, when
the latter's feedback overhead is accounted for.Comment: 21 pages, 6 figures, 1 table, submitted to IEEE Transactions on
Communications, uses stackrel.st
- …