2279 search results - page 151 / 456 » Distributed Spectrum-Efficient Routing Algorithms in Wireles... |
228
Voted
ICDCN
2011
Springer
14 years 7 months ago
2011
Springer
This paper considers the problem of calculating dominating sets in networks with bounded degree. In these networks, the maximal degree of any node is bounded by Δ, which is usuall...
143
Voted
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract—We revisit the shortest path problem in asynchronous duty-cycled wireless sensor networks, which exhibit time-dependent features. We model the time-varying link cost and...
139
Voted
ICCNMC
2005
Springer
15 years 9 months ago
2005
Springer
Routing packets along a specified curve is a new approach to forwarding packets in large-scale dense sensor networks. Forwarding packets along trajectories can be very effective in...
153
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
The design of sensor networks capable of reaching a consensus on a globally optimal decision test, without the need for a fusion center, is a problem that has received considerable...
147
click to vote
ADHOCNETS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Wireless sensor networks are vulnerable to the node clone attack because of low-cost, resource-constrained sensor nodes, and uncontrolled environments where they are left...