- SeonYeong Han -- Wireless Channel Models for Packet Simulation
- Adnan Majeed -- Applied Optimization Models for MHWNs
- Saquib Razak -- Topic undetermined yet
- Vikram Munishwar -- Surveillance Network
- Ketan Bahulkar
- Shailendra Singh
- Dr. Sameer Tilak -- San Diego Super Computing Center (part of UCSD). Dissertation topic: A Holistic Approach for Sensor Network Design. MS thesis
- Dr. Paul Rogers -- IBM. Robustness Issues in Ad hoc Networks
- Dr. Vinay Kolar -- Fundamental Properties of Multi-hop Wireless Networks
- Dr. Ke Liu -- Greedy Routing for Sensor Networks
- Dr. Weishuai Yang -- Self Configuring P2P Grids
- Faris Khundakjie -- Intel. Distributed Concurrent Neighborhood-based Channel Assignment for Multiple Channel MAC for Ad hoc networks
- Kaushik Balasubramanian
- Vinay Kolar (continued as PhD student) -- Directional Antenna Protocols for MANETs (thesis)
- Ke Liu (continued as PhD student) -- Real Time Dissemination in Sensor Networks (thesis)
- SeonYeong Han (currently PhD student) -- Analysis of the Effect of Shadowing in MANETs (thesis)
- Ranjit Noronha -- Ph.D. student, Ohio State U. PDES Optimization for Clusters using Programmable Network Interface Card Support (thesis)
- Nikhil Panchal -- Goldman Sachs. Active Route Cache Optimization for Ad hoc Networks (thesis)
- Nilesh Pisolkar -- Hughes Networks, San Diego. Distributed Multiple-SIMD Processor in Memory (project)
- Nitesh Ajmera -- Analysis of Webcaching Alternatives (project)
- Sonal Dedhia -- Location Aware Application Infrastructure
- Christian Bongiorno -- IP traceback
- Moushumi Ghosh -- Parallel VLSI Placement using a Cluster of Workstations (project)
- Rohit Mathur -- Memory Subsystem Analysis for Data Intensive Applications (thesis)
- Anil Dalwani -- VLSI Demonstration of a Processor in Memory Architecture (thesis)
- Raman Sivasankar -- analysis of TCP on Ad hoc networks
- Deepak Patnam -- TCP Optimization for wireless Networks
- Ridvan Kahvecioglu -- HP, Turkey -- Preemptive AODV Implementation (project)
Mobile Ad hoc Networking Protocols
Summary:
Summary: Mobile Ad hoc networks (MANETs) are infrastructureless networks of mobile devices connected using wireless communication. They have several important military and commercial applications and are forecast to become even more important in the future. In practice, and in simulation, these networks do not perform well (much below expected capacity). They also suffer from unfairness unreliability and unexpected behavior. This is due to a number of reasons at different levels of the networking protocol stack. Our research in this area focuses on solving some of these issues.
Application Level Protocols for Sensor Networks
Summary:
Summary: There are a number of proposed protocols for routing, medium access and data aggregation for sensor networks . optimizing the process of transporting a predefined reporting discipline to an observer. In contrast, little work has addressed the problem of which data to send and when to send it . how to determine the appropriate reporting discipline. An inefficient reporting discipline can result in bad performance both from an application perspective as well as from a networking and energy efficiency perspective, even if aggregation is carried out. For example, an inefficient reporting discipline may result in data being sent at too high a rate (or too low a rate), from sensors that are not in areas of interest, or redundantly from sensors reporting on the same phenomenon. In addition, congestion may arise if the reporting discipline is not carefully selected and monitored. Developing application protocols that converge on an efficient reporting discipline is the focus of our research. Ideally, the application protocol will allow an observer to specify her interests in terms of the phenomena, independent of the underlying sensor network infrastructure. The protocol will then converge on a reporting discipline that achieves the desired application objectives while minimizing the load on the network.
Our approach to achieving this objective is an application level framework that works as follows. An interest expressed in terms of the phenomenon is diffused through the network, setting up a reduction tree from the sensors towards the observer. The sensors report through this tree and intermediate nodes serve as aggregation and control points that configure the subtree rooted at them. The sensors respond with their coverage capabilities relative to the diffused interest query. The observer then selects a subset of the available coverage to meet its interest, and informs the responsible sensors to set up the reporting discipline. Note that the observer informs only its directly connected children, which in turn select the coverage from their own children to meet their responsibility to the observer. This operation is carried out recursively . all aspects of protocol operation are localized. In addition to the application requirements, the reporting discipline must be effective from a networking perspective . it should not create congestion and it should rotate responsibilities to balance the load. Finally, the protocol should adapt the reporting discipline in response to network and phenomenon dynamics. There are several open research problems that exist in such a framework . we are currently pursuing solutions to them.
Faris is maintaining a conference list page for mobile networks. Please contact him to add a conference or to add your name to the working list on any conference.
Parallel Discrete Event Simulation
Summary:
Computer simulation has become accepted as the third method for scientific experiments (mathematical modeling and experimental measurements being the other two). Simulation provides well known advantages over the other two methods and is a primary research vehicle in many diciplines. As the size of the problems continues to grow, there is considerable interest in building simulation engines capable of simulation of complex systems. Parallel simulation is a promising approach to scale the size and performance of large scale system simulation. With parallel simulation, one of the primary challenges is synchronization among the simulator processes to exchange events that cross the process boundary. We focus on optimistically synchronized simulators where the simulators process local events without coordination with other simulators. In such an environment, a process may erroneously advance its time because an event from another process has not been received yet. To recover from such events, the processes take checkpoints of their state. If a process receives an event in its past, it rolls back to the closest checkpoint before the event and resumes the computation from there. Our research focuses on optimization of several aspects of the simulator engine.
Current Research Problems include:
- Optimization of the WARPED time-warp simulation kernel on a high-performance cluster, including support on the network interface card
- Distributed Experiments -- sculpting application specific distributed simulators
- Optimizing communication in message-passing Time Warp (e.g., using message aggregation and infrequent polling)