CN107454648A - Based on the single domain Ad Hoc that forward direction is approached by finding that algorithm designs in real time - Google Patents
Based on the single domain Ad Hoc that forward direction is approached by finding that algorithm designs in real time Download PDFInfo
- Publication number
- CN107454648A CN107454648A CN201710453954.1A CN201710453954A CN107454648A CN 107454648 A CN107454648 A CN 107454648A CN 201710453954 A CN201710453954 A CN 201710453954A CN 107454648 A CN107454648 A CN 107454648A
- Authority
- CN
- China
- Prior art keywords
- node
- routing
- point
- hop
- algorithm
- 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.)
- Withdrawn
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The present invention relates to it is a kind of based on the single domain Ad Hoc unidirectionally approached by finding that algorithm designs in real time, the principle of realization is：By establishing the full informational table of nodes with position latitude and longitude information in single domain, and between each node point-to-point active path table, each participation networking node is distributed on demand, in practical communication, data send/forwarded end by the actual direction according to source and target, simultaneously and dynamically one distance, selection route, unidirectional steepest presses on towards close-target point, until being sent to target（This communicates successfully）Or beyond one-way transmission domain（This communication is unsuccessful）.The algorithm is all binocular simple operation, it is little to overhead, and because abandoned the shortest path generation of each intermediate node in traditional routing algorithms, the Dynamic Maintenance of routing table, renewal and renewal opportunity problem so that route formation efficiency greatly improve and each node between channel congestion problems caused by routing update mechanism substantially eliminate in theory.
Description
Technical field
The present invention relates to a kind of adaptive routing algorithm of Ad Hoc MANETs.More particularly to a kind of approached based on forward direction
Single domain Ad Hoc by finding that algorithm designs in real time.
Background technology
In recent years, wireless mobile communications are quickly grown, and it has broken limitation of the wired communication mode to application, adds
The fast leap of information technology, meets the needs of people are to communication services such as language, data, video images, mobile ad hoc network
Network is a kind of new wireless-transmission network, entirely different with traditional wireless network.In traditional wireless access technology, mainly
Using point-to-point or point-to-multipoint topological structure, a Centroid is usually present in this topological structure, such as move
Base station in dynamic communication system, the access point (AP) in 802.11 WLANs (WLAN) etc..This network has very overall situation
It is sex-limited, it is directed to the timely expansion problems of network.In fact these problems can not all rely on existing network, continue a kind of dynamic
, can fast automatic networking temporarily new technology occur, now, an important technology-wireless self-networking as mobile communication
（Ad Hoc）Arise at the historic moment.
Ad Hoc networks are the networking modes on a kind of logical meaning, have both been emphasized in the premise independent of infrastructure network
Under, the network that can be interconnected dynamically is established by a range of mobile terminal.Existing network carries out distributed treatment simultaneously,
It is connected by Centroid with each wireless terminal by single hop wireless link, controls access of each wireless terminal to wireless network；
Meanwhile it is connected further through wire link with wired backbone, there is provided to the connection of backbone network.And wireless self-organization network is a kind of
The network without center of flattening, there is no Centroid logically or physically in network, all nodes are peer node.
In this wireless network architecture, each network node is connected by adjacent node with other network nodes in a manner of wireless multi-hop.
In Ad Hoc networks, with the movement of node, network topology structure is constantly changing.How quickly and accurately to select
Select the route for reaching node（That is the routing problem of network）, it is an important core problem in Ad Hoc networks.This calculation
Method proposes a kind of adaptive routing algorithm agreement under Ad Hoc application environment, and the algorithm arrives destination based on source
The simple thought prototype realization of target can constantly be approached if being transmitted along axis positive direction by being wirelessly transferred, because having abandoned biography
The shortest path generation of each intermediate node, the Dynamic Maintenance of routing table, renewal and renewal opportunity problem, make in system routing algorithm
Must route formation efficiency greatly improve and each node between channel congestion problems caused by routing update mechanism base in theory
This elimination.
The content of the invention
It is an object of the invention to based on created under Ad-Hoc network environments it is a kind of efficiently, simple, cost of implementation is cheap
MANET dynamic self-adapting routing algorithm.The algorithm is intended to solve to lead because intermediate node changes in current MANET communication
The route discovery of cause, route maintenance problem and then self-organized network communication effect is caused to substantially reduce problem.Using the algorithm, from group
The realization mechanism of net will greatly simplify, protocol stack kernel will drop calculation resources, the bandwidth resources reducing significantly, take significantly
It is low, so that MANET efficiency brings the lifting of matter.Downpayment design can support 255 node fast and flexible networkings.
In order to solve the above-mentioned technical problem, the present invention is realized using following technical scheme：
The present invention it is a kind of based on the single domain Ad Hoc that approaches of forward direction by finding that algorithm designs in real time.The principle of realization is：It is logical
Cross in single domain（single area）It is interior to establish band position latitude and longitude information（It is accurate to rice）Full informational table of nodes, and each section
The active path table of point-to-point between point, each participation networking node is distributed on demand, in practical communication, data send/forward end
By the actual direction according to source and target, distance, a route is simultaneously and dynamically selected, positive steepest presses on towards close-target point, directly
To being sent to target（This communicates successfully）Or beyond positive domain transmission（This communication is unsuccessful）.Although the algorithm needs meter in real time
Calculate, produce route, but be all that binocular simple operation is little to overhead, and because abandoned it is each in traditional routing algorithms in
Shortest path generation, the Dynamic Maintenance of routing table, renewal and the renewal opportunity problem of intermediate node so that route formation efficiency is big
Channel congestion problems between big raising and each node caused by routing update mechanism substantially eliminate in theory.
Described optimal routing algorithm select permeability.If referring to, energy point-to-point goes directly, and directly selects the path；It is no
Then, will be according to path general direction, selection is immediate with direction angle but without departing from the next-hop of positive transmission range, makes road
From quickly approaching, restraining to nearest direction.When data are sent to next-hop, the weights of both sides' active path table are updated, and open automatically
Dynamic next-hop；When data be sent to next-hop it is unsuccessful when, update sender's active path table weights simultaneously update full nodal information
The confidence level of next-hop in table（Weights）To be used as Path selection foundation next time.
Described single domain（single area）MANET concept technology.The topology for referring to MANET is single completely by what is selected
MANET equipment is closed to realize there is exclusiveness to miscellaneous equipment and routing algorithm, by single domain from group（single
area）It is interior to establish band position latitude and longitude information（It is accurate to rice）Full informational table of nodes, and between each node point-to-point it is effective
Routing table, each participation networking node is distributed on demand, in practical communication, data send/forwarded end by according to source and target
Actual direction, distance, a route is simultaneously and dynamically selected, positive steepest presses on towards close-target point, until being sent to target（This
Communicate successfully）Or beyond positive domain transmission（This communication is unsuccessful）.
The full node table of described MANET.The positional information of node must be carried, is accurate to rice, path general direction is calculated with this
And approach angle.It can be gathered and realized by the GPS/ Big Dippeves locating module carried to each node.
Described each node reaches generation and the update mechanism of effective node table.By can be straight for each node in the update cycle
The node listing of the other nodes in the domain reached, all it is binocular simple operation although the algorithm needs to calculate in real time, produces route
It is little to overhead, and because abandoned the shortest path generation of each intermediate node in traditional routing algorithms, routing table
Dynamic Maintenance, renewal and renewal opportunity problem so that route formation efficiency greatly improve and each node between because of routing update
Channel congestion problems caused by mechanism substantially eliminate in theory.
Described positive approximation technique.Refer to the transmission of the axis positive direction along source node to destination node and axle can not be deviated from
Transmit in line direction.
Brief description of the drawings
Fig. 1 is a kind of single domain Ad Hoc approached based on forward direction of the present invention by finding algorithm design frame chart in real time.
Embodiment
The present invention is described in detail with reference to the accompanying drawings and detailed description：
Fig. 1 be the present invention it is a kind of based on the single domain Ad Hoc that approaches of forward direction by finding algorithm design frame chart in real time, such as Fig. 1 institutes
Show, it is a kind of based on the single domain Ad Hoc that approaches of forward direction by finding that algorithm designs in real time, it is therefore intended that based on Ad-Hoc network rings
A kind of MANET dynamic self-adapting routing algorithm efficiently, simple, cost of implementation is cheap is created under border.The algorithm is intended to solve to work as
Route discovery, route maintenance problem in the communication of preceding MANET caused by intermediate node changes and then cause MANET
Communication efficiency substantially reduces problem.Using the algorithm, the realization mechanism of MANET will greatly simplify, protocol stack kernel will contract significantly
Calculation resources, the bandwidth resources subtract, taken will substantially reduce, so that MANET efficiency brings the lifting of matter.Downpayment design can
Support 255 node fast and flexible networkings.
In order to solve the above-mentioned technical problem, the present invention is realized using following technical scheme：
The present invention it is a kind of based on the single domain Ad Hoc that approaches of forward direction by finding that algorithm designs in real time.The principle of realization is：It is logical
Cross in single domain（single area）It is interior to establish band position latitude and longitude information（It is accurate to rice）Full informational table of nodes, and each section
The active path table of point-to-point between point, each participation networking node is distributed on demand, in practical communication, data send/forward end
By the actual direction according to source and target, distance, a route is simultaneously and dynamically selected, positive steepest presses on towards close-target point, directly
To being sent to target（This communicates successfully）Or beyond positive domain transmission（This communication is unsuccessful）.Although the algorithm needs meter in real time
Calculate, produce route, but be all that binocular simple operation is little to overhead, and because abandoned it is each in traditional routing algorithms in
Shortest path generation, the Dynamic Maintenance of routing table, renewal and the renewal opportunity problem of intermediate node so that route formation efficiency is big
Channel congestion problems between big raising and each node caused by routing update mechanism substantially eliminate in theory.
Described optimal routing algorithm select permeability.If referring to, energy point-to-point goes directly, and directly selects the path；It is no
Then, will be according to path general direction, selection is immediate with direction angle but without departing from the next-hop of positive transmission range, makes road
From quickly approaching, restraining to nearest direction.When data are sent to next-hop, the weights of both sides' active path table are updated, and open automatically
Dynamic next-hop；When data be sent to next-hop it is unsuccessful when, update sender's active path table weights simultaneously update full nodal information
The confidence level of next-hop in table（Weights）To be used as Path selection foundation next time.
Described single domain（single area）MANET concept technology.The topology for referring to MANET is single completely by what is selected
MANET equipment is closed to realize there is exclusiveness to miscellaneous equipment and routing algorithm, by single domain from group（single
area）It is interior to establish band position latitude and longitude information（It is accurate to rice）Full informational table of nodes, and between each node point-to-point it is effective
Routing table, each participation networking node is distributed on demand, in practical communication, data send/forwarded end by according to source and target
Actual direction, distance, a route is simultaneously and dynamically selected, positive steepest presses on towards close-target point, until being sent to target（This
Communicate successfully）Or beyond positive domain transmission（This communication is unsuccessful）.
The full node table of described MANET.The positional information of node must be carried, is accurate to rice, path general direction is calculated with this
And approach angle.It can be gathered and realized by the GPS/ Big Dippeves locating module carried to each node.
Described each node reaches generation and the update mechanism of effective node table.By can be straight for each node in the update cycle
The node listing of the other nodes in the domain reached, all it is binocular simple operation although the algorithm needs to calculate in real time, produces route
It is little to overhead, and because abandoned the shortest path generation of each intermediate node in traditional routing algorithms, routing table
Dynamic Maintenance, renewal and renewal opportunity problem so that route formation efficiency greatly improve and each node between because of routing update
Channel congestion problems caused by mechanism substantially eliminate in theory.
Described positive approximation technique.Refer to the transmission of the axis positive direction along source node to destination node and axle can not be deviated from
Transmit in line direction.
The single domain Ad Hoc that the forward direction of the present invention is approached by finding that following Core Feature is realized in algorithm design in real time：
（1）The generation of the full node table of hoc network（Each node must carry GPS/ Big Dipper positioning functions, be accurate to rice, and road is calculated with this
Footpath general direction and approach angle）.
（2）Each node reaches generation and the update mechanism of effective node table（On-demand update, when considering that certain communicates unsuccessful
By the table through node carry out pressure renewal）.
（3）The routing problem of algorithm.If energy point-to-point goes directly, the path is directly selected；Otherwise, will be according to path
General direction, selection is immediate with direction angle but without departing from the next-hop of positive transmission range, makes route to nearest direction
Quickly approach, restrain.When data are sent to next-hop, the weights of renewal both sides' active path table, and automatic start next-hop；Work as number
According to be sent to next-hop it is unsuccessful when, what is updated the weights of sender's active path table and update next-hop in full informational table of nodes can
Reliability（Weights）To be used as Path selection foundation next time.
（4）The routing problem of algorithm.If energy point-to-point goes directly, the path is directly selected；Otherwise, will be according to path
General direction, selection is immediate with direction angle but without departing from the next-hop of positive transmission range, makes route to nearest direction
Quickly approach, restrain.When data are sent to next-hop, the weights of renewal both sides' active path table, and automatic start next-hop；Work as number
According to be sent to next-hop it is unsuccessful when, what is updated the weights of sender's active path table and update next-hop in full informational table of nodes can
Reliability（Weights）To be used as Path selection foundation next time.
（5）The Routing for On-Demand Protocol in MANET of entirely autonomous innovation, try hard to the expense of minimum obtain optimal efficiency of transmission and
Stability.Ensure data frame all the time by optimal link transmission.Routing Protocol can provide Its Fault Tolerance and robustness is supported,
Can be rapid to select alternate link to avoid business from providing interruption in radio link failure.Routing Protocol can utilize flow work
Journey technology, load balancing is carried out between mulitpath, utilize system resource to greatest extent.Routing Protocol support simultaneously router and
User terminal.
The foregoing is merely illustrative of the preferred embodiments of the present invention, is not used for limiting the practical range of the present invention.It is every
Content according to scope of the present invention patent makees any trickle amendment, equivalent changes and modifications, belongs to application claims
In the range of protection.The scope of the present invention is defined by the appended claims and its equivalents.
Claims (5)
1. the optimal routing algorithm select permeability according to claims 1, if referring to, energy point-to-point goes directly, directly
Select the path；Otherwise, will be according to path general direction, selection is immediate with direction angle but without departing from positive transmission range
Next-hop, route quickly approached, restrained to nearest direction, when data are sent to next-hop, renewal both sides' active path table
Weights, and automatic start next-hop；When data be sent to next-hop it is unsuccessful when, update the weights and more of sender's active path table
The confidence level of next-hop in new full informational table of nodes（Weights）To be used as Path selection foundation next time.
2. according to the single domain described in claims 2（single area）MANET concept technology, refer to the topology of MANET completely
Realize there is exclusiveness to miscellaneous equipment and routing algorithm, by list from group by selected single MANET equipment is closed
Domain（single area）It is interior to establish band position latitude and longitude information（It is accurate to rice）Full informational table of nodes, and point between each node
To the active path table of point, each participation networking node is distributed on demand, in practical communication, data send/forwarded end by basis
The actual direction of source and target, distance, a route is simultaneously and dynamically selected, positive steepest presses on towards close-target point, until being sent to
Target（This communicates successfully）Or beyond positive domain transmission（This communication is unsuccessful）.
3. the full node table of MANET according to claims 3, refers to the positional information that must carry node, is accurate to rice, with
This calculates path general direction and approaches angle, can be gathered and realized by the GPS/ Big Dippeves locating module carried to each node.
4. each node according to claims 4 reaches generation and the update mechanism of effective node table, by all to update
The node listing for the other nodes in the domain that each node can go directly in phase, although the algorithm needs to calculate in real time, produces route, all
It is that binocular simple operation is little to overhead, and because has abandoned the shortest path of each intermediate node in traditional routing algorithms
Generation, the Dynamic Maintenance of routing table, renewal and renewal opportunity problem so that route formation efficiency greatly improves and each node
Between channel congestion problems caused by routing update mechanism substantially eliminate in theory.
5. the positive approximation technique according to claims 5, refer to the axis positive direction along source node to destination node and pass
It is defeated and can not deviate from axis direction transmit.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710453954.1A CN107454648A (en) | 2017-06-15 | 2017-06-15 | Based on the single domain Ad Hoc that forward direction is approached by finding that algorithm designs in real time |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710453954.1A CN107454648A (en) | 2017-06-15 | 2017-06-15 | Based on the single domain Ad Hoc that forward direction is approached by finding that algorithm designs in real time |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107454648A true CN107454648A (en) | 2017-12-08 |
Family
ID=60486592
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710453954.1A Withdrawn CN107454648A (en) | 2017-06-15 | 2017-06-15 | Based on the single domain Ad Hoc that forward direction is approached by finding that algorithm designs in real time |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107454648A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100128703A1 (en) * | 2008-11-26 | 2010-05-27 | Matthew Brand | Method for Routing Packets in Wireless Ad-Hoc Networks with Probabilistic Delay Guarantees |
| US20110255577A1 (en) * | 2000-06-13 | 2011-10-20 | Cpu Consultants, Inc. | Apparatus for calculating weights associated with a received signal and applying the weights to transmit data |
| CN103747498A (en) * | 2014-01-17 | 2014-04-23 | 华北电力大学 | Direction angle-based wireless sensor network routing void optimization method |
| CN104579958A (en) * | 2014-12-25 | 2015-04-29 | 东软集团股份有限公司 | GPSR (greedy perimeter stateless routing) protocol based route optimization method and device |
| CN106211257A (en) * | 2016-07-08 | 2016-12-07 | 广州大学 | A kind of energy acquisition routing algorithm for wireless sensor based on geographical position |
-
2017
- 2017-06-15 CN CN201710453954.1A patent/CN107454648A/en not_active Withdrawn
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110255577A1 (en) * | 2000-06-13 | 2011-10-20 | Cpu Consultants, Inc. | Apparatus for calculating weights associated with a received signal and applying the weights to transmit data |
| US20100128703A1 (en) * | 2008-11-26 | 2010-05-27 | Matthew Brand | Method for Routing Packets in Wireless Ad-Hoc Networks with Probabilistic Delay Guarantees |
| CN103747498A (en) * | 2014-01-17 | 2014-04-23 | 华北电力大学 | Direction angle-based wireless sensor network routing void optimization method |
| CN104579958A (en) * | 2014-12-25 | 2015-04-29 | 东软集团股份有限公司 | GPSR (greedy perimeter stateless routing) protocol based route optimization method and device |
| CN106211257A (en) * | 2016-07-08 | 2016-12-07 | 广州大学 | A kind of energy acquisition routing algorithm for wireless sensor based on geographical position |
Non-Patent Citations (4)
| Title |
|---|
| 刘叶: ""基于地理位置信息的移动自组织网路由算法研究"", 《信息科技辑》 * |
| 孙宇鹭: ""基于地理位置的WSN节能分簇路由技术研究"", 《信息科技辑》 * |
| 张宗正: ""车载自组织网络GPSR路由算法的研究及改进"", 《工程科技Ⅱ辑》 * |
| 谢志恒: ""基于距离和角度的无线传感器网络路由方案"", 《计算机工程与应用》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100591029C (en) | Multi-jump wireless self-organizing network construction method based on partition tree | |
| JP4425863B2 (en) | Packet transfer system and radio base station | |
| US7660287B2 (en) | Method, communication device and system for address resolution mapping in a wireless multihop ad hoc network | |
| CN101160863A (en) | Method for routing mobile node in wireless mesh network and the communication system thereof | |
| US8284775B2 (en) | Six-address scheme for multiple hop forwarding in wireless mesh networks | |
| CN103260211B (en) | A kind of AOMDV method for routing of improvement | |
| CN103108374B (en) | A kind of energy-saving routing algorithm of mixed structure mine emergency management and rescue wireless mesh network | |
| CN102149161A (en) | Hierarchical and regular mesh network routing method | |
| CN110139335A (en) | A kind of mobile Ad Hoc network method for routing based on node location information and active volume | |
| CN106850436A (en) | Mine hybrid wireless mesh network routing protocols based on virtual potential energy field | |
| Tu et al. | GSPR-MV: A routing protocol based on motion vector for VANET | |
| CN106686680B (en) | A kind of route optimization system and method for car networking | |
| Mahajan et al. | Event driven dynamic path optimization for AODV in MANET | |
| CN107454648A (en) | Based on the single domain Ad Hoc that forward direction is approached by finding that algorithm designs in real time | |
| Bravo-Torres et al. | Mobile data offloading in urban VANETs on top of a virtualization layer | |
| Stalin et al. | A survey on topology and geography based routing protocols in vanets | |
| CN202143217U (en) | Communication equipment based on mobile self-networking technology | |
| Mir et al. | Infrastructure-assisted joint power adaptation and routing for heterogeneous vehicular networks | |
| Gruber et al. | Ad hoc routing for cellular coverage extension | |
| Saifullah et al. | A new geographical routing protocol for heterogeneous aircraft ad hoc networks | |
| Zadin et al. | Stable connections using multi-paths and conservative neighborhood ranges in mobile ad hoc networks | |
| Rodrigue et al. | Routing protocols: When to use it in terms of energy? | |
| CN103685038A (en) | Broadcast route selecting method based on relative node movement speed and node intensity in wireless Ad-hoc network | |
| Kolipaka et al. | Joint admission control and vertical handoff between WLAN and WIMAX in wireless mesh networks for QoS | |
| Bravo-Torres et al. | An efficient combination of topological and geographical routing for VANETs on top of a virtualization layer |
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 | ||
| CB02 | Change of applicant information |
Address after: Software Park No. 89 Copper Road Software Avenue Gulou District of Fuzhou city in Fujian province 350001 F District No. 4 building 20, 21, 22 Applicant after: Zhongfutong Group Co., Ltd. Address before: Software Park No. 89 Copper Road Software Avenue Gulou District of Fuzhou city in Fujian province 350003 F District No. 4 building 20, 21, 22 Applicant before: Incorporated company of middle Futong |
|
| CB02 | Change of applicant information | ||
| WW01 | Invention patent application withdrawn after publication |
Application publication date: 20171208 |
|
| WW01 | Invention patent application withdrawn after publication |