智能传感器网络柔性机动性的优化算法

S. Rajaraajeswari, R. Selvarani, P. Raj
{"title":"智能传感器网络柔性机动性的优化算法","authors":"S. Rajaraajeswari, R. Selvarani, P. Raj","doi":"10.1109/ICCCI.2014.6921763","DOIUrl":null,"url":null,"abstract":"Sensors and actuators are being extensively used these days across industry verticals for a variety of reasons. With a number of delectable advancements in network topologies and communication technologies, novel types of sensors networks are being formed according to the business requirements. Smart sensors are capable of crafting ad hoc networks for accomplishing specified tasks. The direct fallout of these improvisations is the possibility and sustainability of smarter environments. For examples, nowadays there are a lot of happenings around the concepts of smarter homes, offices, cities, governments, healthcare etc. Smarter services are being realized with the help of smarter sensors and their networks. However one of the impending challenges is the network path optimization. There are several methods and mechanisms in place for optimizing network path identification. However, with the emergence of smarter environments, the current approaches need to improve significantly. In this paper, we have taken up the tried, tested and trusted Dijkstra algorithm and come out with a much-improved algorithm for realizing the much-anticipated flexibility and maneuverability in network path identification and optimization. This newly crafted algorithm goes a long way in conceptualizing and concretizing a variety of newer applications while ensuring the principal non-functional requirements such as energy efficiency, extensibility, etc.","PeriodicalId":244242,"journal":{"name":"2014 International Conference on Computer Communication and Informatics","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An optimal algorithm for the flexible maneuverability in smart sensor networks (SSNs)\",\"authors\":\"S. Rajaraajeswari, R. Selvarani, P. Raj\",\"doi\":\"10.1109/ICCCI.2014.6921763\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Sensors and actuators are being extensively used these days across industry verticals for a variety of reasons. With a number of delectable advancements in network topologies and communication technologies, novel types of sensors networks are being formed according to the business requirements. Smart sensors are capable of crafting ad hoc networks for accomplishing specified tasks. The direct fallout of these improvisations is the possibility and sustainability of smarter environments. For examples, nowadays there are a lot of happenings around the concepts of smarter homes, offices, cities, governments, healthcare etc. Smarter services are being realized with the help of smarter sensors and their networks. However one of the impending challenges is the network path optimization. There are several methods and mechanisms in place for optimizing network path identification. However, with the emergence of smarter environments, the current approaches need to improve significantly. In this paper, we have taken up the tried, tested and trusted Dijkstra algorithm and come out with a much-improved algorithm for realizing the much-anticipated flexibility and maneuverability in network path identification and optimization. This newly crafted algorithm goes a long way in conceptualizing and concretizing a variety of newer applications while ensuring the principal non-functional requirements such as energy efficiency, extensibility, etc.\",\"PeriodicalId\":244242,\"journal\":{\"name\":\"2014 International Conference on Computer Communication and Informatics\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-10-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 International Conference on Computer Communication and Informatics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCI.2014.6921763\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference on Computer Communication and Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCI.2014.6921763","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

由于各种原因,传感器和执行器目前在垂直行业中得到了广泛的应用。随着网络拓扑和通信技术的进步,新型的传感器网络正在根据业务需求形成。智能传感器能够为完成特定任务而制作特设网络。这些即兴创作的直接后果是智能环境的可能性和可持续性。例如,如今围绕智能家居、办公室、城市、政府、医疗保健等概念发生了很多事情。在更智能的传感器及其网络的帮助下,更智能的服务正在实现。然而,网络路径优化是一个迫在眉睫的挑战。有几种方法和机制可用于优化网络路径识别。然而,随着智能环境的出现,目前的方法需要显著改进。在本文中,我们采用了久经考验和可信的Dijkstra算法,提出了一种改进的算法,实现了人们期待已久的网络路径识别和优化的灵活性和可操作性。这种新设计的算法在概念化和具体化各种新应用程序方面走了很长一段路,同时确保了主要的非功能需求,如能源效率、可扩展性等。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An optimal algorithm for the flexible maneuverability in smart sensor networks (SSNs)
Sensors and actuators are being extensively used these days across industry verticals for a variety of reasons. With a number of delectable advancements in network topologies and communication technologies, novel types of sensors networks are being formed according to the business requirements. Smart sensors are capable of crafting ad hoc networks for accomplishing specified tasks. The direct fallout of these improvisations is the possibility and sustainability of smarter environments. For examples, nowadays there are a lot of happenings around the concepts of smarter homes, offices, cities, governments, healthcare etc. Smarter services are being realized with the help of smarter sensors and their networks. However one of the impending challenges is the network path optimization. There are several methods and mechanisms in place for optimizing network path identification. However, with the emergence of smarter environments, the current approaches need to improve significantly. In this paper, we have taken up the tried, tested and trusted Dijkstra algorithm and come out with a much-improved algorithm for realizing the much-anticipated flexibility and maneuverability in network path identification and optimization. This newly crafted algorithm goes a long way in conceptualizing and concretizing a variety of newer applications while ensuring the principal non-functional requirements such as energy efficiency, extensibility, etc.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信