CN107580353A - A kind of method for routing of Wireless Ad Hoc network - Google Patents
A kind of method for routing of Wireless Ad Hoc network Download PDFInfo
- Publication number
- CN107580353A CN107580353A CN201610532161.4A CN201610532161A CN107580353A CN 107580353 A CN107580353 A CN 107580353A CN 201610532161 A CN201610532161 A CN 201610532161A CN 107580353 A CN107580353 A CN 107580353A
- Authority
- CN
- China
- Prior art keywords
- node
- routing
- domain
- network
- hop count
- 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
Landscapes
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention relates to a kind of method for routing that wireless communication field, each node related more specifically in Wireless Ad Hoc network (also referred to as mobile peer-to-peer network, wireless ad hoc network etc.) communicate.Although this method, using hybrid Routing Protocol, the definition of routing domain basic conception and existing protocol have very big difference in the agreement.The present invention determines the scope of routing domain using the quantity of connection surroundings nodes, describes the method for member node in each node selection routing domain in network in detail, while has also redefined the peripheral node of correlation and the concept of internal node.
Description
Technical field
The present invention relates to wireless communication field, relate more specifically to Wireless Ad Hoc network (also referred to as mobile peer-to-peer network,
Wireless ad hoc network etc.) in a kind of method for routing for communicating of each node.
Background technology
Wireless Ad Hoc network is collectively constituted by multiple terminal nodes with radio transmission-receiving function, between them
The support of network infrastructure (such as base station or focus) that communicates and need not fix, each terminal node can with wirelessly penetrate
Other node direct communications in the range of frequency, and more telecommunication, net can be realized by information forwarding (jump) between node
Node in network can move freely, and the wireless topologies of network can arbitrarily change and can not predict.In general, Ad
Route between Hoc network interior joint includes multi-hop (repeatedly forwarding), therefore this network is also referred to as multi-hop wireless Ad Hoc networks, nothing
Node in line Ad Hoc networks has the function of main frame and router concurrently simultaneously.
The existing Routing Protocol for Wireless Ad Hoc network is broadly divided into Table Driven agreement, on-demand routing protocol
With the hybrid class of Routing Protocol three：
1) Table Driven agreement is also known as Proactive routing protocols or Active Routing Protocol in Active.Each node in network will
A metastable routing table for arriving other nodes is safeguarded, regularly or when network topology structure changes, node is complete
Broadcast routing information updates in net, each node is continuously obtained current network information, the routing table of each node
The topological structure of current network can be reflected exactly, when node needs to send data, can be acquired immediately up to purpose section
The route of point, suitable for there is the communication network of real-time and Qos requirements.
2) on-demand routing protocol is also known as Reactive routing protocols or source and starts on-demand routing protocol, be it is a kind of when needed
Search the Route Selection mode of route.Node need not safeguard routing table promptly and accurately, when needing to send data just complete
Route querying process is initiated in net, terminates to look into once having inspected all possible route permutations mode or having found after new route
Look for.After Route establishment, safeguard that this route by route maintenance program, deleted when it is no longer required.
3) hybrid Routing Protocol is by the one of two kinds of agreement compromise balances of Table Driven agreement and on-demand routing protocol
Kind agreement.Table Driven agreement actively frequent distributing routing information, thus reliability is high, delay is small, but with network
The increase of scale and show and difference scalability and high routing cost, and much control message it is often useless
's.On-demand routing protocol is to search and safeguard on demand route, and routing cost is low, but it is big to send data delay and shake.By two
The hybrid Routing Protocol that person combines, Table Driven agreement is used in subrange, safeguards routing iinformation accurately and timely,
And reduce route test information propagation scope, when destination node farther out when, by search find route, so can both reduce
The expense of Routing Protocol, delay character are also improved.
In hybrid Routing Protocol, node active maintenance reaches the route of destination node in local adjacent area, by this
Individual local adjacent area is called routing domain.Exactly, the routing domain of a node is defined as a group node, its
The minimum hop count distance for leaving query node is not more than the domain radius.Route choosing is especially emphasized in existing hybrid Routing Protocol
The description that domain is not physical distance is selected, but the description of (hop count) is connected between node.As shown in figure 1, the figure provides a node S
Domain radius be equal to 2 jump routing domains example.Fig. 1 interior joints A, B, C, D, E, F, G, H, I, J, K are node S route
The member node in domain is selected, node L is in the outside of node S routing domain.In member's section of node S routing domain
In point, those are exactly equal to the node that the domain radius is 2 with a distance from hop count from node S, are referred to as the peripheral node in the domain, such as Fig. 1
In node G, H, I, J, K.And node A, B, C, D, E, F are then the internal nodes of the routing domain.
Node S will send message to a destination node, and whether node S first checks for destination node in its routing domain
Interior (because each node maintenance reaches the routing iinformation of all nodes in its routing domain).If destination node is in node
In S routing domain, then the just known path for reaching destination node, without carrying out the processing of path finding again.If mesh
Node not in node S routing domain, then node S borders broadcast (message from a node broadcasts to its periphery
Node) route requests are to its all peripheral node.All these peripheral nodes perform again after receiving route requests
Identical algorithm：Check destination node whether in its respective routing domain.If destination node is in some periphery
In the routing domain of node, then the peripheral node just produces a route replies, and points out to reach destination node wherein
Route, be then passed back to node S.Otherwise, the route requests are forwarded to its peripheral node by peripheral node again, repeat phase
Same processing procedure, untill being route needed for finding.
The content of the invention
Node in the Wireless Ad Hoc network that the present invention describes is also to use hybrid Routing Protocol, but in the agreement
The definition of routing domain basic conception and existing protocol have very big difference.Existing protocol is using minimum hop count apart from constraint route
The size of domain scope is selected, and the present invention determines the scope of routing domain using the quantity of connection surroundings nodes.In network
Each node determines that the process of the scope of oneself routing domain is as follows：
1) quantity for determining the routing domain member node of this node is N；
2) this node receives the route test information of surroundings nodes, and each node around is pressed the minimum apart from this node
Hop count is sorted out from small to large.
3) hop-by-hop adds up since 1 hop node quantity, stops adding up when adding up and more than or equal to N, and writes down current
Hop count T.
4) member node for defining the current routing domain of the node is no more than T's apart from node minimum hop count distance
Node.And it is equal to T node apart from node minimum hop count distance, it is referred to as the peripheral node in the domain.Member's section in the same domain
Point subtracts the internal node that the remaining node of domain peripheral node is then the routing domain.
Each node in network is can be seen that from the calculating process in the above-mentioned node-routing selection domain defined using the present invention
The domain radius hop count of routing domain is not necessarily identical, but the quantity of member is big in the routing domain of each node
Body phase is worked as.As Fig. 2 illustrates, the quantity of member node is used to determine routing domain range size for 8, then node S route
Selection domain member has A, B, C, D, E, F, G, H, I, J totally 10 nodes, and the domain radius is equal to 2 and jumped.And node P routing domain
Member has C, S, F, A, B, I, J, M, K, L also 10 nodes, but the domain radius is equal to 5 and jumped just at the right time.
Same such as Fig. 2 illustrates, if determining the size of node-routing selection domain scope, node S using existing method
Domain radius be equal to the 2 routing domain members jumped and have A, B, C, D, E, F, G, H, I, J totally 10 nodes, and node P domain half
Footpath is equal to the 2 routing domain members jumped and there was only two nodes of K, L.Jumped if node S domain radius is equal to 5, it route choosing
Select the node that domain member contains Fig. 2 whole networks.
Because the diverse location of node in a network, and surrounding connection status are widely different, using existing method come really
Determine the size of node-routing selection domain scope, each node-routing in network can be caused to select number of members in domain to differ greatly, and
And when node moves to the periphery among network, the node routing information change in its routing domain is huge.And use this
The routing domain of definition is invented, the above situation will improve much.
Brief description of the drawings：
Routing domain conceptual schematic view in the existing hybrid Routing Protocols of Fig. 1；
Routing domain conceptual schematic view in the hybrid Routing Protocol of Fig. 2 present invention；
Specific embodiment：
Here is the instantiation of a talkback system based on Wireless Ad Hoc network using the present invention.
The talkback system is used for ground observation, exploration or tourist party, and network size is designed as 100 nodes.Voice
Exchange has requirement of real-time to network, the change of nodes position stochastic and dynamic, dynamically produces and is contacted with other nodes,
Dynamically interrupt and contacted with other nodes, line up a team sometimes, bunch up sometimes.Analysis determines each node according to demand
The quantity of routing domain member node is 20, to ensure the requirement of real-time of network, each node needs section around in 1 second
Point sends the route test information of about 20 nodes, and the route test information of each node is 40, comprising node ID number and is arrived
Up to the hop count (hop count) of present node, the general 1Kbits/ of maximum cost of the bandwidth of the route test of so each node
s.Intercom node determines that the processing procedure of the scope of oneself routing domain is as follows：
1) this node receives the route test information of surroundings nodes, and each node around is pressed the minimum apart from this node
Hop count is sorted out from small to large, deletes the same node of surrounding to the big data of this node hop count.
2) hop-by-hop adds up since 1 hop node quantity, stops adding up when adding up and more than or equal to 20, and writes down current
Hop count T.Sometimes the route test information that surroundings nodes are sent is less, is added up at the end of cumulative and does not also reach 20, directly remembered
Current hop count T down.
3) node for selecting surroundings nodes to be not more than T apart from this node minimum hop count distance, the road current as this node
By the member node for selecting domain.Due to the random movement of nodes, so the routing domain member of each node is
State change.
The process that intercom node sends route test information to surroundings nodes is as follows：
1) when this node does not establish routing domain member node routing table also, this node is directly sent out to surroundings nodes
Send the ID number of this node that hop count is 0.
2) when this node has routing domain member's routing table, route test information that this node is sent to surroundings nodes
Including ID number of the hop count for 0 this node and current routing domain member node routing table information.
Using the present invention hybrid Routing Protocol node to surroundings nodes send route test information process also and
Different using the node of existing hybrid Routing Protocol, existing protocol distributes scope using hop count control packet, so as to
Network routing cost is controlled, and agreement of the present invention is directly to control network routing cost by limiting the size of distribution content,
It is more directly perceived.If network size is smaller, when each node routing domain number of members limits value close to whole network
Number of nodes when, the hybrid Routing Protocol is just degenerated to Table Driven agreement.
Claims (6)
- A kind of 1. method for routing of Wireless Ad Hoc network, it is characterised in that：In hybrid Routing Protocol, each node in network The quantity of surroundings nodes is connected using it come determine member node in its routing domain number, so that it is determined that its Route Selection The range size in domain.
- 2. member node in the routing domain of each node in network as claimed in claim 1, it is characterised in that：Choosing net In network in the routing domain of each node before member node, the quantity size N of the member node is first determined.
- 3. choosing the method for member node in the routing domain of each node in network as claimed in claim 2, its feature exists In：It will first sort out from small to large by the minimum hop count apart from the node with the surroundings nodes that the node is connected；Then from 1 hop node Quantity hop-by-hop adds up, and stops adding up when adding up and more than or equal to N, and write down current hop count T；The last selected distance section Point minimum hop count distance is not more than T all nodes, the member node as node-routing selection domain.
- 4. choosing the method for member node in the routing domain of each node in network as claimed in claim 2, its feature exists In：If the route test information that surroundings nodes are sent is less, the node add up add up at the end of surrounding connecting node quantity and Do not reach N, directly write down current hop count T yet.
- 5. hybrid Routing Protocol as claimed in claim 1, it is characterised in that：Each node sends road to surroundings nodes in network By control information, when the node does not also establish the routing table of routing domain member node, the node is directly to surrounding section Point sends the route test information for including the local node ID number content that hop count is 0.
- 6. each node sends route test information to surroundings nodes in network as claimed in claim 5, it is characterised in that：When this When node has established routing domain member node routing table, the node sends in route test information to surroundings nodes and includes road By the local node ID number and the routing table information of current routing domain member node that hop count is 0.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610532161.4A CN107580353A (en) | 2016-07-04 | 2016-07-04 | A kind of method for routing of Wireless Ad Hoc network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610532161.4A CN107580353A (en) | 2016-07-04 | 2016-07-04 | A kind of method for routing of Wireless Ad Hoc network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107580353A true CN107580353A (en) | 2018-01-12 |
Family
ID=61048936
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610532161.4A Pending CN107580353A (en) | 2016-07-04 | 2016-07-04 | A kind of method for routing of Wireless Ad Hoc network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107580353A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110380977A (en) * | 2019-06-28 | 2019-10-25 | 南京理工大学 | A kind of routing fusion method towards mobile ad hoc network Yu internet hybird environment |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1741501A (en) * | 2005-09-22 | 2006-03-01 | 中国科学院计算技术研究所 | Radio network group relationship routing system and method that part connects |
| CN101179499A (en) * | 2007-12-06 | 2008-05-14 | 上海大学 | Method for wireless self-organizing of monitoring system to form tree-shaped routing |
| CN101616466A (en) * | 2009-07-22 | 2009-12-30 | 哈尔滨工程大学 | A kind of ad hoc network zone routing method |
| CN101867519A (en) * | 2010-06-03 | 2010-10-20 | 中国人民解放军91655部队 | Dynamic area routing method and system for ad hoc network |
| US20100309841A1 (en) * | 2009-06-04 | 2010-12-09 | Conte Thomas M | Robust Multipath Routing |
| US20160127942A1 (en) * | 2007-08-30 | 2016-05-05 | Bae Systems Information And Electronic Systems Integration Inc. | Topology Aware MANET For Mobile Networks |
-
2016
- 2016-07-04 CN CN201610532161.4A patent/CN107580353A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1741501A (en) * | 2005-09-22 | 2006-03-01 | 中国科学院计算技术研究所 | Radio network group relationship routing system and method that part connects |
| US20160127942A1 (en) * | 2007-08-30 | 2016-05-05 | Bae Systems Information And Electronic Systems Integration Inc. | Topology Aware MANET For Mobile Networks |
| CN101179499A (en) * | 2007-12-06 | 2008-05-14 | 上海大学 | Method for wireless self-organizing of monitoring system to form tree-shaped routing |
| US20100309841A1 (en) * | 2009-06-04 | 2010-12-09 | Conte Thomas M | Robust Multipath Routing |
| CN101616466A (en) * | 2009-07-22 | 2009-12-30 | 哈尔滨工程大学 | A kind of ad hoc network zone routing method |
| CN101867519A (en) * | 2010-06-03 | 2010-10-20 | 中国人民解放军91655部队 | Dynamic area routing method and system for ad hoc network |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110380977A (en) * | 2019-06-28 | 2019-10-25 | 南京理工大学 | A kind of routing fusion method towards mobile ad hoc network Yu internet hybird environment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Zhuang et al. | Managing ad hoc networks of smartphones | |
| Gupta et al. | Performance metric comparison of AODV and DSDV routing protocols in MANETs using NS-2 | |
| US8213352B2 (en) | Wireless communication system, wireless communication device, wireless communication method, and program | |
| Fazio et al. | IP address autoconfiguration in ad hoc networks: Design, implementation and measurements | |
| Alubady et al. | Internet protocol MANET vs named data MANET: A critical evaluation | |
| Upadhyay et al. | Comparison and performance analysis of reactive type DSR, AODV and proactive type DSDV routing protocol for wireless mobile ad-hoc network, using NS-2 simulator | |
| Taksande et al. | A simulation comparison among AODV, DSDV, DSR protocol with IEEE 802.11 MAC for grid topology in MANET | |
| CN107580353A (en) | A kind of method for routing of Wireless Ad Hoc network | |
| JP2007181056A (en) | Path selection method | |
| Garg et al. | Simulation analysis of AODV, DSR and ZRP routing protocols in MANET using QualNet 5.0 simulator | |
| Kamkuemah et al. | A study of different routing protocols for mobile phone ad hoc networks connected via Bluetooth | |
| Ait-Salem et al. | A hybrid multiagent routing approach for wireless ad hoc networks | |
| Owczarek et al. | Analysis of Routing Protocols Metrics for Wireless Mesh Networks | |
| Khurana et al. | Analysis of group mobility and file mobility model for routing protocols in MANET using netsim | |
| Ladhake et al. | A review: ant based ad hoc routing protocols | |
| Sabri et al. | Geographic Routing with Logical Levels forwarding for Wireless Sensor Network | |
| Singh et al. | Performance evaluation of DSR, OLSR and ZRP using NetSim simulator | |
| Zoican | Analysis of Scalability in MANET's Protocols | |
| Jassim | Performance Study of AODV, GRP and OSPFv3 MANET Routing Protocols Using OPNET Modeler | |
| Mahmuddin et al. | Throughput Analysis of WM-LEACH, LEACH, MH-LEACH and V-LEACH Protocol: A Simulation Based Approach | |
| Patil et al. | Performance measurement and analysis of MANET routing protocols on nodes scalability | |
| Chand et al. | Performance Comparison of Two On-Demands Routing Protocols for Mobile Ad-hoc Networks | |
| KR20050079459A (en) | Secure router and method for routing thereof | |
| Riahla et al. | A mobile multi agent system for routing in adhoc network | |
| Polara et al. | Analyzing Performance of Zone Routing Protocol by Varying Node Density and Transmission Range |
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 | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20180112 |