Minimizing Intermediate Multicast routing for dynamic multi-hop ad hoc networks |
| |
Authors: | Yu Quan Wu Kejun Luo Guoming Jin Yongxin |
| |
Affiliation: | 1. The 61st Research Institute of General Staff Headquarters,Beijing 100039,China 2. Institute of Communication Engineering,PLA University of Science and Technology,Nanjing 210007,China 3. Science and Technology Bureau of Jiangsu Province,Nanjing 210003,China |
| |
Abstract: | A Minimizing Intermediate Multicast Routing protocol (MIMR) is proposed for dynamic multi-hop ad hoc networks. In MIMR,multicast sessions are created and released only by source nodes. In each multicast session process,the source node keeps a list of intermediate nodes and destinations,which is encapsulated into the packet header when the source node sends a multicast packet. Nodes receiving multicast packets decide to accept or forward the packet according to the list. Depending on topology matrix maintained by unicast routing,the shortest virtual hierarchy routing tree is con-structed by improved Dijkstra algorithm. MIMR can achieve the minimum number of intermediate nodes,which are computed through the tree. No control packet is transmitted in the process of mul-ticast session. Load of the network is largely decreased. Experimental result shows that MIMR is flexible and robust for dynamic ad hoc networks. |
| |
Keywords: | Ad hoc networks Multicast routing Unicast routing Topology matrix |
本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录! |
| 点击此处可从《电子科学学刊(英文版)》浏览原始摘要信息 |
|
点击此处可从《电子科学学刊(英文版)》下载全文 |