CN114585043B - Routing method, device, computer equipment and storage medium - Google Patents
Routing method, device, computer equipment and storage medium Download PDFInfo
- Publication number
- CN114585043B CN114585043B CN202210301085.1A CN202210301085A CN114585043B CN 114585043 B CN114585043 B CN 114585043B CN 202210301085 A CN202210301085 A CN 202210301085A CN 114585043 B CN114585043 B CN 114585043B
- Authority
- CN
- China
- Prior art keywords
- time slot
- routing
- target
- transmission
- network
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
- H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/32—Connectivity information management, e.g. connectivity discovery or connectivity update for defining a routing cluster membership
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0446—Resources in time domain, e.g. slots or frames
-
- 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
Abstract
The invention provides a routing method, a routing device, a computer device and a storage medium, wherein the routing method comprises the following steps: acquiring transmission requirements of all wireless sensor nodes in a target network model; generating a first routing link set and a second routing link set according to the transmission requirements of all wireless sensor nodes; generating a first time slot constraint of each wireless sensor in a sensor network transmission stage according to the first routing link set, and generating a second time slot constraint of each data stream in a wireless mesh network transmission stage according to the second routing link set; and according to the first time slot constraint and the second time slot constraint, calculating a first target allocation time slot and a second target allocation time slot. The invention solves the problem of energy efficiency of the sensor in the integrated network without consideration of the number and energy in the prior art, and improves the survival time of the sensor while guaranteeing the communication service quality of the network, thereby improving the data energy transmission performance of the network.
Description
Technical Field
The present invention relates to the field of routing technologies, and in particular, to a routing method, a device, a computer device, and a storage medium.
Background
The energy collection (Energy Harvesting, EH) technology has great development prospect because it can provide stable energy for energy-limited networks such as wireless sensor networks and extend network life cycle. The energy sources of the energy collection technology not only include most natural energy sources of the surrounding environment, such as solar energy, light energy, wind energy, heat energy, chemical energy, etc., but also can convert received surrounding wireless signals into electric energy, such as manually acquired Radio Frequency (RF) signals. Whereas RF signal based energy harvesting is a research hotspot because it can be immune to weather conditions and provide stable energy.
With the rapid development of wireless network technology and the rapid increase in the number of mobile devices, user Equipment (UEs), such as cell phones and wearable devices, generate tremendous amounts of data. How to wirelessly power these devices becomes a challenging problem. Wireless energy transfer (Wireless Energy Transfer, WET) technology can collect external RF signals and convert them to Direct Current (DC) circuits for wireless information transfer (Wireless Information Transfer, WIT) through circuit design, thereby addressing some energy bottleneck problems of energy limited and unstable networks. The digital energy integrated communication network (Data and energy integrated communication networks, DEINs) is a novel network capable of realizing the cooperative transmission of data and energy. In the digital-energy integrated network, energy and data can be transmitted simultaneously, and information transmission can be carried out by transmitting energy signals to provide energy for energy-limited equipment, so that the service life of the network is prolonged. In a typical multi-user integrated network, the base station provides power to the users via downlink WET, and the users perform uplink WET via the power.
The energy transmission is added on the basis of the information transmission by the digital-energy integrated network, which means that under the condition that the original resources are fixed, the information transmission needs to be subjected to partial resource yielding for the energy transmission, and in the wireless sensor network, which is a typical energy-limited network, the sensor is powered by a battery, and the routing algorithm needs to take the energy efficiency into account. However, the conventional routing method of the wireless communication network does not consider the energy efficiency of the sensor, and cannot be applied to the digital-energy integrated network; therefore, it is necessary to develop a routing method applicable to a network based on digital energy integration.
Disclosure of Invention
Aiming at the defects in the prior art, the routing method, the routing device, the computer equipment and the storage medium provided by the invention solve the problem that the energy efficiency of the sensor in the digital-energy integrated network is not considered in the prior art, and improve the survival time of the sensor while guaranteeing the communication service quality of the network, thereby improving the data energy transmission performance of the network.
In a first aspect, the present invention provides a routing method, the method comprising: acquiring transmission requirements of all wireless sensor nodes in a target network model, wherein the target network model comprises a wireless mesh network, a wireless sensor network and sink nodes; generating a first routing link set from each wireless sensor to the wireless mesh network and a second routing link set from the source node to the sink node for each data flow in the wireless mesh network according to the transmission requirements of all wireless sensor nodes; generating a first time slot constraint of each wireless sensor in a sensor network transmission stage according to the first routing link set, and generating a second time slot constraint of each data stream in a wireless mesh network transmission stage according to the second routing link set; according to the first time slot constraint and the second time slot constraint, a first target allocation time slot and a second target allocation time slot are calculated, and the first routing link set and the second routing link set are combined with the first target allocation time slot and the second target allocation time slot respectively, so that a current optimal routing scheme is obtained.
Optionally, before acquiring the transmission requirements of all wireless sensor nodes in the target network model, the method further comprises: constructing an initial network model with integration of digital energy; and determining the transmission rule of the initial network model to obtain a target network model.
Optionally, the first routing link set is represented by a matrix: a= |l|x M S The second set of routing links
Expressed as a matrix: b= |l|x M R The method comprises the steps of carrying out a first treatment on the surface of the Where L represents the number of all viable links, M S Representing the number of sets of feasible routing links, M R Representing the number of viable routing link sets.
Optionally, the formula of the first time slot constraint is:
wherein A is k Indicating that the kth link is to be used,the time slot of the kth link is represented, ds represents the transmission time length of the kth link, and Ts represents the total time length of all time slots;
the formula expression of the second time slot constraint is:
wherein, the liquid crystal display device comprises a liquid crystal display device,representing a data stream f l Transmission duration of->Time slot representing the kth link, T R Representing the total duration of all time slots in the transmission phase of the routed network.
Optionally, according to the first time slot constraint and the second time slot constraint, calculating a first target allocation time slot and a second target allocation time slot includes: acquiring a target sensor node with the least current energy in a target network model; generating a target optimization function according to the current energy of the target sensor node, the first time slot constraint and the second time slot constraint; and solving the target optimization function to obtain the first target allocation time slot and the second target allocation time slot.
Optionally, the formula expression of the objective optimization function is:
wherein, the liquid crystal display device comprises a liquid crystal display device,and->Is combined into->
Optionally, the formula for calculating the current energy of the wireless sensor node is:
wherein, the liquid crystal display device comprises a liquid crystal display device,representative node s i Is>Representing the remaining energy of the node after having undergone a previous superframe transmission,/for>Representing the energy harvested by the node in the superframe of the present round,/for each of the two sub-frames>Representing the energy consumed by the node in the superframe of the present round, wherein the energy harvested by the node +.>Can be expressed as:
wherein, the liquid crystal display device comprises a liquid crystal display device,representing a sensor node s j Routing node set capable of obtaining energy through energy harvesting radio frequency signals, beta represents conversion efficiency of energy harvesting, and h ij Representing channel parameters between nodes, < >>Representing a routing node r i Is set to the transmission power of (a);
the energy consumption of the sensor node is as follows:
wherein, the liquid crystal display device comprises a liquid crystal display device,representing the energy consumption of the communication>Energy consumption representing sensing and computation, +.>The formula expression of (2) is:
wherein, the liquid crystal display device comprises a liquid crystal display device,and->The transmit power and the receive power of the sensor node are represented, respectively.
In a second aspect, the present invention provides a routing device, the device comprising: the system comprises a transmission demand acquisition module, a transmission demand acquisition module and a transmission demand acquisition module, wherein the transmission demand acquisition module is used for acquiring transmission demands of all wireless sensor nodes in a target network model, and the target network model comprises a wireless mesh network, a wireless sensor network and sink nodes; the link set generating module is used for generating a first route link set from each wireless sensor to the wireless mesh network and a second route link set from the source node to the sink node for each data flow in the wireless mesh network according to the transmission requirements of all wireless sensor nodes; the time slot constraint generation module is used for generating a first time slot constraint of each wireless sensor in a sensor network transmission stage according to the first routing link set and generating a second time slot constraint of each data stream in a wireless mesh network transmission stage according to the second routing link set; and the target allocation time slot resolving module is used for resolving a first target allocation time slot and a second target allocation time slot according to the first time slot constraint and the second time slot constraint, so that the first routing link set and the second routing link set are respectively combined with the first target allocation time slot and the second target allocation time slot to obtain a current optimal routing scheme.
In a third aspect, the present invention provides a computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the following steps when executing the computer program: acquiring transmission requirements of all wireless sensor nodes in a target network model, wherein the target network model comprises a wireless mesh network, a wireless sensor network and sink nodes; generating a first routing link set from each wireless sensor to the wireless mesh network and a second routing link set from the source node to the sink node for each data flow in the wireless mesh network according to the transmission requirements of all wireless sensor nodes; generating a first time slot constraint of each wireless sensor in a sensor network transmission stage according to the first routing link set, and generating a second time slot constraint of each data stream in a wireless mesh network transmission stage according to the second routing link set; according to the first time slot constraint and the second time slot constraint, a first target allocation time slot and a second target allocation time slot are calculated, and the first routing link set and the second routing link set are combined with the first target allocation time slot and the second target allocation time slot respectively, so that a current optimal routing scheme is obtained.
In a fourth aspect, the present invention provides a readable storage medium having stored thereon a computer program which when executed by a processor performs the steps of: acquiring transmission requirements of all wireless sensor nodes in a target network model, wherein the target network model comprises a wireless mesh network, a wireless sensor network and sink nodes; generating a first routing link set from each wireless sensor to the wireless mesh network and a second routing link set from the source node to the sink node for each data flow in the wireless mesh network according to the transmission requirements of all wireless sensor nodes; generating a first time slot constraint of each wireless sensor in a sensor network transmission stage according to the first routing link set, and generating a second time slot constraint of each data stream in a wireless mesh network transmission stage according to the second routing link set; according to the first time slot constraint and the second time slot constraint, a first target allocation time slot and a second target allocation time slot are calculated, and the first routing link set and the second routing link set are combined with the first target allocation time slot and the second target allocation time slot respectively, so that a current optimal routing scheme is obtained.
Compared with the prior art, the invention has the following beneficial effects:
generating route link sets of different levels according to the transmission requirements of all wireless sensor nodes in a target network model, then carrying out optimal time slot resource allocation according to time slot constraint in the current route link set, and then combining the route link set with the optimal time slot resource to obtain a current optimal route selection scheme; the invention uses the mode of simultaneous transmission of the data during the route selection, can controllably improve the energy performance of the sensor node, and combines the route selection, the transmission set generation and the time slot allocation of the optimized network by researching the data-energy route combination algorithm in the two-layer energy integrated network combined by the wireless mesh network and the wireless sensor network, thereby improving the survival time of the sensor while ensuring the communication service quality of the network and improving the data energy transmission performance of the network.
Drawings
Fig. 1 is a schematic flow chart of a routing method according to an embodiment of the present invention;
fig. 2 is a schematic diagram of a system model of a frame based on a two-layer energy integrated network according to an embodiment of the present invention;
fig. 3 is a schematic flowchart of step S104 in fig. 1 according to an embodiment of the present invention;
fig. 4 is a flow chart of another routing method according to an embodiment of the present invention;
fig. 5 is a schematic structural diagram of a routing device according to an embodiment of the present invention.
Detailed Description
For the purposes of making the objects, technical solutions and advantages of the embodiments of the present application more clear, the technical solutions of the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is apparent that the described embodiments are some embodiments of the present application, but not all embodiments. All other embodiments, which can be made by one of ordinary skill in the art without undue burden from the present disclosure, are within the scope of the present application based on the embodiments herein.
In a first aspect, the present invention provides a routing method, which specifically includes the following embodiments:
fig. 1 is a schematic flow chart of a routing method according to an embodiment of the present invention, and as shown in fig. 1, the routing method specifically includes the following steps:
step S101, obtaining transmission requirements of all wireless sensor nodes in a target network model.
In this embodiment, before acquiring the transmission requirements of all the wireless sensor nodes in the target network model, the method further includes: constructing an initial network model with integration of digital energy; and determining the transmission rule of the initial network model to obtain a target network model.
In this embodiment, the target network model includes a wireless mesh network, a wireless sensor network, and a sink node.
It should be noted that the initial network model with integrated digital function constructed in this embodiment is divided into two layers, as shown in fig. 2, and each layer includes K R Wireless mesh network (Wireless Mesh Network) of routing nodes and K-inclusive S Wireless sensor networks (Wireless Sensor Networks, WSNs) of individual sensor nodes, and optionally one routing node as a sink node, data of all sensor nodes being transferred to the sink node through the wireless mesh network, and the sink node also transferring control commands to the sensor nodes through the wireless mesh network. The whole network is represented by graph G (N, L), where n=n R ∪N S Representing a set of routing and sensor nodes, l=l R ∪L S Representing the set of links between the routing nodes and the links between the sensor and its nearest routing node. Nodes are all singleThe antenna equipment is provided with a stable power supply for the routing node, the sensor node is provided with a small rechargeable battery, and the energy carried by the radio frequency signals sent by the nodes in a certain range can be acquired through energy collection.
Further, defining transmission rules of two types of nodes and data flow characteristics in the network for the initial network model, so as to obtain a target network model. The routing nodes can communicate with each other with the routing nodes in the communication range, the sensor nodes only communicate with the nearest routing nodes in the communication range, and the routing network transmits the data stream to the sink nodes. The data flow in the network is not newly generated or dead in the transferring process, and the data flow can be generated or destroyed only by the source node serving as a sender and the target node serving as a receiver in the network, and the node responsible for forwarding in each data flow does not influence the data flow.
In this embodiment, the superframe format is defined according to the system characteristics of the target network model, and the superframe is divided into three phases:
the first stage is a control command transmission stage: firstly, the routing node wakes up surrounding sensor nodes at this stage by sending beacon frames, the network gathers and acquires the transmission demands of all the sensor nodes, and at this stage, the routing path selection and resource allocation in the subsequent algorithm are performed by using the collected information.
The second stage is a sensor network transmission stage: at this stage, the sensor node information with transmission requirement is transmitted to the nearest routing node, and the routing node gathers the sensor node information to the sink node through the wireless mesh network, and simultaneously replies corresponding control command from the sink node.
The third phase is a wireless mesh network transmission phase: the transmission between the routing nodes, namely the data flow in the wireless mesh network, is carried out at this stage, and the life time of the sensor nodes in the network is improved through routing and time slot allocation on the basis of ensuring the network service quality at this stage.
Step S102, according to the transmission requirements of all wireless sensor nodes, a first route link set from each wireless sensor to the wireless mesh network and a second route link set from the source node to the sink node of each data flow in the wireless mesh network are generated.
In this embodiment, in the transmission stage of the sensor network, the sensor nodes with transmission requirements communicate with the sink node through the wireless mesh network, and a shortest path algorithm Dijkstra is used to generate a first set of routing links from each sensor to the sink node. The Dijkstra algorithm is mainly characterized in that a greedy algorithm strategy is adopted from a starting point, and every time the algorithm traverses to the adjacent node of the vertex which is nearest to the starting point and is not visited until the algorithm extends to a finishing point. The dimension for the first routing link set is |L||M S Is represented by matrix a of (1), where L represents the number of all viable links, M S Representing the number of viable routing link sets. Each element in matrix a being either a 0 or a 1 represents whether the link is active in the set of routing links, respectively.
During the transmission phase of the wireless mesh network, data flows in the wireless mesh network can be communicated in routing nodes, at the moment, all nodes in the graph are systematically unfolded and checked by using a breadth-first algorithm, and all routing link sets with hop counts smaller than a fixed value are searched for to generate a second routing link set of which each data flow from a source node to a destination node meets the condition. The limitation on the hop count of the routing link is to reduce the end-to-end delay in the network service and improve the network service quality. The dimension for second routing link aggregation is |L|| times M R Matrix B of (C) represents a similar M R Representing the number of viable routing link sets. Each element in matrix B being either a 0 or a 1 represents whether the link is active in the set of routing links, respectively. It should be noted that B of B j Is a mapping of f.epsilon.F. Stream f may correspond to one or more columns of B, which are assembled fromAnd (3) representing. F (B) j ) Representation B j Whether or not it is f i Is mapped to the mapping of (a).
Step S103, according to the first route link set, generating a first time slot constraint of each wireless sensor in a sensor network transmission stage, and according to the second route link set, generating a second time slot constraint of each data stream in a wireless mesh network transmission stage.
For the sensor network transmission stage, the time allocated to each route link set in the stage is firstThe following first slot constraint needs to be satisfied:
wherein A is k Representing the kth link in the wireless sensor network,the time slot of the kth link in the wireless sensor network is represented, ds represents the transmission time length of the kth link in the wireless sensor network, and Ts represents the total time length of all time slots in the transmission stage of the sensor network; for each sensor node, only one transmission link set is generated between the sensor node and the sink node, so that only the link set A is needed k Time slot->Meet the transmission requirement D of the sensor node S And (3) obtaining the product. At the same time, for the transmission stage of the sensor network, the total time length of all time slot allocation cannot exceed T S Is limited by the number of (a).
In this embodiment, the wireless mesh network transmission phase is a phase in which the routing nodes communicate with each other according to the target network model. At this stage, since there is no information transfer between the routing node and the sensor node, for this stage the first data flow f l The following second slot constraints need to be satisfied:
wherein, the liquid crystal display device comprises a liquid crystal display device,representing a data stream f l Transmission duration of->Time slot representing kth link in wireless mesh network, B m Representing the mth link in a wireless mesh network, < >>Time slot, T, representing the mth link in a wireless mesh network R Representing the total duration of all time slots in the transmission phase of the routing network; />For data stream f l Transmission requirements of (i.e. corresponding to f) l Is set of transmissions of (a)The sum of the assigned time slots needs to be greater than or equal to its transmission requirement, otherwise stream f cannot be guaranteed in that time slot l The link channel throughput in the corresponding transmission set meets the requirements. At the same time, for the transmission stage of the routing network, the total time length of all time slot allocation cannot exceed T R Is limited by the number of (a).
Step S104, according to the first time slot constraint and the second time slot constraint, a first target allocation time slot and a second target allocation time slot are calculated, so that the first routing link set and the second routing link set are respectively combined with the first target allocation time slot and the second target allocation time slot, and a current optimal routing scheme is obtained.
In this embodiment, as shown in fig. 3, according to the first time slot constraint and the second time slot constraint, the calculating the first target allocation time slot and the second target allocation time slot specifically includes the following steps:
step S201, obtaining a target sensor node with the least current energy in a target network model;
step S202, generating a target optimization function according to the current energy of the target sensor node, the first time slot constraint and the second time slot constraint;
step S203, calculating the objective optimization function to obtain the first objective allocation timeslot and the second objective allocation timeslot.
In order to maximize the lifetime of the sensor nodes, an optimization target is defined to maximize the energy level of the node with the least remaining energy among the entire sensor nodes, and the energy level is expressed as:
wherein the variable to be optimized is a time slot allocation T for a transmission set S And T R . The generated objective optimization function may be expressed as:
wherein the limitation on the total length of the time slot is derived from the limitation of the total length of the superframe, so that the time slot is limitedAnd->Is combined into->
In this embodiment, the original optimization problem is a convex problem, and the optimization objective can be regarded as point-by-point fetchThe target optimization function can therefore be converted into the following form:
where E represents the minimum of the remaining energy of all sensor nodes, which is an equivalent form of the original optimization problem. The Lagrangian function is:
wherein the method comprises the steps ofIs a lagrange multiplier, and thus its KKT condition can be obtained:
λ * ≠0
μ * ≥0
wherein θ S ,θ R 0 or 1, representing whether the corresponding time slot is active, based onThe conditions in the calculation formula are abstracted. Through the above formula, lambda in optimal time slot allocation can be obtained * ,μ * . At this time, substituting lambda * ,μ * To the following conditions:
can find the optimal slot allocation T S* ,T R* Wherein the optimal time slot allocation T S* ,T R* And respectively allocating time slots for the first target and the second target.
It should be further noted that the optimum slot allocation T is calculated based on the above S* ,T R* The first set of routing links and the second set of routing links may be respectively associated with the first targetAnd combining the allocated time slot with the second target allocated time slot to obtain the current optimal routing scheme.
In the transmission stage of the wireless sensor network, the network only generates one route link set to the sink node for each sensor node, and at the moment, T is distributed according to the time slot S* Corresponding time slot resources are allocated to the routing paths corresponding to each routing link set in sequence, and the energy performance of the network can be improved on the basis of guaranteeing the transmission requirements of all the sensors at this stage.
In the wireless mesh network transmission phase, the network generates multiple sets of routing links for each transmission requirement among routing nodes, each set of routing links corresponding to a routing path. At this time, the original data stream is divided into a plurality of sub-data streams, the sub-data stream size and the optimal time slot allocation T R* Proportional to the ratio. The sub-data streams are transmitted from the route source node to the route destination node in the assigned time slots by the corresponding route paths. The transmission requirement of the routing network is guaranteed at this stage, and the energy performance of the network is greatly improved under the condition of relatively small influence on the service quality of the network, so that the survival time of all sensors is prolonged.
Compared with the prior art, the invention has the following beneficial effects:
generating route link sets of different levels according to the transmission requirements of all wireless sensor nodes in a target network model, then carrying out optimal time slot resource allocation according to time slot constraint in the current route link set, and then combining the route link set with the optimal time slot resource to obtain a current optimal route selection scheme; the invention uses the mode of simultaneous transmission of the data during the route selection, can controllably improve the energy performance of the sensor node, and combines the route selection, the transmission set generation and the time slot allocation of the optimized network by researching the data-energy route combination algorithm in the two-layer energy integrated network combined by the wireless mesh network and the wireless sensor network, thereby improving the survival time of the sensor while ensuring the communication service quality of the network and improving the data energy transmission performance of the network.
In this embodiment, the method further includes: and calculating the energy consumption of the sensor node and the energy obtained by energy collection. For a sensor node in a network, defining its energy level can be expressed by the following formula:
wherein the method comprises the steps ofRepresentative node s i Is>Representing the remaining energy of the node after having undergone a previous superframe transmission,/for>Representing the energy harvested by the node in the superframe of the present round,/for each of the two sub-frames>Representing the energy consumed by the node in the superframe of the present round. Wherein the energy harvested by the node is +.>Can be expressed as:
wherein, the liquid crystal display device comprises a liquid crystal display device,representing a sensor node s j Routing node set capable of obtaining energy through energy harvesting radio frequency signals, beta represents conversion efficiency of energy harvesting, and h ij Representing channel parameters between nodes, < >>
Representing a routing node r i A) of the transmission power of (a) kl =1 represents that the cells of the kth row/column in matrix a are active, l k Representing a network link corresponding to the kth row corresponding to matrix A, b km =1 represents that the cells of the kth row m column in matrix B are active, l k Representing the network link corresponding to the kth row corresponding to matrix B,and->Representing the time slot assignments for matrix a and matrix B, respectively.
Energy consumption of sensor nodesMainly consists of communication, sensing and calculation. Of the three, the energy consumed by the communication is much greater than that of sensing and computing. Thus, energy consumption is defined as:
wherein, the liquid crystal display device comprises a liquid crystal display device,representing the energy consumption of the communication>Representing the energy consumption of sensing and computation. Further, due toSmaller, reducing it to a constant value. But->Can be expressed as:
wherein, the liquid crystal display device comprises a liquid crystal display device,and->The transmit power and the receive power of the sensor node are represented, respectively.
Fig. 4 is a flow chart of another routing method provided in the embodiment of the present invention, and as shown in fig. 4, the routing method specifically includes the following steps:
s1, determining a network model of a system, and distributing a transmission protocol for the network model;
s2, defining a superframe format according to system characteristics, and dividing the superframe into three stages;
s3, generating a route link set according to the transmission requirement, and distributing the route link set into corresponding super frame stages;
s4, obtaining energy consumption of the sensor node and energy obtained through energy collection;
s5, defining an optimization target to maximize the survival time of the sensor node, and obtaining an optimization target expression and constraint thereof;
s6, solving optimal transmission set time slot allocation according to the optimization target expression and the constraint thereof;
s7, generating a routing scheme according to the time slot allocation of the optimal transmission set.
Further, the step S1 specifically includes the following sub-steps:
s11, the wireless data simultaneous transmission network model is divided into two layers, namely a wireless mesh network (Wireless Mesh Network) comprising routing nodes and a wireless sensor network (Wireless Sensor Networks, WSN) comprising sensor nodes. Determining the number of the two types of nodes and the number of the aggregation nodes and node antennas;
s12, defining transmission rules of the two types of nodes and data flow characteristics in the network.
Further, the step S2 specifically includes the following sub-steps:
s21, the super frame is divided into three stages, wherein the first stage is a control command transmission stage, and the transmission requirement of the whole number of the energy-integrated network in the period is acquired at the stage, and route path selection and resource allocation are generated through a routing algorithm;
s22, the second stage is a sensor network transmission stage, and sensor node information with transmission requirements is transmitted to the sink node in the sensor network transmission stage;
s23, the third stage is a wireless mesh network transmission stage, and transmission among routing nodes is carried out at the stage.
Further, the step S3 specifically includes the following sub-steps:
s31, generating a sensor network routing link set by using a shortest path algorithm;
s32, generating a routing link set in the transmission stage of the wireless mesh network by using a breadth first algorithm.
Further, the step S5 specifically includes the following sub-steps:
s51, generating time slot allocation constraint of a sensor network transmission stage;
s52, generating time slot constraint of a wireless mesh network transmission stage;
and S53, defining an optimization target to maximize the survival time of the sensor node, and obtaining an optimization problem.
The beneficial effects of the invention are as follows: the invention comprises three parts of network routing link combination generation, time slot resource allocation and routing scheme generation, wherein a breadth-first algorithm and a shortest path algorithm in graph theory are adopted to jointly generate a network routing link set, the time slot resource allocation of different stages of a network superframe is jointly optimized through a convex optimization algorithm, and the survival time of a sensor is improved while the network communication service quality is ensured.
In a second aspect, the present invention provides a routing device, as shown in fig. 5, the device comprising:
a transmission requirement obtaining module 110, configured to obtain transmission requirements of all wireless sensor nodes in a target network model, where the target network model includes a wireless mesh network, a wireless sensor network, and a sink node;
a link set generating module 120, configured to generate a first set of routing links from each wireless sensor to the wireless mesh network and a second set of routing links from the source node to the sink node for each data flow in the wireless mesh network according to transmission requirements of all wireless sensor nodes;
a timeslot constraint generating module 130, configured to generate a first timeslot constraint of each wireless sensor in a sensor network transmission stage according to the first routing link set, and generate a second timeslot constraint of each data stream in a wireless mesh network transmission stage according to the second routing link set;
and the target allocation timeslot calculation module 140 is configured to calculate a first target allocation timeslot and a second target allocation timeslot according to the first timeslot constraint and the second timeslot constraint, so that the first routing link set and the second routing link set are respectively combined with the first target allocation timeslot and the second target allocation timeslot to obtain a current optimal routing scheme.
In a third aspect, the present invention provides a computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the following steps when executing the computer program: acquiring transmission requirements of all wireless sensor nodes in a target network model, wherein the target network model comprises a wireless mesh network, a wireless sensor network and sink nodes; generating a first routing link set from each wireless sensor to the wireless mesh network and a second routing link set from the source node to the sink node for each data flow in the wireless mesh network according to the transmission requirements of all wireless sensor nodes; generating a first time slot constraint of each wireless sensor in a sensor network transmission stage according to the first routing link set, and generating a second time slot constraint of each data stream in a wireless mesh network transmission stage according to the second routing link set; according to the first time slot constraint and the second time slot constraint, a first target allocation time slot and a second target allocation time slot are calculated, and the first routing link set and the second routing link set are combined with the first target allocation time slot and the second target allocation time slot respectively, so that a current optimal routing scheme is obtained.
In a fourth aspect, the present invention provides a readable storage medium having stored thereon a computer program which when executed by a processor performs the steps of: acquiring transmission requirements of all wireless sensor nodes in a target network model, wherein the target network model comprises a wireless mesh network, a wireless sensor network and sink nodes; generating a first routing link set from each wireless sensor to the wireless mesh network and a second routing link set from the source node to the sink node for each data flow in the wireless mesh network according to the transmission requirements of all wireless sensor nodes; generating a first time slot constraint of each wireless sensor in a sensor network transmission stage according to the first routing link set, and generating a second time slot constraint of each data stream in a wireless mesh network transmission stage according to the second routing link set; according to the first time slot constraint and the second time slot constraint, a first target allocation time slot and a second target allocation time slot are calculated, and the first routing link set and the second routing link set are combined with the first target allocation time slot and the second target allocation time slot respectively, so that a current optimal routing scheme is obtained.
Those skilled in the art will appreciate that all or part of the processes in the methods of the above embodiments may be implemented by a computer program for instructing relevant hardware, where the program may be stored in a non-volatile computer readable storage medium, and where the program, when executed, may include processes in the embodiments of the methods described above. Any reference to memory, storage, database, or other medium used in the various embodiments provided herein may include non-volatile and/or volatile memory. The nonvolatile memory can include Read Only Memory (ROM), programmable ROM (PROM), electrically Programmable ROM (EPROM), electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double Data Rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous Link DRAM (SLDRAM), memory bus direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM), among others.
It should be noted that in this document, relational terms such as "first" and "second" and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Moreover, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
Claims (9)
1. A method of routing, the method comprising:
acquiring transmission requirements of all wireless sensor nodes in a target network model, wherein the target network model comprises a wireless mesh network, a wireless sensor network and sink nodes;
generating a first routing link set from each wireless sensor to the wireless mesh network and a second routing link set from the source node to the sink node for each data flow in the wireless mesh network according to the transmission requirements of all wireless sensor nodes;
generating a first time slot constraint of each wireless sensor in a sensor network transmission stage according to the first routing link set, and generating a second time slot constraint of each data stream in a wireless mesh network transmission stage according to the second routing link set;
according to the first time slot constraint and the second time slot constraint, a first target allocation time slot and a second target allocation time slot are calculated, and the first routing link set and the second routing link set are respectively combined with the first target allocation time slot and the second target allocation time slot to obtain a current optimal routing scheme;
according to the first time slot constraint and the second time slot constraint, a first target allocation time slot and a second target allocation time slot are calculated, and the method comprises the following steps:
acquiring a target sensor node with the least current energy in a target network model;
generating a target optimization function according to the current energy of the target sensor node, the first time slot constraint and the second time slot constraint;
and solving the target optimization function to obtain the first target allocation time slot and the second target allocation time slot.
2. The routing method of claim 1, wherein prior to obtaining transmission requirements for all wireless sensor nodes in the target network model, the method further comprises:
constructing an initial network model with integration of digital energy;
and determining the transmission rule of the initial network model to obtain a target network model.
3. The routing method of claim 1, wherein the first set of routing links is represented by a matrix:the second set of routing links is represented by a matrix: />；
Wherein, the liquid crystal display device comprises a liquid crystal display device,represents the number of all viable links, +.>Representing the number of sets of possible routing links, +.>Representing the number of viable routing link sets.
4. The routing method of claim 1, wherein the first slot constraint is formulated as:
，
，
wherein, the liquid crystal display device comprises a liquid crystal display device,represents the kth link,/->The time slot of the kth link is represented, ds represents the transmission time length of the kth link, and Ts represents the total time length of all time slots;
the formula expression of the second time slot constraint is:
，
，
wherein, the liquid crystal display device comprises a liquid crystal display device,representing data stream->Transmission duration of->Time slot representing the kth link, +.>Representing the total duration of all time slots in the transmission phase of the routed network.
5. The routing method of claim 1, wherein the target optimization function has a formula:
，
wherein, the liquid crystal display device comprises a liquid crystal display device,and->Is combined into->。
6. The routing method of claim 1, wherein the formula for calculating the current energy of the wireless sensor node is:
，
wherein, the liquid crystal display device comprises a liquid crystal display device,representative node->Is>Representing the remaining energy of the node after having undergone a previous superframe transmission,/for>Representing the energy harvested by the node in the superframe of the present round,/for each of the two sub-frames>Representing the energy consumed by the node in the superframe of the present round, wherein the energy harvested by the node +.>Expressed as:
，
wherein, the liquid crystal display device comprises a liquid crystal display device,representing a sensor node->Routing node set capable of obtaining energy by energy harvesting radio frequency signals, < >>Represents the conversion efficiency of energy harvesting, +.>Representing the channel parameters between the nodes,representing routing nodes->Is set to the transmission power of (a);
the energy consumption of the sensor node is as follows:
，
wherein, the liquid crystal display device comprises a liquid crystal display device,representing the energy consumption of the communication>Energy consumption representing sensing and computation, +.>The formula expression of (2) is:
，
wherein, the liquid crystal display device comprises a liquid crystal display device,and->The transmit power and the receive power of the sensor node are represented, respectively.
7. A routing device, the device comprising:
the system comprises a transmission demand acquisition module, a transmission demand acquisition module and a transmission demand acquisition module, wherein the transmission demand acquisition module is used for acquiring transmission demands of all wireless sensor nodes in a target network model, and the target network model comprises a wireless mesh network, a wireless sensor network and sink nodes;
the link set generating module is used for generating a first route link set from each wireless sensor to the wireless mesh network and a second route link set from the source node to the sink node for each data flow in the wireless mesh network according to the transmission requirements of all wireless sensor nodes;
the time slot constraint generation module is used for generating a first time slot constraint of each wireless sensor in a sensor network transmission stage according to the first routing link set and generating a second time slot constraint of each data stream in a wireless mesh network transmission stage according to the second routing link set;
the target allocation time slot resolving module is used for resolving a first target allocation time slot and a second target allocation time slot according to the first time slot constraint and the second time slot constraint, so that the first routing link set and the second routing link set are respectively combined with the first target allocation time slot and the second target allocation time slot to obtain a current optimal routing scheme;
according to the first time slot constraint and the second time slot constraint, a first target allocation time slot and a second target allocation time slot are calculated, and the method comprises the following steps:
acquiring a target sensor node with the least current energy in a target network model;
generating a target optimization function according to the current energy of the target sensor node, the first time slot constraint and the second time slot constraint;
and solving the target optimization function to obtain the first target allocation time slot and the second target allocation time slot.
8. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the steps of the method according to any one of claims 1 to 6 when the computer program is executed by the processor.
9. A readable storage medium having stored thereon a computer program, which when executed by a processor realizes the steps of the method according to any of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210301085.1A CN114585043B (en) | 2022-03-25 | 2022-03-25 | Routing method, device, computer equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210301085.1A CN114585043B (en) | 2022-03-25 | 2022-03-25 | Routing method, device, computer equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114585043A CN114585043A (en) | 2022-06-03 |
| CN114585043B true CN114585043B (en) | 2023-07-21 |
Family
ID=81777025
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210301085.1A Active CN114585043B (en) | 2022-03-25 | 2022-03-25 | Routing method, device, computer equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114585043B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101572649A (en) * | 2008-04-30 | 2009-11-04 | 华为技术有限公司 | Method and device for time slot allocation |
| CN102036335A (en) * | 2009-09-27 | 2011-04-27 | 北京邮电大学 | Route cognizing protocol for wireless network |
Family Cites Families (20)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9730078B2 (en) * | 2007-08-31 | 2017-08-08 | Fisher-Rosemount Systems, Inc. | Configuring and optimizing a wireless mesh network |
| CN102065575A (en) * | 2009-11-11 | 2011-05-18 | 中国科学院沈阳自动化研究所 | Method for constructing mesh and star hybrid topological wireless sensor network based on IEEE 802.15.4 |
| CN101835277B (en) * | 2010-02-09 | 2013-03-20 | 重庆理工大学 | Wireless sensor network topology control method based on LEACH-ANT algorithm |
| CN103281746B (en) * | 2013-06-03 | 2016-01-20 | 南昌大学 | A kind of wireless sense network route method of quotient topology energy hierarchical Dynamic Programming |
| EP2811796A1 (en) * | 2013-06-07 | 2014-12-10 | Stichting Vu-Vumuc | Position-based broadcast protocol and time slot schedule for a wireless mesh network |
| JP5971225B2 (en) * | 2013-10-24 | 2016-08-17 | 横河電機株式会社 | Wireless device, wireless module, interface module, and communication method |
| CN106604399A (en) * | 2016-12-29 | 2017-04-26 | 深圳天珑无线科技有限公司 | Energy collecting method and device |
| CN107426826A (en) * | 2017-04-27 | 2017-12-01 | 成都瑞沣信息科技有限公司 | The MAC protocol for wireless sensor networks design method collected based on RF energy |
| CN110809904A (en) * | 2017-07-01 | 2020-02-18 | 英特尔公司 | Method and apparatus for vehicle radio communication |
| CN107911859B (en) * | 2017-10-24 | 2020-03-06 | 天津大学 | Life cycle prolonging method of underwater wireless sensor network based on cross-layer design |
| CA3083915C (en) * | 2017-12-01 | 2024-02-06 | Interdigital Patent Holdings, Inc. | Network initiated on-demand zero-energy paging method and apparatus |
| CN108696926B (en) * | 2018-05-09 | 2021-04-06 | 河海大学常州校区 | Cross-layer reliable data transmission method for underwater wireless sensor network |
| CN109831344B (en) * | 2019-03-25 | 2020-05-19 | 大连理工大学 | UWSNs space-time routing architecture acquisition method based on SDN |
| CN110113785B (en) * | 2019-05-07 | 2022-04-22 | 重庆邮电大学 | Energy-mutual-assistance-based cooperative transmission method in energy-collecting wireless sensor network |
| CN111132261B (en) * | 2019-12-03 | 2022-09-20 | 华南理工大学 | Power control, relay selection and time slot allocation method based on gait cycle |
| CN112469100B (en) * | 2020-06-10 | 2023-03-31 | 广州大学 | Hierarchical routing algorithm based on rechargeable multi-base-station wireless heterogeneous sensor network |
| CN111988797B (en) * | 2020-08-10 | 2022-09-06 | 国网能源研究院有限公司 | Method and system for analyzing performance of two-hop multi-relay network driven by wireless energy transmission |
| CN112073931B (en) * | 2020-08-20 | 2023-04-07 | 东南大学 | Linear sensor network multi-hop data collection method based on redundant nodes |
| CN112243258B (en) * | 2020-10-14 | 2023-08-11 | 中国联合网络通信集团有限公司 | Method and device for determining user perception rate |
| CN113242587B (en) * | 2021-01-04 | 2022-07-01 | 湖州师范学院 | Cluster routing method based on hexagonal centroid cluster head election and dynamic time slot allocation |
-
2022
- 2022-03-25 CN CN202210301085.1A patent/CN114585043B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101572649A (en) * | 2008-04-30 | 2009-11-04 | 华为技术有限公司 | Method and device for time slot allocation |
| CN102036335A (en) * | 2009-09-27 | 2011-04-27 | 北京邮电大学 | Route cognizing protocol for wireless network |
Non-Patent Citations (1)
| Title |
|---|
| "2019-5G-Americas-Rysavy-Implications-of-a-Transformational-Technology-White-Paper".3GPP pcg\pcg_43.2019, * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114585043A (en) | 2022-06-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Khan et al. | Energy management in wireless sensor networks: A survey | |
| Iova et al. | Using multiparent routing in RPL to increase the stability and the lifetime of the network | |
| Lu et al. | Energy-efficient data sensing and routing in unreliable energy-harvesting wireless sensor network | |
| CN102083101B (en) | Information transmission method for cognitive radio sensor network | |
| Mazunga et al. | Ultra-low power techniques in energy harvesting wireless sensor networks: Recent advances and issues | |
| Yao et al. | Delay-aware wireless powered communication networks—Energy balancing and optimization | |
| Rault et al. | WSN lifetime optimization through controlled sink mobility and packet buffering | |
| CN106162798A (en) | The joint Power distribution of radio sensing network energy acquisition node cooperation transmission and relay selection method | |
| Zeng et al. | Data delivery from WSNs to cloud based on a fog structure | |
| Basagni et al. | Wake-up radio-enabled routing for green wireless sensor networks | |
| CN107911859A (en) | The life cycle of underwater wireless sensor network based on cross layer design extends method | |
| JP5861701B2 (en) | Network control method, path control device, network control system, and path control program | |
| Escolar et al. | Quality of service optimization in solar cells-based energy harvesting wireless sensor networks | |
| Gao et al. | SWIPT-based energy scheduling for solar-powered WSN in full-duplex mode | |
| CN114585043B (en) | Routing method, device, computer equipment and storage medium | |
| Anees et al. | Harvested energy scavenging and transfer capabilities in opportunistic ring routing | |
| Kumbhkar et al. | Rate optimal design of a wireless backhaul network using TV white space | |
| KR101460946B1 (en) | Network system and routing method thereof | |
| Hahm et al. | A case for time slotted channel hopping for ICN in the IoT | |
| Mendes et al. | Lifetime analysis of a slotted ALOHA-based wireless sensor network using a cross-layer frame rate adaptation scheme | |
| Guo et al. | On relay node placement and assignment for two-tiered wireless networks | |
| Basit et al. | Optimum power allocation for an energy harvesting wireless communication system considering energy storage losses | |
| Camana et al. | Cluster-head selection for energy-harvesting IoT devices in multi-tier 5G cellular networks | |
| Zhang et al. | Energy efficient joint data aggregation and link scheduling in solar sensor networks | |
| Chilamkurthy et al. | Energy-Efficient and QoS-Aware Data Transfer in Q-Learning-Based Small-World LPWANs |
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 |