In this paper, we proposes a multi-gateway nodes data collected routing algorithm based on load balancing(TBLB algorithm) and energy balance, robustness, data forwarding and anti-interference etc, which is multi-gatew...
详细信息
Wireless Sensor Networks (WSNs) are widely used in various applications for tracking or surveillance purposes. Border security monitoring and terrorist attack prevention are just two of many crucial homeland security ...
详细信息
Wireless Multimedia Sensor Networks(WMSNs) have the characteristics of limited resources, variable channel capacities and high data redundancy, which pose great challenges to the QoS routing of WMSNs. Addressing these...
详细信息
Since WSAN is a type of WSN, it has the same problems occurring in WSN such as energy problem as well as other issues caused by connecting sensors and actuators as a network. There have been many researches to resolve...
详细信息
The problem of preventing deadlocks and livelocks in computer communication networks, in particular, those with wormhole routing, is considered. The method to prevent deadlocks is to prohibit certain turns (i.e., the ...
详细信息
The problem of preventing deadlocks and livelocks in computer communication networks, in particular, those with wormhole routing, is considered. The method to prevent deadlocks is to prohibit certain turns (i.e., the use of certain pairs of connected edges) in the routing process, in such a way that eliminates all cycles in the graph. We propose a new algorithm that constructs a minimal ( irreducible) set of turns that breaks all cycles and preserves connectivity of the graph. The algorithm is tree-free and is considerably simpler than earlier cycle-breaking algorithms. We prove its properties and present lower and upper bounds for minimum cardinalities of cycle-breaking connectivity preserving sets for graphs of general topology as well as for planar graphs. In particular, the algorithm guarantees that not more than 1/3 of all turns in the network become prohibited. We also present experimental results on the fraction of prohibited turns, the distance dilation, as well as on the message delivery times and saturation loads for the proposed algorithm in comparison with known tree-based algorithms. The proposed algorithm outperforms substantially the tree-based algorithms in all characteristics considered.
A temporary resource reservation mechanism can enhance the performance of a stateless PCE in situations when the TED might not be up-to-date. This paper examines the benefits of such a mechanism by means of simulation.
ISBN:
(纸本)9781457702136
A temporary resource reservation mechanism can enhance the performance of a stateless PCE in situations when the TED might not be up-to-date. This paper examines the benefits of such a mechanism by means of simulation.
The selection policy of an adaptive routing algorithm plays an important role on both performance and power figures of a network on chip (NoC). In this paper we propose a new selection policy which is power-aware. The...
详细信息
ISBN:
(纸本)9781612848990
The selection policy of an adaptive routing algorithm plays an important role on both performance and power figures of a network on chip (NoC). In this paper we propose a new selection policy which is power-aware. The basic idea is taking into account not only a performance metric but also a power metric related to both self and coupling switching activity of the selected output link. The experimental analysis, carried out on both synthetic and real traffic scenarios, shows important power and energy savings (up to 30% and 27% respectively) with a negligible impact on performance.
Based on the analysis of communication process between satellite and ground data center, the bi-level intersected architecture of Satellite-Ground Link (SGL) network was constructed. An optimized SGL routing algorithm...
详细信息
Nodes in most wireless sensor networks (WSNs) are powered by batteries with limited energy. Prolonging network lifetime and saving energy are two critical issues for WSNs. Some energy-saving routing algorithms like mi...
详细信息
Nodes in most wireless sensor networks (WSNs) are powered by batteries with limited energy. Prolonging network lifetime and saving energy are two critical issues for WSNs. Some energy-saving routing algorithms like minimum spanning tree based ones can reduce total energy consumption of a WSN, but they place too heavy burden of forwarding data packets on several key nodes so that these nodes quickly drain out available battery energy, making network lifetime shortened. In this paper, a routing algorithm termed Energy-efficient routing Algorithm to Prolong Lifetime (ERAPL) is proposed, which is able to dramatically prolong network lifetime while efficiently expends energy. In the ERAPL a data gathering sequence (DGS), used to avoid mutual transmission and loop transmission among nodes, is constructed, and each node proportionally transmits traffic to the links confined in the DGS. In addition, a mathematical programming model, in which minimal remaining energy of nodes and total energy consumption are included, is presented to optimize network lifetime. Moreover, genetic algorithms are used to find the optimal solution of the proposed programming problem. Further, simulation experiments are conducted to compare the ERAPL with some well-known routing algorithms and simulation results show the ERAPL outperforms them in terms of network lifetime. (C) 2009 Elsevier B.V. All rights reserved.
The mathematical model for vehicle routing problem with multiple time windows (VRPMTW) is presented, and a hybrid intelligent algorithm is proposed. The algorithm combines the ant colony system with the 2-opt, cell al...
详细信息
暂无评论