scholarly journals A Routing Algorithm for the Sparse Opportunistic Networks Based on Node Intimacy

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Gang Xu ◽  
Xinyue Wang ◽  
Na Zhang ◽  
Zhifei Wang ◽  
Lin Yu ◽  
...  
Keyword(s):  
Routing Algorithm ◽  
Opportunistic Networks ◽  
Network Routing ◽  
Routing Algorithms ◽  
Time Slice ◽  
Message Delivery ◽  
Opportunistic Network ◽  
Network Resources ◽  
Subsequent Time

Opportunistic networks are becoming more and more important in the Internet of Things. The opportunistic network routing algorithm is a very important algorithm, especially based on the historical encounters of the nodes. Such an algorithm can improve message delivery quality in scenarios where nodes meet regularly. At present, many kinds of opportunistic network routing algorithms based on historical message have been provided. According to the encounter information of the nodes in the last time slice, the routing algorithms predict probability that nodes will meet in the subsequent time slice. However, if opportunistic network is constructed in remote rural and pastoral areas with few nodes, there are few encounters in the network. Then, due to the inability to obtain sufficient encounter information, the existing routing algorithms cannot accurately predict whether there are encounters between nodes in subsequent time slices. For the purpose of improving the accuracy in the environment of sparse opportunistic networks, a prediction model based on nodes intimacy is proposed. And opportunistic network routing algorithm is designed. The experimental results show that the ONBTM model effectively improves the delivery quality of messages in sparse opportunistic networks and reduces network resources consumed during message delivery.

scholarly journals RABP: Delay/disruption tolerant network routing and buffer management algorithm based on weight

2018 ◽  
Vol 14 (3) ◽  
pp. 155014771875787 ◽  
Author(s):  
Hezhe Wang ◽  
Guangsheng Feng ◽  
Huiqiang Wang ◽  
Hongwu Lv ◽  
Renjie Zhou
Keyword(s):  
Buffer Management ◽  
Network Routing ◽  
Routing Algorithms ◽  
Destination Node ◽  
Delivery Ratio ◽  
Message Delivery ◽  
Network Resources ◽  
Hop Count ◽  
Management Algorithm ◽  
Disruption Tolerant Network

Delay/disruption tolerant network is a novel network architecture, which is mainly used to provide interoperability for many challenging networks such as wireless sensor network, ad hoc networks, and satellite networks. Delay/disruption tolerant network has extremely limited network resources, and there is typically no complete path between the source and destination. To increase the message delivery reliability, several multiple copy routing algorithms have been used. However, only a few can be applied efficiently when there is a resource constraint. In this article, a delay/disruption tolerant network routing and buffer management algorithm based on weight (RABP) is proposed. This algorithm estimates the message delay and hop count to the destination node in order to construct a weight function of the delay and hop count. A node with the least weight value will be selected as the relay node, and the algorithm implements buffer management based on the weight of the message carried by the node, for efficiently utilizing the limited network resources. Simulation results show that the RABP algorithm outperforms the Epidemic, Prophet, and Spray and wait routing algorithms in terms of the message delivery ratio, average delay, network overhead, and average hop count.

scholarly journals QoS Routing Algorithm Based on Entropy Granularity in the Network Transmission

2019 ◽  
Vol 19 (4) ◽  
pp. 61-72
Author(s):  
Xiaoling Li ◽  
Hai Hu
Keyword(s):  
Shortest Path ◽  
Rapid Development ◽  
Routing Algorithm ◽  
Routing Algorithms ◽  
Adaptive Genetic Algorithm ◽  
Service Capacity ◽  
Network Resources ◽  
Qos Routing Algorithm

Abstract With the rapid development of computer networks, more hosts are connected to the Internet where they could communicate with each other. The need for network service has exceeded the service capacity of the network, and the Quality of Service (QoS) is gradually declining. Based on existing Shortest Path First (SPF) algorithm, this paper proposes a new QoS required transmission path approach by considering the overhead balance of network resources. This paper uses the entropy granularity as the main line in the application of routing protocols. Firstly, it researches the optimization of routing algorithms for network load balancing resources, routing algorithms based on link traffic distributing weights, link weight optimization based on adaptive genetic algorithm and computational intelligence based on entropy granularity theory. This research proposes a method to apply entropy granularity to Open Shortest Path First (OSPF) routing, including the implementation of the method. After that, a case study is presented by using some examples.

scholarly journals Influence of Self-Similar Traffic Type on Performance of QoS Routing Algorithms

2016 ◽  
Vol 62 (1) ◽  
pp. 81-87 ◽  
Author(s):  
Michał Czarkowski ◽  
Sylwester Kaczmarek ◽  
Maciej Wolff
Keyword(s):  
Routing Algorithm ◽  
Routing Algorithms ◽  
Point Of View ◽  
Telecommunication Networks ◽  
Quality Of Services ◽  
Network Resources ◽  
Performance Point ◽  
New Type ◽  
Self Similar

Abstract Providing a Quality of Services (QoS) into current telecommunication networks based on packet technology is a big challenge nowadays. Network operators have to support a number of new services like voice or video which generate new type of traffic. This traffic serviced with QoS in consequence requires access to appropriate network resources. Additionally, new traffic type is mixed with older one, like best-effort. Analysis of these new and mixed traffic types shows that this traffic is self-similar. Network mechanisms used for delivery of quality of services may depend on traffic type especially from the performance point of view. This paper presents a feasibility study done into the effect of traffic type influence on performance of routing algorithm while the routing algorithm is treated as one of the mechanisms to support QoS in the network.

scholarly journals Opportunistic Network Algorithms for Internet Traffic Offloading in Music Festival Scenarios

Sensors ◽  
2021 ◽  
Vol 21 (10) ◽  
pp. 3315
Author(s):  
Aida-Ștefania Manole ◽  
Radu-Ioan Ciobanu ◽  
Ciprian Dobre ◽  
Raluca Purnichescu-Purtan
Keyword(s):  
High Performance ◽  
Geographical Area ◽  
Mobility Model ◽  
Routing Algorithms ◽  
Message Delivery ◽  
Opportunistic Network ◽  
Key Factors ◽  
Network Algorithms ◽  
Music Festival ◽  
Social Metrics

Constant Internet connectivity has become a necessity in our lives. Hence, music festival organizers allocate part of their budget for temporary Wi-Fi equipment in order to sustain the high network traffic generated in such a small geographical area, but this naturally leads to high costs that need to be decreased. Thus, in this paper, we propose a solution that can help offload some of that traffic to an opportunistic network created with the attendees’ smartphones, therefore minimizing the costs of the temporary network infrastructure. Using a music festival-based mobility model that we propose and analyze, we introduce two routing algorithms which can enable end-to-end message delivery between participants. The key factors for high performance are social metrics and limiting the number of message copies at any given time. We show that the proposed solutions are able to offer high delivery rates and low delivery delays for various scenarios at a music festival.

A Wireless Sensor Network Routing Algorithm Based on Zigbee

2014 ◽  
Vol 513-517 ◽  
pp. 1845-1849
Author(s):  
Hua Rui Wu ◽  
Li Zhu
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Large Scale ◽  
Routing Algorithm ◽  
Network Routing ◽  
Routing Algorithms ◽  
Wireless Sensor ◽  
Quantitative Relation ◽  
Analysis Model

Routing strategy with effective and saving energy is an important problem in the research on the application of wireless sensor network into the farmland micro climate and soil moisture monitoring,it analyzed the disadvantage of the layered tree routing algorithm and ZigBee routing algorithms in energy saving, combined with ZigBee network topology,establishing an optimal node analysis model based on fuzzy decision, bringing forward a new routing algorithm which is suitable for large-scale farmland gradient environment, this new algorithm find out the quantitative relation between energy consumption and routing node selecting strategy,which can greatly decrease the route hop number by routing discovery mechanism and create an optimum goal group. Simulation results showed that compared with the layered tree and ZigBee routing algorithms,the new routing algorithms can significantly reduce the energy consumption of routing process.

Propose a new algorithm of routing with information collected locally

2016 ◽  
Vol 2 (1) ◽  
pp. 70
Author(s):  
Tran Minh Anh ◽  
Nguyen Chien Trinh
Keyword(s):  
Routing Algorithm ◽  
Qos Routing ◽  
Local Information ◽  
Routing Algorithms ◽  
Source Node ◽  
Quality Of Services ◽  
Global State ◽  
State Information ◽  
Near Future

The type of algorithm which uses local information collected from source node for Quality of Service (QoS) routing has recently been researched as an alternative to QoS routing algorithms that traditionally use global state information. This algorithm, collecting information from source node only, helps flow routing better and assures more flexibly QoS for network. This trend leads to a new solution for satisfying the higher and higher demand of telecom market in the near future. In this paper, we introduce a new algorithm of routing like that type for assuring the quality of network as well as quality of services. The simulations at last section show the advantages over some other localized routing algorithms and global routing algorithm.

DTN Routing Mechanism Based on Area Dipartition

2013 ◽  
Vol 756-759 ◽  
pp. 851-854
Author(s):  
Yun Yang ◽  
Long Sheng Han ◽  
Ran Yan ◽  
Xiu Ping Kong ◽  
Wen Chun Xu
Keyword(s):  
Network Architecture ◽  
Data Transfer ◽  
Routing Algorithm ◽  
Network Routing ◽  
Message Delivery ◽  
Transfer Path ◽  
Delivery Probability ◽  
Dtn Routing ◽  
Routing Mechanism ◽  
Delay Tolerant

Delay Tolerant Networks (DTN) has been widely used in challenge networks as an emerging network architecture. Among all studies , routing mechanism is the key problem in DTN. Because of high latency and low data rate, the traditional network routing algorithm can not apply to DTN. This paper proposed a DTN routing mechanism based on area dipartition. The mechanism divided the space into several regions, and calculated the probability of occurrence of each node in each region to determine data transfer path according to the probability. Finally, the simulation results show that the mechanism can significantly enhance the message delivery probability and reduce the packet loss rate.

scholarly journals An Opportunistic Network Routing Algorithm Based on Cosine Similarity of Data Packets between Nodes

Algorithms ◽  
2018 ◽  
Vol 11 (8) ◽  
pp. 119 ◽  
Author(s):  
Yucheng Lin ◽  
Zhigang Chen ◽  
Jia Wu ◽  
Leilei Wang
Keyword(s):  
Routing Algorithm ◽  
Network Routing ◽  
Cosine Similarity ◽  
Delivery Ratio ◽  
Opportunistic Network ◽  
Text Data ◽  
Data Packets ◽  
Network Transmission ◽  
Definition Of ◽  
Cosine Distance

The mobility of nodes leads to dynamic changes in topology structure, which makes the traditional routing algorithms of a wireless network difficult to apply to the opportunistic network. In view of the problems existing in the process of information forwarding, this paper proposed a routing algorithm based on the cosine similarity of data packets between nodes (cosSim). The cosine distance, an algorithm for calculating the similarity between text data, is used to calculate the cosine similarity of data packets between nodes. The data packet set of nodes are expressed in the form of vectors, thereby facilitating the calculation of the similarity between the nodes. Through the definition of the upper and lower thresholds, the similarity between the nodes is filtered according to certain rules, and finally obtains a plurality of relatively reliable transmission paths. Simulation experiments show that compared with the traditional opportunistic network routing algorithm, such as the Spray and Wait (S&W) algorithm and Epidemic algorithm, the cosSim algorithm has a better transmission effect, which can not only improve the delivery ratio, but also reduce the network transmission delay and decline the routing overhead.

A New Localized Multi-Constraint QoS Routing Algorithm

2017 ◽  
Author(s):  
Tran Minh Anh ◽  
Nguyen Chien Trinh
Keyword(s):  
Routing Algorithm ◽  
Qos Routing ◽  
Routing Algorithms ◽  
Source Node ◽  
Global Network ◽  
Traffic Patterns ◽  
State Information ◽  
Alternative Approach ◽  
Qos Routing Algorithm

The scheme of Quality of Service (QoS) routing algorithms based on local state information has recently been proposed as an alternative approach to the traditional QoS routing algorithms. By implementing this localized QoS routing algorithm, each source node predetermines and maintains a set of candidate paths for each destination. These sets of paths will help the source node to decide the most appropriate path for a connection request. Hence, it helps to avoid the problems associated with the maintenance of the global network state information. In this paper, we propose a new and effective localized QoS routing algorithm, compare its performance with those of other localized algorithms and a traditional QoS routing algorithm under the same type of network topology, QoS requirements and traffic patterns. The simulations results show that our proposed algorithm can perform better than other routing algorithms. DOI: 10.32913/rd-ict.vol3.no14.258

Sign in / Sign up

Export Citation Format

Share Document