Sciweavers

481 search results - page 1 / 97
» Routing without routes: the backpressure collection protocol
Sort
View
IPSN
2010
Springer
13 years 11 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...
SIGCOMM
2010
ACM
13 years 3 months ago
Backpressure-based routing protocol for DTNs
In this paper we consider an alternative, highly agile approach called backpressure routing for Delay Tolerant Networks (DTN), in which routing and forwarding decisions are made o...
Amit Dvir, Athanasios V. Vasilakos
ICDCS
1996
IEEE
13 years 9 months ago
Group Routing without Group Routing Tables
We present a group routing protocol for a network of processes. The task of the protocol is to route data messages to each member of a process group. To this end, a tree of proces...
Jorge Arturo Cobb, Mohamed G. Gouda
INFOCOM
2010
IEEE
13 years 3 months ago
Back-Pressure Routing for Intermittently Connected Networks
—We study a mobile wireless network where groups or clusters of nodes are intermittently connected via mobile “carriers” (the carriers provide connectivity over time among di...
Jung Ryu, Lei Ying, Sanjay Shakkottai
MUE
2008
IEEE
218views Multimedia» more  MUE 2008»
13 years 11 months ago
I-SEAD: A Secure Routing Protocol for Mobile Ad Hoc Networks
Ad hoc networks are highly dynamic routing networks cooperated by a collection of wireless mobile hosts without any assistance of centralized access point. Secure Efficient Ad hoc...
Chu-Hsing Lin, Wei-Shen Lai, Yen-Lin Huang, Mei-Ch...