Journal of Frontiers of Computer Science and Technology ›› 2018, Vol. 12 ›› Issue (5): 769-776.DOI: 10.3778/j.issn.1673-9418.1704026

Previous Articles     Next Articles

Hierarchical Auxiliary-Information Acquisition Mechanism in Opportunistic Routing Algorithms

SONG Mingyang, YUAN Peiyan+   

  1. School of Computer and Information Engineering, Henan Normal University, Xinxiang, Henan 453000, China
  • Online:2018-05-01 Published:2018-05-07



  1. 河南师范大学 计算机与信息工程学院,河南 新乡 453000

Abstract: Opportunistic routing protocols utilize the auxiliary-information to make routing decisions, however, the acquisition process of the auxiliary-information among nodes is in an epidemic fashion, which consumes more network resources. Motivated by this problem, this paper proposes a hierarchical auxiliary-information acquisition mechanism to efficiently reduce the information exchange times among nodes. Firstly, nodes which are neighbors exchange information, so as to have a faster update. Secondly, in order to have a higher network coverage rate of auxiliary-information, the nodes are divided into the social nodes and ordinary nodes, and the acquisition of auxiliary-information mainly occurs between the two types of nodes to assure the higher network coverage rate. Selectively sharing information can significantly reduce the information acquisition times between nodes. The experimental     results demonstrate that the exchange times of auxiliary-information acquisition has reduced by about 80%, significantly improving the routing protocol performance.

Key words:  opportunistic network, routing protocols, auxiliary-information, social property

摘要: 信息辅助型路由是一种依赖额外信息协助节点高效地转发数据包的机会路由机制。然而目前的信息辅助型路由算法中节点间辅助信息的获取以一种洪泛的方式进行,造成了网络资源浪费。针对此问题,提出了一种层次化的辅助信息获取机制。一方面,互为邻居的节点之间进行信息获取,保证信息更新速度较快。另一方面,将节点分为社会性节点和普通节点,使信息的获取主要发生在社会性节点与普通节点之间,以保证信息的网络覆盖率较高。通过有选择性地共享信息可以显著地减少节点间信息获取次数。实验结果表明,在不显著影响路由算法基本性能指标的前提下,该机制可以减少大约80%的辅助信息获取次数。

关键词: 机会网络, 路由协议, 辅助信息, 社会性