Real-time routing for mobile sensor/actor networks

Aravind R. Sama, K. Akkaya
{"title":"Real-time routing for mobile sensor/actor networks","authors":"Aravind R. Sama, K. Akkaya","doi":"10.1109/LCN.2008.4664287","DOIUrl":null,"url":null,"abstract":"With the increasing interest in the application of wireless ad hoc networks, the demand for providing QoS in such applications also grows. Particularly, in sensor and actor networks, providing certain delay bounds is crucial for the actors as they perform their actions based on the received data from sensors. The usefulness of the content from sensors is based on its timeliness. In this paper, we present Ad Hoc On Demand Delay Constrained Distance Vector Routing (AOD2V) which is an extension to the widely used routing protocol AODV for providing delay constrained data delivery in mobile sensor/actor networks. The admission control is based on Delay-EDD scheduling algorithm. The idea is to reserve the resources while routes are being determined in the route discovery phase of AODV. The reservation considers the service time at each node till the destination node. As long as the cumulative delay which is received at the destination is less than the desired delay bound, a positive acknowledgment is sent back to all the nodes on the path with AODVpsilas route reply packet and the connection request is admitted. Otherwise, the connection request is rejected and the reserved resources at the intermediate nodes are released. When the data transmission starts, Earliest Deadline First (EDF) scheduling algorithm is used to determine the departure order of the packets at the intermediate nodes. The performance of AOD2V is validated through extensive simulations and has been shown to outperform AODV in terms of delay and data delivery ratio without introducing any major extra overhead.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.2008.4664287","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

With the increasing interest in the application of wireless ad hoc networks, the demand for providing QoS in such applications also grows. Particularly, in sensor and actor networks, providing certain delay bounds is crucial for the actors as they perform their actions based on the received data from sensors. The usefulness of the content from sensors is based on its timeliness. In this paper, we present Ad Hoc On Demand Delay Constrained Distance Vector Routing (AOD2V) which is an extension to the widely used routing protocol AODV for providing delay constrained data delivery in mobile sensor/actor networks. The admission control is based on Delay-EDD scheduling algorithm. The idea is to reserve the resources while routes are being determined in the route discovery phase of AODV. The reservation considers the service time at each node till the destination node. As long as the cumulative delay which is received at the destination is less than the desired delay bound, a positive acknowledgment is sent back to all the nodes on the path with AODVpsilas route reply packet and the connection request is admitted. Otherwise, the connection request is rejected and the reserved resources at the intermediate nodes are released. When the data transmission starts, Earliest Deadline First (EDF) scheduling algorithm is used to determine the departure order of the packets at the intermediate nodes. The performance of AOD2V is validated through extensive simulations and has been shown to outperform AODV in terms of delay and data delivery ratio without introducing any major extra overhead.
移动传感器/行动者网络的实时路由
随着人们对无线自组织网络应用的兴趣日益增加,对在此类应用中提供QoS的需求也在增长。特别是,在传感器和参与者网络中,提供一定的延迟界限对于参与者来说是至关重要的,因为他们根据从传感器接收到的数据执行动作。来自传感器的内容的有用性是基于其及时性。在本文中,我们提出了Ad Hoc随需应变延迟约束距离矢量路由(AOD2V),它是广泛使用的路由协议AODV的扩展,用于在移动传感器/actor网络中提供延迟约束数据传输。接纳控制基于Delay-EDD调度算法。其思想是在AODV的路由发现阶段确定路由时保留资源。预约考虑在每个节点到目的节点的服务时间。只要目的地接收到的累计延迟小于期望的延迟界限,就会向路径上的所有节点发送一个带有AODVpsilas路由应答包的肯定确认,并接受连接请求。否则,拒绝连接请求,并释放中间节点上保留的资源。当数据开始传输时,采用EDF (early Deadline First)调度算法确定报文在中间节点的出发顺序。通过大量的仿真验证了AOD2V的性能,并且在不引入任何主要额外开销的情况下,在延迟和数据传输比率方面优于AODV。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信