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 algorith...
详细信息
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.
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 chainbased protocols reduce the total energy cons...
详细信息
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 chainbased 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 packet delivering delay.
The network-on-chip(NoC) has been effectively developed for resolving the problem of communication on-chip. Its topology and routing algorithm that have significant impacts on network performance are currently researc...
详细信息
ISBN:
(纸本)9781784660529
The network-on-chip(NoC) has been effectively developed for resolving the problem of communication on-chip. Its topology and routing algorithm that have significant impacts on network performance are currently research focuses. Since low power is a critical issue to be focused on, Mesh-of-Tree(MoT) topology is more ideal. But some routers in Mo T may carry out heavy communication tasks, which means these routers consume more power and easily become hotspots. In this paper, we proposed a simplified Mesh-of-Tree(SMoT) topology based on Mo T in order to weaken this phenomenon and reduce the power consumption. We also proposed a congestion-aware routing algorithm for SMo T, considering both network load and shortest path between cores, making the communication spread to the entire network through adjusting the direction of data forwarding to decrease the network latency. By applying our proposed approach, compared with Mo T, experiment result shows the power consumption in network can be reduced by 5.39%–23.3%, the reduction in network latency is 4.23%–27.28%.
In wireless sensor network,the existing reinforcement learning routing algorithm usually optimize single goal and the process of route establishment is *** also has problem of data forwarding control *** this paper,we...
详细信息
In wireless sensor network,the existing reinforcement learning routing algorithm usually optimize single goal and the process of route establishment is *** also has problem of data forwarding control *** this paper,we present a dynamic adaptive routing algorithm with feedback learning ability to balance the energy of wireless sensor network,to reduce the routing hops,and to reduce the establishment *** algorithm will use the local routing information and the method of feedback to learn neighbors' state;routing reward values will be obtained by weighted calculation according to the energy information and the hop counts information;the optimal routing strategy will be obtained by updating the Q-value of routing table.
Consumer electronics products contain complex System-on-Chip (SOC) which needs efficient communication interconnects. Network-on-Chip (NoC) is a scalable solution for the communication requirement of SoC. Devising an ...
详细信息
ISBN:
(纸本)9781457714146
Consumer electronics products contain complex System-on-Chip (SOC) which needs efficient communication interconnects. Network-on-Chip (NoC) is a scalable solution for the communication requirement of SoC. Devising an effective routing algorithm for NoC is a great challenge. In this paper, we present a methodology of designing routing algorithms based on divide-conquer approach. In total, 266 effective routing algorithms which have better performance than Odd-Even are obtained. Simulation results show that the new routing can decrease the average packet latency up to 54.5% over than Odd-Even.
It has more special significance to design a high-efficient wireless sensor network with energies constrained. A kind of affinity propagation clustering algorithm was used for routing algorithm of heterogeneous wirele...
详细信息
It has more special significance to design a high-efficient wireless sensor network with energies constrained. A kind of affinity propagation clustering algorithm was used for routing algorithm of heterogeneous wireless sensor networks. A routing method of non-uniform clustering based on energies and distances was proposed. The proposed protocol had redefined the inputs of the affinity propagation algorithm accordingly. The residual energy of the nodes and the distances between the nodes and base station were comprehensively considered during forming the structure of non-uniform clustering. The dynamic multi-hop transmission mode was adopted in the process of data transferring. The simulation experiment indicates that the proposed routing method can effectively balance energy consumption, improve data transmissibility and prolong the sensor network's lifetime.
Also named as the path-finding algorithm, the routing algorithm aims at finding a good way between the source point and destination point under some constraint conditions(the path "cost" is the lowest). Spec...
详细信息
Also named as the path-finding algorithm, the routing algorithm aims at finding a good way between the source point and destination point under some constraint conditions(the path "cost" is the lowest). Specifying part of necessary nodes by the algorithm, the node constraint routing algorithm finds the "good" path and must pass the necessary nodes without the loop;otherwise, the path is invalid. The node constraint shortest path problem is regarded one HP-Hard problem, and the current research generally adopts the violent algorithm or the screening function approach(screen out some paths passing the most of the currently necessary nodes);however, these methods have the loop or own much high time complexity or space complexity, which easily causes the intermittent interruption of the path loop or the network. For the end-to-end node constraint path-finding problem of the common directed network graph, this thesis designs one heuristic search algorithm based on the reinforcement learning the breadth-first traversal;the algorithm adopts thought of combining the breadth-first search and the greedy algorithm to expand the path, adopts the reinforcement learning to predict and screen the importance degree of the path as well and finally gets the path passing all the necessary nodes. The simulation experiments result demonstrates that the algorithm proposed by the thesis can be applicable to the network graph with the larger scale, has good performance in the path weight and the computing time and is regarded as one practically applicable algorithm.
Power-aware routing, have been studied to avoid energy-scarce sensors and achieve network lifetime improvement but recently, it was noticed that sink mobility can also be used to improve network lifetime by avoiding e...
详细信息
ISBN:
(纸本)9781424455317;9781424455324
Power-aware routing, have been studied to avoid energy-scarce sensors and achieve network lifetime improvement but recently, it was noticed that sink mobility can also be used to improve network lifetime by avoiding excessive transmission overhead at nodes that are close to the location that would be occupied by a static sink. Also in many situations, a static sink may be unfeasible because of deployment or security constraints. In this paper, an energy-efficient method is introduced which can deliver data packets to mobile sink nodes. As can observed from simulation results, the mobile sink directed diffusion (MSDD) offers a magnificent way to upgrade directed diffusion algorithm to support sink mobility with minimum energy overhead and acceptable performance. Furthermore, in the proposed algorithm, no location service or predictable sink trajectory is assumed which is a common requirement in most of mobile sink routing algorithms. Simulation results show that MSDD algorithm can reach the packet delivery rate of over 55% in the worst case with the sink speed of 30 m/s with acceptable energy overhead.
This paper presents a new Clos network routing algorithm in order to reduce the high time complexity of original algorithm for Clos network. The paper illustrates that it is an independent problem whether a column in ...
详细信息
This paper presents a new Clos network routing algorithm in order to reduce the high time complexity of original algorithm for Clos network. The paper illustrates that it is an independent problem whether a column in specification matrix is completive. As a result, it eliminates backtrackings among columns and backtrackings among elements in the same column. The presented algorithm completely achieves non-blocking routing and reaches low time complexity O(N{sup}(3/2)) even in the worst case. So the algorithm is readily applicable to the control of Clos network.
The communication efficiency represents one of the key aspects in the future smart grid. Indeed, as the power distribution grid is being extended to fulfill increasing power demand population, recent advanced wireless...
详细信息
ISBN:
(纸本)9781479924509
The communication efficiency represents one of the key aspects in the future smart grid. Indeed, as the power distribution grid is being extended to fulfill increasing power demand population, recent advanced wireless communication standards and updates in the architecture of the distribution network have been introduced to upgrade the efficiency of data transmission and quality of service, enabling potential diversification of the power grid network depending on the operating environment. In this paper, we focus on wireless communications in the distribution trunk of the smart grid and propose an improved routing algorithm for wireless path selection to provide higher efficiency and reliability of communication. Comparison with existing schemes outline the potential benefits of introducing the proposing methodology.
暂无评论