International Journal of Pervasive Computing and Communications最新文献

筛选
英文 中文
A novel Internet of Things and federated learning-based privacy protection in blockchain technology 一种新型物联网和基于联合学习的区块链技术隐私保护
IF 2.6
International Journal of Pervasive Computing and Communications Pub Date : 2022-08-10 DOI: 10.1108/ijpcc-03-2022-0123
Shoayee Alotaibi
{"title":"A novel Internet of Things and federated learning-based privacy protection in blockchain technology","authors":"Shoayee Alotaibi","doi":"10.1108/ijpcc-03-2022-0123","DOIUrl":"https://doi.org/10.1108/ijpcc-03-2022-0123","url":null,"abstract":"\u0000Purpose\u0000Be that as it may, BC is computationally costly, has restricted versatility and brings about critical transmission capacity upward and postpones, those seems not to be fit with Internet of Things (IoT) setting. A lightweight scalable blockchain (LSB) which is improved toward IoT necessities is suggested by the authors and investigates LSB within brilliant house setup like an agent model to enable more extensive IoT apps. Less asset gadgets inside brilliant house advantage via any unified chief which lays out common units for correspondence also cycles generally approaching and active solicitations.\u0000\u0000\u0000Design/methodology/approach\u0000Federated learning and blockchain (BC) have drawn in huge consideration due to the unchanging property and the relevant safety measure and protection benefits. FL and IoT safety measures’ difficulties can be conquered possibly by BC.\u0000\u0000\u0000Findings\u0000LSB accomplishes fragmentation through shaping any overlaid web with more asset gadgets mutually deal with a public BC and federated learning which assures complete protection also security.\u0000\u0000\u0000Originality/value\u0000This overlaid is coordinated as without error bunches and reduces extra efforts, also batch leader will be with answer to handle commonly known BCs. LSB joins some of advancements which also includes computations related to lesser weighing agreement, optimal belief also throughput regulatory body.\u0000","PeriodicalId":43952,"journal":{"name":"International Journal of Pervasive Computing and Communications","volume":null,"pages":null},"PeriodicalIF":2.6,"publicationDate":"2022-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42345909","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Video compression based on zig-zag 3D DCT and run-length encoding for multimedia communication systems 基于Z字形三维DCT和游程编码的多媒体通信系统视频压缩
IF 2.6
International Journal of Pervasive Computing and Communications Pub Date : 2022-07-25 DOI: 10.1108/ijpcc-01-2022-0012
Sravanthi Chutke, Nandhitha. N.M, Praveen Kumar Lendale
{"title":"Video compression based on zig-zag 3D DCT and run-length encoding for multimedia communication systems","authors":"Sravanthi Chutke, Nandhitha. N.M, Praveen Kumar Lendale","doi":"10.1108/ijpcc-01-2022-0012","DOIUrl":"https://doi.org/10.1108/ijpcc-01-2022-0012","url":null,"abstract":"\u0000Purpose\u0000With the advent of technology, a huge amount of data is being transmitted and received through the internet. Large bandwidth and storage are required for the exchange of data and storage, respectively. Hence, compression of the data which is to be transmitted over the channel is unavoidable. The main purpose of the proposed system is to use the bandwidth effectively. The videos are compressed at the transmitter’s end and reconstructed at the receiver’s end. Compression techniques even help for smaller storage requirements.\u0000\u0000\u0000Design/methodology/approach\u0000The paper proposes a novel compression technique for three-dimensional (3D) videos using a zig-zag 3D discrete cosine transform. The method operates a 3D discrete cosine transform on the videos, followed by a zig-zag scanning process. Finally, to convert the data into a single bit stream for transmission, a run-length encoding technique is used. The videos are reconstructed by using the inverse 3D discrete cosine transform, inverse zig-zag scanning (quantization) and inverse run length coding techniques. The proposed method is simple and reduces the complexity of the convolutional techniques.\u0000\u0000\u0000Findings\u0000Coding reduction, code word reduction, peak signal to noise ratio (PSNR), mean square error, compression percent and compression ratio values are calculated, and the dominance of the proposed method over the convolutional methods is seen.\u0000\u0000\u0000Originality/value\u0000With zig-zag quantization and run length encoding using 3D discrete cosine transform for 3D video compression, gives compression up to 90% with a PSNR of 41.98 dB. The proposed method can be used in multimedia applications where bandwidth, storage and data expenses are the major issues.\u0000","PeriodicalId":43952,"journal":{"name":"International Journal of Pervasive Computing and Communications","volume":null,"pages":null},"PeriodicalIF":2.6,"publicationDate":"2022-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44569105","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Development of cloud selection supporting model for green information and communication technology services 绿色信息通信技术服务云选择支持模型的开发
IF 2.6
International Journal of Pervasive Computing and Communications Pub Date : 2022-07-21 DOI: 10.1108/ijpcc-03-2022-0127
Sanjiv Rao Godla, J. Haro, Suresh Ch, R. Krishna
{"title":"Development of cloud selection supporting model for green information and communication technology services","authors":"Sanjiv Rao Godla, J. Haro, Suresh Ch, R. Krishna","doi":"10.1108/ijpcc-03-2022-0127","DOIUrl":"https://doi.org/10.1108/ijpcc-03-2022-0127","url":null,"abstract":"\u0000Purpose\u0000The purpose of the study is to develop a cloud supporting model for green computing. In today's contemporary world, information technology (IT) plays a significant role. Because of the rapid growth of the IT business and the high level of greenhouse gas emissions, salient data centers are increasingly considering green IT techniques to reduce their environmental impacts. Both developing and underdeveloped countries are widely adopting green infrastructure and services over the cloud because of its cost-effectiveness, scalability and guaranteed high uptime. Several studies have investigated the fact that cloud computing provides beyond green information and communication technology (ICT) services and solutions. Therefore, anything offered over clouds also needs to be green to reduce the adverse influence on the environment.\u0000\u0000\u0000Design/methodology/approach\u0000This paper examines the rationale for the use of green ICT in higher education and finds crucial success variables for the implementation of green ICT on the basis of an analysis of chosen educational organizations and interviews with key academic experts from the Universities of Ethiopia, in general, and BuleHora University, in particular.\u0000\u0000\u0000Findings\u0000Finally, this paper described the design and development of a green cloud selection supporting model for green ICTs in higher educational institutions that helps cloud service customers choose the most green cloud-based ICT products as well as services.\u0000\u0000\u0000Originality/value\u0000This study may be a significant source of new information for green ICT design and implementation in higher education institutions to preserve the environment and its impact on human life.\u0000","PeriodicalId":43952,"journal":{"name":"International Journal of Pervasive Computing and Communications","volume":null,"pages":null},"PeriodicalIF":2.6,"publicationDate":"2022-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43132020","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Federated learning algorithm based on matrix mapping for data privacy over edge computing 基于矩阵映射的边缘计算数据隐私联合学习算法
IF 2.6
International Journal of Pervasive Computing and Communications Pub Date : 2022-07-14 DOI: 10.1108/ijpcc-03-2022-0113
P. Tripathy, Anurag Shrivastava, Varsha Agarwal, Devangkumar Umakant Shah, C. L, S. .. Akilandeeswari
{"title":"Federated learning algorithm based on matrix mapping for data privacy over edge computing","authors":"P. Tripathy, Anurag Shrivastava, Varsha Agarwal, Devangkumar Umakant Shah, C. L, S. .. Akilandeeswari","doi":"10.1108/ijpcc-03-2022-0113","DOIUrl":"https://doi.org/10.1108/ijpcc-03-2022-0113","url":null,"abstract":"\u0000Purpose\u0000This paper aims to provide the security and privacy for Byzantine clients from different types of attacks.\u0000\u0000\u0000Design/methodology/approach\u0000In this paper, the authors use Federated Learning Algorithm Based On Matrix Mapping For Data Privacy over Edge Computing.\u0000\u0000\u0000Findings\u0000By using Softmax layer probability distribution for model byzantine tolerance can be increased from 40% to 45% in the blocking-convergence attack, and the edge backdoor attack can be stopped.\u0000\u0000\u0000Originality/value\u0000By using Softmax layer probability distribution for model the results of the tests, the aggregation method can protect at least 30% of Byzantine clients.\u0000","PeriodicalId":43952,"journal":{"name":"International Journal of Pervasive Computing and Communications","volume":null,"pages":null},"PeriodicalIF":2.6,"publicationDate":"2022-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43684701","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Federate learning of corporate social authority and industry 4.0 that focus on young people: a strategic management framework for human resources 以年轻人为中心的企业社会权威与工业4.0联合学习:人力资源战略管理框架
IF 2.6
International Journal of Pervasive Computing and Communications Pub Date : 2022-07-12 DOI: 10.1108/ijpcc-02-2022-0056
V. Sriram, M. Sikandar, Eti Khatri, S. Choubey, Ity Patni, L. K., K. Gulati
{"title":"Federate learning of corporate social authority and industry 4.0 that focus on young people: a strategic management framework for human resources","authors":"V. Sriram, M. Sikandar, Eti Khatri, S. Choubey, Ity Patni, L. K., K. Gulati","doi":"10.1108/ijpcc-02-2022-0056","DOIUrl":"https://doi.org/10.1108/ijpcc-02-2022-0056","url":null,"abstract":"\u0000Purpose\u0000The young population of the globe is defined by individuals aged 15 to 24 years. Based on statistics from the Instituto Brasileiro de Geografia e Estatística (IBGE), the second largest women population among 15 years as well as 19 years was in 2017 only behind 35 and 39 years. At this time, the Brazilian male population was higher. The difficulties of the young generation affected the preceding generation and promoted social dynamism. The worldwide data shows that the generation of young and the digital world have been constantly sought, but in reality, approximately one-third of the population in 2017 had no access to the internet.\u0000\u0000\u0000Design/methodology/approach\u0000The worldwide movement around topics such as strategy on its threefold basis and Industry 4.0 enable a link to company duty towards society to be established. This present study was produced from 1 March 2020 to 2 September 2020 via resources of human and literature evaluation relating to the idea of strategic, Industry 4.0, the responsibility of society and the creation of youth. Its motive is the global creation of youth. Two recommendations should be made after studying the literature and information gathering that enabled “analyzing social responsibility of the company and industry 4.0 with a pivot on young creation: a strategic framework for resources of human management”.\u0000\u0000\u0000Findings\u0000The adoption of defensible practices and technology bring forth by the revolution in industrial is emphasized worldwide.\u0000\u0000\u0000Originality/value\u0000The focus on the usage of these ideas is essential, so that young people can absorb the workforce in the labour market. To achieve this, the CSR idea combines this theoretical triple-created recent study.\u0000","PeriodicalId":43952,"journal":{"name":"International Journal of Pervasive Computing and Communications","volume":null,"pages":null},"PeriodicalIF":2.6,"publicationDate":"2022-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42434799","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Energy efficient multi-tasking for edge computing using federated learning 使用联邦学习的边缘计算节能多任务
IF 2.6
International Journal of Pervasive Computing and Communications Pub Date : 2022-07-08 DOI: 10.1108/ijpcc-03-2022-0106
Mukesh Soni, N. Nayak, Ashima Kalra, S. Degadwala, Nikhil Kumar Singh, Shweta Singh
{"title":"Energy efficient multi-tasking for edge computing using federated learning","authors":"Mukesh Soni, N. Nayak, Ashima Kalra, S. Degadwala, Nikhil Kumar Singh, Shweta Singh","doi":"10.1108/ijpcc-03-2022-0106","DOIUrl":"https://doi.org/10.1108/ijpcc-03-2022-0106","url":null,"abstract":"\u0000Purpose\u0000The purpose of this paper is to improve the existing paradigm of edge computing to maintain a balanced energy usage.\u0000\u0000\u0000Design/methodology/approach\u0000The new greedy algorithm is proposed to balance the energy consumption in edge computing.\u0000\u0000\u0000Findings\u0000The new greedy algorithm can balance energy more efficiently than the random approach by an average of 66.59 percent.\u0000\u0000\u0000Originality/value\u0000The results are shown in this paper which are better as compared to existing algorithms.\u0000","PeriodicalId":43952,"journal":{"name":"International Journal of Pervasive Computing and Communications","volume":null,"pages":null},"PeriodicalIF":2.6,"publicationDate":"2022-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47170438","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
IIBES: a proposed framework to improve the identity-based encryption system for securing federated learning IIBES:一个改进基于身份的加密系统以确保联邦学习安全的拟议框架
IF 2.6
International Journal of Pervasive Computing and Communications Pub Date : 2022-06-24 DOI: 10.1108/ijpcc-02-2022-0073
Maitri Patel, Rajan Patel, Nimisha Patel, P. Shah, K. Gulati
{"title":"IIBES: a proposed framework to improve the identity-based encryption system for securing federated learning","authors":"Maitri Patel, Rajan Patel, Nimisha Patel, P. Shah, K. Gulati","doi":"10.1108/ijpcc-02-2022-0073","DOIUrl":"https://doi.org/10.1108/ijpcc-02-2022-0073","url":null,"abstract":"\u0000Purpose\u0000In the field of cryptography, authentication, secrecy and identification can be accomplished by use of secret keys for any computer-based system. The need to acquire certificates endorsed through CA to substantiate users for the barter of encoded communications is one of the most significant constraints for the extensive recognition of PKC, as the technique takes too much time and susceptible to error. PKC’s certificate and key management operating costs are reduced with IBC. IBE is a crucial primeval in IBC. The thought behind presenting the IBE scheme was to diminish the complexity of certificate and key management, but it also gives rise to key escrow and key revocation problem, which provides access to unauthorised users for the encrypted information.\u0000\u0000\u0000Design/methodology/approach\u0000This paper aims to compare the result of IIBES with the existing system and to provide security analysis for the same and the proposed system can be used for the security in federated learning.\u0000\u0000\u0000Findings\u0000Furthermore, it can be implemented using other encryption/decryption algorithms like elliptic curve cryptography (ECC) to compare the execution efficiency. The proposed system can be used for the security in federated learning.\u0000\u0000\u0000Originality/value\u0000As a result, a novel enhanced IBE scheme: IIBES is suggested and implemented in JAVA programming language using RSA algorithm, which eradicates the key escrow problem through eliminating the need for a KGC and key revocation problem by sing sub-KGC (SKGC) and a shared secret with nonce. IIBES also provides authentication through IBS as well as it can be used for securing the data in federated learning.\u0000","PeriodicalId":43952,"journal":{"name":"International Journal of Pervasive Computing and Communications","volume":null,"pages":null},"PeriodicalIF":2.6,"publicationDate":"2022-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44933815","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An optimized and efficient multiuser data sharing using the selection scheme design secure approach and federated learning in cloud environment 利用选择方案设计安全方法和云环境下的联合学习,优化高效的多用户数据共享
IF 2.6
International Journal of Pervasive Computing and Communications Pub Date : 2022-06-22 DOI: 10.1108/ijpcc-02-2022-0047
Shubangini Patil, Rekha Patil
{"title":"An optimized and efficient multiuser data sharing using the selection scheme design secure approach and federated learning in cloud environment","authors":"Shubangini Patil, Rekha Patil","doi":"10.1108/ijpcc-02-2022-0047","DOIUrl":"https://doi.org/10.1108/ijpcc-02-2022-0047","url":null,"abstract":"\u0000Purpose\u0000Until now, a lot of research has been done and applied to provide security and original data from one user to another, such as third-party auditing and several schemes for securing the data, such as the generation of the key with the help of encryption algorithms like Rivest–Shamir–Adleman and others. Here are some of the related works that have been done previously. Remote damage control resuscitation (RDCR) scheme by Yan et al. (2017) is proposed based on the minimum bandwidth. By enabling the third party to perform the verification of public integrity. Although it supports the repair management for the corrupt data and tries to recover the original data, in practicality it fails to do so, and thus it takes more computation and communication cost than our proposed system. In a paper by Chen et al. (2015), using broadcast encryption, an idea for cloud storage data sharing has been developed. This technique aims to accomplish both broadcast data and dynamic sharing, allowing users to join and leave a group without affecting the electronic press kit (EPK). In this case, the theoretical notion was true and new, but the system’s practicality and efficiency were not acceptable, and the system’s security was also jeopardised because it proposed adding a member without altering any keys. In this research, an identity-based encryption strategy for data sharing was investigated, as well as key management and metadata techniques to improve model security (Jiang and Guo, 2017). The forward and reverse ciphertext security is supplied here. However, it is more difficult to put into practice, and one of its limitations is that it can only be used for very large amounts of cloud storage. Here, it extends support for dynamic data modification by batch auditing. The important feature of the secure and efficient privacy preserving provable data possession in cloud storage scheme was to support every important feature which includes data dynamics, privacy preservation, batch auditing and blockers verification for an untrusted and an outsourced storage model (Pathare and Chouragadec, 2017). A homomorphic signature mechanism was devised to prevent the usage of the public key certificate, which was based on the new id. This signature system was shown to be resistant to the id attack on the random oracle model and the assault of forged message (Nayak and Tripathy, 2018; Lin et al., 2017). When storing data in a public cloud, one issue is that the data owner must give an enormous number of keys to the users in order for them to access the files. At this place, the knowledge assisted software engineering (KASE) plan was publicly unveiled for the first time. While sharing a huge number of documents, the data owner simply has to supply the specific key to the user, and the user only needs to provide the single trapdoor. Although the concept is innovative, the KASE technique does not apply to the increasingly common manufactured cloud. Cui et al. (2016) claim that","PeriodicalId":43952,"journal":{"name":"International Journal of Pervasive Computing and Communications","volume":null,"pages":null},"PeriodicalIF":2.6,"publicationDate":"2022-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44543744","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
AI-federated novel delay-aware link-scheduling for Industry 4.0 applications in IoT networks 物联网网络中工业4.0应用的ai联合新型延迟感知链路调度
IF 2.6
International Journal of Pervasive Computing and Communications Pub Date : 2022-06-22 DOI: 10.1108/ijpcc-12-2021-0297
Suvarna Patil, Prasad Gokhale
{"title":"AI-federated novel delay-aware link-scheduling for Industry 4.0 applications in IoT networks","authors":"Suvarna Patil, Prasad Gokhale","doi":"10.1108/ijpcc-12-2021-0297","DOIUrl":"https://doi.org/10.1108/ijpcc-12-2021-0297","url":null,"abstract":"\u0000Purpose\u0000With the advent of AI-federated technologies, it is feasible to perform complex tasks in industrial Internet of Things (IIoT) environment by enhancing throughput of the network and by reducing the latency of transmitted data. The communications in IIoT and Industry 4.0 requires handshaking of multiple technologies for supporting heterogeneous networks and diverse protocols. IIoT applications may gather and analyse sensor data, allowing operators to monitor and manage production systems, resulting in considerable performance gains in automated processes. All IIoT applications are responsible for generating a vast set of data based on diverse characteristics. To obtain an optimum throughput in an IIoT environment requires efficiently processing of IIoT applications over communication channels. Because computing resources in the IIoT are limited, equitable resource allocation with the least amount of delay is the need of the IIoT applications. Although some existing scheduling strategies address delay concerns, faster transmission of data and optimal throughput should also be addressed along with the handling of transmission delay. Hence, this study aims to focus on a fair mechanism to handle throughput, transmission delay and faster transmission of data. The proposed work provides a link-scheduling algorithm termed as delay-aware resource allocation that allocates computing resources to computational-sensitive tasks by reducing overall latency and by increasing the overall throughput of the network. First of all, a multi-hop delay model is developed with multistep delay prediction using AI-federated neural network long–short-term memory (LSTM), which serves as a foundation for future design. Then, link-scheduling algorithm is designed for data routing in an efficient manner. The extensive experimental results reveal that the average end-to-end delay by considering processing, propagation, queueing and transmission delays is minimized with the proposed strategy. Experiments show that advances in machine learning have led to developing a smart, collaborative link scheduling algorithm for fairness-driven resource allocation with minimal delay and optimal throughput. The prediction performance of AI-federated LSTM is compared with the existing approaches and it outperforms over other techniques by achieving 98.2% accuracy.\u0000\u0000\u0000Design/methodology/approach\u0000With an increase of IoT devices, the demand for more IoT gateways has increased, which increases the cost of network infrastructure. As a result, the proposed system uses low-cost intermediate gateways in this study. Each gateway may use a different communication technology for data transmission within an IoT network. As a result, gateways are heterogeneous, with hardware support limited to the technologies associated with the wireless sensor networks. Data communication fairness at each gateway is achieved in an IoT network by considering dynamic IoT traffic and link-scheduling problems to achi","PeriodicalId":43952,"journal":{"name":"International Journal of Pervasive Computing and Communications","volume":null,"pages":null},"PeriodicalIF":2.6,"publicationDate":"2022-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43806530","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Hybrid cumulative approach for localization of nodes with adaptive threshold gradient feature on energy minimization using federated learning 基于联合学习的能量最小化自适应阈值梯度节点定位的混合累积方法
IF 2.6
International Journal of Pervasive Computing and Communications Pub Date : 2022-06-17 DOI: 10.1108/ijpcc-02-2022-0045
A. I., K. Selvakumar
{"title":"Hybrid cumulative approach for localization of nodes with adaptive threshold gradient feature on energy minimization using federated learning","authors":"A. I., K. Selvakumar","doi":"10.1108/ijpcc-02-2022-0045","DOIUrl":"https://doi.org/10.1108/ijpcc-02-2022-0045","url":null,"abstract":"\u0000Purpose\u0000Localization of the nodes is crucial for gaining access of different nodes which would provision in extreme areas where networks are unreachable. The feature of localization of nodes has become a significant study where multiple features on distance model are implicated on predictive and heuristic model for each set of localization parameters that govern the design on energy minimization with proposed adaptive threshold gradient feature (ATGF) model. A received signal strength indicator (RSSI) model with node estimated features is implicated with localization problem and enhanced with hybrid cumulative approach (HCA) algorithm for node optimizations with distance predicting.\u0000\u0000\u0000Design/methodology/approach\u0000Using a theoretical or empirical signal propagation model, the RSSI (known transmitting power) is converted to distance, the received power (measured at the receiving node) is converted to distance and the distance is converted to RSSI (known receiving power). As a result, the approximate distance between the transceiver node and the receiver may be determined by measuring the intensity of the received signal. After acquiring information on the distance between the anchor node and the unknown node, the location of the unknown node may be determined using either the trilateral technique or the maximum probability estimate approach, depending on the circumstances using federated learning.\u0000\u0000\u0000Findings\u0000Improvisation of localization for wireless sensor network has become one of the prime design features for estimating the different conditional changes externally and internally. One such feature of improvement is observed in this paper, via HCA where each feature of localization is depicted with machine learning algorithms imparting the energy reduction problem for each newer localized nodes in Section 5. All affected parametric features on energy levels and localization problem for newer and extinct nodes are implicated with hybrid cumulative approach as in Section 4. The proposed algorithm (HCA with AGTF) has implicated with significant change in energy levels of nodes which are generated newly and which are non-active for a stipulated time which are mentioned and tabulated in figures and tables in Section 6.\u0000\u0000\u0000Originality/value\u0000Localization of the nodes is crucial for gaining access of different nodes which would provision in extreme areas where networks are unreachable. The feature of localization of nodes has become a significant study where multiple features on distance model are implicated on predictive and heuristic model for each set of localization parameters that govern the design on energy minimization with proposed ATGF model. An RSSI model with node estimated features is implicated with localization problem and enhanced with HCA algorithm for node optimizations with distance predicting.\u0000","PeriodicalId":43952,"journal":{"name":"International Journal of Pervasive Computing and Communications","volume":null,"pages":null},"PeriodicalIF":2.6,"publicationDate":"2022-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42247435","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信