Sciweavers

137 search results - page 22 / 28
» Optimising Node Coordinates for the Shortest Path Problem
Sort
View
INFOCOM
2007
IEEE
14 years 1 months ago
Landmark Selection and Greedy Landmark-Descent Routing for Sensor Networks
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...
An Nguyen, Nikola Milosavljevic, Qing Fang, Jie Ga...
CDC
2009
IEEE
210views Control Systems» more  CDC 2009»
13 years 5 months ago
On maximum lifetime routing in Wireless Sensor Networks
Abstract-- Lifetime maximization is an important optimization problem specific to Wireless Sensor Networks (WSNs) since they operate with limited energy resources which are therefo...
Xu Ning, Christos G. Cassandras
MOBICOM
2006
ACM
14 years 1 months ago
A coordinate-based approach for exploiting temporal-spatial diversity in wireless mesh networks
In this paper, we consider the problem of mitigating interference and improving network capacity in wireless mesh networks from the angle of temporal-spatial diversity. In a nutsh...
Hyuk Lim, Chaegwon Lim, Jennifer C. Hou
AINA
2004
IEEE
13 years 11 months ago
ZBP: A Zone-based Broadcasting Protocol for Wireless Sensor Networks
Abstract. Wireless Sensor Networks (WSNs) have been widely used in motoring and collecting interests of environment information. Packet flooding or broadcasting is an essential fun...
Chih-Yung Chang, Kuei-Ping Shih, Shih-Chieh Lee
COMCOM
2006
80views more  COMCOM 2006»
13 years 7 months ago
The prediction-based routing in optical transport networks
In optical networks, the traditional routing problem is generally decoupled into two subproblems, the route selection and the wavelength assignment. Usual RWA (Routing and Wavelen...
Eva Marín-Tordera, Xavier Masip-Bruin, Serg...