Sciweavers

4245 search results - page 675 / 849
» Delay Tolerant Networking
Sort
View
TON
2008
109views more  TON 2008»
15 years 6 months ago
Efficient routing in intermittently connected mobile networks: the single-copy case
Abstract--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 m...
Thrasyvoulos Spyropoulos, Konstantinos Psounis, Ca...
JSAC
2007
97views more  JSAC 2007»
15 years 6 months ago
R2: Random Push with Random Network Coding in Live Peer-to-Peer Streaming
— In information theory, it has been shown that network coding can effectively improve the throughput of multicast communication sessions in directed acyclic graphs. More practic...
Mea Wang, Baochun Li
NN
2000
Springer
152views Neural Networks» more  NN 2000»
15 years 6 months ago
A neural network theory of proportional analogy-making
A neural network model that can simulate the learning of some simple proportional analogies is presented. These analogies include, for example, (a) red-square:red-circle yellow-sq...
Nilendu G. Jani, Daniel S. Levine
WICOMM
2010
143views more  WICOMM 2010»
15 years 4 months ago
Routing for cognitive radio networks consisting of opportunistic links
Cognitive radio (CR) has been considered a key technology to enhance overall spectrum utilization by opportunistic transmissions in CR transmitter-receiver link(s). However, CRs m...
Kwang-Cheng Chen, Bilge Kartal Cetin, Yu-Cheng Pen...
WINET
2010
185views more  WINET 2010»
15 years 4 months ago
TDMA scheduling algorithms for wireless sensor networks
Abstract Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link or node is a...
Sinem Coleri Ergen, Pravin Varaiya