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
Implementation of Traffic Engineering Technique in MPLS Network using RSVP
FER Performance Analysis of Adaptive MIMO with OSTBC for Wireless Communication by QPSK Modulation Technique
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
In this paper a printed micro strip line fed wide slot antenna is presented. A slotted parasitic patch is introduced to improve the gain along with the bandwidth. For bandwidth improvement a slotted technique is used in ground of the antenna along with rotation in patch and a simple 50 ? microstrip line fed is used to excite the slot in the antenna. Various parameters such as return loss, bandwidth and gain are analyzed and discussed in this paper. The result shows that a good amount of bandwidth ( 3.2 GHz) and gain (approx. 6.63 dB) is achieved ranging from 2.23 to 5.4 GHz which shows its application in WIMAX and WLAN bands and is compared with a printed antenna without parasitic patch. The area the of proposed design is miniaturized up to 77%.The printed designs of antenna are simulated by using Ansoft HFSS software version 14.
The impact of Wireless Sensors Networks used in healthcare domains has increased drastically nowadays. The sensors were used to sense the data and subjected to identify the purpose based on the mode it is designed. In this work, the authors have identified an area in the health segment where the usage of sensor node is to identify the person and subsequently identifies the issues based on the value that is stored in the system. When the desired value is reached or attained, the sensors will emit its identification using LED indicator and corresponding methods were adopted to prevent it. The health issues dealt in this paper is for identifying uric acid content in kidney levels. The sensor deployed in this work uses TMOTE low power sensor for tracking and identifying the issues. The work also helps to identify person based on the symptom and evaluation. The TMOTE power sensor though has its own constraints with memory and the proposed work stores the data only in binary format and maximizes the in build memory space.
Wireless Sensor Network (WSN) is a group of sensor nodes which acquaint themselves over wireless channels and adversary who tries to capture and compromise nodes of a network. An adversary introduces clone to compromise larger area and extracts the secret keys from the sensor node or reprogram them. Clone attack is very hazardous and should be detected as soon as possible to protect our network. Recently, different clone detection schemes where proposed for WSNs, taking into consideration various network configurations and deployment strategies. In this paper the analysis is done on the existing clone detection schemes with regard to their device type, detection methodology, deployment strategy, and detection ranges. Simulation experiments are conducted to show variations in their performance. Finally, the authors are concluding that Randomized, Efficient and Distributed (RED), and Parallel Multiple Probabilistic Cells (P-MPC) schemes have shown good results for static sensors (under random uniform deployment and grid deployment respectively) compared to other schemes which the authors have been taken into consideration. For mobile sensor networks there is no such efficiently working scheme with existing approaches because of its maneuverability.
Anonymous routing protocols are used in Mobile Ad Hoc Networks (MANETs) to hide node identities and/or routes from outside observers in order to provide anonymity. There are routing protocols that depend on either hop by hop encryption or redundant traffic. All the existing anonymous routing protocols will either produce high cost or cannot produce fully fledged anonymity protection to sources, destinations and routes. The high cost aggravates the indigenous resource constraint problem in MANETs especially in multimedia wireless applications. The demerits of existing protocols leads the need of new and efficient protocol i.e., Anonymous routing protocol robust to node failure. Our proposed protocol dynamically divides the network field into zones and randomly chooses nodes in zones as intermediate relay nodes, which form a non-traceable anonymous route. And it hides the data sources/destinations among many sources/destinations to strengthen source and destination anonymity protection. Additionally, it chooses nodes which have sufficient energy to transmit the packets in order to avoid route failure and to increase route efficiency.
A network with sensor nodes has limited wireless computational power to process and transfer the live data to the base station or data collection center. Therefore, to increase the sensor area and the transmission area, the wireless sensor network usually contains many sensor nodes. In this paper a fault node recovery algorithm to improve the lifetime of a wireless sensor network when some of the sensor nodes shut down is proposed with unequal cluster-based Routing Protocol divides a network in clusters groups which gives good efficiency for fault node processing. The algorithm is based on the grade diffusion algorithm combined with the genetic algorithm .The algorithm can result in fewer replacements of sensor nodes and more reused routing paths. In our simulation, the proposed algorithm increases the number of active nodes, reduces the rate of data loss, and reduces the rate of energy consumption .The traditional approaches to sensor network routing include the directed diffusion (DD) algorithm and the grade diffusion (GD) algorithm. The algorithm proposed in this paper is based on the GD algorithm, with the goal of replacing fewer sensor nodes that are inoperative or have depleted batteries, and of reusing the maximum number of routing paths. These optimizations will ultimately enhance QOS parameters as well as the lifetime of sensor network.