高度数据中心无线传感器网络的最短路径路由协议(SPRP)

N. Doohan, D. Mishra, S. Tokekar
{"title":"高度数据中心无线传感器网络的最短路径路由协议(SPRP)","authors":"N. Doohan, D. Mishra, S. Tokekar","doi":"10.1109/AHICI.2011.6113925","DOIUrl":null,"url":null,"abstract":"Wireless Sensor Networks (WSNs) are composed of many sensors which are densely or sparsely deployed to get the necessary information. They are constraint on resources such as energy, memory, computational speed and communications bandwidth. Particularly power is another major issue in WSNs, therefore main stress has been given to minimize the number of transmission to extend sensor service time in the network and support to discover multiple paths and multiple events simultaneously in any direction. Here we are proposing a new approach “Shortest Path Routing Protocol for Highly Data Centric Wireless Sensor Networks (SPRP)” which is based on the best part of protocols used for wired network i.e. TCP/IP. SPRP a new routing mechanism for wireless environment has been designed and proposed which is inspired from various routing like RIP, OSPF and a shortest path using Dijkstra's algorithm. Possible unforeseen scenarios in Wireless Sensor Networks domain like energy level status, damage of some node accidently/intensely has been considered and bypass to such occurrence has been integrated in the proposed solution.","PeriodicalId":371011,"journal":{"name":"2011 Second Asian Himalayas International Conference on Internet (AH-ICI)","volume":"343 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Shortest Path Routing Protocol (SPRP) for Highly Data Centric Wireless Sensor Networks\",\"authors\":\"N. Doohan, D. Mishra, S. Tokekar\",\"doi\":\"10.1109/AHICI.2011.6113925\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Wireless Sensor Networks (WSNs) are composed of many sensors which are densely or sparsely deployed to get the necessary information. They are constraint on resources such as energy, memory, computational speed and communications bandwidth. Particularly power is another major issue in WSNs, therefore main stress has been given to minimize the number of transmission to extend sensor service time in the network and support to discover multiple paths and multiple events simultaneously in any direction. Here we are proposing a new approach “Shortest Path Routing Protocol for Highly Data Centric Wireless Sensor Networks (SPRP)” which is based on the best part of protocols used for wired network i.e. TCP/IP. SPRP a new routing mechanism for wireless environment has been designed and proposed which is inspired from various routing like RIP, OSPF and a shortest path using Dijkstra's algorithm. Possible unforeseen scenarios in Wireless Sensor Networks domain like energy level status, damage of some node accidently/intensely has been considered and bypass to such occurrence has been integrated in the proposed solution.\",\"PeriodicalId\":371011,\"journal\":{\"name\":\"2011 Second Asian Himalayas International Conference on Internet (AH-ICI)\",\"volume\":\"343 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-12-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 Second Asian Himalayas International Conference on Internet (AH-ICI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AHICI.2011.6113925\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Second Asian Himalayas International Conference on Internet (AH-ICI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AHICI.2011.6113925","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

摘要

无线传感器网络(WSNs)由许多传感器组成,这些传感器密集或稀疏地部署以获取必要的信息。它们受到能源、内存、计算速度和通信带宽等资源的限制。特别是功率是无线传感器网络的另一个主要问题,因此主要的重点是最小化传输次数以延长传感器在网络中的服务时间,并支持在任何方向上同时发现多条路径和多个事件。在这里,我们提出了一种新的方法“高度数据中心无线传感器网络的最短路径路由协议(SPRP)”,它基于有线网络中使用的协议的最佳部分,即TCP/IP。SPRP是一种新的无线环境下的路由机制,它的灵感来源于RIP、OSPF和Dijkstra算法的最短路径。考虑了无线传感器网络领域中可能出现的不可预见的情况,如能量水平状态、节点意外/剧烈损坏等,并在该方案中集成了对此类情况的绕过。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Shortest Path Routing Protocol (SPRP) for Highly Data Centric Wireless Sensor Networks
Wireless Sensor Networks (WSNs) are composed of many sensors which are densely or sparsely deployed to get the necessary information. They are constraint on resources such as energy, memory, computational speed and communications bandwidth. Particularly power is another major issue in WSNs, therefore main stress has been given to minimize the number of transmission to extend sensor service time in the network and support to discover multiple paths and multiple events simultaneously in any direction. Here we are proposing a new approach “Shortest Path Routing Protocol for Highly Data Centric Wireless Sensor Networks (SPRP)” which is based on the best part of protocols used for wired network i.e. TCP/IP. SPRP a new routing mechanism for wireless environment has been designed and proposed which is inspired from various routing like RIP, OSPF and a shortest path using Dijkstra's algorithm. Possible unforeseen scenarios in Wireless Sensor Networks domain like energy level status, damage of some node accidently/intensely has been considered and bypass to such occurrence has been integrated in the proposed solution.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信