Journal of South China University of Technology(Natural Science Edition) ›› 2012, Vol. 40 ›› Issue (4): 30-36.

• Computer Science & Technology • Previous Articles     Next Articles

Routing Algorithm for Wireless Sensor Networks Based on Borel Metacyclic Topology

Li lan1,2  Xiao Wen-jun3  Wei Wen-hong4   

  1. 1．School of Computer Science and Engineering,South China University of Technology,Guangzhou 510006,Guangdong,China; 2．School of Software Engineering,Nanchang University,Nanchang 330029,Jiangxi,China; 3．School of Software,South China University of Technology,Guangzhou 510006,Guangdong,China; 4．School of Computer Science,Dongguan University of Technology,Dongguan 523808,Guangdong,China
  • Received:2011-09-16 Revised:2012-02-17 Online:2012-04-25 Published:2012-03-01
  • Contact: 李岚(1978-) ，女，博士生，副教授，主要从事无线传感器网络、并行与分布式计算、代数图论研究． E-mail:l.lan03@mail.scut.edu.cn
  • About author:李岚(1978-) ，女，博士生，副教授，主要从事无线传感器网络、并行与分布式计算、代数图论研究．
  • Supported by:

    国家自然科学基金资助项目( 60973150，61170313，61103037 ) ; 江西省自然科学基金资助项目( 2011ZBAB211003) ; 中国博士后科学基金资助项目( 20110490883)

PDF

735

Abstract:

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 results 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.

Key words: wireless sensor networks, routing algorithm, Borel matrix group, Borel metacyclic graph, routing query length, routing table size, end-to-end delay, clustering coefficient

CLC Number: