CN105553749A - ICN logical topology construction method based on SDN - Google Patents
ICN logical topology construction method based on SDN Download PDFInfo
- Publication number
- CN105553749A CN105553749A CN201610109727.2A CN201610109727A CN105553749A CN 105553749 A CN105553749 A CN 105553749A CN 201610109727 A CN201610109727 A CN 201610109727A CN 105553749 A CN105553749 A CN 105553749A
- Authority
- CN
- China
- Prior art keywords
- link
- network
- node
- icn
- logic
- 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/12—Discovery or management of network topologies
Abstract
The invention provides an information center network (ICN) logical topology construction method based on software defined networking (SDN) and belongs to the technical field of the internet. Due to the fact that the ICN framework undergoes fundamental change compared with the TCP/IP framework, the existing network topology structure and ICN flow distribution are not matched, and in order to achieve matching between the topology structure and ICN flow distribution, by means of the method, reconstruction of network logical topology is achieved through a logic closing link mechanism and a logic adding link mechanism. To be specific, firstly, aggregation of a logic closing link is determined in real time through a hidden markov model in a spatial state transition graph which is constructed according to ICN flow distribution and has hidden markov characteristics; secondly, link aggregation and corresponding bandwidth are added through the maximum-flow minimum-cut theorem positioning logic in a weighting directed complex network constructed according to ICN flow distribution. By means of the method, an effective path is provided for further optimization of ICN flow.
Description
Technical field
The invention belongs to Internet technical field, the further optimization relating to ICN flow provides a kind of effective approach.
Background technology
In order to adapt to the transformation to the huge volumes of content obtaining mode of receiver-initiated of end to end communication pattern that internet, applications drives by sender, strengthen network to the support of the aspects such as fail safe, quality of service, mobility, extensibility simultaneously, researchers propose the new network architectural framework of a class centered by information in recent years, be referred to as information centre's network (Information-CentricNetworking is called for short ICN).For the severe pressure that the quick growth alleviating current network flow causes the network bandwidth, ICN adds the built-in buffer memory of the whole network.Now there are some researches show, in ICN, only carry out by isolated caching mechanism the performance boost that optimized network flow obtains is limited, because ICN framework is compared with the framework of TCP/IP, there occurs the change of essence, as: in ICN, multicast has become the universal pattern of communication, causes existing network topology structure not mated with the flow distribution of ICN, thus, build the logical topological structure being adapted to ICN flow distribution and become the strong approach optimizing ICN network traffics.For this reason, patent of the present invention is on the basis based on SDN (software defined network) sensing network resource and network state, closed by logic and increase the topological structure that LINK RECONFIGURATION is adapted to ICN flow distribution, the further optimization for ICN flow provides a kind of effective approach.
Related work
Because ICN changes Internet Transmission based on end-to-end pattern, as: in ICN, multicast has become the universal pattern of communication, and so, which type of network topology is more suitable for ICN network, and at present, the research of this respect is less.Therefore, the method for some network topologies reconstruct related to the present invention in complex network is only summarized below.The people such as Liu
[1]the strategy of the link of closing between the large node of Connected degree is proposed.The people such as Huang
[2]the impact that the neighbours of the large node of degree of considering distribute on network traffics, improves the method for Liu.The people such as Cai Jun
[3]community structure Network Based reduces the characteristic of network transmission performance, proposes the closedown of a kind of logic machine-processed with the topology reconstruction improving network transmission performance to the link that network corporations characteristic contribution degree is large.The people such as Huang
[4]propose increase longest distance in network two nodes between the strategy of link.The people such as Zhang
[5]improve on this basis, the betweenness of two nodes and the distance between them are united as the foundation increasing link.
The research range of above method is all confined to undirected complex network of having no right, and does not all consider the dynamic variation characteristic of network, therefore can not directly apply to the network topology reconstruct of ICN.
[1]LIUZ,HUMB,JIANGR,etal.Methodtoenhancetrafficcapacityforscale-freenetworks[J].PhysicalReviewE,2007,76(3):037101.
[2]WEIH,TOMMYWSC.Anefficientstrategyforenhancingtrafficcapacitybyremovinglinksinscale-freenetworks[J].JournalofStatisticalMechanics:TheoryandExperiment,2010,2010(1):2-12.
[3] Cai Jun, Yu Shunzheng. a kind of management strategy [J] of effective raising scales-free network load capacity. Acta Physica Sinica, 2013,62 (5): 058901.
[4]HuangW,TommyWS.Effectivestrategyofaddingnodesandlinksformaximizingthetrafficcapacityofscale-freenetwork[J].Chaos,2010,20:033123.
[5]ZhangS,LiangMG,JiangZY,etal.Effectivestrategyofaddinglinksforimprovingnetworktransportefficiencyoncomplexnetwork[J].InternationalJournalofModernPhysicsC,2014,25(6):1450014.
Summary of the invention
Patent of the present invention is under SDN and ICN merges framework, and increase link model by construction logic closedown and logic, reconstruct is adapted to the topological structure of ICN flow distribution, and the further optimization for ICN flow provides a kind of effective approach.Here is the construction method that logic closedown link model and logic increase link model.
Logic closes link model: with the network equipment such as router, switch for node, if there be M-1 node in network, the All hosts in network is all regarded as one " dummy node ", as M node of this network.When, user larger at network is many, there is a large amount of stream in imagination network, the stream of often kind of trend all exists with certain probability.Packet in each stream transfers to another node from a node, and according to destination routing mechanism, choosing of down hop has nothing to do with the source of this stream and its previous node.When stable state, the flow flowing into network is equal with the flow arriving destination, so the packet that supposition arrives destination node will transfer to certain source node.When the link regarded as between " spatiality ", node regards " transfer relationship between spatiality " as network node, just constitute the spatiality transition diagram that has Markov property.Can suppose that router i is with probability a
ijrandomly to its adjacent router j forwarding data bag, and meet:
wherein when router k and router i is non-conterminous, a
ik=0.Obviously, be λ by the Mean Speed of the packet on link E (i, j)
ij=a
ijλ
i. the number-of-packet by link E (i, j) within the unit interval is a stochastic variable
wherein subscript t represents the statistical value of t time period.
A packet in network will arrive destination through a series of router and link.So in the t time period, a packet is in the probability of router i, can calculate according to the historical data of network traffics distribution, i.e. P [s
t=i|o
1 → t], wherein o
tthe statistical observation in the t time period to each bar link flow of the whole network, namely
wherein i
k, j
krepresentation node i
kwith node j
kbetween link, subscript 1 → t represents observation sequence from the time period 1 to time period t.
Logic increases link model: increase in the position of link and the selection of corresponding bandwidth in logic, first offered load mode is built according to the communication mechanism of ICN, then derive based on Complex Networks Theory and increase the target function of link, the B of all nodes in preliminary result of study display-object function and network
jthe minimum value of maximum, wherein B
jbe defined as effective betweenness of node j: B
j=w
j/ w, wherein, w is the total bandwidth from institute's active node to all destination nodes, w
jbe through the total bandwidth in node j path.We increase the set of link and corresponding bandwidth by by maximum flow minimum cut theorem positioning logic at patent of the present invention, and its preliminary implementation procedure is as follows:
1. suppose that every bar link (connection) all has capacity limit.
2. add L bar link in a network, the capacity of link l is x
l, its initial value is 0.
3. with x=(x
1..., x
l) be variable, optimization object function: minB
max=minmax{w
j(x) }/w (x)
The algorithm intending adopting is as follows, as shown in Figure 1:
(a) virtual for institute's active node be one " source ", virtual for all destination nodes be one " destination ";
B () obtains all cut set s from virtual source to virtual destination
1(x), s
2(x) ..., s
m(x);
C () obtains all cut set u from virtual source to node j
j, 1(x), u
j, 2(x) ..., u
j,l(x);
(d) obtain from node j to virtual destination all cut set u
j, l+1(x), u
j, l+2(x) ..., u
j, mj(x);
E () is obvious, these cut capacities all have following form:
, wherein, a is cut set Central Plains
Have link capacity and, b
l=0or1, Σ b
lx
lbe newly-increased link in cut set capacity and;
(f) according to maximum flow minimum cut theorem, w
j(x)=min{u
j,k(x): k=1 ..., m
j, w (x)=min{s
k(x): k=1 ..., M};
G () asks x to make the minimization of object function, that is:
concrete method for solving can be iterative computation: first suppose x=0, then, progressively increases the value of each component of x, makes B
maxcontinuous reduction.
Accompanying drawing explanation
Fig. 1 is that max-flow min-cut increases link implementation procedure figure;
Fig. 2 is the logical topology reconfiguration system schematic of the ICN based on SDN;
Fig. 3 is the composition diagram of logical topology reconfiguration mechanism.
Embodiment
Implementation framework schematic diagram of the present invention as shown in Figure 2.
The Internet resources of Step1:SDN chain of command perception ICN and network state, and transfer to the generation of controller completion logic topology reconstruction strategy, in logical topology reconfiguration mechanism generative process, as shown in Figure 3, mainly complete the work of two aspects: logic closes link and logic increases link, and its concrete implementation method is as follows:
Logic closes link strategy: first, according to the perception of SDN chain of command to network link flow, builds space hidden Markov model.Then, determine that logic closes the set of link, and perform this scheme by SDN data surface.The logic that this project proposes is closed link and is determined to be divided into model training and two stages of link-down decision-making (real-time assessment):
A, model training stage
By the perception to network link flow, as the data set of model training.Then use anterior-posterior to algorithm (Forward-BackwardAlgorithm), obtain the parameter value of hidden Markov model.
B, link-down decision phase
After the parameter of hidden Markov model is determined, this model just can be utilized to carry out Real-time Decision to the link that will close, namely calculate the likelihood probability (Likelihood) of each observation sequence relative to model in real time.
Logic increases link strategy:
First, by the link-state information of SDN chain of command sensing network, with router or switch for node, with the network traffics between them for limit builds weighting directed complex networks;
Then, in weighting directed complex networks, increase the set of link and corresponding bandwidth by maximum flow minimum cut theorem positioning logic, and perform this scheme at SDN data surface.Build network traffics mode according to the communication mechanism of ICN, then deriving based on Complex Networks Theory increases the target function of link, the B of all nodes in preliminary result of study display-object function and network
jthe minimum value of maximum, wherein B
jbe defined as effective betweenness of node j: B
j=w
j/ w, wherein, w is the total bandwidth from institute's active node to all destination nodes, w
jbe through the total bandwidth in node j path.The set of link and corresponding bandwidth is increased by by maximum flow minimum cut theorem positioning logic.
Step2: logical topology reconfiguration mechanism is issued to switch stream table and reaches data surface, completes the execution of mechanism.
Claims (4)
1. the ICN logical topology construction method based on SDN, it is characterized in that, logic closes link model: with the network equipment such as router, switch for node, if there be M-1 node in network, All hosts in network is all regarded as one " dummy node ", as M node of this network, when, user larger at network is many, there is a large amount of stream in imagination network, the stream of often kind of trend all exists with certain probability; Packet in each stream transfers to another node from a node, and according to destination routing mechanism, choosing of down hop has nothing to do with the source of this stream and its previous node; When stable state, the flow flowing into network is equal with the flow arriving destination, so the packet that supposition arrives destination node will transfer to certain source node; When the link regarded as between " spatiality ", node regards " transfer relationship between spatiality " as network node, just constitute the spatiality transition diagram that has Markov property; Can suppose that router i is with probability a
ijrandomly to its adjacent router j forwarding data bag, and meet:
wherein when router k and router i is non-conterminous, a
ik=0; Obviously, be λ by the Mean Speed of the packet on link E (i, j)
ij=a
ijλ
i. the number-of-packet by link E (i, j) within the unit interval is a stochastic variable
wherein subscript t represents the statistical value of t time period;
A packet in network will arrive destination through a series of router and link; So in the t time period, a packet is in the probability of router i, can calculate according to the historical data of network traffics distribution, i.e. P [s
t=i|o
1 → t], wherein o
tthe statistical observation in the t time period to each bar link flow of the whole network, namely
wherein i
k, j
krepresentation node i
kwith node j
kbetween link, subscript 1 → t represents observation sequence from the time period 1 to time period t.
2. the ICN logical topology construction method based on SDN, it is characterized in that, logic increases link model: increase in the position of link and the selection of corresponding bandwidth in logic, first offered load mode is built according to the communication mechanism of ICN, then derive based on Complex Networks Theory and increase the target function of link, the B of all nodes in preliminary result of study display-object function and network
jthe minimum value of maximum, wherein B
jbe defined as effective betweenness of node j: B
j=w
j/ w, wherein, w is the total bandwidth from institute's active node to all destination nodes, w
jbe through the total bandwidth in node j path; We increase the set of link and corresponding bandwidth by by maximum flow minimum cut theorem positioning logic, and its preliminary implementation procedure is as follows:
(1). suppose that every bar link (connection) all has capacity limit;
(2). add L bar link in a network, the capacity of link l is x
l, its initial value is 0;
(3). with x=(x
1..., x
l) be variable, optimization object function: minB
max=minmax{w
j(x) }/w (x);
The algorithm intending adopting is as follows:
(a) virtual for institute's active node be one " source ", virtual for all destination nodes be one " destination ";
B () obtains all cut set s from virtual source to virtual destination
1(x), s
2(x) ..., s
m(x);
C () obtains all cut set u from virtual source to node j
j, 1(x), u
j, 2(x) ..., u
j,l(x);
(d) obtain from node j to virtual destination all cut sets
E () is obvious, these cut capacities all have following form:
wherein, a be original link in cut set capacity and, b
l=0or1, Σ b
lx
lbe newly-increased link in cut set capacity and;
(f) according to maximum flow minimum cut theorem, w
j(x)=min{u
j,k(x): k=1 ..., m
j, w (x)=min{s
k(x): k=1 ..., M};
G () asks x to make the minimization of object function, that is:
concrete method for solving can be iterative computation: first suppose x=0, then, progressively increases the value of each component of x, makes B
maxcontinuous reduction.
3. the ICN logical topology construction method based on SDN according to claim 1, is characterized in that, logic closes link strategy: first, according to the perception of SDN chain of command to network link flow, builds space hidden Markov model; Then, determine that logic closes the set of link, and perform this scheme by SDN data surface; The logic that this project proposes is closed link and is determined to be divided into model training and two stages of link-down decision-making real-time assessment:
A, model training stage, by the perception to network link flow, as the data set of model training; Then use anterior-posterior to algorithm (Forward-BackwardAlgorithm), obtain the parameter value of hidden Markov model;
B, link-down decision phase, after the parameter of hidden Markov model is determined, this model just can be utilized to carry out Real-time Decision to the link that will close, namely calculate the likelihood probability (Likelihood) of each observation sequence relative to model in real time.
4. the ICN logical topology construction method based on SDN, it is characterized in that, logic increases link strategy: first, by the link-state information of SDN chain of command sensing network, with router or switch for node, with the network traffics between them for limit builds weighting directed complex networks;
Then, in weighting directed complex networks, increase the set of link and corresponding bandwidth by maximum flow minimum cut theorem positioning logic, and perform this scheme at SDN data surface.Build network traffics mode according to the communication mechanism of ICN, then deriving based on Complex Networks Theory increases the target function of link, the B of all nodes in preliminary result of study display-object function and network
jthe minimum value of maximum, wherein B
jbe defined as effective betweenness of node j: B
j=w
j/ w, wherein, w is the total bandwidth from institute's active node to all destination nodes, w
jbe through the total bandwidth in node j path, increase the set of link and corresponding bandwidth by by maximum flow minimum cut theorem positioning logic.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610109727.2A CN105553749B (en) | 2016-02-26 | 2016-02-26 | A kind of ICN logical topology construction methods based on SDN |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610109727.2A CN105553749B (en) | 2016-02-26 | 2016-02-26 | A kind of ICN logical topology construction methods based on SDN |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105553749A true CN105553749A (en) | 2016-05-04 |
| CN105553749B CN105553749B (en) | 2018-09-21 |
Family
ID=55832689
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610109727.2A Active CN105553749B (en) | 2016-02-26 | 2016-02-26 | A kind of ICN logical topology construction methods based on SDN |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105553749B (en) |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106161252A (en) * | 2016-06-14 | 2016-11-23 | 电子科技大学 | A kind of load-balancing method being applied to content center net |
| CN106789262A (en) * | 2016-12-26 | 2017-05-31 | 广东技术师范学院 | A kind of complex network community method for detecting abnormality |
| CN107104826A (en) * | 2017-04-05 | 2017-08-29 | 电子科技大学 | A kind of network control coding method based on SDN and NFV |
| CN109272047A (en) * | 2018-09-27 | 2019-01-25 | 山东理工大学 | It is a kind of to meet the Hidden Markov Model state construction and parameter training method that light multicast resource is predicted |
| CN109271382A (en) * | 2018-08-17 | 2019-01-25 | 广东技术师范学院 | A kind of data lake system towards full data shape opening and shares |
| CN109672622A (en) * | 2019-01-26 | 2019-04-23 | 福州大学 | SDN data center selects routing method based on the multipath routing of hidden Markov model |
| CN109983735A (en) * | 2016-09-28 | 2019-07-05 | 迈克菲有限责任公司 | Dynamic Recognition service and data source it is key |
| CN110401478A (en) * | 2019-07-22 | 2019-11-01 | 上海微小卫星工程中心 | A kind of Information Network management-control method based on SDN technology |
| CN110971450A (en) * | 2019-11-06 | 2020-04-07 | 国网浙江武义县供电有限公司 | Information point location ordering method and device for operation and maintenance |
| CN114710571A (en) * | 2022-04-01 | 2022-07-05 | 中国人民解放军战略支援部队信息工程大学 | Data packet processing system |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103716415A (en) * | 2014-01-20 | 2014-04-09 | 北京交通大学 | Resource perception adaption method with good expandability |
| CN103841056A (en) * | 2014-03-13 | 2014-06-04 | 北京邮电大学 | Open storage managing and scheduling method and system based on software-defined network |
| WO2014202030A1 (en) * | 2013-06-21 | 2014-12-24 | 北京邮电大学 | Network controller, switch and method for increasing openflow network capability |
-
2016
- 2016-02-26 CN CN201610109727.2A patent/CN105553749B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2014202030A1 (en) * | 2013-06-21 | 2014-12-24 | 北京邮电大学 | Network controller, switch and method for increasing openflow network capability |
| CN103716415A (en) * | 2014-01-20 | 2014-04-09 | 北京交通大学 | Resource perception adaption method with good expandability |
| CN103841056A (en) * | 2014-03-13 | 2014-06-04 | 北京邮电大学 | Open storage managing and scheduling method and system based on software-defined network |
Cited By (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106161252A (en) * | 2016-06-14 | 2016-11-23 | 电子科技大学 | A kind of load-balancing method being applied to content center net |
| CN106161252B (en) * | 2016-06-14 | 2019-03-15 | 电子科技大学 | A kind of load-balancing method applied to content center net |
| US11496368B2 (en) | 2016-09-28 | 2022-11-08 | Mcafee, Llc | Dynamically identifying criticality of services and data sources |
| CN109983735B (en) * | 2016-09-28 | 2022-04-15 | 迈克菲有限责任公司 | Method, device and storage device for monitoring network topology |
| CN109983735A (en) * | 2016-09-28 | 2019-07-05 | 迈克菲有限责任公司 | Dynamic Recognition service and data source it is key |
| CN106789262A (en) * | 2016-12-26 | 2017-05-31 | 广东技术师范学院 | A kind of complex network community method for detecting abnormality |
| CN107104826B (en) * | 2017-04-05 | 2020-07-07 | 电子科技大学 | Network control coding method based on SDN and NFV |
| CN107104826A (en) * | 2017-04-05 | 2017-08-29 | 电子科技大学 | A kind of network control coding method based on SDN and NFV |
| CN109271382A (en) * | 2018-08-17 | 2019-01-25 | 广东技术师范学院 | A kind of data lake system towards full data shape opening and shares |
| CN109272047A (en) * | 2018-09-27 | 2019-01-25 | 山东理工大学 | It is a kind of to meet the Hidden Markov Model state construction and parameter training method that light multicast resource is predicted |
| CN109672622B (en) * | 2019-01-26 | 2021-01-29 | 福州大学 | Hidden Markov model-based multi-path routing method for SDN data center |
| CN109672622A (en) * | 2019-01-26 | 2019-04-23 | 福州大学 | SDN data center selects routing method based on the multipath routing of hidden Markov model |
| CN110401478A (en) * | 2019-07-22 | 2019-11-01 | 上海微小卫星工程中心 | A kind of Information Network management-control method based on SDN technology |
| CN110971450A (en) * | 2019-11-06 | 2020-04-07 | 国网浙江武义县供电有限公司 | Information point location ordering method and device for operation and maintenance |
| CN110971450B (en) * | 2019-11-06 | 2022-06-24 | 国网浙江武义县供电有限公司 | Information point location ordering method and device for operation and maintenance |
| CN114710571A (en) * | 2022-04-01 | 2022-07-05 | 中国人民解放军战略支援部队信息工程大学 | Data packet processing system |
| CN114710571B (en) * | 2022-04-01 | 2023-05-23 | 中国人民解放军战略支援部队信息工程大学 | Data packet processing system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105553749B (en) | 2018-09-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105553749A (en) | ICN logical topology construction method based on SDN | |
| CN104168620B (en) | Method for routing foundation in wireless multi-hop return network | |
| CN114285758B (en) | Communication network optimization simulation system, method and device based on OPNET | |
| CN104883676B (en) | Cooperative Security communication means under a kind of multiple no-manned plane environment | |
| WO2011144178A1 (en) | Method, apparatus and system for joint optimizations | |
| CN106685745B (en) | A kind of constructing network topology method and device | |
| Zhu et al. | Practical limits on achievable energy improvements and useable delay tolerance in correlation aware data gathering in wireless sensor networks | |
| CN105681438A (en) | Centralized caching decision strategy in content-centric networking | |
| CN104935476A (en) | SDN-based network flow matrix measurement method | |
| CN103581329B (en) | The construction method of peer-to-peer network flow medium live system topological structure based on sub-clustering | |
| CN103701647B (en) | A kind of wireless network topology optimization generates method | |
| Tabatabaei et al. | A fuzzy logic-based fault tolerance new routing protocol in mobile ad hoc networks | |
| Koufoudakis et al. | Probabilistic flooding coverage analysis for efficient information dissemination in wireless networks | |
| CN108093496A (en) | A kind of uniformity network-building method based on ISA100.11a standards | |
| CN104301983B (en) | A kind of Poewr control method based on the estimation of multiple step format channel status | |
| Vijaya Kumar et al. | Neural networks based efficient multiple multicast routing for mobile networks | |
| Wang et al. | A Q-Learning based Routing Optimization Model in a Software Defined Network | |
| Dhull et al. | An improved ant colony optimization (IACO) based multicasting in MANET | |
| Pinheiro et al. | A fuzzy queue-aware routing approach for wireless mesh networks | |
| CN115102831B (en) | Deployment method and system of distributed BGP service | |
| Chen et al. | Information transmission on hybrid networks | |
| Ankita et al. | Performance analysis of zone based route discovery mechanism for MANETs in software defined networking framework | |
| Wei et al. | A stable scheme of application layer multicast for heterogeneous and dynamic networks | |
| Singh et al. | Analytical Study of SEP & M-SEP in Wireless Sensor Network with Heterogeneous Platform | |
| Dhaliwal et al. | Optimization of Cluster Head Selection in Hierarchical Clustered Sensor Networks |
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 | ||
| CP03 | Change of name, title or address |
Address after: 510665 No. 293 Shipai Zhongshan Avenue, Tianhe District, Guangzhou City, Guangdong Province Patentee after: GUANGDONG POLYTECHNIC NORMAL University Address before: 510665 No. 293, Zhongshan Avenue, Guangzhou, Guangdong Patentee before: GUANGDONG POLYTECHNIC NORMAL University |
|
| CP03 | Change of name, title or address | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20220530 Address after: 510665 No. 293 Shipai Zhongshan Avenue, Tianhe District, Guangzhou City, Guangdong Province Patentee after: GUANGDONG POLYTECHNIC NORMAL University Patentee after: ZTE Corp. Address before: 510665 No. 293 Shipai Zhongshan Avenue, Tianhe District, Guangzhou City, Guangdong Province Patentee before: GUANGDONG POLYTECHNIC NORMAL University |
|
| TR01 | Transfer of patent right |