{"title":"物联网背景下基于节点心理的非结构化资源约束环境路径与伙伴选择","authors":"Tanusree Debi, Assaduzaman","doi":"10.1109/ICASERT.2019.8934471","DOIUrl":null,"url":null,"abstract":"Internet of Things (IoT) is the network of the huge number of resource-personated nodes whose main feature is the reliable communication and fast data exchange among devices in any network topology. In the upcoming world of internet, proper selection of desire or appropriate destination node and finding the optimized path from the huge number of the activated nodes is a very important task. Here many nodes are available in one or more hop distance and each node has various network parameters in the IoT world, so the selection of best path and nodes is quite complex. For this reason, we need to develop an algorithm to find out the best path towards the destination node considering significant network parameters. This paper proposes a general algorithm considering any network topology for discovering the path towards the destination node from the source node and give a solution to the contradiction which may arise if there is more than one consonant path. The proposed algorithm considers the node property of all node for calculating the behavior value, path influence behavior value and finally discover the optimized path from source node to destination node. The proposed algorithm is also evaluated by simulation to determine the impact of parameters in path determination.","PeriodicalId":6613,"journal":{"name":"2019 1st International Conference on Advances in Science, Engineering and Robotics Technology (ICASERT)","volume":"11 1","pages":"1-6"},"PeriodicalIF":0.0000,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Path and Partner Selection in Unstructured Resource-Constrained Environments Based on Node Psychology in the Context of IoT\",\"authors\":\"Tanusree Debi, Assaduzaman\",\"doi\":\"10.1109/ICASERT.2019.8934471\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Internet of Things (IoT) is the network of the huge number of resource-personated nodes whose main feature is the reliable communication and fast data exchange among devices in any network topology. In the upcoming world of internet, proper selection of desire or appropriate destination node and finding the optimized path from the huge number of the activated nodes is a very important task. Here many nodes are available in one or more hop distance and each node has various network parameters in the IoT world, so the selection of best path and nodes is quite complex. For this reason, we need to develop an algorithm to find out the best path towards the destination node considering significant network parameters. This paper proposes a general algorithm considering any network topology for discovering the path towards the destination node from the source node and give a solution to the contradiction which may arise if there is more than one consonant path. The proposed algorithm considers the node property of all node for calculating the behavior value, path influence behavior value and finally discover the optimized path from source node to destination node. The proposed algorithm is also evaluated by simulation to determine the impact of parameters in path determination.\",\"PeriodicalId\":6613,\"journal\":{\"name\":\"2019 1st International Conference on Advances in Science, Engineering and Robotics Technology (ICASERT)\",\"volume\":\"11 1\",\"pages\":\"1-6\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 1st International Conference on Advances in Science, Engineering and Robotics Technology (ICASERT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICASERT.2019.8934471\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 1st International Conference on Advances in Science, Engineering and Robotics Technology (ICASERT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICASERT.2019.8934471","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
物联网(Internet of Things, IoT)是由大量资源节点组成的网络,其主要特点是在任何网络拓扑结构下,设备之间都能进行可靠的通信和快速的数据交换。在即将到来的互联网世界中,正确选择理想或合适的目标节点,并从大量的激活节点中找到最优路径是一项非常重要的任务。在物联网世界中,在一个或多个跳距中有许多节点可用,并且每个节点具有各种网络参数,因此最佳路径和节点的选择非常复杂。因此,我们需要开发一种算法,在考虑重要网络参数的情况下,找出到达目的节点的最佳路径。本文提出了一种考虑任何网络拓扑的从源节点到目的节点的路径的通用算法,并给出了一种解决路径存在多条一致时可能产生的矛盾的方法。该算法考虑所有节点的节点属性来计算行为值、路径影响行为值,最终发现从源节点到目的节点的最优路径。通过仿真对算法进行了评估,以确定参数对路径确定的影响。
Path and Partner Selection in Unstructured Resource-Constrained Environments Based on Node Psychology in the Context of IoT
Internet of Things (IoT) is the network of the huge number of resource-personated nodes whose main feature is the reliable communication and fast data exchange among devices in any network topology. In the upcoming world of internet, proper selection of desire or appropriate destination node and finding the optimized path from the huge number of the activated nodes is a very important task. Here many nodes are available in one or more hop distance and each node has various network parameters in the IoT world, so the selection of best path and nodes is quite complex. For this reason, we need to develop an algorithm to find out the best path towards the destination node considering significant network parameters. This paper proposes a general algorithm considering any network topology for discovering the path towards the destination node from the source node and give a solution to the contradiction which may arise if there is more than one consonant path. The proposed algorithm considers the node property of all node for calculating the behavior value, path influence behavior value and finally discover the optimized path from source node to destination node. The proposed algorithm is also evaluated by simulation to determine the impact of parameters in path determination.