Sciweavers

1395 search results - page 241 / 279
» Self-stabilizing Routing Algorithms for Wireless Ad-Hoc Netw...
Sort
View
ICC
2008
IEEE
121views Communications» more  ICC 2008»
14 years 2 months ago
Finding the Fastest Path in Wireless Networks
—The timeliness of packet delivery is an important performance measure in wireless networks, especially when urgent messages need to be transported through a network. This paper ...
Yi Xu, Wenye Wang
GLOBECOM
2008
IEEE
14 years 2 months ago
Time Dependent Message Spraying for Routing in Intermittently Connected Networks
—Intermittently connected mobile networks, also called Delay Tolerant Networks (DTNs), are wireless networks in which at any given time instance, the probability of having a comp...
Eyuphan Bulut, Zijian Wang, Boleslaw K. Szymanski
CN
2007
148views more  CN 2007»
13 years 7 months ago
Using taxonomies for content-based routing with ants
Although the ant metaphor has been successfully applied to routing of data packets both in wireless and fixed networks, little is known yet about its appropriateness for search i...
Elke Michlmayr, Arno Pany, Gerti Kappel
SODA
2004
ACM
98views Algorithms» more  SODA 2004»
13 years 9 months ago
End-to-end packet-scheduling in wireless ad-hoc networks
Abstract Packet-scheduling is a particular challenge in wireless networks due to interference from nearby transmissions. A distance-2 interference model serves as a useful abstract...
V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Pa...
ICOIN
2007
Springer
14 years 1 months ago
Balanced Multipath Source Routing
Abstract. We consider the problem of balancing the traffic load ideally over a wireless multihop network. In previous work, a systematic approach to this task was undertaken, start...
Shreyas Prasad, André Schumacher, Harri Haa...