Bandwidth Estimation in Network Probing Techniques Utilizing Min-Plus Algebraic Methods
Diagnosis of Anemia using Non-Invasive Anemia Detector through Parametrical Analysis
The Effectiveness of Jaya Optimization for Energy Aware Cluster Based Routing in Wireless Sensor Networks
Stress Analysis and Detection from Wearable Devices
Intrusion-Tolerant Sink Configuration: A Key to Prolonged Lifetime in Wireless Sensor Networks
Channel Estimation and It’s Techniques: A Survey
Impact of Mobility on Power Consumption in RPL
FER Performance Analysis of Adaptive MIMO with OSTBC for Wireless Communication by QPSK Modulation Technique
Implementation of Traffic Engineering Technique in MPLS Network using RSVP
Performance Evaluation of Advanced Congestion Control Mechanisms for COAP
DGS Based MIMO Microstrip Antenna for Wireless Applications
A Review on Optimized FFT/IFFT Architectures for OFDM Systems
Balanced Unequal Clustering AlgorithmFor Wireless Sensor Network
HHT and DWT Based MIMO-OFDM for Various ModulationSchemes: A Comparative Approach
Study and Comparison of Distributed Energy Efficient Clustering Protocols in Wireless Sensor Network: A Review
Diagnosis of Anemia using Non-Invasive Anemia Detector through Parametrical Analysis
Due to unavoidable environmental factors, the wireless sensor networks are facing numerous tribulations regarding network coverage. This arose due to the uncouth deployment of the sensor nodes that influence the performance. To enhance the network coverage, a node deployment based Bodacious-instance Mechanism (BiM) has been proposed. Each instance describes a solution for the deployment of sensor nodes individually. Further variations of various parameters of BiM such as loudness, pulse emission rate, maximum frequency, grid points, and sensing radius has been explored and optimized values of these parameters are identified. The simulation results of node deployment based on tuned Bodacious-instance mechanism is also compared with BiM and fruit fly optimization algorithm (FOA) based node deployment in terms of mean coverage rate, computation time, and standard deviation. The coverage rate curve for various numbers of iterations and sensor nodes are also presented for tuned Bodacious-instance Mechanism, BiM, and FOA. The results demonstrate the effectiveness of tuned Bodacious-instance mechanism as it achieves more coverage rate than BiM and FOA.
Radix-2k delay feed-back and radix-K delay commutator are the most well-known pipeline architecture for FFT design. The radix-2k fast Fourier transform algorithm is employed to achieve low power at the same time a radix-2 FFT algorithm reduced number of twiddle factor multiplication it reduces the area. This article describes a novel radix-24 multiple delay commutators called 4 - path feed forward FFT architecture utilizing the advantages of the radix-2 algorithm, such as simple butterflies and less memory requirement. Therefore, it is more efficient in terms of hardware and higher throughput by implementing parallelism and multiple delay commutator. Combining benefits of both radix-2 algorithm and feed forward architecture, the proposed 4-path radix-24 FFT processor achieves the lowest hardware requirements for multipliers which is 20% lesser and power consumption which reduces more than 30% when compared with dual path radix-22 and radix-24 delay feedback FFT architecture. The entire FFT algorithms were implemented in Verilog hardware description language and synthesized with 90 nm Technology Libraries using Cadence RTL Compiler.
In wireless sensor networks, there are many routing protocols proposed for data dissemination to mobile sinks and delivers the data to sink mobility has been considered as an excellent work to balance the nodes for the consumption of energy. For more benefits, the data dissemination to the mobile sink is a challenging task for the sensor nodes due to the active network topology pretentious by the sink motion. Nodes need to reconstruct their routes to the newest location of the sink for efficient data delivery which destabilizes the energy protection goal. A Virtual Grid-Based Efficient Data Dissemination (VGEDD) protocol is presented in this paper. It is a routing approach which minimizes the sensor node cost of reconstruction of routes. This approach maintains the best route nearby to the sink node's latest location. In this paper, a set of rules are proposed for communication that manages the routes reform method, thus it needs only a limited number of nodes to rearrange their data delivery routes. Performance analysis shows that Virtual Grid-Based Efficient Data Dissemination (VGEDD) protocol demonstrate improved network lifetime and reduced routes reform cost when compared with existing method. In this paper, we also analyse the developing techniques for lifetime improvement of mobile sink in Wireless Sensor Networks (WSN).
Mobility management in Mobile Wireless Sensor Networks (MWSNs) is a complex problem that must be taken into account. In MWSN, nodes move in and out of the network randomly. Hence, a path formed between two distant nodes is highly susceptible to changes due to unpredictable node movement. Also, due to the limited resources in WSN, the paths used for data transmission must be tested for the link quality and time consumed for data forwarding. In order to solve these issues, in this paper, an Ant based routing protocol with QoS effective data collection mechanism is proposed. In this protocol, the link quality and link delay are estimated for each pair of nodes. Link quality is estimated in terms of Packet Reception Rate (PRR), Received Signal Strength Indicator (RSSI) and Link Quality Index (LQI). A reliable path is chosen from the source to the destination based on the paths traversed by forward ants and backward ants. Then, if the link is found to be defective during data transmission, a link reinforcement technique is used to deliver the data packet at the destination successfully. The mobile robots collect the information with high data utility. In addition each mobile robot is equipped with multiple antennas and Space Division Multiple Access (SDMA) technique is then applied for effective data collection from multiple mobile robots. Simulation results show that the proposed routing protocol provides reliability by reducing the packet drop and end-to-end delay when compared to existing protocols.
A wireless Mesh network comprises of three fundamental components: hubs, portals, and software. The spatially distributed measurement hubs interface with sensors to monitor assets or their environment. Right now the improved Multiple Radios and Multiple Channels (MRMC) protocol in Wireless Mesh Networks (WMNs) is implemented based on Advanced Ant Colony Optimization (AACO) optimization scheme. AACO is utilized to give a corresponding way to every link in case of its failure. Right now mutation operator is used and the new mutation rate is created by the self-versatile methodology. The proposed approach assists to reduce the load and drops in network so utilizing the proposed methodology the Quality of Service (QOS) parameters, for example, packet delivery ratio, throughput, overheads, average end-to-end delay, average energy consumption are improved as shown in result. The improvement of 16% is shown between the existing and proposed approach in above defined features.