Mesh网络p-cycle的快速配置方法

Abstract
Figure/Table
References
Related Citation (2)

Download: PDF (284 KB)
Export: BibTeX | EndNote (RIS)

Abstract A new fast distributed p-cycle pre-configuration searching algorithm is proposed in this paper. It can speed up the searching process convergence from two aspects. (1) The multi-p-cycle found by the algorithm within one searching wave should be completed configuration through multi searching waves in classical algorithm. This is the reason why this method faster than classical one. (2) Our algorithm has been changed over from the cycle-based searching to the path-based searching. Using this technique, searching information converged on one node in classical algorithm will be split to its multiple adjacent nodes so reduce the performance requirement of node equipment. The p-cycles searched by the distributed algorithm have been filtered within adjacent node hence the searching process be comes faster. The simulation result also shows that the penalty to spare capacity consumed is very small in our algorithm as well as the obvious benefit on the number of searching wave descent.

Key words： Mesh networks Pre-configuration cycle Score function

Received: 30 August 2002

PACS:

TN913.2

	Service

	E-mail this article
	Add to my bookshelf
	Add to citation manager
	E-mail Alert
	RSS
	Articles by authors



	Shi Bing
	Min Fan
	Zhou Ming-tian

Cite this article:

Shi Bing,Min Fan,Zhou Ming-tian. Pre-configuration-Cycle Fast Configuration Techniques in Mesh Network[J]. , 2004, 26(2): 291-297 .

URL:

http://jeit.ie.ac.cn/EN/ OR http://jeit.ie.ac.cn/EN/Y2004/V26/I2/291