A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit <a rel="external noopener" href="http://www.comm.utoronto.ca:80/~liang/publications/ToWC06.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
Hybrid routing in ad hoc networks with a dynamic virtual backbone
<span title="">2006</span>
<i title="Institute of Electrical and Electronics Engineers (IEEE)">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ra4txhbrwnbwzk3lwinyjovpbe" style="color: black;">IEEE Transactions on Wireless Communications</a>
</i>
Preserved Fulltext
Virtual Backbone Routing (VBR) is a scalable hybrid routing framework for ad hoc networks, which combines local proactive and global reactive routing components over a variable-sized zone hierarchy. The zone hierarchy is maintained through a novel distributed virtual backbone maintenance scheme, termed the Distributed Database Coverage Heuristic (DDCH), also presented in this paper. Borrowing from the design philosophy of the Zone Routing Protocol, VBR limits the proactive link information
<span class="external-identifiers">
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/twc.2006.1638660">doi:10.1109/twc.2006.1638660</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wnnuvnxp2ndgvbgvrprlwqruou">fatcat:wnnuvnxp2ndgvbgvrprlwqruou</a>
</span>
more »
... nge to the local routing zones only. Furthermore, the reactive component of VBR restricts the route queries to within the virtual backbone only, thus improving the overall routing efficiency. Our numerical results suggest that the cost of the hybrid VBR scheme can be a small fraction of that of either one of the purely proactive or purely reactive protocols, with or without route caching. Since the data routes do not necessarily pass through the virtual backbone nodes, traffic congestion is considerably reduced. Yet, the average length of the VBR routes tends to be close to optimal. Compared with the traditional one-hop hierarchical protocols, our results indicate that, for a network of moderate to large size, VBR with an optimal zone radius larger than one can significantly reduce the routing traffic. Furthermore, we demonstrate VBR's improved scalability through analysis and simulations.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20060722064552/http://www.comm.utoronto.ca:80/~liang/publications/ToWC06.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/4a/bf/4abf2f0e1e62474916cf1acc592de0d5ef4f59a5.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/twc.2006.1638660">
<button class="ui left aligned compact blue labeled icon button serp-button">
<i class="external alternate icon"></i>
ieee.com
</button>
</a>