A Path Allocation Method for Opportunistic Networks with Limited Delay
In the future heterogeneous integrated wireless network environment, delay limited network has the characteristics of distributed self-organization, multi hop transmission, delay tolerance and intermittent link connection. Although it has great applicatio
- PDF / 440,183 Bytes
- 6 Pages / 439.37 x 666.142 pts Page_size
- 75 Downloads / 185 Views
Communication and Dispatching Center State Grid Henan Information and Telecommunication Company, Zhengzhou 450000, China [email protected] 2 State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China
Abstract. In the future heterogeneous integrated wireless network environment, delay limited network has the characteristics of distributed selforganization, multi hop transmission, delay tolerance and intermittent link connection. Although it has great application value in many scenarios, it still needs to provide certain QoS guarantee according to the business requirements. Therefore, how to effectively transmit information to meet the needs of different services in terms of transmission rate and delay is one of the key issues in the research of path allocation in delay constrained networks. In this paper, a path allocation method based on service priority is proposed. Network nodes use local information to evaluate the network state and calculate the initial service priority, and then select relay nodes according to congestion degree and encounter probability. Simulation results show that the algorithm improves the quality of service of high priority services in congestion, and provides high performance services for low priority services when the network resources are sufficient. Keywords: Opportunistic network
Service priority Path allocation
1 Introduction In view of how to efficiently transmit information in the network, meet the delivery rate and delivery delay requirements of different business information, some studies have proposed such as selection methods based on arrival probability or reference degree [1], but these methods have certain defects, such as low priority business may still not get transmission opportunities when resources are sufficient, and may not be able to when resources are insufficient Guarantee the service quality of high priority business. The QoS policy constraint policy proposed in reference [2] solves the above problems, but requires information such as the number of global nodes, and takes up too much space resources.
© The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2021 Q. Liu et al. (Eds.): CENet 2020, AISC 1274, pp. 701–706, 2021. https://doi.org/10.1007/978-981-15-8462-6_80
702
Z. An et al.
To solve these problems, this paper proposes a path allocation method based on service priority. This algorithm can use local information to improve the quality of service of high priority service when the network is congested, and provide high performance service for low priority service when the network resources are sufficient.
2 Related Work The performance of wireless network will be directly affected by the mobile model itself and its diversity [3]. The results of the same algorithm running in different mobile models are very different. The movement model of nodes is used to describe the physical movement rules of nodes, such as the locat
Data Loading...
