The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Quality of service (QoS) provisioning generally assumes more than one QoS measure which implies that QoS routing can be categorized as an instance of routing subject to multiple constraints: delay-jitter, bandwidth, cost, etc. We study the problem of constructing multicast trees to meet the QoS requirements of real-time interactive applications where it is necessary to provide bounded delays and bounded...
Limited preemption scheduling has been introduced as a viable alternative to non-preemptive and fully preemptive scheduling when reduced blocking times need to coexist with an acceptable context switch overhead. To achieve this goal, preemptions are allowed only at selected points of the code of each task, decreasing the preemption overhead and simplifying the estimation of worst-case execution parameters...
Noise interferences and the lack of observation data are two main problems when implementing blind source separation. This paper introduces a BASS method which eliminates noise interferences, and meanwhile, uses sparse component analysis to fit the undetermined situation. Firstly, based on the BASS mathematical model including linear noise affixed, we built a probability distributed model of the sparse...
In this paper, we propose a novel localization algorithm in Wireless Sensor Network. The proposed method is a kind of range-free localization algorithm which only uses the proximity information between sensor nodes. In the proposed method, a robust weighted algorithm is presented to calculate the average hop distances between sensor nodes and anchor nodes. The proposed method is applied to an isotropic...
This paper provides a detailed analysis of a recently proposed algorithm for efficient frequency estimation and tracking. A correlation based Pulse-Pair (PP) method, which is an efficient technique for frequency estimation, is used for the frequency tracking. It is known that the PP method has a very low number of multiplications, but, has the disadvantage of requiring inverse tan operations in its...
This paper discusses the use of a recently proposed algorithm for efficient instant frequency estimation. The method is used in an application in digital communications where a continuous phase modulation receiver has been implemented through the instantaneous frequency estimation. The proposed receiver performance is discussed in detail.
Voiced speech is produced by excitation of the vocal tract system with the quasiperiodic vibrations of the vocal folds at the glottis. These excitations have become significantly stronger when the vocal folds are fully opened or about to be closed. In this work, the focus is on estimating these instants of significant excitation using temporal phase periodicity present in the speech signal. Assuming...
Localization is an important research issue in Wireless Sensor Networks (WSNs). Recently, hop-count-based localization has been proposed as a cost-effective alternative to range-based localization algorithms. Traditionally, hop-counts between any pair of nodes can only take on integer values regardless of relative positions of nodes in the hop. We show that by partitioning a node's one-hop neighbor...
In this paper, we propose a hybrid approach to the wireless sensor network (WSN) localization problem. The proposed approach harnesses the strengths of two techniques: RF mapping and cooperative ranging, to overcome the potential weaknesses in one another. The idea is to first allow every node to obtain an initial estimate of its own position in a neighbor-independent way using a coarse-grained RF...
Dynamic ALOHA-algorithm is an anti-collision algorithm highly concerned in RFID system. After we analyzed the existing ALOHA-algorithm, a new dynamic frame slotted ALOHA-algorithm was proposed, which can dynamically change frame length through the feedback of the last collision slot number in one inventory frame. The simulation indicates that this algorithm has nearly the same performance evaluation...
The purpose of this paper is to develop novel Blind Source Extraction (BSE) algorithms from linear mixtures of the statistically dependent source signals. we show that maximization of the non Gaussianity (NG) measure can not only separate the statistically independent but also dependent source signals. The NG measure is defined by statistical distances between distributions based on the cumulative...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.