Pub Date : 2023-09-28DOI: 10.5121/ijcnc.2023.15502
Mohammad Javad Abbasi, A. S Abdullah, N Fisal
Efficient protection techniques for multimedia data transfer over Wireless Sensor Network (WSN) are very essential issues. In noisy Wireless Multimedia Sensor Networks (WMSN) Quality of Service (QoS) is a challenging task due to bandwidth and limited energy, and unpredictable channel conditions. Therefore, Forward Error Correction (FEC), a class of channel coding has been widely used in WSN. Nevertheless, the bulky size of multimedia data makes it more difficult to be transported over the noisy multi-hop wireless network. Moreover, the efficiency of FEC drops as the number of hops increases. In this paper, an optimized protection technique based on network coding and rateless code has been proposed to enhance the throughput and reduce overhead during data transfer in WMSN. The performance of NCP-OPR is enhanced via Optimal Network Path Model (ONPM) where the best available paths are optimally selected using Particle Swarm Optimization (PSO). In conjunction with the proposed protection scheme, the proposed ONPM is intended for limited power WSN by optimally distributing the power usage among the network paths so that the throughput can be improved.
{"title":"Optimize the Network Coding Paths to Enhance the Coding Protection in Wireless Multimedia Sensor Network","authors":"Mohammad Javad Abbasi, A. S Abdullah, N Fisal","doi":"10.5121/ijcnc.2023.15502","DOIUrl":"https://doi.org/10.5121/ijcnc.2023.15502","url":null,"abstract":"Efficient protection techniques for multimedia data transfer over Wireless Sensor Network (WSN) are very essential issues. In noisy Wireless Multimedia Sensor Networks (WMSN) Quality of Service (QoS) is a challenging task due to bandwidth and limited energy, and unpredictable channel conditions. Therefore, Forward Error Correction (FEC), a class of channel coding has been widely used in WSN. Nevertheless, the bulky size of multimedia data makes it more difficult to be transported over the noisy multi-hop wireless network. Moreover, the efficiency of FEC drops as the number of hops increases. In this paper, an optimized protection technique based on network coding and rateless code has been proposed to enhance the throughput and reduce overhead during data transfer in WMSN. The performance of NCP-OPR is enhanced via Optimal Network Path Model (ONPM) where the best available paths are optimally selected using Particle Swarm Optimization (PSO). In conjunction with the proposed protection scheme, the proposed ONPM is intended for limited power WSN by optimally distributing the power usage among the network paths so that the throughput can be improved.","PeriodicalId":37554,"journal":{"name":"International Journal of Computer Networks and Communications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135470330","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}
Pub Date : 2023-09-28DOI: 10.5121/ijcnc.2023.15508
Maurizio D’Arienzo, Serena Gracco
Content Delivery Networks (CDN), or ”content distribution networks” have been introduced to improve performance, scalability, and security of data distributed through the web. To reduce the response time of a web page when certain content is requested, the CDN redirects requests from users’ browsers to geographically distributed surrogate nodes, thus having a positive impact on the response time and network load. As a side effect, the surrogate servers manage possible attacks, especially denial of service attacks, by distributing the considerable amount of traffic generated by malicious activities among different data centers. Some CDNs provide additional services to normalize traffic and filter intrusion attacks, thus further mitigating the effects of possible unpleasant scenarios. Despite the presence of these native protective mechanisms, a malicious user can undermine the stability of a CDN by generating a disproportionate amount of traffic within a CDN thanks to endless cycles of requests circulating between nodes of the same network or between several distinct networks. We refer in particular to Forwarding Loops Attacks, a collection of techniques that can alter the regular forwarding process inside CDNs. In this paper, we analyze the vulnerability of some commercial CDNs to this type of attacks and then propose some possible useful defensive strategies.
{"title":"A Survey on CDN Vulnerability to DoS Attacks","authors":"Maurizio D’Arienzo, Serena Gracco","doi":"10.5121/ijcnc.2023.15508","DOIUrl":"https://doi.org/10.5121/ijcnc.2023.15508","url":null,"abstract":"Content Delivery Networks (CDN), or ”content distribution networks” have been introduced to improve performance, scalability, and security of data distributed through the web. To reduce the response time of a web page when certain content is requested, the CDN redirects requests from users’ browsers to geographically distributed surrogate nodes, thus having a positive impact on the response time and network load. As a side effect, the surrogate servers manage possible attacks, especially denial of service attacks, by distributing the considerable amount of traffic generated by malicious activities among different data centers. Some CDNs provide additional services to normalize traffic and filter intrusion attacks, thus further mitigating the effects of possible unpleasant scenarios. Despite the presence of these native protective mechanisms, a malicious user can undermine the stability of a CDN by generating a disproportionate amount of traffic within a CDN thanks to endless cycles of requests circulating between nodes of the same network or between several distinct networks. We refer in particular to Forwarding Loops Attacks, a collection of techniques that can alter the regular forwarding process inside CDNs. In this paper, we analyze the vulnerability of some commercial CDNs to this type of attacks and then propose some possible useful defensive strategies.","PeriodicalId":37554,"journal":{"name":"International Journal of Computer Networks and Communications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135470156","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}
Pub Date : 2023-09-28DOI: 10.5121/ijcnc.2023.15506
M, Adarsha, Malathi, S., Kumar, Santosh
In this article, the performance of a fixed grid network is examined for various modulation formats to estimate the system's capacity and spectral efficiency. The optical In-phase Quadrature Modulator (IQM) structure is used to build a fixed grid network modulation, and the homodyne detection approach is used for the receiver. Data multiplexing is accomplished using the Polarization Division Multiplexed (PDM) technology. 100 Gbps, 150 Gbps, and 200 Gbps data rates are transmitted under these circumstances utilizing various modulation formats. Various pre-processing and signal recovery steps are explained by using modern digital signal processing systems. The achieved spectrum efficiencies for PM-QPSK, PM-8 QAM, and PM-16 QAM, respectively, were 2, 3, and 4 (bits/s)/Hz. Different modulation like PM-QPSK, PM-8-QAM, and PM-16-QAM each has system capacities of 8-9, 12-13.5, and 16-18 Tbps and it reaches transmission distances of 3000, 1300, and 700 kilometers with acceptable Bit Error Rate (BER≤ 2× 10-3 ) respectively. Peak optical power for received signal detection and full width at half maximum is noted for the different modulations under a fixed grind network.
{"title":"Analysis of System Capacity and Spectral Efficiency of Fixed-Grid Network","authors":"M, Adarsha, Malathi, S., Kumar, Santosh","doi":"10.5121/ijcnc.2023.15506","DOIUrl":"https://doi.org/10.5121/ijcnc.2023.15506","url":null,"abstract":"In this article, the performance of a fixed grid network is examined for various modulation formats to estimate the system's capacity and spectral efficiency. The optical In-phase Quadrature Modulator (IQM) structure is used to build a fixed grid network modulation, and the homodyne detection approach is used for the receiver. Data multiplexing is accomplished using the Polarization Division Multiplexed (PDM) technology. 100 Gbps, 150 Gbps, and 200 Gbps data rates are transmitted under these circumstances utilizing various modulation formats. Various pre-processing and signal recovery steps are explained by using modern digital signal processing systems. The achieved spectrum efficiencies for PM-QPSK, PM-8 QAM, and PM-16 QAM, respectively, were 2, 3, and 4 (bits/s)/Hz. Different modulation like PM-QPSK, PM-8-QAM, and PM-16-QAM each has system capacities of 8-9, 12-13.5, and 16-18 Tbps and it reaches transmission distances of 3000, 1300, and 700 kilometers with acceptable Bit Error Rate (BER≤ 2× 10-3 ) respectively. Peak optical power for received signal detection and full width at half maximum is noted for the different modulations under a fixed grind network.","PeriodicalId":37554,"journal":{"name":"International Journal of Computer Networks and Communications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135427325","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}
Pub Date : 2023-09-28DOI: 10.5121/ijcnc.2023.15507
Ali M. Allam
The ability to track and trace assets in the supply chain is becoming increasingly important. In addition to asset tracking, the technologies used provide new opportunities for collecting and analyzing employee position and biometric data. As a result, these technologies can be used to monitor performance or track worker behavior, resulting in additional risks and stress for employees. Furthermore, contact tracing systems used to contain the COVID-19 outbreak have made positive patients' privacy public, resulting in violations of users' rights and even endangering their lives. To resolve this situation, a verifiable attributebased encryption (ABE) scheme based on homomorphic encryption and zero-knowledge identification (ZKI) is proposed, with ZKI providing anonymity for data owners to resist tracking attacks and homomorphic encryption used to solve the problem of privacy leakage from location inquiries returned from a semi-honest server. Finally, theoretical security analysis and formal security verification show that our scheme is secure against the chosen plaintext attack (CPA) and other attacks. Besides that, our novel scheme is efficient enough in terms of user-side computation overhead for practical applications.
{"title":"A Privacy-Aware Tracking and Tracing System","authors":"Ali M. Allam","doi":"10.5121/ijcnc.2023.15507","DOIUrl":"https://doi.org/10.5121/ijcnc.2023.15507","url":null,"abstract":"The ability to track and trace assets in the supply chain is becoming increasingly important. In addition to asset tracking, the technologies used provide new opportunities for collecting and analyzing employee position and biometric data. As a result, these technologies can be used to monitor performance or track worker behavior, resulting in additional risks and stress for employees. Furthermore, contact tracing systems used to contain the COVID-19 outbreak have made positive patients' privacy public, resulting in violations of users' rights and even endangering their lives. To resolve this situation, a verifiable attributebased encryption (ABE) scheme based on homomorphic encryption and zero-knowledge identification (ZKI) is proposed, with ZKI providing anonymity for data owners to resist tracking attacks and homomorphic encryption used to solve the problem of privacy leakage from location inquiries returned from a semi-honest server. Finally, theoretical security analysis and formal security verification show that our scheme is secure against the chosen plaintext attack (CPA) and other attacks. Besides that, our novel scheme is efficient enough in terms of user-side computation overhead for practical applications.","PeriodicalId":37554,"journal":{"name":"International Journal of Computer Networks and Communications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135469962","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}
Pub Date : 2023-09-28DOI: 10.5121/ijcnc.2023.15503
Awatef Chniguir, Zouhair Ben Jemaa
The Internet of Things (IoT), which attaches dynamic devices that can access the Internet to create a smart environment, is a tempting research area. IoT-based mobile wireless sensor networks (WSN-IoT) are one of the major databases from which the IoT collects data for analysis and interpretation. However, one of the critical constraints is network lifetime. Routing-based clustered protocols and cluster head (CH) selection are crucial in load balancing and sensor longevity. Yet, with clustering, sensor node mobility requires more overhead because the nodes close to the center may get far and thus become unsuitable to be a CH, whereas those far from the center may get close and become good CH candidates, influencing energy consumption. This paper suggests an energy-efficient clustering protocol with a dynamic cluster head selection considering the distance to the cluster center, remaining energy, and each node's mobility degree implementing a rotation mechanism that allows cluster members to be equally elected while prioritizing those with the minimum weight. The advised algorithm aims to delay the first node death (FND) and thus prolong the stability period and minimize energy consumption by avoiding re-clustering. The performance of the proposed protocol exceeds that achieved in our previous work, Improved OKmeans, by 11%, in first dead node lifetime maximization, 43% in throughput, and 44% in energy efficiency.
{"title":"Energy-Efficient Improved Optimal K-Means: Dynamic Cluster Head Selection based on Delaying the First Node Death in MWSN-IoT","authors":"Awatef Chniguir, Zouhair Ben Jemaa","doi":"10.5121/ijcnc.2023.15503","DOIUrl":"https://doi.org/10.5121/ijcnc.2023.15503","url":null,"abstract":"The Internet of Things (IoT), which attaches dynamic devices that can access the Internet to create a smart environment, is a tempting research area. IoT-based mobile wireless sensor networks (WSN-IoT) are one of the major databases from which the IoT collects data for analysis and interpretation. However, one of the critical constraints is network lifetime. Routing-based clustered protocols and cluster head (CH) selection are crucial in load balancing and sensor longevity. Yet, with clustering, sensor node mobility requires more overhead because the nodes close to the center may get far and thus become unsuitable to be a CH, whereas those far from the center may get close and become good CH candidates, influencing energy consumption. This paper suggests an energy-efficient clustering protocol with a dynamic cluster head selection considering the distance to the cluster center, remaining energy, and each node's mobility degree implementing a rotation mechanism that allows cluster members to be equally elected while prioritizing those with the minimum weight. The advised algorithm aims to delay the first node death (FND) and thus prolong the stability period and minimize energy consumption by avoiding re-clustering. The performance of the proposed protocol exceeds that achieved in our previous work, Improved OKmeans, by 11%, in first dead node lifetime maximization, 43% in throughput, and 44% in energy efficiency.","PeriodicalId":37554,"journal":{"name":"International Journal of Computer Networks and Communications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135470158","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}
Pub Date : 2023-09-28DOI: 10.5121/ijcnc.2023.15504
Saureng Kumar, S C Sharma
With the enhancement of the intelligent and communication technology, an intelligent transportation plays a vital role to facilitate an essential service to many people, allowing them to travel quickly and conveniently from place to place. Wireless sensor networks (WSNs) are well-known for their ability to detect physical significant barriers due to their diverse movement, self-organizing capabilities, and the integration of this mobile node on the intelligent transportation system to gather data in WSN contexts is becoming more and more popular as these vehicles proliferate. Although these mobile devices might enhance network performance, however it is difficult to design a suitable transportation path with the limited energy resources with network connectivity. To solve this problem, we have proposed a novel itinerary planning schema data gatherer (IPS-DG) model. Furthermore, we use the path planning module (PPM) which finds the transportation path to travel the shortest distance. We have compared our results under different aspect such as life span, energy consumption, and path length with Low Energy Adaptive Clustering Hierarchy (LEACH), Multi-Hop Weighted Revenue (MWR), Single-Hop Data Gathering Procedure (SHDGP). Our model outperforms in terms of energy usage, shortest path, and longest life span of with LEACH, MWR, SHDGP routing protocols.
{"title":"Optimal Coverage Path Planning in a Wireless Sensor Network for Intelligent Transportation System","authors":"Saureng Kumar, S C Sharma","doi":"10.5121/ijcnc.2023.15504","DOIUrl":"https://doi.org/10.5121/ijcnc.2023.15504","url":null,"abstract":"With the enhancement of the intelligent and communication technology, an intelligent transportation plays a vital role to facilitate an essential service to many people, allowing them to travel quickly and conveniently from place to place. Wireless sensor networks (WSNs) are well-known for their ability to detect physical significant barriers due to their diverse movement, self-organizing capabilities, and the integration of this mobile node on the intelligent transportation system to gather data in WSN contexts is becoming more and more popular as these vehicles proliferate. Although these mobile devices might enhance network performance, however it is difficult to design a suitable transportation path with the limited energy resources with network connectivity. To solve this problem, we have proposed a novel itinerary planning schema data gatherer (IPS-DG) model. Furthermore, we use the path planning module (PPM) which finds the transportation path to travel the shortest distance. We have compared our results under different aspect such as life span, energy consumption, and path length with Low Energy Adaptive Clustering Hierarchy (LEACH), Multi-Hop Weighted Revenue (MWR), Single-Hop Data Gathering Procedure (SHDGP). Our model outperforms in terms of energy usage, shortest path, and longest life span of with LEACH, MWR, SHDGP routing protocols.","PeriodicalId":37554,"journal":{"name":"International Journal of Computer Networks and Communications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135470331","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}
Pub Date : 2023-09-28DOI: 10.5121/ijcnc.2023.15505
Salima Nebti, Mohammed Redjimi
Routing is a persistent concern in wireless sensor networks (WSNs), as getting data from sources to destinations can be a tricky task. Challenges include safeguarding the data being transferred, ensuring network longevity, and preserving energy in harsh environmental conditions. Consequently, this study delves into the suitability of using multi-objective swarm optimization to route heterogeneous WSNs in the hope of mitigating these issues while boosting the speed and accuracy of data transmission. In order to achieve better performance in terms of load balancing and reducing energy expenditure, the MOSSA-BA algorithm was developed. This algorithm combines the Multi-Objective Salp Swarm Algorithm (MOSSA) with the exploiting strategy of the artificial bee colony (BA) in the neighbourhood of Salps. Inspired by the SEP and EDEEC protocols, the integrated solutions of MOSSA-BA were used to route two and three levels of heterogeneous networks. The embedded solutions provided outstanding performance in regards to FND, HND, LND, percentage of remaining energy, and the number of packages delivered to the base station. Compared to SEP, EDEEC, and other competitors based on MOSSA and a modified multi-objective particle swarm optimization (MOPSO), the MOSSA-BA-based protocols demonstrated energy-saving percentages of more than 34% in medium-sized areas of interest and over 22% in large-sized areas of detection.
{"title":"Multi Objective Salp Swarm based Energy Efficient Routing Protocol for Heterogeneous Wireless Networks","authors":"Salima Nebti, Mohammed Redjimi","doi":"10.5121/ijcnc.2023.15505","DOIUrl":"https://doi.org/10.5121/ijcnc.2023.15505","url":null,"abstract":"Routing is a persistent concern in wireless sensor networks (WSNs), as getting data from sources to destinations can be a tricky task. Challenges include safeguarding the data being transferred, ensuring network longevity, and preserving energy in harsh environmental conditions. Consequently, this study delves into the suitability of using multi-objective swarm optimization to route heterogeneous WSNs in the hope of mitigating these issues while boosting the speed and accuracy of data transmission. In order to achieve better performance in terms of load balancing and reducing energy expenditure, the MOSSA-BA algorithm was developed. This algorithm combines the Multi-Objective Salp Swarm Algorithm (MOSSA) with the exploiting strategy of the artificial bee colony (BA) in the neighbourhood of Salps. Inspired by the SEP and EDEEC protocols, the integrated solutions of MOSSA-BA were used to route two and three levels of heterogeneous networks. The embedded solutions provided outstanding performance in regards to FND, HND, LND, percentage of remaining energy, and the number of packages delivered to the base station. Compared to SEP, EDEEC, and other competitors based on MOSSA and a modified multi-objective particle swarm optimization (MOPSO), the MOSSA-BA-based protocols demonstrated energy-saving percentages of more than 34% in medium-sized areas of interest and over 22% in large-sized areas of detection.","PeriodicalId":37554,"journal":{"name":"International Journal of Computer Networks and Communications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135469961","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}
Pub Date : 2023-09-28DOI: 10.5121/ijcnc.2023.15501
KOBAYASHI Kakeru, FUJITA Satoshi
This research looks into the implementation and utilization of BLE beacons with data accumulation functionality. BLE applications are typically divided into two categories: one that broadcasts a fixed value for each device, and the other that identifies contact with a particular user by scanning the data broadcasted in its surroundings. The proposed framework, however, follows a different approach where each beacon scans for data broadcasted in the area, then changes state based on the scan result, and finally, broadcasts data based on the new state. This can be regarded as an extension of the BLE mesh standard, which enables data flooding through repeated scanning and broadcasting. The paper also explores two practical use cases of the technology: detecting and announcing congestion around devices, and a stamp rally application.
{"title":"BLE Beacon with Data Accumulation Functionality","authors":"KOBAYASHI Kakeru, FUJITA Satoshi","doi":"10.5121/ijcnc.2023.15501","DOIUrl":"https://doi.org/10.5121/ijcnc.2023.15501","url":null,"abstract":"This research looks into the implementation and utilization of BLE beacons with data accumulation functionality. BLE applications are typically divided into two categories: one that broadcasts a fixed value for each device, and the other that identifies contact with a particular user by scanning the data broadcasted in its surroundings. The proposed framework, however, follows a different approach where each beacon scans for data broadcasted in the area, then changes state based on the scan result, and finally, broadcasts data based on the new state. This can be regarded as an extension of the BLE mesh standard, which enables data flooding through repeated scanning and broadcasting. The paper also explores two practical use cases of the technology: detecting and announcing congestion around devices, and a stamp rally application.","PeriodicalId":37554,"journal":{"name":"International Journal of Computer Networks and Communications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135470167","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}
Pub Date : 2023-03-30DOI: 10.5121/ijcnc.2023.15204
Driss Abada, Rachid Adrdor, Omar Boutkhoum, Adil Bohouch
Coupling cellular communication networks with vehicular ad hoc networks (VANET) can be a very interesting way out for providing Internet access to vehicles in the road. However, due to the several specific characteristics of VANETs, making an efficient multi-hop routing from vehicular sources to the Internet gateways through Long Term Evolution (LTE) technology is still challenging. In this paper, an Internet mobile gateway selection scheme is proposed to elect more potential vehicles to behave as gateways to Internet in VANETs. Therefore, the discovery and the selection of route to those mobiles gateways is carried out via an efficient multiple metrics-based relay selection mechanism. The objective is to select the more reliable route to the mobile gateways, by reducing the communication overhead and performing seamless handover. The proposed protocol is compared with one recent protocol based on packet delivery ratio, average end-to-end delay and overhead. The results show that the proposed protocol ameliorates significantly the network performance in the contrast of the other protocol.
{"title":"An Efficient Mobile Gateway Selection and Discovery Based-Routing Protocol in Heterogeneous LTE-VANET Networks","authors":"Driss Abada, Rachid Adrdor, Omar Boutkhoum, Adil Bohouch","doi":"10.5121/ijcnc.2023.15204","DOIUrl":"https://doi.org/10.5121/ijcnc.2023.15204","url":null,"abstract":"Coupling cellular communication networks with vehicular ad hoc networks (VANET) can be a very interesting way out for providing Internet access to vehicles in the road. However, due to the several specific characteristics of VANETs, making an efficient multi-hop routing from vehicular sources to the Internet gateways through Long Term Evolution (LTE) technology is still challenging. In this paper, an Internet mobile gateway selection scheme is proposed to elect more potential vehicles to behave as gateways to Internet in VANETs. Therefore, the discovery and the selection of route to those mobiles gateways is carried out via an efficient multiple metrics-based relay selection mechanism. The objective is to select the more reliable route to the mobile gateways, by reducing the communication overhead and performing seamless handover. The proposed protocol is compared with one recent protocol based on packet delivery ratio, average end-to-end delay and overhead. The results show that the proposed protocol ameliorates significantly the network performance in the contrast of the other protocol.","PeriodicalId":37554,"journal":{"name":"International Journal of Computer Networks and Communications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135374866","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}
MANET is a collection of mobile nodes that communicate through wireless networks as they move from one point to another. MANET is an infrastructure-less network with a changeable topology; as a result, it is very susceptible to attacks. MANET attack prevention represents a serious difficulty. Malicious network nodes are the source of network-based attacks. In a MANET, attacks can take various forms, and each one alters the network's operation in its unique way. In general, attacks can be separated into two categories: those that target the data traffic on a network and those that target the control traffic. This article explains the many sorts of assaults, their impact on MANET, and the MANET-based defence measures that are currently in place. The suggested SRA that employs blockchain technology (SRABC) protects MANET from attacks and authenticates nodes. The secure routing algorithm (SRA) proposed by blockchain technology safeguards control and data flow against threats. This is achieved by generating a Hash Function for every transaction. We will begin by discussing the security of the MANET. This article's second section explores the role of blockchain in MANET security. In the third section, the SRA is described in connection with blockchain. In the fourth phase, PDR and Throughput are utilised to conduct an SRA review using Blockchain employing PDR and Throughput. The results suggest that the proposed technique enhances MANET security while concurrently decreasing delay. The performance of the proposed technique is analysed and compared to the routing protocols Q-AODV and DSR.
{"title":"Secure Routing Protocol to Mitigate Attacks by using Blockchain Technology in MANET","authors":"Nitesh Ghodichor, Raj Thaneeghavl V, Dinesh Sahu, Gautam Borkar, Ankush Sawarkar","doi":"10.5121/ijcnc.2023.15207","DOIUrl":"https://doi.org/10.5121/ijcnc.2023.15207","url":null,"abstract":"MANET is a collection of mobile nodes that communicate through wireless networks as they move from one point to another. MANET is an infrastructure-less network with a changeable topology; as a result, it is very susceptible to attacks. MANET attack prevention represents a serious difficulty. Malicious network nodes are the source of network-based attacks. In a MANET, attacks can take various forms, and each one alters the network's operation in its unique way. In general, attacks can be separated into two categories: those that target the data traffic on a network and those that target the control traffic. This article explains the many sorts of assaults, their impact on MANET, and the MANET-based defence measures that are currently in place. The suggested SRA that employs blockchain technology (SRABC) protects MANET from attacks and authenticates nodes. The secure routing algorithm (SRA) proposed by blockchain technology safeguards control and data flow against threats. This is achieved by generating a Hash Function for every transaction. We will begin by discussing the security of the MANET. This article's second section explores the role of blockchain in MANET security. In the third section, the SRA is described in connection with blockchain. In the fourth phase, PDR and Throughput are utilised to conduct an SRA review using Blockchain employing PDR and Throughput. The results suggest that the proposed technique enhances MANET security while concurrently decreasing delay. The performance of the proposed technique is analysed and compared to the routing protocols Q-AODV and DSR.","PeriodicalId":37554,"journal":{"name":"International Journal of Computer Networks and Communications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135374867","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：