Sciweavers

11217 search results - page 1666 / 2244
» Network Coding for Wireless Networks
Sort
View
IPSN
2010
Springer
16 years 1 months ago
Routing without routes: the backpressure collection protocol
Current data collection protocols for wireless sensor networks are mostly based on quasi-static minimum-cost routing trees. We consider an alternative, highly-agile approach calle...
Scott Moeller, Avinash Sridharan, Bhaskar Krishnam...
WDAG
2007
Springer
100views Algorithms» more  WDAG 2007»
16 years 9 days ago
Scalable Load-Distance Balancing
We introduce the problem of load-distance balancing in assigning users of a delay-sensitive networked application to servers. We model the service delay experienced by a user as a ...
Edward Bortnikov, Israel Cidon, Idit Keidar
MOBICOM
2006
ACM
16 years 5 days ago
IQU: practical queue-based user association management for WLANs
Flash crowds and high concentrations of users in wireless LANs (WLANs) cause significant interference problems and unsustainable load at access points. This leads to poor connect...
Amit P. Jardosh, Kimaya Mittal, Krishna N. Ramacha...
SAC
2005
ACM
15 years 11 months ago
Dynamic group communication in mobile peer-to-peer environments
This paper presents an approach to integrate publish/subscribe semantics with on-demand multicast in wireless ad hoc networks, providing dynamic group communication with fine-gra...
Eiko Yoneki, Jean Bacon
EURONGI
2005
Springer
15 years 11 months ago
Receiver Oriented Trajectory Based Forwarding
Abstract— Trajectory Based Forwarding (TBF) is a new approach to routing in ad hoc wireless networks. It exploits node position information and, similarly to source routing, requ...
Antonio Capone, Ilario Filippini, Luigi Fratta, Lu...
« Prev « First page 1666 / 2244 Last » Next »