Clustering and multi-hop routing algorithms prolongs the lifetime of wireless sensor networks(WSNS) substantially. However, existing algorithms usually consider clustering and routing as two independent problems. Info...
详细信息
ISBN:
(纸本)9780769550220
Clustering and multi-hop routing algorithms prolongs the lifetime of wireless sensor networks(WSNS) substantially. However, existing algorithms usually consider clustering and routing as two independent problems. Information exchanged in clustering phase is not fully utilized in routing phase. Energy Hole is another problem that shrinks the lifetime of WSNs due to the characteristics of the multi-hop forwarding model. In this paper, we propose a Context-Aware Unequal-Clustering routing algorithm (CAUCR) for WSNs, which consists of an Optimized Weighted Unequal-Clustering algorithm (OWUCA) and a Reverse Minimum Energy (RME) multi-hop routing algorithm. During our OWUCA clustering process, we additionally save some useful information for the subsequent RME routing algorithm, including minimum energy, minimum hop to base, and residual energy of neighbor cluster heads. RME starts routing construction based on the cluster head's distance to the sink, and the cluster head closer to the sink forms the routing table earlier. At the same time, RME utilizes the saved clustering information to reduce the overhead and energy consumption of the routing phase. Simulation results show that our CAUCR balances the energy consumption among sensor nodes, relieves the influence of "energy hole", and achieves an obvious improvement on the network lifetime.
As the mature GPS positioning technology cannot work well in indoor environment, there is no mature indoor navigation system for civil use. Besides indoor maps and indoor positioning technology, indoor routing algorit...
详细信息
ISBN:
(纸本)9781479941698
As the mature GPS positioning technology cannot work well in indoor environment, there is no mature indoor navigation system for civil use. Besides indoor maps and indoor positioning technology, indoor routing algorithm is an important part of indoor navigation technology. This paper first discusses the problem of cross-storey in buildings and gives a solution. Unlike outdoor routing, shortest path is usually not the best path indoors, a personalized path considering user preference and interest can be better. To achieve personalized routing, this paper comes up with a way to model and acquire user preference. On this basis, this paper improves traditional A* algorithm by considering user preference and then gives an example to show the advantage of the personalized A* algorithm. The results show that the improved algorithm can find a better path by considering path length and user preference synthetically.
Intensive Aquaculture Wireless Sensor Network (WSN) for water quality monitoring has specific requirements such as limited energy availability, low memory. Ant Colony Optimization (ACO) routing algorithm can maximize ...
详细信息
ISBN:
(纸本)9783037855959
Intensive Aquaculture Wireless Sensor Network (WSN) for water quality monitoring has specific requirements such as limited energy availability, low memory. Ant Colony Optimization (ACO) routing algorithm can maximize the lifetime of the network. A modified routing algorithm for Intensive Aquaculture WSN based on the ACO meta-heuristic is presented in this paper. Functions of basic ACO-based algorithm are modified to update the pheromone trail. The performance of Intensive Aquaculture WSN is improved on reducing memory used in monitor nodes and energy spent with communications. The modified routing algorithm was simulated for Intensive Aquaculture WSN scenarios and the results show that it maximizes energy savings.
This paper presents a novel routing algorithm for Butterfly-Fat-Tree (BFT) topology based Network-on-Chip (NoC) design. It proposes a routing algorithm along with router addressing scheme for BFT topology which can be...
详细信息
ISBN:
(纸本)9781728135496
This paper presents a novel routing algorithm for Butterfly-Fat-Tree (BFT) topology based Network-on-Chip (NoC) design. It proposes a routing algorithm along with router addressing scheme for BFT topology which can be used in any generic NoC router architecture. The proposed algorithm has been implemented in software using C, followed by hardware implementation using Verilog. It has been validated using FPGA based hardware and the results show that proposed routing algorithm routes the data from source to destination seamlessly. This can be incorporated with NoC router architecture to verify several functionalities on a hardware based prototype.
The performance of satellite networks largely depends on their routing algorithm. Existing routing algorithms for satellite networks usually are not quite adaptive or have the disadvantage of a large consumption in bo...
详细信息
ISBN:
(纸本)9781457702518
The performance of satellite networks largely depends on their routing algorithm. Existing routing algorithms for satellite networks usually are not quite adaptive or have the disadvantage of a large consumption in both computation and storage resources. In this paper, we propose a novel routing algorithm based on dynamic clustering for LEO satellite networks. By dynamic forming cluster of the satellite network, the routing algorithm is both adaptive, computational effective and need much less storage space. Simulation results show that our routing algorithm performs better and are more robust when the network topology changes.
An important application scenario of mobile opportunistic networks is social contact networks, in which nodes are composed of mobile devices carried by human beings, and social relations among nodes should be consider...
详细信息
ISBN:
(纸本)9781631901560
An important application scenario of mobile opportunistic networks is social contact networks, in which nodes are composed of mobile devices carried by human beings, and social relations among nodes should be considered when we design routing algorithm for mobile opportunistic networks. In this paper, we focus on social relations among nodes and node movement prediction, and propose a novel social community-based routing algorithm. We introduce the social relations as the key metrics for community dividing, and semi-Markov process is used to model movement of nodes based on the community structure. Based on the result of prediction, the next-hop nodes can be appropriately chose for message forwarding. Simulation is done, and the result shows that the proposed algorithm outperforms the other three classic routing algorithms.
This paper presents a distributed routing algorithm based on architecture of Forwarding and Control Element Separation(ForCES). On this algorithm the calculating routing table divides into two parts, inner routing tab...
详细信息
ISBN:
(纸本)9781424442348
This paper presents a distributed routing algorithm based on architecture of Forwarding and Control Element Separation(ForCES). On this algorithm the calculating routing table divides into two parts, inner routing table between Forwarding Elements and outer routing table between routers. Then according to both routing tables the Control Element calculates the final routing table of each Forwarding Element An independent routing server is used for the routing process, which decreases the amount of development work. This algorithm satisfies the distributed characteristic of ForCES router and reduces the amount of computation of Forwarding Element obviously: The algorithm has been applied at a prototype of ForCES router with satisfactory result.
This paper presents a fault-tolerant routing algorithm for mesh-based Networks-on-Chip (NoC) with faulty links. It is a distributed, adaptive and congestion-aware routing algorithm where only two virtual channels are ...
详细信息
ISBN:
(纸本)9781424466139
This paper presents a fault-tolerant routing algorithm for mesh-based Networks-on-Chip (NoC) with faulty links. It is a distributed, adaptive and congestion-aware routing algorithm where only two virtual channels are used for both adaptiveness and fault-tolerance. The proposed routing method has a multi-level fault-tolerance capability and therefore it is capable to tolerate more faulty links in more complicated faulty situations with additional hardware costs. The network performance, fault-tolerance capability and hardware overhead are evaluated through appropriate simulations. The experimental results show that the overall reliability of a Network-on-Chip is significantly enhanced against multiple link failures or partially faulty routers with only a small hardware overhead.
In recent years, the underwater wireless optical communication has been arising a great concern of academia because of its high bandwidth, low time delay spread, stability, high rate and so forth. In this paper, a dis...
详细信息
ISBN:
(纸本)9781538672242
In recent years, the underwater wireless optical communication has been arising a great concern of academia because of its high bandwidth, low time delay spread, stability, high rate and so forth. In this paper, a distributed energyefficient and balanced routing algorithm (DEEB) for an underwater wireless optical sensor network is proposed. The DEEB is applicable for both static and dynamic network. It reveals through simulation experiments that the DEEB can significantly reduce the routing consumption of energy, balance the energy load of nodes to prolong the work time of nodes comparing with existing algorithms.
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:
(纸本)9780769551227
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.
暂无评论