CN112929465A - Bus address allocation method and bus system - Google Patents

Bus address allocation method and bus system Download PDF

Info

Publication number
CN112929465A
CN112929465A CN202110271751.7A CN202110271751A CN112929465A CN 112929465 A CN112929465 A CN 112929465A CN 202110271751 A CN202110271751 A CN 202110271751A CN 112929465 A CN112929465 A CN 112929465A
Authority
CN
China
Prior art keywords
address
allocated
slave
bus
data frame
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202110271751.7A
Other languages
Chinese (zh)
Inventor
王胜利
吴学伟
邹宏亮
温东彪
李志逢
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Gree Electric Appliances Inc of Zhuhai
Original Assignee
Gree Electric Appliances Inc of Zhuhai
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 Gree Electric Appliances Inc of Zhuhai filed Critical Gree Electric Appliances Inc of Zhuhai
Priority to CN202110271751.7A priority Critical patent/CN112929465A/en
Publication of CN112929465A publication Critical patent/CN112929465A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L61/00Network arrangements, protocols or services for addressing or naming
    • H04L61/50Address allocation
    • H04L61/5038Address allocation for local use, e.g. in LAN or USB networks, or in a controller area network [CAN]

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Small-Scale Networks (AREA)

Abstract

The invention discloses a bus address allocation method and a bus system, wherein the method comprises the following steps: the host broadcasts an address allocation data frame to a bus, wherein the address allocation data frame comprises an address to be allocated; the slave machine which does not distribute the address carries out competition on the address to be distributed, and the slave machine which seizes the address to be distributed replies to the master machine; and after receiving the reply of the slave computer, the host computer performs roll calling on the slave computer by adopting a roll calling data frame to judge whether the address to be distributed is successfully distributed. By adopting the technical scheme of the invention, the quick allocation of the slave machine address can be realized.

Description

Bus address allocation method and bus system
Technical Field
The present invention relates to the field of bus control, and in particular, to a bus address allocation method and a bus system using the same.
Background
In the prior art, when the bus type control problem is solved, more than one control is already a popular control mode at present, and the bus type control method has good performance. However, with the increase of networking, the problem of address matching between the host and the slave is gradually highlighted, and in the prior art, the slave address needs to be manually set or the addresses are allocated one by one through serial communication of the slaves, which occupies unnecessary resources.
In chinese patent application CN105737329A, a physical address needs to be allocated to a slave, i.e., an indoor unit, and then an address is allocated by calling a preset bit address in the physical address of the indoor unit for an outdoor unit, i.e., a host, and determining whether the data is correct. In chinese patent application CN105546730A, indoor units need to roll polling in sequence, and all addresses need to be called, and it needs to determine whether there is an indoor unit with the same address, or whether the address is already used, if so, a new address is generated, and a priority is set, and then allocation is performed according to the priority, and since the priority determination method is fixed in the subsequent addition, the repetition rate avoidance effect is reduced, and the address allocation speed is affected.
Disclosure of Invention
The invention aims to solve the technical problem that the slave address allocation speed of a bus system in the prior art is low, and provides a bus address allocation method and a bus system adopting the bus address allocation method.
In an embodiment of the present invention, a bus address allocation method is provided, which includes:
the host broadcasts an address allocation data frame to a bus, wherein the address allocation data frame comprises an address to be allocated;
the slave machine which does not distribute the address carries out competition on the address to be distributed, and the slave machine which seizes the address to be distributed replies to the master machine;
and after receiving the reply of the slave computer, the host computer performs roll calling on the slave computer by adopting a roll calling data frame to judge whether the address to be distributed is successfully distributed.
In the embodiment of the invention, the target address of the roll call data frame is the address to be allocated.
In the embodiment of the invention, the host divides the address to be allocated into a plurality of address segments, and allocates the address of each address segment in sequence, wherein the allocated address data frame comprises the address segment of the address to be allocated.
In the embodiment of the invention, after the slave machine which is not allocated with the address receives the address data frame which is distributed and sent by the host machine, an address random number is generated, whether the address random number accords with the currently distributed address field or not is judged, and the slave machine which accords with the currently distributed address field carries out competition on the address to be distributed.
In the embodiment of the present invention, the contention of the slave machine which does not allocate an address to the address to be allocated includes:
generating a random delay time number;
comparing the random delay time number with the number of times of receiving address data frame distribution sent by a host;
when the number of times of receiving the address data frame sent by the host is equal to the random delay time number, responding to the current address data frame, and replying that the host has occupied the address.
In the embodiment of the invention, the host calls the slave, after the slave replies normally, the address allocation is judged to be successful, and the host sends the address allocation data frame again to allocate the next address.
In the embodiment of the invention, if the address of the current address field is completely allocated or the allocation time exceeds the set allocation period of the address field, the host starts to allocate the address of the next address field.
In the embodiment of the invention, if the host does not receive the reply of the slave after the host sends the address distribution data frame and the set waiting reply time is exceeded, the host sends the address to be distributed to the bus again for distribution.
In the embodiment of the invention, if the slave computer which has preempted the address to be allocated does not receive the roll call of the host computer, the slave computer judges that the address is not allocated successfully, and the newly allocated address is contended again.
In an embodiment of the present invention, a bus system is further provided, which includes a plurality of slaves and a master for controlling the plurality of slaves, and the master allocates addresses of the slaves by the bus address allocation method described above.
Compared with the prior art, the bus address allocation method of the invention is adopted to divide the host data into the roll call data frame and the allocation address data frame, roll call is carried out by the roll call frame after the address is allocated, the slave machine determines whether the slave machine address is successfully allocated according to the roll call address, and the slave machine does not need to wait for the communication fault after the address conflict, so that the conflict detection efficiency is greatly improved, and the slave machine can be added at any time without influencing the normal work of other machine sets, thereby realizing multidimensional and efficient address competition; in addition, the master machine carries out segmented address allocation according to the address segment, the slave machine automatically judges the segmentation according to the address random number generated by the slave machine and carries out address robbing reply according to the random delay time number generated by the slave machine, the probability of robbing one address at the same time when the address is robbed can be reduced, and therefore the probability of address conflict is reduced.
Drawings
Fig. 1 is a flowchart of a bus address allocation method according to a first embodiment of the present invention.
Fig. 2 is a flowchart of a bus address allocation method according to a second embodiment of the present invention.
Fig. 3 is a data processing flow chart of the host according to the bus address allocation method of the second embodiment of the present invention.
Fig. 4 is a data processing flow chart of a slave in the bus address allocation method according to the second embodiment of the present invention.
Detailed Description
The invention provides a bus address allocation method which is suitable for a bus system with a master machine controlling a plurality of slave machines.
As shown in fig. 1, in a first embodiment of the present invention, a bus address allocation method is provided, which includes:
the host broadcasts an address allocation data frame to a bus, wherein the address allocation data frame comprises an address to be allocated;
the slave machine which does not distribute the address carries out competition on the address to be distributed, and the slave machine which seizes the address to be distributed replies to the master machine;
after receiving the reply of the slave computer, the host computer performs roll calling on the slave computer by adopting a roll calling data frame to judge whether the address to be distributed is successfully distributed;
the host calls the slave, and after the slave replies normally, the host judges that the address allocation is successful, and sends the address allocation data frame again to allocate the next address.
In this embodiment, the contention of the slave machine that does not allocate an address for the address to be allocated includes:
generating a random delay time number;
comparing the random delay time number with the number of times of receiving address data frame distribution sent by a host;
when the number of times of receiving the address data frame sent by the host is equal to the random delay time number, responding to the current address data frame, and replying that the host has occupied the address.
In the method, data sent by a host is divided into an address allocation data frame and a roll call data frame, wherein the address allocation data frame is broadcast on a bus and can be received by all slaves to compete for addresses, and a target address of the roll call data frame is the address to be allocated and can be received only by the slave which robs the address to be allocated. After the address is allocated, the host calls the name by using the calling frame, the slave determines whether the address of the slave is successfully allocated according to the calling address, and the slave waits for a communication fault without waiting for address conflict, so that the conflict detection efficiency is greatly improved, and the slave can be added at any time without influencing the normal work of other units, thereby realizing multidimensional and efficient address competition.
It should be noted that, after the master starts to allocate addresses to the slaves and all the slaves complete address allocation, the master still continuously broadcasts the address allocation data frame on the bus, so that the newly accessed slaves and the dropped slaves can allocate addresses.
As shown in fig. 2, in a second embodiment of the present invention, a bus address allocation method is provided, which is different from the first embodiment, in that a host divides an address to be allocated into a plurality of address segments, sequentially allocates addresses of each address segment, and a slave that is not allocated with an address generates an address random number after receiving an address data frame allocated by the host, and determines whether the address random number matches a currently allocated address segment, and the slave that matches the currently allocated address segment performs contention for the address to be allocated.
It should be noted that the address field may be an address field range set by manual input, for example, the maximum value is 65535, the address field is divided into 6 segments, 0-15535,15536-25535,25536-35535,35536-45535,45536-55535,55536-65535, or the maximum value is manually input at the host end, and several address field ranges are evenly distributed. When the slave generates the first address random number to judge the address field, the slave can know the address field in which the slave is, and when the master needs to allocate the first address field, the slave meets the condition that the generated address random number is 0-15535, namely the first address field, the slave of the address field can perform address competition firstly, so that the repetition rate is reduced.
As shown in fig. 3, in this embodiment, after the host receives the reply from the slave, the host performs roll call on the slave, and after the slave replies normally, the host determines that the address allocation is successful, and the host sends the address allocation data frame again to perform the allocation of the next address in the current data segment. If the host does not receive the reply of the slave after the host sends the address allocation data frame and the set waiting reply time is exceeded, the host considers that the address allocation fails and sends the address to be allocated to the bus again for allocation.
The host starts timing when starting to distribute certain address field, and the specific rule is that every time the host sends the address data frame distributed to the address field, TIP period timeAnd adding 1. If the address of the current address field is completely allocated, the host starts to allocate the address of the next address field. If the address of a certain address field has no slave response, the master still carries out the allocation of the address field again after the slave address which is already allocated is called, and the master starts to carry out the address allocation of the next address field until the time for allocating the address field exceeds the set allocation period of the address field.
As shown in fig. 4, in this embodiment, the contention of the slave that has not allocated an address for the address to be allocated includes:
the slave generates a random delay time TRandom delay
Comparing the random delay time number with the address field distributed address data frame received from the slave computer and sent by the master computerNumber of delay times TDelayWherein, TDelayCounting according to the times of receiving the address data frame distributed by the address field sent by the host by the slave, wherein the slave receives the address data frame distributed by the address field sent by the host once every time TDelayAdding 1;
when T isDelayLess than TRandom delayWhen the slave computer does not rob the address, the slave computer does not respond to the address data frame sent by the host computer;
when the received IP section is updated, namely T delay is greater than the longest period value of the IP section slave machine, T delay is cleared;
when T isDelayIs equal to TRandom delayIn response to the current allocated address data frame, the reply host has occupied the address by itself.
If the random delay time numbers of two or more slave machines are the same when the addresses are allocated, the allocated address signals of the master machine can be responded at the same time, and because the slave machines respond at the same time, communication interference can be caused, the master machine cannot receive the reply information of the slave machines, and the master machine considers that the addresses are not allocated successfully. And if the host does not receive the reply of the slave after the host sends the address data frame, the host sends the address to be allocated to the bus again for allocation. Similarly, if the slave machine which has snatched the address to be allocated does not receive the roll call of the host machine, the address is judged to be not allocated successfully, and competition is carried out on the newly allocated address again.
If a new access slave machine appears, after the slave machine generates the address random number and the random delay time number, the host machine can also perform address allocation action on the new access slave machine within a very short time without manual operation or the slave machine which normally works does not need to enter an address allocation mode again.
In summary, by adopting the bus address allocation method of the present invention, the host data is divided into the roll call data frame and the allocated address data frame, after the address is allocated, the roll call frame is used for roll call, the slave determines whether the slave address is successfully allocated according to the roll call address, and the slave does not need to wait for the communication fault after the address conflict, so that the conflict detection efficiency is greatly improved, and the slave can be added at any time without affecting the normal operation of other units, thereby realizing multidimensional and efficient address competition; in addition, the master machine carries out segmented address allocation according to the address segment, the slave machine automatically judges the segmentation according to the address random number generated by the slave machine and carries out address robbing reply according to the random delay time number generated by the slave machine, the probability of robbing one address at the same time when the address is robbed can be reduced, and therefore the probability of address conflict is reduced.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents and improvements made within the spirit and principle of the present invention are intended to be included within the scope of the present invention.

Claims (10)

1. A method for allocating bus addresses, comprising:
the host broadcasts an address data frame to be allocated to the bus, wherein the address data frame to be allocated comprises an address to be allocated;
the slave machine which does not distribute the address carries out competition on the address to be distributed, and the slave machine which seizes the address to be distributed replies to the master machine;
and after receiving the reply of the slave computer, the host computer performs roll calling on the slave computer by adopting a roll calling data frame to judge whether the address to be distributed is successfully distributed.
2. The bus address allocation method according to claim 1, wherein the target address of the roll call data frame is the address to be allocated.
3. The bus address allocation method according to claim 1, wherein the host divides the address to be allocated into a plurality of address segments, and allocates the address of each address segment in turn, and the allocated address data frame includes the address segment of the address to be allocated.
4. The bus address allocation method according to claim 3, wherein a slave that does not allocate an address generates an address random number after receiving an address allocation data frame sent from the master, and determines whether the address random number matches a currently allocated address field, and the slave that matches the currently allocated address field performs contention for the address to be allocated.
5. The bus address allocation method according to claim 1 or 4, wherein a slave that does not allocate an address contends for the address to be allocated, comprising:
generating a random delay time number;
comparing the random delay time number with the number of times of receiving address data frame distribution sent by a host;
when the number of times of receiving the address data frame sent by the host is equal to the random delay time number, responding to the current address data frame, and replying that the host has occupied the address.
6. The bus address allocation method as claimed in claim 4, wherein the master performs roll calling on the slave, and after the slave replies normally, it is determined that the address allocation is successful, and the master transmits the allocated address data frame again to perform the next address allocation.
7. The method as claimed in claim 4, wherein if the address of the current address field is allocated completely or the allocation time exceeds the set allocation period of the address field, the host starts to allocate the address of the next address field.
8. The bus address allocation method according to claim 4, wherein if the host does not receive the reply from the slave after exceeding the set wait reply time after the host sends the address allocation data frame, the host sends the address to be allocated to the bus again for allocation.
9. The bus address allocation method according to claim 4, wherein if the slave that has snatched the address to be allocated does not receive the roll call of the master, it is determined that the address is not successfully allocated, and competition is performed again for the newly allocated address.
10. A bus system, comprising: a plurality of slaves and a master for controlling the slaves, the master allocating addresses of the slaves using the bus address allocation method according to any one of claims 1 to 9.
CN202110271751.7A 2021-03-12 2021-03-12 Bus address allocation method and bus system Pending CN112929465A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110271751.7A CN112929465A (en) 2021-03-12 2021-03-12 Bus address allocation method and bus system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110271751.7A CN112929465A (en) 2021-03-12 2021-03-12 Bus address allocation method and bus system

Publications (1)

Publication Number Publication Date
CN112929465A true CN112929465A (en) 2021-06-08

Family

ID=76172928

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110271751.7A Pending CN112929465A (en) 2021-03-12 2021-03-12 Bus address allocation method and bus system

Country Status (1)

Country Link
CN (1) CN112929465A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114063513A (en) * 2021-11-15 2022-02-18 深圳古瑞瓦特新能源有限公司 Power module parallel operation address allocation method, system, device, electronic equipment and computer readable storage medium
CN115842806A (en) * 2023-02-23 2023-03-24 深圳市云天数字能源有限公司 Method and related device for bus to distribute node address

Citations (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20050026593A (en) * 2003-09-09 2005-03-15 삼성전자주식회사 Control method for multi-type air conditioner
CN101852472A (en) * 2009-04-01 2010-10-06 欧威尔空调(中国)有限公司 Automatic addressing method for air conditioning system and air conditioning controller
KR20120137167A (en) * 2011-06-10 2012-12-20 오텍캐리어 주식회사 Automatic allocation method of communication address for multiairconditioner system
CN104954214A (en) * 2015-06-24 2015-09-30 珠海格力电器股份有限公司 Method and system for improving RS485 communication expansibility
CN105391814A (en) * 2015-10-19 2016-03-09 珠海格力电器股份有限公司 Address allocation method and device for main and auxiliary line controllers
CN105546730A (en) * 2015-12-23 2016-05-04 宁波奥克斯电气股份有限公司 Automatic addressing method of multi-connected air conditioner indoor unit
CN105737329A (en) * 2016-02-01 2016-07-06 深圳创维空调科技有限公司 Address assignment method and device of air conditioning equipment
CN107580085A (en) * 2017-10-26 2018-01-12 北京科技大学 A kind of internet of things networking method
JP2018056725A (en) * 2016-09-27 2018-04-05 東芝キヤリア株式会社 Communication system, master machine and slave machine used for communication system, and address allocation method in communication system
CN108270883A (en) * 2018-02-02 2018-07-10 深圳曼顿科技有限公司 Can automatic dispensing device address code method, breaker and storage medium
CN108521474A (en) * 2018-03-30 2018-09-11 青岛海尔空调电子有限公司 The address challenges method of multiple control system
CN108881514A (en) * 2018-07-02 2018-11-23 京东方科技集团股份有限公司 Address distribution method, communication apparatus and the bus system of bus system
CN111597123A (en) * 2020-04-08 2020-08-28 广东志高暖通设备股份有限公司 Automatic address allocation method, device, computer equipment and storage medium
CN111654557A (en) * 2020-05-29 2020-09-11 宋斌 Automatic distribution method of RS485 address codes, upper computer and lower computer
CN111711471A (en) * 2020-06-12 2020-09-25 江苏集能易新能源技术有限公司 Method for realizing power line carrier communication ad hoc network
CN111765605A (en) * 2020-05-14 2020-10-13 海信(山东)空调有限公司 Air conditioner
CN112378059A (en) * 2020-11-02 2021-02-19 佛山市顺德区美的电子科技有限公司 Multi-split air conditioner system and automatic addressing method thereof, outdoor unit and storage medium

Patent Citations (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20050026593A (en) * 2003-09-09 2005-03-15 삼성전자주식회사 Control method for multi-type air conditioner
CN101852472A (en) * 2009-04-01 2010-10-06 欧威尔空调(中国)有限公司 Automatic addressing method for air conditioning system and air conditioning controller
KR20120137167A (en) * 2011-06-10 2012-12-20 오텍캐리어 주식회사 Automatic allocation method of communication address for multiairconditioner system
CN104954214A (en) * 2015-06-24 2015-09-30 珠海格力电器股份有限公司 Method and system for improving RS485 communication expansibility
CN105391814A (en) * 2015-10-19 2016-03-09 珠海格力电器股份有限公司 Address allocation method and device for main and auxiliary line controllers
CN105546730A (en) * 2015-12-23 2016-05-04 宁波奥克斯电气股份有限公司 Automatic addressing method of multi-connected air conditioner indoor unit
CN105737329A (en) * 2016-02-01 2016-07-06 深圳创维空调科技有限公司 Address assignment method and device of air conditioning equipment
JP2018056725A (en) * 2016-09-27 2018-04-05 東芝キヤリア株式会社 Communication system, master machine and slave machine used for communication system, and address allocation method in communication system
CN107580085A (en) * 2017-10-26 2018-01-12 北京科技大学 A kind of internet of things networking method
CN108270883A (en) * 2018-02-02 2018-07-10 深圳曼顿科技有限公司 Can automatic dispensing device address code method, breaker and storage medium
CN108521474A (en) * 2018-03-30 2018-09-11 青岛海尔空调电子有限公司 The address challenges method of multiple control system
CN108881514A (en) * 2018-07-02 2018-11-23 京东方科技集团股份有限公司 Address distribution method, communication apparatus and the bus system of bus system
CN111597123A (en) * 2020-04-08 2020-08-28 广东志高暖通设备股份有限公司 Automatic address allocation method, device, computer equipment and storage medium
CN111765605A (en) * 2020-05-14 2020-10-13 海信(山东)空调有限公司 Air conditioner
CN111654557A (en) * 2020-05-29 2020-09-11 宋斌 Automatic distribution method of RS485 address codes, upper computer and lower computer
CN111711471A (en) * 2020-06-12 2020-09-25 江苏集能易新能源技术有限公司 Method for realizing power line carrier communication ad hoc network
CN112378059A (en) * 2020-11-02 2021-02-19 佛山市顺德区美的电子科技有限公司 Multi-split air conditioner system and automatic addressing method thereof, outdoor unit and storage medium

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114063513A (en) * 2021-11-15 2022-02-18 深圳古瑞瓦特新能源有限公司 Power module parallel operation address allocation method, system, device, electronic equipment and computer readable storage medium
CN115842806A (en) * 2023-02-23 2023-03-24 深圳市云天数字能源有限公司 Method and related device for bus to distribute node address
CN115842806B (en) * 2023-02-23 2023-04-25 深圳市云天数字能源有限公司 Method for distributing node address by bus and related device

Similar Documents

Publication Publication Date Title
CN109195195B (en) LoRa network channel access method, terminal, gateway, server and system
EP4192062A1 (en) Multi-link terminal and address allocation method therefor, network access device, and medium
US7310303B2 (en) Ranging method for mobile communication system based on orthogonal frequency division multiple access scheme
US10172160B2 (en) Channel contention method, access point, and station
US20060227802A1 (en) Method and apparatus for implementing medium access control in wireless distributed network
CN112929465A (en) Bus address allocation method and bus system
US20170079069A1 (en) Competition-based resource selection method and device, and computer storage medium
JP4050031B2 (en) Time division universal multiple access network
CN106789498B (en) Network address allocation method of Modbus communication network, slave node equipment and communication system
KR102034529B1 (en) Method for collision avoidance in synchronized wireless communication system
CN113114793B (en) Slave node address competition method and device and electrical appliance system
US20090304021A1 (en) Method and System For Dynamic Resource Allocation
CN110225593B (en) Random number idle time slot competition method in distributed TDMA protocol
CN111836370B (en) Resource reservation method and equipment based on competition
CN109644502B (en) Point-to-multipoint channel allocation method, device and system
KR20040046390A (en) Method for resolving collision in communication system using media access control based of contention
CN107333337A (en) A kind of accidental access method and device being grouped based on space
CN111385744B (en) Dynamic channel access method based on polling
CN115412502A (en) Network port expansion and message rapid equalization processing method
KR100526184B1 (en) Method of multimedia data transmssion in wireless network
CN114826816A (en) CAN FD bus communication method and device and electronic equipment
CN110958717A (en) Contention-free random medium access control method and system for centralized wireless local area network
US20240114492A1 (en) Wireless resource scheduling method, electronic device, and storage medium
CN113038586A (en) Configuration method of synchronous signal block and electronic equipment
CN110190873B (en) Wired communication method supporting multiple users

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
RJ01 Rejection of invention patent application after publication

Application publication date: 20210608

RJ01 Rejection of invention patent application after publication