CN111601376B - Message transmission method, system, terminal device and storage medium - Google Patents
Message transmission method, system, terminal device and storage medium Download PDFInfo
- Publication number
- CN111601376B CN111601376B CN202010397284.8A CN202010397284A CN111601376B CN 111601376 B CN111601376 B CN 111601376B CN 202010397284 A CN202010397284 A CN 202010397284A CN 111601376 B CN111601376 B CN 111601376B
- Authority
- CN
- China
- Prior art keywords
- node
- message
- links
- network
- nodes
- 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
- H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
- H04W52/04—TPC
- H04W52/30—TPC using constraints in the total amount of available transmission power
- H04W52/34—TPC management, i.e. sharing limited amount of power among users or channels or data types, e.g. cell loading
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
- H04W52/04—TPC
- H04W52/18—TPC being performed according to specific parameters
- H04W52/24—TPC being performed according to specific parameters using SIR [Signal to Interference Ratio] or other wireless path parameters
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
- H04W52/04—TPC
- H04W52/18—TPC being performed according to specific parameters
- H04W52/28—TPC being performed according to specific parameters using user profile, e.g. mobile speed, priority or network state, e.g. standby, idle or non transmission
- H04W52/283—Power depending on the position of the mobile
-
- 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 present disclosure provides a message transmission method, system, terminal device and storage medium, wherein the method comprises: respectively calculating the time delay of each node in the network for forwarding the message; and selecting the node with the shortest delay time from the calculation result as a message forwarding node, and transmitting the message based on the message forwarding node. The embodiment of the disclosure calculates the time delay of message forwarding of each node in the network, and selects the node with the shortest time delay as the message forwarding node, so that the network energy can be balanced at least while the message transmission efficiency is ensured.
Description
Technical Field
The present disclosure relates to the field of communications technologies, and in particular, to a message transmission method, a message transmission system, a terminal device, and a computer-readable storage medium.
Background
In the wireless self-organizing network, because the energy of the nodes in the network is limited, the problem about energy consumption becomes the biggest obstacle in the application development of the wireless self-organizing network, if the energy consumption of the nodes is too fast, the nodes die in advance, and the connectivity of the whole network is influenced; in the message transmission of the wireless ad hoc network, how to realize efficient transmission of the message has been a major research direction for those skilled in the art.
In the current message transmission scheme, in order to ensure the message forwarding efficiency, the message forwarding is mainly carried out by a flooding message transmission method, the core idea of the flooding message transmission method is that the message is forwarded to other nodes and message copies are kept by the nodes as long as the current node meets other nodes, although the message forwarding is carried out by the method, although the transmission efficiency is high, a large number of redundant message copies exist in the network, a large amount of node energy is consumed, and the connectivity of the whole network is influenced finally; there is also a related art that proposes an on-demand distance vector message transmission method, and the core idea of the method is to calculate the distance to the target network by using the hop count of message transmission, so that the network connectivity is good, but the method needs a long time for a large network to propagate routing information, which affects the transmission efficiency of the message. Therefore, no related technology can ensure efficient transmission of messages and ensure network connectivity at the same time.
The message transmission scheme in the related art either consumes a large amount of node energy or requires a long practical time to propagate routing information. Therefore, it is an urgent need to solve the problem to provide a scheme capable of improving the message transmission efficiency to the maximum extent and ensuring the network connectivity at the same time.
Disclosure of Invention
The present disclosure provides a message transmission method, system, terminal device, and storage medium to at least solve the above-mentioned problems.
According to an aspect of the embodiments of the present disclosure, there is provided a message transmission method, the method including:
respectively calculating the time delay of each node in the network for forwarding the message; and the number of the first and second groups,
and selecting the node with the shortest delay from the calculation results as a message forwarding node, and transmitting the message based on the message forwarding node.
In one embodiment, the separately calculating the delay of forwarding the message by each node in the network includes:
respectively calculating the residual energy ratio of each node in the network;
respectively determining the quality state among all node links in the network; and the number of the first and second groups,
and calculating the time delay of forwarding the message by each node based on the residual energy ratio of each node and the quality state between the links.
In one embodiment, after the remaining energy ratio of each node in the network is calculated separately, the method further includes:
based on the residual energy ratio of each node in the network, grading the residual energy of each node; and the number of the first and second groups,
distributing residual energy level values to all nodes subjected to residual energy grading;
after the quality states among the links of the nodes in the network are respectively determined, the method further comprises the following steps:
distributing a quality state value among links for each node based on the quality state among the links of each node in the network;
the method for calculating the time delay of forwarding the message by each node based on the residual energy ratio of each node and the quality state between the links specifically comprises the following steps:
and calculating the time delay of forwarding the message by each node based on the residual energy level value distributed to each node and the quality state value between the links distributed to each node.
In one embodiment, the separately determining the quality state between the links of the nodes in the network includes:
acquiring the distance between each current node and the neighbor node thereof and the distance between each node and the neighbor node thereof in the previous period;
comparing the distance between each current node and the neighbor node with the distance between each node and the neighbor node in the previous period; and the number of the first and second groups,
determining the quality state among the links of each node based on the comparison result of the distance between each current node and the neighbor node thereof being larger than the distance between each node and the neighbor node thereof in the previous period;
the allocating quality state values among links for each node based on quality states among links of each node in the network includes:
according to the quality state among all node links in the network, carrying out link state classification on each node; and the number of the first and second groups,
and allocating quality state values among links for each node passing through the link state hierarchy.
In one embodiment, the calculating the delay of forwarding the message by each node based on the remaining energy level value allocated to each node and the quality state value between links allocated to each node is performed according to the following formula:
t＝[ω×α×(1-E L ) 2 +(1-ω)×S t ]×T st
in the formula, t represents the time delay of the node for forwarding the message, omega represents the time delay proportionality coefficient, alpha represents the whole energy coefficient of the network, E L Representing the value of the remaining energy level allocated to the node, E s Representing the residual energy ratio of the nodes, E representing the current residual energy of the nodes, and E representing the initial energy of the nodes; s t Representing the quality state value, S, between the links allocated to the node i Representing the difference between the distance between the current node and its neighbor nodes and the distance between the node of the previous cycle and its neighbor nodes, T st Indicating the delay time of the link state.
According to another aspect of the embodiments of the present disclosure, there is provided a message transmission system including:
a calculation module configured to calculate a delay of forwarding a message by each node in a network, respectively; and the number of the first and second groups,
and the selection module is set to select the node with the shortest delay time from the calculation result as the message forwarding node and transmit the message based on the message forwarding node.
In one embodiment, the computing module includes:
a first calculation unit configured to calculate a remaining energy ratio of each node in the network, respectively;
a first determination unit configured to determine quality states between links of nodes in a network, respectively; and the number of the first and second groups,
and the second calculation unit is arranged to calculate the time delay of message forwarding of each node based on the residual energy ratio of each node and the quality state between links of each node.
In one embodiment, the computing module further comprises:
a first classification unit configured to classify the remaining energy of each node based on a remaining energy ratio of each node in the network;
a first allocation unit configured to allocate a residual energy level value to each node subjected to the residual energy ranking; and the number of the first and second groups,
a second allocation unit configured to allocate an inter-link quality status value to each node based on the quality status between links of the nodes in the network;
the second computing unit is specifically configured to:
and calculating the time delay of forwarding the message by each node based on the residual energy level value distributed to each node and the quality state value between the links distributed to each node.
In one embodiment, the first determining unit includes:
the acquisition subunit is configured to acquire the distance between each current node and its neighboring node, and the distance between each node in the previous period and its neighboring node;
the comparison subunit is set to compare the distance between each current node and the neighbor node thereof with the distance between each node and the neighbor node thereof in the previous period; and the number of the first and second groups,
a determining subunit configured to determine a quality state between links of the nodes based on a comparison result of a distance between each node and its neighboring node in a previous cycle being greater than a distance between each node and its neighboring node;
the second dispensing unit, comprising:
a classification subunit configured to classify the link state of each node according to the quality state between the links of each node; and the number of the first and second groups,
an allocation subunit arranged to allocate an inter-link quality state value to each node passing through each link state hierarchy.
In one embodiment, the second subunit is obtained according to the following formula:
t＝[ω×α×(1-E L ) 2 +(1-ω)×S t ]×T st
in the formula, t represents the time delay of the node for forwarding the message, omega represents the time delay proportionality coefficient, alpha represents the whole energy coefficient of the network, E L Representing the value of the remaining energy level allocated to the node, E s Representing the residual energy ratio of the nodes, E representing the current residual energy of the nodes, and E representing the initial energy of the nodes; s t Representing the quality state value, S, between the links allocated for the node i Representing the difference between the distance between the current node and its neighbor nodes and the distance between the node of the previous cycle and its neighbor nodes, T st Indicating the delay time of the link state.
According to still another aspect of the embodiments of the present disclosure, there is provided a terminal device including a memory and a processor, the memory having a computer program stored therein, and the processor executing the message transmission method when the processor executes the computer program stored in the memory.
According to still another aspect of the embodiments of the present disclosure, there is provided a computer-readable storage medium having a computer program stored thereon, wherein when the computer program is executed by a processor, the processor executes the message transmission method.
The technical scheme provided by the embodiment of the disclosure can have the following beneficial effects:
according to the message transmission method provided by the embodiment of the disclosure, the time delay of message forwarding of each node in the network is respectively calculated, then the node with the shortest time delay is selected from the calculation results to serve as the message forwarding node, and the message is transmitted based on the message forwarding node.
Additional features and advantages of the disclosure will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by the practice of the disclosure. The objectives and other advantages of the disclosure may be realized and attained by the structure particularly pointed out in the written description and claims hereof as well as the appended drawings.
Drawings
The accompanying drawings are included to provide a further understanding of the disclosed embodiments and are incorporated in and constitute a part of this specification, illustrate embodiments of the disclosure and together with the example serve to explain the principles of the disclosure and not to limit the disclosure.
Fig. 1 is a schematic flowchart of a message transmission method according to an embodiment of the present disclosure;
FIG. 2 is a schematic flowchart of step S101 in FIG. 1;
fig. 3 is a flowchart illustrating a message transmission method according to another embodiment of the disclosure;
FIG. 4 is a schematic flowchart of step S101b in FIG. 3;
fig. 5 is a schematic structural diagram of a message transmission apparatus according to an embodiment of the present disclosure;
FIG. 6 is a schematic structural diagram of the calculation module 51 in FIG. 5;
fig. 7 is a schematic structural diagram of a terminal device according to an embodiment of the present disclosure.
Detailed Description
To make the objects, technical solutions and advantages of the embodiments of the present disclosure more apparent, specific embodiments of the present disclosure are described below in detail with reference to the accompanying drawings. It should be understood that the detailed description and specific examples, while indicating the present disclosure, are given by way of illustration and explanation only, not limitation.
It should be noted that the terms "first," "second," and the like in the description and claims of the present disclosure and in the above-described drawings are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order; also, the embodiments and features of the embodiments in the present disclosure may be arbitrarily combined with each other without conflict.
In the following description, suffixes such as "module", "component", or "unit" used to denote elements are used only for the convenience of explanation of the present disclosure, and have no specific meaning in themselves. Thus, "module", "component" or "unit" may be used mixedly.
In order to solve the above problem, the embodiments of the present disclosure provide a message transmission method capable of guaranteeing message forwarding efficiency and guaranteeing energy balance in a network, which can guarantee network connectivity and simultaneously forward a message by using node energy classification and quality states between node links with the goal of balancing energy consumption of nodes in the network, and can maximally balance energy consumption in the network while guaranteeing message forwarding efficiency.
Referring to fig. 1, fig. 1 is a schematic flowchart illustrating a message transmission method according to an embodiment of the present disclosure, where the method includes steps S101-S102.
In step S101, the time delay for each node in the network to forward the message is calculated.
In the implementation, by calculating the time delay of forwarding the message by each node, specifically, the time delay of forwarding the message can be calculated based on the energy ratio of each node and the quality state between links, so as to solve the problem that in the related art, the message is forwarded to any meeting node in the network by a flooding message transmission method and message copies are reserved by the node, so that a large number of redundant message copies exist in the network, and a large amount of node energy is consumed; and the distance to the target network is calculated by using the hop number of message transmission through the on-demand distance vector message transmission method, so that the problems of overlong time for transmitting routing information, overlow message forwarding efficiency and the like are caused.
Specifically, in this embodiment, when message transmission is required, the time delay of message forwarding by each node in the network is calculated first, and the node with the shortest time delay is selected as the message forwarding node, so that the network energy can be balanced while the message transmission efficiency is ensured.
In step S102, a node with the shortest delay time is selected from the calculation results as a message forwarding node, and a message is transmitted based on the message forwarding node.
In the embodiment, by calculating the time delay of forwarding the message by each node in the network and selecting the node with the shortest time delay from the plurality of nodes as the message forwarding node, compared with the prior art, a large number of redundant message copies do not need to be generated at the message carrying node according to flooding transmission, so that the energy consumption of a large number of nodes is avoided, and meanwhile, the selected shortest time delay is used as the next hop message to be forwarded, so that the time delay of message transmission is reduced, and the transmission efficiency of the network message is maximized.
Further, as shown in fig. 2, the separately calculating the delay of forwarding the message by each node in the network (i.e., step S101) includes steps S101a-S101 c.
In step S101a, the remaining energy ratio of each node in the network is calculated;
in step S101b, quality states between links of nodes in the network are determined respectively; and (c) a second step of,
in step S101c, the delay time for forwarding the message by each node is calculated based on the remaining energy ratio of each node and the quality state between links thereof.
In this embodiment, the remaining energy ratio of the node is first calculated, and the delay of the node in forwarding the routing request is finally determined by combining the quality states between the links of the node, so that not only the network energy of the node is considered, but also the link state is considered as the node selection for the next hop routing transmission.
Specifically, the residual energy ratio of the node may be calculated according to the current residual energy of the node and the initial energy of the node, and may be used to represent the consumption speed of the node energy; the quality state between the node links may be analyzed according to the distance between the node and its neighboring node, which may be used to indicate the efficiency of data transmission when the node is grounded.
Referring to fig. 3, fig. 3 is a flowchart of a message transmission method provided in the embodiment of the present disclosure, in order to improve the selection efficiency of a message forwarding node and further improve the message transmission efficiency in a network, different from the previous embodiment, the present disclosure further ranks states of residual energy of nodes and quality of links, on the basis of the previous embodiment, step S101 is further divided into steps S101d-S101f, and specifically, after respectively calculating a residual energy ratio of each node in the network (step S101a), the method further includes:
in step S101d, ranking the remaining energy of each node based on the remaining energy ratio of each node in the network;
in step S101e, assigning a residual energy level value to each node passing through the residual energy hierarchy;
after the quality status among the links of the nodes in the network is respectively determined (i.e., step S101b), step S101f is also included.
In step S101f, based on the quality status between links of each node in the network, a quality status value between links is allocated to each node;
the delay of forwarding the message by each node is calculated based on the remaining energy ratio of each node and the quality state between the links (i.e., step S101c), specifically S101 c'.
In step S101 c', the delay time for forwarding the message by each node is calculated based on the remaining energy level value assigned to each node and the inter-link quality state value assigned to each node.
Further, the present embodiment determines the quality status between the node links by comparing the distances between the node and its neighboring nodes with the distances between the node and its node in the previous cycle, as shown in fig. 4, wherein the determining the quality status between the node links in the network (i.e., step S101b) includes S101b '-S101 b' ".
In step S101 b', obtaining the distance between each current node and its neighboring node, and the distance between each node and its neighboring node in the previous cycle;
in step S101b ″, the distance between each current node and its neighboring node is compared with the distance between each node and its neighboring node in the previous cycle; and the number of the first and second groups,
in step S101 b' ″, the quality status between the links of the nodes is determined based on the comparison result of the distance between the current node and its neighboring node being shorter than the distance between the node and its neighboring node in the previous cycle.
It can be understood that, in this embodiment, the neighbor node is an old neighbor node that has been added to the neighbor node list of the node, and before determining the link state between node links, it may first be determined whether the neighbor node monitored by the node is an old neighbor node that has been added to the neighbor node list or a new neighbor node that has not been added to the neighbor node list, and if the neighbor node is a new neighbor node that has not been added to the neighbor node list, the new neighbor node is added to the neighbor node list.
In this embodiment, for determining the quality state between node links, the determination is performed based on the position state of the node, and when the position state of the node is better than the previous period, it indicates that the quality state between node links is better, and if the position state of the node is worse than the previous period, it indicates that the quality state between node links is worse, and if the position state of the node is the same as the previous period, it indicates that the quality state is more stable. And grading the link states of the nodes according to the three states, specifically, when the neighbor nodes monitored by the nodes are old neighbor nodes and the old neighbor nodes are in the communication range of each other, judging the motion states of the two nodes by comparing the distance between the current distance of the two nodes and the distance between the two nodes when the current distance is larger than the distance when the current distance is compared in the previous round (namely the previous period), and when the distance between the nodes is reduced, judging the position state S according to the position state S t (i.e., the quality state value between links of the node in the following text) is set to-1; when the node distance is enlarged, the position state S is set t Is set to + 1; when the node distance is not changed, the position state S is set t Is set to 0.
Specifically, the allocating an inter-link quality state value to each node based on the quality state between links of each node (i.e., step S101f) includes:
according to the quality state among all node links in the network, carrying out link state classification on each node;
and allocating quality state values among links for each node passing through the link state hierarchy.
It should be noted that, link status classification is performed on the nodes to be detailed in the above scheme, and details are not described herein again.
Further, the time delay of forwarding the message by each node is calculated based on the residual energy level value allocated to each node and the quality state value between links allocated to each node, and is obtained according to the following formula:
t＝[ω×α×(1-E L ) 2 +(1-ω)×S t ]×T st
in the formula, t represents the time delay of the node for forwarding the message, omega represents the time delay proportionality coefficient, alpha represents the whole energy coefficient of the network, E L Representing the level of the remaining energy of the node, E s Representing the residual energy ratio of the nodes, E representing the current residual energy of the nodes, and E representing the initialization energy of the nodes; s t Indicating a quality state value, S, between links of a node i Representing the distance difference between a node and its neighboring nodes and the last cycle and its neighboring nodes, T st Indicating the delay time of the link state.
It should be noted that, the range of ω is a delay proportionality coefficient between 0 and 1, ω is to balance the node residual energy and link quality delay, the larger the value of ω is, the more the delay setting pays attention to the residual energy and ignores the link quality, α is a network overall energy coefficient, and takes the value as the ratio of the network average residual energy to the node initialization energy; delay time T of link state in the present embodiment st The system is known, the delay time of the link state of each node is the same, and the delay time T of the link state st Mainly related to network signal quality.
Based on the same technical concept, the present disclosure also provides a message transmission system, as shown in fig. 5, the system includes a calculating module 51 and a selecting module 52, wherein,
a calculation module 51 configured to calculate the time delay for forwarding the message by each node in the network; and the number of the first and second groups,
a selecting module 52 configured to select a node with the shortest delay time from the calculation result as a message forwarding node, and transmit a message based on the message forwarding node.
In one embodiment, as shown in fig. 6, the calculation module 51 includes:
a first calculation unit 511 configured to calculate a remaining energy ratio of each node in the network, respectively;
a first determining unit 512, configured to determine quality states between links of nodes in the network respectively; and the number of the first and second groups,
a second calculating unit 513 configured to calculate a delay time for forwarding the message by each node based on the remaining energy ratio of each node and the quality status between links thereof.
In one embodiment, the calculation module 51 further comprises:
a first classification unit configured to classify the remaining energy of each node based on a remaining energy ratio of each node in the network; and the number of the first and second groups,
a first allocation unit configured to allocate a residual energy level value to each node subjected to the residual energy ranking;
a second allocation unit configured to allocate an inter-link quality status value to each node based on the quality status between links of the nodes in the network;
the second calculating unit 513 is specifically configured to:
and calculating the time delay of forwarding the message by each node based on the residual energy level value distributed to each node and the quality state value between the links distributed to each node.
In one embodiment, the first determining unit 512 includes:
the acquisition subunit is configured to acquire the distance between each current node and its neighboring node, and the distance between each node in the previous period and its neighboring node;
the comparison subunit is set to compare the distance between each current node and the neighbor node thereof with the distance between each node and the neighbor node thereof in the previous period; and the number of the first and second groups,
a determining subunit configured to determine a quality state between links of the nodes based on a comparison result of a distance between each node and its neighboring node in a previous cycle being greater than a distance between each node and its neighboring node;
the second dispensing unit, comprising:
a classification subunit configured to classify the link state of each node according to the quality state between the links of each node;
an assigning subunit configured to assign an inter-link quality state value to each node passing through each link state hierarchy.
In one embodiment, the second subunit is obtained according to the following formula:
t＝[ω×α×(1-E L ) 2 +(1-ω)×S t ]×T st
in the formula, t represents the time delay of the node for forwarding the message, omega represents the time delay proportionality coefficient, alpha represents the whole energy coefficient of the network, E L Representing the value of the remaining energy level allocated to the node, E s Representing the residual energy ratio of the nodes, E representing the current residual energy of the nodes, and E representing the initial energy of the nodes; s t Representing the quality state value, S, between the links allocated to the node i Representing the difference between the distance between the current node and its neighbor nodes and the distance between the node of the previous cycle and its neighbor nodes, T st Indicating the delay time of the link state.
It should be noted that, the principle of each module of the message transmission system provided in this embodiment for executing each step of the foregoing method embodiments is already described in detail in the foregoing embodiment, and is not described here again.
Based on the same technical concept, the embodiment of the present disclosure correspondingly provides a terminal device, as shown in fig. 7, the terminal device includes a memory 71 and a processor 72, the memory 71 stores a computer program, and when the processor 72 runs the computer program stored in the memory 71, the processor 72 executes the message transmission method.
Based on the same technical concept, embodiments of the present disclosure correspondingly provide a computer-readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, the processor executes the message transmission method.
To sum up, the message transmission method, the message transmission system, the terminal device, and the storage medium provided by the embodiments of the present disclosure respectively calculate the time delay of forwarding a message by each node in a network, then select a node with the shortest time delay from the calculation results as a message forwarding node, and transmit a message based on the message forwarding node. Compared with the message transmission scheme in the related technology, the method can balance network energy at least while ensuring message transmission efficiency; furthermore, by utilizing the node energy classification and the quality state among node links to calculate the time delay of the nodes in the network, the network connectivity can be ensured, and the message transmission efficiency can be maximized.
It will be understood by those of ordinary skill in the art that all or some of the steps of the methods, systems, functional modules/units in the devices disclosed above may be implemented as software, firmware, hardware, and suitable combinations thereof. In a hardware implementation, the division between functional modules/units mentioned in the above description does not necessarily correspond to the division of physical components; for example, one physical component may have multiple functions, or one function or step may be performed by several physical components in cooperation. Some or all of the physical components may be implemented as software executed by a processor, such as a central processing unit, digital signal processor, or microprocessor, or as hardware, or as an integrated circuit, such as an application specific integrated circuit. Such software may be distributed on computer readable media, which may include computer storage media (or non-transitory media) and communication media (or transitory media). The term computer storage media includes volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data, as is well known to those of ordinary skill in the art. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, Digital Versatile Disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can accessed by a computer. In addition, communication media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media as known to those skilled in the art.
Finally, it should be noted that: the above embodiments are only used for illustrating the technical solutions of the present disclosure, and not for limiting the same; while the present disclosure has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art will understand that: the technical solutions described in the foregoing embodiments may still be modified, or some or all of the technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present disclosure.
Claims (6)
1. A method for message transmission, comprising:
respectively calculating the residual energy ratio of each node in the network;
based on the residual energy ratio of each node in the network, carrying out residual energy grading on each node;
distributing residual energy level values to all nodes subjected to residual energy grading;
respectively determining the quality state among links of each node in the network;
distributing quality state values among links for each node based on the quality states among the links of each node in the network;
calculating the time delay of forwarding the message by each node based on the residual energy level value distributed for each node and the quality state value between the links distributed for each node; and the number of the first and second groups,
selecting the node with the shortest delay from the calculation results as a message forwarding node, and transmitting the message based on the message forwarding node;
wherein, the delay of forwarding the message by each node is calculated based on the residual energy level value allocated to each node and the quality state value between the links allocated to each node, and is obtained according to the following formula:
t＝[ω×α×(1-E L ) 2 +(1-ω)×S t ]×T st
in the formula, t represents the time delay of the node for forwarding the message, omega represents the time delay proportionality coefficient, alpha represents the whole energy coefficient of the network, E L Representing the value of the assigned residual energy level for the node, E s Representing the residual energy ratio of the nodes, E representing the current residual energy of the nodes, and E representing the initial energy of the nodes; s t Representing the quality state value, S, between the links allocated to the node i Representing the difference between the distance between the current node and its neighbor nodes and the distance between the node of the previous cycle and its neighbor nodes, T st Indicating the delay time of the link state.
2. The method of claim 1, wherein the separately determining the quality status between the links of the nodes in the network comprises:
acquiring the distance between each current node and the neighbor node thereof and the distance between each node and the neighbor node thereof in the previous period;
comparing the distance between each current node and the neighbor node with the distance between each node and the neighbor node in the previous period; and the number of the first and second groups,
determining the quality state among the links of each node based on the comparison result of the distance between each current node and the neighbor node thereof being larger than the distance between each node and the neighbor node thereof in the previous period;
the allocating quality state values among links for each node based on quality states among links of each node in the network includes:
according to the quality state among links of each node in the network, carrying out link state classification on each node; and the number of the first and second groups,
and allocating quality state values among the links for each node passing through the link state hierarchy.
3. A message transmission system, comprising:
the calculation module specifically comprises:
a first calculation unit configured to calculate a remaining energy ratio of each node in the network, respectively;
a first grading unit configured to grade the residual energy of each node based on the residual energy ratio of each node in the network;
a first allocation unit configured to allocate a residual energy level value to each node subjected to the residual energy ranking;
a first determination unit configured to determine quality states between links of nodes in a network, respectively;
a second allocating unit configured to allocate an inter-link quality status value to each node based on the quality status between links of the nodes in the network;
a second calculation unit configured to calculate a delay time for forwarding the message by each node based on the remaining energy level value allocated to each node and the inter-link quality state value allocated to each node; and (c) a second step of,
the selection module is set to select the node with the shortest delay time from the calculation result as a message forwarding node and transmit the message based on the message forwarding node;
wherein the second calculating unit is obtained according to the following formula:
t＝[ω×α×(1-E L ) 2 +(1-ω)×S t ]×T st
in the formula, t represents the time delay of the node for forwarding the message, omega represents the time delay proportionality coefficient, alpha represents the whole energy coefficient of the network, E L Representing the value of the remaining energy level allocated to the node, E s Representing the residual energy ratio of the nodes, E representing the current residual energy of the nodes, and E representing the initial energy of the nodes; s t Representing the quality state value, S, between the links allocated to the node i Representing the difference between the distance between the current node and its neighbor nodes and the distance between the node of the previous cycle and its neighbor nodes, T st Indicating the delay time of the link state.
4. The system of claim 3, wherein the first determining unit comprises:
the acquisition subunit is set to acquire the distance between each current node and the neighbor node thereof and the distance between each node and the neighbor node thereof in the previous period;
the comparison subunit is set to compare the distance between each current node and the neighbor node thereof with the distance between each node and the neighbor node thereof in the previous period; and the number of the first and second groups,
a determining subunit configured to determine a quality state between links of the nodes based on a comparison result of a distance between each node and its neighboring node in a previous cycle being greater than a distance between each node and its neighboring node;
the second distribution unit includes:
a classification subunit configured to classify the link state of each node according to the quality state between the links of each node; and the number of the first and second groups,
an assigning subunit configured to assign an inter-link quality state value to each node passing through each link state hierarchy.
5. A terminal device characterized by comprising a memory and a processor, the memory having stored therein a computer program, the processor executing the message transmission method according to claim 1 or 2 when the processor runs the computer program stored in the memory.
6. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the message transmission method according to claim 1 or 2.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010397284.8A CN111601376B (en) | 2020-05-12 | 2020-05-12 | Message transmission method, system, terminal device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010397284.8A CN111601376B (en) | 2020-05-12 | 2020-05-12 | Message transmission method, system, terminal device and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111601376A CN111601376A (en) | 2020-08-28 |
| CN111601376B true CN111601376B (en) | 2022-09-02 |
Family
ID=72191238
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010397284.8A Active CN111601376B (en) | 2020-05-12 | 2020-05-12 | Message transmission method, system, terminal device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111601376B (en) |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102026331A (en) * | 2010-12-23 | 2011-04-20 | 重庆邮电大学 | Distributed multi-jump energy-saving communication method in wireless sensor network |
| CN102348250A (en) * | 2010-07-29 | 2012-02-08 | 华为技术有限公司 | Routing method and node device of delay tolerant network |
| CN102740365A (en) * | 2012-06-28 | 2012-10-17 | 东南大学 | Single-stream bulk data acquisition method suitable for wireless sensor network |
| CN102883398A (en) * | 2012-09-18 | 2013-01-16 | 中国科学院上海微***与信息技术研究所 | Low-delay balanced energy consumption routing method for wireless sensing network |
| CN103945483A (en) * | 2014-02-25 | 2014-07-23 | 重庆邮电大学 | Opportunity-network full-coverage low-time-delay routing method based on message ferry |
| CN105357731A (en) * | 2015-10-14 | 2016-02-24 | 国网辽宁省电力有限公司营口供电公司 | Energy-efficient wireless sensor network (WSN) routing protocol design method for use in electromagnetic interference environment |
| CN105744583A (en) * | 2016-02-22 | 2016-07-06 | 暨南大学 | Dynamic power control method in low-duty-cycle sensor network |
| CN106412997A (en) * | 2016-10-21 | 2017-02-15 | 东南大学—无锡集成电路技术研究所 | Implementation method for asynchronous sensor oriented hopcount reduced broadcasting with multiple metrics (HR-MM) broadcasting protocol |
| JP2018170750A (en) * | 2017-03-30 | 2018-11-01 | Kddi株式会社 | Radio communication network system, wireless node, route selection method, and computer program |
| CN110177351A (en) * | 2019-05-28 | 2019-08-27 | 中南大学 | A kind of efficient data transfer method for low duty ratio wireless sensor network |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20150016458A (en) * | 2013-08-02 | 2015-02-12 | 한국전자통신연구원 | Method and apparatus for transmission scheduling in wireless sensor network |
-
2020
- 2020-05-12 CN CN202010397284.8A patent/CN111601376B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102348250A (en) * | 2010-07-29 | 2012-02-08 | 华为技术有限公司 | Routing method and node device of delay tolerant network |
| CN102026331A (en) * | 2010-12-23 | 2011-04-20 | 重庆邮电大学 | Distributed multi-jump energy-saving communication method in wireless sensor network |
| CN102740365A (en) * | 2012-06-28 | 2012-10-17 | 东南大学 | Single-stream bulk data acquisition method suitable for wireless sensor network |
| CN102883398A (en) * | 2012-09-18 | 2013-01-16 | 中国科学院上海微***与信息技术研究所 | Low-delay balanced energy consumption routing method for wireless sensing network |
| CN103945483A (en) * | 2014-02-25 | 2014-07-23 | 重庆邮电大学 | Opportunity-network full-coverage low-time-delay routing method based on message ferry |
| CN105357731A (en) * | 2015-10-14 | 2016-02-24 | 国网辽宁省电力有限公司营口供电公司 | Energy-efficient wireless sensor network (WSN) routing protocol design method for use in electromagnetic interference environment |
| CN105744583A (en) * | 2016-02-22 | 2016-07-06 | 暨南大学 | Dynamic power control method in low-duty-cycle sensor network |
| CN106412997A (en) * | 2016-10-21 | 2017-02-15 | 东南大学—无锡集成电路技术研究所 | Implementation method for asynchronous sensor oriented hopcount reduced broadcasting with multiple metrics (HR-MM) broadcasting protocol |
| JP2018170750A (en) * | 2017-03-30 | 2018-11-01 | Kddi株式会社 | Radio communication network system, wireless node, route selection method, and computer program |
| CN110177351A (en) * | 2019-05-28 | 2019-08-27 | 中南大学 | A kind of efficient data transfer method for low duty ratio wireless sensor network |
Non-Patent Citations (1)
| Title |
|---|
| 基于能量和链路状态的AODV路由请求转发机制研究;郝聚涛等;《计算机科学》;20090715(第07期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111601376A (en) | 2020-08-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112738820B (en) | Dynamic deployment method and device of service function chain and computer equipment | |
| US7839840B2 (en) | Method and system for routing traffic in a communication network | |
| Alicherry et al. | Network aware resource allocation in distributed clouds | |
| CN110247793B (en) | Application program deployment method in mobile edge cloud | |
| CN109451540B (en) | Resource allocation method and equipment for network slices | |
| CN113784373B (en) | Combined optimization method and system for time delay and frequency spectrum occupation in cloud edge cooperative network | |
| US7760665B2 (en) | Selective node tracking | |
| CN111182037B (en) | Mapping method and device of virtual network | |
| CN111835564B (en) | Self-adaptive recovery method and system for power Internet of things communication link fault | |
| CN111836370B (en) | Resource reservation method and equipment based on competition | |
| CN110958133B (en) | Network slice mapping method, device, server and storage medium | |
| CN111010627B (en) | Route distribution method and device applied to mixed grid optical network | |
| CN113132827B (en) | Modulation adaptive route calculation method and device under elastic optical network | |
| CN107113323B (en) | Data storage method, device and system | |
| CN111601376B (en) | Message transmission method, system, terminal device and storage medium | |
| CN113098716A (en) | Efficient father node selection method in dual-mode mesh network | |
| KR20170014804A (en) | Virtual machine provisioning system and method for cloud service | |
| CN114614899B (en) | Data center virtual optical network mapping method and device and electronic equipment | |
| CN112751768A (en) | Service message forwarding method, device and computer storage medium | |
| KR100780794B1 (en) | Routing method for transmitting data packet on zigbee network and recording medium thereof | |
| CN114938327A (en) | Routing method, routing device, controller and computer readable storage medium | |
| CN111343281B (en) | Data transmission method, device, terminal equipment and storage medium | |
| KR102134182B1 (en) | Metohd and apparatus for centralized link based scheduling to supporrt directional transmission in wireless mesh network | |
| CN111615165A (en) | Data transmission method, system, terminal device and computer readable storage medium | |
| CN113630792B (en) | Traffic load balancing breadth-first search optimization method, system and equipment |
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 |