Most research activities in the field of peer-to-peer (P2P) computing are concemed with routing in virtuaiized overlay networks. These overlays generally assume node connectiviq to be provided by an underlying network-layer routing profacol. This duplication offunctionality can give rise to severe ineficiencies. In contrast, we suggest a cross- layer approach where the P2P overlay network also pm- vides Ihe required network-layer routing fiinctionolity by itse$ Especially in sensor networks, where special atten- tion has to be paid to rhe nodes' limited capabilities, this can greatly help in reducing the message overhead. In drispapel; wepresent a key building block for such a protocol, rhe Iterative Successor Pointer Rewiring Protocol (ISPRP), which eficiently initializes a P2P rouririg network among a freshly deployed set of nodes having but link-layer connectivity. lSPRP works in a fdy selforgatzizing way and issues oiily a srnall per-node ainounf of messages by keeping interactions between nodes as local as possible.
[1]
Antony I. T. Rowstron,et al.
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
,
2001,
Middleware.
[2]
Bryan Ford,et al.
Unmanaged Internet Protocol
,
2004,
Comput. Commun. Rev..
[3]
Robert Morris,et al.
Chord: A scalable peer-to-peer lookup service for internet applications
,
2001,
SIGCOMM 2001.
[4]
Himabindu Pucha,et al.
Ekta: an efficient DHT substrate for distributed applications in mobile ad hoc networks
,
2004,
Sixth IEEE Workshop on Mobile Computing Systems and Applications.