CN103117957A - Cache management method based on numbers of message replications and comprehensive effectiveness in opportunistic network - Google Patents

Cache management method based on numbers of message replications and comprehensive effectiveness in opportunistic network Download PDF

Info

Publication number
CN103117957A
CN103117957A CN2013100438204A CN201310043820A CN103117957A CN 103117957 A CN103117957 A CN 103117957A CN 2013100438204 A CN2013100438204 A CN 2013100438204A CN 201310043820 A CN201310043820 A CN 201310043820A CN 103117957 A CN103117957 A CN 103117957A
Authority
CN
China
Prior art keywords
message
network
node
transmission delay
comprehensive effectiveness
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
Application number
CN2013100438204A
Other languages
Chinese (zh)
Other versions
CN103117957B (en
Inventor
刘期烈
李广德
李云
张智慧
冯志宇
廖薪棋
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
CHONGQING INFORMATION TECHNOLOGY DESIGNING CO.,LTD.
Original Assignee
Chongqing University of Post and Telecommunications
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Chongqing University of Post and Telecommunications filed Critical Chongqing University of Post and Telecommunications
Priority to CN201310043820.4A priority Critical patent/CN103117957B/en
Publication of CN103117957A publication Critical patent/CN103117957A/en
Application granted granted Critical
Publication of CN103117957B publication Critical patent/CN103117957B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention relates to a design method of efficient cache management strategy in opportunistic network. The cache management method includes creating a list of message transmission path sustained by each node to calculate numbers of message replications, and creating a network performance comprehensive evaluation index, namely comprehensive effectiveness, according to general delivery rate, general transmission delay and general network overhead, so as to solve the problems that cache sources of nodes are limited in opportunistic network, each message replication carried by the nodes rapidly saturates nodes cache to discontinue storing follow-up message replications and to lead to low delivery rate of network messages and longer general message transmission delay. By the cache management method, message replications in cache are sequenced according to the degree of comprehensive effectiveness, proportions of general delivery rate, general transmission delay and general network overhead of in comprehensive effectiveness can be set respectively, and accordingly, delivery rate of network messages can be effectively increased, general transmission delay of network messages can be shortened and message network overhead can be reduced.

Description

In opportunistic network based on the buffer memory management method of message copy number and comprehensive effectiveness
Technical field
The present invention relates to opportunistic network, relate in particular to the cache management technology that infects route in opportunistic network.
Background technology
Opportunistic network (Opportunistic Networks) based on " store-carry-forward " routing policy, there is the link that is interrupted between node, there is not path end to end between source node and destination node, end-to-end have larger transmission delay, a larger message loss rate, causes the route of opportunistic network can not directly use existing ICP/IP protocol bunch.In opportunistic network, do not need the link that keeps complete between source node and destination node, but communicate swap data by two node motion in the other side's communication range.Opportunistic network adopts the route pattern that is different from legacy network---and " store-carry-forward " pattern, namely the node information of carrying continues motion, until it has an opportunity information is transmitted to other nodes, utilizes other nodes to help transmission information to destination node.
In order to guarantee the successful delivery ratio of message, often keep a plurality of copies of a message in network.In the situation that node resource is limited, the copy of each message that node carries will make its buffer memory saturated rapidly, can't continue to store the message copy of follow-up arrival.When the buffer memory of node is saturated, should selects suitable message for the performance that improves network and abandon.Because node Encounter Time in opportunistic network is limited, the speed of node transmission message is limited, when two nodes met, they often can not have time enough to exchange each other information, for the performance that improves network should preferentially turn the message that network performance is increased.Therefore, the efficient cache management strategy of design is optimized the sequence that message forwards and abandon the overall performance that improves opportunistic network is seemed particularly important.
opportunistic network cache management strategy based on the message copy number mainly contains: (1) GBD (Global Knowledge based Drop) and HBD (History Based Drop) are (referring to document: A.Krifa, C.Baraka, and T.Spyropoulos.Optimal Buffer Management Policies for Delay Tolerant Networks.IEEE SECON, 2008, 260-268): GBD and HBD are based on the strategy that proposes in message copy number situation as can be known in network, by utilizing derivation message copy number and network delivery ratio, the relation of transmission delay, propose the maximization network delivery ratio and minimize the strategy that abandons message copy that transmission delay should adopt respectively.Change the method that method does not propose clear and definite calculating message copy, only considered drop policy, and do not consider the transfer sequence of message copy.EBMP (enhanced buffer management policy) is (referring to document: K.Shin, S.Kim.Enhanced buffer management policy that utilizes message properties for delay-tolerant networks.The Institution of Engineering and Technology, 2011,753-759): in this algorithm, a kind of method of estimating message copy has been proposed, when two nodes meet, upgrade the message copy table of node each other; Then message based base attribute, proposed two the effective equations that maximize message success delivery ratio and minimize the message average retardation.The method of the calculating message copy number that the method proposes causes the use of the method to be restricted because two nodes that carry identical message resulting message copy number that meets after rear exchange message is inconsistent.
Summary of the invention
Problem to be solved by this invention is: in the situation that node resource is limited, the copy of each message that node carries will make nodal cache saturated rapidly, can't continue to store the problems such as message copy of follow-up arrival.We propose a kind of cache management strategy based on message copy number and comprehensive effectiveness, have increased the delivery ratio of network, have reduced the network average retardation, effectively reduce simultaneously network overhead.
The technical scheme that the present invention addresses the above problem is: propose a kind of buffer memory management method based on message copy number and comprehensive effectiveness, calculate the t number of copies ni (t) of message i in network constantly based on the message path list that each node of establishment is kept, count average delivery ratio, mean transit delay and the averaging network expense of computing network message according to message copy; In conjunction with average delivery ratio, mean transit delay and averaging network expense, set up a network performance comprehensive evaluation index---comprehensive effectiveness, when new connection was set up, preferential forwarding can improve the message copy of network synthesis usefulness; When buffer memory is saturated, preferentially abandon the message copy that can reduce network synthesis usefulness.Specifically comprise the steps:
Calculate the t number of copies of message i in network constantly based on the message path list that each node of establishment is kept, determine message success delivery ratio, transmission delay and network overhead according to the message copy number; Carry the comprehensive effectiveness of message copy according to successful delivery ratio, transmission delay and network overhead computing node, and network synthesis usefulness; Carry the message copy that the size of the comprehensive effectiveness of message copy carries this node carries out prioritization and deposits nodal cache according to node, when new connection is set up, by the message copy in the descending forward node successively of network synthesis efficiency value buffer memory, when a certain nodal cache is saturated can not hold newly arrived message the time, by the ascending message copy that abandons in nodal cache of network synthesis efficiency value.
Further, each node is kept the path list of all message that this node carries, and when two nodes met, exchange is non-existent message each other, and identical message the different paths part of process, obtain the message copy number.
Further, according to message i at t number of copies n constantly i(t), the life span TTL of message i i, message i is carved into the time T that t experiences constantly when producing i, call formula: P i ( t ) = a · 1 n i ( t ) / m + b · TTL i T i Calculate the comprehensive effectiveness size P that k node carries message copy i(t), wherein, a, b represent respectively message copy number and the shared weighted value of message life span, satisfy a+b=1.
According to formula:
CP optimal = arg max a [ w 1 · dr a dr ‾ + w 2 · d ‾ d a + w 3 · ov ‾ ov a ] Computing network comprehensive effectiveness optimal value, wherein, w1, w2, w3 are respectively the weights of message success delivery ratio, transmission delay and network overhead, and w1+w2+w3=1, dr a, d a, ov aRespectively message success delivery ratio, transmission delay, network overhead,
Figure GDA00002817283500024
Figure GDA00002817283500025
Respectively the average delivery ratio of message, average transmission delay and averaging network expense.
The present invention connects in node moves to the scope of communicating with one another the time, the beginning transfer of data, and this moment, the message pathway list was upgraded, and the computing network comprehensive effectiveness, press the interior message copy of the descending forwarding cache successively of comprehensive effectiveness in real time; When buffer memory is saturated, by the ascending message copy that abandons in buffer memory of comprehensive effectiveness, so that cache contents is received newly arrived message copy.
Investigation to average delivery ratio, mean transit delay and each performance index of averaging network expense in the present invention realizes by corresponding weight is set in comprehensive effectiveness, in different networks and different situation, requirement to network delivery ratio, propagation delay time and network overhead is different, causes comprehensive effectiveness to the difference that stresses of each network performance index.
Description of drawings
Fig. 1 is path list information-change figure in the present invention;
Fig. 2 is Algorithm constitution flow chart in the present invention.
Embodiment
Below in conjunction with accompanying drawing and instantiation, enforcement of the present invention is described specifically.
Be illustrated in figure 1 as path list information-change figure in the present invention.
In collection network message the global information of all nodes of process, be the message establishing path list of each generation, calculate the message copy number.Wherein, each node is kept the path list of all message that this node carries, and when two nodes met, exchange is non-existent message each other, and identical message the different paths part of process, obtain thus the message copy number.Can adopt following method: each message of producing in network node through the path is carried out storing after hash conversion with the node identifier key assignments, and safeguard that summary vector S V (summary vector) is with each " the having " or " nothing " in the sign Hash table.Be connected the communication range connection with B as node A after, A sends data instance to Node B with node, and data communication process was completed by 3 stages: (1) node A sends the summary vector S V of oneself to B A(2) B receives SV ARear summary vector S V with oneself safeguarding BCompare, and judge which message by oneself storage, by oneself storage, the message AS for two nodes are all stored does not carry out AS to which message A+ AS B，The message addition that two nodes are all stored; The message that there is no storage for Node B will
Figure GDA00002817283500031
Send to node A; (3) after node A receives the request of Node B, do not add the information of Node B in Node B has the node path of storing message, and send these message to Node B.Node B is transmitted data to node A and is transmitted the identical method of the data with node A to Node B.
Recorded the different network node of message copy process in the middle of the transmission path list of message, in the message path list, the number of different nodes is the number of copies of this message this moment.For example, the path of the message i that node 1 carries for 1,2,7,8,12}, the path of the message i that node 2 carries is { 2,3,5,6,8,10}, when two nodes met, they are exchange message each other, and the routing information of the message i that after exchange, two nodes carry is identical, is { 1,2,3,5,6,7,8,10,12}.This exchange process as shown in Figure 1.If only have node 3 to carry message i in two nodes that meet, its routing table that carries message i is { 3,6,8,10}, node 4 does not carry, and when two nodes met, the routing table of message i added the path node 4 of process, becomes { 3,4,6,8,10}, node 3 passes to node 4 to message i.
After the network operation, the node that carries message i will obtain essentially identical routing information list.In like manner get node and also will obtain the identical routing information list that it carries other message.
Be illustrated in figure 2 as the transmission of messages flow chart in the present invention.Specifically can adopt following steps:
1. netinit: the information table that Makes Path, and initialization internet message number of copies; Selected route matrix; The setting network area size is set number of nodes, and the nodal cache size is set, and sets the nodal information transmission rate.Node in all-network is randomly dispersed in the zone, and the information of node can reasonably arrange according to actual conditions.
2. the initialization of comprehensive effectiveness: consider the generation time of message copy number, message life span and message, set up the priority equation:
P i ( t ) = a · 1 n i ( t ) / m + b · TTL i T i - - - ( 1 )
Wherein, n i(t) represent that message i is at t number of copies, TTL constantly iRepresent life span, the T of message i iBe carved into the time that t experiences constantly when representing message i from generation.A, b represent respectively message copy number and the shared weighted value of message life span, satisfy a+b=1, i.e. b=1-a.
Carry according to node that the priority of message copy is descending to sort to message copy, and it is to be sent to deposit nodal cache etc. in.
Consider the error that calculating message copy number and message priority bring, further the comprehensive effectiveness of delivery ratio successful according to message, transmission delay, network overhead define grid:
CP = w 1 · dr a dr ‾ + w 2 · d ‾ d a + w 3 · ov ‾ ov a - - - ( 2 )
Wherein, w1, w2, w3 are respectively the weights of message success delivery ratio, transmission delay and network overhead, and w1+w2+w3=1, dr a, d a, ov aBe respectively message copy count weighted value a value corresponding message success delivery ratio, transmission delay, network overhead,
Figure GDA00002817283500043
Figure GDA00002817283500044
Respectively the average delivery ratio of message, average transmission delay and averaging network expense (obtaining according to getting different a Data-Statistics calculating mean values), the reflection of w1, w2, w3 the preference degree of network synthesis usefulness to message success delivery ratio, transmission delay and network overhead, if network is had relatively high expectations to the successful delivery ratio of message, can be the value setting of w1 close to 1.Can be corresponding weighted value setting close to 1 when should network higher to other performance requirements, thus can be applicable to different applicable cases to this cache management strategy by the size that w1, w2, w3 value are set.CP is larger, and the comprehensive effectiveness of network is better, and a, the b value of this moment are also more excellent; CP is less, and the comprehensive effectiveness of network is poorer, and a, the b value of this moment are also poorer.Calculate maximum CP according to following formula, obtain network synthesis usefulness optimal value.That is:
CP optimal = arg max a [ w 1 · dr a dr ‾ + w 2 · d ‾ d a + w 3 · ov ‾ ov a ] - - - ( 3 )
Thus, according to comprehensive effectiveness in nodal cache message send to implement management.
3. efficient cache management strategy: calculate the comprehensive effectiveness size that each node carries message copy according to formula (2), the copy that carries all message that the size of the comprehensive effectiveness of message copy carries this node according to node carries out the sequence of priority, and the information that other nodes carry is also carried out identical processing.When two nodes move in the scope of communicating with one another, set up a connection, the beginning transfer of data, this moment, the message pathway list was upgraded, computing network comprehensive effectiveness real-time according to formula (3), according to network synthesis usefulness, nodal cache is implemented management, by the descending message copy that forwards successively in the sending node buffer memory of network synthesis usefulness; When a certain nodal cache is saturated can not hold newly arrived message the time, by the ascending message copy that abandons in buffer memory of network synthesis usefulness, so that cache contents is received newly arrived message copy.
The present invention sorts to message copy according to comprehensive effectiveness, optimized the forwarding sequence of message copy and abandoned sequence, improve the network delivery ratio, reduced the average transfer delay of message in the network, reduced network overhead, reduced the energy consumption of nodes.

Claims (4)

  1. In an opportunistic network based on the buffer memory management method of message copy number and comprehensive effectiveness, it is characterized in that, calculate the t number of copies of message i in network constantly based on the message path list that each node of establishment is kept, determine message success delivery ratio, transmission delay and network overhead according to the message copy number; Carry the comprehensive effectiveness of message copy according to successful delivery ratio, transmission delay and network overhead computing node, and network synthesis usefulness; Carry the message copy that the size of the comprehensive effectiveness of message copy carries this node carries out prioritization and deposits nodal cache according to node, when new connection is set up, by the message copy in the descending forward node successively of network synthesis efficiency value buffer memory, when a certain nodal cache is saturated can not hold newly arrived message the time, by the ascending message copy that abandons in nodal cache of network synthesis efficiency value.
  2. 2. method according to claim 1, is characterized in that, each node is kept the path list of all message that this node carries, when two nodes meet, exchange non-existent message each other, and identical message the different paths part of process, obtain the message copy number.
  3. 3. method according to claim 1, is characterized in that, according to message i at t number of copies n constantly i(t), the life span TTL of message i i, message i is carved into the time T that t experiences constantly when producing i, call formula: P i ( t ) = a · 1 n i ( t ) / m + b · TTL i T i Calculate the comprehensive effectiveness size P that k node carries message copy i(t), wherein, a, b represent respectively message copy number and the shared weighted value of message life span, satisfy a+b=1.
  4. 4. method according to claim 1, is characterized in that, according to formula: CP optimal = arg max a [ w 1 · dr a dr ‾ + w 2 · d ‾ d a + w 3 · ov ‾ ov a ] Computing network comprehensive effectiveness optimal value, wherein, w1, w2, w3 are respectively the weights of message success delivery ratio, transmission delay and network overhead, and w1+w2+w3=1, dr a, d a, ov aRespectively message success delivery ratio, transmission delay, network overhead,
    Figure FDA00002817283400013
    Figure FDA00002817283400014
    Figure FDA00002817283400015
    Respectively the average delivery ratio of message, average transmission delay and averaging network expense.
CN201310043820.4A 2013-02-04 2013-02-04 The buffer memory management method of Effect-based operation number of copies and comprehensive effectiveness in opportunistic network Active CN103117957B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201310043820.4A CN103117957B (en) 2013-02-04 2013-02-04 The buffer memory management method of Effect-based operation number of copies and comprehensive effectiveness in opportunistic network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201310043820.4A CN103117957B (en) 2013-02-04 2013-02-04 The buffer memory management method of Effect-based operation number of copies and comprehensive effectiveness in opportunistic network

Publications (2)

Publication Number Publication Date
CN103117957A true CN103117957A (en) 2013-05-22
CN103117957B CN103117957B (en) 2016-04-06

Family

ID=48416235

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201310043820.4A Active CN103117957B (en) 2013-02-04 2013-02-04 The buffer memory management method of Effect-based operation number of copies and comprehensive effectiveness in opportunistic network

Country Status (1)

Country Link
CN (1) CN103117957B (en)

Cited By (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103312619A (en) * 2013-05-30 2013-09-18 南京邮电大学 Synchronous deleting and message transferring congestion control method
CN103997693A (en) * 2014-06-11 2014-08-20 北京邮电大学 Motivational method for optimizing video delivery quality in opportunity network
CN104426838A (en) * 2013-08-20 2015-03-18 中国移动通信集团北京有限公司 Internet cache scheduling method and system
CN104735742A (en) * 2015-04-03 2015-06-24 中国人民解放军信息工程大学 Opportunity network data sending method and device
CN106506373A (en) * 2016-10-14 2017-03-15 哈尔滨工程大学 A kind of delay-tolerant network route and cache management strategy based on non-cooperation game theory
CN108449270A (en) * 2018-03-21 2018-08-24 中南大学 Buffer memory management method priority-based in opportunistic network
CN109874159A (en) * 2019-03-28 2019-06-11 中南大学 Moving machine based on comentropy can network node social relationships measurement, cluster foundation and update and method for routing
CN110545239A (en) * 2018-05-28 2019-12-06 南京熊猫电子股份有限公司 Wireless mesh network wide area networking method
CN111478859A (en) * 2020-04-03 2020-07-31 北京大学深圳研究生院 Message transmission method, node and storage medium in DTN (delay tolerant network)
CN112039802A (en) * 2020-08-18 2020-12-04 陕西师范大学 Cooperative group resource scheduling method based on opportunistic network cache sharing
CN112217737A (en) * 2020-09-23 2021-01-12 北京邮电大学 Opportunistic network resource dynamic allocation method based on service priority
CN112398737A (en) * 2020-10-30 2021-02-23 中电海康集团有限公司 Opportunistic routing method and device based on dynamic copy number and transmission priority

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
刘乔寿等: "机会网络中基于消息副本数量的自适应缓存管理策略", 《重庆邮电大学学报》 *
李广德: "机会网络中基于优先级的缓存管理策略", 《广东通信技术》 *

Cited By (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103312619A (en) * 2013-05-30 2013-09-18 南京邮电大学 Synchronous deleting and message transferring congestion control method
CN103312619B (en) * 2013-05-30 2016-08-24 南京邮电大学 A kind of deletion simultaneously and the jamming control method of Transfer Message
CN104426838A (en) * 2013-08-20 2015-03-18 中国移动通信集团北京有限公司 Internet cache scheduling method and system
CN104426838B (en) * 2013-08-20 2017-11-21 中国移动通信集团北京有限公司 A kind of internet buffer scheduling method and system
CN103997693B (en) * 2014-06-11 2017-06-16 北京邮电大学 The motivational techniques of quality optimization are delivered in opportunistic network towards video
CN103997693A (en) * 2014-06-11 2014-08-20 北京邮电大学 Motivational method for optimizing video delivery quality in opportunity network
CN104735742B (en) * 2015-04-03 2018-08-07 中国人民解放军信息工程大学 A kind of sending method and device of opportunistic network data
CN104735742A (en) * 2015-04-03 2015-06-24 中国人民解放军信息工程大学 Opportunity network data sending method and device
CN106506373A (en) * 2016-10-14 2017-03-15 哈尔滨工程大学 A kind of delay-tolerant network route and cache management strategy based on non-cooperation game theory
CN106506373B (en) * 2016-10-14 2019-08-06 哈尔滨工程大学 A kind of delay-tolerant network routing and buffer memory management method based on non-cooperation game theory
CN108449270A (en) * 2018-03-21 2018-08-24 中南大学 Buffer memory management method priority-based in opportunistic network
CN110545239A (en) * 2018-05-28 2019-12-06 南京熊猫电子股份有限公司 Wireless mesh network wide area networking method
CN109874159A (en) * 2019-03-28 2019-06-11 中南大学 Moving machine based on comentropy can network node social relationships measurement, cluster foundation and update and method for routing
CN109874159B (en) * 2019-03-28 2021-01-29 中南大学 Cluster establishing and updating method based on social relationship and cluster-based routing method
CN111478859A (en) * 2020-04-03 2020-07-31 北京大学深圳研究生院 Message transmission method, node and storage medium in DTN (delay tolerant network)
CN112039802A (en) * 2020-08-18 2020-12-04 陕西师范大学 Cooperative group resource scheduling method based on opportunistic network cache sharing
CN112217737A (en) * 2020-09-23 2021-01-12 北京邮电大学 Opportunistic network resource dynamic allocation method based on service priority
CN112398737A (en) * 2020-10-30 2021-02-23 中电海康集团有限公司 Opportunistic routing method and device based on dynamic copy number and transmission priority

Also Published As

Publication number Publication date
CN103117957B (en) 2016-04-06

Similar Documents

Publication Publication Date Title
CN103117957A (en) Cache management method based on numbers of message replications and comprehensive effectiveness in opportunistic network
Schurgot et al. Beyond traditional DTN routing: social networks for opportunistic communication
Mundur et al. Epidemic routing with immunity in delay tolerant networks
CN101965031B (en) Maximum probability-based cognitive radio multi-path multicast routing method
Liu et al. Social-aware computing based congestion control in delay tolerant networks
CN104580165A (en) Cooperative caching method in intelligence cooperative network
CN105681438A (en) Centralized caching decision strategy in content-centric networking
CN106506373A (en) A kind of delay-tolerant network route and cache management strategy based on non-cooperation game theory
Rashid et al. Dynamic Prediction based Multi Queue (DPMQ) drop policy for probabilistic routing protocols of delay tolerant network
CN102595458B (en) Distributed multi-path route-healing method
CN105407048A (en) Delay tolerant network node cache management method facing epidemic and probabilistic hybrid routing
CN102421161B (en) Priority-based routing algorithm of opportunity network under Epidemic mechanism
CN103067294B (en) Based on the method for the data flow equilibrium treatment of stream order-preserving in multi-next-hop forwarding router
Abraham et al. Routing strategies in delay tolerant networks: a survey
CN103532865B (en) Based on the jamming control method of society's perception in a kind of Delay Tolerant Network
Lu et al. Geographic information and node selfish-based routing algorithm for delay tolerant networks
Zheng et al. A QoS Routing Protocol for Mobile Ad Hoc Networks Based on Multipath.
CN109286563A (en) A kind of control method and device of data transmission
Le et al. A joint relay selection and buffer management scheme for delivery rate optimization in dtns
CN104185241B (en) Suitable for the method for routing of tethered satellite network
Jain et al. A study of congestion aware adaptive routing protocols in MANET
Zhang et al. A fuzzy ranking based buffer replacement strategy for opportunistic networks
JP2006287919A (en) Communication network, content distribution node, tree construction method, and content distribution control program
CN103078872A (en) Adaptive seed spray and focus routing (ASSFR) protocol based on auditory steady state response (ASSR)
Aslam et al. Composite metric for quality of service routing in olsr

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20220119

Address after: 401120 b1-16-1, No. 76 Xingguang Avenue, gaoxinyuan, North New Area, Yubei District, Chongqing

Patentee after: CHONGQING INFORMATION TECHNOLOGY DESIGNING CO.,LTD.

Address before: 400065 Chongqing Nan'an District huangjuezhen pass Chongwen Road No. 2

Patentee before: CHONGQING University OF POSTS AND TELECOMMUNICATIONS