Opportunistic routing schemes that exploit the broadcast nature of wireless transmissions for selecting the best next-hop at that instant among a set of candidates are being actively explored [1-3]. These schemes which we refer to as opportunistic any-path forwarding (OAPF), reduce the number of transmissions needed for reliable packet delivery.

No abstract

Current flat-id based routing schemes promise support for mobility and scalability. However, providing efficient routing with minimal overheads for mobility is still a challenge. In this paper we provide a solution to these problems by introducing Virtual Id Routing (VIR). VIR meets these basic requirements of future id-based routing schemes: namely, i) scalability-by using distributed hash table based routing framework; ii) mobility support-by separating the nodeidentifier from the network location; and iii) routing efficiency-by exploiting network topology information, which is done by introducing a dynamic, self-organizing virtual id (vid ) space layer in between the node id space (uid ) and the network topology. Preliminary evaluation of the protocol shows promising results, specifically routing stretch for VIR is very close to 1, and the overheads due to mobility are also much smaller than existing schemes such as VRR.

Abstract-The recent advances of distributed hash tables (DHTs) facilitate the development of highly scalable and robust network applications and services. However, with applications and services each employing their own DHTs that perform essentially the same tasks, an open infrastructure providing the core DHT functionalities for these applications and services would represent a cost-effective solution. In this paper we present a generic secure framework for deploying secure overlay-based applications/services. We combine DHTs and identity-based encryption (IBE) to develop a novel architecture that is scalable and robust against man-in-the-middle attacks. We also develop an innovative mechanism called "Wheel of Trust" that secures our framework against insider attacks. Based on the proposed architecture, we present some preliminary evaluation results from a prototype implementation.