A Routing Algorithm to Guarantee End-to-End Delay for Sensor Networks
Li D(李栋); Liu Y(刘阳); Zeng P(曾鹏); Yu HB(于海斌)
2013
会议名称3rd International Conference on Computational Science, Engineering and Information Technology, CCSEIT 2013
会议日期June 7-9, 2013
会议地点Konya, Turkey
关键词Algorithms Routing algorithms Sensor networks
页码159-166
中文摘要In this paper, we state the phenomenon of Pay Bursts Only Once in communication networks and propose a routing algorithm to guarantee endto- end delay. Our idea is based on consider an end-to-end route as one concatenation system rather than the aggregation of several separate systems. We provide an algorithm to compute the delay bound under Pay Bursts Only Once phenomenon and compare it with other algorithms. The evaluation result show the algorithm is efficient in this case.
收录类别EI
产权排序1
会议主办者KTD; AIRCC Publishing Corporation; HAVELSAN; CSITC
会议录Advances in Intelligent Systems and Computing
会议录出版者Springer Verlag
会议录出版地Heidelberg, Germany
语种英语
ISSN号2194-5357
ISBN号978-3-319-00950-6
内容类型会议论文
源URL[http://ir.sia.cn/handle/173321/12420]  
专题沈阳自动化研究所_工业控制网络与系统研究室
推荐引用方式
GB/T 7714
Li D,Liu Y,Zeng P,et al. A Routing Algorithm to Guarantee End-to-End Delay for Sensor Networks[C]. 见:3rd International Conference on Computational Science, Engineering and Information Technology, CCSEIT 2013. Konya, Turkey. June 7-9, 2013.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace