Santpal Singh Dhillon

Learn More
We present two algorithms for the efficient placement of sensors in a sensor field. The proposed approach is aimed at optimizing the number of sensors and determining their placement to support distributed sensor networks. The optimization framework is inherently probabilistic due to the uncertainty associated with sensor detections. The proposed algorithms(More)
− We present a resource-bounded optimization framework for sensor resource management under the constraints of sufficient grid coverage of the sensor field. We offer a unique “minimalistic” view of distributed sensor networks in which sensors transmit/report a minimum amount of sensed data. The proposed theory is aimed at optimizing the number of sensors(More)
In this paper we propose the use of a lattice based second order infinite impulse response (IIR) notch filter with a simplified adaptation algorithm for removal of power line frequency from ECG signals. The performance of this filter is better as compared to a second order infinite impulse response (IIR) notch filter for a real time ECG recording systems(More)
We study the performance of ant routing for static and dynamic network topologies. We also compare the performance of ant routing with AODV and DSR for ad hoc networks. The simulations show that the ant routing algorithm performs well for static topologies. However, the routing overhead in ant routing is more than AODV and DSR. Therefore, ant routing(More)
Distributed sensor networks (DSNs) are a key part of the surveillance and reconnaissance infrastructure in any modern military system. DSNs offer several important benefits, such as ease of deployment, responsiveness to battlefield situations, survivability, agility and easy sustainability. These benefits make DSNs a lethal weapon for the US army, providing(More)
This document presents a refinement of the state of the art QoS protocols and mechanisms for Personal networks as presented in the previous deliverable. In the first part of the document efficient searching for resources and services in Personal Networks is addressed. There are two common methods employed for searching: Flooding and Random Walks (RW), where(More)
Personal networks (PNs) are future communication systems that combine wireless and infrastructure based networks to provide users a variety of services anywhere and anytime. PNs introduce new design challenges due to the heterogeneity of the involved technologies, the need for self-organization, the dynamics of the PN composition, the application-driven(More)