The opportunistic network is based on the idea of "Store-Carry-Forward" between nodes which haven't complete communication links. It uses the encounter opportunity presented by node mobility to establish...
详细信息
The opportunistic network is based on the idea of "Store-Carry-Forward" between nodes which haven't complete communication links. It uses the encounter opportunity presented by node mobility to establish a route to realize communication. The traditional Epidemic algorithm uses the flooding mechanism which greatly increases the energy consumption of nodes, and it is often unable to supplement the energy of nodes at any time in the application environment of the opportunistic network. Therefore, this paper proposes an asynchronous sleep mechanism, which allows nodes to judge whether to enter the sleep state according to their own energy situation, real-time state and other information. It ensures that the nodes do not miss the possible communication opportunities by dynamically controlling the sleep time and wake-up time. The simulation results show that the proposed EASE algorithm can guarantee the network performance and greatly reduce the energy consumption of nodes compared with the classical opportunistic network routing algorithms.
With the development of the Internet, E-learning has become an important way of education. However, in online English classes, user experience problems still exist, such as network delay and slow video loading speed, ...
详细信息
With the development of the Internet, E-learning has become an important way of education. However, in online English classes, user experience problems still exist, such as network delay and slow video loading speed, which affect the learning effect and user engagement. Therefore, this paper hopes to improve E-learning user experience by studying routing algorithm and data visualization analysis technology. The routing algorithm is used to optimize the network connection. By analyzing the network topology and data transmission path, the optimal route is selected to reduce the network delay and bandwidth consumption. Data visualization technology is used to analyze and display the behavior and learning data of learners in the classroom in real time, so as to help learners better understand their learning situation. The experimental results show that the application of routing algorithm and data visualization analysis technology can significantly improve the user experience of online English classes. The stability of learners' network connection in the classroom is improved, the video loading speed is accelerated, and the learning effect is also significantly improved. By optimizing network connectivity and providing real-time data analytics, it is possible to meet the individual needs of learners and improve their learning effectiveness and engagement.
Most P2P applications use the routing algorithm that selecting the neighbor nodes at random. These routing algorithms increase the routing hops. To get better routing efficiency, a new routing algorithm named RIDC was...
详细信息
Most P2P applications use the routing algorithm that selecting the neighbor nodes at random. These routing algorithms increase the routing hops. To get better routing efficiency, a new routing algorithm named RIDC was presented in this paper. It dynamically merges nodes into different clusters in a taxonomy hierarchy, and organizes the clusters into routing overlays. By this algorithm the network performance is greatly enhanced. Preliminary evaluation shows that RIDC achieves a good convergence on a large scale of nodes.
This paper introduces a new generic routing algorithm called QColony for packetswitched communications networks that support real-time flows. In this context, we introduce both a novel path-selection scheme, namely th...
详细信息
This paper introduces a new generic routing algorithm called QColony for packetswitched communications networks that support real-time flows. In this context, we introduce both a novel path-selection scheme, namely the best-fit scheme, and a novel routing technique, namely the multi-pheromone technique, inspired by observations of biological ant colonies. Simulation was carried out for our algorithm and two other routing algorithms under various traffic scenarios and different irregular network topologies. Simulation results show that we can achieve good performance for the QColony algorithm. According to our experiments, QColony is able to provide smooth performance for all operating conditions, especially with large networks and under traffic scenarios with failure conditions and improperly functioning nodes. We also demonstrate through simulation that the best-fit scheme is able to deliver higher routing performance than what the shortest-path scheme can achieve.
This paper presents an effective approach using synchronous parallel transmission worm-switching supporting multicast services on hypercube multi-core architecture. Hypercube is a flexible interconnection structure an...
详细信息
This paper presents an effective approach using synchronous parallel transmission worm-switching supporting multicast services on hypercube multi-core architecture. Hypercube is a flexible interconnection structure and multi-cast packets on it are routed and scheduled among multi-coresusing a local identity routing algorithm. The identity ID attached to every flit allows different flits to be mixed in the same queue. In internal nodes, LUT decides the direction of flits and RU records the transmitting direction. Then switch arbiter decides what can pass the outgoing links and what have to wait. Polling-transmission policy is used to solve the deadlock problem.
作者：
Chao, ChenHunan Univ
Sch Comp & Commun Changsha 410082 Hunan Peoples R China
A routing mechanism for vehicular ad hoc networks (VANET), which is based on geographic location information, is presented according to its characteristics in urban environment. The algorithm reduces the number of rou...
详细信息
ISBN:
(纸本)9781457703218
A routing mechanism for vehicular ad hoc networks (VANET), which is based on geographic location information, is presented according to its characteristics in urban environment. The algorithm reduces the number of routing hole when delivering packet through marking a section whether or not it is a hole region(o) Meanwhile, the node which is located in intersection area combines greedy forwarding with directional forwarding when delivering packet(o) This method ensures the reliability of the routing algorithm(o) The simulation result shows that the proposed routing algorithm is more preferable for urban environment, compared with DSR, GPSR in terms of performance index like packet delivery rate and average end-to-end delay by using network simulator NCTUns.
In a total grouping of dynamic interconnection networks, safe and quick routing is so important. The Benes network is one of the dynamic interconnection networks that are good for telephone networks, multi-processor s...
详细信息
In a total grouping of dynamic interconnection networks, safe and quick routing is so important. The Benes network is one of the dynamic interconnection networks that are good for telephone networks, multi-processor systems, parallel computers, ATM switches and Navigation and radio communication between robots. In this paper, two models of Benes routing algorithm is introduced then compare them with looping; Hassan-José and fast algorithms in the speed of running time and implementation then introduce the optimum algorithm.
This paper proposed a research of communication network routing algorithm based on cloud computing technology. Our research designed cloud computing platform which applies to big data through the introduction of diffe...
详细信息
This paper proposed a research of communication network routing algorithm based on cloud computing technology. Our research designed cloud computing platform which applies to big data through the introduction of different types of routing protocols. The optimal routing selection of communication network and node energy balanced load provided the data storage and computing environment. In the route optimisation stage, this research used pheromone anycast mechanism for selecting route on the basis of the importance of heuristic factor on the path and the residual pheromone, avoiding the algorithm fall into local optimum. Taking the energy consumption of nodes as weight for the routing updates and adjustment in nodes-cluster, we controlled the energy consumption of inter-nodes at the optimal level. Simulation results show that in 20%-70% of the maximum traffic, the node energy consumption of routing algorithm in paper is better than the traditional algorithm, the proposed communication network routing algorithm has low average error rate of network data, high link reliability and good energy saving effect.
Recent design techniques are integrating 10 to 100 embedded functional and storage blocks in a single system on chip and the number is growing to increase with further advancements. The bus based interconnections are ...
详细信息
Recent design techniques are integrating 10 to 100 embedded functional and storage blocks in a single system on chip and the number is growing to increase with further advancements. The bus based interconnections are not a suitable alternative for Massively Parallel Multi-Processors Systems on Chip (MPSoCs) because of power and latency issue. The communication requirements of many-core embedded systems are addressed by the Networks on Chip (NoC) paradigm. In this paper, a minimal and fault tolerant routing algorithm is proposed so as to route packets adaptively through the shortest path in the presence of faulty nodes. Using fault-tolerant routing algorithm to reroute packets around faulty nodes will increase latency. Besides, the performance of NoC is heavily affected by network congestion. Congestion in the network increases the time to traverse a packet from a source to a destination. The proposed routing algorithm adaptively chooses the next node where to send packet, so as to avoid packet drop in presence of congestion. The algorithm does handle both single and multiple busy nodes using reconfigurable paths (minimal and/or non-minimal).
There are some shortcomings in the delay tolerant network (DTN) routing algorithm, such as low message delivery rate, low network efficiency and high cost in the satellite network. In order to solve the problem above,...
详细信息
ISBN:
(纸本)9781538632734
There are some shortcomings in the delay tolerant network (DTN) routing algorithm, such as low message delivery rate, low network efficiency and high cost in the satellite network. In order to solve the problem above, this paper proposes a limited copy algorithm MPWLC based on service probability. In MPWLC, not only is the number of copies limited, but the storage resources of the satellite are also taken into account to ensure reliable data transmission. The simulation results show that the proposed algorithm can effectively improve the efficiency of the network and ensure the reliable data transmission.
暂无评论