International Journal of Sensors Wireless Communications and Control - Volume 11, Issue 4, 2021

Background: It is paramount to secure the healthcare system from unauthorized users and security attacks through appropriate security mechanisms as a break in the communication process and which leads to leaked or blurred messages, which is totally unacceptable. Moreover, mutual authentication is a core requirement for privacy protection as it is paramount to control who is accessing the sensed data and whether they are authenticated or not. In addition to this, energy efficiency is a major issue to be discussed. Objective: After examination of the present related schemes, we proposed a novel Secured, Anonymity Preserving and Lightweight Mutual Authentication and Key Agreement Scheme (SALMAKA) for two-hop WBAN topology; where the scheme mutually authenticates the sensing nodes with the controller node in an anonymous, energy-efficient manner and establishes session key securely. Methods: To corroborate the accuracy of the proposed scheme, Burrows-Abadi-Needham (BAN) logic and Automated Validation of Internet Security Protocols and Applications (AVISPA) simulator are used. Apart from this, informal security evaluation is also performed in detail. Results: To exhibit the practical application and performance of the proposed scheme, it is compared with the existing related schemes and the results reveal that the proposed scheme reduces energy consumption, processing cost and processing time significantly. Conclusion: A Secured, Anonymity Preserving and Lightweight Mutual Authentication and Key Agreement Scheme (SALMAKA) for two-hop WBAN topology is propounded.

Aim: The existing cluster-based energy-efficient models such as Low Energy Adaptive Clustering Hierarchy (LEACH) and Stable Election Protocol (SEP) unable for the distribution of sensor nodes uniformly during cluster formation. The non-uniform cluster distribution structure leads to rapid energy depletion and high energy consumption. So, this paper aims to create uniform load-based cluster formation. Background: This proposed idea is generated from the famous saying "If a Fault is Handling Another Fault Then That's not a Fault". Designing of energy-efficient and fault-tolerant model is indeed wireless sensor network deployments. The involvement of WSN's is not only limited to domestic purposes but also applied in a harsh and hostile environment. Objective: In this paper, we focus on the energy depletion-based fault occurrence and its tolerance. Here, we propose a Uniform Load Distribution Function (ULDF) with two objectives. The first one is to form equilibrium energy level clusters, and the second one is to avoid the frequent involvement of SNs in cluster formation. The proposed function is compared against the performance of both homogeneous LEACH and heterogeneous SEP protocols. Methods: Efficient clustering through equal distribution of SNs based on their current residual energy. Results: Our analysis concludes with the results where the proposed ULDF perform better than LEACH and SEP and reduces SNs involvement in cluster formation, which indirectly implies minimum energy consumption. Conclusion: Energy saving through uniform load distribution.

Background: Over recent years, the security of the publicly available audio, video and text data has become a big challenge, i.e., social media communication; hence the author presents an exceedingly secure communication system to hide the data from an attentive adversary. Objective: The study aims to design and analyze a novel algorithm to be implemented for message transmission using multi-image LSB steganography and crucial variable-length cryptography. Encoder, decoder and social media as a channel are the main parts of the study. Methods: Various computer techniques like cryptography and steganography with video handling are used to perform the proposed work. The main objective of this work is to implement the raw video as the cover on the QR code image. This image is to be transmitted as information by enshrouding it in the raw footage. Additionally, encryption of QR code image using VLMKG (Variable Length Mixed key Generation) cryptography enhances the reliability of work. The variablelength Key is generated separately to implement the cryptography. Multi-image LSB steganography is imposed with one-bit replacement in the spatial domain. Wavelet Transform (Daubechies family) is applied for denoising, which enhances the accuracy of the received data. Results: The proposed work provides a secure way to transmit any information in the form of QR code image successfully. It is verified with the help of five QR Code images and three raw video groupings. Conclusion: Implementation of LSB steganography, variable-length key cryptography and MATLAB usage had superbly extracted the image features; calculations and the consequences were observed to be palatable.

Background: The prime challenge in Parking Systems is to administer the parking during peak hours or peak seasons. Besides being time consuming, it is laborious. Amalgamation of various infrastructures of hardware and software is prodigious and thus adding to its conventional hardware, making the investment in Smart Parking solution highly hazardous and splintered. Electronic payment vendors cause another crucial drawback. Objective: With the evolution of technology, we have proposed the plan to diminish human endeavors to such a degree, that a limit of one individual will be required to deal with the total colossal parking spot and a most extreme of one or two volunteers if there should arise an occurrence of any technical issues with minimal cost of operation. Methods: In our proposed work, we have used Infrared Sensors at each parking slot and also used a Node Micro Controller Unit, a Wi-Fi microchip for connectivity. The Internet of Things platform used over here is Blynk. Results: The proposed technique performs better compared to existing state-of-art methodologies as it is cost-effective and easy to implement. Also, this can maintain the total vehicle count of a particular day which can be used for further traffic analysis. Conclusion: This paper presents the prototype of a Smart Parking System based on the IR sensor and Node MCU which is connected to the Blynk app that monitors the whole parking lot. It provides an optimized parking solution for various places available with parking facilities throughout the city. The proposed Smart parking system enables the guard in-charge to obtain necessary information on the availability of parking space and keep a track of the effective number of vehicles that have entered the arena via a suitable app.

Background: The North-Eastern part of Bangladesh suffers from frequent flash flood, causing colossal damage to life and properties, especially the vast croplands. A distributed sensing system can monitor the water level on a continuous basis to warn people near the riverbank beforehand and reduce the damage largely. However, the required communication infrastructure is not available in most of the remote rural areas in a developing country like Bangladesh. Objective: This study intends to develop a low-cost sensor-based warning system, customizing to the Bangladesh context. Methods: The system utilizes a low-cost ultrasound-based sensor device, a lightweight mobile phone-based server, low-cost IoT sensing nodes, and a central server for continuous monitoring of river stage data along with the provision of storage and long-term data analytics. Results: A flash flood warning system was developed afterward with the sensors, mobile-based server, and appropriate web-based interfaces. The device was tested for some environmental conditions in the lab and deployed later in the outdoor conditions for short-term periods. Conclusion: Overall, the warning system performed well in the lab as well as in the outdoor environment, with the ability to detect water level at reasonable accuracy and transmit data to the server in real time. Some minor shortcomings were still noted with the scope for improvements, which are in the way to improve further.

Background: The Steered Response Power–Phase Transform (SRP-PHAT) approach is a breakthrough in the field of source localization in a high reverberant environment, but the substantial computational cost limits its usage in the practical implementation. Objective: This paper presents an efficient SRP-PHAT based, Iterative Volumetric Reduction (IVR) Steered Response Power method for acoustic source localization in non-ideal surroundings. Methods: Developing the coarse acoustic maps in the preliminary iterations provides a measure of the approximate likelihood of a source lying in the corresponding regions. Subsequently, the search space volume is reduced to the region containing points with significant likelihood. Furthermore, these two steps are iterated to achieve the desired resolution. Results and Conclusion: Conclusively, the computational load reduces by 60-80% with considerable upgrading in accuracy as compared to Modified SRP PHAT. The required functional evaluation is adaptable to the environment, which makes it an excellent approach over Iterative modified SRP-PHAT in unfavourable circumstances. Experiments conducted in various scenarios demonstrate the method's significance over the other state–of-the-art methods.

Background: Wireless Sensor Networks (WSNs) have been researched to be one of the ground-breaking technologies for the remote monitoring of pipeline infrastructure of the Oil and Gas industry. Research has also shown that the preferred deployment approach of the sensor network on pipeline structures follows a linear array of nodes, placed at a distance from each other across the infrastructure length. The linear array topology of the sensor nodes gives rise to the name Linear Wireless Sensor Networks (LWSNs), which over the years have been applied to pipelines for effective remote monitoring and surveillance. This paper aims to investigate the energy consumption issue associated with LWSNs deployed in cluster-based fashion along with a pipeline infrastructure. Methods: Through quantitative analysis, the study attempts to approach the investigation conceptually, focusing on mathematical analysis of proposed models to bring about conjectures on energy consumption performance. Results: From the derived analysis, results have shown that energy consumption is diminished to a minimum if there is a sink for every placed sensor node in the LWSN. To be precise, the analysis conceptually demonstrates that groups containing small number of nodes with a corresponding sink node are the approach to follow when pursuing a cluster-based LWSN for pipeline monitoring applications. Conclusion: From the results, it has been discovered that the energy consumption of a deployed LWSN can be decreased by creating groups out of the total deployed nodes with a sink node for each group. In essence, the smaller number of nodes each group contains with a corresponding sink, the less energy consumed in total for the entire LWSN. This, therefore, means that a sink for every individual node will attribute to minimum energy consumption for every non-sink node. From the study, it can be concurred that energy consumption of an LWSN is inversely proportional to the number of sinks deployed and hence the number of groups created.

Background: Due to the generic feature of AOMDV, it is widely used in Long-Term Evolution (LTE) networks such as the Internet which requires new challenges to deploy conversational real-time applications like VoIP (Voice over IP) and video conferencing. Objective: In AOMDV, the multiple routes between any source and destination pair are selected based on minimal hop count which does not ensure reliable video content delivery as the communicating nodes along the paths are prone to link failures and route breaks. Methods: To overcome such problems, the Link Reliable On-demand Multipath Distance Vector (LROMDV) is proposed by modifying the Ad hoc On-demand Multipath Distance Vector (AOMDV). Result: The LROMDV uses an enhanced Cumulative Expected Transmission Count (enh-CETX) for selecting multiple routes between any source and destination pair to avoid link failures and route breaks in Long-Term Evolution (LTE) networks. Conclusions: The performance of LROMDV on H.264/MPEG-4 AVC video streaming under both Distributed Coordination Function (DCF) and Enhanced Distributed Coordination Function (EDCF) using NS2.34 and Enhanced EvalVid framework is evaluated and the simulation result shows the effectiveness of LROMDV.

Background: The performance of Mobile Ad-hoc Networks gets severely degraded due to various attacks including the Selfish Behaviour attack. The detection of malicious nodes and avoidance of such nodes for data forwarding is important to enhance the MANET’s performance. Methods: A probabilistic model based on Single-Sided Laplacian distribution for the random ON/OFF switching time of this attack is proposed. The model is used to make appropriate decisions regarding the assignment of trust levels to suspicious nodes. The proposed protocol, based on this trust along with Confidence values of nodes, referred to as OLSRT-C protocol is used to select the optimum path for data forwarding. Simulations are carried out using Network Simulator NS-2.35. Results: The random behavior of the Selfish Behaviour attack is analyzed by considering all the possible random parameters. The random deployment of mobile nodes, number of malicious nodes, number of times the malicious nodes switch and timing instances at which these nodes change their states are considered. From the results, it is observed that the OLSRT-C protocol gives stable performance for Packet Delivery Ratio and Routing Overheads whereas, for OLSR protocol, the Packet Delivery Ratio gradually reduces and Routing Overheads increase, for the percentage of malicious nodes increases from 10% to 50%. For OLSRT-C protocol, Average Energy Consumption per node increases marginally compared to the OLSR protocol. Conclusion: The proposed OLSRT-C protocol successfully mitigates the randomized Selfish Behaviour attack with a marginal increase in the Average Energy Consumption per node. The Protocol Efficacy for OLSRT-C protocol is much higher compared to the OLSR protocol.

Background: VANETs (Vehicular Ad-Hoc Networks) are the subclass of MANETs, which have recently emerged. Due to their swift changing topology and high mobility nature, it is challenging to design an efficient routing protocol for routing data amongst both moving vehicles and stationary units in VANETs. In addition, the performance of existing routing protocols is not effective due to the high mobility characteristics of VANETs. Methods: In this paper, we proposed a link reliabiliy routing strategy that makes use of Restricted Greedy Forwarding by considering neighborhood vehicle density and the least, and average velocity with its own neighboring vehicles for the selection of the next forwarder. Results: The proposed approach is based on the assumption that at every junction the policepatrolling car (i.e. PCR junction node), forwards the packet to a vehicle onto the correct road segment only. The link reliability is ensured by the mechanism of the selection of the next forwarder. Conclusion: The objective of this paper is to increase route reliability to provide increased throughput without significantly affecting end-to-end delay. The simulation results reveal that the proposed approach Reliable GPSR(R-GPSR) outperforms the existing GPSR and E-GyTAR approach.

Background: Many applications of Wireless Sensor Networks (WSNs) require awareness of sensor node’s location but not every sensor node can be equipped with a GPS receiver for localization, due to cost and energy constraints especially for large-scale networks. For localization, many algorithms have been proposed to enable a sensor node to be able to determine its location by utilizing a small number of special nodes called anchors that are equipped with GPS receivers. In recent years a promising method that significantly reduces the cost is to replace the set of statically deployed GPS anchors with one mobile anchor node equipped with a GPS unit that moves to cover the entire network. Methods: This paper proposes a novel static path planning mechanism that enables a single anchor node to follow a predefined static path while periodically broadcasting its current location coordinates to the nearby sensors. This new path type is called SQUARE_SPIRAL and it is specifically designed to reduce the collinearity during localization. Results: Simulation results show that the performance of SQUARE_SPIRAL mechanism is better than other static path planning methods with respect to multiple performance metrics. Conclusion: This work includes an extensive comparative study of the existing static path planning methods then presents a comparison of the proposed mechanism with existing solutions by doing extensive simulations in NS-2.