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.
In order to solve the problem of the node flip ambiguity generated by using classical least squares method in wireless sensor networks node localization, an iterative method based on triangular node blocks (IP-TNB) to process node flip ambiguity is proposed in this paper. At first, orthogonal projection detection method is adopted to detect an unknown node needed to be positioned. If the node would...
To accurately segment putamen with fuzzy edges of basal ganglia region in brain Magnetic Resonance (MR) images, a shortest path based interactive segmentation method is proposed in this paper. Considering anatomical features of putamen, a cost function is designed by using weight coefficients in sub-regions and sub-orientations, and the shortest path search is restrained in a region, so that the fuzzy...
To decrease the scheduling length and energy cost, a distributed link scheduling (DLS) protocol is proposed for Wireless Sensor Networks, which is based on graph coloring. Every node is required to construct its two-hop conflict graph, the scheduling order of every link is decided by its priority and interference degree in the conflict graph. The proposed DLS algorithm relaxes the problem of long...
To solve the problem of congestion which often occurs in the process of the large data transmission in large-scale wireless senator networks, a multipath routing protocol based on congestion control mechanism implemented by cross-layer design concept is proposed. Realizing the multipath routing protocol on the basis of AODV protocol, congestion control mechanism with active congestion avoidance, real-time...
In order to reduce the error accumulation of time synchronization for large-scale and multi-hop wireless sensor networks, a time synchronization protocol based on dynamic route list (DRL-TSP) is proposed. The protocol uses an available dynamic route list which exists in each node, and allows nodes to choose an optimal synchronization route adaptively to reduce error accumulation. An identification...
To solve the problem of slow convergence using the Sage-Husa algorithm to estimate clock frequency on time synchronization in wireless sensor networks, a bimodal clock frequency estimation algorithm is proposed. The algorithm uses a threshold to determine which mode the clock frequency is. For the jump mode, the ratio-based method is adopted to track the clock frequency quickly. For the stable mode,...
This paper presents an energy-efficient distributed link scheduling protocol based on vertex coloring method for wireless sensor networks. In the protocol, we perform vertex coloring using maximum degree preferred scheme, and gather network information only by local message exchanges. Thus, our protocol can further reduce the maximum number of timeslots, and avoid long-distance multihop packet forwarding...
The paper presents a three-dimensional localization algorithm for Wireless Sensor Networks (WSN) based on Particle Swarm Optimization (PSO). According to a direct proportion relationship of the measured distance with the measuring errors, an improved three-dimensional localization objective function is defined with weighted the measured distance, and which is optimized by using PSO. In the process...
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.