Source localization using TDOA and FDOA measurements based on modified cuckoo search algorithm

This paper introduces a new algorithm for solving the localization problem of moving multiple disjoint sources using time difference of arrival and frequency difference of arrival. The localization of moving sources can be considered as a least-square problem. There are many algorithms used to solve this problem such as, two-step weighted least squares, constrained total least-square and practical constrained least-square. However, most of these algorithms suffer from either slow convergence or numerical instability and don’t attain Cramer–Rao lower bound. We introduce a free-gradient algorithm called cuckoo search which avoids the slow convergence problem. The cuckoo search provides a combined global and local search method. Simulation results show that the proposed algorithm achieves better performance than other algorithms and attains Cramer–Rao lower bound.     

Order selection statistical test for nonstationary AR models

A new statistical test for selecting the order of a nonstationary AR modelyk is presented based on the predictive least-squares principle. This test is of the same order as the accumulated cost function _n = _k=1 ⁿ ( _k ^* – _k )²;i.e., ^* wherey _k ^* is the predictive least-square estimate. It is constructed to show how many times the integrated AR processy _k is differenced in order to obtain a stationary AR process given that the exact order of the process is unknown.     

A Self-powered Wearable Wireless Sensor System Powered by a Hybrid Energy Harvester for Healthcare Applications

Wireless Personal Communications - In this paper, a wearable medical sensor system is designed for long-term healthcare applications. This system is used for monitoring temperature, heartbeat,...     

Collaborative and Cognitive Network Platforms: Vision and Research Challenges

In this paper, we present a visionary concept referred to as Collaborative and Cognitive Network Platforms (CCNPs) as a future-proof solution for creating a dependable, self-organizing and self-managing communication substrate for effective ICT solutions to societal problems. CCNP creates a cooperative communication platform to support critical services across a range of business sectors. CCNP is based on the personal network (PN) technology which is an inherently cooperative environment prototyped in the Dutch Freeband PNP2008 and the European Union IST MAGNET projects. In CCNP, the cognitive control plane strives to exploit the resources to better satisfy the requirements of networked applications. CCNP facilitates collaboration inherently. Through cognition in the cognitive control plane, CCNP becomes a self-managed substrate. The self-managed substrate, in this paper, is defined as cognitive and collaborative middleware on which future applications run without user intervention. Endemic sensor networks may be incorporated into the CCNP concept to feed its cognitive control plane. In this paper, we present the CCNP concept and discuss the research challenges related to collaboration and cognition.     

2D and 3D image localization,compression and reconstruction using new hybrid moments

In this article, we will present a new set of hybrid polynomials and their corresponding moments, with a view to using them for the localization, compression and reconstruction of 2D and 3D images. These polynomials are formed from the Hahn and Krawtchouk polynomials. The process of calculating these is successfully stabilized using the modified recurrence relations with respect to the n order, the variable x and the symmetry property. The hybrid polynomial generation process is carried out in two forms: the first form contains the separable discrete orthogonal polynomials of Krawtchouk–Hahn (DKHP) and Hahn–Krawtchouk (DHKP). The latter are generated as the product of the discrete orthogonal Hahn and Krawtchouk polynomials, while the second form is the square equivalent of the first form, it consists of discrete squared Krawtchouk–Hahn polynomials (SKHP) and discrete polynomials of Hahn–Krawtchouk squared (SHKP). The experimental results clearly show the efficiency of hybrid moments based on hybrid polynomials in terms of localization property and computation time of 2D and 3D images compared to other types of moments; on the other hand, encouraging results have also been shown in terms of reconstruction quality and compression despite the superiority of classical polynomials.

     

Architectural Design,Improvement, and Challenges of Distributed Software-Defined Wireless Sensor Networks

Wireless Personal Communications - Software-defined networking (SDN) is widely perceived to simplify network management and monitoring. The introduction of the SDN model into wireless sensor...     

A hybrid multiagent routing approach for wireless ad hoc networks

Wireless ad-hoc networks are infrastructureless networks that comprise wireless mobile nodes able to communicate each other outside wireless transmission range. Due to frequent network topology changes in one hand and the limited underlying bandwidth in the other hand, routing becomes a challenging task. In this paper we present a novel routing algorithm devoted for mobile ad hoc networks. It entails both reactive and proactive components. More precisely, the algorithm is based on ant general behavior, but differs from the classic ant methods inspired from Ant-Colony-Optimization algorithm [1]. We do not use, during the reactive phase, a broadcasting technique that exponentially increases the routing overhead, but we introduce a new reactive route discovery technique that considerably reduces the communication overhead. In the simulation results, we show that our protocol can outperform both Ad hoc On-demand Distance Vector (AODV) protocol [2], one of the most important current state-of-the-art algorithms, and AntHocNet protocol [5], one of the most important ant-based routing algorithms, in terms of end-to-end delay, packet delivery ratio and the communication overhead.     

On the design of highly linear CMOS digitally programmable operational transconductance amplifiers for low and high-frequency applications

This paper proposes a novel highly linear digitally programmable fully differential operational transconductance amplifier (DPOTA) circuit. Two versions of the proposed DPOTA structure are designed. The first version is optimized for high-frequency operation with current division networks designated to 3-bit control code words. On the other hand, the second version is optimized for low-frequency operation with 4-bit control code words. The third-order harmonic distortion (HD3) of the first DPOTA version remains below ? 66 dB up to 0.4 V differential input voltage at 10 MHz frequency. The second DPOTA version achieved HD3 of ? 70 dB with an amplitude of 20 mV_p–p and at 100 Hz frequency. The proposed circuits are designed and simulated in 90 nm CMOS model, BSIM4 (level 54) under a balanced 1.2 V supply voltage.