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...
详细信息
Roadway navigation systems have become increasingly popular, providing more efficient routing through a roadway network. In many cases, multiple routes are possible, and a specific route can be selected by minimizing ...
详细信息
Roadway navigation systems have become increasingly popular, providing more efficient routing through a roadway network. In many cases, multiple routes are possible, and a specific route can be selected by minimizing some cost function. However, the number of possible routes varies by roadway network topology and location within the network. It is often useful to know how many possible routes exist;therefore, the authors developed a Navigational Mobility Index (NMI) with an initial focus on freeway networks that can be extended to other roadway facility types. NMI can be based on the number of possible routes weighted by shared segments among routes from a source to a destination (i.e., node-to-node pair NMI), as a single node to all other nodes (i.e., node-NMI), or on an average of nodes in a specific area (i.e., area-NMI). This article first reviews several of the existing accessibility or mobility measures that have been developed for other purposes and discusses how these are not well suited for navigational route selection. Then, NMI is defined in detail, highlighting its advantages for navigational purposes. Next, the authors present applications of NMI, including its ability to (a) measure the degree of freedom in which drivers can choose routes from a route choice perspective, (b) determine the potential effectiveness of navigation systems, (c) determine the overall connectivity level of an area, (d) guide the movement of people during evacuation in a disastrous event, and (e) determine a route on the basis of the least generalized cost that incorporates both distance and NMI. The author selected and evaluated two of California's freeway networks as case studies. Examples of node-NMI and area-NMI are calculated and plotted using data from the Census 2000 TIGER/LineShapefiles (2000). Last, the authors present experimental results to show the effectiveness of the proposed concept and 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.
Aiming at existing deficiencies such as low text semantic relevance degree in P2P context search, an Ontology based P2P Content Semantic Search routing Algorithm is developed. In this algorithm, texts are described as...
详细信息
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...
详细信息
ISBN:
(纸本)9780984589333
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 ant colony routing algorithm (FACR) making use of timed-out forward ants and backward broadcasting ants is proposed to accelerate the routing process. This algorithm is simulated on NS2 and is compared to traditional ant colony routing algorithm (TACR). The results indicate that FACR achieves lower packet loss rate than T ACR under the same experimental conditions. Moreover, FACR shows a shorter end to end delay and higher residual energy rate.
This paper puts forward a routing algorithm based on Grover searching theory for MANET. It first gives the Grover searching theory and the construction way of probability branch matrix and solution path matrix which a...
详细信息
The technology of multimedia Content Delivery Network (CDN) is to build some replica servers in the network. The origin server replicates some multimedia contents to these replica servers in order to reduce the loadin...
详细信息
Providing reliable and yet energy efficient routing protocols is of an utmost importance in Wireless Sensor Networks. Wireless Sensor Networks imply multi-hop data forwarding over unreliable and moving nodes. When sel...
详细信息
ISBN:
(纸本)9781424484317
Providing reliable and yet energy efficient routing protocols is of an utmost importance in Wireless Sensor Networks. Wireless Sensor Networks imply multi-hop data forwarding over unreliable and moving nodes. When selecting the appropriate routing paradigm, the main challenge is to find the right equilibrium between the quality of data delivery and the energy invested. Insufficient quality of data delivery may fail the application deployed over the wireless sensor network, while an energy wasteful protocol may significantly shorten the lifetime of the network, thus making the deployment inefficient for its purpose. In this paper we propose a new routing algorithm for WSN's, named the Data Centric Braided Multipath (DCBM) algorithm. The algorithm is designed to achieve and maintain route resiliency through multiple interleaving routing paths, capable to cope with node mobility. Simulations show that the algorithm maintains a delivery ratio similar to the previously suggested protocols, but requires significantly lower control packet overhead. The algorithm has several additional desirable properties, like loop reduction and localized path repair.
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...
详细信息
With the computer and network technology to further the development and application of modern logistics and distribution are entering an information technology, automation, networking, intelligent stage of development...
详细信息
暂无评论