Results 1 - 10
of
1,699
Efficient routing in intermittently connected mobile networks: The multiple-copy case
, 2008
"... Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are many real networks that follow this model, for example, wildlife tracking sensor networks, military networks, vehicular ad hoc net ..."
Abstract
-
Cited by 303 (18 self)
- Add to MetaCart
Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are many real networks that follow this model, for example, wildlife tracking sensor networks, military networks, vehicular ad hoc
Wireless Network Information Flow: A Deterministic Approach
, 2009
"... In contrast to wireline networks, not much is known about the flow of information over wireless networks. The main barrier is the complexity of the signal interaction in wireless channels in addition to the noise in the channel. A widely accepted model is the the additive Gaussian channel model, and ..."
Abstract
-
Cited by 296 (42 self)
- Add to MetaCart
the Gaussian model but still captures two key wireless channel properties of broadcast and superposition. We consider a model for a wireless relay network with nodes connected by such deterministic channels, and present an exact characterization of the end-to-end capacity when there is a single source and one
Constructing Minimum Relay Connected Sensor Cover in Heterogeneous Wireless Sensor Networks
"... Abstract. Energy efficiency is an important problem in wireless sensor net-works. In this paper, we consider the energy efficiency problem in a hetero-geneous wireless sensor network which consists of energy-constrained sensor nodes and resource-rich relay nodes. We firstly formulate the minimum rel ..."
Abstract
- Add to MetaCart
connectivity afterwards. To construct the minimum sensor cover, we present a principle for selecting sens-ing nodes based on the triangle lattice. In order to guarantee the relay connectivity of selected sensing nodes, we propose verification and reinforcement procedures. Extensive simulations show
Neural mechanisms of empathy in humans: a relay from neural systems for imitation to limbic areas
- Procedings of the National Academy of Science USA
, 2003
"... How do we empathize with others? A mechanism according towhich action representation modulates emotional activity mayprovide an essential functional architecture for empathy. Thesuperior temporal and inferior frontal cortices are critical areas for action representation and are connected to the limb ..."
Abstract
-
Cited by 213 (4 self)
- Add to MetaCart
How do we empathize with others? A mechanism according towhich action representation modulates emotional activity mayprovide an essential functional architecture for empathy. Thesuperior temporal and inferior frontal cortices are critical areas for action representation and are connected
BCube: A High Performance, Server-centric Network Architecture for Modular Data Centers
- In SIGCOMM
, 2009
"... This paper presents BCube, a new network architecture specifically designed for shipping-container based, modular data centers. At the core of the BCube architecture is its server-centric network structure, where servers with multiple network ports connect to multiple layers of COTS (commodity off-t ..."
Abstract
-
Cited by 248 (31 self)
- Add to MetaCart
This paper presents BCube, a new network architecture specifically designed for shipping-container based, modular data centers. At the core of the BCube architecture is its server-centric network structure, where servers with multiple network ports connect to multiple layers of COTS (commodity off
The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms
- Russian Math. Surveys
, 1970
"... In 1964 Kolmogorov introduced the concept of the complexity of a finite object (for instance, the words in a certain alphabet). He defined complexity as the minimum number of binary signs containing all the information about a given object that are sufficient for its recovery (decoding). This defini ..."
Abstract
-
Cited by 235 (1 self)
- Add to MetaCart
gave definitions of the quantity of information in finite objects and of the concept of a random sequence (which was then defined more precisely by Martin-Lof). Afterwards, this circle of questions developed rapidly. In particular, an interesting development took place of the ideas of Markov
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
of an underlying percolation model. If nodes are allowed to transmit over large distances, then paths of connected nodes that cross the entire network area can be easily found, but these generate excessive interference. If nodes transmit over short distances, then such crossing paths do not exist. Percolation
A Deterministic Approach to Wireless Relay Networks
, 2007
"... We present a deterministic channel model which captures several key features of multiuser wireless communication. We consider a model for a wireless network with nodes connected by such deterministic channels, and present an exact characterization of the end-toend capacity when there is a single so ..."
Abstract
-
Cited by 135 (23 self)
- Add to MetaCart
source and a single destination and an arbitrary number of relay nodes. This result is a natural generalization of the max-flow mincut theorem for wireline networks. Finally to demonstrate the connections between deterministic model and Gaussian model, we look at two examples: the single-relay channel
On the Capacity of Hybrid Wireless Networks
, 2003
"... We study the throughput capacity of hybrid wireless networks. A hybrid network is formed by placing a sparse network of base stations in an ad hoc network. These base stations are assumed to be connected by a high-bandwidth wired network and act as relays for wireless nodes. They are not data source ..."
Abstract
-
Cited by 214 (4 self)
- Add to MetaCart
We study the throughput capacity of hybrid wireless networks. A hybrid network is formed by placing a sparse network of base stations in an ad hoc network. These base stations are assumed to be connected by a high-bandwidth wired network and act as relays for wireless nodes. They are not data
Computing connected dominated sets with multipoint relays
- Journal of Ad Hoc and Sensor Wireless Networks
, 2002
"... Multipoint relays offer an optimized way of flooding packets in a radio network. However, this technique requires the last hop knowledge: to decide whether or not a flooding packet is retransmitted, a node needs to know from which node the packet was received. When considering broadcasting at IP lev ..."
Abstract
-
Cited by 77 (4 self)
- Add to MetaCart
level, this information may be difficult to obtain. We thus propose a scheme for computing an optimized connected dominating set from multipoint relays. Proof of correctness and simulations are given for all these broadcasting mechanisms. Key-words: multipoint relays, connected dominating set, ad hoc
Results 1 - 10
of
1,699