Existing opportunistic network routing algorithms usually have two main problems: excessive calculation of key nodes leads to the uneven energy consumption of nodes, and limited remaining cache of nodes leads to the l...
详细信息
ISBN:
(纸本)9781728195056
Existing opportunistic network routing algorithms usually have two main problems: excessive calculation of key nodes leads to the uneven energy consumption of nodes, and limited remaining cache of nodes leads to the loss of important messages. To solve the above problems, this paper proposed a new opportunistic network routing algorithm-EC-CW, which forwards messages according to the multi-copy mechanism and the communication willingness between nodes. The simulation results show that EC-CW reduces the average latency and the overhead rate in the nodes-sparse opportunistic network scenarios composed of high-cache nodes;EC-CW improves the delivery rate and reduces the overhead rate in the nodes-intensive opportunistic network scenarios composed of low-cache nodes.
A novel reliable routing algorithm in mobile ad hoc networks using fuzzy Petri net with its reasoning mechanism was proposed to increase the reliability during the routing selection. The algorithm allows the structure...
详细信息
A novel reliable routing algorithm in mobile ad hoc networks using fuzzy Petri net with its reasoning mechanism was proposed to increase the reliability during the routing selection. The algorithm allows the structured representation of network topology, which has a fuzzy reasoning mechanism for finding the routing sprouting tree from the source node to the destination node in the mobile ad boc environment. Finally, by comparing the degree of reliability in the routing sprouting tree, the most reliable route can be computed. The algorithm not only offers the local reliability between each neighboring node, but also provides global reliability for the whole selected route. The algorithm can be applied to most existing on-demand routing protocols, and the simulation results show that the routing reliability is increased by more than 80% when applying the proposed algorithm to the ad hoc on demand distance vector routing protocol.
Delay Tolerant Network (referred to as DTN), tend to have a high latency, low transmission rate, intermittent connections, nodes frequently move, delay tolerance, fault tolerance, limited storage and communication fea...
详细信息
Delay Tolerant Network (referred to as DTN), tend to have a high latency, low transmission rate, intermittent connections, nodes frequently move, delay tolerance, fault tolerance, limited storage and communication features harsh environment, the traditional TCP-based / IP Internet technology to-end communications cannot provide good service. This article aims to delay proposed opportunistic routing algorithm performance based on energy (EROD) tolerant network environment, solve network in extremely harsh environments, end to end path does not exist, the message routing and forwarding problems. Under the premise to ensure reliable transmission of messages, minimize transmission delay and reduce the messaging process of resource consumption.
Despite of high throughput and low fabrication cost of vertically partially connected 3D Noes, thermal difficulties arise from poor heat dissipation and inappropriate traffic distribution of these kinds of 3D Noes. Th...
详细信息
ISBN:
(纸本)9781509035861
Despite of high throughput and low fabrication cost of vertically partially connected 3D Noes, thermal difficulties arise from poor heat dissipation and inappropriate traffic distribution of these kinds of 3D Noes. This paper proposes an adaptive routing algorithm in order to manage thermal challenges in partially connected 3D Noes. In the proposed routing algorithm, vertical links declare their availability/unavailability status to their neighbor nodes due to their current temperature. In this way, hot vertical links have a chance to reduce their traffic load and to cool down. In a predefined time periods vertical links update process is done to determine current hot and cool vertical links. In an updating time periods, cool vertical links are announced to the routers of each layer for transmitting packets to other layers. Access Noxim simulator is used to evaluates the routing algorithm in different partially 3D networks. Results show that the proposed routing algorithm decreases the number of overheated nodes by at least 74% and improves the thermal variance by at least 13%. These results are achieved within at most 10% overhead in average latency delay.
With the development of space technology, many LEO microsatellites system, such as Starlink, provide the possibility of providing global communication service. At the same time, the new network architecture provides o...
详细信息
ISBN:
(纸本)9781665415064
With the development of space technology, many LEO microsatellites system, such as Starlink, provide the possibility of providing global communication service. At the same time, the new network architecture provides opportunities and challenges for the design of routing algorithm. This paper discusses the self-organized location assisted on-demand routing (LAOR) and directional penetration routing (DPR), and proposes a directed percolation routing algorithm based on self-organization for LEO satellite (DPRSO). It aims to provide low latency and low overhead communication services.
With the continuous digitalization and informationization in power communication network, the demands of processing, storage, and forwarding large amounts of power data are increasing. Adapting to this change, the sof...
详细信息
ISBN:
(纸本)9781509063529
With the continuous digitalization and informationization in power communication network, the demands of processing, storage, and forwarding large amounts of power data are increasing. Adapting to this change, the software defined network, which has high flexibility and programmability, is combined with the power communication network and changed the traditional network architecture. This paper studies in the routing mechanism based on SDN and proposes a genetic ant colony (GAC) routing algorithm, which combines the advantages of genetic algorithm and ant colony algorithm. After getting several preferable solutions produced by rapid search in large scale network, GAC algorithm makes full use of positive feedback to narrow the maximum search times, and then finds the optimal path quickly. Finally, after comparing the GAC routing algorithm with two smart routing strategies, the simulation results show that the speed of the algorithm is improved as well as the efficiency, so that the performance of power communication network can be optimized using the GAC routing algorithm.
Motivated by characteristics of the data transmission in the Wireless Sensor Networks(WSN),this paper proposed a WSN routing algorithm optimized based on the concept of potential field in the *** routing selecting the...
详细信息
ISBN:
(纸本)9781467349970
Motivated by characteristics of the data transmission in the Wireless Sensor Networks(WSN),this paper proposed a WSN routing algorithm optimized based on the concept of potential field in the *** routing selecting the proposed algorithm synthetically considers the factors of hops,reserving energy of node and its *** various parameter and factors,the algorithm constructs different potential fields,which move the data packets along the direction of the largest ***,this algorithm lets the energy consumption tending to keep at same level,avoids selecting the node with larger residual energy instead of lower power of its neighbours,and prolongs the lifetime of *** new algorithm has lower complexity to carry out at nodes,and experimental results illustrate that it has a better performance on balancing energy consumption and prolonging lifetime of WSN.
With the rapid development of multi-media services, the multi-media traffic flows make the load in wireless mesh network (WMN) increase sharply, which incurs network congestion. In the context of having multiple multi...
详细信息
ISBN:
(纸本)9781509013258
With the rapid development of multi-media services, the multi-media traffic flows make the load in wireless mesh network (WMN) increase sharply, which incurs network congestion. In the context of having multiple multicast sessions, the load-balance and interference-aware (LBIA) routing algorithm is proposed by considering the intra-flow interference, inter-flow interference and load balance. This algorithm selects the link with less load to transmit information and uses the load balance factor to balance the load of each link in multicast sessions. NS3 simulation results show that the proposed algorithm can improve the overall network performance.
Modern battlefield communications environment is very complex, the sensor network is extremely prone to splitting, in this situation the traditional routing protocols will fail, and opportunistic routing is regarded a...
详细信息
ISBN:
(纸本)9781467349338
Modern battlefield communications environment is very complex, the sensor network is extremely prone to splitting, in this situation the traditional routing protocols will fail, and opportunistic routing is regarded as the most promising techniques. While there have been some routing protocols such as Epidemic, Prophet Router, First Contact Router to use, none of these protocol allows multiple sending connections for any node. In this paper, we study the potential benefits of the multiple sending connections between any two nodes which move into each other's communication range. We develop a new protocol named MSC which is based on Epidemic routing. The simulations show that MSC has benefits in terms of the transmission delay and the delivery success rate compared to Epidemic, Prophet Router, and First Contact Router.
Thanks to the rapid development of wireless communication and electronic technology, wireless sensor networks have been increasingly used in military, medical and other fields. Because of the characteristics of wirele...
详细信息
ISBN:
(纸本)9783031067914;9783031067907
Thanks to the rapid development of wireless communication and electronic technology, wireless sensor networks have been increasingly used in military, medical and other fields. Because of the characteristics of wireless sensor networks, traditional network routing protocols are not applicable in wireless sensor networks. In recent research, many wireless sensor network routing algorithms have been proposed. Among these algorithms, the cluster routing algorithm performs well, but the cluster routing algorithm often has the problem that some nodes die prematurely due to too many communication tasks. Ant colony optimization algorithm can effectively solve the combinatorial optimization problem with NP-Hard characteristics, and is widely used in routing algorithms. Therefore, we propose a node protection routing algorithm for wireless sensor network based on clustering ant colony strategy (NPAWSN). This algorithm optimizes the clustering process, selects multiple cluster head nodes for clusters with high communication pressure, and at the same time, designs a new path probability selection model for ant movement, which fully considers the remaining energy of cluster head nodes close to the sink, effectively alleviating the problem of premature death of some nodes due to too many transmission tasks. The algorithm considers the sensor energy, communication efficiency and other factors. The use of adaptive ant colony algorithm improves the convergence speed and maintains the high performance of the routing algorithm.
暂无评论