CN109981808A - A kind of IP address analytic method of the efficient substitution ARP protocol of low overhead - Google Patents
A kind of IP address analytic method of the efficient substitution ARP protocol of low overhead Download PDFInfo
- Publication number
- CN109981808A CN109981808A CN201910078591.7A CN201910078591A CN109981808A CN 109981808 A CN109981808 A CN 109981808A CN 201910078591 A CN201910078591 A CN 201910078591A CN 109981808 A CN109981808 A CN 109981808A
- Authority
- CN
- China
- Prior art keywords
- friendly neighbour
- information
- time
- neighbour
- friendly
- 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
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L61/00—Network arrangements, protocols or services for addressing or naming
- H04L61/09—Mapping addresses
- H04L61/10—Mapping addresses of different types
- H04L61/103—Mapping addresses of different types across network layers, e.g. resolution of network layer into physical layer addresses or address resolution protocol [ARP]
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
Object of the present invention is to overcome the shortcomings of existing ARP in the application, a kind of IP address analytic method of efficient substitution ARP protocol of effective low overhead is provided, utilize the communication of friendly neighbour's protocol information, and reach the change in topology for timely adapting to network, and the advantage with lower routing protocol overhead.Friendly neighbour's information frame can periodically be sent, and the whole network arbitrary node summarizes friendly neighbour's information of forwarding all nodes of the whole network while updating itself friendly neighbour's information.The whole network shares same friendly neighbour's table, such as attached drawing 1.At this time after 5 power-off restarting of node, without sending broadcast packet, as long as friendly neighbour's table of duplication neighbours, improves efficiency.It is of the invention the result is that: reduce expense of the agreement in radio resource.Reduce the influence for increasing protocol overhead to network due to needing to adapt to high-speed mobile.Make it possible that a large amount of clients are arranged net and supported to large area.
Description
Technical field:
The present invention is the IP address analytic technique of the efficient substitution ARP protocol of low overhead, belongs to field of communication technology.
Background technique:
With the development of communication technology with the raising of mobile terminal performance, wire and wireless multimedium converged network application get over
Come more extensive.In multihop network, the mobility of user terminal has very big randomness, they are not only moved at any time, can also
With startup and shutdown at any time.Along with wireless launcher sends the variation of power, between radio communication channel interfere with each other with
And the influence of the factors such as landform, the topological structure of network may change at any time, and these variations can not know in advance.Net
Network topology dynamic change is frequent.The movement of node is so that network topology constantly changes, for frequent network topology change, tradition
Solid-state network routing protocol be difficult in time, accurately reflect the topological structure of network, and in order to safeguard that network topology is used
Control information be continuously transmitted in network, to occupy a large amount of wireless bandwidth.
Broadcast distribution routing update information is gone by traditional ARP, excessive broadband expense can be brought, especially in link
Change in frequent network, largely more new information can occupy considerable valuable bandwidth, increase protocol overhead.
Each node in network requires to maintain a global arp cache table, and any variation of chain road all can be immediately
Trigger link updates, once the operation such as have equipment to restart, be added, to re-establish arp cache table at this time, while low efficiency and also
Occupy a large amount of resource.
Summary of the invention:
The purpose of the present invention is overcoming the shortcomings of existing ARP in the application, a kind of effective low overhead high efficiency is provided
Substitution ARP protocol IP address analytic method, using the communication of friendly neighbour's protocol information, and reach and timely adapt to network and open up
Flutter variation, and the advantage with lower routing protocol overhead.
Detailed description of the invention:
1. Fig. 1 shows traditional ARP establishment processes.
2. Fig. 2 indicates the establishment process of friendly neighbour, the efficiency of ARP is improved.
3. Fig. 3 is effective friendly neighbour's information frame (Friends Beacon) known to each Mesh node periodicity sending local,
Protocol frame format.
4. the specific descriptions that Fig. 4 is its data segment contents of Mesh protocol frame format.
Specific implementation of the invention:
The establishment process of 1.ARP and the establishment process of friendly neighbour.
ARP is that the corresponding MAC Address of specific IP is got by way of " question-response ", is then stored in local " ARP
Cache table " if subsequent needs, is arrived and is searched here.Since being " caching " table, it is meant that its time-effectiveness, and if electricity
If brain or communication equipment are restarted, this table will be emptied；That is, if need next time to communicate, and need to carry out ARP
Request." asking " is realized by the forms of broadcasting, and " answering " is to pass through unicast fashion.
With reference to Figure 1A RP establishment process.When node 5 is respectively to node 1, node 2, node 3, node 4 sends broadcast packet and simultaneously receives
This arp cache table is saved after responding to unicast, but at this point, to be weighed at this time if arp cache table is lost after 5 power-off restarting of node
New broadcast restores arp cache table, time-consuming, occupied bandwidth, inefficient high consumption.
With reference to Fig. 2 friendly neighbour's establishment process.Friendly neighbour's information frame can periodically be sent, and the whole network arbitrary node updates itself friendly neighbour's information
While summarize forwarding all nodes of the whole network friendly neighbour's information.The whole network shares same friendly neighbour's table.5 power-off restarting of node at this time
Afterwards, without sending broadcast packet, as long as friendly neighbour's table of duplication neighbours, improves efficiency.
The life cycle of 2.ARP and the life cycle comparison of friendly neighbour.
During ARP, every primary routing of foundation can be all stored in arp cache table, except order is deleted, or power-off
Outside, this table comes into force always.
It is that the timely network topology that adapts to changes and reduce routing protocol overhead in friendly neighbour, is adapted dynamically it and sends week
Phase, and then reach the expense advantage adapted between network topology variation and reduction Routing Protocol in time.Therefore except friendly neighbour's information is sent
Outside frequency can be arranged by Friends Beacon Interval, there are two control time-out time for every Friends record.In this way
The expense between Routing Protocol is not only reduced, the spread scope of friendly neighbour's information is also controlled.
Propagate time-out time (Propagate Timeout): after time-out, the failure of friendly neighbour's information does not go on propagation.
It records time-out time (Disappear Timeout): after time-out, deleting friendly neighbour's information
Time relationship is as follows:
Propagate Timeout=Friends Beacon Interval*Max Hop
Disappear Timeout=Propagate Timeout*Max_Hop wherein Friends Beacon
Interval is friendly neighbour's information frame interval time, and Max Hop is to destination node maximum hop count.
3. the method for service that friendly neighbour provides
Service is provided by two kinds of forms:
Direct function calls and (is directed to kernel module): inquiry meets a certain information standard (such as IP address mask)
Node whether there is in Mesh network
PROC file: Mesh network node and its information list (friends file), content include (address Mac, IP
Address, mask)
4. the realization mechanism of friendly neighbour
Effective friendly neighbour's information frame (Friends Beacon) known to each Mesh node periodicity sending local.Information lattice
Formula meets Mesh protocol frame format (Type=FRD_Beacon): specific as shown in Figure 3.Wherein its number of Mesh protocol frame format
It is as shown in Figure 4 according to section content.
When node sends Friend Beacon, itself corresponding Seq is increased by 1.
The node for receiving Friends Beacon carries out the control of friendly neighbour's effectiveness of information according to the value of Seq in message.When
When Seq is greater than Seq (being needed in realization in view of Seq circulatory problems) of local record, friendly neighbour's information time-out time is reset, otherwise
Ignore the information.
5. the configuration of friendly neighbour
Friends Beacon Interval: send the period of Friend Beacon (0 is not send)
It is of the invention the result is that:
1. greatly reducing expense of the agreement in radio resource.
2. greatly reducing the influence for increasing protocol overhead to network due to needing to adapt to high-speed mobile.
3. making it possible that a large amount of clients are arranged net and supported to large area.
Claims (10)
1. according to claim 1, friendly neighbour's information frame can periodically be sent, the whole network arbitrary node updates the same of itself friendly neighbour's information
When summarize forwarding all nodes of the whole network friendly neighbour's information.The whole network shares same friendly neighbour's table.At this time after node power-off restarting, it is not necessarily to
Broadcast packet is sent, as long as friendly neighbour's table of duplication neighbours, improves efficiency.
2. it is according to claim 1, that the timely network topology that adapts to changes and reduce routing protocol overhead in friendly neighbour, it is active
State adjusts its sending cycle, and then reaches the expense advantage adapted between network topology variation and reduction Routing Protocol in time.
3. according to claim 1, friendly neighbour's information transmission frequency can be arranged outer by Friends Beacon Interval, often
There are two control time-out time for Friends record.The expense between Routing Protocol is not only reduced in this way, also controls friendly neighbour's letter
The spread scope of breath.
4. according to claim 1, propagating time-out time (Propagate Timeout): after time-out, the failure of friendly neighbour's information,
Propagation is not gone on.
5. according to claim 1, recording time-out time (Disappear Timeout): after time-out, deleting friendly neighbour's information.
6. according to claim 1, friendly neighbour provides direct function and calls and (be directed to kernel module): inquiry meets a certain information mark
The node of quasi- (such as IP address & mask) whether there is in Mesh network.
7. according to claim 1, friendly neighbour provides PROC file: Mesh network node and its information list (friends text
Part), content includes (address Mac, IP address, mask).
8. according to claim 1, effective friendly neighbour's information frame known to each Mesh node periodicity sending local of friendly neighbour
(Friends Beacon).Information format meets Mesh protocol frame format (Type=FRD_Beacon): specific as specification is attached
Shown in Fig. 3.Wherein its data segment contents of Mesh protocol frame format are as shown in Figure of description 4.
9. according to claim 1, node sends Friend Beacon, itself corresponding Seq is increased by 1.It receives
The node of Friends Beacon carries out the control of friendly neighbour's effectiveness of information according to the value of Seq in message.When Seq is greater than local note
When Seq (being needed in realization in view of Seq circulatory problems) of record, friendly neighbour's information time-out time is reset, the information is otherwise ignored.
10. according to claim 1, the configuration of friendly neighbour: Friends Beacon Interval: sending Friend Beacon
Period (0 for do not send).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910078591.7A CN109981808A (en) | 2019-01-28 | 2019-01-28 | A kind of IP address analytic method of the efficient substitution ARP protocol of low overhead |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910078591.7A CN109981808A (en) | 2019-01-28 | 2019-01-28 | A kind of IP address analytic method of the efficient substitution ARP protocol of low overhead |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109981808A true CN109981808A (en) | 2019-07-05 |
Family
ID=67076791
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910078591.7A Pending CN109981808A (en) | 2019-01-28 | 2019-01-28 | A kind of IP address analytic method of the efficient substitution ARP protocol of low overhead |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109981808A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114710795A (en) * | 2022-06-06 | 2022-07-05 | 希诺麦田技术（深圳）有限公司 | ARP table optimization method, equipment and application of wireless ad hoc network |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101242431A (en) * | 2008-01-21 | 2008-08-13 | 北京航空航天大学 | Layer-cross mobile Ad Hoc network service discovery method |
| CN103269299A (en) * | 2013-04-22 | 2013-08-28 | 杭州华三通信技术有限公司 | Packet forwarding method and device in SPBM network |
| CN105813165A (en) * | 2016-03-03 | 2016-07-27 | 北京交通大学 | Wireless Mesh network applied MAC layer distributed type scheduling mechanism |
-
2019
- 2019-01-28 CN CN201910078591.7A patent/CN109981808A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101242431A (en) * | 2008-01-21 | 2008-08-13 | 北京航空航天大学 | Layer-cross mobile Ad Hoc network service discovery method |
| CN103269299A (en) * | 2013-04-22 | 2013-08-28 | 杭州华三通信技术有限公司 | Packet forwarding method and device in SPBM network |
| CN105813165A (en) * | 2016-03-03 | 2016-07-27 | 北京交通大学 | Wireless Mesh network applied MAC layer distributed type scheduling mechanism |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114710795A (en) * | 2022-06-06 | 2022-07-05 | 希诺麦田技术（深圳）有限公司 | ARP table optimization method, equipment and application of wireless ad hoc network |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP4173484B2 (en) | Mobile communication system, line concentrator, radio base station, mobile station, and communication method | |
| KR100915276B1 (en) | System and method to support multicast routing in large scale wireless mesh metworks | |
| JP5727670B2 (en) | Multi-interface terminal adjacent topology discovery, cooperative communication method, and multi-interface terminal | |
| CN102148756B (en) | IPv6 over low power wireless personal area network (6LoWPAN) neighbor discovery-based tree routing method | |
| WO2007048309A1 (en) | A method for routing mn in wireless mesh network and the communication system thereof | |
| CN106954243B (en) | Route realizing method based on wireless chain network | |
| CN103260211B (en) | A kind of AOMDV method for routing of improvement | |
| US7881250B2 (en) | Packet communication system | |
| CN101102283A (en) | A method and device for optimizing unknown unicast forward at wireless access point | |
| CN107528721B (en) | Automatic networking and data forwarding method by using MAC address in Android mobile terminal | |
| CN104254110A (en) | Wireless Mesh network inter-domain switching method | |
| WO2024001190A1 (en) | Message sending method, device intelligent interconnection system, related device, and storage medium | |
| CN109005567B (en) | Mobile network implementation method based on cluster | |
| JP2009273140A (en) | Hybrid type mesh routing protocol | |
| CN107948939B (en) | Wireless NDN data processing method, device and system | |
| CN101815337B (en) | Wireless ad hoc network reactive route method based on probability | |
| CN109981808A (en) | A kind of IP address analytic method of the efficient substitution ARP protocol of low overhead | |
| CN104219156A (en) | Multicast routing method applicable for hierarchical air ad hoc network | |
| Kim | Beyond LTE-advance for information centric networking | |
| CN102026330A (en) | Method for improving availability of ad hoc network | |
| CN109474531B (en) | Method for deleting synchronization of packet access network switching table items | |
| CN110380963B (en) | Neighbor discovery method with high efficiency and fast convergence | |
| Bai et al. | Hello message scheme enhancement in CRMANET | |
| CN104540240A (en) | Access method for vehicle-mounted client supported by wireless network | |
| CN106658479B (en) | Method for realizing wireless network convergence |
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 | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20190705 |
|
| WD01 | Invention patent application deemed withdrawn after publication |