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.
Due to the rapid growth in scale and complexity of information networks, self-organizing systems have been focused on for realizing new network control architectures that have high scalability, adaptability, and robustness. However, in self-organizing systems, the uncertainty (incompleteness, ambiguity, and dynamicity) of information observable for components in the system can lead to the slow adaptation...
This paper considers the problem of decentralized, cooperative, and dynamic self-localization in wireless sensor networks. In particular, we are interested in a restrictive but very realistic scenario where few anchors are deployed and each anchor whose location is priori known may only communicate with very few agents (e.g. just one agent) whose location is unknown and to-be-estimated. The lack of...
The study of the synchronization problems in wireless sensor networks (WSNs) is increasingly significant. Some researchers found that the network topology has an important impact on the convergence performance of the synchronization in WSNs. According to the feature of WSNs, we use random geometric graph (RGG) to describe the model of WSNs. And the degree distribution in RGG is similar to binomial...
Most of the times Wireless Sensor Networks (WSNs) operate in hostile and unattended network environments, which makes the nodes vulnerable to node misbehaviour attacks. The applicability of conventional security methods, such as authentication, encryption and cryptography, to counter node misbehaviour attacks is debatable due to their incapability and involved cost. Trust aware secure mechanisms provide...
A Wireless Sensor Network (WSN) is a wireless network that contains several low cost tiny devices such as sensors to senses environmental circumstances. In many situations, each node of the WSN has to know its location in the real world. Several cost effective localization techniques can be used to locate each sensor. Among various techniques, the range based techniques are known for their accurate...
This paper studies the problem of determining sensor locations in a large sensor network using only relative distance (range) measurement. In this paper, we consider a synchronous communication protocol when 1) the communication delay between sensors is uncertain; 2) successive packet loss is finite. Based on the barycentric coordinate representation, our work generalizes the DILOC algorithm in the...
A lot of work has been done to design algorithms that utilize three or more anchors to locate the unknownposition sensor nodes. In this paper, we propose a new sensor network node localization technique based on incremental LMS (least mean squared) distributed estimation algorithm with variable step size. In our network topology, the location-aware anchor nodes are deployed along the border of monitoring...
This paper presents the modified least squares iteration (MLSI). It is calculated by the least squares and trilateration to reduce positioning errors. In this study, environment model curves build to estimate the distance by ZigBee received dB value. Then, use trilateration to measure distance of reference and destination nodes. When the position errors appear, it will affect the obtained trilateration...
Focus on the problem of finding the optimal path in wireless sensor networks(WSN), considering energy saving requirement, a dynamic energy-saving routing strategy based on ant colony optimization(DERS-ACO) is proposed. Our strategy designs the optimization rule of dynamic state transformation, which increases the search probability of the new node, so as to achieve the purpose of searching the global...
Distributed clock synchronization with intermittent communication is addressed in this paper. An event-triggered control and communication approach is presented in order to determine in a decentralized way the time instants at which each agent transmits information. The decentralized event-triggered synchronization of clocks is formulated as a single integrator consensus problem in the particular...
To solve the overlap problem in node selection process in order to fill the existing routing algorithms deficiencies, This paper designs a traditional Gossiping routing algorithm based on SPSO. At the same time, the paper gives the content and design steps of this algorithm. The simulation results show that the algorithm can effectively solve the problem of node selection.
Consensus building in wireless sensor networks (WSN's) has been studied extensively over a number of years. However, the role of mobile nodes in a network has not been fully explored. This paper shows that introducing mobility increases the rate of convergence in partially connected and disconnected WSN. It also shows that selection of mobile nodes influences the rate of convergence. The mobile node...
Wireless Sensor Network (WSN) is an emerging application that has proved to be very effective due to its wide application and so has become very prominent various industries and research WSN's life is improved through clustering-based routing. Operation and network life are controlled by a large deployed sensor network whose major characteristic is self-organization and energy efficiency. The area...
The objective of the proposed system is to develop an adaptive iterative linear regression (ILR) based clustering for wireless sensor network. ILR classifies the initial cluster simultaneously in horizontal and vertical patterns to form two sub clusters. Among these two, the best is selected based on similarity index (SI). This selected cluster is taken as reference and the iteration continues until...
The recent distributed online convex optimization framework has developed in Wireless sensor networks (WSN) provide the promising approach for solving approximately stochastic optimization problem over network of sensors follows distributed manner. In practice, most of real environmental sensing activities are highly dynamic where noisy sensory information often appears and affects to the learning...
The k-means initialization technique for a wireless sensor network is a newly emerging area for researchers. There are many constraints in designing the wireless sensor network. The primary constraint is energy consumption. Clustering is used for improving the lifetime of the system by reducing the power consumption. The most popular clustering technique is k-means algorithm but it exhibits local...
Rapid, reliable and energy efficient programing code dissemination is a challenging issue and offer a programmable and flexible network architecture for software defined wireless networks (SDWNs). Many schemes for programing codes in large-scale network incur longer dissemination convergence time (DCT) in loss nature of wireless channels. In this paper, an integrated adjusted broadcast (TAB) scheme...
In recent years, nonnegative matrix factorization (NMF) attracts much attention in machine learning and signal processing fields due to its interpretability of data in a low dimensional subspace. For clustering problems, symmetric nonnegative matrix factorization (SNMF) as an extension of NMF factorizes the similarity matrix of data points directly and outperforms NMF when dealing with nonlinear data...
A distributed consensus algorithm for estimating the degree distribution of a graph is proposed. The proposed algorithm is based on average consensus and in-network empirical mass function estimation. It is fully distributed in the sense that each node in the network only needs to know its own degree, and nodes do not need to be labeled. The algorithm works for any connected graph structure in the...
The Consensus Time Synchronization (CTS) overcomes the shortcoming of centralized time synchronization in terms of scalability and robustness to node failure. However, CTS leads to slow convergence rate, high communication traffic and the inability to provide synchronization to an external time source. This paper proposes a novel distributed time synchronization protocol for WSNs, the Consensus-based...
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.