占空比无线传感器网络中最优路由发现的研究进展

M. Kalmegh, S. R. Jain
{"title":"占空比无线传感器网络中最优路由发现的研究进展","authors":"M. Kalmegh, S. R. Jain","doi":"10.1109/STARTUP.2016.7583933","DOIUrl":null,"url":null,"abstract":"The WSN networks employing duty cycle technique in geographic routing has a task to find out the path from sensor to Base Station of the network to send the sensed data will be accomplished by several existing mechanism given over the last few decades. Discovering the optimized route in WSN depends upon the number of hops used to transfer the data packets. However, the nodes selected in the path may be overloaded due to heavy traffic. This can increase the delay in transmitting sensed data to the Base Station which will contribute in the overall delay of the network. Rediscovering routes can result in data loss and increasing communication overheads. In this paper, we present the comparison of different approaches in multi-path routing in terms of energy consumption and broadcasting delay in WSNs. We present and compare algorithms and techniques that aim to address the sleep/wake scheduling issue, which are divided into distributed and centralized manners. Meanwhile, the routing strategies, QoS parameters like average delay, packet loss ratio, and throughput are discussed.","PeriodicalId":355852,"journal":{"name":"2016 World Conference on Futuristic Trends in Research and Innovation for Social Welfare (Startup Conclave)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Optimal route discovery in duty cycled wireless sensor network: A review\",\"authors\":\"M. Kalmegh, S. R. Jain\",\"doi\":\"10.1109/STARTUP.2016.7583933\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The WSN networks employing duty cycle technique in geographic routing has a task to find out the path from sensor to Base Station of the network to send the sensed data will be accomplished by several existing mechanism given over the last few decades. Discovering the optimized route in WSN depends upon the number of hops used to transfer the data packets. However, the nodes selected in the path may be overloaded due to heavy traffic. This can increase the delay in transmitting sensed data to the Base Station which will contribute in the overall delay of the network. Rediscovering routes can result in data loss and increasing communication overheads. In this paper, we present the comparison of different approaches in multi-path routing in terms of energy consumption and broadcasting delay in WSNs. We present and compare algorithms and techniques that aim to address the sleep/wake scheduling issue, which are divided into distributed and centralized manners. Meanwhile, the routing strategies, QoS parameters like average delay, packet loss ratio, and throughput are discussed.\",\"PeriodicalId\":355852,\"journal\":{\"name\":\"2016 World Conference on Futuristic Trends in Research and Innovation for Social Welfare (Startup Conclave)\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 World Conference on Futuristic Trends in Research and Innovation for Social Welfare (Startup Conclave)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/STARTUP.2016.7583933\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 World Conference on Futuristic Trends in Research and Innovation for Social Welfare (Startup Conclave)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/STARTUP.2016.7583933","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在地理路由中采用占空比技术的WSN网络有一个任务,即找到从传感器到网络基站的路径来发送感知数据,这将由过去几十年给出的几种现有机制来完成。在WSN中发现经过优化的路由取决于数据包传输的跳数。但是,由于流量过大,路径上选择的节点可能会过载。这会增加向基站传输感测数据的延迟,从而导致网络的整体延迟。重新发现路由可能导致数据丢失并增加通信开销。在本文中,我们从能量消耗和无线传感器网络广播延迟的角度比较了不同的多路径路由方法。我们提出并比较了旨在解决睡眠/唤醒调度问题的算法和技术,这些算法和技术分为分布式和集中式方式。同时对路由策略、平均时延、丢包率、吞吐量等QoS参数进行了讨论。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimal route discovery in duty cycled wireless sensor network: A review
The WSN networks employing duty cycle technique in geographic routing has a task to find out the path from sensor to Base Station of the network to send the sensed data will be accomplished by several existing mechanism given over the last few decades. Discovering the optimized route in WSN depends upon the number of hops used to transfer the data packets. However, the nodes selected in the path may be overloaded due to heavy traffic. This can increase the delay in transmitting sensed data to the Base Station which will contribute in the overall delay of the network. Rediscovering routes can result in data loss and increasing communication overheads. In this paper, we present the comparison of different approaches in multi-path routing in terms of energy consumption and broadcasting delay in WSNs. We present and compare algorithms and techniques that aim to address the sleep/wake scheduling issue, which are divided into distributed and centralized manners. Meanwhile, the routing strategies, QoS parameters like average delay, packet loss ratio, and throughput are discussed.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信