Detection of complex point targets with distributed assets in a MIMO radar system

The report explores the problem of detecting complex point target models in a MIMO radar system. A complex point target is a mathematical and statistical model for a radar target that is not resolved in space, but exhibits varying complex reflectivity across the different bistatic view angles. The complex reflectivity can be modeled as a complex stochastic process whose index set is the set of all the bistatic view angles, and the parameters of the stochastic process follow from an analysis of a target model comprising a number of ideal point scatterers randomly located within some radius of the targets center of mass. The proposed complex point targets may be applicable to statistical inference in multistatic or MIMO radar system. Six different target models are summarized here – three 2-dimensional (Gaussian, Uniform Square, and Uniform Circle) and three 3-dimensional (Gaussian, Uniform Cube, and Uniform Sphere). They are assumed to have different distributions on the location of the point scatterers within the target. We develop data models for the received signals from such targets in the MIMO radar system with distributed assets and partially correlated signals, and consider the resulting detection problem which reduces to the familiar Gauss-Gauss detection problem. We illustrate that the target parameter and transmit signal have an influence on the detector performance through target extent and the SNR respectively. A series of the receiver operator characteristic (ROC) curves are generated to notice the impact on the detector for varying SNR. Kullback–Leibler (KL) divergence is applied to obtain the approximate mean difference between density functions the scatterers assume inside the target models to show the change in the performance of the detector with target extent of the point scatterers.

Orbits design for Leo space based solar power satellite system

Space Based Solar Power satellites use solar arrays to generate clean, green, and renewable electricity in space and transmit it to earth via microwave, radiowave or laser beams to corresponding receivers (ground stations). These traditionally are large structures orbiting around earth at the geo-synchronous altitude. This thesis introduces a new architecture for a Space Based Solar Power satellite constellation. The proposed concept reduces the high cost involved in the construction of the space satellite and in the multiple launches to the geo-synchronous altitude. The proposed concept is a constellation of Low Earth Orbit satellites that are smaller in size than the conventional system. For this application a Repeated Sun-Synchronous Track Circular Orbit is considered (RSSTO). In these orbits, the spacecraft re-visits the same locations on earth periodically every given desired number of days with the line of nodes of the spacecraft’s orbit fixed relative to the Sun. A wide range of solutions are studied, and, in this thesis, a two-orbit constellation design is chosen and simulated. The number of satellites is chosen based on the electric power demands in a given set of global cities. The orbits of the satellites are designed such that their ground tracks visit a maximum number of ground stations during the revisit period. In the simulation, the locations of the ground stations are chosen close to big cities, in USA and worldwide, so that the space power constellation beams down power directly to locations of high electric power demands. The j2 perturbations are included in the mathematical model used in orbit design. The Coverage time of each spacecraft over a ground site and the gap time between two consecutive spacecrafts visiting a ground site are simulated in order to evaluate the coverage continuity of the proposed solar power constellation. It has been observed from simulations that there always periods in which s spacecraft does not communicate with any ground station. For this reason, it is suggested that each satellite in the constellation be equipped with power storage components so that it can store power for later transmission. This thesis presents a method for designing the solar power constellation orbits such that the number of ground stations visited during the given revisit period is maximized. This leads to maximizing the power transmission to ground stations.

Payone : incentive for epidemic protocol-based anonymity system

Anonymity systems maintain the anonymity of communicating nodes by camouflaging them, either with peer nodes generating dummy traffic or with peer nodes participating in the actual communication process. The probability of any adversary breaking down the anonymity of the communicating nodes is inversely proportional to the number of peer nodes participating in the network. Hence to maintain the anonymity of the communicating nodes, a large number of peer nodes are needed. Lack of peer availability weakens the anonymity of any large scale anonymity system. This work proposes PayOne, an incentive based scheme for promoting peer availability. PayOne aims to increase the peer availability by encouraging nodes to participate in the anonymity system by awarding them with incentives and thereby promoting the anonymity strength. Existing incentive schemes are designed for single path based approaches. There is no incentive scheme for multipath based or epidemic based anonymity systems. This work has been specifically designed for epidemic protocols and has been implemented over MuON, one of the latest entries to the area of multicasting based anonymity systems. MuON is a peer-to-peer based anonymity system which uses epidemic protocol for data dissemination. Existing incentive schemes involve paying every intermediate node that is involved in the communication between the initiator and the receiver. These schemes are not appropriate for epidemic based anonymity systems due to the incurred overhead. PayOne differs from the existing schemes because it involves paying a single intermediate node that participates in the network. The intermediate node can be any random node that participates in the communication and does not necessarily need to lie in the communication path between the initiator and the receiver. The light-weight characteristics of PayOne make it viable for large-scale epidemic based anonymity systems.

PARTITIONING THE BLOCKS OF A STEINER TRIPLE SYSTEM INTO PARTIAL PARALLEL CLASSES

Does there exist a Steiner Triple System on v points, whose blocks can be partitioned into partial parallel classes of size m, where m ≤ [v⁄3], m | b and b is the number of blocks of the STS(v)? We give the answer for 9 ≤ v ≤ 43. We also show that whenever 2|b, v ≡ 3 (mod 6) we can find an STS(v) whose blocks can be partitioned into partial parallel classes of size 2, and whenever 4|b , v ≡ 3 (mod 6), there exists an STS(v) whose blocks can be partitioned into partial parallel classes of size 4.