共查询到19条相似文献,搜索用时 515 毫秒
1.
2.
3.
4.
5.
基于博弈理论的无线传感器网络分布式节能路由算法 总被引:3,自引:0,他引:3
为了有效解决无线传感器网络路由节能问题,该文提出适合无线传感器网络的节能路由算法。在引入博弈理论概念建立网络模型的基础上,通过对于以往传感器网络簇首选择方法的研究,设计了一种基于博弈论的,兼顾节点剩余能量及簇首分布的节能路由DEER(DistributedEnergy-EconomicalRouting),大大节省了分布式决策网络协议的能量损耗。仿真证明了该方法在无线传感器网络中,能够有效地平衡网络负载,节省节点能量,延长网络寿命。 相似文献
6.
7.
8.
9.
10.
11.
Liuguo Yin Changmian Wang Geir E. Øien 《International Journal of Wireless Information Networks》2009,16(3):154-164
The routing energy efficiency of a wireless sensor network is a crucial issue for the network lifetime. In this article, we propose MICRO (MInimum Cost Routing with Optimized data fusion), an energy-efficient routing protocol for event-driven dense wireless sensor networks. The proposed routing protocol is an improvement over the formerly proposed LEACH and PEGASIS protocol, which is designed to be implemented mainly with node computations rather than mainly with node communications. Moreover, in the routing computation the proposed scheme exploits a new cost function for energy balancing among sensor nodes, and uses an iterative scheme with optimized data fusions to compute the minimum-cost route for each event-detecting sensor node. Compared to the PEGASIS routing protocol, MICRO substantially improves the energy-efficiency of each route, by optimizing the trade-off between minimization of the total energy consumption of each route and the balancing of the energy state of each sensor node. It is demonstrated that the proposed protocol is able to outperform the LEACH and the PEGASIS protocols with respect to network lifetime by 100–300% and 10–100%, respectively. 相似文献
12.
We consider the distributed estimation by a network consisting of a fusion center and a set of sensor nodes, where the goal is to maximize the network lifetime, defined as the estimation task cycles accomplished before the network becomes nonfunctional. In energy-limited wireless sensor networks, both local quantization and multihop transmission are essential to save transmission energy and thus prolong the network lifetime. The network lifetime optimization problem includes three components: i) optimizing source coding at each sensor node, ii) optimizing source throughput of each sensor node, and iii) optimizing multihop routing path. Fortunately, source coding optimization can be decoupled from source throughput and multihop routing path optimization, and is solved by introducing a concept of equivalent 1-bit MSE function. Based on the optimal source coding, the source throughput and multihop routing path optimization is formulated as a linear programming (LP) problem, which suggests a new notion of character-based routing. The proposed algorithm is optimal and the simulation results show that a significant gain is achieved by the proposed algorithm compared with heuristic methods. 相似文献
13.
Since energy constraint is a fundamental issue for wireless sensor networks, network lifetime performance has become a key performance metric for such networks. In this paper, we consider a two-tier wireless sensor network and focus on the flow routing problem for the upper tier aggregation and forwarding nodes (AFNs). Specifically, we are interested in how to perform flow routing among the nodes when the bit rate from each source node is time-varying. We present an algorithm that can be used to construct a flow routing solution with the following properties: (1) If the average rate from each source node is known a priori, then flow routing solution obtained via such algorithm is optimal and offers provably maximum network lifetime performance; (2) If the average rate of each source node is unknown but is within a fraction (epsiv) of an estimated rate value, then network lifetime by the proposed flow routing solution is within 2epsiv/1-epsiv from the optimum. These results fill in an important gap in theoretical foundation for flow routing in energy-constrained sensor networks. 相似文献
14.
In this paper, a Tabu search based routing algorithm is proposed to efficiently determine an optimal path from a source to a destination in wireless sensor networks (WSNs). There have been several methods proposed for routing algorithms in wireless sensor networks. In this paper, the Tabu search method is exploited for routing in WSNs from a new point of view. In this algorithm (TSRA), a new move and neighborhood search method is designed to integrate energy consumption and hop counts into routing choice. The proposed algorithm is compared with some of the ant colony optimization based routing algorithms, such as traditional ant colony algorithm, ant colony optimization-based location-aware routing for wireless sensor networks, and energy and path aware ant colony algorithm for routing of wireless sensor networks, in term of routing cost, energy consumption and network lifetime. Simulation results, for various random generated networks, demonstrate that the TSRA, obtains more balanced transmission among the node, reduces the energy consumption and cost of the routing, and extends the network lifetime. 相似文献
15.
Energy constraints have a significant impact on the design and operation of wireless sensor networks. This paper investigates the base station (BS) selection (or anycast) problem in wireless sensor networks. A wireless sensor network having multiple BSs (data sink nodes) is considered. Each source node must send all its locally generated data to only one of the BSs. To maximize network lifetime, it is essential to optimally match each source node to a particular BS and find an optimal routing solution. A polynomial time heuristic is proposed for optimal BS selection and anycast via a sequential fixing procedure. Through extensive simulation results, it is shown that this algorithm has excellent performance behavior and provides a near-optimal solution. 相似文献
16.
In the wireless sensor networks, high efficient data routing for the limited energy resource networks is an important issue. By introducing Ant-colony algorithm, this paper proposes the wireless sensor network routing algorithm based on LEACH. During the construction of sensor network clusters, to avoid the node premature death because of the energy consumption, only the nodes whose residual energy is higher than the average energy can be chosen as the cluster heads. The method of repeated division is used to divide the clusters in sensor networks so that the numbers of the nodes in each cluster are balanced. The basic thought of ant-colony algorithm is adopted to realize the data routing between the cluster heads and sink nodes, and the maintenance of routing. The analysis and simulation showed that the proposed routing protocol not only can reduce the energy consumption, balance the energy consumption between nodes, but also prolong the network lifetime. 相似文献
17.
Energy-constrained sensor networks have been deployed widely for monitoring and surveillance purposes. Data gathering in such networks is often a prevalent operation. Since sensors have significant power constraints (battery life), energy efficient methods must be employed for data gathering to prolong network lifetime. We consider an online data gathering problem in sensor networks, which is stated as follows: assume that there is a sequence of data gathering queries, which arrive one by one. To respond to each query as it arrives, the system builds a routing tree for it. Within the tree, the volume of the data transmitted by each internal node depends on not only the volume of sensed data by the node itself, but also the volume of data received from its children. The objective is to maximize the network lifetime without any knowledge of future query arrivals and generation rates. In other words, the objective is to maximize the number of data gathering queries answered until the first node in the network fails. For the problem of concern, in this paper, we first present a generic cost model of energy consumption for data gathering queries if a routing tree is used for the query evaluation. We then show the problem to be NP-complete and propose several heuristic algorithms for it. We finally conduct experiments by simulation to evaluate the performance of the proposed algorithms in terms of network lifetime delivered. The experimental results show that, among the proposed algorithms, one algorithm that takes into account both the residual energy and the volume of data at each sensor node significantly outperforms the others 相似文献
18.
Reducing the energy consumption of network nodes is one of the most important problems for routing in wireless sensor networks because of the battery limitation in each sensor. This paper presents a new ant colony optimization based routing algorithm that uses special parameters in its competency function for reducing energy consumption of network nodes. In this new proposed algorithm called life time aware routing algorithm for wireless sensor networks (LTAWSN), a new pheromone update operator was designed to integrate energy consumption and hops into routing choice. Finally, with the results of the multiple simulations we were able to show that LTAWSN, in comparison with the previous ant colony based routing algorithm, energy aware ant colony routing algorithms for the routing of wireless sensor networks, ant colony optimization-based location-aware routing algorithm for wireless sensor networks and traditional ant colony algorithm, increase the efficiency of the system, obtains more balanced transmission among the nodes and reduce the energy consumption of the routing and extends the network lifetime. 相似文献
19.
For the energy limited wireless sensor networks, the critical problem is how to achieve the energy efficiency. Many attackers
can consume the limited network energy, by the method of capturing some legal nodes then control them to start DoS and flooding
attack, which is difficult to be detected by only the classic cryptography based techniques with common routing protocols
in wireless sensor networks (WSNs). We argue that under the condition of attacking, existing routing schemes are low energy-efficient
and vulnerable to inside attack due to their deterministic nature. To avoid the energy consumption caused by the inside attack
initiated by the malicious nodes, this paper proposes a novel energy efficiency routing with node compromised resistance (EENC)
based on Ant Colony Optimization. Under our design, each node computes the trust value of its 1-hop neighbors based on their
multiple behavior attributes evaluation and builds a trust management by the trust value. By this way, sensor nodes act as
router to achieve dynamic and adaptive routing, where the node can select much energy efficiency and faithful forwarding node
from its neighbors according to their remaining energy and trust values in the next process of data collection. Simulation
results indicate that the established routing can bypass most compromised nodes in the transmission path and EENC has high
performance in energy efficiency, which can prolong the network lifetime. 相似文献