In ZigBee networks, the classical Tree routingalgorithm only utilizes the father-child relationship between nodes to establish routes, thus the path usually may not be optimal, which leads to some extra overhead. To a...
详细信息
In the wireless sensor networks (WSNs), the battery energy of sensor node is very limited. So, how to use energy of sensor node effectively to prolong the lifetime of WSNs is a challenge. Now, we mostly adopt the rout...
详细信息
This paper presents an approach that applies the Artificial Bee Colony algorithm to the Two-Terminals-Net-routing(TTNR) problem in VLSI physical design and compares its performance with the maze algorithm variant know...
详细信息
Denser transistor integration has enabled the fabrication of multi-tile chips, however, at the expense of higher susceptibility to defects and wear-out. Metal wires comprising the links of Networks-on-Chip (NoCs) are ...
详细信息
In this paper, a novel routing algorithm for relay selection (RS) in multi-hop relay networks is proposed based on Viterbi algorithm with truncated decoding memory. It maps the network topology to a trellis diagram of...
详细信息
Wireless sensor network nodes have the drawbacks such as limited energy and poor processing ability. This paper presents two algorithms, i.e. heap-optimized shortest path algorithm and bidirectional shortest path algo...
详细信息
ISBN:
(纸本)9781849195379
Wireless sensor network nodes have the drawbacks such as limited energy and poor processing ability. This paper presents two algorithms, i.e. heap-optimized shortest path algorithm and bidirectional shortest path algorithm to overcome above drawbacks. These two algorithms can improve routing efficiency, extend network lifetime and reduce network congestion by optimizing the selection of unmarked nodes and by introducing the node energy thresholdEminThis paper analyzes the principle and the implementation process of these two algorithms, and compares their routing efficiency with traditional algorithm via experiment. At last, the paper summarizes the advantages and applications of both algorithms.
In this paper we address the heterogeneous multi-vehicle routing problem by proposing a distributed algorithm based on gossip. We consider the case where a set of tasks arbitrarily distributed in a plane, each with a ...
详细信息
To overcome the flaws of ignoring the energy consumption and flooding RREQ packets in the present hybrid routing algorithms for ZigBee networks, we propose in this paper an efficient hybrid routing algorithm without f...
详细信息
In Cognitive-Radio (CR) enabled Vehicular Ad-Hoc NETworks (CR-VANETs), high mobility of vehicles and dynamically varying spectrum occupation statuses frequently cause the established routes broken. To deal with the in...
详细信息
The stochastic state of the network should be given full consideration when a QoS routing algorithm is designed. This paper proposed an improved ant colony algorithm with multi-strategies for solving QoS routing probl...
详细信息
暂无评论