CN108462606A - The method of estimation of key sink node numbers in grid network - Google Patents
The method of estimation of key sink node numbers in grid network Download PDFInfo
- Publication number
- CN108462606A CN108462606A CN201810228832.7A CN201810228832A CN108462606A CN 108462606 A CN108462606 A CN 108462606A CN 201810228832 A CN201810228832 A CN 201810228832A CN 108462606 A CN108462606 A CN 108462606A
- Authority
- CN
- China
- Prior art keywords
- grid network
- network
- key
- nodes
- 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.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0803—Configuration setting
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
- H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
- H04L67/1004—Server selection for load balancing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
-
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- 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 kind of method of estimation of key sink node numbers in grid network, mainly solve the problems, such as that the prior art does not fully consider that inter-node communication energy consumption causes crucial sink node numbers estimated accuracy low, realize the step of be：(1) grid network is built；(2) network energy consumption model is established；(3) network life of each key sink nodes is calculated；(4) computation grid network cost；(5) network life cost ratio is obtained；(6) estimate key sink node numbers in grid network.The present invention reduces network energy consumption, extends network life, in grid network Life Cost than the maximum number for estimating crucial sink nodes by establishing network energy consumption model.
Description
Technical field
The invention belongs to field of communication technology, a kind of grid network in technical field of wireless is further related to
The method of estimation of middle key sink node numbers.The present invention can be used for wireless sensor WSN (Wireless Sensor
Network the grid network that node) has been disposed in network determines key sink node numbers according to the energy consumption of grid network,
So that reaching the optimal effectiveness of a balance between network life and network cost, network performance is improved.
Background technology
Under large-scale wireless sensor WSN (Wireless Sensor Network) network environment, certainly based on low-power consumption
Adapt to the WSN network sections of cluster type layered protocol LEACH (Low Energy Adaptive Clustering Hierarchy)
Point cluster-based techniques also only have studied influence of the variation of the leader cluster node quantity in sensor network to network life, and special needle
Application of the crucial sink node numbers in wireless sensor network is not much.
Paper " more sink node optimizations dispositions methods in wireless sensor network " that Liu Qiang et al. is delivered at it (《It calculates
Machine application》2011,31(9):Key sink node numbers in a kind of grid network node deployment are proposed in 2313-2316) to estimate
Meter method.This method comprises the concrete steps that, the first step：Build network environment, it is assumed that network structure is lattice structure, multiple keys
Sink nodes are uniformly distributed in a network, crucial sink nodes without overlap and all key node death times it is consistent；Second step：
Build network energy model；Third walks：The theoretical formula of network life is obtained according to energy model；4th step：Build network generation
Valence function；5th step：Derive that network life cost than formula, estimates crucial sink node numbers optimal in network.The party
Although method overcomes the problems such as small operand of the existing technology, complicated network structure, but the deficiency that this method still has
Place is：The communication energy consumption between node is not fully considered, and crucial sink node numbers is caused to increase.
Appoint torch in a kind of patent document " node deployment of novel cluster wireless sensor network lifetime of its application
Method " (application number：CN201310296482.5；Application publication number：CN103391555A a kind of cluster wireless biography is disclosed in)
The maximized node deployment method of sensor network life.This method comprises the concrete steps that, the first step：It obtains meeting what covering required
The data volume and energy expenditure rule that same district node does not undertake in the Cluster Networks that minimum density is uniformly disposed, and provide the network longevity
The computational methods of life.Second step：By the node energy consumption function of different zones, the feelings certain in deployment interstitial content have been calculated
Under condition, the node deployment density curve of different zones；Third walks：Node density according to different zones, which changes, increases deployment node
The cluster head rotation frequency in region, advanced optimizes the node deployment density of different zones in network, network life is made to maximize.It should
Although method solves the problems, such as not fully considering inter-node communication energy consumption, but the shortcoming that this method still has is：Net
Network node structure is single, does not fully consider that inter-node communication energy consumption causes network life to decline, and key sink is saved in grid network
Point number estimated accuracy is low.
Invention content
The purpose of the present invention is in view of the deficienciess of the prior art, proposing key sink nodes in a kind of grid network
Several methods of estimation.
Realizing the thinking of the object of the invention is, network energy consumption model is established in grid network according to wireless communication energy consumption,
The network life of each key sink nodes is acquired according to network energy consumption model, is obtained all nodes in grid network and is communicated
Cost, and then obtain grid network Life Cost ratio, finally the input raster network in grid network Life Cost is than formula
Data, emulation obtain in grid network intend deployment crucial sink node numbers.
To achieve the above object, specific implementation step of the invention is as follows：
(1) grid network is built：
(1a) builds the grid network of a 9x9 node, and all nodes are uniformly distributed in grid network, grid network
In it is each between key sink nodes and other key sink nodes without overlapping, and all key sink node death times one
It causes；
(1b) sets the primary power of each key sink nodes to 100 cokes；
(2) network energy consumption model is established：
According to wireless communication energy consumption, network energy consumption model is established；
(3) according to the following formula, the network life of each key sink nodes is calculated：
Wherein, LiIndicate that the network life of i-th of key sink node in grid network, G indicate each key sink sections
The value of the primary power of point, G is 100 burnt, and N indicates grid network interior joint sum, and the value of N is 81, and n indicates crucial
Sink node total numbers, e indicate that other node numbers around each key sink nodes, α are other outer in data transmission procedure
The value of the energy expenditure caused by factor, α is 0.05 burnt；
(4) according to the following formula, computation grid network cost：
A=N × B+n × C
Wherein, A indicates that grid network cost, B indicate that the cost of ordinary node in grid network, C indicate in grid network
The cost of crucial sink nodes；
(5) network life cost ratio is obtained：
With the network life divided by grid network cost of each key sink nodes, using its result as network life cost
Than；
(6) data of input raster network：
The data of input raster network in network life cost is than formula, it is public to the network life cost ratio of input data
Formula carries out MATLAB emulation, obtains the crucial sink node numbers for intending deployment in grid network.
Compared with the prior art, the present invention has the following advantages：
First, due to present invention utilizes wireless communication energy consumption, establishing network energy consumption model and overcome the prior art and not filling
Divide and consider the problems of that inter-node communication energy consumption causes crucial sink node numbers to increase so that the present invention can be in grid network
In, with low network energy consumption, realize that key sink node numbers are estimated in grid network.
Second, since the present invention establishes network energy consumption model, each key sink sections are acquired according to network energy consumption model
The network life of point, overcomes the prior art and does not fully consider the problem of inter-node communication energy consumption causes network life to decline, make
Must be of the invention extended in network life, with higher estimated accuracy, realize key sink nodes in grid network
Number estimation.
Description of the drawings：
Fig. 1 is the flow chart of the present invention；
Fig. 2 is the analogous diagram of the present invention.
Specific implementation mode：
The present invention will be further described below in conjunction with the accompanying drawings.
Referring to Fig.1, the specific implementation step of the present invention is further described.
Step 1, grid network is built.
The grid network of a 9x9 node is built, all nodes are uniformly distributed in grid network, every in grid network
Without overlapping between a key sink nodes and other key sink nodes, and all key sink node death times are consistent.
Set the primary power of each key sink nodes to 100 cokes.
Step 2, network energy consumption model is established.
Network energy consumption model is established in grid network according to wireless communication energy consumption.
The network energy consumption model of establishing is as follows：
The first step, according to the following formula, each key sink nodes are to other nodes in grid network in computation grid network
The threshold value of transmission data distance；
Wherein, d0Indicate in grid network each key sink nodes to other node transmission datas in grid network away from
From threshold value,Radical sign operation is opened in expression, and ε indicates that the power amplification coefficient power amplification ratio of energy attenuation model, β indicate energy attenuation model
Power coefficient of reduction；
Second step, according to following wireless communication energy consumption formula, i-th of key sink node is to other in computation grid network
The energy that each node transmission data is consumed：
Wherein, Ei(k, d) indicates that i-th of key sink node gives other all sections that its distance is d in grid network
Point sends the energy consumed when k byte datas, and d indicates that each key sink nodes send number to other nodes in grid network
According to distance, the value of d is 0.014 meter, and k indicates that the byte number that key sink nodes are sent to other all nodes, F indicate pass
The energy that key sink nodes are consumed when sending 1 bit data to other all nodes, ε indicate that the power of energy attenuation model is put
Big coefficient, β indicate the power coefficient of reduction of energy attenuation model；
Third walks, and receiving the byte number that other each nodes are sent with each key sink nodes is multiplied by each key sink
Node receives the energy that 1 bit data is consumed, and the energy of data consumption is received using its result as each key sink nodes；
4th step is closed to the energy that other each node transmission datas are consumed plus each with each key sink nodes
Key sink nodes receive the energy that other each node transmission datas are consumed, using its result as network energy consumption model.
Step 3, according to the following formula, in computation grid network each key sink nodes the grid network service life.
Wherein, LiIndicate that the grid network service life of i-th of key sink node in grid network, G indicate each crucial
The primary power of sink nodes itself, N indicate that grid network interior joint sum, n indicate that key sink nodes are total in grid network
Number, e indicate that other node numbers around each key sink nodes, α indicate that other external factors are led in data transmission procedure
The energy expenditure of cause.
Step 4, according to the following formula, the cost that all nodes communicate in computation grid network.
A=N × B+n × C
Wherein, A indicates that the cost that all nodes communicate in grid network, B indicate that ordinary node is mutual in grid network
The cost communicated, C indicate the cost that each key sink nodes are communicated with other each nodes in grid network.
Step 5, according to the following formula, in computation grid network each key sink nodes grid network Life Cost ratio.
Wherein, RiIndicate the grid network Life Cost of i-th of key sink node in grid network.
Step 6, the data of input raster network.
The grid network Life Cost of any key sink nodes is than input raster network in formula in grid network
Data carry out MATLAB emulation than formula to the grid network Life Cost of input data, obtain intending deployment in grid network
Crucial sink node numbers.
The effect of the present invention is described further with reference to emulation experiment：
1. simulated conditions：
Computer hardware configuration surroundings used in the emulation experiment of the present invention are Intel (R) Core (i5-3470)
3.20GHZ central processing units, 7 operating system of memory 8G, WINDOWS, computer simulation software are soft using MATLAB R2014a
Part.
The simulation parameter of the present invention is as follows：
| Symbol | Unit | Meaning | Value |
| k | bit | Transmission data length | 4000 |
| F | nJ·bit-1 | The energy consumption of transmission circuit | 50 |
| ε | pJ·bit-1·m-2 | Indicate free energy attenuation model power amplification coefficient power amplification ratio | 10 |
| β | pJ·bit-1·m-4 | Indicate the power amplification coefficient power amplification ratio of multipath fading channels model | 0.0013 |
| d0 | m | The threshold value of distance | 87.5 |
| N | It is a | Sensing node sum in grid network | 81 |
2. emulation content：
Using the method for estimation of key sink node numbers in grid network of the present invention, to the grid network longevity of input parameter
It orders cost and carries out MATLAB emulation than formula, under three different key sink node costs, respectively obtain three grid networks
In intend the crucial sink node numbers of deployment, simulation result is as shown in Figure 2.
It is indicated with the curve of diamond sign in Fig. 2, it is crucial in grid network when crucial sink nodes cost takes 50 coke
Sink nodes and network life cost than relation curve.From curve as it can be seen that grid network Life Cost ratio is maximum value 8.5
When, the number of key sink nodes is 4 in grid network.
It is indicated with the curve of square mark in Fig. 2, it is crucial in grid network when crucial sink nodes cost takes 100 coke
Sink nodes and network life cost than relation curve.From curve as it can be seen that grid network Life Cost ratio is maximum value 7.3
When, the number of key sink nodes is 3 in grid network.
It is indicated with the curve of triangle mark in Fig. 2, when crucial sink nodes cost takes 100 coke, is closed in grid network
Key sink nodes and network life cost than relation curve.From curve as it can be seen that grid network Life Cost ratio is maximum value 6
When, the number of key sink nodes is 2 in grid network.
By the above emulation experiment it is found that in grid network proposed by the present invention key sink node numbers method of estimation,
It can be in grid network Life Cost than the maximum accurate number for estimating key sink nodes in grid network.
Claims (2)
1. the method for estimation of key sink node numbers in a kind of grid network, which is characterized in that existed according to wireless communication energy consumption
Network energy consumption model is established in grid network, the data of input raster network in grid network Life Cost is than formula, emulation
Obtain intending in grid network the crucial sink node numbers of deployment, the specific steps of this method include as follows：
(1) grid network is built：
(1a) builds the grid network of a 9x9 node, and all nodes are uniformly distributed in grid network, every in grid network
Without overlapping between a key sink nodes and other key sink nodes, and all key sink node death times are consistent；
(1b) sets the primary power of each key sink nodes to 100 cokes；
(2) network energy consumption model is established：
Network energy consumption model is established in grid network according to wireless communication energy consumption；
(3) according to the following formula, in computation grid network each key sink nodes the grid network service life：
Wherein, LiIndicate that the grid network service life of i-th of key sink node in grid network, G indicate each key sink nodes
The primary power of itself, N indicate that grid network interior joint sum, n indicate that key sink node total numbers in grid network, e indicate
Other node numbers around each key sink nodes, α indicate energy caused by other external factors in data transmission procedure
Consumption；
(4) according to the following formula, the cost that all nodes communicate in computation grid network：
A=N × B+n × C
Wherein, A indicates that the cost that all nodes communicate in grid network, B indicate that ordinary node mutually communicates in grid network
The cost of letter, C indicate the cost that each key sink nodes are communicated with other each nodes in grid network；
(5) according to the following formula, in computation grid network each key sink nodes grid network Life Cost ratio：
Wherein, RiIndicate the grid network Life Cost of i-th of key sink node in grid network；
(6) data of input raster network：
In grid network the grid network Life Cost of any key sink nodes than input raster network in formula data,
MATLAB emulation is carried out than formula to the grid network Life Cost of input data, obtains the key for intending deployment in grid network
Sink node numbers.
2. the method for estimation of key sink node numbers in grid network according to claim 1, it is characterised in that：Step
(2) the grid network energy consumption model of establishing described in is as follows：
The first step, according to the following formula, each key sink nodes are sent to other nodes in grid network in computation grid network
The threshold value of data distance；
Wherein, d0Indicate that each key sink nodes are to other node transmission data distances in grid network in grid network
Threshold value,Radical sign operation is opened in expression, and ε indicates that the power amplification coefficient power amplification ratio of energy attenuation model, β indicate the work(of energy attenuation model
Rate coefficient of reduction；
Second step, according to following wireless communication energy consumption formula, i-th of key sink node is to other each in computation grid network
The energy that node transmission data is consumed：
Wherein, Ei(k, d) indicates that i-th of key sink node gives other all nodes transmissions that its distance is d in grid network
The energy consumed when k byte datas, d indicate in grid network each key sink nodes to other node transmission datas away from
From k indicates that the byte number that key sink nodes are sent to other all nodes, F indicate key sink nodes to other all sections
Point sends the energy consumed when 1 bit data, and ε indicates that the power amplification coefficient power amplification ratio of energy attenuation model, β indicate energy attenuation mould
The power coefficient of reduction of type；
Third walks, and receiving the byte number that other each nodes are sent with each key sink nodes is multiplied by each key sink nodes
The energy that 1 bit data is consumed is received, the energy of data consumption is received using its result as each key sink nodes；
4th step adds each key with each key sink nodes to the energy that other each node transmission datas are consumed
Sink nodes receive the energy that other each node transmission datas are consumed, using its result as grid network energy consumption model.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810228832.7A CN108462606B (en) | 2018-03-20 | 2018-03-20 | Method for estimating number of key sink nodes in grid network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810228832.7A CN108462606B (en) | 2018-03-20 | 2018-03-20 | Method for estimating number of key sink nodes in grid network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108462606A true CN108462606A (en) | 2018-08-28 |
| CN108462606B CN108462606B (en) | 2019-12-24 |
Family
ID=63236686
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810228832.7A Active CN108462606B (en) | 2018-03-20 | 2018-03-20 | Method for estimating number of key sink nodes in grid network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108462606B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103391555A (en) * | 2013-07-16 | 2013-11-13 | 任炬 | Novel node distribution method for maximizing service lives of clustering wireless sensor networks |
| CN104486774A (en) * | 2014-12-23 | 2015-04-01 | 北京航空航天大学 | Life optimization method for retransmission-aware clustered wireless sensor networks |
| CN104618997A (en) * | 2015-01-28 | 2015-05-13 | 西安电子科技大学 | Data aggregation method based on non-uniform grids |
| CN104883239A (en) * | 2015-04-13 | 2015-09-02 | 哈尔滨工业大学（威海） | Self-adaptive resolution data reconstruction method based on compressed sensing |
| CN107612806A (en) * | 2017-11-03 | 2018-01-19 | 滁州学院 | Energy of wireless sensor network based on mobile sink node perceives the method for data capture with path architecture |
-
2018
- 2018-03-20 CN CN201810228832.7A patent/CN108462606B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103391555A (en) * | 2013-07-16 | 2013-11-13 | 任炬 | Novel node distribution method for maximizing service lives of clustering wireless sensor networks |
| CN104486774A (en) * | 2014-12-23 | 2015-04-01 | 北京航空航天大学 | Life optimization method for retransmission-aware clustered wireless sensor networks |
| CN104618997A (en) * | 2015-01-28 | 2015-05-13 | 西安电子科技大学 | Data aggregation method based on non-uniform grids |
| CN104883239A (en) * | 2015-04-13 | 2015-09-02 | 哈尔滨工业大学（威海） | Self-adaptive resolution data reconstruction method based on compressed sensing |
| CN107612806A (en) * | 2017-11-03 | 2018-01-19 | 滁州学院 | Energy of wireless sensor network based on mobile sink node perceives the method for data capture with path architecture |
Non-Patent Citations (1)
| Title |
|---|
| 刘强等: "无线传感器网络中多sink节点优化部署方法", 《计算机应用》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108462606B (en) | 2019-12-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111176929B (en) | Edge federal learning-oriented high-energy-efficiency calculation communication joint optimization method | |
| Zhou et al. | Joint cell activation and selection for green communications in ultra-dense heterogeneous networks | |
| CN103491566B (en) | A kind of energy efficiency optimization method towards wireless body area network | |
| Tsiropoulou et al. | Joint utility-based uplink power and rate allocation in wireless networks: A non-cooperative game theoretic framework | |
| Ding et al. | Dk-leach: an optimized cluster structure routing method based on leach in wireless sensor networks | |
| CN102781085B (en) | Femtocell power control method based on interference limitation | |
| Liu et al. | Subchannel and resource allocation in cognitive radio sensor network with wireless energy harvesting | |
| CN111343704B (en) | Combined dormancy and power control method for femto base station in heterogeneous cellular network | |
| Hao et al. | Energy-efficient multi-user mobile-edge computation offloading in massive MIMO enabled HetNets | |
| CN107820309A (en) | The wake-up strategy and time slot optimizing algorithm of low power loss communication equipment | |
| Ashraf et al. | Optimization of the overall success probability of the energy harvesting cognitive wireless sensor networks | |
| Wei et al. | Power allocation in HetNets with hybrid energy supply using actor-critic reinforcement learning | |
| Razzaq et al. | Energy efficient Dijkstra-based weighted sum minimization routing protocol for WSN | |
| CN103269487A (en) | Femtocell network down link dynamic interference management method based on game theory | |
| CN103249109B (en) | Based on the energy-saving routing method of the radio sensing network of irregular cellular automata | |
| Zhou et al. | Multi-server federated edge learning for low power consumption wireless resource allocation based on user QoE | |
| CN114885340A (en) | Ultra-dense wireless network power distribution method based on deep transfer learning | |
| Zhao et al. | Energy-efficient resource allocation for NOMA-based heterogeneous 5G mine internet of things | |
| CN107454601A (en) | The wireless dummy mapping method of inter-cell interference is considered under a kind of super-intensive environment | |
| CN103701647A (en) | Wireless network topology optimizing and generating method | |
| CN108462606A (en) | The method of estimation of key sink node numbers in grid network | |
| CN101175041A (en) | Optimum energy consumption routing method for Ad Hoc network | |
| Jiang et al. | Power Control via Stackelberg Game for Small‐Cell Networks | |
| Solares et al. | Optimal power allocation of a sensor node under different rate constraints | |
| Wei et al. | Joint User Association and Resource Optimization for Multi-Cell NOMA Networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |