581 search results - page 55 / 117 » Approximation algorithms for constructing wavelength routing... |
149
click to vote
IS
2011
14 years 8 months ago
2011
In order to process continuous queries over Wireless Sensor Networks (WSNs), sensors are typically organized in a Query Routing Tree (denoted as T) that provides each sensor with ...
228
click to vote
INFOCOM
2012
IEEE
13 years 3 months ago
2012
IEEE
—In this work we develop a distributed boundary detection algorithm, dubbed Coconut, for 3D wireless sensor networks. It first constructs a tetrahedral structure to delineate th...
112
click to vote
VTC
2006
IEEE
15 years 7 months ago
2006
IEEE
We study the problem of minimum energy cooperative path (MECP) routing in wireless networks. The joint problem of cooperative routing in wireless networks that combines route sele...
137
click to vote
HICSS
2008
IEEE
15 years 1 months ago
2008
IEEE
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...
105
click to vote
SOFSEM
2007
Springer
15 years 7 months ago
2007
Springer
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...