Research
 

Stealth Routing 

The problem of stealth in sensor networks is defined as the ability to observe intruders without the intruders being able to observe or locate the nodes of the sensor network. A node is stealthy if the adversary does not know about its existence. A node is disclosed if the adversary can accurately locate the node; this usually allows physical access to the node. In our research, we concentrate on the problem of organizing the wireless networking activity of a sensor network in such a way that it minimizes the chance of disclosure.


Mobile Sink in Sensor Networks

Conventional edge sinks in sensor networks result in excessive energy drain in nodes near sink. A mobile sink collects data from each node or cluster of nodes, reducing the energy cost of routing.


LVC Simulation Modeling Using High Performance Computing

This research project proposes the creation of a test bed and the generation of initial simulations where data can be gathered that depicts some of the trade-offs needed to make intelligent architectural and design decisions. More information is at http://hector.cs.ucf.edu/lvc/ or www.mzubair.net/web/lvc_pageAn LVC (Live, Virtual, Constructive) analysis tool is prototyped using the underlying OPNET software. An SIW paper is written for the work done at the project. An SIW paper is written for the work done at the project.