Sciweavers

552 search results - page 25 / 111
» Routing complexity of faulty networks
Sort
View
INFOCOM
2007
IEEE
14 years 3 months ago
Low-Complexity and Distributed Energy Minimization in Multi-Hop Wireless Networks
— In this work, we study the problem of minimizing the total power consumption in a multi-hop wireless network subject to a given offered load. It is well-known that the total po...
Longbi Lin, Xiaojun Lin, Ness B. Shroff
LATIN
2010
Springer
13 years 7 months ago
Packet Routing on the Grid
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
Britta Peis, Martin Skutella, Andreas Wiese
WSC
2008
13 years 11 months ago
Simulation-based optimization of a complex mail transportation network
The Swedish Postal Services receives and distributes over 22 million pieces of mail every day. Mail transportation takes place overnight by airplanes, trains, trucks, and cars in ...
Anna Syberfeldt, Henrik Grimm, Amos Ng, Martin And...
ADHOCNOW
2008
Springer
14 years 3 months ago
Geographic Routing with Early Obstacles Detection and Avoidance in Dense Wireless Sensor Networks
Existing geographic routing algorithms for sensor networks are mainly concerned with finding a path toward a destination, without explicitly addressing the impact of obstacles on ...
Luminita Moraru, Pierre Leone, Sotiris E. Nikolets...
INFOCOM
2009
IEEE
14 years 3 months ago
VirtualFace: An Algorithm to Guarantee Packet Delivery of Virtual-Coordinate-Based Routing Protocols in Wireless Sensor Networks
Abstract—Because the global positioning system (GPS) consumes a large amount of power and does not work indoors, many virtual-coordinate-based routing protocols are proposed for ...
Ming-Jer Tsai, Fang-Ru Wang, Hong-Yen Yang, Yuan-P...