Sciweavers

62 search results - page 1 / 13
» Finding the Fastest Path in Wireless Networks
Sort
View
ICC
2008
IEEE
121views Communications» more  ICC 2008»
13 years 10 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
ICDE
2006
IEEE
137views Database» more  ICDE 2006»
14 years 5 months ago
Finding Fastest Paths on A Road Network with Speed Patterns
This paper proposes and solves the Time-Interval All Fastest Path (allFP) query. Given a user-defined leaving or arrival time interval I, a source node s and an end node e, allFP ...
Evangelos Kanoulas, Yang Du, Tian Xia, Donghui Zha...
LCN
2003
IEEE
13 years 9 months ago
Strategies for Finding Stable Paths in Mobile Wireless Ad Hoc Networks
In this paper, we introduce statistical methods to estimate the stability of paths in a mobile wireless ad hoc environment. Identifying stable paths helps to reduce control trafï¬...
Michael Gerharz, Christian de Waal, Peter Martini,...
ISCIS
2004
Springer
13 years 9 months ago
Finding Breach Paths Using the Watershed Segmentation Algorithm in Surveillance Wireless Sensor Networks
Considering wireless sensor networks for border surveillance, one of the major concerns is sensing coverage. Breach probability can be used as a measure to analyze the tradeoffs a...
Ertan Onur, Cem Ersoy, Hakan Deliç, Lale Ak...
ICANNGA
2007
Springer
133views Algorithms» more  ICANNGA 2007»
13 years 9 months ago
Finding the Optimal Path in 3D Spaces Using EDAs - The Wireless Sensor Networks Scenario
Abstract. In wireless sensor networks where sensors are geographically deployed in 3D spaces, a mobile robot is required to travel to each sensor in order to download the data. The...
Bo Yuan, Maria E. Orlowska, Shazia Wasim Sadiq