基于Borel亚循环拓扑的无线传感器网络路由算法

Routing Algorithm for Wireless Sensor Networks Based on Borel Metacyclic Topology

利用Borel矩阵群以及群论中的半直积方法构建了一个对称性强、直径小、聚集系数高的5正则Borel亚循环图,将无线传感器网络结点嵌入到该亚循环图中,提出了一种确定性的以数据为中心的数据存储及路由算法,并将所设计的拓扑结构与现有的基于Chord的CSN(Chord for Sensor Networks)以及VRR(Virtual Ring Routing)进行了对比.结果表明,与现有的一些算法相比,所设计的拓扑结构在平均查询长度、路由表大小、平均端到端时延以及能量耗散等方面都有一定优势,有利于延长传感器网络结点的寿命.

In this paper, a novel five-regular Borel metacyclic graph with symmetric structure, small diameter and high clustering coefficient is created by using the Borel matrix group and the semi-direct product method in the group theory. Then, by embedding wireless sensor nodes in this metacyclic graph, a structured data-centric storage and routing algorithm is designed, which is further compared with the CSN based on Chord and the VRR. The re- suits show that the proposed algorithm is superior to some existing algorithms in terms of routing query length, routing table size, end-to-end delay and energy dissipation, which benefits the prolonging of the life of sensor network nodes.