CN111148177A - Energy capture network relay selection method based on double cache queues - Google Patents

Energy capture network relay selection method based on double cache queues Download PDF

Info

Publication number
CN111148177A
CN111148177A CN201911291972.XA CN201911291972A CN111148177A CN 111148177 A CN111148177 A CN 111148177A CN 201911291972 A CN201911291972 A CN 201911291972A CN 111148177 A CN111148177 A CN 111148177A
Authority
CN
China
Prior art keywords
data packet
relay node
relay
node
energy
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.)
Granted
Application number
CN201911291972.XA
Other languages
Chinese (zh)
Other versions
CN111148177B (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.)
Zhejiang University of Technology ZJUT
Original Assignee
Zhejiang University of Technology ZJUT
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 Zhejiang University of Technology ZJUT filed Critical Zhejiang University of Technology ZJUT
Priority to CN201911291972.XA priority Critical patent/CN111148177B/en
Publication of CN111148177A publication Critical patent/CN111148177A/en
Application granted granted Critical
Publication of CN111148177B publication Critical patent/CN111148177B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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
    • 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/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
    • 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

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

一种双缓存队列的能量捕获网络中继节点选择方法，通过分析源节点和中继节点中数据包的平均时延选择合适的中继节点；通过分析系统中数据包的转移状态，得出状态转移平衡方程，求出稳态时的数据包状态概率，从而得到数据包在系统中的平均时延。与传统的射频能量捕获网络的中继选择方法相比，本发明主要是从数据量的大小、数据包到达速率、以及数据包服从泊松分布这几个方面来考虑降低系统时延，提高网络的传输速度。A method for selecting relay nodes in an energy capture network with double-buffered queues, selecting appropriate relay nodes by analyzing the average delay of data packets in source nodes and relay nodes; by analyzing the transition state of data packets in the system, the state Transfer the balance equation to obtain the packet state probability at steady state, thereby obtaining the average delay of the packet in the system. Compared with the traditional relay selection method of radio frequency energy capture network, the present invention mainly considers reducing the system delay and improving the network from the aspects of the size of the data amount, the arrival rate of the data packet and the Poisson distribution of the data packet. transmission speed.

Description

Energy capture network relay selection method based on double cache queues
Technical Field
The invention belongs to the technical field of energy capture wireless sensor networks, and relates to a relay selection method for an energy capture network with double buffer queues.
Background
In the research of the radio frequency energy capture network, the selection of the relay node is an important problem. Since in a multipath environment the radio frequency signal strength decays at a rate that is more than the power of 2 times the propagation distance. If the distance between the sender and the receiver is large, the signal intensity will be rapidly attenuated, so that the error rate is increased, and the packet loss number is increased. This requires increased transmit power or retransmission of the data packet to deliver the data packet to the receiver, which increases the power consumption of the network.
To overcome this phenomenon, it is feasible to add a relay node between the rf transmitter and receiver for forwarding information. Existing research mainly selects a suitable relay node according to the energy captured by the relay node and the energy consumed by forwarding a data packet, and does not consider the characteristics of the data packet. Such as the size of the data volume, the packet arrival rate, and what distribution is obeyed.
Disclosure of Invention
In order to overcome the defects in the prior art, the invention provides a double-cache queue-based energy capture network relay selection method, which aims to obtain the queuing time delay of the whole system so as to select the optimal relay, analyzes the state transition conditions of a source node and a relay node cache queue in the system according to a double-cache queue model on the basis, obtains the state probability in a steady state, and provides a double-cache queue-based relay selection algorithm according to the queuing time delay of the system. The data packet arrival source node and the relay node are considered to be two Poisson distributions in the double buffer queues, and queuing delay of the two buffer queues is analyzed according to the energy capture capacity of the relay node and the energy consumption of the forwarded data packet, so that a proper relay node is selected; compared with the traditional relay selection method of the radio frequency energy capture network, the method mainly considers the aspects of the size of data volume, the arrival rate of data packets and the poisson distribution of the data packet to reduce the system delay.
The technical scheme adopted by the invention is as follows:
a relay selection method of an energy capture network based on double buffer queues comprises the following steps:
step 1: data packets at an average rate λ1Arrives at the source node, which is at the forwarding rate μ1nArriving at the relay node, the relay node forwards at a rate mu2nForwarding the data packet to the destination node with an energy at an average rate of lambda2The poisson distribution reaches an energy buffer queue of the relay node;
step 2: calculating the forwarding rate of the data packet at the source node
Figure BDA0002319357370000011
psThe transmit power for the data packet of the source node,
Figure BDA0002319357370000021
hnas a source node and a relay node RnChannel gain of between, delta2Is noise;
and step 3: calculating the energy captured by the relay node as
Figure BDA0002319357370000022
ηnIndicating the efficiency with which the nth relay captures energy,
Figure BDA0002319357370000023
representing the acquisition power, τ, of the relay nodeiRepresenting the time required to capture energy;
and 4, step 4: calculating a relay node forwarding rate of
Figure BDA0002319357370000024
gnChannel gain between the relay node and the destination node;
and 5: solving the state of the data packet when the system reaches the steady state
Figure BDA0002319357370000025
QI(i) Indicating the number of data packets in the buffer queue of the ith time slot of the source node,
Figure BDA0002319357370000026
respectively representing the number of data packets in the ith time slot buffer queue of the nth relay node;
step 6: according to the high green of the steady state data packet state, the average queue length of the data packet in the system is obtained
Figure BDA0002319357370000027
And 7: calculating the average time delay of the data packets in the system:
Figure BDA0002319357370000028
and 8: and selecting the relay node with the least time consumption as the most suitable relay node according to the time delay of the data packet in the system.
The invention has the beneficial effects that: the system time delay is reduced and the transmission speed of the network is improved in the aspects of the size of data volume, the arrival rate of data packets and the Poisson distribution of data packet service.
Drawings
FIG. 1 is a model of a dual queue cache relay selection system based on energy capture;
Detailed Description
The invention is further described below with reference to the accompanying drawings.
Referring to fig. 1, a network relay selection method based on dual-queue buffer energy capture includes the following steps:
step 1: data packets at an average rate λ1Arrives at the source node, which is at the forwarding rate μ1nArriving at the relay node, the relay node forwards at a rate mu2nForwarding the data packet to the destination node with an energy at an average rate of lambda2The poisson distribution reaches an energy buffer queue of the relay node;
step 2: and calculating the forwarding rate of the data packet at the source node. Since the forwarding rate of a source node is related to the quality of its channel, there are, according to the shannon formula
Figure BDA0002319357370000029
psThe transmit power for the data packet of the source node,
Figure BDA00023193573700000210
hnas a source node and a relay node RnChannel gain of between, delta2Is noise;
and step 3: in the calculationThe energy captured by the relay node is
Figure BDA00023193573700000211
ηnIndicating the efficiency with which the nth relay captures energy,
Figure BDA0002319357370000031
representing the acquisition power, τ, of the relay nodeiRepresenting the time required to capture energy;
and 4, step 4: and calculating the forwarding rate of the relay node. The power forwarded by the relay node is
Figure BDA0002319357370000032
According to the formula of Shannon, there are
Figure BDA0002319357370000033
gnChannel gain between the relay node and the destination node;
and 5: solving the state probability of the data packet when the system reaches the steady state:
Figure BDA0002319357370000034
QI(i) indicating the number of data packets in the buffer queue of the ith time slot of the source node,
Figure BDA0002319357370000035
respectively representing the number of data packets in the ith time slot buffer queue of the nth relay node, and according to the queuing theory, Q is arranged in the source node queueI(i) State probability of each packet:
Figure BDA0002319357370000036
similarly, the relay node queue has
Figure BDA0002319357370000037
State probability of each packet:
Figure BDA0002319357370000038
since the two queues are independent of each other, so
Figure BDA0002319357370000039
Namely, it is
Figure BDA00023193573700000310
Step 6, calculating the average queue length of the data packet in the system according to the state probability of the steady-state data packet
Figure BDA00023193573700000311
And 7: calculating the average time delay of the data packets in the system:
Figure BDA00023193573700000312
and 8: and selecting the relay node with the least time consumption as the most suitable relay node according to the time delay of the data packet in the system.

Claims (1)

1. A relay selection method of an energy capture network based on a double-buffer queue is characterized by comprising the following steps:
step 1: data packets at an average rate λ1Arrives at the source node, which is at the forwarding rate μ1nArriving at the relay node, the relay node forwards at a rate mu2nForwarding the data packet to the destination node with an energy at an average rate of lambda2The poisson distribution reaches an energy buffer queue of the relay node;
step 2: calculating the forwarding rate of the data packet at the source node
Figure FDA0002319357360000011
psThe transmit power for the data packet of the source node,
Figure FDA0002319357360000012
hnas a source node and a relay node RnChannel gain of between, delta2Is noise;
and step 3: computing energy captured by a relay nodeIs composed of
Figure FDA0002319357360000013
ηnIndicating the efficiency with which the nth relay captures energy,
Figure FDA0002319357360000014
representing the acquisition power, τ, of the relay nodeiRepresenting the time required to capture energy;
and 4, step 4: calculating a relay node forwarding rate of
Figure FDA0002319357360000015
gnChannel gain between the relay node and the destination node;
and 5: solving the state probability of the data packet when the system reaches the steady state
Figure FDA0002319357360000016
QI(i) Indicating the number of data packets in the buffer queue of the ith time slot of the source node,
Figure FDA0002319357360000017
respectively representing the number of data packets in the ith time slot buffer queue of the nth relay node;
step 6: solving the average queue length of the data packet in the system according to the state probability of the steady-state data packet
Figure FDA0002319357360000018
And 7: calculating the average time delay of data packet in system
Figure FDA0002319357360000019
And 8: and selecting the relay node with the least time consumption as the most suitable relay node according to the time delay of the data packet in the system.
CN201911291972.XA 2019-12-16 2019-12-16 Energy capture network relay selection method based on double cache queues Active CN111148177B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911291972.XA CN111148177B (en) 2019-12-16 2019-12-16 Energy capture network relay selection method based on double cache queues

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911291972.XA CN111148177B (en) 2019-12-16 2019-12-16 Energy capture network relay selection method based on double cache queues

Publications (2)

Publication Number Publication Date
CN111148177A true CN111148177A (en) 2020-05-12
CN111148177B CN111148177B (en) 2021-06-18

Family

ID=70518367

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911291972.XA Active CN111148177B (en) 2019-12-16 2019-12-16 Energy capture network relay selection method based on double cache queues

Country Status (1)

Country Link
CN (1) CN111148177B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113630807A (en) * 2021-07-21 2021-11-09 西北工业大学 Intelligent scheduling method for caching and communication resources of single relay of Internet of things
CN114300082A (en) * 2022-03-14 2022-04-08 四川大学华西医院 Information processing method and device and computer readable storage medium

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101854695A (en) * 2010-06-12 2010-10-06 苏州联科盛世科技有限公司 Method for determining routing of wireless sensor network based on energy and delay ant colony optimization
CN106102117A (en) * 2016-06-13 2016-11-09 西安交通大学 Double bounce has safe transmission method based on energy harvesting in buffer network
CN107333315A (en) * 2017-07-14 2017-11-07 广西师范大学 The cooperation transmission method and system of bandwidth are shared in EH collection of energy collaborative networks
US20180083739A1 (en) * 2016-09-21 2018-03-22 Kabushiki Kaisha Toshiba Communication device, non-transitory computer readable medium and wireless communication system
US20180167864A1 (en) * 2016-12-14 2018-06-14 The Boeing Company Multi-hop networking protocol for wide-area energy harvesting sensor network deployments
US10361596B1 (en) * 2018-08-29 2019-07-23 King Fahd University Of Petroleum And Minerals Protocol, method and system for simultaneous wireless information and power transfer relaying network

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101854695A (en) * 2010-06-12 2010-10-06 苏州联科盛世科技有限公司 Method for determining routing of wireless sensor network based on energy and delay ant colony optimization
CN106102117A (en) * 2016-06-13 2016-11-09 西安交通大学 Double bounce has safe transmission method based on energy harvesting in buffer network
US20180083739A1 (en) * 2016-09-21 2018-03-22 Kabushiki Kaisha Toshiba Communication device, non-transitory computer readable medium and wireless communication system
US20180167864A1 (en) * 2016-12-14 2018-06-14 The Boeing Company Multi-hop networking protocol for wide-area energy harvesting sensor network deployments
CA2982637A1 (en) * 2016-12-14 2018-06-14 The Boeing Company A multi-hop networking protocol for wide-area energy harvesting sensor network deployments
CN107333315A (en) * 2017-07-14 2017-11-07 广西师范大学 The cooperation transmission method and system of bandwidth are shared in EH collection of energy collaborative networks
US10361596B1 (en) * 2018-08-29 2019-07-23 King Fahd University Of Petroleum And Minerals Protocol, method and system for simultaneous wireless information and power transfer relaying network

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
SHENG LUO;KAH CHAN TEH: "Buffer State Based Relay Selection for Buffer-Aided Cooperative Relaying Systems", 《IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 》 *
YUAN WU;LIPING QIAN;XUEMIN SHERMAN SHEN: "Optimal relay selection and power control for energy-harvesting wireless relay networks", 《2017 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC)》 *

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113630807A (en) * 2021-07-21 2021-11-09 西北工业大学 Intelligent scheduling method for caching and communication resources of single relay of Internet of things
CN113630807B (en) * 2021-07-21 2024-02-27 西北工业大学 Caching and communication resource intelligent scheduling method for single relay of Internet of things
CN114300082A (en) * 2022-03-14 2022-04-08 四川大学华西医院 Information processing method and device and computer readable storage medium
CN114300082B (en) * 2022-03-14 2022-06-10 四川大学华西医院 An information processing method, apparatus and computer-readable storage medium

Also Published As

Publication number Publication date
CN111148177B (en) 2021-06-18

Similar Documents

Publication Publication Date Title
CN104010289B (en) The communication means that a kind of wireless self-networking neighbor node is mutually found
CN106851727B (en) A Method of Implementing Congestion Control in Ad Hoc Network Based on Multipath Routing Protocol
CN105120503B (en) A kind of high energy efficiency node cooperation transmission method in wireless sensor network
CN111148177B (en) Energy capture network relay selection method based on double cache queues
CN103118413B (en) A kind of IPv6 industrial wireless sensor network method for routing based on deterministic schedule
CN108495338B (en) Cross-layer routing protocol implementation method applied to TDMA ad hoc network
CN104935524B (en) The soft load-balancing method that a kind of multipath network is controlled based on chain-circuit time delay
CN107566275A (en) Multi-path transmission method based on the delay inequality opposite sex in data center network
CN104486040B (en) High efficient coding perception route method based on cache management
CN103078793B (en) The directed diffusion routing protocol of improvement of coding Network Based
Chen et al. On the adaptive AoI-aware buffer-aided transmission scheme for NOMA networks
CN112020118B (en) Wireless ad hoc network communication method with ultra-multi-hop and low time delay
CN104009916B (en) Delay Tolerant Network energy-efficient routing scheme based on social property forwarding
CN108135020A (en) A kind of wireless sensor network opportunistic routing protocol design method based on network code
CN110267321B (en) Design method of greedy multicast routing protocol in 3D scene
CN105392152B (en) A Data Forwarding Method for Evaluating Selfish Node Reputation
CN102118312A (en) Hierarchical Ad hoc on-demand distance vector (AODV) routing method
CN110868727A (en) Optimization method of data transmission delay in wireless sensor network
CN110336709A (en) A Performance Evaluation Model of MPTCP Incast Based on Queuing Network
CN103067294A (en) Method for order-maintaining data flow equilibrium processing in multi-next-hop transmitting router based on flow
CN101964747B (en) Two-stage exchanging structure working method based on preposed feedback
CN106130902A (en) A kind of optimization method of the algorithm that floods for Glossy mechanism
CN117956586A (en) A reinforcement learning-based adaptive transmission power allocation method for delay-sensitive networks
CN115412506B (en) Elephant flow identification and scheduling method in data center network
CN107171973B (en) Two-stage exchange structure implementation method based on adjacent port scheduling information

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