Sciweavers

176 search results - page 29 / 36
» Routing with Probabilistic Delay Guarantees in Wireless Ad-H...
Sort
View
MOBIHOC
2008
ACM
14 years 7 months ago
Routing in a cyclic mobispace
A key challenge of routing in delay tolerant networks (DTNs) is to find routes that have high delivery rates and low endto-end delays. When oracles are not available for future co...
Cong Liu, Jie Wu
MOBIHOC
2007
ACM
14 years 7 months ago
Scalable routing in delay tolerant networks
The non-existence of an end-to-end path poses a challenge in adapting the traditional routing algorithms to delay tolerant networks (DTNs). Previous works include centralized rout...
Cong Liu, Jie Wu
WINET
2010
185views more  WINET 2010»
13 years 5 months ago
TDMA scheduling algorithms for wireless sensor networks
Abstract Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link or node is a...
Sinem Coleri Ergen, Pravin Varaiya
MSWIM
2006
ACM
14 years 1 months ago
Establishing how many VoIP calls a wireless LAN can support without performance degradation
The use of Voice IP (VoIP) over wireless local area networks (WLAN) is a topic of great interest in the research arena. This paper attempts to answer the question: how many VoIP c...
Ángel Cuevas Rumín, Eur Ing Chris Gu...
AINA
2006
IEEE
13 years 11 months ago
Constrained Flooding: A Robust and Efficient Routing Framework for Wireless Sensor Networks
Flooding protocols for wireless networks in general have been shown to be very inefficient and therefore are mainly used in network initialization or route discovery and maintenan...
Ying Zhang, Markus P. J. Fromherz