计算机科学 ›› 2013, Vol. 40 ›› Issue (1): 85-87.

• 网络与通信 • 上一篇    下一篇

基于时延敏感无线传感器网络的最优任播算法

顾云丽,钱焕延,徐 昕,杜 杰   

  1. (南京理工大学计算机科学与技术学院 南京210094);(南京信息工程大学江苏省网络监控中心 南京210044)
  • 出版日期:2018-11-16 发布日期:2018-11-16

Optimal Anycast Routing Algorithm for Delay-sensitive Wireless Sensor Networks

  • Online:2018-11-16 Published:2018-11-16

摘要: 任播技术应用在基于休眠唤醒机制的无线传感器网络(WSN)中可以改善其时延较长的问题,但以往技术是针对每一跳候选节点的休眠时延进行优化的,该策略在端对端时延上往往并不最优甚至有时效果很差。针对端对端时延问题提出基于时延敏感WSN的最优任播算法。协议中基站采用AODV多路径路由协议获取任播路径信息,采 用遗传算法进行最优化计算,并将所得各节点至任播组最优任播路径的信息返回给各节点。该算法具有自适应调节任播路径和全局优化的特点。实验数据表明,与以往算法相比,该算法可以更有效地降低端对端时延。

关键词: 无线传感器网络,任播,时延敏感,端对端时延,遗传算法

Abstract: In sleep-wakcup scheduling Wireless Sensor Networks ( WSN),anycast technique can significantly reduce time delay. However, previous research work only attends to optimizing the time delay during each hop, this scheme is not optimal even sometimes bad for end-to-end time delay. An optimal anycast routing algorithm for delay-sensitive WSN was proposed to solve the problem of end-to-end time delay. In the algorithm, base stations apply AODV-based multipath routing protocol to acctuire anycast routing information, then genetic algorithm is applied to search the optimal anycast paths between each nodes and bases stations, after that, base stations report the information to each nodes. Our algorithm has features of both global optimization and self-adaptivity of switching anycast paths. Experiment results show that our algorithm can reduce end-to-end time delay more efficiently in contrast to previous algorithms.

Key words: Wreless sensor networks, Anycast, Delay-sensitive, End-end delay, Genetic algorithm

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!