Abstract
Wireless Sensor Network is a network formed by the interconnection of sensor nodes, capable of communicating over wireless links. WSN can be used for a variety of applications. WSNs are primarily used in a scenario where human cannot survive but now we are witnessing many more applications of wireless sensor network which are useful for industry, environment, health and the entire universe. Some of these applications include industrial process automation, monitoring, inventory management, contaminant monitoring, forest fire detection, temperature control and humidity control, habitat monitoring of species, health monitoring and so on. WSNs have the potential to be used in many more applications. To make them applicable for other applications, protocols are required to organize individual nodes to create a network, localization techniques to locate individual nodes in the network and routing protocols to save energy to enhance overall lifetime of network. The dissertation addresses two of the above mentioned issues of WSNs. These issues include self organization of the nodes to create a network and localization of the nodes in the area of deployment. This dissertation propose design and analysis of a novel clustering algorithm to organize the nodes in the network and two localization technique, one for two dimensional deployment and another for three dimensional deployment. The overall objective of the protocols developed, is to reduce the energy consumption of the individual node for exchanging control information which results into the enhancement of overall network lifetime.

Clustering Protocols are important to enhance the lifetime of the network. The clustering algorithm proposed in the thesis uses traffic pattern of the network to create clusters. The algorithm creates clusters in a manner that can balance inter cluster traffic and inter cluster traffic coming on the cluster heads. Simulation result shows that the proposed clustering approach is capable of selecting cluster heads to balance the traffic in the network and enhance overall life time of the network.

Localization of the nodes is important in sensor network for location aware sensing applications. This thesis is proposing two localization algorithms for WSN. The first algorithm is proposed for localization in two dimensional area and using directional antenna for its implementation. Simulation results shows that the algorithm work well and produce results with acceptable accuracy. The effect of various parameters on the performance of proposed algorithm has also been analyzed.

The second localization algorithm has been proposed for localization in three dimensional space using MDS. The main contribution of the algorithm is to produce distance matrix representing distance of each node to all the other nodes in the network based on the local connectivity information of the nodes. The localization algorithm also propose to use Helmert transformation[130] to convert the local coordinates of the node obtained from MDS into a global coordinate system defined by the anchor nodes present in the network. Simulation results verify that the algorithm is capable of locating nodes in WSN with acceptable accuracy. The effect of various parameters on the performance of proposed algorithm has also been analyzed.

M.Tech. Thesis

Title : Efficient Handover Management in Wireless ATM to assure QoS

Abstract
In the thesis, the problem related to handover in Wireless ATM networks is discussed and its remedy is explained. Though the domain of the handover problem is very wide and a number of handover solutions are available. Researcher are concentrated on various aspects of handover problems and tried to give solution for it. Mobility support and signaling architecture are two the main areas which is closely related to handover process. Then a handover solution based on the proposed signaling architecture is presented. The handover process is devised such that it assures a lossless and insequence cell delivery. The lossless and insequence cell delivery is achieved through the use of inband marks (ATM cells presenting certain marks as end of data). These inband marks and cell forwarding from old AP to new AP assures that the handover process is lossless and cell delivery is in the right sequence.

In the next part of thesis work, need of buffering and forwarding at APs and need for buffering at MT is explained with some theoretical setup. Then the amount of buffer required at APs and the overall handover delay is calculated for the proposed handover scheme.

Projects Done at Master’s (M.Tech.) Level

1. Name: Ad-hoc Routing protocol performance study
   Description : Simulation of Ad-hoc Routing protocol( AODV) With 802.11 at MAC layer in NS-2.
   
   
2. Name : Study of IPV6
   Description: Worked at IPV6 testbed at IIIT–A to perform following task:
       Stateless auto configuration
       6 to 4 Conversion of Packets
   
   
3. Name: Improvement of TCP protocol for wireless links
   Description: Tried to make TCP more robust and making it suitable for wireless networks by the implenentation of Snoop method available.

4. Name : Simulation of call setup through Base Station between  two mobile hosts
   Description :    I used C and linux socket programming to simulate call setup between two users through base station and base station is responsible for all the call managment setup.

5. Name : File Transfer Protocol Implementation
   Description: Implementation the trivial ftp protocol using Linux Socket Programming.

Projects Done at Undergraduate (B.Tech.) Level

1. Name : Chart Mastering using C
   Description:  An software for preparing pie, line and bar chart from give collection of data.

2. Name : Analysis  and Design of medical stock management
   Description: Study of various requirement of various medical stockiest and provide  a software for maintaining their stock and account. 

3. Name: Data Management Using C++
   Description: A program for handling large amount of data and implement techniques to query data from the database.