首页 > 最新文献

International Journal of Communication Systems最新文献

英文 中文
An energy‐efficient Chebyshev fire hawks optimization algorithm for energy balancing in sensor‐enabled Internet of Things 用于传感器支持的物联网中能量平衡的高能效切比雪夫火鹰优化算法
IF 2.1 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2024-09-03 DOI: 10.1002/dac.5976
Pravin Yallappa Kumbhar, Apurva Abhijit Naik
SummarySensor‐enabled systems have been used successfully in agricultural, healthcare, commercial, and military application domains. Recently, there has been significant interest in the intelligent applications of sensor‐enabled technologies, particularly in the domains of smart grid, Internet of Vehicles (IoV), body area networks, and the Internet of Things (IoT). In recent research, various protocols and algorithm are developed for effective energy‐efficient routing and energy balancing. These existing models have some issues like high energy consumption and minimum network life time. In order to overcome these existing issues, a novel cluster head selection and routing mechanism in a wireless sensor network (WSN) environment is proposed. The clustering process has been formed by an enhanced Taylor kernel fuzzy C‐means algorithm (TKFC‐means). The cluster head in the group of sensor nodes has been identified based on energy and distance calculation. Finally, the routing has been performed by a novel energy‐efficient Chebyshev fire hawks optimization‐based routing protocol to route data to the edge server, which helps to balance the energy effectively. This protocol takes into account various factors, including distance, cost, residual energy, load, temperature, latency, and overall energy. The proposed model can obtain a throughput value of 82 Mbps for the sensor nodes at 500 and an end‐to‐end delay of 3.6 at 500 sensor nodes. The packet delivery ratio and loss ratio attain 96.4% and 2.7%, respectively, with 500 sensor nodes in the proposed approach. The proposed method consumes 0.45 mJ of energy with 500 nodes. From this analysis, the proposed model can obtain better results than the existing compared models.
摘要传感器系统已成功应用于农业、医疗保健、商业和军事应用领域。最近,人们对传感器技术的智能应用产生了浓厚的兴趣,尤其是在智能电网、车联网(IoV)、体域网和物联网(IoT)等领域。在最近的研究中,人们开发了各种协议和算法,以实现有效的节能路由和能量平衡。这些现有模型存在一些问题,如能耗高和网络寿命最短。为了克服这些现有问题,本文提出了一种新颖的无线传感器网络(WSN)环境下的簇头选择和路由机制。聚类过程由增强型泰勒核模糊 C-means 算法(TKFC-means)形成。根据能量和距离计算确定传感器节点组中的簇头。最后,通过基于切比雪夫火鹰优化的新型高能效路由协议进行路由,将数据路由到边缘服务器,这有助于有效平衡能量。该协议考虑了各种因素,包括距离、成本、剩余能量、负载、温度、延迟和总能量。所提出的模型可使 500 个传感器节点的吞吐量达到 82 Mbps,500 个传感器节点的端到端延迟为 3.6。在拟议方法中,500 个传感器节点的数据包传送率和丢失率分别达到 96.4% 和 2.7%。在 500 个节点的情况下,拟议方法的能耗为 0.45 mJ。从以上分析来看,与现有的比较模型相比,建议的模型能获得更好的结果。
{"title":"An energy‐efficient Chebyshev fire hawks optimization algorithm for energy balancing in sensor‐enabled Internet of Things","authors":"Pravin Yallappa Kumbhar, Apurva Abhijit Naik","doi":"10.1002/dac.5976","DOIUrl":"https://doi.org/10.1002/dac.5976","url":null,"abstract":"SummarySensor‐enabled systems have been used successfully in agricultural, healthcare, commercial, and military application domains. Recently, there has been significant interest in the intelligent applications of sensor‐enabled technologies, particularly in the domains of smart grid, Internet of Vehicles (IoV), body area networks, and the Internet of Things (IoT). In recent research, various protocols and algorithm are developed for effective energy‐efficient routing and energy balancing. These existing models have some issues like high energy consumption and minimum network life time. In order to overcome these existing issues, a novel cluster head selection and routing mechanism in a wireless sensor network (WSN) environment is proposed. The clustering process has been formed by an enhanced Taylor kernel fuzzy C‐means algorithm (TKFC‐means). The cluster head in the group of sensor nodes has been identified based on energy and distance calculation. Finally, the routing has been performed by a novel energy‐efficient Chebyshev fire hawks optimization‐based routing protocol to route data to the edge server, which helps to balance the energy effectively. This protocol takes into account various factors, including distance, cost, residual energy, load, temperature, latency, and overall energy. The proposed model can obtain a throughput value of 82 Mbps for the sensor nodes at 500 and an end‐to‐end delay of 3.6 at 500 sensor nodes. The packet delivery ratio and loss ratio attain 96.4% and 2.7%, respectively, with 500 sensor nodes in the proposed approach. The proposed method consumes 0.45 mJ of energy with 500 nodes. From this analysis, the proposed model can obtain better results than the existing compared models.","PeriodicalId":13946,"journal":{"name":"International Journal of Communication Systems","volume":"7 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142225174","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Privacy-preserving collaboration in blockchain-enabled IoT: The synergy of modified homomorphic encryption and federated learning 区块链物联网中的隐私保护协作:修正同态加密与联合学习的协同作用
IF 1.7 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2024-09-02 DOI: 10.1002/dac.5955
Raja Anitha, Mahalingam Murugan

The proliferation of network devices capable of gathering, transmitting, and receiving data over the Internet has spurred the widespread adoption of Internet of Things (IoT) devices, particularly in resource-oriented applications. Integrating blockchain, IoT, homomorphic encryption, and federated learning requires a balance between computational requirements and real-time performance. Secure key management is crucial to maintain data privacy and integrity. Compliance with privacy regulations requires careful implementation of privacy-preserving mechanisms in blockchain-enabled IoT environments, which can be subjected to various attacks. Addressing these challenges requires interdisciplinary expertise, research, and innovation to develop more efficient and effective privacy-preserving techniques tailored to the unique characteristics of such environments. This research introduces the Modified Homomorphic Encryption Federated-based Adaptive Hybrid Dandelion Search (MHEF-AHDS) algorithm as an effective framework to enhance security in blockchain-enabled IoT systems. The amalgamation of Modified Homomorphic Encryption (MHE) and Federated Learning (FL) constitutes a potent alliance that addresses privacy concerns within collaborative and decentralized machine learning environments. This facilitates secure and adaptable data collaboration, effectively mitigating privacy risks associated with sensitive information. The integration of quantum machine learning into security applications presents an exciting opportunity for distinctive progress and innovation. Within this work, the Adaptive Hybrid Dandelion optimization algorithm, featuring an Initial search strategy, is employed for hyperparameter optimization thereby elevating the performances of the proposed MHEF-AHDS method. Furthermore, the integration of smart contracts and Blockchain-based IoT enhances the overall security of the proposed method. MHEF-AHDS comprehensively tackles privacy, security, and scalability challenges through robust security measures and privacy enhancements. The performance evaluation of the MHEF-AHDS method encompasses a thorough analysis based on key metrics such as throughput, latency, scalability, energy consumption, accuracy, precision, recall, and f1-score. Comparative assessments against existing methods are conducted to gauge the effectiveness of the proposed method in addressing security, privacy, and scalability concerns.

摘要能够通过互联网收集、传输和接收数据的网络设备的激增推动了物联网(IoT)设备的广泛应用,特别是在面向资源的应用中。整合区块链、物联网、同态加密和联合学习需要在计算要求和实时性能之间取得平衡。安全密钥管理对于维护数据隐私和完整性至关重要。要遵守隐私法规,就必须在支持区块链的物联网环境中谨慎实施隐私保护机制,因为这些环境可能会受到各种攻击。应对这些挑战需要跨学科的专业知识、研究和创新,以开发出更高效、更有效的隐私保护技术,适应此类环境的独特特点。本研究介绍了基于联邦自适应混合蒲公英搜索(MHEF-AHDS)的修正同态加密算法,作为增强区块链物联网系统安全性的有效框架。修正同态加密(MHE)与联合学习(FL)的结合构成了一个强大的联盟,可解决协作式分散机器学习环境中的隐私问题。这促进了安全、适应性强的数据协作,有效降低了与敏感信息相关的隐私风险。将量子机器学习整合到安全应用中,为独特的进步和创新提供了一个令人兴奋的机会。在这项工作中,采用了自适应混合蒲公英优化算法(Adaptive Hybrid Dandelion optimization algorithm),该算法以初始搜索策略为特色,用于超参数优化,从而提升了所提出的 MHEF-AHDS 方法的性能。此外,智能合约和基于区块链的物联网的集成增强了所提方法的整体安全性。MHEF-AHDS 通过强大的安全措施和隐私增强措施,全面应对了隐私、安全和可扩展性方面的挑战。MHEF-AHDS 方法的性能评估包括基于吞吐量、延迟、可扩展性、能耗、准确度、精确度、召回率和 f1 分数等关键指标的全面分析。通过与现有方法进行比较评估,衡量了所提方法在解决安全性、隐私性和可扩展性问题方面的有效性。
{"title":"Privacy-preserving collaboration in blockchain-enabled IoT: The synergy of modified homomorphic encryption and federated learning","authors":"Raja Anitha,&nbsp;Mahalingam Murugan","doi":"10.1002/dac.5955","DOIUrl":"10.1002/dac.5955","url":null,"abstract":"<div>\u0000 \u0000 <p>The proliferation of network devices capable of gathering, transmitting, and receiving data over the Internet has spurred the widespread adoption of Internet of Things (IoT) devices, particularly in resource-oriented applications. Integrating blockchain, IoT, homomorphic encryption, and federated learning requires a balance between computational requirements and real-time performance. Secure key management is crucial to maintain data privacy and integrity. Compliance with privacy regulations requires careful implementation of privacy-preserving mechanisms in blockchain-enabled IoT environments, which can be subjected to various attacks. Addressing these challenges requires interdisciplinary expertise, research, and innovation to develop more efficient and effective privacy-preserving techniques tailored to the unique characteristics of such environments. This research introduces the Modified Homomorphic Encryption Federated-based Adaptive Hybrid Dandelion Search (MHEF-AHDS) algorithm as an effective framework to enhance security in blockchain-enabled IoT systems. The amalgamation of Modified Homomorphic Encryption (MHE) and Federated Learning (FL) constitutes a potent alliance that addresses privacy concerns within collaborative and decentralized machine learning environments. This facilitates secure and adaptable data collaboration, effectively mitigating privacy risks associated with sensitive information. The integration of quantum machine learning into security applications presents an exciting opportunity for distinctive progress and innovation. Within this work, the Adaptive Hybrid Dandelion optimization algorithm, featuring an Initial search strategy, is employed for hyperparameter optimization thereby elevating the performances of the proposed MHEF-AHDS method. Furthermore, the integration of smart contracts and Blockchain-based IoT enhances the overall security of the proposed method. MHEF-AHDS comprehensively tackles privacy, security, and scalability challenges through robust security measures and privacy enhancements. The performance evaluation of the MHEF-AHDS method encompasses a thorough analysis based on key metrics such as throughput, latency, scalability, energy consumption, accuracy, precision, recall, and f1-score. Comparative assessments against existing methods are conducted to gauge the effectiveness of the proposed method in addressing security, privacy, and scalability concerns.</p>\u0000 </div>","PeriodicalId":13946,"journal":{"name":"International Journal of Communication Systems","volume":"37 18","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142196552","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An effective channel allocation designed using hybrid memory dragonfly with imperialist competitive algorithm in distributed mobile adhoc network 分布式移动 adhoc 网络中使用混合记忆蜻蜓与帝国主义竞争算法设计的有效信道分配方案
IF 1.7 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2024-08-31 DOI: 10.1002/dac.5906
Suganya Rangasamy, Kanmani Ramasamy, Rajesh Kumar Thangavel

The channel availability problem reaches a higher degree in mobile ad hoc networks (MANETs) and garners a lot of attention in communication networks. Because increased mobile usage might result in a lack of channel allocation, an improved channel allocation technique is presented to tackle the availability problem. The distributed dynamic channel allocation (DDCA) model is built in this paper using the hybrid memory dragonfly with imperialist competitive (HMDIC) method. Based on optimization logic, this strategy assigns the channel to mobile hosts. The MANET provides a dispersed network within the coverage region in the absence of base station infrastructure. The HMDIC optimizer approach in this circumstance randomly begins every respective node to update and store their pbest value utilizing RAM dragonfly employing satellite images. The constraint values are then used to construct the cost function, which results in a strong kind of global optimum solution. The channels are therefore distributed in an effective manner. The HMDIC algorithm is used in this research to build a novel channel allocation system. It makes advantage of the exploration capabilities to successfully explore the individual node using MDA (Modified Dragonfly Algorithm) and locate the global best solution using imperialist competitive algorithm (ICA). Both of these combined tactics are more effective in accelerating the convergence of the allocation model. To validate the performance, the HMDIC-based DDCA system provides promising results in terms of assigning available channels, thereby enhancing channel reuse efficiency and fractional interference.

摘要信道可用性问题在移动特设网络(MANET)中达到了更高的程度,在通信网络中引起了广泛关注。由于移动使用的增加可能导致信道分配不足,因此本文提出了一种改进的信道分配技术来解决可用性问题。本文使用混合记忆蜻蜓与帝国主义竞争(HMDIC)方法建立了分布式动态信道分配(DDCA)模型。基于优化逻辑,该策略将信道分配给移动主机。在没有基站基础设施的情况下,城域网在覆盖区域内提供了一个分散的网络。在这种情况下,HMDIC 优化器方法利用 RAM 蜻蜓卫星图像,随机开始每个节点更新并存储其 pbest 值。约束值随后被用于构建成本函数,从而产生一种强大的全局最优解。因此,可以有效地分配信道。本研究利用 HMDIC 算法建立了一个新颖的信道分配系统。它利用探索能力的优势,使用 MDA(改良蜻蜓算法)成功探索单个节点,并使用帝国主义竞争算法(ICA)定位全局最优解。这两种策略的结合能更有效地加速分配模型的收敛。为了验证其性能,基于 HMDIC 的 DDCA 系统在分配可用信道方面取得了可喜的成果,从而提高了信道重用效率和干扰分数。
{"title":"An effective channel allocation designed using hybrid memory dragonfly with imperialist competitive algorithm in distributed mobile adhoc network","authors":"Suganya Rangasamy,&nbsp;Kanmani Ramasamy,&nbsp;Rajesh Kumar Thangavel","doi":"10.1002/dac.5906","DOIUrl":"10.1002/dac.5906","url":null,"abstract":"<div>\u0000 \u0000 <p>The channel availability problem reaches a higher degree in mobile ad hoc networks (MANETs) and garners a lot of attention in communication networks. Because increased mobile usage might result in a lack of channel allocation, an improved channel allocation technique is presented to tackle the availability problem. The distributed dynamic channel allocation (DDCA) model is built in this paper using the hybrid memory dragonfly with imperialist competitive (HMDIC) method. Based on optimization logic, this strategy assigns the channel to mobile hosts. The MANET provides a dispersed network within the coverage region in the absence of base station infrastructure. The HMDIC optimizer approach in this circumstance randomly begins every respective node to update and store their pbest value utilizing RAM dragonfly employing satellite images. The constraint values are then used to construct the cost function, which results in a strong kind of global optimum solution. The channels are therefore distributed in an effective manner. The HMDIC algorithm is used in this research to build a novel channel allocation system. It makes advantage of the exploration capabilities to successfully explore the individual node using MDA (Modified Dragonfly Algorithm) and locate the global best solution using imperialist competitive algorithm (ICA). Both of these combined tactics are more effective in accelerating the convergence of the allocation model. To validate the performance, the HMDIC-based DDCA system provides promising results in terms of assigning available channels, thereby enhancing channel reuse efficiency and fractional interference.</p>\u0000 </div>","PeriodicalId":13946,"journal":{"name":"International Journal of Communication Systems","volume":"37 16","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142196553","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Hybrid ELECTRE and bipolar fuzzy PROMOTHEE‐based packet dropping malicious node mitigation technique for improving QoS in WSNs 基于 ELECTRE 和双极模糊 PROMOTHEE 的混合数据包丢弃恶意节点缓解技术,用于改善 WSN 中的 QoS
IF 2.1 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2024-08-30 DOI: 10.1002/dac.5974
S. Madhavi, R. Praveen, S. Jagatheswari, K. Nivitha
SummaryIn wireless sensor networks (WSNs), trusted routing path needs to be determined for guaranteeing reliable data dissemination with maximized Quality of Service (QoS). But the sensor nodes may not exhibit a cooperative behavior for the objective of conserving energy and remaining active in the network. Trust management techniques are essential for alleviating the problem of packet dropping attacks of sensor nodes that intentionally deteriorates the performance of the network. In this paper, Hybrid ELECTRE and bipolar fuzzy PROMOTHEE‐based trust management (HEBFPTM) scheme is proposed for addressing the impact of packet dropping attacks that targets on improving QoS in WSNs. This is proposed as a multi‐criteria decision analysis solution for obtaining feasible number of parameters that could be derived from the sensor nodes of the network to determine its cooperation degree in the network. This HEBFPTM is proposed with the objective of integrating the ordinal evaluation of mobile nodes into a cardinal procedure using the method of PROMETHEE to attain quantitative and qualitative analysis that aides in identifying the weights of each criterion considered for cooperation determination using pairwise comparison. It adopted three preference models using partial, complete, and outranking through intervals. It handled the problem of uncertainty using the merits of bipolar fuzzy that helped in attaining the weight of the criteria and preference functions used for ranking the sensor nodes in the routing path. The experiments of the proposed HEBFPTM achieved using ns‐2 simulator confirmed its efficacy in improving the attack detection rate by 21.38%, reduced false positive rate by 15.42%, maximized packet delivery rate of 18.94%, and reduced energy utilization of 19.84% better than the benchmarked approaches used for investigation.
摘要 在无线传感器网络(WSN)中,需要确定可信的路由路径,以保证可靠的数据传输和最高的服务质量(QoS)。但传感器节点可能不会为了节省能量和保持网络活跃而表现出合作行为。信任管理技术对于缓解传感器节点故意降低网络性能的丢包攻击问题至关重要。本文提出了基于 ELECTRE 和双极模糊 PROMOTHEE 的混合信任管理(HEBFPTM)方案,以解决丢包攻击的影响,从而提高 WSN 的服务质量。该方案是作为一种多标准决策分析方案提出的,用于获取可行的参数数量,这些参数可从网络传感器节点中得出,以确定其在网络中的合作程度。提出 HEBFPTM 的目的是利用 PROMETHEE 方法,将移动节点的顺序评估整合到卡片式程序中,以实现定量和定性分析,从而通过成对比较确定合作确定所考虑的各标准的权重。它采用了部分、完全和通过区间排序的三种偏好模型。它利用双极模糊的优点处理了不确定性问题,有助于确定标准权重和偏好函数,用于对路由路径中的传感器节点进行排序。使用 ns-2 模拟器对所提出的 HEBFPTM 进行的实验证实,与用于调查的基准方法相比,它能有效提高 21.38% 的攻击检测率,降低 15.42% 的误报率,最大化 18.94% 的数据包交付率,降低 19.84% 的能量利用率。
{"title":"Hybrid ELECTRE and bipolar fuzzy PROMOTHEE‐based packet dropping malicious node mitigation technique for improving QoS in WSNs","authors":"S. Madhavi, R. Praveen, S. Jagatheswari, K. Nivitha","doi":"10.1002/dac.5974","DOIUrl":"https://doi.org/10.1002/dac.5974","url":null,"abstract":"SummaryIn wireless sensor networks (WSNs), trusted routing path needs to be determined for guaranteeing reliable data dissemination with maximized Quality of Service (QoS). But the sensor nodes may not exhibit a cooperative behavior for the objective of conserving energy and remaining active in the network. Trust management techniques are essential for alleviating the problem of packet dropping attacks of sensor nodes that intentionally deteriorates the performance of the network. In this paper, Hybrid ELECTRE and bipolar fuzzy PROMOTHEE‐based trust management (HEBFPTM) scheme is proposed for addressing the impact of packet dropping attacks that targets on improving QoS in WSNs. This is proposed as a multi‐criteria decision analysis solution for obtaining feasible number of parameters that could be derived from the sensor nodes of the network to determine its cooperation degree in the network. This HEBFPTM is proposed with the objective of integrating the ordinal evaluation of mobile nodes into a cardinal procedure using the method of PROMETHEE to attain quantitative and qualitative analysis that aides in identifying the weights of each criterion considered for cooperation determination using pairwise comparison. It adopted three preference models using partial, complete, and outranking through intervals. It handled the problem of uncertainty using the merits of bipolar fuzzy that helped in attaining the weight of the criteria and preference functions used for ranking the sensor nodes in the routing path. The experiments of the proposed HEBFPTM achieved using ns‐2 simulator confirmed its efficacy in improving the attack detection rate by 21.38%, reduced false positive rate by 15.42%, maximized packet delivery rate of 18.94%, and reduced energy utilization of 19.84% better than the benchmarked approaches used for investigation.","PeriodicalId":13946,"journal":{"name":"International Journal of Communication Systems","volume":"25 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142196554","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Deep learning‐based spectrum sharing in next generation multi‐operator cellular networks 下一代多运营商蜂窝网络中基于深度学习的频谱共享
IF 2.1 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2024-08-27 DOI: 10.1002/dac.5964
Danish Mehmood Mughal, Tahira Mahboob, Syed Tariq Shah, Sang‐Hyo Kim, Min Young Chung
SummaryOwing to the exponential increase in wireless network services and bandwidth requirements, sharing the radio spectrum among multiple network operators seems inevitable. In wireless networks, enabling efficient spectrum sharing for resource allocation is quite challenging due to several random factors, especially in multi‐operator spectrum sharing. While spectrum sensing can be useful in spectrum‐sharing networks, the chance of collision exists due to the inherent unreliability of wireless networks, making operators reluctant to use sensing‐based mechanisms for spectrum sharing. To circumvent these issues, we utilize an alternative approach, whereby we propose an efficient spectrum‐sharing mechanism leveraging a spectrum coordinator (SC) in a multi‐operator spectrum‐sharing scenario assisted by deep learning (DL). In our proposed scheme, before the beginning of each timeslot, the base station of each operator transmits the number of required resources based on the number of packets in the base station's queue to SC. In addition, base stations also transmit the list of available channels to SC. After gathering information from all base stations, SC distributes this collected information to all the base stations. Each base station then utilizes the DL‐based spectrum‐sharing algorithm and computes the number of resources it can use based on the number of packets in its queue and the number of packets in the queues of other operators. Furthermore, by leveraging DL, each operator also computes the cost it must pay to other operators for using their resources. We evaluate the performance of the proposed network through extensive simulations. It is shown that the proposed DL‐based spectrum‐sharing mechanism outperforms the conventional spectrum allocation scheme, thus paving the way for more dynamic and efficient multi‐operator spectrum sharing.
摘要随着无线网络服务和带宽需求的指数级增长,多个网络运营商共享无线电频谱似乎不可避免。在无线网络中,由于多种随机因素的影响,特别是在多运营商频谱共享的情况下,实现资源分配的高效频谱共享是一项相当大的挑战。虽然频谱传感在频谱共享网络中很有用,但由于无线网络固有的不稳定性,碰撞的几率是存在的,这使得运营商不愿意使用基于传感的频谱共享机制。为了规避这些问题,我们采用了另一种方法,即在深度学习(DL)的辅助下,利用多运营商频谱共享场景中的频谱协调器(SC),提出一种高效的频谱共享机制。在我们提出的方案中,在每个时隙开始之前,每个运营商的基站都会根据基站队列中的数据包数量向 SC 发送所需资源的数量。此外,基站还向 SC 发送可用信道列表。从所有基站收集信息后,SC 会将收集到的信息分发给所有基站。然后,每个基站利用基于 DL 的频谱共享算法,根据自己队列中的数据包数量和其他运营商队列中的数据包数量计算可使用的资源数量。此外,通过利用 DL,每个运营商还能计算出使用其他运营商资源时必须向其支付的费用。我们通过大量模拟来评估所建议网络的性能。结果表明,建议的基于 DL 的频谱共享机制优于传统的频谱分配方案,从而为更动态、更高效的多运营商频谱共享铺平了道路。
{"title":"Deep learning‐based spectrum sharing in next generation multi‐operator cellular networks","authors":"Danish Mehmood Mughal, Tahira Mahboob, Syed Tariq Shah, Sang‐Hyo Kim, Min Young Chung","doi":"10.1002/dac.5964","DOIUrl":"https://doi.org/10.1002/dac.5964","url":null,"abstract":"SummaryOwing to the exponential increase in wireless network services and bandwidth requirements, sharing the radio spectrum among multiple network operators seems inevitable. In wireless networks, enabling efficient spectrum sharing for resource allocation is quite challenging due to several random factors, especially in multi‐operator spectrum sharing. While spectrum sensing can be useful in spectrum‐sharing networks, the chance of collision exists due to the inherent unreliability of wireless networks, making operators reluctant to use sensing‐based mechanisms for spectrum sharing. To circumvent these issues, we utilize an alternative approach, whereby we propose an efficient spectrum‐sharing mechanism leveraging a spectrum coordinator (SC) in a multi‐operator spectrum‐sharing scenario assisted by deep learning (DL). In our proposed scheme, before the beginning of each timeslot, the base station of each operator transmits the number of required resources based on the number of packets in the base station's queue to SC. In addition, base stations also transmit the list of available channels to SC. After gathering information from all base stations, SC distributes this collected information to all the base stations. Each base station then utilizes the DL‐based spectrum‐sharing algorithm and computes the number of resources it can use based on the number of packets in its queue and the number of packets in the queues of other operators. Furthermore, by leveraging DL, each operator also computes the cost it must pay to other operators for using their resources. We evaluate the performance of the proposed network through extensive simulations. It is shown that the proposed DL‐based spectrum‐sharing mechanism outperforms the conventional spectrum allocation scheme, thus paving the way for more dynamic and efficient multi‐operator spectrum sharing.","PeriodicalId":13946,"journal":{"name":"International Journal of Communication Systems","volume":"37 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142196555","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A survey on network lifetime maximization using data aggregation trees 利用数据聚合树实现网络寿命最大化的研究
IF 2.1 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2024-08-24 DOI: 10.1002/dac.5962
Preeti A. Kale, Manisha J. Nene
SummaryThe sensor networks are the primary and essential components on which the world of Internet of Things (IoT) is built. IoT empowers smart communication, computation, and sensing capabilities. In sensor networks, the data are collected by the sensor nodes and sent to the sink along a communication path. These communication paths are collaboratively established by the nodes and the sink. By incorporating energy‐efficient data gathering techniques, the lifetime of these networks is improved. The major contribution of the study in this work is to provide a survey of various techniques for data aggregation (DA) and the employed algorithmic strategies that facilitate and influence network lifetime (NL) in these environments. DA in wireless sensor networks (WSN), IoTs, and cloud computing extend the lifetime of these networks since it enables efficient merging of traffic flows, thus reducing transmissions and energy consumption of devices. In sensor networks, data aggregation tree (DAT)‐based routing facilitates energy‐efficient routing that extends NL. NL maximization using DATs constructs DATs with optimal NL and is a known NP‐complete problem. Subsequently, the study in this work surveys the various approaches employed by researchers to construct DATs and discusses techniques for DAT scheduling. This work further explores various sensor deployment techniques and discusses real world scenario in which NL is influenced by uncertainty in communication links. Finally, the study in this survey highlights the achievements in realizing NL improvement using DAT and identifies the limitations and research challenges.
摘要传感器网络是构建物联网(IoT)世界的主要和基本组成部分。物联网增强了智能通信、计算和传感能力。在传感器网络中,数据由传感器节点收集,并沿着通信路径发送到汇。这些通信路径由节点和汇协同建立。通过采用高能效数据收集技术,这些网络的寿命得到了改善。这项研究的主要贡献在于对数据聚合(DA)的各种技术以及在这些环境中促进和影响网络寿命(NL)的算法策略进行了调查。无线传感器网络(WSN)、物联网和云计算中的数据汇聚可延长这些网络的使用寿命,因为它能有效合并流量,从而减少设备的传输和能耗。在传感器网络中,基于数据聚合树(DAT)的路由可促进高能效路由,从而延长 NL。使用 DAT 实现 NL 最大化需要构建具有最佳 NL 的 DAT,这是一个已知的 NP-完全问题。随后,本研究调查了研究人员构建 DAT 的各种方法,并讨论了 DAT 调度技术。本研究还进一步探讨了各种传感器部署技术,并讨论了 NL 受通信链路不确定性影响的现实场景。最后,本调查报告强调了利用 DAT 实现 NL 改进的成就,并指出了局限性和研究挑战。
{"title":"A survey on network lifetime maximization using data aggregation trees","authors":"Preeti A. Kale, Manisha J. Nene","doi":"10.1002/dac.5962","DOIUrl":"https://doi.org/10.1002/dac.5962","url":null,"abstract":"SummaryThe sensor networks are the primary and essential components on which the world of Internet of Things (IoT) is built. IoT empowers smart communication, computation, and sensing capabilities. In sensor networks, the data are collected by the sensor nodes and sent to the sink along a communication path. These communication paths are collaboratively established by the nodes and the sink. By incorporating energy‐efficient data gathering techniques, the lifetime of these networks is improved. The major contribution of the study in this work is to provide a survey of various techniques for data aggregation (DA) and the employed algorithmic strategies that facilitate and influence network lifetime (NL) in these environments. DA in wireless sensor networks (WSN), IoTs, and cloud computing extend the lifetime of these networks since it enables efficient merging of traffic flows, thus reducing transmissions and energy consumption of devices. In sensor networks, data aggregation tree (DAT)‐based routing facilitates energy‐efficient routing that extends NL. NL maximization using DATs constructs DATs with optimal NL and is a known NP‐complete problem. Subsequently, the study in this work surveys the various approaches employed by researchers to construct DATs and discusses techniques for DAT scheduling. This work further explores various sensor deployment techniques and discusses real world scenario in which NL is influenced by uncertainty in communication links. Finally, the study in this survey highlights the achievements in realizing NL improvement using DAT and identifies the limitations and research challenges.","PeriodicalId":13946,"journal":{"name":"International Journal of Communication Systems","volume":"1 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142196557","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Enhanced adaptive data rate strategies for energy‐efficient Internet of Things communication in LoRaWAN 针对 LoRaWAN 中高能效物联网通信的增强型自适应数据速率策略
IF 2.1 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2024-08-24 DOI: 10.1002/dac.5966
Muhammad Ali Lodhi, Lei Wang, Khalid Mahmood, Arshad Farhad, Jenhui Chen, Saru Kumari
SummaryThe long‐range wide area network (LoRaWAN) is a standard for the Internet of Things (IoT) because it has low cost, long range, not energy‐intensive, and capable of supporting massive end devices (EDs). The adaptive data rate (ADR) adjusts parameters at both EDs and the network server (NS). This includes modifying the transmission spreading factor (SF) and transmit power (TP) to minimize packet errors and optimize transmission performance at the NS. The ADR managed by NS aims to provide reliable and energy‐efficient resources (e.g., SF and TP) to EDs by monitoring the packets received from the EDs. However, since the channel condition changes rapidly in LoRaWAN due to mobility, the existing ADR algorithm is unsuitable and results in a significant amount of packet loss and retransmissions causing an increase in energy consumption. In this paper, we enhance the ADR by introducing Kalman filter‐based ADR (KF‐ADR) and moving median‐based ADR (Median‐ADR), which estimate the optimal SNR by considering the mobility later used to assign the SF and TP to EDs. The simulation results showed that the proposed techniques outperform the legacy ADRs in terms of convergence period, energy consumption, and packet success ratio.
摘要长距离广域网(LoRaWAN)是物联网(IoT)的一个标准,因为它成本低、距离远、不耗能,而且能够支持大量终端设备(ED)。自适应数据速率(ADR)可调整 ED 和网络服务器(NS)的参数。这包括修改传输扩展因子(SF)和传输功率(TP),以尽量减少数据包错误并优化 NS 的传输性能。由 NS 管理的 ADR 旨在通过监控从 ED 接收到的数据包,为 ED 提供可靠且节能的资源(如 SF 和 TP)。然而,由于 LoRaWAN 中的信道条件因移动性而快速变化,现有的 ADR 算法并不适用,会导致大量数据包丢失和重传,从而增加能耗。本文通过引入基于卡尔曼滤波器的 ADR(KF-ADR)和基于移动中值的 ADR(Median-ADR)来增强 ADR,这两种算法通过考虑移动性来估计最佳信噪比,然后用于为 ED 分配 SF 和 TP。仿真结果表明,所提出的技术在收敛周期、能耗和数据包成功率方面都优于传统的 ADR。
{"title":"Enhanced adaptive data rate strategies for energy‐efficient Internet of Things communication in LoRaWAN","authors":"Muhammad Ali Lodhi, Lei Wang, Khalid Mahmood, Arshad Farhad, Jenhui Chen, Saru Kumari","doi":"10.1002/dac.5966","DOIUrl":"https://doi.org/10.1002/dac.5966","url":null,"abstract":"SummaryThe long‐range wide area network (LoRaWAN) is a standard for the Internet of Things (IoT) because it has low cost, long range, not energy‐intensive, and capable of supporting massive end devices (EDs). The adaptive data rate (ADR) adjusts parameters at both EDs and the network server (NS). This includes modifying the transmission spreading factor (SF) and transmit power (TP) to minimize packet errors and optimize transmission performance at the NS. The ADR managed by NS aims to provide reliable and energy‐efficient resources (e.g., SF and TP) to EDs by monitoring the packets received from the EDs. However, since the channel condition changes rapidly in LoRaWAN due to mobility, the existing ADR algorithm is unsuitable and results in a significant amount of packet loss and retransmissions causing an increase in energy consumption. In this paper, we enhance the ADR by introducing Kalman filter‐based ADR (KF‐ADR) and moving median‐based ADR (Median‐ADR), which estimate the optimal SNR by considering the mobility later used to assign the SF and TP to EDs. The simulation results showed that the proposed techniques outperform the legacy ADRs in terms of convergence period, energy consumption, and packet success ratio.","PeriodicalId":13946,"journal":{"name":"International Journal of Communication Systems","volume":"42 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142196556","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Chronological wild geese optimization algorithm for cluster head selection and routing in wireless sensor network 用于无线传感器网络簇头选择和路由选择的时序雁优化算法
IF 2.1 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2024-08-23 DOI: 10.1002/dac.5963
Zoren P. Mabunga, Jennifer C. Dela Cruz
SummaryWireless sensor networks (WSNs) consist of numerous sensor nodes with limited battery life, computational power, and network capabilities. These sensors are deployed in specific areas to monitor environmental physical parameters. Once the data are collected, it is processed and transmitted to a base station (BS) via designated routes. The processes of sensing and transmitting consume significant energy, leading to rapid depletion of node batteries and the occurrence of hot spot problems. Consequently, relying on a single route for data transmission can result in network overhead issues. Enhancing the energy efficiency of WSNs is a persistent challenge. To address this, improvements in processes, such as routing and clustering are necessary. Implementing dynamic cluster head (CH) selection is a key approach for optimal path selection and energy conservation. Accordingly, in this work, a novel multiobjective CH selection and routing method for providing energy‐aware data transmission in WSN is presented. Here, CH selection is carried out using the proposed chronological wild geese optimization (CWGO) technique based on multiple constraints, such as delay, intercluster distance, intracluster distance, Link Life Time (LLT), and predicted energy. Further, the nodes' energy is determined by the deep recurrent neural network (DRNN). Then, the ideal path from the node to the BS is identified by the CWGO considering constraints, like predicted energy, delay, distance, and trust. Moreover, the proposed CWGO is examined considering metrics, like energy, trust, distance, and delay and is found to have attained superior values of 0.963 J, 0.700, 19.468 m, and 0.252 s, respectively.
摘要无线传感器网络(WSN)由众多传感器节点组成,这些节点的电池寿命、计算能力和网络功能都有限。这些传感器部署在特定区域,用于监测环境物理参数。一旦收集到数据,就会对其进行处理,并通过指定路线传输到基站(BS)。传感和传输过程会消耗大量能源,导致节点电池迅速耗尽并出现热点问题。因此,依赖单一路由进行数据传输会导致网络开销问题。提高 WSN 的能效是一项长期挑战。为解决这一问题,有必要改进路由选择和聚类等流程。实施动态簇头(CH)选择是优化路径选择和节能的关键方法。因此,本研究提出了一种新颖的多目标 CH 选择和路由方法,用于在 WSN 中提供能量感知数据传输。在这里,CH 选择采用了所提出的时序雁优化(CWGO)技术,该技术基于多个约束条件,如延迟、簇间距离、簇内距离、链路寿命(LLT)和预测能量。此外,节点的能量由深度递归神经网络(DRNN)确定。然后,考虑到预测能量、延迟、距离和信任等约束条件,通过 CWGO 确定节点到 BS 的理想路径。此外,考虑到能量、信任度、距离和延迟等指标,对所提出的 CWGO 进行了检验,发现其优越值分别为 0.963 J、0.700、19.468 m 和 0.252 s。
{"title":"Chronological wild geese optimization algorithm for cluster head selection and routing in wireless sensor network","authors":"Zoren P. Mabunga, Jennifer C. Dela Cruz","doi":"10.1002/dac.5963","DOIUrl":"https://doi.org/10.1002/dac.5963","url":null,"abstract":"SummaryWireless sensor networks (WSNs) consist of numerous sensor nodes with limited battery life, computational power, and network capabilities. These sensors are deployed in specific areas to monitor environmental physical parameters. Once the data are collected, it is processed and transmitted to a base station (BS) via designated routes. The processes of sensing and transmitting consume significant energy, leading to rapid depletion of node batteries and the occurrence of hot spot problems. Consequently, relying on a single route for data transmission can result in network overhead issues. Enhancing the energy efficiency of WSNs is a persistent challenge. To address this, improvements in processes, such as routing and clustering are necessary. Implementing dynamic cluster head (CH) selection is a key approach for optimal path selection and energy conservation. Accordingly, in this work, a novel multiobjective CH selection and routing method for providing energy‐aware data transmission in WSN is presented. Here, CH selection is carried out using the proposed chronological wild geese optimization (CWGO) technique based on multiple constraints, such as delay, intercluster distance, intracluster distance, Link Life Time (LLT), and predicted energy. Further, the nodes' energy is determined by the deep recurrent neural network (DRNN). Then, the ideal path from the node to the BS is identified by the CWGO considering constraints, like predicted energy, delay, distance, and trust. Moreover, the proposed CWGO is examined considering metrics, like energy, trust, distance, and delay and is found to have attained superior values of 0.963 J, 0.700, 19.468 m, and 0.252 s, respectively.","PeriodicalId":13946,"journal":{"name":"International Journal of Communication Systems","volume":"2 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142196558","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An efficient resource scheduling mechanism in LoRaWAN environment using coati optimal Q‐reinforcement learning LoRaWAN 环境中的高效资源调度机制(使用 coati 最佳 Q 强化学习法
IF 2.1 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2024-08-22 DOI: 10.1002/dac.5965
J Uma Mahesh, Judhistir Mahapatro
SummaryIt is estimated that there will be over two dozen billion Internet of Things (IoT) connections in the future as the number of connected IoT devices grows rapidly. Due to characteristics like low power consumption and extensive coverage, low‐power wide area networks (LPWANs) have become particularly relevant for the new paradigm. Long range wide area network (LoRaWAN) is one of the most alluring technological advances in these networks. Although it is one of the most developed LPWAN platforms, there are still unresolved issues, such as capacity limitations. Hence, this research introduces a novel resource scheduling technique for the LoRAWAN network using deep reinforcement learning. Here, the information on the LoRaWAN nodes is learned by the reinforcement technique, and the knowledge is utilized to allocate resources to improve the packet delivery ratio (PDR) performance through a proposed coati optimal Q‐reinforcement learning (CO_QRL) model. Here, Q‐reinforcement learning is utilized to learn the information about nodes, and the coati optimization algorithm (COA) helps to choose the optimal action for enhancing the reward. In the proposed scheduling algorithm, the weighted sum of successfully received packets is treated as a reward, and the server allocates resources to maximize this Q‐reward. The evaluation of the proposed method based on PDR, packet success ratio (PSR), packet collision rate (PCR), time, delay, and energy accomplished the values of 0.917, 0.759, 0.253, 85, 0.029, 7.89, and 10.08, respectively.
摘要 随着联网物联网设备数量的快速增长,预计未来物联网(IoT)连接数将超过 200 亿。低功耗广域网(LPWAN)具有功耗低、覆盖范围广等特点,因此在新模式下显得尤为重要。长距离广域网(LoRaWAN)是这些网络中最诱人的技术进步之一。虽然它是最发达的 LPWAN 平台之一,但仍存在一些尚未解决的问题,如容量限制。因此,本研究利用深度强化学习为 LoRAWAN 网络引入了一种新型资源调度技术。在这里,通过强化技术学习 LoRaWAN 节点的信息,并利用这些知识来分配资源,从而通过提出的 coati 最佳 Q 强化学习(CO_QRL)模型提高数据包传输率(PDR)性能。在这里,Q 强化学习被用来学习节点信息,而 coati 优化算法(COA)则帮助选择最优行动以提高奖励。在所提出的调度算法中,成功接收的数据包的加权和被视为一种奖励,服务器分配资源以最大化这种 Q 奖励。根据 PDR、数据包成功率 (PSR)、数据包碰撞率 (PCR)、时间、延迟和能量对所提方法进行了评估,结果分别为 0.917、0.759、0.253、85、0.029、7.89 和 10.08。
{"title":"An efficient resource scheduling mechanism in LoRaWAN environment using coati optimal Q‐reinforcement learning","authors":"J Uma Mahesh, Judhistir Mahapatro","doi":"10.1002/dac.5965","DOIUrl":"https://doi.org/10.1002/dac.5965","url":null,"abstract":"SummaryIt is estimated that there will be over two dozen billion Internet of Things (IoT) connections in the future as the number of connected IoT devices grows rapidly. Due to characteristics like low power consumption and extensive coverage, low‐power wide area networks (LPWANs) have become particularly relevant for the new paradigm. Long range wide area network (LoRaWAN) is one of the most alluring technological advances in these networks. Although it is one of the most developed LPWAN platforms, there are still unresolved issues, such as capacity limitations. Hence, this research introduces a novel resource scheduling technique for the LoRAWAN network using deep reinforcement learning. Here, the information on the LoRaWAN nodes is learned by the reinforcement technique, and the knowledge is utilized to allocate resources to improve the packet delivery ratio (PDR) performance through a proposed coati optimal Q‐reinforcement learning (CO_QRL) model. Here, Q‐reinforcement learning is utilized to learn the information about nodes, and the coati optimization algorithm (COA) helps to choose the optimal action for enhancing the reward. In the proposed scheduling algorithm, the weighted sum of successfully received packets is treated as a reward, and the server allocates resources to maximize this Q‐reward. The evaluation of the proposed method based on PDR, packet success ratio (PSR), packet collision rate (PCR), time, delay, and energy accomplished the values of 0.917, 0.759, 0.253, 85, 0.029, 7.89, and 10.08, respectively.","PeriodicalId":13946,"journal":{"name":"International Journal of Communication Systems","volume":"67 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142196560","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An efficient hybrid bat sand cat swarm optimization‐based node localization for data quality improvement in wireless sensor networks 基于蝙蝠沙猫蜂群优化的高效混合节点定位,用于提高无线传感器网络的数据质量
IF 2.1 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC Pub Date : 2024-08-22 DOI: 10.1002/dac.5961
Dasappagounden Pudur Velusamy Soundari, Poongodi Chenniappan
SummaryNode localization in wireless sensor networks (WSNs) ensures that the collected data is contextually accurate, enabling effective monitoring and management of various applications. Recently, there has been a surge in research focused on addressing node localization within WSNs. Emerging trends in this field involve the application of metaheuristic optimization techniques to refine node location determination accuracy. However, existing techniques often struggle with balancing accuracy, energy consumption, network lifetime, and computational efficiency, particularly in challenging WSN environments. Therefore, this research introduces a novel approach called efficient hybrid bat sand cat swarm optimization (EHBSCSO) to address node localization within WSNs. The hybrid method leverages the exploration capabilities of the bat optimization algorithm and the exploitation strengths of the sand cat swarm optimization algorithm. This combination allows for efficient determination of node positions, significantly improving localization accuracy while minimizing energy consumption. The EHBSCSO utilizes the received signal strength indicator (RSSI) and time of flight (ToF) approaches to assess distances among nodes accurately. Accurate node localization directly improves data quality by ensuring spatially precise data collection, reducing communication overhead, and enhancing the overall reliability of the collected data. Compared to conventional methods, the proposed EHBSCSO algorithm demonstrates superior performance, with a mean localization error of 0.18%, energy consumption of 7.2 J, computational time of 8.9 s, and localization time of 0.19 s. These metrics underscore its efficiency and precision. The research indicates that EHBSCSO not only optimizes localization accuracy but also contributes to energy efficiency and faster computational times, addressing key challenges in WSN node localization.
摘要无线传感器网络(WSN)中的节点定位可确保所收集数据的上下文准确性,从而实现对各种应用的有效监控和管理。最近,针对 WSN 中节点定位问题的研究激增。该领域的新趋势是应用元启发式优化技术来提高节点定位的准确性。然而,现有技术往往难以在精度、能耗、网络寿命和计算效率之间取得平衡,尤其是在具有挑战性的 WSN 环境中。因此,本研究引入了一种名为高效混合蝙蝠沙猫蜂群优化(EHBSCSO)的新方法来解决 WSN 中的节点定位问题。这种混合方法充分利用了蝙蝠优化算法的探索能力和沙猫群优化算法的开发优势。这种组合可有效确定节点位置,在最大限度降低能耗的同时显著提高定位精度。EHBSCSO 利用接收信号强度指示器(RSSI)和飞行时间(ToF)方法来准确评估节点之间的距离。精确的节点定位可确保空间上精确的数据采集、减少通信开销并提高采集数据的整体可靠性,从而直接提高数据质量。与传统方法相比,所提出的 EHBSCSO 算法性能优越,平均定位误差为 0.18%,能耗为 7.2 J,计算时间为 8.9 s,定位时间为 0.19 s。研究表明,EHBSCSO 不仅能优化定位精度,还有助于提高能效和缩短计算时间,从而解决 WSN 节点定位中的关键难题。
{"title":"An efficient hybrid bat sand cat swarm optimization‐based node localization for data quality improvement in wireless sensor networks","authors":"Dasappagounden Pudur Velusamy Soundari, Poongodi Chenniappan","doi":"10.1002/dac.5961","DOIUrl":"https://doi.org/10.1002/dac.5961","url":null,"abstract":"SummaryNode localization in wireless sensor networks (WSNs) ensures that the collected data is contextually accurate, enabling effective monitoring and management of various applications. Recently, there has been a surge in research focused on addressing node localization within WSNs. Emerging trends in this field involve the application of metaheuristic optimization techniques to refine node location determination accuracy. However, existing techniques often struggle with balancing accuracy, energy consumption, network lifetime, and computational efficiency, particularly in challenging WSN environments. Therefore, this research introduces a novel approach called efficient hybrid bat sand cat swarm optimization (EHBSCSO) to address node localization within WSNs. The hybrid method leverages the exploration capabilities of the bat optimization algorithm and the exploitation strengths of the sand cat swarm optimization algorithm. This combination allows for efficient determination of node positions, significantly improving localization accuracy while minimizing energy consumption. The EHBSCSO utilizes the received signal strength indicator (RSSI) and time of flight (ToF) approaches to assess distances among nodes accurately. Accurate node localization directly improves data quality by ensuring spatially precise data collection, reducing communication overhead, and enhancing the overall reliability of the collected data. Compared to conventional methods, the proposed EHBSCSO algorithm demonstrates superior performance, with a mean localization error of 0.18%, energy consumption of 7.2 J, computational time of 8.9 s, and localization time of 0.19 s. These metrics underscore its efficiency and precision. The research indicates that EHBSCSO not only optimizes localization accuracy but also contributes to energy efficiency and faster computational times, addressing key challenges in WSN node localization.","PeriodicalId":13946,"journal":{"name":"International Journal of Communication Systems","volume":"67 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142196559","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
International Journal of Communication Systems
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1