摘要
介绍了一种移动节点(Mobile Nodes简称MNs)动态加入和离开组播组(Multicast Group简称MG)的结构,该结构是基于hash算法提出的。同时阐述了移动IPv6(Mobile IPv6简称MIPv6)网络中由MNs构成的动态传递树的构造过程。这种动态传递树的树枝表示数据包从源地址到目的地址的最短路经。必要的时候,这些树枝可以增加或删除。每个MNs都分配了一个组播地址,通讯对端(Correspondent Nodes简称CNs)发送数据包到MG。当MNs移动到一个新位置时,该MNs在新位置上必须加入MG才能接收数据包。通过建立模型可以检测一下这种新结构的功能。仿真结果显示了MNs加入和离开MG的动态性直接影响了切换时间和转换的平滑性。
A new mulficast group join/leave mechanism for mobile nodes （MNs）is proposed. The mechanism is based on hash algorithm. This paper explains the construction of a dynamic delivery tree of the mobile node movement for a multicast - based mobile IPv6 network, such that the branches of the tree constitute the shortest paths from the packet source to each of the visited locations. The branches of the tree grow and shrink to reach the mobile node when necessary. The mobile node is assigned a mulficast address and the correspondent nodes （CNs）send packets to the mulficast group. As the mobile node moves to a new location, it must join the mulficast group and then could receive packet from packet source. The performance of the proposed mechanism was evaluated through a simulation model built for this purpose. Simulation results show that the dynamics of joining and leaving the group directly affect handoff latency and smoothness.
出处
《舰船电子工程》
2006年第1期83-86,共4页
Ship Electronic Engineering
关键词
移动节点
HASH算法
组播组
mobile nodes , hash algorithm, multicast group
