Simple autocorrelation technique based on degree-of-polarization measurement

We demonstrate a simple optical-fiber-based autocorrelator for picosecond short pulses based on degree-of-polarization measurement while tuning the relative delay of the two orthogonal polarization states of the pulse. The pulsewidths of 20-, 40-, and 80-GHz pulse trains and 2-ps pulses generated by a mode-locked laser are measured. The <-10-dBm optical powers are used in the experiment. The measurement results agree well with the measurements using conventional techniques. Compared with conventional autocorrelators, this technique has the advantages of 1) wavelength independent, 2) significant less alignment, and 3) no high power required.     

Energy-optimized cluster head selection based on enhanced remora optimization algorithm in underwater wireless sensor network

With the technological advancements, wireless sensor network (WSN) has played an impeccable role in monitoring the underwater applications. Underwater WSN (UWSN) is supported by WSN but subjected to data dissemination in an acoustic medium. Due to challenging conditions in underwater scenario, the limited battery resources of these sensor nodes stem to a crucial research problem that needs to address the energy-efficient routing in UWSN. In this research work, we intend to propose an energy-optimized cluster head (CH) selection based on enhanced remora optimization algorithm (ECERO) in UWSN. Since CH devours the maximum energy among the nodes, we perform selection of CH based on EROA while considering energy, Euclidean distance from sink, node density, network's average energy, acoustic path loss model and lastly, the adaptive quantity of CHs in the network. Further, to reduce the load on CH node, we introduce the concept of sleep scheduling among the closely located cluster nodes. The proposed work improves the performance of recently proposed EOCSR algorithm by great magnitude which claims to mitigate hot-spot problem, but EOCSR still suffers from the same due to relaying a large magnitude of data.     

Hybrid Chameleon Search and Remora Optimization Algorithm-based Dynamic Heterogeneous load balancing clustering protocol for extending the lifetime of wireless sensor networks

Clustering is an indispensable strategy that helps towards the extension of lifetime of each sensor nodes with energy stability in wireless sensor networks (WSNs). This clustering process aids in sustaining energy efficiency and extended network lifetime in sensitive and critical real-life applications that include landslide monitoring and military applications. The dynamic characteristics of WSNs and several cluster configurations introduce challenge in the process of searching an ideal network structure, a herculean challenge. In this paper, Hybrid Chameleon Search and Remora Optimization Algorithm-based Dynamic Clustering Method (HCSROA) is proposed for dynamic optimization of wireless sensor node clusters. It utilized the global searching process of Chameleon Search Algorithm for selecting potential cluster head (CH) selection with balanced trade-off between intensification and extensification. It determines an ideal dynamic network structure based on factors that include quantity of nodes in the neighborhood, distance to sink, predictable energy utilization rate, and residual energy into account during the formulation of fitness function. It specifically achieved sink node mobility through the integration of the local searching capability of Improved Remora Optimization Algorithm for determining the optimal points of deployment over which the packets can be forwarded from the CH of the cluster to the sink node. This proposed HCSROA scheme compared in contrast to standard methods is identified to greatly prolong network lifetime by 29.21% and maintain energy stability by 25.64% in contrast to baseline protocols taken for investigation.     

Salt-and-pepper noise removal by adaptive median-based lifting filter using second-generation wavelets

In this paper, we propose a novel adaptive median-based lifting filter for image de-noising which has been corrupted by homogeneous salt and pepper noise. The median-based lifting filter removes the noise of the input image by calculating the median of the neighboring significant pixels. The algorithm for image noise removal uses the lifting scheme of the second-generation wavelets in conjunction with the proposed adaptive median-based lifting filter. The experimental results demonstrate the efficiency of the proposed method. The proposed algorithm is compared with all the basic filters, and it is found that our method outperforms many other algorithms and it can remove salt and pepper noise with a noise level as high as 90%. The algorithm works exceedingly well for all levels of noise, as illustrated in terms of peak signal-to-noise ratio (PSNR) and structural similarity index (SSIM) measures.     

Efficient fog removal from video

In this paper, a framework of real-time video processing for fog removal using uncalibrated single camera system is proposed. Intelligent use of temporal redundancy present in video frames paves the way for real-time implementation. Any fog removal algorithm for images acquired with uncalibrated single camera system can be extended to video using the proposed framework. For the purpose of real-time implementation, several fog removal algorithms for images are investigated and few top ranking algorithms in speed and quality are chosen. Simulation results confirm that proposed framework reduces the computation per frame significantly. Proposed fog removal framework has a wide application in navigation, transportation, and other industries.     

On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks

We study a fundamental tradeoff issue in designing a distributed hash table (DHT) in peer-to-peer (P2P) networks: the size of the routing table versus the network diameter. Observing that existing DHT schemes have either 1) a routing table size and network diameter both of O(log/sub 2/n), or 2) a routing table of size d and network diameter of O(n/sup 1/d/), S. Ratnasamy et al. (2001) asked whether this represents the best asymptotic "state-efficiency" tradeoffs. We show that some straightforward routing algorithms achieve better asymptotic tradeoffs. However, such algorithms all cause severe congestion on certain network nodes, which is undesirable in a P2P network. We rigorously define the notion of "congestion" and conjecture that the above tradeoffs are asymptotically optimal for a congestion-free network. The answer to this conjecture is negative in the strict sense. However, it becomes positive if the routing algorithm is required to eliminate congestion in a "natural" way by being uniform. We also prove that the tradeoffs are asymptotically optimal for uniform algorithms. Furthermore, for uniform algorithms, we find that the routing table size of O(log/sub 2/n) is a magic threshold point that separates two different "state-efficiency" regions. Our third result is to study the exact (instead of asymptotic) optimal tradeoffs for uniform algorithms. We propose a new routing algorithm that reduces the routing table size and the network diameter of Chord both by 21.4% without introducing any other protocol overhead, based on a novel number-theory technique. Our final result is to present Ulysses, a congestion-free nonuniform algorithm that achieves a better asymptotic "state-efficiency" tradeoff than existing schemes in the probabilistic sense, even under dynamic node joins/leaves.     

Asymmetrically loaded annular ring antenna

A numerical model for resonant frequency using asymmetric loading is presented using cavity model. In asymmetric loaded antenna, the posts are not equispaced on annular ring antenna and resonant frequency is independent of the angular location of posts. The posts are located away from the centre of patch. The diameter of post is thin as compared to the diameter of annular ring antenna. The first few dominant modes calculated for asymmetric loading are compared to symmetric loading where the posts are to be located at specific angular locations. The theoretical model is compared to the simulated results of IE3D based on Method of Moments. The numerical model developed can also be verified further by the full wave analysis.     

Performance Evaluation of Trellis Code Modulated oDQPSK Using the KLSE Method

A direct detection optical differential quadrature phase-shift keying (oDQPSK) system with trellis coded modulation (TCM) is proposed and analyzed. From the results obtained for the symbol-error rate, it is observed that the proposed oDQPSK-TCM system can perform about 5 dB better than the uncoded oDQPSK system. Optical signal-to-noise ratio penalty due to first-order polarization-mode dispersion of the proposed oDQPSK-TCM system is evaluated and compared with that of unequalized as well as electrically equalized oDQPSK systems.     

Linear phase FIR approximation of magnitude response |1/ω| for maximal flatness at an arbitrary frequency ω0, 0<ω0<π*

In many signal processing situations, the desired (ideal) magnitude response of the filter is a rational function: (a digital integrator). The requirements of a linear phase response and guaranteed stable performance limit the design to a finite impulse response (FIR) structure. In many applications we require the FIR filter to yield a highly accurate magnitude response for a narrow band of frequencies with maximal flatness at an arbitrary frequency ₀ in the spectrum (0, ). No techniques for meeting such requirements with respect to approximation of are known in the literature. This paper suggests a design by which the linear phase magnitude response can be approximated by an FIR configuration giving a maximally flat (in the Butterworth sense) response at an arbitrary frequency ₀, 0<₀<^*. A technique to compute exact weights for the design has also been given.