Sciweavers

129 search results - page 20 / 26
» Towards an interdisciplinary theory of networks
Sort
View
TON
2008
107views more  TON 2008»
13 years 7 months ago
Efficient routing in intermittently connected mobile networks: the multiple-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»
13 years 7 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
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 5 months ago
Applications of Geometric Algorithms to Reduce Interference in Wireless Mesh Network
In wireless mesh networks such as WLAN (IEEE 802.11s) or WMAN (IEEE 802.11), each node should help to relay packets of neighboring nodes toward gateway using multi-hop routing mec...
Hung-Chin Jang
DIALM
2005
ACM
125views Algorithms» more  DIALM 2005»
13 years 9 months ago
Minimizing interference in ad hoc and sensor networks
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
Thomas Moscibroda, Roger Wattenhofer
MOBIHOC
2009
ACM
14 years 8 months ago
Aging rules: what does the past tell about the future in mobile ad-hoc networks?
The study in mobile ad-hoc networks (MANET) is facing challenges brought by recent discovery of non-exponential behavior of the inter-contact time distribution of mobile nodes. In...
Han Cai, Do Young Eun