For deep space networks, the major challenge is that transmission power consumption is serious while the power resource is limited. In this paper, we proposed a Temporal Graph Model based Power Aware routing algorithm...
详细信息
ISBN:
(纸本)9781509055074
For deep space networks, the major challenge is that transmission power consumption is serious while the power resource is limited. In this paper, we proposed a Temporal Graph Model based Power Aware routing algorithm using a weighted metric of remaining power level, data rate and distance of nodes for determining routes. The traditional standards and techniques of static networks is hard to solve routing problem in our networks. And the temporal graph model contributes to our scenario. Because the future contact information between nodes can be predicted accurately and we can use temporal graphs to model it. Our algorithm finds the route that obtains the minimal transmission power cost although these routes may be different. The numerical results demonstrate that our routing algorithm selects the path with low total transmission power in the first transmission round and achieves the maximum support transmission opportunities, making the network live longer.
Networks-on-Chips (NoCs) are experiencing escalating susceptibility to wear-out and reduced reliability, with the risk of becoming the key point of failure in an entire multicore chip. Aiming towards seamless NoC oper...
详细信息
ISBN:
(纸本)9781479964925
Networks-on-Chips (NoCs) are experiencing escalating susceptibility to wear-out and reduced reliability, with the risk of becoming the key point of failure in an entire multicore chip. Aiming towards seamless NoC operation in the presence of faulty communication links, in this paper we propose Hermes, a highly-robust, distributed and lightweight fault-tolerant routing algorithm, whose performance degrades gracefully with increasing faulty link counts. Hermes is a deadlock-free hybrid routing algorithm, utilizing load-balancing routing on fault-free paths to sustain high-performance, while providing pre-reconfigured escape path selection in the vicinity of faults. Additionally, Hermes identifies non-communicating network partitions in scenarios where faulty links are topologically densely distributed. An extensive experimental evaluation, including utilizing traffic benchmarks gathered from fullsystem chip multi-processor simulations, shows that Hermes improves network throughput by up to 3x when compared against prior-art.
Energy efficiency is a key design issue that needs to be enhanced in the Wireless Sensor Network (WSN) to improve the lifetime of the entire network. Cluster-based and chain-based protocols reduce the total energy con...
详细信息
ISBN:
(纸本)9781424413119
Energy efficiency is a key design issue that needs to be enhanced in the Wireless Sensor Network (WSN) to improve the lifetime of the entire network. Cluster-based and chain-based protocols reduce the total energy consumption via data aggregation, and balance energy consumption via cluster-head (CH) or leader rotation. However, most existing protocols focus on the load balance within each cluster. The energy consumption of the entire network is still unbalanced In this paper, we propose a novel Load Balance and Energy Efficient routing algorithm (LBEERA) for efficient data gathering in WSN. LBEERA is centralized controlled by the base station (BS) and utilizes the structure of layered chain. Furthermore, an improved PEGASIS chain construction algorithm is presented for LBEERA. Our analysis and simulation results show that LBEERA achieves better load balance than several existing protocols, increases network lifetime and reduces the pocket delivering delay.
Wireless sensor networks suffer from the secure threat, which leads to excessive energy consumption and the expense of increased transmission delay. In this paper, a secure routing algorithm is proposed. The node eval...
详细信息
ISBN:
(纸本)9781479969890
Wireless sensor networks suffer from the secure threat, which leads to excessive energy consumption and the expense of increased transmission delay. In this paper, a secure routing algorithm is proposed. The node evaluates the neighbor node by the trust value. The trust value of node is calculated by the accuracy rate of messages exchanging between two nodes. The trusted neighbor nodes set of the node is built on the trusted nodes those trust value is larger than the threshold value. Using the object function that consists of the parameters trust value, energy and delay, the most optimal path is found out by ant colony optimization. When the trust value of next hop node is lower than the threshold value, the routing path is deleted and changed into the other node. The experiment results show the algorithm has better performance than the current algorithm in terms of the network residual energy and transmission delay.
The IEEE 802.16 mesh network, which is self-organized and self-configured with multi-hop, is deployed to providing an effective solution for broadband wireless access system. The standard defines the basic scheduling ...
详细信息
ISBN:
(纸本)9783037855652
The IEEE 802.16 mesh network, which is self-organized and self-configured with multi-hop, is deployed to providing an effective solution for broadband wireless access system. The standard defines the basic scheduling scheme, but doesn't specify the resource allocation and routing scheme in the protocol. Therefore, designing a reasonable scheduling and routing algorithm to enhance the capability is very important for the system. In this paper, we propose an efficient and practical routing algorithm which takes the channel condition and modulation mode into consideration in an IEEE 802.16 mesh network. Furthermore, our algorithm enables direct communications between subscriber stations without referring to the base station. Simulation results show that our algorithm effectively improved the scheduling length, delay and system throughput.
To address the problems of large transmission delay and low success rate in DBGRS (Direction Based Geographic routing Scheme), we propose an novel routing algorithm which optimizes the process of data forwarding and m...
详细信息
ISBN:
(纸本)9781479928606
To address the problems of large transmission delay and low success rate in DBGRS (Direction Based Geographic routing Scheme), we propose an novel routing algorithm which optimizes the process of data forwarding and makes full use of the information in the neighbor table to achieve the goal of reducing the transmission delay and increasing the success rate. Theoretical analysis and simulation results show that our proposed algorithm outperforms DBGRS in terms of average delay, number of packets transmission, and the success rate of packets transmission.
Multicast services can be deployed either on network layer or application layer. Implementations of application-level multicast often provide more sophisticated features, and can provide multicast services where IP mu...
详细信息
ISBN:
(纸本)9783540724834
Multicast services can be deployed either on network layer or application layer. Implementations of application-level multicast often provide more sophisticated features, and can provide multicast services where IP multicast services are not available. In this paper, we consider the degree and delay constrained routing problem in overlay multicast for real-time multimedia applications, and an efficient Distributed Tree algorithm (DTA) is proposed. With DTA, end hosts can make trade-off between minimizing end-to-end delay and reducing local resource consumption by adjusting the heuristic parameters, and then self-organize into a scalable and robust multicast tree dynamically. By adopting distributed and tree-first schemes, a newcomer can adapt to different situations flexibly. The algorithm terminates when the newcomer reaches a leaf node, or joins the tree successfully. Simulation results show that the multicast tree has low node rejection rate by choosing appropriate values of the heuristic parameters.
As the number of cores on a single chip increased, the inter-core communication system quickly became the performance bottleneck. In order to solve the performance and scalability issues of bus-based systems, Network-...
详细信息
ISBN:
(纸本)9781728148823
As the number of cores on a single chip increased, the inter-core communication system quickly became the performance bottleneck. In order to solve the performance and scalability issues of bus-based systems, Network-on-chip (NoC) was proposed. This eventually met its own bottleneck and several technologies sprouted out from NoC research. The most commonly researched upgrade to NoCs was 3D NoCs, which utilized stacked routers to reduce the maximum hop count. Other researchers have looked at alternative transmission mediums, such as photonics. These technologies can be combined to give great performance and power benefits but can be slowed down by congestion in their path-setup phase. In order to solve this issue, we propose a traffic-aware routing algorithm that can evenly distribute the traffic throughout the chip, all while simultaneously avoiding faulty nodes. The results show that the proposed algorithm was successful in balancing the load across the chip and that the performance costs of the algorithm were mostly offset by the benefits of reducing blocked paths.
In recent years, system-on-chip designs have migrated from fairly simple single processor and memory designs to relatively complicated systems with higher communication requirements. Network-on-chip architectures emer...
详细信息
ISBN:
(纸本)9781467390262
In recent years, system-on-chip designs have migrated from fairly simple single processor and memory designs to relatively complicated systems with higher communication requirements. Network-on-chip architectures emerged as promising solutions for future system-on-chip communication architecture designs. However, the switching and routing algorithm design of network-on-chip communication architectures are still facing great challenges. To address the deficiencies of the existing routing algorithms, a new adaptive network-on-chip routing algorithm: Traffic Allocation routing algorithm is proposed in this paper. The specifics of Traffic Allocation routing as well as the simulation results and analysis are also presented. For the proposed algorithm, traffic allocation registers are added to each of the routers to keep track of communication traffic loads for the four outgoing directions. Instead of monitoring the buffer depth of the neighboring routers, the proposed Traffic Allocation routing measures traffic loads based on local computation so as to reduce extra communication overhead. Simulation of the proposed Traffic Allocation routing algorithm and three existing routing algorithms has been carried out on NIRGAM network-on-chip simulator. Simulation results illustrate that the performance of the Traffic Allocation routing algorithm matches or exceeds the performance of the existing routing algorithms.
As the routing protocol can greatly influence the energy consumption of the sensor nodes in research field of wireless sensor networks. In this paper, we present a novel distributed hash table based routing algorithm ...
详细信息
ISBN:
(纸本)9781479942626
As the routing protocol can greatly influence the energy consumption of the sensor nodes in research field of wireless sensor networks. In this paper, we present a novel distributed hash table based routing algorithm for wireless sensor networks. Distributed hash table is a kind of distributed memory approach, of which the single node can be expanded to the whole Internet. Particularly, each node is controlled by a part of the whole resource space, and the related index information can be saved on it. In the proposed routing algorithm, each node in wireless sensor networks can be allocated an ID using hash functions. Afterwards, each node maintains a routing table, and then the selective information can be transmitted through the routing table. Next, we present a modified finger table named speedup finger table, and then used it in the wireless sensor networks routing algorithm. Finally, we design a series of experiments to verify the effectiveness of the proposed algorithm. Experimental results demonstrate that compared with the existing related works, the proposed routing algorithm is effective and can obviously reduce the energy consumption.
暂无评论