Wideband Printed Microstrip Antenna for Wireless Communications

A simple electromagnetically coupled wideband printed microstrip antenna having a 2:1 VSWR bandwidth of 38% covering the 5.2/5.8-GHz WLAN, HIPERLAN2, and HiSWANa communication bands is presented. The large bandwidth is obtained by adding a rectangular metal strip on a slotted square microstrip antenna. The antenna occupies an overall dimension of 42 times 55 times 3.2 mm3 when printed on a substrate of dielectric constant 4. It exhibits good radiation characteristics and moderate gain in the entire operating band. Details of the design along with experimental and simulation results are presented and discussed.

A Quasi-Omnidirectional Antenna for Modern Wireless Communication Gadgets

A compact, planar, wideband antenna designed by modifying the coplanar waveguide is presented in this letter. The proposed antenna finds a wide range of applications including advanced wireless systems (AWS), DCS-1800, DCS-1900/PCS/PHS, WiBro, BlueTooth/WLAN/WiBree/ZigBee, DMB, Global Star Satellite Phones, and digital cordless phones. Wide bandwidth > 75% centered at 2.50 GHz, quasi-omnidirectional radiation coverage along with moderate gain and efficiency are the salient features of the antenna. A prototype fabricated on a substrate with dielectric constant 4.4 and thickness 1.6 mm occupies an area of (31times 64) mm2. Details of antenna design and discussions on the effect of various antenna parameters on the radiation characteristics are presented.

Energy-Efficient Cluster based Routing Schemes for Static and Mobile Sensor Networks

The theme of the thesis is centred around one important aspect of wireless sensor networks; the energy-efficiency.The limited energy source of the sensor nodes calls for design of energy-efficient routing protocols. The schemes for protocol design should try to minimize the number of communications among the nodes to save energy. Cluster based techniques were found energy-efficient. In this method clusters are formed and data from different nodes are collected under a cluster head belonging to each clusters and then forwarded it to the base station.Appropriate cluster head selection process and generation of desirable distribution of the clusters can reduce energy consumption of the network and prolong the network lifetime. In this work two such schemes were developed for static wireless sensor networks.In the first scheme, the energy wastage due to cluster rebuilding incorporating all the nodes were addressed. A tree based scheme is presented to alleviate this problem by rebuilding only sub clusters of the network. An analytical model of energy consumption of proposed scheme is developed and the scheme is compared with existing cluster based scheme. The simulation study proved the energy savings observed.The second scheme concentrated to build load-balanced energy efficient clusters to prolong the lifetime of the network. A voting based approach to utilise the neighbor node information in the cluster head selection process is proposed. The number of nodes joining a cluster is restricted to have equal sized optimum clusters. Multi-hop communication among the cluster heads is also introduced to reduce the energy consumption. The simulation study has shown that the scheme results in balanced clusters and the network achieves reduction in energy consumption.The main conclusion from the study was the routing scheme should pay attention on successful data delivery from node to base station in addition to the energy-efficiency. The cluster based protocols are extended from static scenario to mobile scenario by various authors. None of the proposals addresses cluster head election appropriately in view of mobility. An elegant scheme for electing cluster heads is presented to meet the challenge of handling cluster durability when all the nodes in the network are moving. The scheme has been simulated and compared with a similar approach.The proliferation of sensor networks enables users with large set of sensor information to utilise them in various applications. The sensor network programming is inherently difficult due to various reasons. There must be an elegant way to collect the data gathered by sensor networks with out worrying about the underlying structure of the network. The final work presented addresses a way to collect data from a sensor network and present it to the users in a flexible way.A service oriented architecture based application is built and data collection task is presented as a web service. This will enable composition of sensor data from different sensor networks to build interesting applications. The main objective of the thesis was to design energy-efficient routing schemes for both static as well as mobile sensor networks. A progressive approach was followed to achieve this goal.

PEER TO PEER CACHE RESOLUTION MECHANISM FOR MOBILE AD HOC NETWORKS

In this paper we investigate the problem of cache resolution in a mobile peer to peer ad hoc network. In our vision cache resolution should satisfy the following requirements: (i) it should result in low message overhead and (ii) the information should be retrieved with minimum delay. In this paper, we show that these goals can be achieved by splitting the one hop neighbours in to two sets based on the transmission range. The proposed approach reduces the number of messages flooded in to the network to find the requested data. This scheme is fully distributed and comes at very low cost in terms of cache overhead. The experimental results gives a promising result based on the metrics of studies.

Development and Deployment of Wireless Sensor Network in Paddy Fields of Kuttanad

The evolution of wireless sensor network technology has enabled us to develop advanced systems for real time monitoring. In the present scenario wireless sensor networks are increasingly being used for precision agriculture. The advantages of using wireless sensor networks in agriculture are distributed data collection and monitoring, monitor and control of climate, irrigation and nutrient supply. Hence decreasing the cost of production and increasing the efficiency of production. This paper describes the development and deployment of wireless sensor network for crop monitoring in the paddy fields of Kuttanad, a region of Kerala, the southern state of India.

Mobility Metric based LEACH-Mobile Protocol

Cluster based protocols like LEACH were found best suited for routing in wireless sensor networks. In mobility centric environments some improvements were suggested in the basic scheme. LEACH-Mobile is one such protocol. The basic LEACH protocol is improved in the mobile scenario by ensuring whether a sensor node is able to communicate with its cluster head. Since all the nodes, including cluster head is moving it will be better to elect a node as cluster head which is having less mobility related to its neighbours. In this paper, LEACH-Mobile protocol has been enhanced based on a mobility metric “remoteness” for cluster head election. This ensures high success rate in data transfer between the cluster head and the collector nodes even though nodes are moving. We have simulated and compared our LEACH-Mobile-Enhanced protocol with LEACHMobile. Results show that inclusion of neighbouring node information improves the routing protocol.

Safe Contiki OS: Type and Memory Safety for Contiki OS

Embedded systems, especially Wireless Sensor Nodes are highly prone to Type Safety and Memory Safety issues. Contiki, a prominent Operating System in the domain is even more affected by the problem since it makes extensive use of Type casts and Pointers. The work is an attempt to nullify the possibility of Safety violations in Contiki. We use a powerful, still efficient tool called Deputy to achieve this. We also try to automate the process

Energy Aware Cluster-based Multihop Routing Protocol for Sensor Networks

Clustering combined with multihop communication is a promising solution to cope with the energy requirements of large scale Wireless Sensor Networks. In this work, a new cluster based routing protocol referred to as Energy Aware Cluster-based Multihop (EACM) Routing Protocol is introduced, with multihop communication between cluster heads for transmitting messages to the base station and direct communication within clusters. We propose EACM with both static and dynamic clustering. The network is partitioned into near optimal load balanced clusters by using a voting technique, which ensures that the suitability of a node to become a cluster head is determined by all its neighbors. Results show that the new protocol performs better than LEACH on network lifetime and energy dissipation

Safe Contiki OS: Type and Memory Safety for Contiki OS

Embedded systems, especially Wireless Sensor Nodes are highly prone to Type Safety and Memory Safety issues. Contiki, a prominent Operating System in the domain is even more affected by the problem since it makes extensive use of Type casts and Pointers. The work is an attempt to nullify the possibility of Safety violations in Contiki. We use a powerful, still efficient tool called Deputy to achieve this. We also try to automate the process

Slot Line Fed Dipole Antenna For Wide Band Applications

A slot line fed planar dipole antenna with a parasitic strip for wide band applications is presented. The presented antenna offers a 2:1 VSWR bandwidth from 1.66 to 2.71 GHz covering the DCS/ PCS/UMTS and IEEE 802.11b/g bands with a gain better than 6.5 dBi. The uniplanar design, simple feeding, and high gain make it a versatile antenna for wireless applications

Compact asymmetric coplanar strip-fed antenna for wideband applications

An asymmetric coplanar strip-fed uniplanar antenna for wideband applications is presented. The resulting antenna offers a 2:1 VSWR bandwidth greater than 100% from 1.58 to 5.48 GHz covering the DCS/PCS/IEEE 802.11a/WiMAX bands. The antenna has an overall dimension of 44 × 35 mm2 when printed on a substrate of dielectric constant 4.4 and height 1.6 mm. The design equation is also presented in this article. The antenna exhibits good radiation characteristics and moderate gain in the entire operating band.

Mobility Metric based LEACH-Mobile Protocol

Cluster based protocols like LEACH were found best suited for routing in wireless sensor networks. In mobility centric environments some improvements were suggested in the basic scheme. LEACH-Mobile is one such protocol. The basic LEACH protocol is improved in the mobile scenario by ensuring whether a sensor node is able to communicate with its cluster head. Since all the nodes, including cluster head is moving it will be better to elect a node as cluster head which is having less mobility related to its neighbours. In this paper, LEACH-Mobile protocol has been enhanced based on a mobility metric “remoteness” for cluster head election. This ensures high success rate in data transfer between the cluster head and the collector nodes even though nodes are moving. We have simulated and compared our LEACH-Mobile-Enhanced protocol with LEACHMobile. Results show that inclusion of neighbouring node information improves the routing protocol.

Design of a Compact Multiband Microstrip Antenna

A compact microstrip multiband antenna on a modified ground plane which can operate over the bands starting from 900 MHz to 5.35 GHz which includes the GSM (880-960) GPS (1568-1592 MHz), DCS (1710-1880 MHz), and PCS (1850- 1990 MHz). UMTS (1920-2170 MHz), IEEE 802.11 b/g (2400- 2484) and WLAN IEEE 802.11a band (5.15-5.35) is reported in this paper. The overall dimension of the antenna is 33 x 33 mm2 including the top patch with a dimension 22 x 22 mm2. The experimental results of the antenna are presented in this paper. The results confirm that the antenna exhibits wide band characteristics and covers 7 bands of operation

Energy Efficient Cache Discovery in Wireless Mobile Ad oc Networks

Data caching is an attractive solution for reducing bandwidth demands and network latency in mobile ad hoc networks. Deploying caches in mobile nodes can reduce the overall traf c considerably. Cache hits eliminate the need to contact the data source frequently, which avoids additional network overhead. In this paper we propose a data discovery and cache management policy for cooperative caching, which reduces the power usage, caching overhead and delay by reducing the number of control messages flooded into the network .A cache discovery process based on position cordinates of neighboring nodes is developed for this .The stimulstion results gives a promising result based on the metrics of the studies.