A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
BYPASS: Topology-Aware Lookup Overlay for DHT-based P2P File Locating Services
ICPADS '04 Proceedings of the Parallel and Distributed Systems, Tenth International Conference
PChord: Improvement on Chord to Achieve Better Routing Efficiency by Exploiting Proximity
ICDCSW '05 Proceedings of the First International Workshop on Mobility in Peer-to-Peer Systems - Volume 08
Solving Overlay Mismatching of Unstructured P2P Networks using Physical Locality Information
P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
SKG '05 Proceedings of the First International Conference on Semantics, Knowledge and Grid
Peer-to-peer based multimedia distribution service
IEEE Transactions on Multimedia
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
On the fundamental performance limits of peer-to-peer data replication in wireless ad hoc networks
IEEE Journal on Selected Areas in Communications
Assisted Peer-to-Peer Search with Partial Indexing
IEEE Transactions on Parallel and Distributed Systems
Hi-index | 0.00 |
In order to match logical topology to physical topology in P2P wireless network, a new protocol based on Chord is proposed, in which a node can get a optimal node identifier(ID) to realize topology awareness by exploiting nodes' relative location information, which is reflected on the energy strength of received signal and the distribution density of P2P member. Simulation results show that the wireless P2P network in the proposed method can avoid route being accessed iteratively. Therefore, it can effectively shorten the time to locate desired file and reduce Packet Loss Rate as well.