CN112615647A - Broadband power line carrier communication cross-layer resource allocation method for power internet of things concurrent mixed service - Google Patents
Broadband power line carrier communication cross-layer resource allocation method for power internet of things concurrent mixed service Download PDFInfo
- Publication number
- CN112615647A CN112615647A CN202011331561.1A CN202011331561A CN112615647A CN 112615647 A CN112615647 A CN 112615647A CN 202011331561 A CN202011331561 A CN 202011331561A CN 112615647 A CN112615647 A CN 112615647A
- Authority
- CN
- China
- Prior art keywords
- user
- users
- resource allocation
- buffer
- utility function
- 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.)
- Pending
Links
- 230000006854 communication Effects 0.000 title claims abstract description 31
- 238000004891 communication Methods 0.000 title claims abstract description 29
- 238000000034 method Methods 0.000 title claims abstract description 27
- 238000013468 resource allocation Methods 0.000 title claims abstract description 19
- 238000012163 sequencing technique Methods 0.000 claims abstract description 4
- 230000008569 process Effects 0.000 claims description 6
- 238000010586 diagram Methods 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 3
- 230000005540 biological transmission Effects 0.000 description 2
- 239000000969 carrier Substances 0.000 description 2
- 238000010276 construction Methods 0.000 description 2
- 230000003993 interaction Effects 0.000 description 2
- 238000013461 design Methods 0.000 description 1
- 238000002474 experimental method Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 230000008092 positive effect Effects 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 230000003313 weakening effect Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B3/00—Line transmission systems
- H04B3/54—Systems for transmission via power distribution lines
- H04B3/542—Systems for transmission via power distribution lines the information being in digital form
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
- H04L47/2425—Traffic characterised by specific attributes, e.g. priority or QoS for supporting services specification, e.g. SLA
- H04L47/2433—Allocation of priorities to traffic types
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/80—Actions related to the user profile or the type of traffic
- H04L47/805—QOS or priority aware
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Power Engineering (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a broadband power line carrier communication cross-layer resource allocation method for a power internet of things concurrent mixed service, which comprises the following steps of: s1, initializing data; s2, selecting the ith moment, reading the queue length of the user k in the buffer area, and acquiring the instantaneous rate of the user k; s3, judging the category of the user k, and calculating a utility function value of the user: s4, sequencing the utility function values of the users in a descending order to obtain a scheduling sequence based on the utility function values and transmitting the scheduling sequence to a physical layer, and distributing physical layer resources by the users; and S5, after the resource allocation is finished, updating the length and the rate of the queue of the buffer area, and finishing the resource scheduling of the user. And the service is dynamically prioritized according to the service QoS requirement and the current network state, so that the data packet waiting time delay and the packet loss can be effectively reduced, and the QoS requirements of more users can be met.
Description
Technical Field
The invention belongs to the technical field of communication, and particularly relates to a cross-layer resource allocation method for broadband power line carrier communication for concurrent mixed service of the power internet of things.
Background
Power Line Communication (PLC) is a special Communication method for transmitting data using a high-frequency modulation signal through a Power Line as a medium. The power line carrier communication can be divided into three types, namely a high-voltage carrier (exceeding 35Kv), a medium-voltage carrier (10Kv) and a low-voltage carrier (380V/220V) according to voltage classes. The power line carrier communication has the characteristics of natural connection of electrical equipment, flexible access of various terminal equipment and low construction cost, and is one of effective communication modes for solving the problem of information interaction in the last kilometer. The power line carrier communication technology is gradually developed into broadband power line carrier communication from traditional narrow-band communication, OFDM (orthogonal frequency division multiplexing) is one of multi-carrier modulation, parallel transmission of high-speed serial data is realized through frequency division multiplexing, and the power line carrier communication technology has better multi-path weakening resistance and can support user access. The communication speed is improved from thousands of bps to tens of megabits of bps by OFDM technique, so the communication performance is greatly improved.
The power line channel is an open shared channel, each phase is provided with an independent PLC gateway, each PLC device needs to compete for the resources of the phase on the shared power channel, the essence of the multi-user dynamic resource allocation problem is that different sub-carriers are dynamically allocated to real-time (RT) users and non-real-time (NRT) users in each OFDM symbol in real time according to the state information of the power line channel, different modulation modes are adaptively selected on the corresponding sub-carriers according to the size of channel gain, and corresponding bits are loaded according to a Shannon formula.
The electric power internet of things is an intelligent service system which provides networking services for terminals accessed to a power grid and realizes the mutual connection and man-machine interaction of everything in all links of an electric power system. In the construction of the power internet of things, the communication channel which is ready in a power system and has the widest coverage area is adopted, and the component cost of the intelligent communication network can be reduced to the greatest extent by adopting the power line carrier communication technology. With the access of a large number of intelligent sensing devices, the traditional broadband power line carrier communication resource allocation method does not consider the user QoS requirement of the mixed service and the queue condition of the MAC layer cache area, and cannot reasonably schedule users according to the flow of the mixed service, so that the allocation balance degree of different users is poor.
Therefore, in order to solve the above technical problems, it is necessary to design a cross-layer resource allocation method for broadband power line carrier communication, which can perform fast, accurate and reliable transmission, regulate and control resources in real time, and avoid network congestion.
Disclosure of Invention
The invention aims to provide a cross-layer resource allocation method for broadband power line carrier communication for concurrent mixed services of the power internet of things, which considers the user QoS requirements of the mixed services, reasonably schedules resources and has high user distribution balance.
The technical scheme of the invention is as follows:
a broadband power line carrier communication cross-layer resource allocation method for a power Internet of things concurrent mixed service comprises the following steps:
s1, initializing data, setting time i, user k and user instantaneous speed upsilonk(0) 0, queue length Q of user k in bufferk(0) 0, the set of RT users SRT {1, 2.... multidata., h }, the set of NRT users SNRT {1, 2.. multidata., l }, and the buffer data packet latency Dk(i);
S2, selecting the ith moment, and reading the queue length Q of a user k in the buffer areak(i) Obtaining the instantaneous velocity v of the user kk(i);
S3, judging the category of the user k:
s301, if the user k is an RT user, obtaining the maximum allowable time delay TkAccording to the queue length Q of the user k at the current ith momentk(i) Calculating the data packet waiting time delay D of the buffer areak(i) And the value of the utility function of the next moment i +1 of the userCalculated by the following formula:
wherein Q isk(i) Is the queue length, upsilon, of user k in the buffer at the ith timek(i) Is the instantaneous rate of user k, L is the number of bits contained in each data packet,for RT user k at the ith instant at the lowest rate to avoid data packet waiting time-outs in the buffer, Ak(i) The number of data packets arriving at the buffer area at the ith moment;
s302, if the user k is an NRT user, acquiring the maximum allowable packet lossCalculating the packet loss of the current time iAnd the value of the utility function of the next moment i +1 of the userCalculated by the following formula:
wherein,NRT user k is the lowest rate for avoiding data packet waiting timeout in the buffer at the ith moment, r is the minimum guaranteed rate of the data packet of the user k under the condition of meeting the packet loss requirement, L is the bit number contained in each data packet, B is the maximum allowable length in the buffer,for the maximum allowed packet loss for user k,in order to be able to determine the packet loss rate,is the error rate;
s4, the utility function values of h RT usersUtility function values for l NRT usersSetting a scheduling sequence of an RT user to be higher than an NRT user, sequencing the users in a descending order according to the magnitude of the utility function value to obtain a scheduling sequence based on the utility function value, transmitting the scheduling sequence at the ith moment to a physical layer, and distributing physical layer resources for the users by the physical layer according to the scheduling sequence;
s5, after the physical layer resource distribution of the step S4 is finished, updating the user k*The actually obtained velocity vk*(i) And queue length Q in the bufferk*(i) And ending the resource scheduling of the user.
In the above technical solution, after the resource scheduling in step S5, when i is equal to i +1, the process returns to step S2 to continue resource allocation for the user.
In the above technical solution, the intelligent terminal data collected in step S2 includes power consumption data, load curve data, and low-voltage meter reading data.
In the above technical solution, in the step S301, it is configured that the data packet arrival process obeys poisson distribution, and a buffer data packet waiting time delay is defined according to a first-in first-out principle, and due to a limitation of a maximum queue length in the buffer, a data packet exceeding the maximum queue length B is discarded, so that the data packet is lost, and in a power line carrier communication process, each symbol signal is interfered, so that an error phenomenon occurs, and a packet loss depends on a packet loss rateAnd error rate
The invention has the advantages and positive effects that:
1. the allocation method of the invention performs dynamic priority division on the service according to the service QoS requirement and the current network state, which not only can effectively reduce the waiting time delay and the packet loss of the data packet, but also can meet the QoS requirements of more users.
2. Compared with the traditional polling or static presetting mode, the allocation method can carry out self-adaptive adjustment according to the service QoS requirement and the waiting grouping condition of the cache region, so as to be better suitable for the concurrent mixed service scene of the power Internet of things.
Drawings
FIG. 1 is a flow chart of a resource allocation method of the present invention;
FIG. 2 is RT in example 11A packet latency-time diagram of a user;
FIG. 3 is RT in example 12A packet latency-time diagram of a user;
FIG. 4 shows NRT in example 11Packet loss-time diagram of the user;
FIG. 5 shows NRT in example 12Packet loss-time diagram for a user.
Detailed Description
The present invention will be described in further detail with reference to specific examples. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the scope of the invention in any way.
Example 1
As shown in the figure, the broadband power line carrier communication cross-layer resource allocation method for the power internet of things concurrent mixed service, provided by the invention, comprises the following steps:
s1, initializing data, setting time i, user k and user instantaneous speed upsilonk(0) 0, queue length Q of user k in bufferk(0) Set of RT users S0RTSet S of NRT users {1,2NRT1,2k(i);
S2, selecting the ith moment, and reading the queue length Q of a user k in the buffer areak(i) Obtaining the instantaneous velocity v of the user kk(i);
S3, judging the category of the user k:
s301, if the user k is an RT user, obtaining the maximum allowable time delay TkAccording to the queue length Q of the user k at the current ith momentk(i) Calculating the data packet waiting time delay D of the buffer areak(i) And the value of the utility function of the next moment i +1 of the userCalculated by the following formula:
wherein Q isk(i) Is the queue length, upsilon, of user k in the buffer at the ith timek(i) Is the instantaneous rate of user k, L is the number of bits contained in each data packet,for RT user k at the ith instant at the lowest rate to avoid data packet waiting time-outs in the buffer, Ak(i) The number of data packets arriving at the buffer area at the ith moment;
s302, if the user k is an NRT user, acquiring the maximum allowable packet lossCalculating the packet loss of the current time iAnd the value of the utility function of the next moment i +1 of the userCalculated by the following formula:
wherein,buffer avoidance at the ith time for NRT user kThe minimum rate of waiting timeout of the inner data packet, r is the minimum guaranteed rate of the data packet of the user k under the condition of meeting the packet loss requirement, L is the bit number contained in each data packet, B is the maximum allowable length in the buffer area,for the maximum allowed packet loss for user k,in order to be able to determine the packet loss rate,is the error rate;
s4, the utility function values of h RT usersUtility function values for l NRT usersSetting a scheduling sequence of an RT user to be higher than an NRT user, sequencing the users in a descending order according to the magnitude of the utility function value to obtain a scheduling sequence based on the utility function value, transmitting the scheduling sequence at the ith moment to a physical layer, and distributing physical layer resources for the users by the physical layer according to the scheduling sequence;
s5, after the physical layer resource distribution of the step S4 is finished, updating the user k*The actually obtained velocity vk*(i) And queue length Q in the bufferk*(i) And ending the resource scheduling of the user.
After the resource scheduling in step S5, when i is set to i +1, the process returns to step S2 to continue resource allocation for the user.
Further, the intelligent terminal data collected in step S2 includes power consumption data, load curve data, and low-voltage meter reading data.
Further, in the step S301, it is set that the data packet arrival process follows poisson distribution, anddefining the waiting time delay of the data packets in the buffer according to the first-in first-out principle, discarding the data packets exceeding the maximum queue length B due to the limitation of the maximum queue length in the buffer, causing the data packets to be lost, and causing the error phenomenon due to the interference of each code element signal in the power line carrier communication process, wherein the packet loss depends on the packet loss rateAnd error rate
In order to verify the effectiveness of the allocation method of the present invention, a user accessing to the broadband power line carrier communication system is taken as an example to perform analysis on a Matlab simulation platform, and the system setting parameters are as shown in table 1:
TABLE 1
The experiment comprises 2 RT users and 2 NRT users which are connected and communicated with the gateway in a PLC cascade mode, wherein the channel quality is RT from high to low1>RT2,NRT1>NRT2When the system resource is insufficient in extreme conditions, the method of the invention is respectively compared with the maximum throughput algorithm and the Gong algorithm for the RT user data packet waiting time delay and the NRT user data packet loss.
As can be seen from fig. 2-5, the maximum throughput algorithm operates on RT for a number of consecutive time instants1、NRT1Users schedule, resulting in RT2、NRT2User data packets are not processed in time, RT2User packet latency up to 12.46ms exceeds the maximum allowed latency of 10ms, while NRT2The user packet loss is up to 3.29% above the threshold 1.00%.
Although the Gong algorithm meets the delay requirement of the RT user, the algorithm schedules the NRT user by using the principle of maximum accumulative fairness deviation, which causes the NRT user to exceed the threshold, which is 2.89% and 2.67%, respectively.
The allocation method of the invention can meet the RT requirement under the condition of insufficient system resources in extreme cases1、RT2Delay requirements of users, while NRT users exceed the packet loss threshold only at certain break moments, where NRT1、NRT2Has an average packet loss of not more than 1.00% of the threshold value, NRT, of 0.89% and 0.92%, respectively2The packet loss of the algorithm is reduced by 72.04% and 65.54% compared with the maximum throughput algorithm and the Gong algorithm respectively.
The invention has been described in an illustrative manner, and it is to be understood that any simple variations, modifications or other equivalent changes which can be made by one skilled in the art without departing from the spirit of the invention fall within the scope of the invention.
Claims (4)
1. A broadband power line carrier communication cross-layer resource allocation method for a power Internet of things concurrent mixed service is characterized by comprising the following steps:
s1, initializing data, setting time i, user k and user instantaneous speed upsilonk(0) 0, queue length Q of user k in bufferk(0) Set of RT users S0RTSet S of NRT users {1,2NRT1,2k(i);
S2, selecting the ith moment, and reading the queue length Q of a user k in the buffer areak(i) Obtaining the instantaneous velocity v of the user kk(i);
S3, judging the category of the user k:
s301, if the user k is an RT user, obtaining the maximum allowable time delay TkAccording to the queue length Q of the user k at the current ith momentk(i) Calculating the data packet waiting time delay D of the buffer areak(i) And the value of the utility function of the next moment i +1 of the userCalculated by the following formula:
wherein Q isk(i) Is the queue length, upsilon, of user k in the buffer at the ith timek(i) Is the instantaneous rate of user k, L is the number of bits contained in each data packet,for RT user k at the ith instant at the lowest rate to avoid data packet waiting time-outs in the buffer, Ak(i) The number of data packets arriving at the buffer area at the ith moment;
s302, if the user k is an NRT user, acquiring the maximum allowable packet lossCalculating the packet loss of the current time iAnd the value of the utility function of the next moment i +1 of the userCalculated by the following formula:
wherein,NRT user k is the lowest rate for avoiding data packet waiting timeout in the buffer at the ith moment, r is the minimum guaranteed rate of the data packet of the user k under the condition of meeting the packet loss requirement, L is the bit number contained in each data packet, B is the maximum allowable length in the buffer,for the maximum allowed packet loss for user k,in order to be able to determine the packet loss rate,is the error rate;
s4, the utility function values of h RT usersUtility function values for l NRT usersSetting the RT user scheduling sequence to be higher than the NRT user, sequencing the users in a descending order according to the magnitude of the utility function value to obtain a scheduling sequence based on the utility function value, transmitting the scheduling sequence at the ith moment to a physical layer,the physical layer distributes physical layer resources for the users according to the scheduling sequence;
s5, after the physical layer resource distribution of the step S4 is finished, updating the user k*The actually obtained velocity vk*(i) And queue length Q in the bufferk*(i) And ending the resource scheduling of the user.
2. The method for cross-layer resource allocation in broadband power line carrier communication according to claim 1, wherein: after the resource scheduling in step S5, when i is set to i +1, the process returns to step S2 to continue resource allocation for the user.
3. The method for cross-layer resource allocation in broadband power line carrier communication according to claim 1, wherein: the intelligent terminal data collected in the step S2 includes power consumption data, load curve data, and low-voltage meter reading data.
4. The method for cross-layer resource allocation in broadband power line carrier communication according to claim 1, wherein: in step S301, it is set that the data packet arrival process follows poisson distribution and follows the first-in first-out principle.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202011331561.1A CN112615647A (en) | 2020-11-24 | 2020-11-24 | Broadband power line carrier communication cross-layer resource allocation method for power internet of things concurrent mixed service |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202011331561.1A CN112615647A (en) | 2020-11-24 | 2020-11-24 | Broadband power line carrier communication cross-layer resource allocation method for power internet of things concurrent mixed service |
Publications (1)
Publication Number | Publication Date |
---|---|
CN112615647A true CN112615647A (en) | 2021-04-06 |
Family
ID=75225073
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202011331561.1A Pending CN112615647A (en) | 2020-11-24 | 2020-11-24 | Broadband power line carrier communication cross-layer resource allocation method for power internet of things concurrent mixed service |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN112615647A (en) |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20130135996A1 (en) * | 2011-11-29 | 2013-05-30 | Hughes Networks Systems, Llc | Method and system for traffic management and resource allocation on a shared access network |
CN103619069A (en) * | 2013-12-09 | 2014-03-05 | 华北电力大学 | Broadband power line communication cross-layer resource allocation method with prior hybrid service emergency degree |
-
2020
- 2020-11-24 CN CN202011331561.1A patent/CN112615647A/en active Pending
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20130135996A1 (en) * | 2011-11-29 | 2013-05-30 | Hughes Networks Systems, Llc | Method and system for traffic management and resource allocation on a shared access network |
CN103619069A (en) * | 2013-12-09 | 2014-03-05 | 华北电力大学 | Broadband power line communication cross-layer resource allocation method with prior hybrid service emergency degree |
Non-Patent Citations (1)
Title |
---|
杨挺等: "面向并发多业务的宽带电力线载波通信跨层资源分配算法研究", 《电网技术》 * |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP3454405B2 (en) | Data communication system and data communication method | |
CN102014500B (en) | Method for efficiently allocating bandwidths in wireless access network | |
CN106954232B (en) | Time delay optimized resource allocation method | |
CN113746677B (en) | 5G new air interface-oriented network intra-slice resource allocation method | |
CN112636787A (en) | Broadband power line carrier communication physical layer resource slicing method and device for concurrent multi-service of power internet of things | |
EP4057768A1 (en) | Transmission rate configuration method and apparatus | |
CN112615647A (en) | Broadband power line carrier communication cross-layer resource allocation method for power internet of things concurrent mixed service | |
Lu et al. | Contention window adaptive adjustment strategy for fairness in multi-rate IEEE 802.11 network | |
Einhaus et al. | Performance evaluation of a basic OFDMA scheduling algorithm for packet data transmissions | |
Vijay et al. | Quality of Service Improvements in IEEE 802.11 AX Wi-Fi | |
Abdelbari et al. | An opportunistic user scheduling scheme for ultra-dense wireless networks | |
Huang et al. | Research on dynamic bandwidth allocation algorithm in bluetooth piconet based on multipriority | |
Shuaibu et al. | A Cross Layer Approach for Packet Scheduling at Downlink of WiMAX IEEE802. 16e | |
Taghipoor et al. | Scheduling Algorithm and Bandwidth Allocation in WiMAX | |
Pei et al. | Adaptive Cross-layer Scheduling and Dynamic Subcarrier Allocation Algorithm Based on Service-differentiation in Multiuser OFDMA System | |
Perera et al. | FPGA based Implementation of IEEE 802.11 p/WAVE Protocol and Performance Evaluation | |
Twu et al. | Adaptive control strategy for the multi-layer collision resolution protocol | |
Einhaus et al. | Simulative mac level performance evaluation of an ofdma system under the consideration of frequency correlated fading | |
Makara et al. | Downlink packet scheduling for variable bitrate traffic in LTE Networks | |
Jiang | Multi-user Space-Time Modulation Scheme for Ultra Reliable Low Delay Communication | |
Qian et al. | Cross-layer Resource Allocation on Broadband Power Line Based on Novel QoS-priority Scheduling Function in MAC Layer | |
Vishalakshi et al. | Highest urgency first scheduling adapted in ieee 802.11 n to support quality of service | |
Zhang et al. | Cross-Layer Dynamic Subcarrier Allocation with Adaptive Service Rate Control in SC-FDMA System | |
Ye et al. | Cross-layer Dynamic Subcarrier Allocation with Adaptive Service Rate Control in SC-FDMA System | |
Sun et al. | Dynamic subcarrier allocation for real-time traffic over multiuser OFDM systems |
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 | ||
RJ01 | Rejection of invention patent application after publication | ||
RJ01 | Rejection of invention patent application after publication |
Application publication date: 20210406 |