Sciweavers

306 search results - page 22 / 62
» Routing Algorithms for Anycast Messages
Sort
View
INFOCOM
2009
IEEE
15 years 6 months ago
Visibility-Graph-Based Shortest-Path Geographic Routing in Sensor Networks
— We study the problem of shortest-path geographic routing in a static sensor network. Existing algorithms often make routing decisions based on node information in local neighbo...
Guang Tan, Marin Bertier, Anne-Marie Kermarrec
COMCOM
2006
110views more  COMCOM 2006»
14 years 11 months ago
Localized routing with guaranteed delivery and a realistic physical layer in wireless sensor networks
Routing is the problem of sending a packet from a source node to a destination node in the network. Existing solutions for sensor networks assume a unit disk graph model, where me...
Milos Stojmenovic, Amiya Nayak
TIT
2010
82views Education» more  TIT 2010»
14 years 6 months ago
Average message delivery time for small-world networks in the continuum limit
Small-world networks are networks in which the graphical diameter of the network is as small as the diameter of random graphs but whose nodes are highly clustered when compared wit...
Hazer Inaltekin, Mung Chiang, H. Vincent Poor
PDP
2002
IEEE
15 years 4 months ago
Parallel Simulated Annealing for the Vehicle Routing Problem with Time Windows
A parallel simulated annealing algorithm to solve the vehicle routing problem with time windows is presented. The objective is to find the best possible solutions to some wellkno...
Zbigniew J. Czech, Piotr Czarnas
HICSS
2003
IEEE
92views Biometrics» more  HICSS 2003»
15 years 5 months ago
Distributed Energy-conserving Routing Protocols
This paper discusses several distributed poweraware routing protocols in wireless ad-hoc networks (especially sensor networks). We seek to optimize the lifetime of the network. We...
Qun Li, Javed A. Aslam, Daniela Rus