4037 search results - page 305 / 808 » Routing without ordering |
129
click to vote
DMGT
2011
14 years 6 months ago
2011
The Traveling Salesman Problem (TSP) is still one of the most researched topics in computational mathematics, and we introduce a variant of it, namely the study of the closed k-wa...
152
click to vote
INFOCOM
2011
IEEE
14 years 6 months ago
2011
IEEE
—In a sensor network, an important problem is to provide privacy to the event detecting sensor node and integrity to the data gathered by the node. Compromised source privacy can...
126
click to vote
PPNA
2011
14 years 6 months ago
2011
Several protocol efficiency metrics (e.g., scalability, search success rate, routing reachability and stability) depend on the capability of preserving structure even over the ch...
156
click to vote
TMC
2012
13 years 5 months ago
2012
—We present the boomerang protocol to efficiently retain information at a particular geographic location in a sparse network of highly mobile nodes without using infrastructure ...
143
click to vote
DIALM
2003
ACM
15 years 8 months ago
2003
ACM
This paper addresses the problem of scatternet formation for singlehop Bluetooth based ad hoc networks, with minimal communication overhead. We adopt the well-known structure de B...