16 search results - page 3 / 4 » Greedy Face Routing with Face ID Support in Wireless Network... |
ALGOSENSORS
2004
Springer
14 years 1 months ago
2004
Springer
We conjecture that any planar 3-connected graph can be embedded in the plane in such a way that for any nodes s and t, there is a path from s to t such that the Euclidean distance ...
KIVS
2011
Springer
12 years 10 months ago
2011
Springer
Localized geographic single path routing along a wireless network graph requires exact location information about the network nodes to assure message delivery guarantees. Node loc...
INFOCOM
2000
IEEE
13 years 12 months ago
2000
IEEE
Abstract—In this paper we investigate the performance of multicast routing protocols in wireless mobile ad hoc networks. An ad hoc network is composed of mobile nodes without the...
PODC
2003
ACM
14 years 25 days ago
2003
ACM
All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of ad-hoc rout...
MOBIHOC
2007
ACM
14 years 7 months ago
2007
ACM
Disruption-Tolerant Networks (DTNs) deliver data in network environments composed of intermittently connected nodes. Just as in traditional networks, malicious nodes within a DTN ...