A two-dimensional structured overlay based on flexible routing tables

A two-dimensional structured overlay based on flexible routing tables
复制标题

基于灵活路由表的二维结构化覆盖

DOI:
10.1109/iscc.2015.7405530
复制
发表时间:
2015
期刊:
2015 IEEE Symposium on Computers and Communication (ISCC)
影响因子:
--
通讯作者:
Kazuyuki Shudo
Kazuyuki Shudo
中科院分区:
--
文献类型:
--
作者:
Masashi Hojo;Hiroya Nagao;T. Miyao;Kazuyuki Shudo

文献摘要

被引文献

相似文献

覆盖网络使大量的传感器节点能够有效地执行数据收集和消息传递。地理路由对于传感器网络等应用是必要的,它要求覆盖网络能够反映节点的位置。此外,节点的位置通常是有偏的,覆盖上的路径长度应该很短,换句话说,转发消息的节点应该很少。本文提出了一种新的覆盖布线算法,在满足上述要求的二维空间上进行地理布线。该算法是基于灵活路由表(FRT)设计的,因此提供了独特而理想的特性。其派生的特点是动态的路由表大小和高度的可扩展性。该算法采用P2P Delaunay网络作为其拓扑结构,根据估计的跳数形成最短路径链接。
An overlay network enables a large number of sensor nodes to perform effectively data collection and message delivery. Geographical routing is necessary for applications such as sensor network and it requires the overlay network to reflect nodes' locations. In addition, nodes' locations are generally biased and path lengths on the overlay should be short, in other words, the number of nodes relaying a message should be small. This paper describes a new overlay routing algorithm to perform geographical routing on a two-dimensional space satisfying the above requirements. The proposed algorithms provides unique and desirable features derived from Flexible Routing Tables (FRT), that is a design framework for structured overlays, because the algorithm is designed based on FRT. The derived features are dynamic routing table size and high extensibility. The proposed algorithm adopts P2P Delaunay Network as its topology and forms shortcut links based on estimated number of hops.