Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
2,966
Optimum Relay Location in Cooperative Communication Networks with Single AF Relay
, 2010
"... In recent years cooperative diversity has been widely used in wireless networks. In particular, cooperative communication with a single relay is a simple, practical technology for wireless sensor networks. In this pa-per, we analyze several simple network topologies. Under the condition of equal pow ..."
Abstract
- Add to MetaCart
power allocating, the opti-mum relay location of each network topology are respectively made sure by using symbol error rate (SER) formula. And these types of topologies are compared, the analysis results show that, linear network topology has the best system performance, the system performance
Fading relay channels: Performance limits and space-time signal design
- IEEE J. SELECT. AREAS COMMUN
, 2004
"... Cooperative diversity is a transmission technique where multiple terminals pool their resources to form a virtual antenna array that realizes spatial diversity gain in a distributed fashion. In this paper, we examine the basic building block of cooperative diversity systems, a simple fading relay ch ..."
Abstract
-
Cited by 445 (4 self)
- Add to MetaCart
of the paper is devoted to (distributed) space-time code design for fading relay channels operating in the AF mode. We show that the corresponding code design criteria consist of the traditional rank and determinant criteria for the case of co-located antennas as well as appropriate power control rules
Cooperative diversity in wireless networks: efficient protocols and outage behavior
- IEEE TRANS. INFORM. THEORY
, 2004
"... We develop and analyze low-complexity cooperative diversity protocols that combat fading induced by multipath propagation in wireless networks. The underlying techniques exploit space diversity available through cooperating terminals’ relaying signals for one another. We outline several strategies ..."
Abstract
-
Cited by 2009 (31 self)
- Add to MetaCart
We develop and analyze low-complexity cooperative diversity protocols that combat fading induced by multipath propagation in wireless networks. The underlying techniques exploit space diversity available through cooperating terminals’ relaying signals for one another. We outline several strategies
Tor: The secondgeneration onion router,”
- in 13th USENIX Security Symposium. Usenix,
, 2004
"... Abstract We present Tor, a circuit-based low-latency anonymous communication service. This second-generation Onion Routing system addresses limitations in the original design by adding perfect forward secrecy, congestion control, directory servers, integrity checking, configurable exit policies, an ..."
Abstract
-
Cited by 1229 (33 self)
- Add to MetaCart
, and a practical design for location-hidden services via rendezvous points. Tor works on the real-world Internet, requires no special privileges or kernel modifications, requires little synchronization or coordination between nodes, and provides a reasonable tradeoff between anonymity, usability
Capacity bounds and power allocation for wireless relay channels
- IEEE TRANS. INF. THEORY
, 2005
"... We consider three-node wireless relay channels in a Rayleigh-fading environment. Assuming transmitter channel state information (CSI), we study upper bounds and lower bounds on the outage capacity and the ergodic capacity. Our studies take into account practical constraints on the transmission/rece ..."
Abstract
-
Cited by 324 (6 self)
- Add to MetaCart
/reception duplexing at the relay node and on the synchronization between the source node and the relay node. We also explore power allocation. Compared to the direct transmission and traditional multihop protocols, our results reveal that optimum relay channel signaling can significantly outperform multihop protocols
Predictive Models for the Breeder Genetic Algorithm -- I. Continuous Parameter Optimization
- EVOLUTIONARY COMPUTATION
, 1993
"... In this paper a new genetic algorithm called the Breeder Genetic Algorithm (BGA) is introduced. The BGA is based on artificial selection similar to that used by human breeders. A predictive model for the BGA is presented which is derived from quantitative genetics. The model is used to predict t ..."
Abstract
-
Cited by 400 (25 self)
- Add to MetaCart
the behavior of the BGA for simple test functions. Different mutation schemes are compared by computing the expected progress to the solution. The numerical performance of the BGA is demonstrated on a test suite of multimodal functions. The number of function evaluations needed to locate the optimum scales
Geographic random forwarding (GeRaF) for ad hoc and sensor networks: Energy and latency performance
- IEEE TRANSACTIONS ON MOBILE COMPUTING
, 2003
"... In this paper, we study a novel forwarding technique based on geographical location of the nodes involved and random selection of the relaying node via contention among receivers. We provide a detailed description of a MAC scheme based on these concepts and on collision avoidance and report on its e ..."
Abstract
-
Cited by 368 (15 self)
- Add to MetaCart
In this paper, we study a novel forwarding technique based on geographical location of the nodes involved and random selection of the relaying node via contention among receivers. We provide a detailed description of a MAC scheme based on these concepts and on collision avoidance and report on its
Near-optimal sensor placements in gaussian processes
- In ICML
, 2005
"... When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to address this task, for example, geometry or disk models, placing sensors at the points of highest entropy (variance) in t ..."
Abstract
-
Cited by 342 (34 self)
- Add to MetaCart
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to address this task, for example, geometry or disk models, placing sensors at the points of highest entropy (variance
Optimum Resource Allocation for Relay Networks with Differential Modulation
"... Abstract-In this paper, we investigate the resource allocation in a differentially modulated relay network. In addition to the energy optimization, we also consider location optimization to minimize the average symbol error rate (SER). The closedform solution is derived for the single-relay case, a ..."
Abstract
- Add to MetaCart
Abstract-In this paper, we investigate the resource allocation in a differentially modulated relay network. In addition to the energy optimization, we also consider location optimization to minimize the average symbol error rate (SER). The closedform solution is derived for the single-relay case
Closing the gap in the capacity of wireless networks via percolation theory
- IEEE TRANS. INFORMATION THEORY
, 2007
"... An achievable bit rate per source–destination pair in a wireless network of � randomly located nodes is determined adopting the scaling limit approach of statistical physics. It is shown that randomly scattered nodes can achieve, with high probability, the same Ia � � transmission rate of arbitrari ..."
Abstract
-
Cited by 238 (8 self)
- Add to MetaCart
An achievable bit rate per source–destination pair in a wireless network of � randomly located nodes is determined adopting the scaling limit approach of statistical physics. It is shown that randomly scattered nodes can achieve, with high probability, the same Ia � � transmission rate
Results 1 - 10
of
2,966
