CN106454896B - A kind of flow table update method and device based on efficiency in software definition wireless network - Google Patents
A kind of flow table update method and device based on efficiency in software definition wireless network Download PDFInfo
- Publication number
- CN106454896B CN106454896B CN201610899593.9A CN201610899593A CN106454896B CN 106454896 B CN106454896 B CN 106454896B CN 201610899593 A CN201610899593 A CN 201610899593A CN 106454896 B CN106454896 B CN 106454896B
- Authority
- CN
- China
- Prior art keywords
- relay node
- user
- energy
- access
- node
- 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
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/02—Arrangements for optimising operational condition
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
- H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W48/00—Access restriction; Network selection; Access point selection
- H04W48/02—Access restriction performed under specific conditions
- H04W48/04—Access restriction performed under specific conditions based on user or terminal location or mobility data, e.g. moving direction, speed
-
- 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)
- Computer Security & Cryptography (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses the flow table update methods and device based on efficiency in a kind of software definition wireless network, applied to the wireless network for including base station, relay node and user, comprising: obtain the node energy of each relay node and the user location of each user in wireless network；The relay node is ranked up from high to low according to node energy；Since first relay node, according to sequence, the user within the scope of relay node services is accessed into relay node, until relay node reaches preset energy optimization；After distributing user for the last one relay node, by user's access base station remaining in network.Accessing user's quantity that the present invention passes through each relay node of distribution, make the stabilization time extend as far as possible of each relay node energy, to prevent the energy loss caused by energy deficiency causes to overflow due to node failure or energy are excessive, capacity usage ratio is improved to the maximum extent, the probability that relay node services interrupt is reduced, the healthy runing time of wireless network is extended.
Description
Technical field
The present invention relates to field of communication technology, a kind of flow table based on efficiency in software definition wireless network is particularly related to more
New method and device.
Background technique
In recent years due to the limitation of the explosion of mobile network and conventional wireless network, researcher is dedicated to researching and developing various
New technology is efficiently to manage the resource in wireless network.Software defined network (Software Defined Network, SDN)
There is provided a kind of expansible flexible way to manage with the model of logical centralization, it by breaking vertical integration, from bottom road
By realizing this idea with separating in switch device by control logic and introducing network programmability.In order to be more convenient for
Understand, it is believed that the abstract friendship by supporting OpenFlow by introducing in traditional finite element network of current data plane
It changes planes to realize.On the other hand, since the rapid development of mobile service, potential economic benefit and environment influence, energy is reduced
Amount consumption becomes the main problem in wireless network, in this case, relaying is introduced between base station (Base Station, BS)
Node (Relay Node, RN) can be by improving transmission quality and Extended Cell covering with energy saving.In order to avoid additional
Energy expense, researcher propose using renewable energy be relay node power.Meanwhile with more and more relaying deployment
With the diversification of relaying technique, the energy management problem in relay system has become very challenging, more particularly to
In the case where green energy resource.Accordingly, with respect to other programmable network, SDN wireless network is promoting more effective resource benefit
It is with a wide range of applications with aspect.In addition with the IPization of wireless network, SDN can be used for integrating different wireless technologys
And the optimum management of isomery wireless technology and cooperation is promoted to coexist.
However, in the implementation of the present invention, the inventor finds that the existing technology has at least the following problems: in green
After in wireless network, due to the unstability of renewable energy and the mobility of user, topology constantly changes, therefore to stream
The management of table brings challenges, and when RN is interrupted due to the shortage of green energy resource, the user for accessing the RN will be switched to base
It stands, while notification controller is further processed by relevant device, but the connection between base station and user equipment will lead to more
More energy consumptions, and control the communication between plane and data plane and will lead to higher time delay.On the other hand, work as relay node
In renewable energy saturation when, newly arrived energy cannot be stored, it means that the utilization rate of green energy resource declines,
Therefore resource management of the research in SDN wirelessly green junction network has important practical significance.
Summary of the invention
In view of this, it is an object of the invention to propose the flow table update based on efficiency in a kind of software definition wireless network
Method and apparatus, to realize that effectively management software defines the energy of wireless network.
The flow table update method based on efficiency in a kind of software definition wireless network is provided based on the above-mentioned purpose present invention, is answered
For including the wireless network of base station, relay node and user, which comprises
Obtain the node energy of each relay node and the user location of each user in wireless network；
The relay node is ranked up from high to low according to node energy；
Since first relay node, according to the sequence, the user within the scope of the relay node services is accessed
The relay node, until the relay node reaches preset energy optimization；
After distributing user for relay node described in the last one, by user's access base station remaining in network.
Optionally, the user by within the scope of the relay node services accesses the relay node, specifically includes:
Obtain the service range of the relay node；
The relay node is calculated at a distance from each user, to save at a distance from the relay node no more than the relaying
Point service range user, establish the relay node to the user flow entry；
The user of the relay node services range will be not more than at a distance from the relay node according to the flow entry
Access the relay node.
Optionally, the energy optimization includes:
During the user within the scope of the relay node services is accessed the relay node, in each use
Before the access of family, if calculating user access, the energy that the relay node consumes within next unit time of access；
Whether the energy for judging that the relay node consumes within next unit time of access reaches the relay node
In the stable energy that next unit time of the unit time of the access is estimated；If reaching, determine that the relay node reaches
To preset energy optimization.
Optionally, relay node is expressed as Rm, user is expressed as U by 1 < m < Mn, 1 < n < N；In expression
After node RmTo user UnFlow entry；Indicate whole user U in set UnPass through flow entry respectivelyIt connects
Enter relay node RmWhen, relay node RmWhole energy consumption；
Enable the relay node RmIt is indicated in the stable energy that next unit time of the unit time of the access is estimated
ForWhereinIndicate relay node Rm?A unit time
The energy of interior acquisition,Indicate relay node Rm?The energy state of a unit time；εmaxIndicate relay node Rm
Energy maximum value, when energy reaches εmaxWhen relay node RmEnergy is not further added by；εminIndicate relay node RmEnergy it is minimum
Value, when energy is lower than εminWhen relay node RmIt is unavailable；
The energy optimization includes: by relay node RmUser in service range accesses the mistake of the relay node
Before each user's access set U is added in the user by Cheng Zhong；Judge whether to meetIf satisfied, determining to reach the energy optimization, collect if not satisfied, next user is added
U is closed to continue to judge.
Optionally, which comprises
It is spaced the first duration, empties the flow entry of all relay nodes, is used again for each relay node distribution
Family.
Based on above-mentioned purpose the present invention also provides the flow table updating device based on efficiency in a kind of software definition wireless network,
Applied to the wireless network for including base station, relay node and user, comprising:
Data capture unit, for obtaining the user location of the node energy of each relay node and each user in wireless network；
It is also used to for the relay node being ranked up from high to low according to node energy；
Control unit is accessed, for since first relay node, according to the sequence, by the relay node services
User in range accesses the relay node, until the relay node reaches preset energy optimization；It is also used to
After distributing user for relay node described in the last one, by user's access base station remaining in network.
Optionally, the data capture unit is used to obtain the service range of the relay node；Calculate the relaying section
Point, for the user for being not more than the relay node services range at a distance from the relay node, is established at a distance from each user
Flow entry of the relay node to the user；The access control unit is used for will be with the relaying according to the flow entry
The distance of node accesses the relay node no more than the user of the relay node services range.
Optionally, the energy optimization includes:
The access control unit is used to the user within the scope of the relay node services accessing the relay node
During, before each user's access, if calculating user access, next unit of the relay node in access
The energy consumed in time；Whether the energy for being also used to judge that the relay node consumes within next unit time of access reaches
The stable energy estimated to the relay node in next unit time of the unit time of the access；If reaching, determine
The relay node reaches preset energy optimization.
Optionally, relay node is expressed as Rm, user is expressed as U by 1 < m < Mn, 1 < n < N；In expression
After node RmTo user UnFlow entry；Indicate whole user U in set UnPass through flow entry respectivelyIt connects
Enter relay node RmWhen, relay node RmWhole energy consumption；
The stable energy for enabling the relay node estimate in next unit time of the unit time of the access is expressed asWhereinIndicate relay node Rm?In a unit time
The energy of acquisition,Indicate relay node Rm?The energy state of a unit time；εmaxIndicate relay node Rm's
Energy maximum value, when energy reaches εmaxWhen relay node RmEnergy is not further added by；εminIndicate relay node RmEnergy it is minimum
Value, when energy is lower than εminWhen relay node RmIt is unavailable；
The energy optimization includes: that the access control unit is used for by relay node RmUse in service range
During the relay node is accessed at family, before each user's access, set U is added in the user；Judge whether
MeetIf satisfied, determining to reach the energy optimization, if not satisfied, next user is added
Enter set U to continue to judge.
Optionally, the access control unit empties the flow entry of all relay nodes for the first duration of interval,
Described device is each relay node distributing user again.
From the above it can be seen that the flow table based on efficiency in a kind of software definition wireless network provided by the invention is more
New method and device make the stabilization time of each relay node energy to the greatest extent may be used by accessing user's quantity of each relay node of distribution
It can extend, to prevent the energy loss caused by energy deficiency causes to overflow due to node failure or energy are excessive, to the maximum extent
Capacity usage ratio is improved, the probability that relay node services interrupt is reduced, extends the healthy runing time of wireless network.This reality
The method for applying example has high adaptivity to network environment, is not easily susceptible to the shadow of energy unstability and user mobility
It rings.
Detailed description of the invention
Fig. 1 provides a kind of embodiment of the flow table update method based on efficiency in software definition wireless network for the present invention
Flow diagram；
Fig. 2 is SDN green the first schematic diagram of a scenario of trunked radio network in the embodiment of the present invention；
Fig. 3 provides a kind of optional implementation of the flow table update method based on efficiency in software definition wireless network for the present invention
The flow diagram of example；
Fig. 4 is SDN green the second schematic diagram of a scenario of trunked radio network in the embodiment of the present invention；
Fig. 5 provides a kind of further reality of the flow table update method based on efficiency in software definition wireless network for the present invention
Apply the flow diagram of example；
Fig. 6 provides a kind of modular structure of the flow table updating device based on efficiency in software definition wireless network for the present invention
Schematic diagram.
Specific embodiment
To make the objectives, technical solutions, and advantages of the present invention clearer, below in conjunction with specific embodiment, and reference
Attached drawing, the present invention is described in more detail.
It should be noted that all statements for using " first " and " second " are for differentiation two in the embodiment of the present invention
The non-equal entity of a same names or non-equal parameter, it is seen that " first " " second " only for the convenience of statement, does not answer
It is interpreted as the restriction to the embodiment of the present invention, subsequent embodiment no longer illustrates this one by one.
The flow table based on efficiency in a kind of software definition wireless network is provided in the one aspect of the embodiment of the present invention to update
Method, applied to the wireless network for including base station, relay node and user, which comprises
S10 obtains the node energy of each relay node and the user location of each user in wireless network.
The relay node is ranked up by S11 from high to low according to node energy.
S12, since first relay node, according to the sequence, by the user within the scope of the relay node services
The relay node is accessed, until the relay node reaches preset energy optimization.
S13, after distributing user for the last one described relay node, by user's access base station remaining in network.
Wherein, it in step S11, is ranked up from high to low first, in accordance with node energy, the relaying section more for energy
The problem of preferential distributing user of point, this allows for resource reasonable distribution, such as there are multiple relay nodes in same honeycomb
In the case where, if according to random sequence distributing user, it is possible to will appear the most node of energy and be not allocated to appropriate number
The user of amount, energy harvesting amount is well beyond energy consumption, so that reaching Energy maximum value in a short time causes to waste；Step S12
In, when the user within the scope of the relay node services is accessed relay node, using flow table, the flow table can be considered in fact
It is OpenFlow abstract to one kind of the data forwarding function of the network equipment.In legacy network devices, interchanger and router
Data forwarding need to rely on the two layer MAC address forwarding table saved in equipment or three layers of IP address routing table, and
Flow table used in OpenFlow interchanger is also in this way, only incorporating network at all levels in network in its list item
Configuration information, so that richer rule can be used when carrying out data forwarding.
Fig. 2 describes the scene of a SDN green trunked radio network as SDN cable network, and one typical
SDN wireless network includes data plane and control plane.Relevant device includes being run on the server by one or more
The base station of support OpenFlow agreement of logic controller control, relay node and user (or user equipment, User
Equipment, UE).Flow table in all data plane equipment of controller management, and the forwarding of determination data packet in a network
Path.When a user sends an access request, controller generates matched flow entry, and is sent to and turns
The equipment on path is sent out, later, corresponding equipment checks their memory, then establishes link according to flow entry.
In terms of the isomerism of network, base station is met the needs of Continued communication by traditional energy energy supply, meanwhile, relaying section
Point is energized by green energy resource to avoid additional energy expense.It is green due to the unstability of green energy resource and the mobility of user
Color trunking has different energy state.The collection in logic of the location information and energy state of equipment in the whole network is grasped
Middle controller can optimize the resource allocation in network, and be opened up by dynamic flow table adjustment data packet forward-path and network
It flutters.
Energy optimization, and the sequence according to node energy from high to low is arranged in the present embodiment first, is followed successively by each
Relay node distributes accessing user, until relay node reaches preset energy optimization.The energy optimization refers to,
Enable each relay node under the energy optimization, the even running longest time, obtains the longest " longevity in other words
Life ".In other words, need each relay node after accessing user, consumption and the energy got ground summation in the unit time
In a substantial equilibrium.
From the above it can be seen that access customer number of the method provided in this embodiment by each relay node of distribution
Amount, makes the stabilization time extend as far as possible of each relay node energy, to prevent from leading to node failure or energy mistake because of energy deficiency
More energy loss caused by overflowing improves capacity usage ratio to the maximum extent, reduces the probability that relay node services interrupt,
Extend the healthy runing time of wireless network.The method of the present embodiment has high adaptivity to network environment, is not easy
It is influenced by energy unstability and user mobility.
In an optional embodiment, which comprises
S10 obtains the node energy of each relay node and the user location of each user in wireless network.
The relay node is ranked up by S11 from high to low according to node energy.
S12, since first relay node, according to the sequence, by the user within the scope of the relay node services
The relay node is accessed, until the relay node reaches preset energy optimization.
S13, after distributing user for the last one described relay node, by user's access base station remaining in network.
Wherein, in step S12, the user by within the scope of the relay node services accesses the relay node, tool
Body includes:
S20 obtains the service range of the relay node.
S21 calculates the relay node at a distance from each user, to be not more than in described at a distance from the relay node
After the user of node serve range, establish the relay node to the user flow entry.
S22 will be not more than the relay node services range according to the flow entry at a distance from the relay node
User accesses the relay node.
The present embodiment further illustrates the relationship of node serve range and accessing user.The relay node
Service range be it is preset, specifically will according to the transmission power of relay node, position can factor be determined, in difference
After the service range of node may be different.
In another optional embodiment, the energy optimization includes:
S30, during the user within the scope of the relay node services is accessed the relay node, in each institute
Before stating user's access, if calculating user access, the energy that the relay node consumes within next unit time of access.
Whether S31, the energy for judging that the relay node consumes within next unit time of access reach the relaying
The stable energy that node is estimated in next unit time of the unit time of the access；If reaching, the relaying section is determined
Point reaches preset energy optimization.
Wherein, the stable energy that next unit time is estimated refers to the energy value that relay node subsequent time is estimated,
It is only poor with the Energy maximum value of relay node and the mean value of energy-minimum.After relay node reaches Energy maximum value, relaying
Node energy is not further added by；After relay node reaches energy-minimum, relay node is unavailable.
The present embodiment obtain it can after accessing user as long as possible by estimating to relaying node energy consumption
The energy stabilization time, to ensure that before next period updates user's access state, each relay node can be maximum
State that is available and not generating energy dissipation is kept to limit, to promote the energy ecology and health of entire wireless network
Degree.
Above-mentioned steps S30 and the S31 energy optimization proposed are further described below.
Consider a controller being placed on base station by one and a series of green relaying R={ R1,R2...RMComposition
Cellular radio, each relay node is connected with base station, we defineIndicate relay node RmAt the moment
Green energy state.User is expressed as set U={ U1,U2...UN, each user is by access relay node or directly
Access base station accesses network,Define user UmArrive the distance between access device.
SDN green trunked radio network establishes network connection by issuing flow table to relevant equipment, will flow accordingly
List item is expressed asIfSo indicate user UnBy connecting relay node RmNetwork is accessed, ifSo user UnNetwork is accessed by being directly connected to base station B.
Analyze propagation model first, the communication in trunked radio network includes the communication of base station and relay node, base station and
The communication between communication and relay node and user between user, transmission range and the relationship received between power can be write
At:
(1)
WhereinD, λ, θ are defined respectively receives power, transmission power, transmission range, path loss and corrected parameter.
According to Shannon's theorems, in order to maintain a stable transmission rate R0, it receives power and needs to meet:
Wherein W and N0Define transmission bandwidth and white Gaussian noise power density (considering additive white Gaussian noise).
Then the relaying energy consumption mould analyzing the base station energy consumption model by traditional energy power supply respectively and being powered by green energy resource
Type, the application are analyzed using the independent energy consumption model of load.
1) for base station, the relationship between transmission range and energy consumption can be indicated are as follows:
Wherein NsecAnd NantThe antenna amount of definition sector quantity and each sector respectively.The covering radius of base station generally exists
Between 500m to 2500m, covering domain is generally more than 90%.Base station dynamic energy consumption coefficient aBIncluding power amplification benefit, cooling, electricity
Pond backup etc., coefficient bBConsider the energy consumption unrelated with transimission power except energy consumption in addition to that mentioned above.General base station is placed in
Roof height and there are three with specific quantity antenna three sectors.
Base station connects all relay node in cell, at the same with a part of user's direct communication, therefore the transmitting of base station
Power can be write as:
In formula (4),Indicate the transmitting function consumed when base station is communicated with all relay nodes in service range
Rate, whereinIndicate base station and relay node RmThe transmission power consumed when communication；Indicate base station with
The transmission power that user in service range consumes when communicating, whereinIndicate base station and user UnFlow table when communication
,Indicate base station and user UnThe transmission power consumed when communication.
2) corresponding with base station, relay node is energized by green energy resource, and green energy resource state is depended on obtaining and be consumed
Energy, in the unit timeIt is interior, relay node RmGreen energy resource state can be written to:
WhereinWithRespectively indicate relay node RmIn the chronomereThe energy of interior acquisition and consumption,Indicate the energy state at a moment, special, we defineAs initial time state.
The green energy resource of acquisition depends on network ambient enviroment,Therefore it can be modeled as random process, we will
The green energy resource obtained in unit time is handled as stochastic variable, uses μ respectivelyaAnd vaIndicate its mean value and variance, the mean value
Energy source and environment are each depended on variance.
The whole energy consumption of relayingSimilar to base station energy consumption, but relatively low and function is reduced, for example, relaying
Node only one sector one antenna, the transmission power of relay node and whole energy consumption are as follows:
WhereinIndicate part relevant to transmission power,Indicate to include signal processing, cooling system, battery
Backup is equal to the unrelated energy consumption of transmission power.
In chronomereIt is interior, RmService, therefore R are provided for usermPower can be written as:
Therefore,It can be expressed asWhereinIt is under conditions of no flow table administrative mechanism
It can not determine, therefore in this case due to the mobility of userIt can also be modeled as a random process,
The energy that consumption is relayed in the unit time is expressed as a mean value for we and variance is respectively μbVbStochastic variable.
Since energy is unstable, the shortage and saturation problem of energy are caused, relay node occurs following in the process of running
Two kinds of energy state:
1) green energy is saturated.Relay node RmThe energy of the energy specific consumption of acquisition is more,Sustainable growth, directly
A fixed value ε is reached to a certain momentmax, in this case, the green energy resource of acquisition cannot be stored, this problem is drawn
Play the decline of green energy resource utilization rate.
2) green energy shortage.Relay node RmThe energy of acquisition is less than the energy of consumption,It is lasting reduce until
The a certain moment is up to a fixed value εmin.In this case, RmIt is unavailable, in order to keep the continuity of service, it is connected in this
User after node needs to be switched to base station, meanwhile, notification controller is further processed by equipment.
In order to make this problem with more generality, we define energy transfer timeAs relay node
RmEnergy state from initial value ε0It is transferred to the time required for ε, it may be assumed that
Therefore, the green energy stable time can be written as:
In order to maximize the stable timeIt is corresponding to define relay node RmThe green energy probability of stability carry out table
Show green energy resource both unsaturated or unbroken probability within the time [0, Φ], as follows:
When Φ is a unit time, the relationship of the mean value and energy stabilization probability of stablizing the time can be written to:
Therefore, for relay node RmA maximum energy stabilization time can be obtainedIt is as follows by solving the problems, such as
To realize the maximization of energy stabilization probability:
In order to analyze this problem, it is contemplated that a unit timeUnder, formula (5) can be written to difference
Formula:
Then we define time diffusionWherein k → ∞,It can be represented as:
Due toWithIt is incoherent random process, we can define random process:
Wherein f (i) is a series of independent stochastic variables, and therefore, when k → ∞, we can pass through central limit
Theorem obtainsFirstly, f's (i) and it can be taken as the variable of a normal state random distribution, it is as follows:
(16)
Wherein μfAnd νfIt indicates mean value and variance, can be calculated by following formula:
Since the energy for obtaining and consuming all is random process, in the timeThe self-energy probability of stability can pass through
Formula (10) is calculated:
Wherein F (x) indicates the normal distyribution function of standard, our same available timesInterior energy stabilization
Probability.
According to the characteristic of normal distyribution function, we can obtain maximum by following formula
I.e.
(21)
Accordingly maximum can be obtained by meeting following formula
Due to the mobility of user and the unstability of green energy resource, the μ at each moment is obtaineda, νa, μb, νbIt is very tired
Difficulty, but in SDN green junction network, we can be adjusted by managing flow entry according to energy state's
Value is realized to μbAnd νbOptimization, to each green relay node, the energy optimization of consumption can be written as:
Wherein
Due to acquisition green energy resource it is difficult to predict and have certain continuity, Wo MenyongInstead ofFor the ease of statement, the stable energy name estimated with next unit timeIt indicatesMoment
Point RmEstimate difference of the gross energy relative to its Energy maximum value and minimum value mean value.
For more relaying cells, which will become the optimization problem of a multidimensional, as follows:
In some alternative embodiments, relay node is expressed as Rm, user is expressed as U by 1 < m < Mn, 1 < n
< N；Indicate relay node RmTo user UnFlow entry；Indicate whole user U in set UnLead to respectively
Cross flow entryAccess relay node RmWhen, relay node RmWhole energy consumption；
The stable energy for enabling the relay node estimate in next unit time of the unit time of the access is expressed asWhereinIndicate relay node Rm?In a unit time
The energy of acquisition,Indicate relay node Rm?The energy state of a unit time；εmaxIndicate relay node Rm's
Energy maximum value, when energy reaches εmaxWhen relay node RmEnergy is not further added by；εminIndicate relay node RmEnergy it is minimum
Value, when energy is lower than εminWhen relay node RmIt is unavailable；
The energy optimization includes: that the user within the scope of the relay node services is being accessed the relay node
During, before each user's access, set U is added in the user；Judge whether to meetIf satisfied, determining to reach the energy optimization, collect if not satisfied, next user is added
U is closed to continue to judge.
In another optional embodiment, which comprises
S10 obtains the node energy of each relay node and the user location of each user in wireless network.
The relay node is ranked up by S11 from high to low according to node energy.
S12, since first relay node, according to the sequence, by the user within the scope of the relay node services
The relay node is accessed, until the relay node reaches preset energy optimization.
S13, after distributing user for the last one described relay node, by user's access base station remaining in network.
S40 is spaced the first duration, empties the flow entry of all relay nodes, is again each relay node point
With user.
Step S40 is actually indicated, at interval of the first duration, re-execute the steps S10-S13.Here the first duration reason
By above should be no more than after being allocated according to aforementioned user's distribution principle, the minimum value of the energy stabilization time of single node,
Optimal value can be calculated by the expectation of green energy resource in particular situations, can also be imitated according to processor calculation amount and algorithm
Benefit weighs value.
The present embodiment realizes the update for network flow entry, to realize the health fortune for maintaining entire wireless network
Row.
Fig. 5 provides a kind of further reality of the flow table update method based on efficiency in software definition wireless network for the present invention
Apply the flow diagram of example.As shown, in a further embodiment, which comprises
S500 executes time initialization, makes
S501, by relay node according to the momentEnergy state sequence so that
S502 empties all flow entrys, makesWherein
S503, judges to carry out user's distribution since the 1st relay node, judge whether it is the M+1 relaying? if no
It is to execute step S504, it is no to then follow the steps S513.
S504 sorts user according to the distance apart from the relay node from the near to the remote, so thatWhen attempting accessing user, is attempted according to sequence from nearest user, guarantee to connect as far as possible
That enter relay node is all the user being closer, to get preferable access effect.
S505, carries out access attempts since the 1st user, judge whether it is the N+1 user? if it is not, executing step
Rapid S506, it is no to then follow the steps S512.
S506, if it is all relaying to flow entry not relevant with the user in base station, i.e.,If
It is to execute step S507, it is no to then follow the steps S513.
S507, judge the user whether in the service range of relaying, i.e.,If so, executing step
S508, it is no to then follow the steps S513.
S508 relays the energy consumed at this moment if calculating the user accesses relaying
S509 judges whether to meet energy optimization,If satisfied, step S510 is executed,
It is no to then follow the steps S513.
S510 gives flow table issuance relevant to the user to the relay node, i.e. zR,U←1。
S511, return step S505 continue access attempts from next user.
S512, return step S503 continue as next relay node distributing user.
S513 will not yet access user's access base station of relaying in network.
S514 waits next update cycle, return step S501.
The embodiment of the present invention also provides the flow table updating device based on efficiency in a kind of software definition wireless network, is applied to
Wireless network including base station, relay node and user, comprising:
Data capture unit 60, for obtaining the user of the node energy of each relay node and each user position in wireless network
It sets；It is also used to for the relay node being ranked up from high to low according to node energy.
Control unit 61 is accessed, for according to the sequence, the relay node being taken since first relay node
User in range of being engaged in accesses the relay node, until the relay node reaches preset energy optimization；It is also used to
After distributing user for relay node described in the last one, by user's access base station remaining in network.
In some alternative embodiments, the data capture unit 60 is used to obtain the service model of the relay node
It encloses；The relay node is calculated at a distance from each user, to take at a distance from the relay node no more than the relay node
Be engaged in range user, establish the relay node to the user flow entry；The access control unit is used for according to
The user for being not more than the relay node services range at a distance from the relay node is accessed the relay node by flow entry.
In some alternative embodiments, the energy optimization includes:
The access control unit 61 is used to the user within the scope of the relay node services accessing the relaying section
During point, before each user's access, if calculating user access, next list of the relay node in access
The energy consumed in the time of position；It is also used to judge whether is energy that the relay node consumes within next unit time of access
Reach the stable energy that the relay node is estimated in next unit time of the unit time of the access；If reaching, sentence
The fixed relay node reaches preset energy optimization.
In some alternative embodiments, relay node is expressed as Rm, user is expressed as U by 1 < m < Mn, 1 < n <
N；Indicate relay node RmTo user UnFlow entry；Indicate whole user U in set UnPass through respectively
Flow entryAccess relay node RmWhen, relay node RmWhole energy consumption；
The stable energy for enabling the relay node estimate in next unit time of the unit time of the access is expressed asWhereinIndicate relay node Rm?In a unit time
The energy of acquisition,Indicate relay node Rm?The energy state of a unit time；εmaxIndicate relay node Rm's
Energy maximum value, when energy reaches εmaxWhen relay node RmEnergy is not further added by；εminIndicate relay node RmEnergy it is minimum
Value, when energy is lower than εminWhen relay node RmIt is unavailable；
The energy optimization includes: that the access control unit 61 is used for by relay nodeIn service range
User access the relay node during, before each user's access, set U is added in the user；Judgement
Whether meetIf satisfied, determining to reach the energy optimization, if not satisfied, by next use
Family is added set U and continues to judge.
In some alternative embodiments, the access control unit for be spaced the first duration, empty all it is described in
After the flow entry of node, described device is each relay node distributing user again.
The embodiment of the present invention also provides a kind of electronic equipment, comprising:
At least one processor；And
The memory being connect at least one described processor communication；Wherein,
The memory is stored with the instruction that can be executed by least one described processor, and described instruction is by described at least one
A processor executes, so that at least one described processor is able to carry out the method proposed in any of the above-described embodiment
The embodiment of the present invention also provides a kind of non-transient computer readable storage medium, and the non-transient computer is readable to deposit
Storage media stores computer instruction, and the computer instruction is described in any of the above-described embodiment for executing the computer
Method.
It should be understood by those ordinary skilled in the art that: the discussion of any of the above embodiment is exemplary only, not
It is intended to imply that the scope of the present disclosure (including claim) is limited to these examples；Under thinking of the invention, above embodiments
Or can also be combined between the technical characteristic in different embodiments, step can be realized with random order, and be existed such as
Many other variations of the upper different aspect of the invention, for simplicity, they are not provided in details.
The those of ordinary skill in the field is understood that all or part of the process in realization above-described embodiment method, is
Relevant hardware can be instructed to complete by computer program, the program can be stored in a computer-readable storage
In medium, the program is when being executed, it may include such as the process of the embodiment of above-mentioned each method.Wherein, the storage medium can
For magnetic disk, CD, read-only memory (Read-Only Memory, ROM) or random access memory (Random
AccessMemory, RAM) etc..
In addition, to simplify explanation and discussing, and in order not to obscure the invention, it can in provided attached drawing
It is connect with showing or can not show with the well known power ground of integrated circuit (IC) chip and other components.Furthermore, it is possible to
Device is shown in block diagram form, to avoid obscuring the invention, and this has also contemplated following facts, i.e., about this
The details of the embodiment of a little block diagram arrangements be height depend on will implementing platform of the invention (that is, these details should
It is completely within the scope of the understanding of those skilled in the art).Elaborating that detail (for example, circuit) is of the invention to describe
In the case where exemplary embodiment, it will be apparent to those skilled in the art that can be in these no details
In the case where or implement the present invention in the case that these details change.Therefore, these descriptions should be considered as explanation
Property rather than it is restrictive.
Although having been incorporated with specific embodiments of the present invention, invention has been described, according to retouching for front
It states, many replacements of these embodiments, modifications and variations will be apparent for those of ordinary skills.Example
Such as, discussed embodiment can be used in other memory architectures (for example, dynamic ram (DRAM)).
The embodiment of the present invention be intended to cover fall into all such replacements within the broad range of appended claims,
Modifications and variations.Therefore, all within the spirits and principles of the present invention, any omission, modification, equivalent replacement, the improvement made
Deng should all be included in the protection scope of the present invention.
Claims (6)
1. the flow table update method based on efficiency in a kind of software definition wireless network, which is characterized in that be applied to including base station,
The wireless network of relay node and user, which comprises
Obtain the node energy of each relay node and the user location of each user in wireless network；
The relay node is ranked up from high to low according to node energy；
It, will be described in user's access within the scope of the relay node services according to the sequence since first relay node
Relay node, until the relay node reaches preset energy optimization；
After distributing user for relay node described in the last one, by user's access base station remaining in network；
The energy optimization includes:
During the user within the scope of the relay node services is accessed the relay node, connect in each user
Before entering, if calculating user access, the energy that the relay node consumes within next unit time of access；
Judge whether the energy that the relay node consumes within next unit time of access reaches the relay node in institute
State the stable energy that next unit time of the unit time of access estimates；If reaching, determine that the relay node reaches pre-
If energy optimization；
Wherein, relay node is expressed as Rm, user is expressed as U by 1 < m < Mn, 1 < n < N；Indicate relay node Rm
To user UnFlow entry；Indicate whole user U in set UnPass through flow entry respectivelyAccess relaying section
Point RmWhen, relay node RmWhole energy consumption；
Enable the relay node RmIt is expressed as in the stable energy that next unit time of the unit time of the access is estimatedWhereinIndicate relay node Rm?A unit time
The energy of interior acquisition,Indicate relay node Rm?The energy state of a unit time；εmaxIndicate relay node Rm
Energy maximum value, when energy reaches εmaxWhen relay node RmEnergy is not further added by；εminIndicate relay node RmEnergy it is minimum
Value, when energy is lower than εminWhen relay node RmIt is unavailable；
The energy optimization includes: by relay node RmDuring user in service range accesses the relay node,
Before each user's access, set U is added in the user；Judge whether to meetIf full
Foot, judgement reach the energy optimization, if not satisfied, next user addition set U is continued to judge.
2. the method according to claim 1, wherein the user by within the scope of the relay node services connects
Enter the relay node, specifically include:
Obtain the service range of the relay node；
The relay node is calculated at a distance from each user, to take at a distance from the relay node no more than the relay node
Be engaged in range user, establish the relay node to the user flow entry；
The user for being not more than the relay node services range at a distance from the relay node is accessed according to the flow entry
The relay node.
3. the method according to claim 1, wherein the described method includes:
It is spaced the first duration, the flow entry of all relay nodes is emptied, is again each relay node distributing user.
4. the flow table updating device based on efficiency in a kind of software definition wireless network, which is characterized in that be applied to including base station,
The wireless network of relay node and user, comprising:
Data capture unit, for obtaining the user location of the node energy of each relay node and each user in wireless network；Also use
In the relay node is ranked up from high to low according to node energy；
Control unit is accessed, for since first relay node, according to the sequence, by the relay node services range
Interior user accesses the relay node, until the relay node reaches preset energy optimization；It is also used to for most
After relay node described in the latter distributes user, by user's access base station remaining in network；
The energy optimization includes:
The access control unit is used in the mistake that the user within the scope of the relay node services is accessed to the relay node
Cheng Zhong, before each user's access, if calculating user access, next unit time of the relay node in access
The energy of interior consumption；Whether the energy for being also used to judge that the relay node consumes within next unit time of access reaches institute
State the stable energy that relay node is estimated in next unit time of the unit time of the access；If reaching, described in judgement
Relay node reaches preset energy optimization；
Wherein, relay node is expressed as Rm, user is expressed as U by 1 < m < Mn, 1 < n < N；Indicate relay node Rm
To user UnFlow entry；Indicate whole user U in set UnPass through flow entry respectivelyAccess relaying section
Point RmWhen, relay node RmWhole energy consumption；
The stable energy for enabling the relay node estimate in next unit time of the unit time of the access is expressed asWhereinIndicate relay node Rm?A unit time
The energy of interior acquisition,Indicate relay node Rm?The energy state of a unit time；εmaxIndicate relay node Rm
Energy maximum value, when energy reaches εmaxWhen relay node RmEnergy is not further added by；εminIndicate relay node RmEnergy it is minimum
Value, when energy is lower than εminWhen relay node RmIt is unavailable；
The energy optimization includes: that the access control unit is used for by relay node RmUser in service range connects
During entering the relay node, before each user's access, set U is added in the user；Judge whether to meetIf satisfied, determining to reach the energy optimization, collect if not satisfied, next user is added
U is closed to continue to judge.
5. device according to claim 4, which is characterized in that the data capture unit is for obtaining the relay node
Service range；The relay node is calculated at a distance from each user, to be not more than in described at a distance from the relay node
After the user of node serve range, establish the relay node to the user flow entry；The access control unit is used for
It will be not more than described in user's access of the relay node services range at a distance from the relay node according to the flow entry
Relay node.
6. device according to claim 4, which is characterized in that the access control unit is for being spaced the first duration, clearly
The flow entry of the empty all described relay node, described device is each relay node distributing user again.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610899593.9A CN106454896B (en) | 2016-10-14 | 2016-10-14 | A kind of flow table update method and device based on efficiency in software definition wireless network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610899593.9A CN106454896B (en) | 2016-10-14 | 2016-10-14 | A kind of flow table update method and device based on efficiency in software definition wireless network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106454896A CN106454896A (en) | 2017-02-22 |
| CN106454896B true CN106454896B (en) | 2019-06-18 |
Family
ID=58174493
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610899593.9A Active CN106454896B (en) | 2016-10-14 | 2016-10-14 | A kind of flow table update method and device based on efficiency in software definition wireless network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106454896B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102238685A (en) * | 2010-05-06 | 2011-11-09 | 华为技术有限公司 | Method and equipment for relay node selection and power distribution in wireless relay network |
| CN102917446A (en) * | 2012-09-29 | 2013-02-06 | 北京邮电大学 | Environmental protection and energy conservation oriented dynamic cell dormancy method |
| CN103517365A (en) * | 2012-06-27 | 2014-01-15 | 中兴通讯股份有限公司 | Information transmission method based on wireless sensor network and apparatus thereof |
| CN103857020A (en) * | 2012-12-04 | 2014-06-11 | 天津中兴软件有限责任公司 | Information transmission method based on wireless sensor network |
| CN105120501A (en) * | 2015-07-07 | 2015-12-02 | 华中科技大学 | Green communication method with energy-renewable wireless Mesh network |
| CN105188106A (en) * | 2015-09-24 | 2015-12-23 | 浙江大学 | Energy cooperative method of relay system with power supplied by wireless energy transmission |
-
2016
- 2016-10-14 CN CN201610899593.9A patent/CN106454896B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102238685A (en) * | 2010-05-06 | 2011-11-09 | 华为技术有限公司 | Method and equipment for relay node selection and power distribution in wireless relay network |
| CN103517365A (en) * | 2012-06-27 | 2014-01-15 | 中兴通讯股份有限公司 | Information transmission method based on wireless sensor network and apparatus thereof |
| CN102917446A (en) * | 2012-09-29 | 2013-02-06 | 北京邮电大学 | Environmental protection and energy conservation oriented dynamic cell dormancy method |
| CN103857020A (en) * | 2012-12-04 | 2014-06-11 | 天津中兴软件有限责任公司 | Information transmission method based on wireless sensor network |
| CN105120501A (en) * | 2015-07-07 | 2015-12-02 | 华中科技大学 | Green communication method with energy-renewable wireless Mesh network |
| CN105188106A (en) * | 2015-09-24 | 2015-12-23 | 浙江大学 | Energy cooperative method of relay system with power supplied by wireless energy transmission |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106454896A (en) | 2017-02-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Shamsan Saleh et al. | A survey on energy awareness mechanisms in routing protocols for wireless sensor networks using optimization methods | |
| Sharma et al. | Heterogeneity consideration in wireless sensor networks routing algorithms: a review | |
| Rajaram et al. | Multi-hop optimized routing algorithm and load balanced fuzzy clustering in wireless sensor networks | |
| Jakobsen et al. | DEHAR: A distributed energy harvesting aware routing algorithm for ad-hoc multi-hop wireless sensor networks | |
| CN109818866B (en) | Energy awareness and multidimensional parameter perception service quality guarantee routing method | |
| CN103179628B (en) | Based on the method for the clustering routing of wireless sensing net node middleware | |
| Zhu et al. | Energy-efficient tree-based message ferrying routing schemes for wireless sensor networks | |
| CN102711180B (en) | Cluster head multiple selection energy balance routing method | |
| Tsoumanis et al. | Energy-efficient sink placement in wireless sensor networks | |
| CN110381161A (en) | Based on the resource regulating method of game theory in electric power Internet of things system | |
| Noh et al. | Using a dynamic backbone for efficient data delivery in solar-powered WSNs | |
| Sengul et al. | A survey of adaptive services to cope with dynamics in wireless self-organizing networks | |
| CN103595610B (en) | A kind of the anti-of non-deterministic source demand multicast virtual network ruins mapping method | |
| CN112311827A (en) | Intelligent ammeter management system and method | |
| Ibrahim | Enhanced power management scheme for embedded road side units | |
| CN106454896B (en) | A kind of flow table update method and device based on efficiency in software definition wireless network | |
| Tsoumanis et al. | A recharging distance analysis for wireless sensor networks | |
| Asghari et al. | Energy and connectivity aware resource optimization of nodes traffic distribution in smart home networks | |
| CN103686944A (en) | Gateway selection method for interconnection of cellular network and multi-hop wireless sensing network | |
| CN108199873B (en) | Node topology control method and node topology control system | |
| Kollias et al. | Seasonally aware routing for thermoelectric energy harvesting wireless sensor networks | |
| Torres et al. | Improving lifetime and availability for ad hoc networks to emergency and rescue scenarios | |
| Karthikeya et al. | Power-aware gateway connectivity in battery-powered dynamic IoT networks | |
| Cao et al. | Node placement of linear wireless multimedia sensor networks for maximum network lifetime | |
| CN103888982B (en) | A kind of management in content center wireless network and control node selection method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |