针对无线传感网络(wireless sensor networks,WSNs)的多对一通信,提出了路由和媒体接入协议(medium access control,MAC)的跨层设计与优化的数据传输算法,记为J-R-MAC(joint routing and medium access control),进而减少传输时延。J-R-...针对无线传感网络(wireless sensor networks,WSNs)的多对一通信,提出了路由和媒体接入协议(medium access control,MAC)的跨层设计与优化的数据传输算法,记为J-R-MAC(joint routing and medium access control),进而减少传输时延。J-R-MAC算法引用新的周期结构,此周期结构允许k个节点在同一个周期内安排数据包传输;并给节点提供k次机会传输数据包。同时,J-R-MAC算法将网络内所有节点划分k个不相交集;进而减少节点的空闲监听时间。此外,J-R-MAC引用特殊序列作为地址,减少控制包尺寸;进而降低能耗。仿真数据表明,与同类的协议相比,提出的J-R-MAC算法有效地降低了端到端传输时延;并提高了数据包传递率。展开更多
Differential evolution （DE） algorithm has attracted more and more attention due to its fast optimization performance and good stability. When DE algorithm is applied into multi-constrained multicast routing optimiza...Differential evolution （DE） algorithm has attracted more and more attention due to its fast optimization performance and good stability. When DE algorithm is applied into multi-constrained multicast routing optimization problem, a common solution to such problem is to merge the paths into a tree after finding paths from the source node to each destination node. This method maybe obtains the better result, but it can consume a lot of computational time. To solve the problem, a tree-based DE algorithm is introduced in this paper. The central operations of the algorithm are realized with tree structure. This method saves the time of finding paths and integrating them to construct a multicast tree. The experiments show that the proposed algorithm can achieve higher success rate than several common algorithms with much smaller running time for different networks.展开更多
文摘针对无线传感网络(wireless sensor networks,WSNs)的多对一通信,提出了路由和媒体接入协议(medium access control,MAC)的跨层设计与优化的数据传输算法,记为J-R-MAC(joint routing and medium access control),进而减少传输时延。J-R-MAC算法引用新的周期结构,此周期结构允许k个节点在同一个周期内安排数据包传输;并给节点提供k次机会传输数据包。同时,J-R-MAC算法将网络内所有节点划分k个不相交集;进而减少节点的空闲监听时间。此外,J-R-MAC引用特殊序列作为地址,减少控制包尺寸;进而降低能耗。仿真数据表明,与同类的协议相比,提出的J-R-MAC算法有效地降低了端到端传输时延;并提高了数据包传递率。
基金supported by the National Natural Science Foundation of China (60774088)the Hi-Tech Research and Development Program of China (2009AA04Z132)the Specialized Research Foundation for the Doctoral Program of National Education Ministry (20090031110029)
文摘Differential evolution （DE） algorithm has attracted more and more attention due to its fast optimization performance and good stability. When DE algorithm is applied into multi-constrained multicast routing optimization problem, a common solution to such problem is to merge the paths into a tree after finding paths from the source node to each destination node. This method maybe obtains the better result, but it can consume a lot of computational time. To solve the problem, a tree-based DE algorithm is introduced in this paper. The central operations of the algorithm are realized with tree structure. This method saves the time of finding paths and integrating them to construct a multicast tree. The experiments show that the proposed algorithm can achieve higher success rate than several common algorithms with much smaller running time for different networks.
