Virtual backbone content routing in wireless ad-hoc network

We developed a new content routing based on the virtual backbone structure, which groups wireless nodes and contents into a virtual architecture. Our approach is scalable, works with local information, and does not rely on address information. The naming system uses flat naming to identify nodes and contents, and organizes these identifiers together. Backbone nodes can be selected automatically or predefined to direct their associated normal nodes in a local area. The normal nodes are guided by the backbone nodes to full fill the searching and routing processes. With a virtual structure, the searching performance can be improved by using the DHT technique.

Experiments using ns2 simulator demonstrate that this virtual backbone routing architecture has the following significances: workable without being aware address in a mobile situation; scalable with the size of network; efficient in terms of the reduced hop counts and short end-to-end delay, and also resistant to the dead-end problem.