提出了一种基于DSSS通信支持移动机器人群协同的无线移动组网方案;对DSSS宽带通信性能进行了理论分析;构建了DSSS通信仿真验证模型,并对QPSK-CCK,8PSK-PBCC等宽带通信性能进行了仿真验证,理论分析与仿真结果表明:文中提出的方案可使通...提出了一种基于DSSS通信支持移动机器人群协同的无线移动组网方案;对DSSS宽带通信性能进行了理论分析;构建了DSSS通信仿真验证模型,并对QPSK-CCK,8PSK-PBCC等宽带通信性能进行了仿真验证,理论分析与仿真结果表明:文中提出的方案可使通信数据传输率分别达到11,22 M b/s,能满足移动机器人群协同无线移动宽带组网的要求.展开更多
To meet the bandwidth requirement for the multicasting data flow in ad hoc networks, a distributed on- demand bandwidth-constrained multicast routing （BCMR） protocol for wireless ad hoc networks is proposed. With th...To meet the bandwidth requirement for the multicasting data flow in ad hoc networks, a distributed on- demand bandwidth-constrained multicast routing （BCMR） protocol for wireless ad hoc networks is proposed. With this protocol, the resource reservation table of each node will record the bandwidth requirements of data flows, which access itself, its neighbor nodes and hidden nodes, and every node calculates the remaining available bandwidth by deducting the bandwidth reserved in the resource reservation table from the total available bandwidth of the node. Moreover, the BCMR searches in a distributed manner for the paths with the shortest delay conditioned by the bandwidth constraint. Simulation results demonstrate the good performance of BCMR in terms of packet delivery reliability and the delay. BCMR can meet the requirements of real time communication and can be used in the multicast applications with low mobility in wireless ad hoc networks.展开更多
文摘提出了一种基于DSSS通信支持移动机器人群协同的无线移动组网方案;对DSSS宽带通信性能进行了理论分析;构建了DSSS通信仿真验证模型,并对QPSK-CCK,8PSK-PBCC等宽带通信性能进行了仿真验证,理论分析与仿真结果表明:文中提出的方案可使通信数据传输率分别达到11,22 M b/s,能满足移动机器人群协同无线移动宽带组网的要求.
基金The Natural Science Foundation of Zhejiang Province(No.Y1090232)
文摘To meet the bandwidth requirement for the multicasting data flow in ad hoc networks, a distributed on- demand bandwidth-constrained multicast routing （BCMR） protocol for wireless ad hoc networks is proposed. With this protocol, the resource reservation table of each node will record the bandwidth requirements of data flows, which access itself, its neighbor nodes and hidden nodes, and every node calculates the remaining available bandwidth by deducting the bandwidth reserved in the resource reservation table from the total available bandwidth of the node. Moreover, the BCMR searches in a distributed manner for the paths with the shortest delay conditioned by the bandwidth constraint. Simulation results demonstrate the good performance of BCMR in terms of packet delivery reliability and the delay. BCMR can meet the requirements of real time communication and can be used in the multicast applications with low mobility in wireless ad hoc networks.
