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.
For more efficient use of wireless sensor networks, the article using the Bayesian formula to revise the subjective weights base on the fuzzy multiple attribute decision making (MADMR) of WSN routing algorithm which making the subjective weight more theoretical, at the same time using the entropy coefficient model to avoid too much deviation with the objective weights. The simulation results show...
Power consumption is one of the most important problems for wireless sensor networks because of the battery limitation in each sensor. This paper presents an ant colony optimization- (ACO-) based routing algorithm to reduce power consumption. First, a grade table is built and referred to generate several possible routing paths. Then, the ACO explores these paths to reduce the power consumption of...
In wireless sensor networks with mobile sinks, it is a challenge to design reasonable data dissemination protocols to realize reliable, real-time and efficient data transmission from multiple sources to multiple sinks. Recently, many protocols such as TTDD, GHT and LBDD are proposed to solve this problem. However, most of them depend on the whole network topology information to optimize the data dissemination...
An optimization model is set up for the area covering and routing problem of Wireless Sensor Network(WSN). Two quasi-physical and quasi-sociological methods are designed for the problem, They are quasi-gravitation model and quasi-coulomb force model. Based on the Area Covering, Round Routing Method is proposed, which transfers into TSP problem. Restriction of window ant colony algorithm carry out...
In this paper, a new mechanism for the optimal energy consumption in WSNs is presented on the basis of the ant colony algorithm(ACA). The proposed mechanism can realise a best allocation of the energy for each single node in a given network. Simulation results show that, comparing with the directed diffusion routing method, the new routing mechanism can reduce the main nodes' energy consumption and...
Routing problem in wireless sensor network (WSN) is challenging because WSN has distributed feature, transmission requirement, data redundancy and energy restriction. The idea of ant colony optimization (ACO) has been used in design of routing algorithms for WSN. However, ant colony routing algorithms (ACRs) generally have a serious problem of slow routing discovery so far. In this paper, a feedback-enhanced...
At present, the field of wireless sensor networks (WSNs) is an important and challenging research area. Advancements in sensor networks enable a wide range of environmental monitoring and object tracking applications. Moreover, multihop routing in WSN is interrupt by new nodes constantly entering/leaving the system. Therefore, biologically inspired algorithms are reviewed and enhanced to tackle problems...
Different from the traditional layer protocols, layering optimization can improve QoS of the whole wireless sensor network (WSN). Therefore, a novel power-aware layering optimization scheme is proposed to balance network lifetime and communication reliability. In the scheme, a directed spanning tree routing algorithm is discussed to resolve unnecessary energy consumption during data transmission....
Data aggregation is an important area of wireless sensor networks. The importance of efficient data aggregation in wireless sensor networks is due to the fact of the networks which are volatile and ad hoc in nature. Problems associated include efficient energy consumption and routing techniques. Zone Efficient Localized Data Aggregation (Zelda) Algorithm has been proposed. This algorithm employs the...
Appropriate node management of networks in the limited resources of the wireless sensor network for effectively control the energy of networks is one of the key points in research on wireless sensor networks. Using of ant colony algorithmpsilas characteristics, self-organized, adaptive and dynamic optimization, this paper proposed a new power management which can reduce the node power and re-establish...
In sensor networks, both energy and bandwidth are scarce resources. In the past, many energy efficient routing algorithms have been devised in order to maximize network lifetime, in which wireless link bandwidth has been optimistically assumed to be sufficient. This article shows that ignoring the bandwidth constraint can lead to infeasible routing solutions. As energy constraint affects how data...
A new energy-efficient wireless sensor network routing algorithm is proposed. The algorithm obtains optimization routing paths using global information of wireless sensor network. And the optimizing process can be reproduced in distribution by constructing a neural network for each node. Simulation results show the algorithm can accomplish routing process correctly and rapidly, and increase network...
Existing solutions for top-k queries in wireless sensor networks mainly focused on energy efficiency and little attention has been paid to the response time to answer a top-k query as well as the relationship between the response time and the network lifetime. In this paper we address this issue explicitly by studying the top-k query problem in sensor networks with the response time constraint. We...
Secure routing is the key to assure wireless sensor networks working in order, and the classical security mechanisms, such as encryption and authentication can only prevent the outside attacks. In order to defeat the attacks of the inside malicious or captured nodes, in this paper, the trust technology and node??s location information are employed in the process of routing. At the same time, for prolonging...
In this paper, we study the maximization problem of network lifetime for answering a sequence of aggregate queries based on snapshot data. We build a series of nearly optimal representative routing trees for query evaluation, where a representative routing tree is such a tree rooted at the base station that each node in it represents a set of non-tree nodes by holding their historical data (snapshot...
As wireless sensor networks (WSNs) increasingly attract more attention, new ideas for specific applications are continually being developed, many of which involve the energy consumption of nodes. However, not much has been done to optimize the quality of services (QoS) of WSNs. Many applications like target tracking require some QoS guarantees. Besides, certain factors limit the ability of multi-hop...
Continuous queries in wireless sensor networks are established on the premise of a routing tree that provides each sensor with a path over which answers can be transmitted to the query processor. We found that these structures are sub- optimality constructed in predominant data acquisition systems leading to an enormous waste of energy. In this paper we present MicroPulse1, a workload-aware optimization...
We address the joint optimization of routing and compression for wireless sensor networks using a lifting-based 2D transform that can be computed along arbitrary routing trees. The proposed 2D transform allows for unidirectional computation, thereby eliminating costly backward transmissions often required by existing 2D transforms. We also propose a framework for optimizing the transform by selecting...
Wireless sensor network is remarkable for its promising use on human-unattended information collection, such as forest fire monitoring. In order to support efficient communication, many routing algorithms specially designed for such networks have been proposed. However, there is no idea about whether these proposed routing algorithms are already good enough or still have a long way to become "perfect",...
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.