Proximity neighbor selection for a DHT in wireless multi-hop networks

@article{Cramer2005ProximityNS,
  title={Proximity neighbor selection for a DHT in wireless multi-hop networks},
  author={Curt Cramer and Thomas Fuhrmann},
  journal={Fifth IEEE International Conference on Peer-to-Peer Computing (P2P'05)},
  year={2005},
  pages={3-10}
}
A mobile ad hoc network (MANET) is a multi-hop wireless network having no infrastructure. Thus, the mobile nodes have to perform basic control tasks, such as routing, and higher-level tasks, such as service discovery, in a cooperative and distributed way. Originally conceived as a peer-to-peer application for the Internet, distributed hash tables (DHTs) are data structures offering both, scalable routing and a convenient abstraction for the design of applications in large, dynamic networks… CONTINUE READING
Highly Cited
This paper has 30 citations. REVIEW CITATIONS
23 Citations
28 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 23 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 28 references

Similar Papers

Loading similar papers…