Virtual id routing

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.

Merging of DHT‐based logical networks in MANETs

“…The existing DHT-based routing protocols for MANETs [4][5][6][7][8][9][10][11][12][13][14][15][16] suffer from two major correlated issues, namely, the mismatch problem and the resilience of the LS structure. The mismatch problem occurs when a node's physical neighbours are not its logical neighbours, resulting in longer routes, high path-stretch ratio and increased traffic overhead [17].…”

“…The routing and merging overhead in DHT-based routing protocols strongly depend on the node addressing algorithm and arrangement of nodes in the LIS, that is, the shape of the LIS. The existing DHT-based protocols [4][5][6][7][8][9][10][11][12][13][14][15][16] have used different node addressing algorithms and LISs in order to assign LIDs to nodes and to arrange nodes according to their LIDs. However, none of the existing DHT-based protocols map the physical proximity of nodes exactly in the LIS.…”

“…All existing DHT-based proposals [4][5][6][7][8][9][10][11][12][13][14][15][16] use LISs that are constrained by their connecting order, which affects the smooth merging of two LNs. For instance, in a ring-based [4] and cord-based [6,7] LIS, a node can logically connect to a maximum two adjacent one-hop physical neighbours, that is, its successor and predecessor, and maintain a consecutive LID only with them.…”

“…DHT-based approaches were initially proposed to work at the application layer for peer-to-peer overlay over the Internet/mobile ad hoc network (MANET) [1][2][3]. Later, researchers have exploited the advantages of DHT by implementing it at the network layer for developing scalable routing protocols for MANETs [4][5][6][7][8][9][10][11][12][13][14][15][16]. We named such protocols as DHT-based routing for MANETs [17].…”

“…The nodes are inter-linked with each other based on their LIDs; that is, a logical network (LN) is built over the physical network. Several structures like cord [6,7], ring [4] and tree [5,[8][9][10][11][12][13][14][15][16] have been proposed to arrange nodes in the LN. The structure used for arranging nodes in the LN is referred to as LID structure (LIS).…”