Energy efficiency has always been a major challenge in routing algorithm design. Aiming at the disadvantage of low energy efficiency of distributed energy efficient clustering algorithm DEEC, an improved energy hetero...
详细信息
Energy efficiency has always been a major challenge in routing algorithm design. Aiming at the disadvantage of low energy efficiency of distributed energy efficient clustering algorithm DEEC, an improved energy heterogeneous clustering routing algorithm is proposed. The improved algorithm is divided into two stages: cluster head selection and inter-cluster multi-hop transmission. In the stage of cluster head selection, the cluster head selection is made more reasonable and effective by setting energy threshold and location distribution. In the multi-hop transmission stage, the next hop node is determined considering the position, remaining energy, number of forwarding and number of nodes in the cluster. Simulation results show that compared with the original algorithm, the improved algorithm extends the network life cycle, balances the network energy load, and improves the data transmission efficiency.
Most of the existing routing algorithms are based on two dimension, and the results can't be directly applied to the three dimensional wireless sensor networks, the Space Angle Based Energy-Aware routing algorithm...
详细信息
Most of the existing routing algorithms are based on two dimension, and the results can't be directly applied to the three dimensional wireless sensor networks, the Space Angle Based Energy-Aware routing algorithm in three dimensional wireless sensor networks is designed in this paper. Firstly, the Iterative Split Clustering algorithm for dividing the network nodes is proposed. Secondly, we design the Space Angel Energy routing algorithm to transfer data within the clusters and between the clusters respectively, achieving the goal of less energy consumption and extending the network lifetime. We simulate and implement the algorithm and evaluate the performance based on topologies with different scales, and get a conclusion that by comparing with the typical algorithm, the routing algorithms proposed in this paper are able to reduce the network energy consumption effectively and extend the network lifetime.
With the rapid development of Internet, mobile networks and high-performance networking technology, QoS multicast routing has become a very important research issue in the areas of networks and distributed systems. Th...
详细信息
With the rapid development of Internet, mobile networks and high-performance networking technology, QoS multicast routing has become a very important research issue in the areas of networks and distributed systems. This is also a challenging and hard problem for the next generation Internet and high-performance networks. It attracts the interests of many people. This paper presents a distributed QoS multicast routing algorithm (DQMRA). This algorithm deals with delay and bandwidth constraints, and has low cost. The DQMRA attempts to significantly reduce the overhead for constructing a multicast tree. In this paper, the proof of correctness of the DQMRA is given, and the performance of the algorithm is evaluated using simulations. The study shows that our algorithm provides an available approach to QoS multicast routing.
In highly mobile pure ad-hoc wireless mesh networks, fast rerouting within low routing discovery delay is a mandatory requirement for routing algorithm to support interactive applications such as VoIP. Also, the commu...
详细信息
In highly mobile pure ad-hoc wireless mesh networks, fast rerouting within low routing discovery delay is a mandatory requirement for routing algorithm to support interactive applications such as VoIP. Also, the communication overhead should be thwarted when networks grow to a large scale. We propose a Tree-Based routing algorithm -TBRA to facilitate such two goals. On one hand, TBRA has very low routing discovery delay due to its proactive property. On the other hand, TBRA performs more efficiently than other proactive protocols with respect to low communication overhead, which thanks to its short routing packet length, less numbers and smaller routing table size. Our modeling analysis and simulation results verify that routing setup delay of TBRA grows only linear to hop counts (scalable to node’s speed) and communication overhead increases only linear to the number of nodes.
The use of peer-to-peer (p2p) applications is growing dramatically. Most p2p applications use the rout algorithm that selecting the neighbor nodes at random. This routing algorithm increases the routing hops and re...
详细信息
The use of peer-to-peer (p2p) applications is growing dramatically. Most p2p applications use the rout algorithm that selecting the neighbor nodes at random. This routing algorithm increases the routing hops and reduces the routing speed. To get better routing speed with less routing hops, a new routing algorithm named RGAAC based on group-average agglomerative clustering was presented. Structured by k clusters topology, this p2p network has k cluster center nodes. The cluster center nodes ensure the high performance of the RGAAC. Compared to some other p2p overlay routing algorithms, the RGAAC increases the performance in routing efficiency. The conclusions show that the RGAAC is an efficient routing algorithm, but also has some problems waiting for further study.
Opportunistic network is a random network and do not communicate with each other among the respective communication *** situation leads to the message transfer process become very *** this paper a reducing energy cons...
详细信息
Opportunistic network is a random network and do not communicate with each other among the respective communication *** situation leads to the message transfer process become very *** this paper a reducing energy consumption optimization selection of path transmission routing algorithm（OSPT） in opportunistic networks is *** is applied to the design of dynamic random network topology,created a dynamic link,optimized and selected the *** solves the problem of undeliverable messages for a long time in opportunistic *** to the simulation experiment and compare with epidemic algorithm and spray and wait *** results show that OSPT algorithm improves deliver ratio,reduce energy consumption,cache time and transmission delay.
Short contact time period between nodes as well as limited node buffers usually exist in opportunistic networks, resulting in the increase of delay and the loss of data packets. To address the problem, an improved epi...
详细信息
ISBN:
(纸本)9781479913930
Short contact time period between nodes as well as limited node buffers usually exist in opportunistic networks, resulting in the increase of delay and the loss of data packets. To address the problem, an improved epidemic routing algorithm(Reliable and Efficient routing algorithm assisted with Buffer Management, REBM) is proposed. Firstly, through the exchange of SV (Summary Vector) control packets, the data packets already reached the destination nodes are removed from the node buffers. Moreover, the data packets destined to the one-hop neighboring nodes obtain the priority to transmit. Theoretical analysis and extensive simulation results showed that the proposed algorithm can effectively increase the delivery rate, shorten the delivery delay, decrease the total number of transmitted data packets and cut down the buffer occupancy without increasing any control overhead.
In this paper we present a reconfigurable routing algorithm for a 2D-Mesh Network-on-Chip (NoC) dedicated to fault-tolerant, Massively Parallel Multi-Processors Systems on Chip (MP2-SoC). The routing algorithm can be ...
详细信息
ISBN:
(纸本)9781605581156
In this paper we present a reconfigurable routing algorithm for a 2D-Mesh Network-on-Chip (NoC) dedicated to fault-tolerant, Massively Parallel Multi-Processors Systems on Chip (MP2-SoC). The routing algorithm can be dynamically reconfigured, to adapt to the modification of the micro-network topology caused by a faulty router. This algorithm has been implemented in a reconfigurable version of the DSPIN micro-network, and evaluated from the point of view of performance (penalty on the network saturation threshold), and cost (extra silicon area occupied by the reconfigurable version of the router).
routing is a challenging task in the ad hoc networks, especially in vehicular ad hoc networks (VANETs) where the network topology changes fast and frequently. Since the nodes in VANETs are vehicles, which can easily p...
详细信息
ISBN:
(纸本)9781424458219;9781424458240
routing is a challenging task in the ad hoc networks, especially in vehicular ad hoc networks (VANETs) where the network topology changes fast and frequently. Since the nodes in VANETs are vehicles, which can easily provide the required power to run GPS receiver to get the accurate information of their position, the position-based routing is found to be a very promising routing strategy for VANETs. In this paper we present a clustering routing algorithm for VANETs. The clustering method is based on the Euclidean distance, which uses the position information to divide the vehicles into clusters. Furthermore, only the same direction vehicles can be divided into the same cluster. To reduce the flooding of the routing control message and increase the stability of the route, the routing discovery is also restricted by the vehicle's driving direction. We implement the routing algorithm in NS2 and compare it with AODV, the simulation results show that in the same VANETs environment, the algorithm not only generate fewer routing control overhead, but also maintain stable route to transfmit more data packets.
This paper introduces an improved algorithm based on an event-driven wireless network for the node density and energy-limited network. According to the characteristics of the node density, node coverage must be overla...
详细信息
This paper introduces an improved algorithm based on an event-driven wireless network for the node density and energy-limited network. According to the characteristics of the node density, node coverage must be overlapped. We use the algorithm to determine whether the node is redundant to a suspended state to save energy. And the remaining nodes in the network are to send information for the purpose. Based on the redundant nodes have more energy we choose them as cluster head nodes to prolong the network service life. Comparing the simulation results, the use of the proposed algorithm can indeed extend the network life with the same coverage.
暂无评论