Vehicular Adhoc Networks (VANETs) are used for efficient communication among the vehicles to vehicle (V2V) infrastructure. Currently, VANETs are facing node management, security, and routing problems in V2V communication. Intelligent transportation systems have raised the research opportunity in routing, security, and mobility management in VANETs. One of the major challenges in VANETs is the optimization of routing for desired traffic scenarios. Traditional protocols such as Adhoc On-demand Distance Vector (AODV), Optimized Link State Routing (OLSR), and Destination Sequence Distance Vector (DSDV) are perfect for generic mobile nodes but do not fit for VANET due to the high and dynamic nature of vehicle movement. Similarly, swarm intelligence routing algorithms such as Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO) routing techniques are partially successful for addressing optimized routing for sparse, dense, and realistic traffic network scenarios in VANET. Also, the majority of metaheuristics techniques suffer from premature convergence, being stuck in local optima, and poor convergence speed problems. Therefore, a Hybrid Genetic Firefly Algorithm-based Routing Protocol (HGFA) is proposed for faster communication in VANET. Features of the Genetic Algorithm (GA) are integrated with the Firefly algorithm and applied in VANET routing for both sparse and dense network scenarios. Extensive comparative analysis reveals that the proposed HGFA algorithm outperforms Firefly and PSO techniques with 0.77% and 0.55% of significance in dense network scenarios and 0.74% and 0.42% in sparse network scenarios, respectively. 

/pdf/hybrid-genetic-firefly-algorithm-based-routing-protocol-for-2no0149f.pdf

Hybrid Genetic Firefly Algorithm-Based Routing Protocol for VANETs

Vehicular Adhoc Networks (VANETs) are used for efficient communication among the vehicles to vehicle (V2V) infrastructure. Currently, VANETs are facing node management, security, and routing problems in V2V communication. Intelligent transportation systems have raised the research opportunity in routing, security, and mobility management in VANETs. One of the major challenges in VANETs is the optimization of routing for desired traffic scenarios. Traditional protocols such as Adhoc On-demand Distance Vector (AODV), Optimized Link State Routing (OLSR), and Destination Sequence Distance Vector (DSDV) are perfect for generic mobile nodes but do not fit for VANET due to the high and dynamic nature of vehicle movement. Similarly, swarm intelligence routing algorithms such as Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO) routing techniques are partially successful for addressing optimized routing for sparse, dense, and realistic traffic network scenarios in VANET. Also, the majority of metaheuristics techniques suffer from premature convergence, being stuck in local optima, and poor convergence speed problems. Therefore, a Hybrid Genetic Firefly Algorithm-based Routing Protocol (HGFA) is proposed for faster communication in VANET. Features of the Genetic Algorithm (GA) are integrated with the Firefly algorithm and applied in VANET routing for both sparse and dense network scenarios. Extensive comparative analysis reveals that the proposed HGFA algorithm outperforms Firefly and PSO techniques with 0.77% and 0.55% of significance in dense network scenarios and 0.74% and 0.42% in sparse network scenarios, respectively.

https://ieeexplore.ieee.org/ielx7/6287639/9668973/09681052.pdf

Nowadays vehicles on the roads can communicate using a special type of wireless network called Vehicular Ad-hoc Networks (VANETs). It has been demonstrated by the researchers that because of the unique features such as high density of vehicles and frequent change of network topology, VANETs are not supported by the traditional routing protocols. The routing consistency of such highly dynamic networks must be taken into account in VANETs as communication links are disintegrated in VANETs more often than Mobile ad-hoc Networks (MANETs). The nature of VANET communication can bring extreme routing overhead to the network, therefore to increase network performance, the overhead issue must be tackled. The proposed protocol is focused on reducing the overhead to get the improved PDR performance of the network. The improvement is achieved by permitting communication amongst only those nodes which are considered reliable in terms of availability and geographical position. The reliability factor simply reduces unnecessary nodes from the communication process and selects a set of reliable nodes that are discovered with the help of clustering technique throughout the routing process. Simulation experiments using the network simulator are presented to demonstrate the efficacy of the proposed protocol. The results show that the proposed protocol has enhanced network performance effectively compared to prior approaches.

/pdf/reliable-group-of-vehicles-rgov-in-vanet-149tnm5nge.pdf

Reliable Group of Vehicles (RGoV) in VANET

Wireless Sensor Networks (WSNs) have become extremely popular for sensing, collecting, and transmitting data across different environments. In particular, the AODV protocol is widely used to improve the behavior of WSNs in various applications. A bottleneck in the protocol's performance is the amount of data that need to be moved between different nodes. This bottleneck becomes evident in applications based on multimedia contents, such as images or videos, in which huge chunks of data need to be delivered over long distances. In this article, we propose a new method to enhance the performance of the AODV protocol. Simulation results show that the proposed method improves the performance of the AODV protocol for image-based applications. The technique increases the quality of the delivered images, extends the network's lifetime, and reduces the delay and the network overhead associated with providing such images.

/pdf/improving-aodv-routing-protocol-for-image-transmission-over-32w3j7mmsi.pdf

Improving AODV Routing Protocol for Image Transmission Over Mobile Video Sensor Networks

With the rise of Internet of Things (IoT), low-cost resource-constrained devices have to be more capable than traditional embedded systems, which operate on stringent power budgets. In order to add new capabilities such as learning, the power consumption planning has to be revised. Approximate computing is a promising paradigm for reducing power consumption at the expense of inaccuracy introduced to the computations. In this paper, we set forth approximate computing features of a processor that will exist in the next generation low-cost resource-constrained learning IoT devices. Based on these features, we design an approximate IoT processor which benefits from RISC-V ISA. Targeting machine learning applications such as classification and clustering, we have demonstrated that our processor reinforced with approximate operations can save power up to 23% for ASIC implementation while at least 90% top-1 accuracy is achieved on the trained models and test data set.

https://www.mdpi.com/2079-9292/9/1/125/pdf

Approximate CPU Design for IoT End-Devices with Learning Capabilities

Intelligent Transportation System (ITS) is a critical factor for Vehicular Ad hoc Networks (VANET). Even though VANET belongs to the class of Mobile Ad hoc Network (MANET), none of the MANET routing protocol applies to VANET. VANET network is dynamic, due to increased vehicle speed and mobility. Vehicle mobility of VANET affects conventional routing algorithm performance, which deals with the dynamicity of the network node. The evaluation of the existing research stated that Ad hoc On-Demand Distance Vector (AODV) is an effective MANET protocol to adopt network changes for significant resource utilization and also provides effective adaptation in the network change. Due to the effective performance of the AODV protocol, it is considered as an effective routing protocol for VANET. This paper proposed an ad hoc TROPHY (TAD-HOC) routing protocol for the VANET network for increasing efficiency and effective resource utilization of the network. To improve the overall performance, ad hoc network is combined with Trustworthy VANET ROuting with grouP autHentication keYs (TROPHY) protocol. The proposed TAD-HOC protocol transmits data based on time demand in the VANET network with the desired authentication. Results of the proposed approach show the increased performance of the VANET network with packet delay, transmission range, and end-to-end delay. The comparative analysis of the proposed approach with I-AODV, AODV-R, and AODV-L shows that the proposed TAD-HOC exhibited effective performance.

/pdf/tad-hoc-routing-protocol-for-efficient-vanet-and-3sp3coujsw.pdf

TAD-HOC Routing Protocol for Efficient VANET and Infrastructure-Oriented Communication Network

Cooperative Diversity can be used by wireless nodes to take the benefit of broadcast nature and inherent spatial diversity of wireless channel to relay messages for each others. This helps to propagate redundant signals over multiple paths, which can be used to combat the channel noise and fading effects. We investigate the use of packet combining in cooperative diversity scenario. In our approach we exploit this inherent spatial diversity alongwith the inherent time diversity in ARQ retransmissions. Further different channels have different fade levels or channel conditions. Maximal Ratio Combining of packets at the receiver improves the total Signal to Noise Ratio at the receiver, improving the throughput in wireless channel. Decode and Forward Relay can allow the opportunistic relay of the packets. In opportunistic relay of packets, the packet is relayed only when the direct transmission from source to destination fails. This saves the resources by avoiding the relay of packets, when not required. In this paper we propose the relaying scheme with packet combining at the destination. We investigate the BER and throughput performance of the scheme in AWGN and fading channel with and without MRC combining and compare them.

/pdf/on-throughput-performance-of-decode-and-forward-cooperative-34ivkj025t.pdf

On throughput performance of decode and forward cooperative relaying with packet combining and arq

Currently, the growth of the first generation Internet of Things (IoT) system for low-end devices having less memory and infrastructure is challenged due to the lack of engineering support in terms of architecture, technology, hardware, privacy, security, and business. This paper discusses system engineering issues relevant in IoT processors and builds a case for exploring rough set as an approximate computing technique in next generation IoT hardware. The proposed approach has a potential of dealing with inconsistencies arising at layers in hardware infrastructure for IoT applications with a dominance at cloud and fog processing. The authors bring out a research direction in IoT as an engineering discipline with an emphasis on the impact of processor hardware extension.

Architectural Considerations for Next Generation IoT Processors

Single-Carrier Frequency Division Multiple-Access (SC-FDMA) is used in uplink data transmission in Long-Term Evaluation (LTE) due to its low Peak-to-Average Power Ratio (PAPR) properties. In this paper, SC-FDMA link has been modeled and proposed to design this link using LabVIEW. The real-time data transmission through the SC-FDMA link is carried out using Software Defined Radio (SDR) testbed which is implemented using Universal Software Radio Peripheral (USRP) devices. The data transmission and reception are carried out through SC-FDMA link and the performance evaluation is estimated for PAPR and Bit Error Rate (BER). The simulation results show that the PAPR and BER parameters of the proposed SC-FDMA link design are significantly lower than the OFDMA in downlink. Moreover, the simulation of BER with different modulation schemes is carried out for different Signal to Noise Ratio (SNR) values. The analysis of PAPR impacts the OFDMA waveform and benefits on SC-FDMA transmission link in any channel condition.

Evaluation of SC-FDMA Physical Link Using USRP

A sample of Jagannath meteorite, which fell on 27 September 2003 at Kendrapara district, Orissa, India, has been analysed for elemental composition by the k 0 -based internal mono standard instrumental neutron activation analysis method. Concentrations of 20 major, minor and trace elements were determined. The authenticity of the meteorite sample was established by comparing its composition with those of standard meteorites/chondrites. An attempt was made to classify the sample by comparing the abundances and concentration ratios of elements with those of two recent meteorites from Kobe and Czech and a standard chondrite.

R. A. Patil

Papers

TAD-HOC Routing Protocol for Efficient VANET and Infrastructure-Oriented Communication Network

On throughput performance of decode and forward cooperative relaying with packet combining and arq

Architectural Considerations for Next Generation IoT Processors

Evaluation of SC-FDMA Physical Link Using USRP

Elemental composition of Jagannath meteorite by neutron activation analysis