Tree based dynamic address autoconfiguration in mobile ad hoc networks
Tree based dynamic address autoconfiguration in mobile ad hoc networks
复制标题
DOI：
10.1016/j.comnet.2011.01.019
复制
发表时间：
2011-06
期刊：
影响因子：
--
通讯作者：
M. Al-Mistarihi;M. Al-Shurman;A. Qudaimat
中科院分区：
文献类型：
--
作者：
M. Al-Mistarihi;M. Al-Shurman;A. Qudaimat
提出了一种适用于移动的自组网的动态地址分配协议。该协议能够以低延迟和通信开销为网络节点分配地址。它根据网络节点所执行的功能将网络节点分为根节点、领导节点和普通节点。地址空间分布在不相交的地址块中的领导者之间。领导者负责将地址分配给未配置的节点。对于因节点突然离开网络而丢失的泄漏地址，采用有效的方法进行回收，以保持地址的完整性。该协议以较低的代价解决了网络划分和合并问题。该协议在时延和通信开销方面是有效的。它表明，该协议是适用于大型网络的节点数和大面积。该方案在竞争环境下工作良好，性能没有显着变化，也不会因浪费带宽而影响其他应用程序，它还克服了分组丢失的存在，主要是通过增加网络中的控制分组来保持地址分配协议的操作。
In this paper, a dynamic address allocation protocol for mobile ad hoc networks (MANETs) has been proposed. The protocol is capable of assigning an address to the network nodes with low latency and communication overhead. It divides the network nodes into root, leaders and normal nodes according to the functions they perform. Address space is distributed between leaders in disjoint address blocks. The leaders are responsible for assigning the addresses to unconfigured nodes. The leaked addresses, lost by the nodes that leaving the network abruptly, are reclaimed in an efficient way so as to preserve the addresses. Network partitioning and merging problem was solved in the protocol with low cost. The proposed protocol proves effective in terms of time delay and communication overhead. It is shown that the protocol is applicable for large networks with high number of nodes and large areas. The proposed scheme works well in the contention environment without significant changes in performance or effects on other applications by wasting the bandwidth, it also overcomes the presence of packet loss, mainly by increasing the control packet in the networks to keep the address allocation protocol operational.