International Journal of Sensors Wireless Communications and Control - Volume 9, Issue 2, 2019

Background & Objective: Wireless communication has immensely grown during the past few decades due to significant demand for mobile access. Although cost-effective as compared to their wired counterpart, maintaining good quality-of-service (QoS) in these networks has always remained a challenge. Multiple-input Multiple-output (MIMO) systems, which consists of multiple transmitter and receiver antennas, have been widely acknowledged for their QoS and transmit diversity. Though suited for cellular base stations, MIMO systems are not suited for small-sized wireless nodes due to their hardware complexity, cost, and increased power requirements. Cooperative communication that allows relays, i.e. mobile or fixed nodes in a communication network, to share their resources and forward other node’s data to the destination node has substituted the MIMO systems nowadays. To harness the full benefit of cooperative communication, appropriate relay node selection is very important. This paper presents an efficient single-hop distributed relay supporting medium access control (MAC) protocol (EDSRS) that works in the single-hop environment and improves the energy efficiency and the life of relay nodes without compensating the throughput of the network. Methods: The protocol has been simulated using NS2 simulator. The proposed protocol is compared with energy efficient cooperative MAC protocol (EECOMAC) and legacy distributed coordination function (DCF) on the basis of throughput, energy efficiency, transmission delay and an end to end delay with various payload sizes. Result and Conclusion: The result of the comparison indicates that the proposed protocol (EDSRS) outperforms the other two protocols.

Background & Objective: Mobile target tracking based on data from wireless sensor networks (WSN) is a hot topic that has been investigated both from a theoretical and practical point of view in the literature. Tracking the position and velocity of a target moving in WSN (especially in the context of uncertain noisy measurement channel) is a very challenging task. To deal with the uncertainty in system dynamics as well as uncertainty in target states, an Observer Based Self Recurrent Neural Network (OBSRNN) is proposed in this paper. Methods: The proposed algorithm employs a state observer based tracking control strategy and thereby allows for accurate estimation of mobile target moving along a predefined route in WSN. The Self Recurrent Neural Network (SRNN) framework is used to approximate the uncertainty in the system dynamics, while a full-order state observer is used to estimate the unknown state vector. Conclusion: The simulation analysis is performed to evaluate the efficacy of the proposed work.

Background & Objective: The Energy efficiency in optimization of node sensor location is considered as a design on Comparatively Cluster Based Mobile Routing Approach (CCBMRA) likewise circle coverage and elliptical coverage. Location of boundary has deployment with CCBMRA distribution of anchor node and un-anchor node or static sensor node. Methods: This proposed method has applied for distributed by anchor node positioned to measurements of employing received signal strength. So it is important for intermediate processing phase to achieved accurate positioning of SSN (Static Sensor Node). Moreover, ASN (Anchor Sensor Node) transmitted signal accurate computational and energy efficiency in optimization through reduces the number of cost factor, time and utilization of anchor node location. The research has established algorithm and simulation experimental based mobile node localisation routing approached. Result and Conclusion: The experimental has achieved higher localisation precision in less nodes. This paper suggests algorithm based on CCBMRA.

Background & Objective: In this paper, Multiple Input Multiple Output (MIMO) has been examined in wireless medium by utilizing Spatial Multiplexing procedure for the computation of the Bit Error Rate (BER). MIMO enhance the throughput in wireless medium. Spatial multiplexing builds the limit and link reliability of the MIMO frameworks. Methods: The BER execution of DPSK, Phase Shift Keying (PSK) and Quadrature Amplitude Modulation (QAM) in MIMO frameworks in Rayleigh multipath channel is analyzed. Zero forcing algorithms is utilized as a detection technique. A comparison of these modulations is additionally done in Rayleigh fading channel. Conclusion: The execution of transmission modes are assessed by figuring the likelihood of Bit Error Rate (BER) vs. the Signal Noise Ratio (SNR) under the every now and utilized four wireless channel models (Rayleigh, Dent, Jake’s and Okumura).

Background & Objective: There are some challenging issues such as providing Quality of Service (QoS), restricted usage of channels and shared bandwidth pertaining to ad-hoc networks in a dynamic topology. Hence, there is a requirement to support QoS for the application environment and multimedia services in ad-hoc networks with the fast growing and emerging development of information technology. Eventually, bandwidth is one of the key elements to be considered. Methods: Energy aware QoS routing protocol in an ad-hoc network is presented in this article. Results and Conclusion: The simulation results indicate that the improved protocol outperforms Adhoc On-Demand Distance Vector (AODV) routing protocol in terms of QoS metric such as throughput, packet delivery ratio, loss rate and average delay.

Background and Objective: We propose here joint semi-orthogonal user selection and antenna selection algorithm based on precoding scheme. Methods: The focus of this proposed algorithm is to increase the system sumrate and decrease the complexity. We select and schedule users from a large number of users based on semi-orthogonality condition among them. Here, we select only the maximum channel gain antennas to maximize the system sumrate. Subsequently, the user selection and antenna selection have been scheduled in an adequate manner in order to obtain maximum system sumrate. We calculate the system sumrate for two scenarios: firstly, by considering the interference and secondly without considering the interference. We achieve maximum system sumrate at MMSE and lowest at without precoding while considering the interference. However, when we do not consider the interference we obtain lowest sumrate at MMSE and maximum at without precoding. Results and Conclusion: Here, we apply the precoding scheme to increase the system sumrate and we obtain approximately 20% to 35% higher system sumrate compared to without precoding, when interference is considered. Thus, we achieve higher sumrate in our proposed algorithms compared to other existing work.

Background & Objective: Location of sensors is an important information in wireless sensor networks for monitoring, tracking and surveillance applications. The accurate and quick estimation of the location of sensor nodes plays an important role. Localization refers to creating location awareness for as many sensor nodes as possible. Multi-stage localization of sensor nodes using bio-inspired, heuristic algorithms is the central theme of this paper. Methodology: Biologically inspired heuristic algorithms offer the advantages of simplicity, resourceefficiency and speed. Four such algorithms have been evaluated in this paper for distributed localization of sensor nodes. Two evolutionary computation-based algorithms, namely cultural algorithm and the genetic algorithm, have been presented to optimize the localization process for minimizing the localization error. The results of these algorithms have been compared with those of swarm intelligence- based optimization algorithms, namely the firefly algorithm and the bee algorithm. Simulation results and analysis of stage-wise localization in terms of number of localized nodes, computing time and accuracy have been presented. The tradeoff between localization accuracy and speed has been investigated. Results: The comparative analysis shows that the firefly algorithm performs the localization in the most accurate manner but takes longest convergence time. Conclusion: Further, the cultural algorithm performs the localization in a very quick time; but, results in high localization error.

Background: In this paper, a chaotic interleaving scheme is proposed for further performance improvement of Interleave Division Multiple Access (IDMA). Interleavers are used to generate permuted sequence of signals to be transmitted with optimum correlation. Methods: Random interleaving (RI) was the fundamental taxonomy and used to distinguish the different users in IDMA scheme. The logistic map based chaotic interleaving scheme is suggested for IDMA. The system is also combined with Minimum Mean Square Error (MMSE) equalizer to combat the effect of Inter Symbol Interference (ISI). Results: For the sake of simplicity, no pulse shaping is assumed at the transmitter and ISI channel is considered to be a fixed 3 tap channel. Simulations are performed in MATLAB. BPSK modulation is used. Furthermore, the results show that the IDMA with proposed logistic map based chaotic interleaver outperforms the traditional random interleaving scheme in terms of BER without the need of extra memory and computational complexity. Conclusion: The obtained results show the noticeable performance improvement of CI-IDMA with MMSE equalization in deep fading situations. Chaos based interleaver also offers other advantages such as less requirement of memory and small implementation complexity.

Background & Objective: Cryptographic protocols had been evident method for ensuring con dentiality, Integrity and authentication in various digital communication systems. However the validation and analysis of such cryptographic protocols was limited to usage of formal mathematical models until few years back. Methods: In this paper, various popular cryptographic protocols have been studied. Some of these protocols (PAP, CHAP, and EAP) achieve security goals in peer to peer communication while others (RADIUS, DIAMETER and Kerberos) can work in multiparty environment. These protocols were validated and analysed over two popular security validation and analysis tools AVISPA and Scyther. The protocols were written according to their documentation using the HLPSL and SPDL for analysis over AVISPA and Scyther respectively. The results of these tools were analysed to nd the possible attack an each protocol. Afterwards The execution time analysis of the protocols were done by repeating the experiment for multiple iterations over the command line versions of these tools.As the literature review suggested, this research also validates that using password based protocols (PAP) is faster in terms of execution time as compared to other methods, Usage of nonces tackles the replay attack and DIAMETER is secure than RADIUS. Results and Conclusion: The results also showed us that DIAMETER is faster than RADIUS. Though Kerberos protocol was found to safe, the results tell us that it is compromisable under particular circumstances.

Background & Objective: A sensor network is composed of a large number of sensor nodes that are deployed to perform measurement and/or command and control in a field. Sensor nodes are battery powered devices and replacement or recharging of their batteries may not be feasible. One of the major challenges with sensory wireless networks is excessive energy consumption in nodes. Methods: Clustering is one of the methods that have been offered for resolving this issue. Clustering provides a means to reduce the number of wireless communications that greatly increase the life expectancy of the network. In this paper, we propose a novel hybrid genetic-bees algorithm that harnesses an efficient fitness function. This hybrid algorithm can smartly divide the sensor nodes into clusters and thus reduce the energy consumption. Results and Conclusion: The simulation results show that this algorithm can simultaneously process multiple points in the search grid and also converge to the optimal solution in reasonable time.

Background & Objective: In this paper circularly polarized microstrip planar antenna is proposed in the 5-6 GHz frequency range. With the introduction of Drum sticks slot and a coaxial feed the antenna exhibits excellent Return loss and Axial Ratio characteristics during simulation. Further, a wider AR bandwidth is achieved in the antenna 3 with the introduction of central circular slots. The circularly polarized antenna is fabricated using Arlon AD 250 substrate and this paper presents its design and simulation using optimization engine HFSS. Conclusion: The substrate has a relative permittivity of 2.55 and thickness is 0.76mm.Various characteristics like return loss, impedance, gain, BW and directivity are presented.

Background & Objective: Traffic congestion is a burning issue in most countries due to the rapid growth of running vehicles and infrastructures with limited capacity. Congestion can be solved with Intelligent Transport Systems (ITS) and traffic management. Most traffic management measurement are aimed to improve the safety and flow of traffic, reduce traffic emissions and utilize traffic artery capacity more effectively. Methods: This paper proposes a new system to collect the required data for traffic management such as, number of vehicles, time and lane location information; using a cheap infrared sensors and timers. Conclusion: The proposed method can take the length of the vehicle into account of traffic statistics by measuring the car speed.

Background & Objective: Vertical handover is an inevitable operation demanded in the heterogeneous network to offer consistent connectivity to the user's device during migration from home to a foreign network. Existing literature still shows that there is a large scope for addressing the problem associated with providing seamless service if the latency issue associated with authentication is emphasized. Therefore, the proposed system introduces a very simplified architecture that acts as an external agent for collaborating with various forms of network devices that could exist in the heterogeneous network. Methods: An algorithm is formulated that offers significantly faster authentication mechanism by considering two important attributes, i.e., latency and duration. Without using any form of complex cryptography, this proposed system proved that its architecture could successfully minimize significant delay along with proper retention of throughput. Results and Conclusion: The study outcome has exhibited a computationally efficient vertical handover approach in contrast to the existing system.

Background & Objective: In this paper, a simple design of antipodal Vivaldi antenna for ultra-wideband Radar applications is presented. Methods: The antenna provided to operate across the entire UWB spectrum sins it covers a very wide frequency band from 2.43 up to 13 GHz with better return loss characteristics. In addition, the antenna offers high and flat gain in this band. The numerical designs of the antennas have been performed by using the commercially available software CST MW, which it’s printed on Taconic substrate with a dielectric constant of 4.5 and thickness 1.6 mm. Results and Conclusion: The antenna has a compact dimension of 40 × 50 mm2 achieve satisfactory impedance matching and radiation efficiency.