1783 search results - page 57 / 357 » Low-Complexity Distributed Scheduling Algorithms for Wireles... |
132
click to vote
ICC
2011
IEEE
14 years 1 months ago
2011
IEEE
— Anypath routing, a new routing paradigm, has been proposed to improve the performance of wireless networks by exploiting the spatial diversity and broadcast nature of the wirel...
127
click to vote
MOBIHOC
2006
ACM
16 years 1 months ago
2006
ACM
This paper addresses the problem of optimizing the packet transmission schedule in an ad hoc network with end-toend delay constraints. The emphasis is to determine the proper rela...
118
click to vote
WCNC
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract—Recent advances in the technology of wireless electronic devices have made possible to build ad–hoc Wireless Sensor Networks (WSNs) using inexpensive nodes consisting ...
149
click to vote
TWC
2008
15 years 1 months ago
2008
A novel framework was introduced recently for stochastic routing in wireless multihop networks, whereby each node selects a neighbor to forward a packet according to a probability...
107
Voted
WOWMOM
2005
ACM
15 years 7 months ago
2005
ACM
We propose in this paper reliable and precise distributed localization algorithms for wireless networks: iterative multidimensional scaling (IT-MDS) and simulated annealing multid...