Sciweavers

306 search results - page 14 / 62
» Routing Algorithms for Anycast Messages
Sort
View
CAI
2002
Springer
14 years 11 months ago
Depth First Search and Location Based Localized Routing and QoS Routing in Wireless Networks
In a localized routing algorithm, node A currently holding the message forwards it based on the location of itself, its neighboring nodes and destination. We propose to use depth ...
Ivan Stojmenovic, Mark Russell, Bosko Vukojevic
MSWIM
2006
ACM
15 years 5 months ago
Routing in intermittent network topologies
The topic of this paper is the algorithmic development of routing techniques for Delay Tolerant Networks (DTNs). Assuming a store and forward type of network transfers, our main o...
Padma Mundur, Sookyoung Lee, Matthew Seligman
JCST
2008
144views more  JCST 2008»
14 years 11 months ago
Beacon-Less Geographic Routing in Real Wireless Sensor Networks
Geographic Routing (GR) algorithms, require nodes to periodically transmit HELLO messages to allow neighbors know their positions (beaconing mechanism). Beacon-less routing algorit...
Juan A. Sánchez, Rafael Marín-P&eacu...
INFOCOM
2008
IEEE
15 years 6 months ago
Randomized 3D Geographic Routing
—We reconsider the problem of geographic routing in wireless ad hoc networks. We are interested in local, memoryless routing algorithms, i.e. each network node bases its routing ...
Roland Flury, Roger Wattenhofer
TELSYS
2002
73views more  TELSYS 2002»
14 years 11 months ago
Avoiding Counting to Infinity in Distance Vector Routing
The Routing Information Protocol (RIP) may introduce misleading routing information into the routing table, due to network topology changes such as link or router failures. This is...
Andreas Schmid, Christoph Steigner