2343 search results - page 198 / 469 » The Locomotive Routing Problem |
139
click to vote
INFOCOM
2005
IEEE
16 years 2 days ago
2005
IEEE
Abstract— In a peer-to-peer network, nodes are typically required to route packets for each other. This leads to a problem of “free-loaders,” nodes that use the network but r...
157
click to vote
INFOCOM
2005
IEEE
16 years 2 days ago
2005
IEEE
— In this paper we consider the problem of constructing a coordinate system in a sensor network where location information is not available. To this purpose we introduce the Virt...
172
click to vote
DIALM
1999
ACM
15 years 10 months ago
1999
ACM
We consider routing problems in ad hoc wireless networks modeled as unit graphs in which nodes are points in the plane and two nodes can communicate if the distance between them is...
175
click to vote
AINA
2006
IEEE
15 years 10 months ago
2006
IEEE
Ad hoc networks are dynamic networks formed "on the fly" by a set of nodes. Achieving secure routing in such networks is a big challenge. Asymmetric signature schemes pr...
167
click to vote
CDC
2008
IEEE
15 years 6 months ago
2008
IEEE
To enable services such as streaming multimedia and voice in multi-hop wireless networks it is necessary to develop algorithms that guarantee Quality of Service (QoS). In this pape...