CN113613292B - Message management method based on message utility value and node average meeting duration - Google Patents
Message management method based on message utility value and node average meeting duration Download PDFInfo
- Publication number
- CN113613292B CN113613292B CN202110896499.9A CN202110896499A CN113613292B CN 113613292 B CN113613292 B CN 113613292B CN 202110896499 A CN202110896499 A CN 202110896499A CN 113613292 B CN113613292 B CN 113613292B
- Authority
- CN
- China
- Prior art keywords
- message
- node
- utility value
- nodes
- meeting
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/10—Flow control between communication endpoints
- H04W28/14—Flow control between communication endpoints using intermediate storage
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/90—Buffering arrangements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/90—Buffering arrangements
- H04L49/9084—Reactions to storage capacity overflow
- H04L49/9089—Reactions to storage capacity overflow replacing packets in a storage arrangement, e.g. pushout
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a message management method based on a message utility value and average meeting duration time of nodes, which comprises the following steps: s1, counting the meeting times and the meeting duration time of each node and other nodes in the opportunity network; s2, defining a message utility value according to the life cycle of the message, the residual life event of the message, the node cache space and the node residual cache space; s3, forwarding the message according to the average meeting duration time of the nodes; and S4, when the node is ready to receive the newly arrived message, checking whether the node cache space can accommodate the new message, and if the node cache space is insufficient to receive the new message, deleting the message with the small message utility value and the maximum transmission hop count in the network from the node cache according to the utility value of the message until the node cache space can accommodate the new message. The invention makes the buffer space of the message more effectively utilized, has higher accuracy and faster speed in transmitting the message, reduces the message transmission delay and improves the message delivery rate.
Description
Technical Field
The invention relates to the technical field of opportunistic network message management, in particular to a message management method based on a message utility value and average meeting duration of nodes.
Background
In recent years, with the popularization of various smart mobile devices, such as smart phones, smart watches, tablet computers, and other portable devices, the demand for wireless communication using these smart devices has increased. In reality, due to factors such as mobility, limited energy consumption, environmental interference and the like of the nodes, communication among the nodes is often interrupted, a fully connected network cannot be established, and the traditional ad hoc network cannot meet the communication requirements. The opportunistic network does not need a fixed transmission path between the source node and the destination node, so that the requirement of the actual ad hoc network is met.
Because the nodes in the opportunistic network have mobility, the opportunistic network has the characteristics of intermittent connection, large network delay and the like, searching for a proper relay node to accurately and quickly deliver the message to the destination node is the most urgent concern in the routing algorithm. Therefore, selecting a node with a long total average encounter duration as a relay node and deleting a less valuable message when the node cache overflows can effectively improve the speed of message delivery and improve the accuracy of the routing algorithm.
Disclosure of Invention
The technical problem to be solved by the invention is to provide a message management method based on a message utility value and average meeting duration time of nodes aiming at the defects in the prior art.
The technical scheme adopted for solving the technical problems is as follows:
the invention provides a message management method based on a message utility value and average meeting duration time of nodes, which screens messages in a node cache space by the method based on the message utility value in an opportunity network, and continuously meets the nodes as one of forwarding basis of the messages; the method comprises the following steps:
s1, counting the meeting times and the meeting duration time of each node and other nodes in the opportunistic network in a given time period;
s2, defining a message utility value according to the life cycle of the message, the residual life event of the message, the node cache space and the node residual cache space, and taking the message utility value as a basis for screening the message to be deleted in the node cache space;
s3, in the message forwarding stage, different message forwarding strategies are adopted according to the message delivery probability: judging whether the message delivery probability of the meeting node reaching the destination node is larger than the message delivery probability of the node reaching the destination node, if so, forwarding the message to the meeting node by the node; if not, continuing to judge whether the total average meeting duration of the meeting node and other nodes is larger than the total average meeting duration of the node and other nodes, and if so, forwarding the message to the meeting node by the node;
s4, deleting the successfully delivered message from the node cache by using an ACK deleting mechanism; in addition, when the node cache space is insufficient to receive the new message, deleting the message by combining the utility value of the message and the transmission hop count of the message in the network, and deleting the message with the minimum utility value of the message in the node cache space and the maximum transmission hop count in the network until the node cache space can receive the new message.
Further, the method for calculating the message utility value in the step S2 of the invention comprises the following steps:
message m i Utility value of (1) is based on the cache size of the node and message m i The effect of the message utility value is the basis for deleting the message when the node cache space overflows, and the calculation formula is as follows:
wherein, the messageSize represents the message size, the bufferSize represents the current node buffer size, the messageremaininttl represents the message remaining lifetime, and the messageInitTTL represents the message initial lifetime; the node does not need to store the message utility value, and can calculate the message utility value only when cache overflow occurs and the message needs to be deleted.
Further, in step S3 of the present invention, the calculation formula of the total average meeting duration of the nodes in the message forwarding stage is as follows:
wherein meetTimeAll represents node v i The sum of the encounter durations with other nodes, meetCountAll, represents node v j Sum of the number of encounters with other nodes.
The invention has the beneficial effects that: the message management method based on the message utility value and the average meeting duration of the nodes ensures that the message transmission is more accurate, reduces the occurrence of the condition that some messages which are not successfully delivered are deleted due to blind deletion of the messages, and improves the overall performance of a routing algorithm.
Drawings
The invention will be further described with reference to the accompanying drawings and examples, in which:
FIG. 1 is a message forwarding policy process diagram of a message management method based on message utility values and node average encounter durations according to an embodiment of the present invention;
fig. 2 is a diagram of a message management method congestion control procedure based on message utility values and node average encounter durations according to an embodiment of the present invention.
Detailed Description
The present invention will be described in further detail with reference to the drawings and examples, in order to make the objects, technical solutions and advantages of the present invention more apparent. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the invention.
As shown in fig. 1, according to the message management method based on the message utility value and the average node encounter duration, the transmission of the message in the network is enlarged through the total average node encounter duration, and when the node cache overflows, the message utility value is defined according to the node cache and the message size, and is screened and deleted; the method comprises the following steps:
s1, counting the meeting times and the meeting duration time of each node and other nodes in the opportunity network in a given time period;
s2, defining a utility value of the message: defining a message utility value according to the life cycle of the message, the residual life event of the message, the node cache space and the node residual cache space; the utility value of the message is used as the basis for screening the message to be deleted in the node cache space;
s3, in the message forwarding stage, different message forwarding strategies are adopted according to the message delivery probability: judging whether the message delivery probability of the meeting node reaching the destination node is larger than the message delivery probability of the node reaching the destination node, if so, forwarding the message to the meeting node by the node; if not, continuing to judge whether the total average meeting duration of the meeting node and other nodes is larger than the total average meeting duration of the node and other nodes, and if so, forwarding the message to the meeting node by the node;
s4, deleting the successfully delivered message from the node cache by using an ACK deleting mechanism; in addition, when the node cache space is insufficient to receive the new message, deleting the message by combining the utility value of the message and the transmission hop count of the message in the network, and deleting the message with the minimum utility value of the message in the node cache space and the maximum transmission hop count in the network until the node cache space can receive the new message.
The utility value calculation method in step S2 is as follows:
message m i Utility value of (1) is based on the cache size of the node and message m i The utility value is used as a basis for deleting messages when the node cache space overflows, and the calculation formula is as follows:
wherein, the messageSize represents the message size, the bufferSize represents the current node buffer size, the messageremaininttl represents the message remaining lifetime, and the messageInitTTL represents the message initial lifetime. The node does not need to store the message utility value, and only calculates the message utility value when the message is deleted due to cache overflow, so that the problem that the node cache is occupied excessively due to the fact that each message utility value needs to be stored is avoided.
In step S3, the calculation formula of the total average meeting duration of the nodes in the message forwarding stage is as follows:
wherein meetTimeAll represents node v i The sum of the encounter durations with other nodes, meetCountAll, represents node v j Sum of the number of encounters with other nodes.
In summary, the invention discloses a message management method based on a message utility value and a node average meeting duration, which forwards a message according to the node average meeting duration, checks whether a node cache space can accommodate a new message when a node is ready to receive the newly arrived message, and deletes the message with a small message utility value from a node cache until the node cache space can accommodate the new message according to the message utility value if the node cache space is insufficient to receive the new message. The message management method makes the buffer space of the message more effectively utilized, has higher accuracy and faster speed in transmitting the message, reduces message transmission delay and improves message delivery rate. Compared with a probability routing algorithm (S-Prophet) based on node similarity and a delay tolerant and break tolerant network active congestion control (DARP) algorithm based on historical meeting probability, and a Prophet routing algorithm (BA-Prophet) taking cache into consideration in an opportunistic network, the algorithm has optimal performance in terms of delivery success rate and average delay.
Under the conditions that the simulation time is 12h, the message generation time interval is 75S, and the message life cycle is 30min, the buffer sizes are respectively set to be 2M, 5M, 10M, 15M and 25M, when the node buffer is 2MB, the delivery rate of the method is improved by about 43% compared with the delivery rate of the S-Prophet algorithm, is improved by about 71% compared with the delivery rate of the BA-Prophet algorithm, and is improved by about 110% compared with the delivery rate of the DARP-DO algorithm. When the node cache is 10MB, the delivery rate of the method is improved by about 20% compared with the delivery rate of the S-Prophet algorithm, is improved by about 43% compared with the delivery rate of the BA-Prophet algorithm, and is improved by about 81% compared with the delivery rate of the DARP-DO algorithm. With the increase of the buffer space, the message delivery rate of DARP-DO, BA-Prophet, S-Prophet and MS-Prophet algorithms is continuously increasing, and due to the increase of the buffer space, the number of portable messages is increased, so that the total message successful delivery rate is improved, but compared with other algorithms, when the node buffer is 10MB, the delivery rate of the method is close to 0.9, the delivery rate of the S-Prophet algorithm is about 0.73, and the delivery rates of the other two algorithms are lower than 0.7. In conclusion, the method has optimal performance in terms of delivery rate and average time delay.
It will be understood that modifications and variations will be apparent to those skilled in the art from the foregoing description, and it is intended that all such modifications and variations be included within the scope of the following claims.
Claims (3)
1. A message management method based on message utility value and average meeting duration of nodes is characterized in that in an opportunity network, messages in a node cache space are screened by a method based on the message utility value, and the average meeting of the nodes is continuously used as one of forwarding basis of the messages; the method comprises the following steps:
s1, counting the meeting times and the meeting duration time of each node and other nodes in the opportunistic network in a given time period;
s2, defining a message utility value according to the life cycle of the message, the residual life event of the message, the node cache space and the node residual cache space, and taking the message utility value as a basis for screening the message to be deleted in the node cache space;
s3, in the message forwarding stage, different message forwarding strategies are adopted according to the message delivery probability: judging whether the message delivery probability of the meeting node reaching the destination node is larger than the message delivery probability of the node reaching the destination node, if so, forwarding the message to the meeting node by the node; if not, continuing to judge whether the total average meeting duration of the meeting node and other nodes is larger than the total average meeting duration of the node and other nodes, and if so, forwarding the message to the meeting node by the node;
s4, deleting the successfully delivered message from the node cache by using an ACK deleting mechanism; in addition, when the node cache space is insufficient to receive the new message, deleting the message by combining the utility value of the message and the transmission hop count of the message in the network, deleting the message with the minimum utility value of the message in the node cache space and the maximum transmission hop count in the network until the node cache space can receive the new message.
2. The message management method based on the message utility value and the average meeting duration of the nodes according to claim 1, wherein the message utility value calculating method in step S2 is as follows:
message m i Utility value of (1) is based on the cache size of the node and message m i The effect of the message utility value is the basis for deleting the message when the node cache space overflows, and the calculation formula is as follows:
wherein, the messageSize represents the message size, the bufferSize represents the current node buffer size, the messageremaininttl represents the message remaining lifetime, and the messageInitTTL represents the message initial lifetime; the node does not need to store the message utility value, and can calculate the message utility value only when cache overflow occurs and the message needs to be deleted.
3. The message management method based on the message utility value and the node average encounter duration according to claim 1, wherein the total average encounter duration of the nodes in the message forwarding stage in step S3 is calculated as:
wherein meetTimeAll represents node v i The sum of the encounter durations with other nodes, meetCountAll, represents node v j Sum of the number of encounters with other nodes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110896499.9A CN113613292B (en) | 2021-08-05 | 2021-08-05 | Message management method based on message utility value and node average meeting duration |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110896499.9A CN113613292B (en) | 2021-08-05 | 2021-08-05 | Message management method based on message utility value and node average meeting duration |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113613292A CN113613292A (en) | 2021-11-05 |
| CN113613292B true CN113613292B (en) | 2023-05-30 |
Family
ID=78307106
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110896499.9A Active CN113613292B (en) | 2021-08-05 | 2021-08-05 | Message management method based on message utility value and node average meeting duration |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113613292B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115037797B (en) * | 2022-06-15 | 2023-05-23 | 华中师范大学 | Buffer memory management method based on message utility value |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104394236A (en) * | 2014-12-18 | 2015-03-04 | 重庆邮电大学 | Distributed cooperative caching method capable of realizing node and message state combined perception |
| CN111970200A (en) * | 2020-08-27 | 2020-11-20 | 华中师范大学 | Probability routing method based on utility value |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9535981B2 (en) * | 2013-07-15 | 2017-01-03 | Netapp, Inc. | Systems and methods for filtering low utility value messages from system logs |
-
2021
- 2021-08-05 CN CN202110896499.9A patent/CN113613292B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104394236A (en) * | 2014-12-18 | 2015-03-04 | 重庆邮电大学 | Distributed cooperative caching method capable of realizing node and message state combined perception |
| CN111970200A (en) * | 2020-08-27 | 2020-11-20 | 华中师范大学 | Probability routing method based on utility value |
Non-Patent Citations (1)
| Title |
|---|
| 基于运动相似性的机会网络缓存管理策略;张力;陈滢生;王言通;;计算机工程与设计(第08期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113613292A (en) | 2021-11-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108934002B (en) | Task unloading method based on D2D communication cooperation | |
| Sharma et al. | Optimal energy management policies for energy harvesting sensor nodes | |
| WO2020125454A1 (en) | Information processing method, system and apparatus | |
| CN111970200B (en) | Probability routing method based on utility value | |
| CN101695179B (en) | Method for forwarding messages on DTN or ICN network in way of self-adoption changeable probability | |
| CN113613292B (en) | Message management method based on message utility value and node average meeting duration | |
| CN106953803B (en) | Improved probability routing method based on deep space delay tolerant network | |
| US11368482B2 (en) | Threat detection system for mobile communication system, and global device and local device thereof | |
| CN107171957B (en) | Self-adaptive DTN routing algorithm based on resource limited condition | |
| Liu et al. | Mobility-aware coded-caching scheme for small cell network | |
| CN110536309B (en) | Mobile social network routing method based on node activity and energy factors | |
| Sadeghi et al. | Optimal dynamic proactive caching via reinforcement learning | |
| US20070275748A1 (en) | Adaptive power management methods and systems for wireless networks | |
| CN103338490B (en) | A kind of method of network data route and network node | |
| CN104994464A (en) | Mobile social network data forwarding method based on hierarchical community structure | |
| CN110809235B (en) | Terminal remote control method, system, device and medium based on 5G communication | |
| Jiaxin et al. | Resource-efficient routing protocol based on historical encounter time interval in DTN | |
| CN111629416A (en) | Message transmission method, system, terminal device and computer readable storage medium | |
| CN106879054B (en) | Wireless data transmission energy consumption optimization method | |
| Liu et al. | Priority-based hybrid protocol in wireless sensor networks | |
| CN104955075A (en) | DTN (Delay/Distribution Tolerant Network) buffer memory management system and method based on message sharding and node cooperation | |
| Soelistijanto | The efficiency-fairness trade-off of social-rank-based forwarding in social opportunistic networks | |
| CN110856147B (en) | Terminal connection method, system, device and medium based on 5G communication | |
| CN103346966B (en) | A kind of network data routing method and network node improving optimum forwarding probability | |
| CN111585898B (en) | Routing information increment transmission method facing wireless self-organizing network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |