Pub Date : 2020-05-04DOI: 10.1504/ijvics.2020.10029234
S. Ganesh, G. Ravi
Mobile Ad-hoc Network (MANET) is a collection of wireless mobile devices communicating with each other. Mobile devices are taking responsibility of routing packets between each others' nodes without any infrastructure. Generally, all the network uses the hybrid routing protocols to handle the connectivity link flow in the environment. But the hybrid rules do not consider the routing-related problems such as node selection and link analysis. So, the design of Data Communication through Neighbour Stable Link Connectivity (DC-NSLC) routing algorithm is implemented for fast and efficient traffic-less routing in the network. These routing algorithms work under the three phases, analysis of neighbour node information, neighbour node link establishment and data communication using neighbour node predicted link. Each and every phase evaluates the node movement along with the traffic design. The performance of our proposed research methodology is analysed by using the Network Simulator (NS2).
{"title":"A stable link connectivity-based data communication through neighbour node using traffic-less path in MANET","authors":"S. Ganesh, G. Ravi","doi":"10.1504/ijvics.2020.10029234","DOIUrl":"https://doi.org/10.1504/ijvics.2020.10029234","url":null,"abstract":"Mobile Ad-hoc Network (MANET) is a collection of wireless mobile devices communicating with each other. Mobile devices are taking responsibility of routing packets between each others' nodes without any infrastructure. Generally, all the network uses the hybrid routing protocols to handle the connectivity link flow in the environment. But the hybrid rules do not consider the routing-related problems such as node selection and link analysis. So, the design of Data Communication through Neighbour Stable Link Connectivity (DC-NSLC) routing algorithm is implemented for fast and efficient traffic-less routing in the network. These routing algorithms work under the three phases, analysis of neighbour node information, neighbour node link establishment and data communication using neighbour node predicted link. Each and every phase evaluates the node movement along with the traffic design. The performance of our proposed research methodology is analysed by using the Network Simulator (NS2).","PeriodicalId":39333,"journal":{"name":"International Journal of Vehicle Information and Communication Systems","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45919009","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 : 2020-05-04DOI: 10.1504/ijvics.2020.10029202
G. Leelavathi, K. Shaila, K. Venugopal
This work proposes encryption of text and image data, embedding as elliptic curve point. Finite field arithmetic is utilised efficiently in this reconfigurable crypto system. Pre-computations for text data and image input conversion is done using MATLAB. This architecture is tailored for cryptographic applications and VANET using Xilinx Spartan-xc3s100e-4-fg320 FPGA with Verilog coding. Total encryption and decryption time results around 10.09021 microseconds for 100×100 images, 22.091 microseconds for 256×256 images and 0.029 microseconds for a message. The message size is varied with different stream size and dynamic mapping of input data and a cipher image with high randomness indicates good security i.e., less vulnerable to attacks. An entropy statistical analysis is performed on plain and encrypted images to assess the strength of the proposed method. An encryption throughput rate is 450 Mbps and area throughput 3.63, which is a good improvement over previous implementations.
{"title":"Reconfigurable hardware architecture of public key crypto processor for VANET and wireless sensor nodes","authors":"G. Leelavathi, K. Shaila, K. Venugopal","doi":"10.1504/ijvics.2020.10029202","DOIUrl":"https://doi.org/10.1504/ijvics.2020.10029202","url":null,"abstract":"This work proposes encryption of text and image data, embedding as elliptic curve point. Finite field arithmetic is utilised efficiently in this reconfigurable crypto system. Pre-computations for text data and image input conversion is done using MATLAB. This architecture is tailored for cryptographic applications and VANET using Xilinx Spartan-xc3s100e-4-fg320 FPGA with Verilog coding. Total encryption and decryption time results around 10.09021 microseconds for 100×100 images, 22.091 microseconds for 256×256 images and 0.029 microseconds for a message. The message size is varied with different stream size and dynamic mapping of input data and a cipher image with high randomness indicates good security i.e., less vulnerable to attacks. An entropy statistical analysis is performed on plain and encrypted images to assess the strength of the proposed method. An encryption throughput rate is 450 Mbps and area throughput 3.63, which is a good improvement over previous implementations.","PeriodicalId":39333,"journal":{"name":"International Journal of Vehicle Information and Communication Systems","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44428659","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 : 2020-05-04DOI: 10.1504/ijvics.2020.10029233
Hajar Bennouri, A. Berqia
Data transmission in Underwater Wireless Sensor Networks (UWSNs) is one of the key enablers used in technologies for future ocean-monitoring systems and other underwater applications. The use of acoustic waves in UWSNs suffer from a high propagation delay, as well as a limited available bandwidth due to the high-noise level, making the use of the different traditional existing protocols a major challenge in this environment. In this paper, we have chosen two TCP mechanisms already defined: TCP Vegas and TCP New Reno, to evaluate the effects of variable TCP packet size and TCP connection density in a subsea network under two common routing protocols, namely AODV and DSDV. The simulation results show that the performances of the two TCPs using DSDV routing protocol provide a more efficient result than those using the AODV routing protocol and that New Reno TCP gives better results than Vegas TCP in the UWSNs.
水下无线传感器网络（UWSN）中的数据传输是未来海洋监测系统和其他水下应用技术中使用的关键推动者之一。UWSN中声波的使用受到高传播延迟的影响，以及由于高噪声水平而导致的有限可用带宽，使得在这种环境中使用不同的传统现有协议成为一个主要挑战。在本文中，我们选择了两种已经定义的TCP机制：TCP Vegas和TCP New Reno，以评估在两种常见的路由协议（即AODV和DSDV）下，海底网络中可变TCP数据包大小和TCP连接密度的影响。仿真结果表明，在UWSN中，使用DSDV路由协议的两个TCP比使用AODV路由协议提供了更有效的结果，并且New Reno TCP比Vegas TCP提供了更好的结果。
{"title":"Assessing the performance of different TCP congestion mechanisms in underwater wireless sensor networks","authors":"Hajar Bennouri, A. Berqia","doi":"10.1504/ijvics.2020.10029233","DOIUrl":"https://doi.org/10.1504/ijvics.2020.10029233","url":null,"abstract":"Data transmission in Underwater Wireless Sensor Networks (UWSNs) is one of the key enablers used in technologies for future ocean-monitoring systems and other underwater applications. The use of acoustic waves in UWSNs suffer from a high propagation delay, as well as a limited available bandwidth due to the high-noise level, making the use of the different traditional existing protocols a major challenge in this environment. In this paper, we have chosen two TCP mechanisms already defined: TCP Vegas and TCP New Reno, to evaluate the effects of variable TCP packet size and TCP connection density in a subsea network under two common routing protocols, namely AODV and DSDV. The simulation results show that the performances of the two TCPs using DSDV routing protocol provide a more efficient result than those using the AODV routing protocol and that New Reno TCP gives better results than Vegas TCP in the UWSNs.","PeriodicalId":39333,"journal":{"name":"International Journal of Vehicle Information and Communication Systems","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46259380","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 : 2020-05-04DOI: 10.1504/ijvics.2020.10029210
S. Prabha, R. Yadav
Mobile ad-hoc network is an infrastructure-less spontaneously formed wireless environment that is deployed without any centralised unit. All the nodes in this kind of network are assumed to be trustworthy but in the real scenario, a few can be malicious and, therefore, secure and reliable route for data transmission is always a matter of question. This paper presents effective routing solution for mobile ad-hoc networks with differential evolution. The proposed algorithm is termed as Differential Evolution Secure Routing protocol for mobile ad-hoc networks (DESR) with an effective fitness function. The component metrics for the fitness function are the trust factor, residual battery power, and node stability which intend to select most promising routes through the proposed DESR algorithm. The simulation is carried out in various scenarios to evaluate the performance of the differential evolutionary secure routing algorithm with packet delivery ratio, average end-to-end delay, and throughput. Results are compared with two algorithms PSO and TSR.
{"title":"DESR: Differential evolutionary secure routing protocol for mobile ad-hoc networks","authors":"S. Prabha, R. Yadav","doi":"10.1504/ijvics.2020.10029210","DOIUrl":"https://doi.org/10.1504/ijvics.2020.10029210","url":null,"abstract":"Mobile ad-hoc network is an infrastructure-less spontaneously formed wireless environment that is deployed without any centralised unit. All the nodes in this kind of network are assumed to be trustworthy but in the real scenario, a few can be malicious and, therefore, secure and reliable route for data transmission is always a matter of question. This paper presents effective routing solution for mobile ad-hoc networks with differential evolution. The proposed algorithm is termed as Differential Evolution Secure Routing protocol for mobile ad-hoc networks (DESR) with an effective fitness function. The component metrics for the fitness function are the trust factor, residual battery power, and node stability which intend to select most promising routes through the proposed DESR algorithm. The simulation is carried out in various scenarios to evaluate the performance of the differential evolutionary secure routing algorithm with packet delivery ratio, average end-to-end delay, and throughput. Results are compared with two algorithms PSO and TSR.","PeriodicalId":39333,"journal":{"name":"International Journal of Vehicle Information and Communication Systems","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46376393","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 : 2020-05-04DOI: 10.1504/ijvics.2020.10029213
Mayank Singh, V. Srivastava
The expansion of sensors and data is the catalyst for traffic simulators to help monitor and manage transportation systems in real-time to improve key performance metrics and overall efficiency. The number of accidents has rapidly increased in Indian perspective over the past few decades. Owing the accidents, a large number of losses occur in form of infrastructure, resources and people. In this paper, we have proposed an architectural framework for Indian urban transport system to gather, store, data mining and getting information to avoid the traffic accidents, congestions and predicting the alternative routes in real time. A combination of machine learning and data mining techniques are used to implement the proposed system. The implemented system will help in reduction of traffic accidents and suggesting alternative routes to avoid the traffic congestion for an Indian urban transport network operation in real-time. Real-time data is fed into a traffic simulation, which generates future states of the road network and alternative routes to avoid congestion. Because the results of the system need to be both faster than real-time and accurate, the acceleration of the simulation execution and the accuracy of the prediction models are critical.
{"title":"Prediction and avoidance of real-time traffic congestion system for Indian metropolitan cities","authors":"Mayank Singh, V. Srivastava","doi":"10.1504/ijvics.2020.10029213","DOIUrl":"https://doi.org/10.1504/ijvics.2020.10029213","url":null,"abstract":"The expansion of sensors and data is the catalyst for traffic simulators to help monitor and manage transportation systems in real-time to improve key performance metrics and overall efficiency. The number of accidents has rapidly increased in Indian perspective over the past few decades. Owing the accidents, a large number of losses occur in form of infrastructure, resources and people. In this paper, we have proposed an architectural framework for Indian urban transport system to gather, store, data mining and getting information to avoid the traffic accidents, congestions and predicting the alternative routes in real time. A combination of machine learning and data mining techniques are used to implement the proposed system. The implemented system will help in reduction of traffic accidents and suggesting alternative routes to avoid the traffic congestion for an Indian urban transport network operation in real-time. Real-time data is fed into a traffic simulation, which generates future states of the road network and alternative routes to avoid congestion. Because the results of the system need to be both faster than real-time and accurate, the acceleration of the simulation execution and the accuracy of the prediction models are critical.","PeriodicalId":39333,"journal":{"name":"International Journal of Vehicle Information and Communication Systems","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42447028","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 : 2020-05-04DOI: 10.1504/ijvics.2020.10029203
S. Simi, M. Ramesh, P. Ushakumari
Ocean network is a heterogeneous wireless network of fishing vessels at sea to provide internet over sea. The types of messages exchanged between fishing vessels include emergency data, normal data, voice and video messages. As the connectivity is intermittent, it is necessary to select the most appropriate message from the transmission queue for forwarding. This paper focuses on designing a queuing model with multiple priorities to estimate the queue size of each type of message in a node. Solving the steady state equations gives the number of emergency packets, data packets, audio packets and video packets waiting in the node to be transmitted. Hence the message dissemination algorithm can select the appropriate queue for transmitting the message to maximise the available resources with fairness.
{"title":"Queue size estimation of nodes in a heterogeneous ocean network with multiple priority traffic","authors":"S. Simi, M. Ramesh, P. Ushakumari","doi":"10.1504/ijvics.2020.10029203","DOIUrl":"https://doi.org/10.1504/ijvics.2020.10029203","url":null,"abstract":"Ocean network is a heterogeneous wireless network of fishing vessels at sea to provide internet over sea. The types of messages exchanged between fishing vessels include emergency data, normal data, voice and video messages. As the connectivity is intermittent, it is necessary to select the most appropriate message from the transmission queue for forwarding. This paper focuses on designing a queuing model with multiple priorities to estimate the queue size of each type of message in a node. Solving the steady state equations gives the number of emergency packets, data packets, audio packets and video packets waiting in the node to be transmitted. Hence the message dissemination algorithm can select the appropriate queue for transmitting the message to maximise the available resources with fairness.","PeriodicalId":39333,"journal":{"name":"International Journal of Vehicle Information and Communication Systems","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43369767","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 : 2020-05-04DOI: 10.1504/ijvics.2020.10029201
Salma Fauzia, K. Fatima
Quality of Service - QoS provisioning during routing in Mobile Ad-Hoc Networks has been an exigent task for researchers since long. The challenges like node mobility, route maintenance during topology changes and link characteristics become more sophisticated if the scenario requires maintaining clear Line of Sight (LOS) between the transmitter and receiver. Similar is the case of a Free Space Optical Mobile Ad Hoc network (FSO MANET), which was originally designed for military applications and Delay Tolerant Networks. Routing for successful delivery of data and efficient utilisation of network bandwidth remains a challenging issue till date in such networks. A routing protocol should take care of directional nature of transmission and LOS requirement in a transceiver pair in FSO MANET. In this work the traditional routing protocol Ad Hoc On-Demand Distance Vector-AODV is implemented in an FSO MANET to satisfy the QoS requirement-bandwidth. The results showed an improvement in throughput if bandwidth is pre-specified as QoS parameter. The performance is evaluated by varying node speeds and varying the number of nodes in the network.
{"title":"QoS-based routing for free space optical mobile ad hoc networks","authors":"Salma Fauzia, K. Fatima","doi":"10.1504/ijvics.2020.10029201","DOIUrl":"https://doi.org/10.1504/ijvics.2020.10029201","url":null,"abstract":"Quality of Service - QoS provisioning during routing in Mobile Ad-Hoc Networks has been an exigent task for researchers since long. The challenges like node mobility, route maintenance during topology changes and link characteristics become more sophisticated if the scenario requires maintaining clear Line of Sight (LOS) between the transmitter and receiver. Similar is the case of a Free Space Optical Mobile Ad Hoc network (FSO MANET), which was originally designed for military applications and Delay Tolerant Networks. Routing for successful delivery of data and efficient utilisation of network bandwidth remains a challenging issue till date in such networks. A routing protocol should take care of directional nature of transmission and LOS requirement in a transceiver pair in FSO MANET. In this work the traditional routing protocol Ad Hoc On-Demand Distance Vector-AODV is implemented in an FSO MANET to satisfy the QoS requirement-bandwidth. The results showed an improvement in throughput if bandwidth is pre-specified as QoS parameter. The performance is evaluated by varying node speeds and varying the number of nodes in the network.","PeriodicalId":39333,"journal":{"name":"International Journal of Vehicle Information and Communication Systems","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42269531","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 : 2020-01-01DOI: 10.1504/ijvics.2020.10031862
Sachin Lalar, N. Surender, S. Bhushan
{"title":"Clone detection using fuzzy logic in static wireless sensor network","authors":"Sachin Lalar, N. Surender, S. Bhushan","doi":"10.1504/ijvics.2020.10031862","DOIUrl":"https://doi.org/10.1504/ijvics.2020.10031862","url":null,"abstract":"","PeriodicalId":39333,"journal":{"name":"International Journal of Vehicle Information and Communication Systems","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66683104","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 : 2020-01-01DOI: 10.1504/ijvics.2020.10033550
V. N. Pranathy, V. Indragandhi, K. Sathyan, V. Vijayakumar, Logesh Ravi, V. Subramaniyaswamy
{"title":"Wireless power transfer with tuning capacitor compensation for electric vehicle applications","authors":"V. N. Pranathy, V. Indragandhi, K. Sathyan, V. Vijayakumar, Logesh Ravi, V. Subramaniyaswamy","doi":"10.1504/ijvics.2020.10033550","DOIUrl":"https://doi.org/10.1504/ijvics.2020.10033550","url":null,"abstract":"","PeriodicalId":39333,"journal":{"name":"International Journal of Vehicle Information and Communication Systems","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66683191","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 : 2020-01-01DOI: 10.1504/ijvics.2020.10031860
Ajay Dureja, N. Suman
{"title":"Efficient transportation: future aspects of IoV","authors":"Ajay Dureja, N. Suman","doi":"10.1504/ijvics.2020.10031860","DOIUrl":"https://doi.org/10.1504/ijvics.2020.10031860","url":null,"abstract":"","PeriodicalId":39333,"journal":{"name":"International Journal of Vehicle Information and Communication Systems","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66683540","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
扫码关注我们
求助内容：
应助结果提醒方式：