CN105591684B - Data transmission scheduling method based on the relay collections such as not in wireless sensor network - Google Patents

Data transmission scheduling method based on the relay collections such as not in wireless sensor network Download PDF

Info

Publication number
CN105591684B
CN105591684B CN201610138014.9A CN201610138014A CN105591684B CN 105591684 B CN105591684 B CN 105591684B CN 201610138014 A CN201610138014 A CN 201610138014A CN 105591684 B CN105591684 B CN 105591684B
Authority
CN
China
Prior art keywords
node
relay
data
base station
data transmission
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.)
Expired - Fee Related
Application number
CN201610138014.9A
Other languages
Chinese (zh)
Other versions
CN105591684A (en
Inventor
刘安丰
陈壮彬
贺晟
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Central South University
Original Assignee
Central South University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Central South University filed Critical Central South University
Priority to CN201610138014.9A priority Critical patent/CN105591684B/en
Publication of CN105591684A publication Critical patent/CN105591684A/en
Application granted granted Critical
Publication of CN105591684B publication Critical patent/CN105591684B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/14—Relay systems
    • H04B7/15—Active relay systems
    • H04B7/155—Ground-based stations
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/14—Relay systems
    • H04B7/15—Active relay systems
    • H04B7/155—Ground-based stations
    • H04B7/15592—Adapting at the relay station communication parameters for supporting cooperative relaying, i.e. transmission of the same data via direct - and relayed path
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/04—Arrangements for maintaining operational condition
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/08—Testing, supervising or monitoring using real traffic
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses the data transmission scheduling methods based on the relay collections such as not in a kind of wireless sensor network, key point of the invention is big according to the distinctive nearly base station energy consumption of energy of wireless sensor network consumption, and the small feature for having a large amount of energy residuals of remote base-station node energy consumption, breach the method that whole network all selects identical quantity relay node in previous research.In the methods of the invention, for the node of remote base station area transmission data, the biggish relay node of quantity is selected for it.The relay node quantity of selection is bigger, then the waiting time that node needs that relay node is waited to wake up is shorter, thus data transfer delay is smaller, and when transmission failure, the number for attempting transmission is more, thus improves the success rate of data transmission, also with regard to data transmission credibility height.Thus, the method for the present invention on the whole can be in the case where not reducing network life compared to existing method, the reliability of improve data transfer, reduces data transfer delay.

Description

Data transmission scheduling method based on unequal relay sets in wireless sensor network
Technical Field
The invention belongs to the field of wireless sensor network data transmission, and particularly relates to a data transmission method for applying a transmission strategy in a wireless link which is sensitive to delay and has certain loss in network transmission, so that the network data transmission has high reliability, small delay and long network service life.
Background
The wireless sensor network is a wireless network formed by a plurality of sensor nodes which are communicated with each other through a multi-hop wireless link in a self-organizing and multi-hop mode, can be widely applied to various special environments and applications such as industrial monitoring, agriculture, civil use, environmental monitoring, battlefields, oceans, fires and the like, and is considered to be one of key basic technologies of future important internet of things. The problem of reliable and low-delay data transmission in a wireless sensor network is an important research topic, and the research has important significance.
(1) How to guarantee the reliability of data transmission. The wireless sensor network is based on wireless transmission data, and the wireless network is characterized in that the wireless sensor network is easily interfered by environment interference and nodes, and the transmission link is far worse than a wired network due to the inherent transmission error rate and the inherent exchange rate, and the packet loss rate of the wireless sensor network for data transmission is as high as 10% to 30% generally. The error rate is higher than that of a wired network by several orders of magnitude, so that the success rate of point-to-point transmission is greatly reduced;
(2) how to reduce the delay of the wireless sensor network transmission. The delay of wireless transmission is several times higher relative to wired networks. The main reason is that the reliability of wireless transmission is low, and in order to ensure the reliability of data transmission, the most important currently adopted method is a retransmission mechanism, and the basic reason is that when a receiver receives a data packet of a sender, an ACK message for confirming the receipt of the data packet is returned. If the receiving side receives the ACK message, the receiving side continues to send the next data packet, otherwise, the data packet is retransmitted after waiting for the preset timeout time.
(3) The problem of network lifetime of wireless sensor networks. The wireless sensor network node is generally simple in structure and low in cost, can be deployed on a large scale, and is generally equipped with a battery as an energy source, so how to effectively utilize energy to prolong the service life of the network is one of important research subjects of the wireless sensor network. Generally, data transmission is the most dominant energy consumption of a node. Therefore, two main ways to improve the service life of the network are to reduce the data transmission of the nodes and to reasonably and effectively utilize the energy of the whole network.
The data transmission method using the relay node for data transmission belongs to a variant of retransmission mechanism. This approach is well suited for sensor networks that operate periodically/sleep. In such networks, the sensor network nodes are periodically active and sleeping. Because the sleep can greatly reduce the energy consumption of the nodes, the nodes are put into the sleep state as much as possible in the sensor network so as to reduce the energy consumption of the nodes. Therefore, when a node has data transmission, if the relay nodes are in a sleep state, the node needs to wait for the wake-up of the relay node before transmitting forward. But the data transmission may not be successful due to the instability of the wireless link. Therefore, the data sending node needs to wait for the next relay node to wake up and then continue to attempt data transmission. Therefore, in such a method, if there are many relay nodes, when there is data transmission, the time required for waiting for the relay node to wake up is shorter, and thus the delay of data transmission is smaller. Meanwhile, the data sender abandons the transmission of the current data packet after all the relay nodes are unsuccessfully transmitted. Thus, although the more relay nodes, the higher the reliability of data transmission, the more relay nodes, the number of times transmission is attempted, the longer the node waits, and thus the greater its energy consumption. The existing strategy is to select a fixed number of relay nodes, and the strategy does not consider the distance between a node and a base station, so that the energy consumption of the node which is closer to the base station is often too fast, and the energy consumption of the node which is farther away is less, so that the energy consumption of the whole network is unbalanced, and the reliability of data transmission cannot be guaranteed.
Disclosure of Invention
The technical problem to be solved by the invention is to provide a data transmission scheduling method based on unequal relay sets in a wireless sensor network, and compared with the existing method, the data transmission scheduling method based on unequal relay sets in the wireless sensor network has the advantages of small delay and high reliability on the basis of keeping equivalent energy consumption.
The technical solution of the invention is as follows:
in the wireless sensor network, each node independently adopts a working mode of working/sleeping periodic alternation, and the node can transmit data only when in a working state; each node viSelecting a plurality of relay nodes to form a relay node set;
node viWhen a data packet needs to be transmitted, data transmission is initiated to the relay node which wakes up first in the relay node set, if the data transmission is unsuccessful, the next waking up node in the relay node is waited to transmit data until the data transmission is successful to the relay node, or each relay node in the relay node set fails to transmit, and then the transmission of the data packet is abandoned.
Determining a node viThe method for counting the relay nodes comprises the following steps:
step 1: let node viThe initial number of relay nodes is delta'; if the setting is 2, 3 or 5, etc., the same as the original strategy;
step 2: compute node viEnergy consumption of (2):
node viIs consumed asThe calculation formula of (a) is as follows:
d is a node viDistance to a base station;
wherein:
(1)representing an energy consumption power of the node for a low power consumption listening state;
(2)tdutya time that is one duty cycle period;
(3)representing the energy consumption of receiving a data packet, having
Wherein epsilonrPower, epsilon, for receiving packets for nodestIndicating the power at which the node transmits the data packet, SpRepresenting the time required for transmitting the data packet; sakIndicating ACK window response duration, SrIs the preamble duration;
(4)energy consumption for sending a packet for a data packet;the calculation formula of (a) is as follows:
wherein,is the duty cycle;
(5)representing the number of data packets received by the node at distance d from the base station;
(6)representing the number of data packets sent by nodes at d from the base station;
and step 3: adding 1 to the initial relay node number δ', namely: δ ═ δ '+ 1, then calculate the initial number of relay nodes δ' by the node v after 1iEnergy consumption of
And 4, step 4: if it is notGo to step 3, where Ex0Representing the energy consumption of the nearest node to the base station;
if it is notThen δ is δ' -1, and the next step is carried out;
if E isx'＝Ex0Entering the next step without any treatment;
and 5: and obtaining the number delta of the relay nodes at different distances from the base station, wherein delta is the size of the relay node set.
And each node selects delta relay nodes with good link quality to transmit data according to the delta calculated above, wherein the link quality is obtained by statistics during node communication and is assumed to be obtained by a system.
Is calculated by the formula
Wherein epsilonsPower when the node sleeps;
represents the time taken for the node to transmit data;
represents the time taken for the node to receive the data;
the calculation formula of (a) is as follows:
whereinThe number of data packets sent by the node at the distance d from the base station is represented by the following calculation formula:
is a link canBy nature, λ is the probability of occurrence of an event sensed by the node, the wireless sensor network is used for detecting the event, λ is the probability of occurrence of the event, and the event is, for example, sensing the temperature periodically, or detecting the occurrence of a panda, etc.; z represents how many hops the current node is from the base station,represents rounding down; r represents the node transmission radius, and R represents the network radius; x' represents the perceived distance of the node.
Success rate function of data transmission
qixRepresenting a node viAnd node vxQuality of the link between qijThe value of (1) is the actual link reliability of the node, and is a known parameter according to the practical situation; v. ofxAn xth relay node representing a node; q. q.sijDenotes viAnd node vjLink quality between vjThe 1 st, 2 nd, … th, x-1 st relay node representing a node.
The calculation formula of (a) is as follows:
wherein,the number of packets received for a node at distance d from the base station,
parameters such as t involved in the inventionduty，εr，εt，εs，Sr，Sp，Sak，λ，z，r，R，qixThe parameters are known parameters, or parameters set during initialization, or parameters generated during network operation, which are all parameters that can be determined.
The method is suitable for the application of the wireless sensor which has packet loss rate in network transmission and is sensitive to data transmission delay. The sensor network node works in a mode of periodic sleep/work alternation. When the node is asleep, no data transfer can take place, whereas when the node is in the active mode, data transfer can take place. In order to guarantee the reliability of data transmission and reduce network transmission delay. In a conventional study, when a node transmits data to a base station via a multi-hop relay, each node selects a plurality of nodes having high link quality as relay nodes. When the relay node works, data transmission can be carried out. The data transmitting node firstly transmits data to the relay node which wakes up firstly. And if the data transmission is unsuccessful, continuing to transmit the data to the relay nodes which wake up continuously until the data transmission is successful, or abandoning the data packet transmission after the data transmission to all the relay nodes fails. The key point of the invention is that the energy consumption of the near base station is large and the energy consumption of the far base station node is small according to the characteristic of the energy consumption of the wireless sensor network. The method breaks through the method that the same number of relay nodes are selected in the whole network in the previous research. In the method, for the nodes transmitting data in the far base station region, a large number of relay nodes are selected. Because the larger the number of the selected relay nodes is, the more the data transmission nodes need to perform trial transmission on each relay node in sequence before the data transmission is successful, the time for the data transmission nodes to keep transmitting is increased, and the energy consumption is increased. But brings the advantages that the delay of data transmission is reduced and the reliability of data transmission is improved. The reason is that: the more relay nodes, the time for waiting too long for the relay node to wake up when the node has data transmission can be reduced, and the delay of data transmission can be reduced. Meanwhile, after the number of the relay nodes is increased, the transmission node can give up the transmission of the data packet after more transmission attempts fail, so that the reliability of network transmission is improved. The invention adopts the same number of relay nodes (namely the fixed number of relay nodes) as the previous strategy for the nodes in the near base station area, thereby being capable of ensuring that the data transmission reliability of the sensor network is higher than the previous strategy and the delay is less than the previous strategy on the whole, and simultaneously, the service life of the network is the same as the previous strategy.
Compared with the prior art, the invention has the advantages that:
in the data transmission scheduling method based on the unequal relay sets in the wireless sensor network, each node independently adopts a working mode of working/sleeping periodic alternation, and the nodes can transmit data only when in a working state. When data of a node needing data transmission needs to be transmitted to a base station, a certain number of nodes which are closer to the base station than the node and are within the communication range of the node are selected as a relay node set, called a relay set for short, and the relay node set is transmitted to the base station through multi-hop relay.
The more relay nodes, the shorter the waiting time the node needs to wait for the relay node to wake up, and thus the smaller the data transmission delay. And because the number of the relay nodes is large, the number of times of transmission attempts is large when the transmission fails, so that the success rate of data transmission is improved, and the reliability of data transmission is high. However, if the number of selected relay nodes is larger, the data transmission node needs to perform trial transmission on each relay node in sequence before the data transmission is successful, and thus, the time for the data transmission node to maintain transmission is increased, and the energy consumption thereof is increased. Because the nodes in the remote base station area have a large amount of energy surplus, the service life of the network cannot be obviously influenced by more consumed energy. And a smaller number of relay nodes are selected for the nodes in the area close to the base station, so that the network can be kept to have a longer service life. Therefore, compared with the existing method, the method of the invention can improve the reliability of data transmission and reduce the data transmission delay on the whole under the condition of not reducing the service life of the network. Therefore, the method of the invention can improve the reliability of data transmission and reduce network delay.
The invention innovatively provides that the residual energy of the nodes in the far base station area is fully utilized, more relay nodes are selected in the far base station area, and smaller relay nodes are selected in the near base station area, so that the delay of data transmission is reduced, the reliability of data transmission is improved, the service life of a network is not reduced, and the specific simulation effect refers to a subsequent simulation comparison curve, so that the invention has obvious application effect.
Drawings
Fig. 1 is a schematic diagram of data transmission scheduling based on unequal relay sets in a wireless sensor network;
FIG. 2 is a schematic diagram of data transmission;
fig. 3 is a comparison curve of the number of relay nodes selected when the average link reliability is 0.3;
fig. 4 is a comparison curve of the number of relay nodes selected when the average link reliability is 0.5;
FIG. 5 is a graph illustrating energy consumption versus node energy consumption for different methods;
FIG. 6 is an end-to-end reliability comparison curve for data transmission when the average link reliability is 0.3;
FIG. 7 is an end-to-end reliability comparison curve for data transmission when the average link reliability is 0.5;
FIG. 8 is an end-to-end delay contrast curve for data transmission when the average link reliability is 0.3;
FIG. 9 is an end-to-end delay contrast curve for data transmission when the average link reliability is 0.5;
fig. 10 is an end-to-end average delay contrast curve for data transmission across a network at different network scales when the average link reliability is 0.3.
Fig. 11 is an end-to-end average delay contrast curve for data transmission across a network at different network scales when the average link reliability is 0.5.
Detailed Description
In order to facilitate an understanding of the invention, the invention will be described more fully and in detail below with reference to the accompanying drawings and preferred embodiments, but the scope of the invention is not limited to the following specific embodiments.
Unless otherwise defined, all terms of art used hereinafter have the same meaning as commonly understood by one of ordinary skill in the art. The terminology used herein is for the purpose of describing particular embodiments only and is not intended to limit the scope of the present invention.
Example (b):
as shown in fig. 1-7, in a data transmission scheduling method based on unequal relay sets in a wireless sensor network, in the wireless sensor network, each node independently adopts a working mode of working/sleeping periodic alternation, and the node can only transmit data when in a working state; each node viSelecting a plurality of relay nodes to form a relay node set;
node viWhen a data packet needs to be transmitted, data transmission is initiated to the relay node which wakes up first in the relay node set, if the data transmission is unsuccessful, the next waking node in the relay node is waited to transmit data until the data transmission is successful to the relay nodeThe relay node, or each relay node in the set of relay nodes, fails to transmit, and the packet transmission is aborted.
Determining a node viThe method for counting the relay nodes comprises the following steps:
step 1: let node viThe initial number of relay nodes is delta; if the setting is 2, 3 or 5, etc., the same as the original strategy;
step 2: compute node viEnergy consumption of (2):
node viIs consumed asThe calculation formula of (a) is as follows:
d is a node viDistance to a base station;
wherein:
(1)representing an energy consumption power of the node for a low power consumption listening state;
(2)tdutya time that is one duty cycle period;
(3)representing the energy consumption of receiving a data packet, having
Wherein epsilonrPower, epsilon, for receiving packets for nodestIndicating the power at which the node transmits the data packet, SpRepresenting the time required for transmitting the data packet; sakIs represented by ACK Window response duration, SrIs the preamble duration;
(4)energy consumption for sending a packet for a data packet;the calculation formula of (a) is as follows:
wherein,is the duty cycle;
(5)representing the number of data packets received by the node at distance d from the base station;
(6)representing the number of data packets sent by nodes at d from the base station;
and step 3: adding 1 to the initial relay node number δ', namely: δ ═ δ '+ 1, then calculate the initial number of relay nodes δ' by the node v after 1iEnergy consumption of
And 4, step 4: if it is notGo to step 3, where Ex0Representing the energy consumption of the nearest node to the base station;
if it is notThen δ is δ' -1, and the next step is carried out;
if E isx'＝Ex0Entering the next step without any treatment;
and 5: and obtaining the number delta of the relay nodes at different distances from the base station, wherein delta is the size of the relay node set.
And each node selects delta relay nodes with good link quality to transmit data according to the delta calculated above, wherein the link quality is obtained by statistics during node communication and is assumed to be obtained by a system.
Is calculated by the formula
Wherein epsilonsPower when the node sleeps;
represents the time taken for the node to transmit data;
represents the time taken for the node to receive the data;
the calculation formula of (a) is as follows:
whereinThe number of data packets sent by the node at the distance d from the base station is represented by the following calculation formula:
the reliability of a link is, λ is the probability of occurrence of an event sensed by a node, a wireless sensor network is used for detecting the event, λ is the probability of occurrence of the event, and the event is, for example, the periodic sensed temperature, or the occurrence of a panda, etc.; z represents how many hops the current node is from the base station,represents rounding down; r represents the node transmission radius, and R represents the network radius; x' represents the perceived distance of the node.
Success rate function of data transmission
qixRepresenting a node viAnd node vxLink quality between; q. q.sixThe value of (1) is the actual link reliability of the node, and is a known parameter according to the practical situation; v. ofxAn xth relay node representing a node; q. q.sijDenotes viAnd node vjLink quality between vjThe 1 st, 2 nd, … th, x-1 st relay node representing a node.
The calculation formula of (a) is as follows:
wherein,for the number of packets received by the node,
as shown in fig. 1, each node selects a plurality of nodes with good link quality as a relay node set, and when there is data transmission, the node initiates data transmission to a node which wakes up first in the relay nodes, and if the node fails, waits for a node which wakes up next in the relay nodes to send data. And abandoning the transmission of the data packet until the data transmission is successful or each relay node fails to transmit. In the method of the invention, the number of relay nodes selected by the nodes in the near base station area is the same as the conventional strategy. The number of relay nodes selected by the nodes in the remote base station area is larger than that of the relay nodes selected by the nodes in the previous strategy, so that the method can improve the reliability of data transmission and reduce network delay.
Fig. 3 shows a comparison of the number of relay node selections when the average link reliability is 0.3. It can be seen from the figure that the method of the present invention can select a lot more relay nodes than the original method at a place slightly far away from the base station without affecting the service life of the network, thereby improving the reliability of data transmission and reducing the network delay. Network lifetime refers to the time at which the first node in the network dies. In fig. 3, the purpose of selecting a relay node smaller than the previous method by the near base station node is to reduce the energy consumption of the near base station area node under the conditions of improving the data transmission reliability and reducing the network delay.
Fig. 4 is similar to fig. 3 except that the link reliability is changed to 0.5-link reliability is connection quality.
Fig. 5 shows a comparison of the energy consumption of the nodes under different methods, and it can be seen from the graph that the energy consumption of the nodes in the near base station area of the method of the present invention is almost equal to that of the previous method, and is the maximum energy consumption in the network, so that the network life of the two methods is equal. Since the network has energy left in the area far from the base station, the method of the present invention increases the number of relay nodes, and thus the energy consumption of the method of the present invention is greater in the area of the far base station than in the conventional method. It can be seen from the figure that even with the method of the present invention, there is a surplus in energy consumption in the remote base station area of the network. It is shown that a larger number of relay nodes can be selected, but the performance of the network is improved only to a certain extent by increasing the number of relay nodes.
Fig. 6 and 7 show end-to-end reliability comparisons for data transmission when the average link reliability is 0.3 and 0.5, respectively. The method of the invention increases the number of relay nodes in the far base station area, so the reliability of data transmission of each hop is improved, and the end-to-end reliability of data transmission to the base station is higher than that of the prior method.
Fig. 8 and 9 show end-to-end data transfer delay comparisons for data transfers when the average link reliability is 0.3 and 0.5. The method of the invention increases the number of relay nodes in the far base station area, so that the delay of data transmission of each hop is reduced, and the end-to-end delay of data transmission to the base station is lower than that of the prior method.
FIGS. 10 and 11 show end-to-end average delay comparisons for data transmission across a network at different network scales when the average link reliability is 0.3 and 0.5; the method of the invention increases the number of relay nodes, which leads to the reduction of the delay of the nodes in the remote base station area, thereby reducing the average delay of the whole network.

Claims (1)

1. In the wireless sensor network, each node independently adopts a working mode of working/sleeping periodic alternation, and the node can transmit data only when in a working state; each node viSelecting a plurality of relay nodes to form a relay node set;
node viWhen a data packet needs to be transmitted, data transmission is initiated to the relay node which wakes up first in the relay node set, and if the data packet does not succeed, the next node which wakes up in the relay node is waitedThe point sends the data, until the data is sent to the relay node successfully, or each relay node in the relay node set fails to transmit, abandons the transmission of the data packet;
the method is characterized in that:
determining a node viThe method for counting the relay nodes comprises the following steps:
step 1: let node viThe initial number of relay nodes is delta';
step 2: compute node viEnergy consumption of (2):
node viIs consumed asThe calculation formula of (a) is as follows:
d is a node viDistance to a base station;
wherein:
(1)representing an energy consumption power of the node for a low power consumption listening state;
(2)tdutya time that is one duty cycle period;
(3)representing the energy consumption of receiving a data packet, having
Wherein epsilonrPower, epsilon, for receiving packets for nodestIndicating the power at which the node transmits the data packet, SpRepresenting the time required for transmitting the data packet; sakIndicating ACK window response duration, SrIs the preamble duration;
(4)energy consumption for sending a packet for a data packet;the calculation formula of (a) is as follows:
wherein,is the duty cycle;
(5)representing the number of data packets received by the node at distance d from the base station;
(6)representing the number of data packets sent by nodes at d from the base station;
and step 3: adding 1 to the initial relay node number δ', namely: δ ═ δ '+ 1, then calculate the initial number of relay nodes δ' by the node v after 1iEnergy consumption of
And 4, step 4: if it is notGo to step 3, where Ex0Representing the energy consumption of the nearest node to the base station;
if it is notThen δ is δ' -1, and the next step is carried out;
if E isx'＝Ex0Entering the next step without any treatment;
and 5: obtaining the number delta of relay nodes at different distances from the base station;
wherein,is calculated by the formula
Wherein epsilonsPower when the node sleeps;
represents the time taken for the node to transmit data;
represents the time taken for the node to receive the data;
the calculation formula of (a) is as follows:
whereinThe number of data packets sent by the node at the distance d from the base station is represented by the following calculation formula:
is the reliability of the link, λ is a node-aware eventThe probability of occurrence, z represents how many hops the current node is from the base station, represents rounding down; r represents the node transmission radius, and R represents the network radius; x' represents the perceived distance of the node;
success rate function of data transmission
qixRepresenting a node viAnd node vxLink quality between; v. ofxAn xth relay node representing a node; q. q.sijDenotes viAnd node vjLink quality between vj1 st, 2 nd, … th, x-1 st relay node representing a node;
the calculation formula of (a) is as follows:
wherein,the number of packets received for a node at distance d from the base station,
CN201610138014.9A 2016-03-11 2016-03-11 Data transmission scheduling method based on the relay collections such as not in wireless sensor network Expired - Fee Related CN105591684B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610138014.9A CN105591684B (en) 2016-03-11 2016-03-11 Data transmission scheduling method based on the relay collections such as not in wireless sensor network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610138014.9A CN105591684B (en) 2016-03-11 2016-03-11 Data transmission scheduling method based on the relay collections such as not in wireless sensor network

Publications (2)

Publication Number Publication Date
CN105591684A CN105591684A (en) 2016-05-18
CN105591684B true CN105591684B (en) 2018-11-30

Family

ID=55930977

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610138014.9A Expired - Fee Related CN105591684B (en) 2016-03-11 2016-03-11 Data transmission scheduling method based on the relay collections such as not in wireless sensor network

Country Status (1)

Country Link
CN (1) CN105591684B (en)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106878958B (en) * 2017-03-15 2020-11-06 中南大学 Rapid propagation method based on adjustable duty ratio in software defined wireless network
CN108712760B (en) * 2018-03-29 2019-11-19 北京邮电大学 High-throughput relay selection method based on random Learning Automata and fuzzy algorithmic approach
CN110505669A (en) * 2018-05-16 2019-11-26 中南大学 Lose the chance method for routing based on emission rate in sensitive wireless sensor network
JP2022113422A (en) * 2021-01-25 2022-08-04 シャープ株式会社 Repeater reception cycle setting method, communication system, and repeater
CN112910901B (en) * 2021-02-04 2023-09-12 百果园技术(新加坡)有限公司 Device selection method, device and storage medium

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102316546A (en) * 2011-10-02 2012-01-11 西安电子科技大学 Multipath routing method based on communication sequence
CN105120503A (en) * 2015-07-17 2015-12-02 杭州电子科技大学 High-energy-efficiency node cooperative transmission method in wireless sensor network

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8301956B2 (en) * 2008-04-07 2012-10-30 Samsung Electronics Co., Ltd. Methods and apparatus to improve communication in a relay channel

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102316546A (en) * 2011-10-02 2012-01-11 西安电子科技大学 Multipath routing method based on communication sequence
CN105120503A (en) * 2015-07-17 2015-12-02 杭州电子科技大学 High-energy-efficiency node cooperative transmission method in wireless sensor network

Also Published As

Publication number Publication date
CN105591684A (en) 2016-05-18

Similar Documents

Publication Publication Date Title
CN105591684B (en) Data transmission scheduling method based on the relay collections such as not in wireless sensor network
EP2359537B1 (en) Method for setting the operation of a routing node of an asynchronous wireless communication network, network node and communication network implementing the method
Tang et al. PW-MAC: An energy-efficient predictive-wakeup MAC protocol for wireless sensor networks
EP2131620B1 (en) Wireless sensor network with power management and with deterministic control from an access point
CN104540200B (en) Intermittent reception/transmission of mobile communication system
Tezcan et al. ART: an asymmetric and reliable transport mechanism for wireless sensor networks
US20150103707A1 (en) Method and apparatus for reducing energy consumption of radio communications in a wireless sensor network
CN103906207A (en) Wireless sensor network data transmission method based on self-adaptation required awakening technology
CN107969022B (en) Method for reducing data transmission delay by adopting dynamic duty ratio in wireless sensor network
CN105682201B (en) A kind of adaptive setting method of node duty ratio in efficient target monitoring
CN102638901A (en) Wireless sensor network self-adapting MAC (medium access control) protocol suitable for industry monitoring
Jing et al. An analytical approach to optimization of throughput for IEEE 802.15. 4 slotted CSMA/CA networks
JP4161988B2 (en) Method and station for optimizing the energy consumption of a station in a network
CN103634867B (en) Service life optimizing method for wireless sensor network under uniform deployment condition
CN105959979B (en) Frame length system adaptive recognition method in wireless sensor network based on MAC protocol
CN111417165B (en) Bluetooth Mesh energy efficiency routing method based on awakening time prediction
Restuccia et al. Performance analysis of a hierarchical discovery protocol for WSNs with Mobile Elements
CN117295143B (en) Terminal low-power-consumption data transmission method
Jin et al. Hardware-aware communication protocols in low energy wireless sensor networks
Kim et al. Performance evaluation of the RIX-MAC protocol for wireless sensor networks
CN111163426A (en) Opportunistic routing method suitable for self-adaptive duty ratio of high packet loss rate wireless sensor network
Zhao et al. An energy-efficient MAC protocol for WSNs: game-theoretic constraint optimization
KR101310890B1 (en) Traffice adaptive asynchronism transter system and method for low-power
US8009600B2 (en) Dealing with lost acknowledgements when power-saving
Afroz et al. XX-MAC and EX-MAC: Two Variants of X-MAC Protocol for Low Power Wireless Sensor Networks.

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20181130

CF01 Termination of patent right due to non-payment of annual fee