CN110913468B - Energy saving transmission method based on pre-caching - Google Patents

Energy saving transmission method based on pre-caching Download PDF

Info

Publication number
CN110913468B
CN110913468B CN201911240480.8A CN201911240480A CN110913468B CN 110913468 B CN110913468 B CN 110913468B CN 201911240480 A CN201911240480 A CN 201911240480A CN 110913468 B CN110913468 B CN 110913468B
Authority
CN
China
Prior art keywords
data
base station
curve
departure curve
opt
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
Application number
CN201911240480.8A
Other languages
Chinese (zh)
Other versions
CN110913468A (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.)
Hefei Minglong Electronic Technology Co ltd
Original Assignee
Jinling Institute of Technology
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 Jinling Institute of Technology filed Critical Jinling Institute of Technology
Priority to CN201911240480.8A priority Critical patent/CN110913468B/en
Publication of CN110913468A publication Critical patent/CN110913468A/en
Application granted granted Critical
Publication of CN110913468B publication Critical patent/CN110913468B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/02—Power saving arrangements
    • H04W52/0203—Power saving arrangements in the radio access network or backbone network of wireless communication networks
    • H04W52/0206—Power saving arrangements in the radio access network or backbone network of wireless communication networks in access points, e.g. base stations
    • 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 an energy saving transmission method based on pre-caching, which comprises the steps of initializing parameters, wherein the parameters comprise the number of data packets to be transmitted, the size of each data packet, the starting transmission time, the ending transmission time, the minimum transmission rate, the total transmission time length of a system and the memory size of a small base station; then, designing a minimum data departure curve and a maximum data departure curve of the main base station by utilizing the minimum transmission rate of each data packet and the memory size of the small base station, wherein the optimal data departure curve of the main base station is between the minimum data departure curve and the maximum data departure curve; and finally, recursively calculating the optimal data departure curve based on the pre-cached main base station by taking the starting transmission time of the first data packet as a starting point and the end point of the minimum data departure curve as an end point. The invention designs the transmission algorithm of the main base station by utilizing the pre-caching strategy, and can effectively reduce the energy consumption of the system compared with the real-time transmission without a memory.

Description

Energy saving transmission method based on pre-caching
Technical Field
The invention relates to an energy saving transmission method based on pre-caching, which can be applied to heterogeneous wireless networks and belongs to the wireless communication technology.
Background
With the wide application of more and more smart phones and internet of things, more comfortable content experience and high-quality video service are provided for users, wireless traffic is experiencing unprecedented growth, and great challenges are brought to service providers.
The request content of the user is predicted in advance through a pre-caching strategy, the request content is stored in a small base station or user equipment which is closer to the user and has the capacity in advance in a low peak period, and the stored request content can be directly sent to each user through the small base station in the peak period when the user requests the content, so that the energy consumption of a main base station can be remarkably reduced. In the process, some data do not need to be transmitted in real time by the main base station, so that a large amount of energy is saved, and meanwhile, the user service experience in the peak period or in the poor channel condition is ensured.
Disclosure of Invention
The invention aims to: in order to overcome the defects in the prior art, the invention provides an energy-saving transmission method based on pre-caching, which is designed by utilizing a data minimum departure curve and a data maximum departure curve of transmitted data on the basis of a known user scheduling method.
The technical scheme is as follows: in order to achieve the above purpose, the invention adopts the following technical scheme:
an energy saving transmission method based on pre-caching is applied to a heterogeneous wireless network; the main base station sends the data packet request of the user to the small base station with a memory, and the small base station sends the data packet request to each user in a time division multiplexing mode; on the premise of meeting the requirements of the transmission rate and the transmission delay of the user data packet, the energy consumption of the main base station is minimized; firstly, initializing parameters, wherein the parameters comprise the number of data packets to be transmitted, the size of each data packet, the starting transmission time of each data packet, the ending transmission time of each data packet, the minimum transmission rate of each data packet, the total transmission time length of a system and the memory size of a small base station; then, designing a minimum data departure curve and a maximum data departure curve of the main base station by utilizing the minimum transmission rate of each data packet and the memory size of the small base station, wherein the optimal data departure curve of the main base station is between the minimum data departure curve and the maximum data departure curve; and finally, recursively calculating the optimal data departure curve based on the pre-cached main base station by taking the starting transmission time of the first data packet as a starting point and the end point of the minimum data departure curve as an end point. The method specifically comprises the following steps:
step one: parameter initialization
Setting the total transmission time length as T, the number of data packets to be transmitted as N, and the memory size of the small base station as C; the time for the ith packet to start transmission is s i The time for ending transmission of the ith packet is s i+1 The transmission time slot of the ith data packet is t i ＝s i+1 -s i The minimum transmission rate of the ith data packet is d i The transmission rate of the main base station is r i The small base station transmits the ith data packet to the user in the ith time slot;
step two: problem formation initialization
Calculating a minimum data departure curve of a master base stationMaximum data departure curve, set main base station at s 1 From moment to s n+1 N data packets are transmitted in total between moments, and the minimum data departure curve is
Figure GDA0004202574720000021
Maximum data departure curve is
Figure GDA0004202574720000022
Optimal data departure curve D of main base station opt (s i ) Between the minimum data departure curve and the maximum data departure curve, the total energy consumption of the main base station in the respective transmission time slot is +.>
Figure GDA0004202574720000023
Step three: energy saving transmission algorithm
Establishing a horizontal axis representation time s i The vertical axis represents a two-dimensional rectangular coordinate system of the transmitted data quantity (the transmitted data quantity divided by the transmitted time length is the transmission rate), and the minimum data departure curve A(s) is drawn in the two-dimensional rectangular coordinate system i ) And a maximum data departure curve B (s i ) Based on A (s i ) And B(s) i ) Recursively calculating the optimal data departure curve D opt (s i ). The method specifically comprises the following steps:
step1: establishing a horizontal axis representation time s i The vertical axis represents a two-dimensional rectangular coordinate system of the transmitted data quantity, in which a minimum data departure curve a (s i ) And a maximum data departure curve B (s i ) Based on A (s i ) And B(s) i ) Drawing an optimal data departure curve D opt (s i ) The method comprises the steps of carrying out a first treatment on the surface of the Initializing i=1, s i ＝0，D opt (s i )＝0；
Step2: setting the starting point as(s) i ,D opt (s i ))；
Step3: respectively connecting the start point and the minimum data departure curve point (s i+1 ,A(s i+1 ) Maximum data departure curve point(s) i+1 ,B(s i+1 ) For calculating two line segmentsSlope r 1 A And r 1 B ，r 1 A And r 1 B Respectively representing the minimum sending rate and the maximum sending rate of the time slot main base station; order the
Figure GDA0004202574720000031
There is->
Figure GDA0004202574720000032
Step4: respectively connecting the starting point and(s) i+2 ,A(s i+2 ))、(s i+2 ,B(s i+2 ) Calculating the slopes of the two line segments as
Figure GDA0004202574720000033
And->
Figure GDA0004202574720000034
Four cases are discussed:
(1) if it is
Figure GDA0004202574720000035
The optimal transmission curve Do pt (s i ) At s i Time of day
Figure GDA0004202574720000036
Corresponding data departure curve intersection (maximum data departure curve) [ s ] i ,s i+1 ]The optimal transmission rate in the time period is +.>
Figure GDA0004202574720000037
i=i+1; in(s) i ,B(s i ) Step 3) as a starting point;
Figure GDA0004202574720000038
the optimal transmission curve Do pt (s i ) At s i Time of day
Figure GDA0004202574720000039
Corresponding data-exit curves intersect (minimum data-exit curve) [ s ] i ,s i+1 ]The optimal transmission rate in the time period is +.>
Figure GDA00042025747200000310
i=i+1; in(s) i ,A(s i ) Step 3) as a starting point;
Figure GDA00042025747200000311
passes through the starting point and has a slope of
Figure GDA00042025747200000312
Straight line s and straight line s of (2) i+2 The point of intersection is marked->
Figure GDA00042025747200000313
Limited [ s ] i ,s i+1 ]And [ s ] i ,s i+2 ]The optimal transmission rate for both time slots is +.>
Figure GDA00042025747200000314
Within the range, and r opt (t i+1 )＝r opt (t i+2 ) Time point s i+2 The corresponding points on the maximum data departure curve and the minimum data departure curve are +.>
Figure GDA00042025747200000315
And->
Figure GDA00042025747200000316
Updating the minimum data departure curve point and the maximum data departure curve at a time point s i+2 The values of the values are +.>
Figure GDA00042025747200000317
And->
Figure GDA00042025747200000318
i=i+1, step4 is performed; />
Figure GDA00042025747200000319
Passes through the starting point and has a slope r 1 A Straight line s and straight line s of (2) i+2 The point of intersection is noted as
Figure GDA00042025747200000320
Limited [ s ] i ,s i+1 ]And [ s ] i ,s i+2 ]The optimal transmission rate for both time slots is +.>
Figure GDA00042025747200000321
Within the range, and r opt (t i+1 )＝r opt (t i+2 ) Time point s i+2 The corresponding points on the maximum data departure curve and the minimum data departure curve are +.>
Figure GDA00042025747200000322
And->
Figure GDA00042025747200000323
Updating the minimum data departure curve point and the maximum data departure curve at a time point s i+2 The values of the values are +.>
Figure GDA00042025747200000324
And->
Figure GDA00042025747200000325
i=i+1, step4 is performed;
step5: if i+2=n, stopping recursion iteration to obtain an energy-saving optimal transmission curve D opt (s i ) And an optimal transmission rate r opt ＝{r opt (t 1 ),r opt (t 2 ),...,r opt (t N )}。
The data departure curve characterizes the relationship between the transmission data, also called the cumulative data point, which is the sum of the data points that complete transmission during the transmission time, and the transmission time; the size of a data packet is expressed in terms of the total number of data points it contains.
The beneficial effects are that: the pre-cache-based energy-saving transmission method provided by the invention is simple and feasible, and can obtain the optimal data departure curve of the main base station by utilizing the minimum data departure curve and the maximum data departure curve of the data to be transmitted under the condition of meeting the minimum rate request and the time delay of the user, so that the energy consumption of the main base station is smaller. The invention designs the transmission algorithm of the main base station by utilizing the pre-caching strategy, and can effectively reduce the energy consumption of the system compared with the real-time transmission without a memory.
Drawings
Fig. 1 shows 4 cases in Step4: 1 (a) is case (1), 1 (b) is case (2), 1 (c) is case (3), and 1 (d) is case (4);
fig. 2 is a comparison of energy consumption of the algorithm proposed in the present invention and the real-time transmission algorithm without buffer.
Detailed Description
The invention will be further described with reference to the accompanying drawings.
The energy saving transmission method based on pre-cache is applied to heterogeneous wireless network, the main base station sends the data packet request of the user to the small base station with a memory, and the small base station sends the data packet request to each user in a time division multiplexing mode; on the premise of meeting the requirements of the transmission rate and the transmission delay of the user data packet, the energy consumption of the main base station is minimized. The method specifically comprises the following steps:
step one: parameter initialization
Setting the total transmission time length as T, the number of data packets to be transmitted as N, and the memory size of the small base station as C; the time for the ith packet to start transmission is s i The time for ending transmission of the ith packet is s i+1 The transmission time slot of the ith data packet is t i ＝s i+1 -s i The minimum transmission rate of the ith data packet is d i The transmission rate of the main base station is r i The small base station transmits the ith data packet to the user in the ith time slot;
step two: problem formation initialization
Calculating a minimum data departure curve and a maximum data departure curve of the main base station, and setting the main base station to s 1 From moment to s n+1 N data packets are transmitted in total between moments, and the minimum data departure curve is
Figure GDA0004202574720000041
Maximum data departure curve is
Figure GDA0004202574720000051
Optimal data departure curve D of main base station opt (s i ) Between the minimum data departure curve and the maximum data departure curve, the total energy consumption of the main base station in the respective transmission time slot is +.>
Figure GDA0004202574720000052
Step three: energy saving transmission algorithm
Step1: establishing a horizontal axis representation time s i The vertical axis represents a two-dimensional rectangular coordinate system of the transmitted data quantity (the transmitted data quantity divided by the transmitted time length is the transmission rate), and the minimum data departure curve A(s) is drawn in the two-dimensional rectangular coordinate system i ) And a maximum data departure curve B (s i ) Based on A (s i ) And B(s) i ) Drawing an optimal data departure curve D opt (s i ) The method comprises the steps of carrying out a first treatment on the surface of the Initializing i=1, s i ＝0，Do pt (s i )＝0；
Step2: setting the starting point as(s) i ,D opt (s i ))；
Step3: respectively connecting the start point and the minimum data departure curve point (s i+1 ,A(s i+1 ) Maximum data departure curve point(s) i+1 ,B(s i+1 ) Calculating the slopes of the two line segments as
Figure GDA0004202574720000053
And->
Figure GDA0004202574720000054
And->
Figure GDA0004202574720000055
Respectively representing the minimum sending rate and the maximum sending rate of the time slot main base station; let->
Figure GDA0004202574720000056
There is->
Figure GDA0004202574720000057
Step4: respectively connecting the starting point and(s) i+2 ,A(s i+2 ))、(s i+2 ,B(s i+2 ) Calculating the slopes of the two line segments as
Figure GDA0004202574720000058
And->
Figure GDA0004202574720000059
As shown in fig. 1, four cases are discussed:
(1) if it is
Figure GDA00042025747200000510
The optimal transmission curve Do pt (s i ) At s i Time of day
Figure GDA00042025747200000511
Corresponding data departure curve intersection (maximum data departure curve) [ s ] i ,s i+1 ]The optimal transmission rate in the time period is +.>
Figure GDA00042025747200000512
i=i+1; in(s) i ,B(s i ) Step 3) as a starting point;
Figure GDA00042025747200000513
then the optimal transmission curveLine Do pt (s i ) At s i Time of day
Figure GDA00042025747200000514
Corresponding data-exit curves intersect (minimum data-exit curve) [ s ] i ,s i+1 ]The optimal transmission rate in the time period is r opt (t i )＝r 1 A The method comprises the steps of carrying out a first treatment on the surface of the i=i+1; in(s) i ,A(s i ) Step 3) as a starting point;
Figure GDA0004202574720000061
passes through the starting point and has a slope r 1 B Straight line s and straight line s of (2) i+2 The point of intersection is noted as
Figure GDA0004202574720000062
Limited [ s ] i ,s i+1 ]And [ s ] i ,s i+2 ]The optimal transmission rate for both time slots is +.>
Figure GDA0004202574720000063
Within the range, and r opt (t i+1 )＝r opt (t i+2 ) Time point s i+2 The corresponding points on the maximum data departure curve and the minimum data departure curve are +.>
Figure GDA0004202574720000064
And->
Figure GDA0004202574720000065
Updating the minimum data departure curve point and the maximum data departure curve at a time point s i+2 The values of the values are +.>
Figure GDA0004202574720000066
And->
Figure GDA0004202574720000067
i=i+1, step4 is performed;
Figure GDA0004202574720000068
passes through the starting point and has a slope r 1 A Straight line s and straight line s of (2) i+2 The point of intersection is noted as
Figure GDA0004202574720000069
Limited [ s ] i ,s i+1 ]And [ s ] i ,s i+2 ]The optimal transmission rate for both time slots is +.>
Figure GDA00042025747200000610
Within the range, and r opt (t i+1 )＝r opt (t i+2 ) Time point s i+2 The corresponding points on the maximum data departure curve and the minimum data departure curve are +.>
Figure GDA00042025747200000611
And->
Figure GDA00042025747200000612
Updating the minimum data departure curve point and the maximum data departure curve at a time point s i+2 The values of the values are +.>
Figure GDA00042025747200000613
And->
Figure GDA00042025747200000614
i=i+1, step4 is performed;
step5: if i+2=n, stopping recursion iteration to obtain an energy-saving optimal transmission curve D opt (s i ) And an optimal transmission rate r opt ＝{r opt (t 1 ),r opt (t 2 ),...,r opt (t N )}。
Fig. 2 shows the energy consumption comparison of a pre-buffered energy-saving transmission algorithm and a non-buffered real-time transmission algorithm. As can be seen from fig. 2, the performance advantage of the proposed algorithm is more obvious as the cache capacity becomes larger.
In this embodiment, the beneficial effects of the pre-cache-based energy-saving transmission algorithm are mainly reflected in two aspects: firstly, the algorithm provided by the invention calculates the maximum departure point and the minimum departure point of the data in a recursion mode, and has lower calculation complexity; second, the algorithm provided by the invention can reduce the energy consumption of the main base station.
The foregoing is only a preferred embodiment of the invention, it being noted that: it will be apparent to those skilled in the art that various modifications and adaptations can be made without departing from the principles of the present invention, and such modifications and adaptations are intended to be comprehended within the scope of the invention.

Claims (1)

1. An energy saving transmission method based on pre-caching is applied to a heterogeneous wireless network; the method is characterized in that: the main base station sends the data packet request of the user to the small base station with a memory, and the small base station sends the data packet request to each user in a time division multiplexing mode; on the premise of meeting the requirements of the transmission rate and the transmission delay of the user data packet, the energy consumption of the main base station is minimized; firstly, initializing parameters, wherein the parameters comprise the number of data packets to be transmitted, the starting transmission time of each data packet, the ending transmission time of each data packet, the minimum transmission rate of each data packet, the total transmission time length of a system and the memory size of a small base station; then, designing a minimum data departure curve and a maximum data departure curve of the main base station by utilizing the minimum transmission rate of each data packet and the memory size of the small base station, wherein the optimal data departure curve of the main base station is between the minimum data departure curve and the maximum data departure curve; finally, recursively calculating an optimal data departure curve based on the pre-cached main base station by taking the starting transmission time of the first data packet as a starting point and the end point of the minimum data departure curve as an end point; the method comprises the following steps:
step one: parameter initialization
Setting the total transmission time length as T, the number of data packets to be transmitted as N, and the memory size of the small base station as C; the ith packet startsThe transmission time is s i The time for ending transmission of the ith packet is s i+1 The transmission time slot of the ith data packet is t i ＝s i+1 -s i The minimum transmission rate of the ith data packet is d i The transmission rate of the main base station is r i The small base station transmits the ith data packet to the user in the ith time slot;
step two: problem formation initialization
Calculating a minimum data departure curve and a maximum data departure curve of the main base station, and setting the main base station to s 1 From moment to s n+1 N data packets are transmitted in total between moments, and the minimum data departure curve is
Figure FDA0004202574710000011
Maximum data departure curve is
Figure FDA0004202574710000012
Optimal data departure curve D of main base station opt (s i ) Between the minimum data departure curve and the maximum data departure curve, the total energy consumption of the main base station in the respective transmission time slot is +.>
Figure FDA0004202574710000013
Step three: energy saving transmission algorithm
Establishing a horizontal axis representation time s i The vertical axis represents a two-dimensional rectangular coordinate system of the transmitted data quantity, in which a minimum data departure curve a (s i ) And a maximum data departure curve B (s i ) Based on A (s i ) And B(s) i ) Recursively calculating the optimal data departure curve D opt (s i ) The method comprises the steps of carrying out a first treatment on the surface of the The method comprises the following steps:
step1: establishing a horizontal axis representation time s i The vertical axis represents a two-dimensional rectangular coordinate system of the transmitted data quantity, in which a minimum data departure curve a (s i ) And a maximum data departure curve B (s i ) Based on A (s i ) And B(s) i ) Rendering optimalityData departure curve D opt (s i ) The method comprises the steps of carrying out a first treatment on the surface of the Initializing i=1, s i ＝0，D opt (s i )＝0；
Step2: setting the starting point as(s) i ,D opt (s i ))；
Step3: respectively connecting the start point and the minimum data departure curve point (s i+1 ,A(s i+1 ) Maximum data departure curve point(s) i+1 ,B(s i+1 ) Calculating the slopes of the two line segments to be r respectively 1 A And r 1 B ，r 1 A And r 1 B Respectively representing the minimum sending rate and the maximum sending rate of the time slot main base station; let r 1 up ＝r 1 B ，r 1 low ＝r 1 A Then there is r 1 up ≥r 1 low ；
Step4: respectively connecting the starting point and(s) i+2 ,A(s i+2 ))、(s i+2 ,B(s i+2 ) Calculating the slopes of the two line segments as
Figure FDA0004202574710000021
And->
Figure FDA0004202574710000022
Four cases are discussed:
(1) if it is
Figure FDA0004202574710000023
Then the optimal transmission curve D opt (s i ) At s i Time of day and r 1 up Corresponding data departure curves intersect, [ s ] i ,s i+1 ]The optimal transmission rate in the time period is r opt (t i )＝r 1 B The method comprises the steps of carrying out a first treatment on the surface of the i=i+1; in(s) i ,B(s i ) Step 3) as a starting point;
②
Figure FDA0004202574710000024
then the optimal transmission curve D opt (s i ) At s i Time of day and r 1 low Corresponding data departure curves intersect, [ s ] i ,s i+1 ]The optimal transmission rate in the time period is r opt (t i )＝r 1 A The method comprises the steps of carrying out a first treatment on the surface of the i=i+1; in(s) i ,A(s i ) Step 3) as a starting point;
③
Figure FDA0004202574710000025
passes through the starting point and has a slope r 1 B Straight line s and straight line s of (2) i+2 The point of intersection is noted as
Figure FDA0004202574710000026
Limited [ s ] i ,s i+1 ]And [ s ] i ,s i+2 ]The optimal transmission rate for both time slots is +.>
Figure FDA0004202574710000027
Within the range, and r opt (t i+1 )＝r opt (t i+2 ) Time point si+2 The corresponding points on the maximum data departure curve and the minimum data departure curve are +.>
Figure FDA0004202574710000028
And->
Figure FDA0004202574710000029
Updating the minimum data departure curve point and the maximum data departure curve at a time point s i+2 The values of the values are +.>
Figure FDA00042025747100000210
And->
Figure FDA00042025747100000211
i=i+1, step4 is performed;
④
Figure FDA00042025747100000212
passes through the starting point and has a slope r 1 A Straight line s and straight line s of (2) i+2 The point of intersection is noted as
Figure FDA0004202574710000031
Limited [ s ] i ,s i+1 ]And [ s ] i ,s i+2 ]The optimal transmission rate for both time slots is +.>
Figure FDA0004202574710000032
Within the range, and r opt (t i+1 )＝r opt (t i+2 ) Time point s i+2 The corresponding points on the maximum data departure curve and the minimum data departure curve are +.>
Figure FDA0004202574710000033
And->
Figure FDA0004202574710000034
Updating the minimum data departure curve point and the maximum data departure curve at a time point s i+2 The values of the values are +.>
Figure FDA0004202574710000035
And->
Figure FDA0004202574710000036
i=i+1, step4 is performed;
step5: if i+2=n, stopping recursion iteration to obtain an energy-saving optimal transmission curve D opt (s i ) And an optimal transmission rate r opt ＝{r opt (t 1 ),r opt (t 2 ),,r opt (t N )}。
CN201911240480.8A 2019-12-06 2019-12-06 Energy saving transmission method based on pre-caching Active CN110913468B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911240480.8A CN110913468B (en) 2019-12-06 2019-12-06 Energy saving transmission method based on pre-caching

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911240480.8A CN110913468B (en) 2019-12-06 2019-12-06 Energy saving transmission method based on pre-caching

Publications (2)

Publication Number Publication Date
CN110913468A CN110913468A (en) 2020-03-24
CN110913468B true CN110913468B (en) 2023-06-06

Family

ID=69823138

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911240480.8A Active CN110913468B (en) 2019-12-06 2019-12-06 Energy saving transmission method based on pre-caching

Country Status (1)

Country Link
CN (1) CN110913468B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111343708B (en) * 2020-03-26 2023-05-09 金陵科技学院 Method for minimizing total energy consumption of system by considering circuit power consumption

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105873224A (en) * 2015-01-22 2016-08-17 北京永安信通科技有限公司 Data packet transmission and scheduling method and device based on interactive slope comparison

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8797868B2 (en) * 2012-03-14 2014-08-05 Alcatel Lucent Energy-efficient network device with coordinated scheduling and rate control using non-zero base power

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105873224A (en) * 2015-01-22 2016-08-17 北京永安信通科技有限公司 Data packet transmission and scheduling method and device based on interactive slope comparison

Also Published As

Publication number Publication date
CN110913468A (en) 2020-03-24

Similar Documents

Publication Publication Date Title
CN101483909B (en) Reverse power control method based on multi-carrier
US20050249227A1 (en) Method for indicating buffer status in a WLAN access point
US10880348B2 (en) Methods and devices for controlling streaming over a radio network
CN103248965B (en) A kind of transmission of video array dispatching method based on approximate time delay
CN106791887B (en) Distributed caching and transmission optimization method for videos in wireless network
CN106254474B (en) Heterogeneous nodes cooperation caching method under car networking based on fountain codes
CN103997791A (en) Wireless network resource distribution method and system based on use preference of user terminal resources
Xing et al. Rate adaptation strategy for video streaming over multiple wireless access networks
WO2015024240A1 (en) Network resource control method, apparatus and system
CN115665804B (en) Cache optimization method for cooperative unmanned aerial vehicle-intelligent vehicle cluster
CN110913468B (en) Energy saving transmission method based on pre-caching
CN108093443B (en) Multi-service vehicle-ground communication bandwidth distribution system and method
CN108541025B (en) Wireless heterogeneous network-oriented base station and D2D common caching method
CN111698732A (en) Time delay oriented cooperative cache optimization method in micro-cellular wireless network
CN102075584B (en) Distributed file system and access method thereof
CN110049507A (en) Optimal buffer resource distribution method in wireless content distribution network based on martingale theory
Cui et al. Dash+: Download multiple video segments with stream multiplexing of quic
CN108429919B (en) Caching and transmission optimization method of multi-rate video in wireless network
Zhang et al. Statistical QoS-driven power adaptation for distributed caching based mobile offloading over 5G wireless networks
CN111885641B (en) Buffer resource allocation method in buffer auxiliary relay network
CN110972165B (en) Double-layer optimization energy efficiency optimization method based on local cache and pre-download
KR100785814B1 (en) Device and the method for control of transmission of real-time data in low-rate wireless personal area network
CN111541778B (en) Active pushing method for on-site operation and maintenance information of power communication network
CN110351778A (en) Mobile communication and received terrestrial digital broadcasting emerging system, method and its user terminal
CN112911717B (en) Transmission method for MDS (data packet System) encoded data packet of forwarding network

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
TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20240516

Address after: 230000 B-1015, wo Yuan Garden, 81 Ganquan Road, Shushan District, Hefei, Anhui.

Patentee after: HEFEI MINGLONG ELECTRONIC TECHNOLOGY Co.,Ltd.

Country or region after: China

Address before: No. 99 Jiangning Road, Nanjing District hirokage 211169 cities in Jiangsu Province

Patentee before: JINLING INSTITUTE OF TECHNOLOGY

Country or region before: China