While many other disciplines have developed defacto standards to benchmark solutions to their pressing problems, routing protocols are often evaluated in an ad-hoc manner. The resulting variations in the evaluation le...
详细信息
ISBN:
(纸本)9781457718250
While many other disciplines have developed defacto standards to benchmark solutions to their pressing problems, routing protocols are often evaluated in an ad-hoc manner. The resulting variations in the evaluation lead to diminished comparability between different proposals. In this paper, we present a simulation framework for reproducible benchmarking of routing algorithms under various metrics, e.g., stretch, convergence time, routing table size, and message overhead. The measurements are performed on a variety of network topologies and with variations in network dynamics in order to capture the behavior and the capabilities of a routing protocol. Our framework is based on the well-known discrete event simulator OMNeT++ and provides an easy-to-use modular interface, statistic collection for the important metrics as well as a set of network topologies including precalculated metrics. This set of network topologies may serve as an additional reference point in the evaluation of routing protocols complementing existing reference topologies. We provide this framework to the research community as open-source software to alleviate rapid development, testing, and comparison of new routing protocols.
Wireless mesh sensor networks (WMSNs) have recently gained a lot of interest due to their communication capability to support various applications with different Quality of Service (QoS) requirements. The most challen...
详细信息
ISBN:
(纸本)9783642224492;9783642224508
Wireless mesh sensor networks (WMSNs) have recently gained a lot of interest due to their communication capability to support various applications with different Quality of Service (QoS) requirements. The most challenging issue is providing a tradeoff between the resource efficiency and the multi-constrained QoS support. For this purpose, we propose a cross-layer algorithm JSAR (Joint duty cycle Scheduling, resource Allocation and multi-constrained QoS routing algorithm) for WMSNs based on multi-channel multi-time slot Medium Access Control (MAC). To the best of our knowledge, JSAR is the first algorithm that simultaneously combines a duty cycle scheduling scheme for energy saving, a resource allocation scheme for efficient use of frequency channels and time slots, and an heuristic for multi-constrained routing protocol. The performance of JSAR has been evaluated, showing that it is suitable for on-line implementation.
In this work, we propose an application specific routing algorithm to reduce the hot-spot temperature for Network-on-Chip (NoC). Using the traffic information of applications, we develop a routing scheme which can ach...
详细信息
ISBN:
(纸本)9781424475162
In this work, we propose an application specific routing algorithm to reduce the hot-spot temperature for Network-on-Chip (NoC). Using the traffic information of applications, we develop a routing scheme which can achieve a higher adaptivity than the generic ones and at the same time distribute the traffic more uniformity. A set of deadlock-free admissible paths for all the communications is first obtained. To reduce the hot-spot temperature, we find the optimal distribution ratio of the communication traffic among the set of candidate paths. The problem of finding this optimal distribution ratio is formulated as a linear programming (LP) problem and is solved offline. A router microarchitecture which supports our ratio-based selection policy is also proposed. From the simulation results, the peak energy reduction considering the energy consumption of both the processors and routers can be as high as 16.6% for synthetic traffic and real benchmarks
In ant-based routing protocols, the routing exponent controls how ants hop from node to node to discover routes based on pheromone values. It has been shown that stable multi-route solutions for small routing exponent...
详细信息
ISBN:
(数字)9783642205200
ISBN:
(纸本)9783642205194
In ant-based routing protocols, the routing exponent controls how ants hop from node to node to discover routes based on pheromone values. It has been shown that stable multi-route solutions for small routing exponent values are dynamically connected to stable single-route solutions for large routing exponent values. These stable single-route solutions correspond to paths that have the smallest hop count. In this paper, we leverage this idea to improve the performance of ant-based routing protocols by dynamically adjusting the routing exponent. The results are validated via simulation.
This paper presents a new multicast protection technique for optical WDM mesh networks based on a novel Steiner tree algorithm. The new technique has lower blocking probability and cost, compared to conventional prote...
详细信息
ISBN:
(纸本)9781457719189
This paper presents a new multicast protection technique for optical WDM mesh networks based on a novel Steiner tree algorithm. The new technique has lower blocking probability and cost, compared to conventional protection methods.
With the development of Ad Hoc Network,the demand of the users becomes more and more than ever before,some business requires the ability not only to communicate,but also to guarantee delay and bandwid
ISBN:
(纸本)9781457703270
With the development of Ad Hoc Network,the demand of the users becomes more and more than ever before,some business requires the ability not only to communicate,but also to guarantee delay and bandwid
Jamming attacks are especially harmful to the reliability of wireless communication, as they can effectively disrupt communication. Existing jamming defenses primarily focus on repairing connectivity between adjacent ...
详细信息
ISBN:
(纸本)9781450306928
Jamming attacks are especially harmful to the reliability of wireless communication, as they can effectively disrupt communication. Existing jamming defenses primarily focus on repairing connectivity between adjacent nodes. In this paper, we address jamming at the network level and focus on restoring the end-to-end data delivery through multipath routing. As long as all paths do not fail concurrently, the end-to-end path availability is maintained. Prior work in multipath selection improves routing by choosing node-disjoint paths or link-disjoint paths. However, through our experiments on jamming effects using MicaZ nodes, we show that topological disjointness is insufficient for selecting fault-independent paths. Thus, we address multipath selection based on the knowledge of a path's availability history. Using Availability History Vectors (AHVs) of paths, we present an AHV-based Link-State (ALS) algorithm to select fault-independent paths. Our extensive simulation results validate that the ALS algorithm is effective in overcoming the jamming impact by maximizing the end-to-end availability of the selected paths.
There are many studies related with airport surface routing algorithms, based on different approaches and with different evaluation methods and metrics. So, the need of performing a balanced analysis and comparison us...
详细信息
ISBN:
(纸本)9781612847986
There are many studies related with airport surface routing algorithms, based on different approaches and with different evaluation methods and metrics. So, the need of performing a balanced analysis and comparison using a common framework is evident. This paper presents an implementation of an evaluation tool for airport surface routing algorithms. The routing evaluation tool presented here is based in three basic pillars composed by the airport model, the model and generation of traffic and a comprehensive figure of merit function. The paper includes some example evaluations performed over Barajas Airport with representative traffic samples using several simple routing methods.
The concept of Delay Tolerant Networks (DTNs) has been utilized for wireless sensor networks, mobile ad hoc networks, interplanetary networks, pocket switched networks and suburb networks for developing region. Becaus...
详细信息
ISBN:
(纸本)9781424495375
The concept of Delay Tolerant Networks (DTNs) has been utilized for wireless sensor networks, mobile ad hoc networks, interplanetary networks, pocket switched networks and suburb networks for developing region. Because of these application prospects, DTNs have received attention from academic community. Whereas only a few state of the art routing algorithms in DTNs address the problem of aborted messages due to the insufficient encounter duration. In order to reduce these aborted messages, we propose a routing framework which consists of two optional routing functions. Specifically, only one of them is activated according to the encounter angle between pairwise nodes. Besides, the copies of the undelivered message carried by most of the nodes in the network are more likely to be cleared out after successful transfer, which reduces the number of unnecessary transmissions for message delivery. By means of the priority for message transmission and deletion in case of the limited network resource, the proposed algorithm achieves the high delivery ratio with low overhead as well as less number of aborted messages due to the insufficient encounter duration, thus is more energy efficient.
Efficient deadlock-free routing strategies are crucial to the performance of large-scale computing systems. There are many methods but it remains a challenge to achieve lowest latency and highest bandwidth for irregul...
详细信息
暂无评论