检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]东华大学信息学院,上海201620 [2]上海第二工业大学计算机与信息学院,上海201209
出 处:《计算机工程与设计》2011年第5期1554-1557,共4页Computer Engineering and Design
基 金:上海市教育委员会科研创新基金项目(10YZ201)
摘 要:为了大大减少网络维护路由信息的总量和提高路由的鲁棒性,提出了一个新的路由算法,应用全球定位系统(GPS)提供的数据作为启发式信息,利用蚁群优化技术,通过分析,根据每个节点所处的位置不同,令其使用不同的概率转发路由信息到下一跳节点,该算法选择多条路径记录在本地路由表中以提高其鲁棒性,同时采取修复机制创建新路径以提高数据包传输的成功率。仿真结果表明,该算法取得了较好的数据包传输成功率与较低的通信延迟。Many potential applications of MANETs involve the routing algorithm, a well designed routing algorithm can get higher usability and lower overhead used for finding a path. A new routing algorithm based on ant colony optimization for MANETs with global positioning system (GPS) and heuristic methods is proposed. By analysis, every node in different positions has different probabilities to forward the ant to the next hop, so as to greatly reduce the overhead of the packets used for maintaining the route information. Algorithm selects one or two of them recorded in its local routing table for its robustness reason. A mechanism is taken to repair the path so as to create an alternative path to promote the robustness of the routing algorithm. Simulation results show that our algorithm achieves good packet delivery ratio with low communication delay.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117

