CN112153727A - Low-delay low-energy-consumption base station caching and sleeping method, base station and system - Google Patents

Low-delay low-energy-consumption base station caching and sleeping method, base station and system Download PDF

Info

Publication number
CN112153727A
CN112153727A CN202011078622.8A CN202011078622A CN112153727A CN 112153727 A CN112153727 A CN 112153727A CN 202011078622 A CN202011078622 A CN 202011078622A CN 112153727 A CN112153727 A CN 112153727A
Authority
CN
China
Prior art keywords
base station
user
low
file
caching
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
Application number
CN202011078622.8A
Other languages
Chinese (zh)
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.)
Shenzhen Graduate School Harbin Institute of Technology
Original Assignee
Shenzhen Graduate School Harbin 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 Shenzhen Graduate School Harbin Institute of Technology filed Critical Shenzhen Graduate School Harbin Institute of Technology
Priority to CN202011078622.8A priority Critical patent/CN112153727A/en
Publication of CN112153727A publication Critical patent/CN112153727A/en
Pending legal-status Critical Current

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 a low-delay low-energy-consumption base station caching and sleeping method, a base station and a system, wherein the method comprises the following steps: s101, calculating an activity parameter of each base station in a time slot t base station set; s102, comparing the activity parameters of each base station; s103, controlling C base stations with smaller activity parameters to sleep, wherein C is an integer greater than or equal to 0. The low-delay low-energy-consumption base station caching and sleeping method is implemented, in the operation process of the base station, the activity parameter of each base station is calculated, the activity parameters of the base stations in the same base station set are compared, C base stations with lower activity are selected to sleep after the comparison is completed, and the communication function is realized through other base stations in the base station set, so that the aim of reducing the operation energy consumption of the base stations is fulfilled, and the energy-saving effect is achieved.

Description

Low-delay low-energy-consumption base station caching and sleeping method, base station and system
Technical Field
The present application relates to the field of base stations, and in particular, to a low-latency low-energy-consumption base station caching and sleeping method, base station, and system.
Background
The increasing proliferation of mobile devices in recent years has led to an explosive growth in mobile traffic and is expected to grow nearly ten times in the coming years, which puts a heavy pressure on the limited capacity backhaul links in cellular networks. To cope with the rapid growth of traffic, cache files on small Scale Base Stations (SBS) are now widely used to help reduce traffic congestion and to alleviate backhaul pressure.
However, in order to meet the challenge brought by the mobile data traffic to the wireless network in the 5G era, the base stations are more and more densely built and more voluminous, and how to reduce the energy consumption of the base stations and improve the energy efficiency of the network is also more and more emphasized. For the cooperative buffering of the small base stations, the number of the small base stations is large, and the small base stations consume much energy. At present, the main energy consumption in the cellular network comes from the energy consumption of the base station itself, and how to effectively control the energy consumption of the base station itself becomes a hot spot problem to be solved urgently.
Disclosure of Invention
The application provides a low-delay low-energy-consumption base station caching and sleeping method, a base station and a system, which can control different base stations to respectively select sleeping or activating according to an activity parameter, so that the aim of reducing the running energy consumption of the base stations is fulfilled.
In order to solve the technical problem, the application adopts a technical scheme that: the caching and sleeping method for the low-delay low-energy-consumption base station comprises the following steps:
s101, calculating an activity parameter of each base station in a time slot t base station set;
s102, comparing the activity parameters of each base station;
s103, controlling C base stations with smaller activity parameters to sleep, wherein C is an integer greater than or equal to 0.
Further, the activity parameter is
Figure BDA0002717213370000021
Figure BDA0002717213370000022
Wherein the content of the first and second substances,
Figure BDA0002717213370000023
the number of requests made to serve user u to base station m in time slot t-1,
Figure BDA0002717213370000024
lambda is the influence of the number of service requests of the base station in different time slots on the time slot t, and the closer the time slot is, the larger the lambda value is.
Further, the step S102 specifically includes:
arranging the activity parameters of each base station in an ascending order or a descending order;
the step S103 is specifically:
and C base stations with the activity parameters from low to high are dormant.
Further, the method further comprises:
comparing the time slot t with the preset time period t1The size of (d);
when the time slot t is smaller than a preset time period t1When the file is cached, the base station is controlled to be in an active state and the file is randomly cached;
when the time slot t is greater than or equal to a preset time period t1Then, step S103 is executed, and random caching is performed according to the probability, and a caching strategy that can obtain the maximum reward is selected according to a probability of 1 to perform caching, wherein the probability is a positive number greater than 0 and less than 1.
Further, after the step S103, the method further includes:
and updating the cache rewards and the activity parameters of the base stations, controlling the base stations to be in a dormant state or an active state according to the updated activity parameters and caching files according to the updated cache rewards.
Further, the method for updating the activity parameter of each base station specifically includes:
receiving a user u request file f, and sequencing the base stations containing the file f in the base station set according to the distance from the user u;
when the base station nearest to the user u is in an active state, directly adding the activity parameter to the nearest base station, wherein the updated activity parameter is represented as:
Figure BDA0002717213370000025
when the base station which is close to the jth of the user u is in an active state, a part of requests are required to be distributed to the closer base station, and the updated activity parameter is represented as:
Figure BDA0002717213370000031
wherein u represents a user located in a common communication range of the base station m and the base station n;
Figure BDA0002717213370000032
representing the updated activity parameter of the base station m;
Figure BDA0002717213370000033
representing the updated activity parameters on the edge of the base station m and the base station n.
Further, the method for updating the cache rewards of the base stations specifically includes:
receiving a request of a file f sent by a user u;
if the file f is stored in the base station nearest to the user u, the nearest base station serves the user u, and the base station serves the user u and then rewards the user u
Figure BDA0002717213370000034
If the file f needed by the user is not stored on the base station closest to the user and the file f is stored on the base station close to the user j, the reward of serving the user u by the base station close to the user j is distributed to the base station close to the user j
Figure BDA0002717213370000035
Wherein the content of the first and second substances,
Figure BDA0002717213370000036
represents a reward on base station m;
Figure BDA0002717213370000037
representing the reward on the edge of the base station m, n;
Figure BDA0002717213370000038
the reward when serving a file f request by user u on behalf of base station m.
Further, the set of base stations is a set of all base stations that can communicate with user u.
In order to solve the above technical problem, another technical solution adopted by the present application is: there is provided a base station comprising a processor, a memory coupled to the processor, wherein,
the memory stores program instructions for implementing the low latency, low energy consumption base station caching and dormancy method as described above;
the processor is configured to execute the program instructions stored in the memory to implement the low-latency low-energy consumption base station caching and sleeping method.
In order to solve the above technical problem, the present application adopts another technical solution that: there is provided a communication system comprising a terminal device, a server and a base station as described above.
The beneficial effect of this application is: the low-delay low-energy-consumption base station caching and sleeping method is implemented, in the operation process of the base station, the activity parameter of each base station is calculated, the activity parameters of the base stations in the same base station set are compared, C base stations with lower activity are selected to sleep after the comparison is completed, and the communication function is realized through other base stations in the base station set, so that the aim of reducing the operation energy consumption of the base stations is fulfilled, and the energy-saving effect is achieved.
Drawings
FIG. 1 is a flow chart illustrating a buffering and sleeping method of a low-latency and low-energy-consumption base station according to a first embodiment of the present invention;
FIG. 2 is a flow chart illustrating a buffering and sleeping method for a low-latency and low-energy-consumption base station according to a second embodiment of the present invention;
FIG. 3 is a flowchart illustrating a buffering and sleeping method for a low-latency and low-energy-consumption base station according to a third embodiment of the present invention;
fig. 4 is a schematic structural diagram of a base station according to an embodiment of the present invention;
fig. 5 is a schematic structural diagram of a communication system according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
The terms "first", "second" and "third" in this application are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implying any indication of the number of technical features indicated. Thus, a feature defined as "first," "second," or "third" may explicitly or implicitly include at least one of the feature. In the description of the present application, "plurality" means at least two, e.g., two, three, etc., unless explicitly specifically limited otherwise. All directional indications (such as up, down, left, right, front, and rear … …) in the embodiments of the present application are only used to explain the relative positional relationship between the components, the movement, and the like in a specific posture (as shown in the drawings), and if the specific posture is changed, the directional indication is changed accordingly. Furthermore, the terms "include" and "have," as well as any variations thereof, are intended to cover non-exclusive inclusions. For example, a process, method, system, article, or apparatus that comprises a list of steps or elements is not limited to only those steps or elements listed, but may alternatively include other steps or elements not listed, or inherent to such process, method, article, or apparatus.
Reference herein to "an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment can be included in at least one embodiment of the application. The appearances of the phrase in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. It is explicitly and implicitly understood by one skilled in the art that the embodiments described herein can be combined with other embodiments.
Fig. 1 is a flowchart illustrating a buffering and sleeping method for a low-latency and low-energy-consumption base station according to a first embodiment of the present invention. It should be noted that the method of the present invention is not limited to the flow sequence shown in fig. 1 if the results are substantially the same. As shown in fig. 1, the method comprises the steps of:
step S101: and calculating the activity parameter of each base station in the time slot t base station set.
Specifically, the time is divided into T time periods, i.e., T1, 2, 3.., T, where each time period is the same in size, and the time slot T is the current time period or the next time period.
For the state of the time slot t base station, the sum of the number of the requests sent by the base station which meets the user in the first N time slots needs to be calculated, if the number of the requests met by the base station is large, the user nearby the base station is more active, and the base station needs to be in an active state to meet the user request; if the number of the requests satisfied by the base station is less, the base station can be put in a dormant state, so that the energy consumption is reduced, and the transmission delay of the system is not greatly influenced.
Specifically, the activity parameter is
Figure BDA0002717213370000051
The calculation method is
Figure BDA0002717213370000052
Wherein the content of the first and second substances,
Figure BDA0002717213370000053
the number of requests made to serve user u to base station m in time slot t-1,
Figure BDA0002717213370000054
lambda is the influence of the number of service requests of the base station in different time slots on the time slot t, and the closer the time slot is, the larger the lambda value is. Corresponding, λ1＞λ2＞...＞λN。
Further, hmThe binary decision variable represents whether the base station m is in a sleep state. Wherein the content of the first and second substances,
Figure BDA0002717213370000061
when the base station is in an active state, the base station has a fixed energy consumption EmThe power consumption is 0 or close to 0 when the base station is in the sleep state.
Step S102: comparing the activity parameters of each base station;
specifically, the calculated activity parameters of the base stations are compared in size and are arranged in an ascending order or a descending order.
Step S103: c base stations with smaller activity parameters are controlled to sleep, wherein C is an integer greater than or equal to 0.
After the comparison is completed, controlling the C base stations with smaller activity parameters in the base station set to sleep, so that the C base stations with smaller activity parameters are in a sleep state, and other base stations in the base station set are in an active state.
Specifically, the set of base stations is a set of all base stations that can communicate with user u.
It can be understood that controlling the base station to be in the dormant state or the active state is controlling the base station to be in the dormant state or the active state in the time slot t, and in the next time slot of the time slot t, the activity parameter of the base station needs to be recalculated and compared, and then each base station is controlled to be in the dormant state or the active state again according to the activity parameter.
The low-delay low-energy-consumption base station caching and sleeping method is implemented, in the operation process of the base station, the activity parameter of each base station is calculated, the activity parameters of the base stations in the same base station set are compared, C base stations with lower activity are selected to sleep after the comparison is completed, and the communication function is realized through other base stations in the base station set, so that the aim of reducing the operation energy consumption of the base stations is fulfilled, and the energy-saving effect is achieved.
Fig. 2 is a flowchart illustrating a buffering and sleeping method for a low-latency and low-energy-consumption base station according to a second embodiment of the present invention. It should be noted that the method of the present invention is not limited to the flow sequence shown in fig. 2 if the results are substantially the same. As shown in fig. 2, the method comprises the steps of:
step S201: calculating the activity parameter of each base station in the time slot t base station set;
specifically, the time is divided into T time periods, i.e., T1, 2, 3.., T, where each time period is the same in size, and the time slot T is the current time period or the next time period.
For the state of the time slot t base station, the sum of the number of the requests sent by the base station which meets the user in the first N time slots needs to be calculated, if the number of the requests met by the base station is large, the user nearby the base station is more active, and the base station needs to be in an active state to meet the user request; if the number of the requests satisfied by the base station is less, the base station can be put in a dormant state, so that the energy consumption is reduced, and the transmission delay of the system is not greatly influenced.
In particular, the liveness parameterIs composed of
Figure BDA0002717213370000071
The calculation method is
Figure BDA0002717213370000072
Wherein the content of the first and second substances,
Figure BDA0002717213370000073
the number of requests made to serve user u to base station m in time slot t-1,
Figure BDA0002717213370000074
lambda is the influence of the number of service requests of the base station in different time slots on the time slot t, and the closer the time slot is, the larger the lambda value is. Corresponding, λ1＞λ2＞...＞λN。
Further, hmThe binary decision variable represents whether the base station m is in a sleep state. Wherein the content of the first and second substances,
Figure BDA0002717213370000075
when the base station is in an active state, the base station has a fixed energy consumption EmThe power consumption is 0 or close to 0 when the base station is in the sleep state.
Step S202: comparing the activity parameters of each base station;
specifically, the calculated activity parameters of the base stations are compared in size and are arranged in an ascending order or a descending order.
Step S203: comparing the time slot t with the preset time period t1The size of (d);
step S204: when the time slot t is smaller than a preset time period t1When the file is cached, the base station is controlled to be in an active state and the file is randomly cached;
step S205: when the time slot t is greater than or equal to a preset time period t1And in the process, C base stations with smaller activity parameters are controlled to sleep, random caching is carried out according to the probability, and a caching strategy which can obtain the maximum reward is selected according to the probability of 1 to cache, wherein the caching strategy is a positive number which is greater than 0 and less than 1, and the positive number is 0.4.
Step S202 and step S203 may be performed simultaneously or sequentially, and step S202 may be before step S203 or after step S203.
In the present embodiment, the time slot t and the preset time period t are set simultaneously while the base station sleep control is performed1Comparing, and when the time slot t is smaller than the preset time period t1When the time slot t is short, the base station is controlled to be in an active state and file caching is randomly carried out; when the time slot t is greater than or equal to the preset time period t1And controlling the C base stations with smaller activity parameters to sleep, randomly caching other active base stations according to the probability, and selecting a caching strategy capable of obtaining the maximum reward according to the probability of 1 to cache.
In the embodiment, the base station is used for caching the file in a cooperative manner, so that the efficiency of requesting the file feedback by the user can be improved, the time delay is reduced, and the user experience is improved.
Fig. 3 is a flowchart illustrating a buffering and sleeping method for a low-latency and low-energy-consumption base station according to a third embodiment of the present invention. It should be noted that the method of the present invention is not limited to the flow sequence shown in fig. 3 if the results are substantially the same. As shown in fig. 3, the method comprises the steps of:
step S301: and calculating the activity parameter of each base station in the time slot t base station set.
Specifically, the time is divided into T time periods, i.e., T1, 2, 3.., T, where each time period is the same in size, and the time slot T is the current time period or the next time period.
For the state of the time slot t base station, the sum of the number of the requests sent by the base station which meets the user in the first N time slots needs to be calculated, if the number of the requests met by the base station is large, the user nearby the base station is more active, and the base station needs to be in an active state to meet the user request; if the number of the requests satisfied by the base station is less, the base station can be put in a dormant state, so that the energy consumption is reduced, and the transmission delay of the system is not greatly influenced.
Specifically, the activity parameter is
Figure BDA0002717213370000081
The calculation method is
Figure BDA0002717213370000082
Wherein the content of the first and second substances,
Figure BDA0002717213370000083
the number of requests made to serve user u to base station m in time slot t-1,
Figure BDA0002717213370000084
lambda is the influence of the number of service requests of the base station in different time slots on the time slot t, and the closer the time slot is, the larger the lambda value is. Corresponding, λ1＞λ2＞...＞λN。
Further, hmThe binary decision variable represents whether the base station m is in a sleep state. Wherein the content of the first and second substances,
Figure BDA0002717213370000091
when the base station is in an active state, the base station has a fixed energy consumption EmThe power consumption is 0 or close to 0 when the base station is in the sleep state.
Step S302: comparing the activity parameters of each base station;
specifically, the calculated activity parameters of the base stations are compared in size and are arranged in an ascending order or a descending order.
Step S303: c base stations with smaller activity parameters are controlled to sleep, wherein C is an integer greater than or equal to 0.
After the comparison is completed, the C base stations with the smaller activity parameter are dormant, so that the C base stations with the smaller activity parameter are in a dormant state, and other base stations in the base station set are in an active state.
Step S304: and updating the cache rewards and the activity parameters of the base stations, controlling the base stations to be in a dormant state or an active state according to the updated activity parameters and caching files according to the updated cache rewards.
Specifically, the method for updating the activity parameter of each base station specifically includes:
receiving a user u request file f, and sequencing the base stations containing the file f in the base station set according to the distance from the user u;
when the base station nearest to the user u is in an active state, directly adding the activity parameter to the nearest base station, wherein the updated activity parameter is represented as:
Figure BDA0002717213370000092
when the base station which is close to the jth of the user u is in an active state, a part of requests are required to be distributed to the closer base station, and the updated activity parameter is represented as:
Figure BDA0002717213370000093
wherein u represents a user located in a common communication range of the base station m and the base station n;
Figure BDA0002717213370000094
representing the updated activity parameter of the base station m;
Figure BDA0002717213370000095
representing the updated activity parameters on the edge of the base station m and the base station n.
When a user u in a common communication range of a plurality of base stations requests a file f, firstly, the base stations containing the file f in the base stations are sequenced according to the distance from the user u; if the base station closest to the user is in an active state, the user is directly served by the base station closest to the user; if the base station closer to the user is in the dormant state, the user can only be served by the base station farther away, but the requests still need to be distributed to the base station closer to the base station in the dormant state, so that the activity parameter of the base station closer to the user is improved, and the base station closer to the user in the next time slot has a higher probability of being in the active state.
Specifically, the method for updating the cache rewards of the base stations specifically includes:
receiving a request of a file f sent by a user u;
if the file f is stored in the base station nearest to the user u, the nearest base station serves the user u, and the base station serves the user u and then rewards the user u
Figure BDA0002717213370000101
If the file f needed by the user is not stored on the base station closest to the user and the file f is stored on the base station close to the user j, the reward of serving the user u by the base station close to the user j is distributed to the base station close to the user j
Figure BDA0002717213370000102
Wherein the content of the first and second substances,
Figure BDA0002717213370000103
represents a reward on base station m;
Figure BDA0002717213370000104
representing the reward on the edge of the base station m, n;
Figure BDA0002717213370000105
the reward when serving a file f request by user u on behalf of base station m.
In this embodiment, when a user requests a file, if the file is stored in the base station closest to the user, the user is served by the closest base station, and the reward generated by the base station serving user is directly added to the base station. If the file required by the user is not stored on the base station closest to the user and the file is stored on the base station closest to the user, the reward of serving the user by the base station closest to the user is distributed to the base stations closer to the user, and the base station close to the user has higher probability of storing the file required by the user in such a way, so that the transmission delay and the energy consumption are reduced.
Referring to fig. 4, fig. 4 is a schematic structural diagram of a base station according to an embodiment of the invention. As shown in fig. 4, the base station 40 includes a processor 41 and a memory 42 coupled to the processor 41.
The memory 42 stores program instructions for implementing the low latency and low energy consumption method for caching and sleeping in a base station according to any of the above embodiments.
The processor 41 is configured to execute program instructions stored in the memory 42 to implement the low latency and low energy consumption base station caching and sleeping method.
The processor 41 may also be referred to as a CPU (Central Processing Unit). The processor 41 may be an integrated circuit chip having signal processing capabilities. The processor 41 may also be a general purpose processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), an off-the-shelf programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
Referring to fig. 5, fig. 5 is a schematic structural diagram of a communication system according to an embodiment of the present invention. The communication system 50 of the embodiment of the present invention includes the terminal device 51, the server 52, and the base station 40 as described above. The number of the base stations 40 is at least one, and the terminal device 51 may be one or more of a smart phone, a tablet computer, a computer, and the like.
In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other manners. For example, the above-described apparatus embodiments are merely illustrative, and for example, a division of a unit is merely a logical division, and an actual implementation may have another division, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit. The above embodiments are merely examples and are not intended to limit the scope of the present disclosure, and all modifications, equivalents, and flow charts using the contents of the specification and drawings of the present disclosure or those directly or indirectly applied to other related technical fields are intended to be included in the scope of the present disclosure.

Claims (10)

1. A low-delay low-energy-consumption base station caching and sleeping method is characterized by comprising the following steps:
s101, calculating an activity parameter of each base station in a time slot t base station set;
s102, comparing the activity parameters of each base station;
s103, controlling C base stations with smaller activity parameters to sleep, wherein C is an integer greater than or equal to 0.
2. The method of claim 1, wherein the liveness parameter is
Figure FDA0002717213360000011
Figure FDA0002717213360000012
Figure FDA0002717213360000013
Wherein the content of the first and second substances,
Figure FDA0002717213360000014
the number of requests made to serve user u to base station m in time slot t-1,
Figure FDA0002717213360000015
lambda is the influence of the number of service requests of the base station in different time slots on the time slot t, and the closer the time slot is, the larger the lambda value is.
3. The method according to claim 2, wherein the step S102 specifically includes:
arranging the activity parameters of each base station in an ascending order or a descending order;
the step S103 is specifically:
and C base stations with the activity parameters from low to high are dormant.
4. The method according to any one of claims 1-3, further comprising:
comparing the time slot t with the preset time period t1The size of (d);
when the time slot t is smaller than a preset time period t1When the file is cached, the base station is controlled to be in an active state and the file is randomly cached;
when the time slot t is greater than or equal to a preset time period t1Then, the step S103 is executed, and random caching is performed according to the probability, and the maximum value can be obtained according to the probability selection of 1-The rewarded caching strategy caches, wherein the rewarded caching strategy is a positive number which is greater than 0 and less than 1.
5. The method of claim 2, wherein after the step S103, the method further comprises:
and updating the cache rewards and the activity parameters of the base stations, controlling the base stations to be in a dormant state or an active state according to the updated activity parameters and caching files according to the updated cache rewards.
6. The method according to claim 5, wherein the method for updating the activity parameter of each base station specifically comprises:
receiving a user u request file f, and sequencing the base stations containing the file f in the base station set according to the distance from the user u;
when the base station nearest to the user u is in an active state, directly adding the activity parameter to the nearest base station, wherein the updated activity parameter is represented as:
Figure FDA0002717213360000021
when the base station which is close to the jth of the user u is in an active state, a part of requests are required to be distributed to the closer base station, and the updated activity parameter is represented as:
Figure FDA0002717213360000022
wherein u represents a user located in a common communication range of the base station m and the base station n;
Figure FDA0002717213360000023
representing the updated activity parameter of the base station m;
Figure FDA0002717213360000024
representing the updated activity parameters on the edge of the base station m and the base station n.
7. The method according to claim 5 or 6, wherein the method for updating the buffer rewards of the base stations specifically comprises:
receiving a request of a file f sent by a user u;
if the file f is stored in the base station nearest to the user u, the nearest base station serves the user u, and the base station serves the user u and then rewards the user u
Figure FDA0002717213360000025
If the file f needed by the user is not stored on the base station closest to the user and the file f is stored on the base station close to the user j, the reward of serving the user u by the base station close to the user j is distributed to the base station close to the user j
Figure FDA0002717213360000026
Wherein the content of the first and second substances,
Figure FDA0002717213360000027
represents a reward on base station m;
Figure FDA0002717213360000028
representing the reward on the edge of the base station m, n;
Figure FDA0002717213360000029
the reward when serving a file f request by user u on behalf of base station m.
8. The method of claim 1, wherein the set of base stations is a set of all base stations that can communicate with user u.
9. A base station comprising a processor, a memory coupled to the processor, wherein,
the memory stores program instructions for implementing a low latency, low energy consumption base station caching and sleeping method according to any one of claims 1 to 8;
the processor is configured to execute the program instructions stored in the memory to implement the low-latency low-energy consumption base station caching and sleeping method.
10. A communication system, characterized in that the system comprises a terminal device, a server and a base station according to claim 9.
CN202011078622.8A 2020-10-10 2020-10-10 Low-delay low-energy-consumption base station caching and sleeping method, base station and system Pending CN112153727A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011078622.8A CN112153727A (en) 2020-10-10 2020-10-10 Low-delay low-energy-consumption base station caching and sleeping method, base station and system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011078622.8A CN112153727A (en) 2020-10-10 2020-10-10 Low-delay low-energy-consumption base station caching and sleeping method, base station and system

Publications (1)

Publication Number Publication Date
CN112153727A true CN112153727A (en) 2020-12-29

Family

ID=73952890

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011078622.8A Pending CN112153727A (en) 2020-10-10 2020-10-10 Low-delay low-energy-consumption base station caching and sleeping method, base station and system

Country Status (1)

Country Link
CN (1) CN112153727A (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140219150A1 (en) * 2013-02-01 2014-08-07 Hitachi, Ltd. Base station in cellular network system and sleep control method for base station
CN104768184A (en) * 2015-04-30 2015-07-08 厦门大学 Household base station energy saving and interference suppression method and system based on scale deployment
CN108156620A (en) * 2018-01-30 2018-06-12 东南大学 A kind of super-intensive network small station dormancy method based on channel and queue aware
CN109635858A (en) * 2018-12-03 2019-04-16 北京工业大学 A kind of physical area identification distribution method based on fuzzy layered cluster
CN111479312A (en) * 2020-03-02 2020-07-31 重庆邮电大学 Heterogeneous cellular network content caching and base station dormancy combined optimization method

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140219150A1 (en) * 2013-02-01 2014-08-07 Hitachi, Ltd. Base station in cellular network system and sleep control method for base station
CN104768184A (en) * 2015-04-30 2015-07-08 厦门大学 Household base station energy saving and interference suppression method and system based on scale deployment
CN108156620A (en) * 2018-01-30 2018-06-12 东南大学 A kind of super-intensive network small station dormancy method based on channel and queue aware
CN109635858A (en) * 2018-12-03 2019-04-16 北京工业大学 A kind of physical area identification distribution method based on fuzzy layered cluster
CN111479312A (en) * 2020-03-02 2020-07-31 重庆邮电大学 Heterogeneous cellular network content caching and base station dormancy combined optimization method

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
YULONG QI等: "User Preference and Activity Aware Content Sharing in Wireless D2D Caching Networks", 《2020 IEEE/CIC INTERNATIONAL CONFERENCE ON COMMUNICATIONS IN CHINA (ICCC)》 *
孟利民等: "基于TD-LTE异频组网的绿色通信机制研究", 《高技术通讯》 *

Similar Documents

Publication Publication Date Title
CN108934002B (en) Task unloading method based on D2D communication cooperation
EP2664214B1 (en) Method for multipath scheduling based on a lookup table
CN107734558A (en) A kind of control of mobile edge calculations and resource regulating method based on multiserver
US8355384B2 (en) System and method of handover in wireless network
CN107404530B (en) Social network cooperation caching method and device based on user interest similarity
CN109343904A (en) A kind of mist calculating dynamic offloading method based on Lyapunov optimization
CN114449529A (en) Resource allocation optimization method and device based on mobile edge calculation and storage medium
CN115396953A (en) Calculation unloading method based on improved particle swarm optimization algorithm in mobile edge calculation
CN116321307A (en) Bidirectional cache placement method based on deep reinforcement learning in non-cellular network
Chen et al. Time-efficient task caching strategy for multi-server mobile edge cloud computing
CN111511028A (en) Multi-user resource allocation method, device, system and storage medium
Liu et al. Mobility-aware video prefetch caching and replacement strategies in mobile-edge computing networks
CN113114762B (en) Data caching method and system
CN108377473B (en) File content distribution method and device in D2D wireless cache network
JP2014194763A (en) Server, data cache method, communication system and communication method using server
CN117648266A (en) Data caching method, system, equipment and computer readable storage medium
CN113342504A (en) Intelligent manufacturing edge calculation task scheduling method and system based on cache
Chen et al. Dynamic task caching and computation offloading for mobile edge computing
CN112153727A (en) Low-delay low-energy-consumption base station caching and sleeping method, base station and system
CN113411862B (en) Cache placement and user access method and device in dynamic cellular network
CN113115362B (en) Cooperative edge caching method and device
CN113709817B (en) Task unloading and resource scheduling method and device under multi-base-station multi-server scene
CN113709853B (en) Network content transmission method and device oriented to cloud edge collaboration and storage medium
CN109474664A (en) A kind of active pre-cache method and device in heterogeneous wireless network
Shashidhara et al. A novel location aware content prefetching technique for mobile adhoc 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
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20201229

WD01 Invention patent application deemed withdrawn after publication