Abstract: Aiming at the problems in IP allocation in MANET, this paper brings up the buddy-chain system which takes the advantage of binary tree with a weighted approach to gracefully overcome the difficulties in IP recirculation and uneven IP allocation of MANET. It proves the evenness by analyzing the relationship between a single node and its neighbors while studying the robustness through a statistical model for the number of on-line nodes in unit time. It evaluates the communication cost and the outcome is O(21/n)~O(lb(n)?21/n).

Key words: MANET IP allocation, buddy chain, efficiency, security

摘要： 针对MANET IP分配问题，提出一种基于伙伴链的IP分配算法。采用二叉树及加权的方法解决IP分配算法中IP回收困难和IP分配不均匀的问题，在此基础上分析单个结点与其邻居的关系以验证其平衡性。通过建立单位时间内在线结点个数的统计模型分析该IP分配机制的健壮性和稳定性，并对其通信开销进行评估，得出O(21/n)~O(lb/n?21/n)的结论。

关键词: MANET IP分配, 伙伴链, 效率, 安全

CLC Number: 

• TP393