43 research outputs found
Triple Band Printed Modified Bow-tie Antenna for RFID Reader/ISM Applications
No full textAbstractA modified bow-tie antenna, which finds potential use in Radio Frequency Identification (RFID) / Industrial, Scientific and Medical (ISM) applications, is proposed. Triple band operation is facilitated by applying trapezoidal truncations on both arms of the bow-tie antenna. The major attractive feature of the proposed antenna is its improved bandwidth for triple band operation particularly in different RFID bands. A considerable size reduction of the patch area is also achieved for the proposed structure. The simulated results for the return loss characteristics are in good agreement with the measured results
Series SRR Loaded UHF RFID Tag
No full textAbstractAn RFID tag based on a series loaded split ring resonator (SRR) to operate in the European UHF RFID band of 865-867MHz is reported. A chip of impedance 27-j212Ω is connected at the terminals of the antenna and the read range measurements of the RFID tag are performed in the UHF RFID band. The proposed UHF tag exhibits appreciably good read range over a wide azimuth and elevation angular ranges
Secure Data Aggregation in Wireless Sensor Network using Chinese Remainder Theorem
No full textA new method of lossless Secure Data Aggregation for Wireless Sensor Network is presented. Secure Data Aggregation is achieved using the popular Chinese Remainder theorem. Here, an ‘Augmented Chinese Remainder System’ is introduced that incorporates additional features to enforce a higher level of security to the aggregated data. The scheme provides inbuilt signature verification and eliminates the need for separate data validation algorithms. The method achieves data integrity and authentication simultaneously in addition to lossless data aggregation for the data forwarded from the Cluster Head to the Base Station. The aggregate contains the entire individual data from sensors in the encrypted form and the receiver deaggregates it to get the original data in full without any loss. The Augmented Chinese Remainder System can be extended to secure Multi-level Data Aggregation for WSN
Congestion bottleneck avoid routing in wireless sensor networks
No full textA new efficient method for detecting congested bottleneck nodes and avoiding them in the route formation in a wireless sensor network is described. Sensor nodes with a higher degree of congestion are excluded while determining the best routing path from a given source to destination in a multi-hop transmission. In a scenario where different communication paths have different maximum congestion levels, selecting that path which has least maximum congestion, is a challenging task. A modified Bellman-Ford algorithm is proposed to solve this problem efficiently. The proposed technique is very much useful for the optimal route selection for vehicles in metropolitan cities that avoids high traffic density junctions. Once the desired destination is specified, the traffic control system can use this algorithm to provide the least congested routes to the intra-city vehicles
Minimum Bend Shortest Rectilinear Route Discovery for a Moving Sink in a Grid Based Wireless Sensor Network
No full textIn a rectilinear route, a moving sink is restricted to travel either horizontally or vertically along the connecting edges. We present a new algorithm that finds the shortest round trip rectilinear route covering the specified nodes in a grid based Wireless Sensor Network. The proposed algorithm determines the shortest round trip travelling salesman path in a two-dimensional grid graph. A special additional feature of the new path discovery technique is that it selects that path which has the least number of corners (bends) when more than one equal length shortest round trip paths are available. This feature makes the path more suitable for moving objects like Robots, drones and other types of vehicles which carry the moving sink. In the prosed scheme, the grid points are the vertices of the graph and the lines joining the grid points are the edges of the graph. The optimal edge set that forms the target path is determined using the binary integer programming
Microstrip multi-stopband filter based on tree fractal slotted resonator
No full textThis paper presents the design and development of a new microstrip multi-stopband filter based on tree fractal slotted resonator. A single square patch with tree fractal slots of different iterations are employed for realizing dual stopband and tri-stopband filters. The tree fractal slotted resonators are generated from conventional square patch using an iterative tree fractal generator method. First, second and third level iterations of the tree fractal slot resonator are used to design dual and tri-stopband filters respectively. The first level iteration introduced for the tree fractal slot realizes dual bands at 2.64 GHz and 3.61 GHz while the second level iteration provides better stopband rejection and insertion loss at 2.57 GHz and 3.56 GHz. The tri-stopband filter generates three resonance frequencies at 1.53 GHz, 2.53 GHz and 3.54 GHz at third level iteration. By varying the slot length and width of the tree fractal slot, the resonant frequencies can be adjusted and stopbands of the proposed filter can be tuned for the desired unwanted frequency to be rejected. The proposed narrowband filters finds application in removing the interference of GPS and Wi-Max narrowband signals from the allotted bands of other wireless communication system
Minimum Bend Shortest Rectilinear Route Discovery for a Moving Sink in a Grid Based Wireless Sensor Network
No full textIn a rectilinear route, a moving sink is restricted to travel either horizontally or vertically along the connecting edges. We present a new algorithm that finds the shortest round trip rectilinear route covering the specified nodes in a grid based Wireless Sensor Network. The proposed algorithm determines the shortest round trip travelling salesman path in a two-dimensional grid graph. A special additional feature of the new path discovery technique is that it selects that path which has the least number of corners (bends) when more than one equal length shortest round trip paths are available. This feature makes the path more suitable for moving objects like Robots, drones and other types of vehicles which carry the moving sink. In the prosed scheme, the grid points are the vertices of the graph and the lines joining the grid points are the edges of the graph. The optimal edge set that forms the target path is determined using the binary integer programming
In-network Data Compression in Wireless Sensor Networks Using Distributed Block Truncation Coding
No full textCluster head placement in Wireless Sensor Network for reliable connectivity and lifetime extension
No full text
