Sensors are getting smaller, inexpensive and sophisticated, with an increased availability. Compared to 25 years ago, an object tracking system now can easily achieve twice the accuracy, a much larger coverage and fault tolerance, without any significant changes in the overall cost. This is possible by simply employing more than just one sensor and processing measurements from individual sensors sequentially (or even in a batch form). %This is the centralized scheme of multi-sensor target tracking wherein the sensors send their individual detections to a central facility, where tracking related tasks such as data association, filtering, and track management etc. are performed. This is also perhaps the simplest solution for a multi-sensor approach and also optimal in the sense of minimum mean square error (MMSE) among all other multi-sensor scenario. In sophisticated sensors, the number of detections can reach thousands in a single frame. The communication and computation load for gathering all such detections at the fusion center will hamper the system's performance while also being vulnerable to faults. A better solution is a distributed architecture wherein the individual sensors are equipped with processing capabilities such that they can detect measurements, extract clutter, form tracks and transmit them to the fusion center. The fusion center now fuses tracks instead of measurements, due to which this scheme is commonly termed track-level fusion. In addition to sub-optimality, the track-level fusion suffers from a very coarse problem, which occurs due to correlations between the tracks to be fused. Often, in realistic scenarios, the cross-correlations are unknown, without any means to calculate them. Thus, fusion cannot be performed using traditional methods unless extra information is transmitted from the fusion center. This thesis proposes a novel and generalized method of fusing any two probability density functions (pdf) such that a positive cross-correlation exists between them. In modern tracking systems, the tracks are essentially pdfs and not necessarily Gaussian. We propose harmonic mean density based fusion and prove that it obeys all the necessary requirements of being a viable fusion mechanism. We show that fusion in this case is a classical example of agreement between the fused and participating densities based on average $\chi^2$ divergence. Compared to other such fusion techniques in the literature, the HMD performs exceptionally well. Transmitting covariance matrices in distributed architecture is not always possible in cases for e.g. tactical and automotive systems. Fusion of tracks without the knowledge of uncertainty is another problem discussed in the thesis. We propose a novel technique for local covariance reconstruction at the fusion center with the knowledge of estimates and a vector of times when update has occurred at local sensor node. It has been shown on a realistic scenario that the reconstructed covariance converges to the actual covariance, in the sense of Frobenius norm, making fusion without covariance, possible. / Thesis / Doctor of Philosophy (PhD)

This thesis gives a unified framework to formulate and solve resource management problems in radar systems. / As a crucial factor in improving radar performance for multiple target tracking (MTT), resource management problems are analyzed in this thesis with regard to sensor platform path planning, beam scheduling, and burst parameter design. This thesis addresses problems to deploy or adapt radar configurations for multisensor-multitarget tracking, including 1) the path planning of movable receivers and power allocation of transmitted signals, 2) the optimal beam steering of high-precision pencil beams, and 3) the pulsed repetition frequency (PRF) set selection and waveform design. Firstly, the coordinated sensor management on the ends of both receivers and transmitters for a multistatic radar is studied. A multistatic radar system consists of fixed transmitters and movable receivers. To form better transmitter-target-receiver geometry and to establish an effective power allocation scheme to illuminate targets with different priorities, a joint path planning and power allocation problems, which determines the moving trajectories of receivers mounted on unmanned airborne vehicles (UAVs) and the power allocation scheme of transmitted signals over a limited time horizon, is formulated as a weighted-sum optimization. The problem is solved with a genetic algorithm (GA) with a novel pre-selection operator. The pre-selection operator, which takes advantage of the receding horizon control (RHC) framework to improve population structures prior to the next generation, can accelerate the convergence of GA. Secondly, the beam steering strategies for a cooperative phased array radar system with high-precision beams are developed. Pencil beams with narrow beamwidth, which are designated to track targets for a phased array radar, offer efficient performance in an energy-saving design, but can cause partial observations. The novel concept of expected Cramér-Rao lower bound (EPCRLB) is proposed to model partial observations. A formulation based on PCRLB is given and solved with a hierarchical genetic algorithm (HGA). An optimal strategy based on EPCRLB, which is effective in performance and efficient in time, is proposed. Finally, a joint pulsed repetition frequency (PRF) set selection and waveform design is studied. The problem tries to improve blind zone maps while preventing targets from falling into blind zones. Waveform parameters are then optimized for the system to provide better tracking accuracy. The problem is first formulated as a bi-objective optimization problem and solved with a multiple-objective genetic algorithm. Then, a two-step strategy that prioritizes the visibility of targets is developed. Numerical results demonstrate the effectiveness of proposed strategies over simple approaches. / Thesis / Doctor of Philosophy (PhD) / This thesis formulates resource management problems in various radar systems. The problems use PCRLB, a theoretically achievable lower bound for estimators, as a metric to optimize, and help the configuration of radar resources in an efficient manner. Effective strategies and improved algorithms are proposed to solve the problems.

Extended Berkeley Packet Filter (eBPF) is an instruction set and an execution environment inside the Linux kernel. eBPF improves flexibility for data processing and is realized via a virtual machine featuring both a Just-In-Time (JIT) compiler and an interpreter running in the kernel. It executes custom eBPF programs supplied by the user, effectively moving kernel functionality into user space. eBPF has received widespread adoption by companies such as Facebook, Netflix, and academia for a wide range of application domains. eBPF can be used to program the eXpress DataPath (XDP), a kernel network layer that processes packets closer to the NetworkInterface Card (NIC) for fast packet processing. In this thesis, eBPF with XDP, and Iptables, are considered as a Network function(NF), implemented in a Virtual Machine (VM) for packet filtering. The traffic source(source VM) and traffic sink (destination VM) are present in the same subnet. The aim of this thesis is, to understand and investigate the implementation of NFs inVMs and to analyze performance metrics. In VirtualBox, VMs are created to implement the NFs. The results are obtained for the measurements that are essential for the performance evaluation of the NFs, and presented in graphs.

No description available.

No description available.

No description available.

No description available.

No description available.

No description available.

No description available.