CN1761231A - The construction method of the distributed dynamic cellular route of mobile self-grouping network - Google Patents
The construction method of the distributed dynamic cellular route of mobile self-grouping network Download PDFInfo
- Publication number
- CN1761231A CN1761231A CNA2004100649780A CN200410064978A CN1761231A CN 1761231 A CN1761231 A CN 1761231A CN A2004100649780 A CNA2004100649780 A CN A2004100649780A CN 200410064978 A CN200410064978 A CN 200410064978A CN 1761231 A CN1761231 A CN 1761231A
- Authority
- CN
- China
- Prior art keywords
- node
- dmbs
- message
- mobile
- network
- 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
Images
Abstract
The step of the structure of the construction method of the distributed dynamic cellular route of mobile self-grouping network is: 1. adopt the method that sends and accept " hello " message, dynamically find and the renewal neighbor node; 2. according to some mobile node MN of the policy selection of the consistency principle and prioritization as dynamic mobile base station DMBS; 3. produce, send, accept, handle the internet message message by the mobile base station, and generate route table items; Dynamically select an above mobile node MN and serve as interim mobile base station DMBS from network, each DMBS only manages the MN of all and its direct neighbor, has the topology information of whole network between the DMBS by exchange message; If a MN wants to send data, it just sends to packet the DMBS of own place honeycomb, and packet only carries out routing forwarding between DMBS or border mobile node BMN, finally arrive purpose DMBS, by purpose DMBS packet is sent to purpose MN.
Description
Technical field
The present invention is a kind of construction method of distributed dynamic cellular route of mobile self-grouping network, belongs to the route discovery and the selection technology of mobile self-grouping network.
Background technology
Mobile self-grouping network is that a no fixed base stations multi-hop that one group of mobile node that has a wireless transceiver is formed goes on foot interim autonomous networks system.Each mobile node be because the restriction of its wireless transmission distance must could be sent to packet the purpose mobile node by the forwarding of other mobile node, therefore, each mobile node be a main frame be again a router.Because the connection between the mobile node constantly dynamically changes, so the Routing Protocol on the conventional fixed network can't satisfy the specific (special) requirements of mobile ad hoc network, thereby, need special Routing Protocol to realize the information exchange between the mobile node in the mobile ad hoc network.Usually, Routing Protocol must be fit to the requirement of the dynamic change of network topology.
At present, the Routing Protocol of mobile ad hoc network mainly is divided into two classes: table drives route (table-driven) agreement and route (on-demand) agreement as required.Yet this two classes Routing Protocol all has weak point separately.Table drives Routing Protocol and requires all mobile nodes all must know the state information of current whole network, as topological structure, Link State etc.Therefore, this class Routing Protocol not too is fit to sweeping mobile ad hoc network.
In order to address this problem, people have proposed another kind of Routing Protocol---on-demand routing protocol, and on-demand routing protocol mainly contains two parts: route discovery and route are rebuild.Route discovery mainly be by certain form flooded broadcast route inquiry message determine between source and the purpose logical by.It is when network topology changes that route is rebuild, and can find and rebulid route timely.The most representative on-demand routing protocol is dynamic source routing protocol (DSR) and organizes distance vector protocol (AODV) as required certainly.The DSR agreement need be placed on routing iinformation in route answer and the packet, causes very big overhead.The AODV agreement is when a node in the route mobile makes that the packet of source mobile node can't arrive the purpose mobile node, rebulids route, and therefore, the AODV agreement is not suitable for the too fast network of network topology change.
Summary of the invention
Technical problem: the object of the present invention is to provide a kind of construction method of distributed dynamic cellular route of mobile self-grouping network, bigger to be fit to network size, network topology change is mobile self-grouping network faster.
Technical scheme: technical solution of the present invention is:
1. adopt transmission and the method for accepting hello message, dynamically find and the renewal neighbor node;
2. according to some mobile node MN of the policy selection of the consistency principle and prioritization as dynamic mobile base station DMBS;
3. produce, send, accept, handle the network topology message packet by the mobile base station, and generate route table items.
Wherein, dynamically select an above mobile node MN and serve as interim mobile base station DMBS from network, each DMBS only manages the MN of all and its direct neighbor, has the topology information of whole network between the DMBS by exchange message; If a MN wants to send data, it just sends to packet the DMBS of own place honeycomb, and packet only carries out routing forwarding between DMBS or border mobile node BMN, finally arrive purpose DMBS, by purpose DMBS packet is sent to purpose MN.
Honeycomb generation method: an above MN elects a MN with limit priority as their DMBS of management; Comprise its ID number in cycle in the hello message bag that MN sent in its and tell ID number of other MN oneself with this; If MNi find own ID than ID number of another MNj greatly, so, MNi just sends an elect-request message to MNj; MNj sends to MNi as replying with elect-ack message, and the ownDMBS variable is set to 0 simultaneously; After MNi received elect-ack message, just the ownDMBS variable was set to ID number of MNj; If the ID that MN is known another one MN is also littler than ID number of own DMBS, so, it also sends an election request elect-request message to this MN, when receiving that elect-ack message is replied in election, it just upgrades its ownDMBS variable, then, it sends a leave-oldDMBS message of leaving old DMBS also will for the DMBS before it, after its old DMBS received this leave-oldDMBS message, it was just left out the MN that sends this message from its MN tabulation.
The processing method of routing message: each node in the network is periodically broadcasted hello message, by ID from hello message to its neighbor node broadcast node number, the state of node; Node also will be announced the mobile base station DMBS of the mobile cellular at other its places of node by hello message, and the DMBS of other honeycomb that can arrive by this node; Like this, the DMBS of node just can know coupled DMBS node after receiving this hello message, and by which node forwarding can arrive these DNBS as boundary node, according to these message, thereby can generate its Link State Packet.
The generation of topological message and processing method: each the cellular basestation node DMBS in the network periodically broadcasts its Link State, and the node that need transmit is transmitted this message and calculated routing table according to the topology of network after receiving message; The link topological message of base station broadcast comprises the DNBS node set that has linked to each other between the node of two aspect honeycombs or the neighbor node; Base-station node obtains these contents according to the content of the two-way neighbours in its neighbor table, fills the DMBS content according to the content of the DMBS table that links to each other; General node does not need to produce topological message, does not need the forwarding topology message yet, thereby has reduced the extra bandwidth load.
Beneficial effect: we have taken into full account the characteristics of table driving and on-demand routing protocol on the basis of fixed cellular (fixed base stations is promptly arranged) architecture, distributed dynamic cellular generation technique based on the mobile tracking technology (DDCC agreement) has been proposed, in the DDCC agreement, several mobile nodes MN dynamically is selected from network and serves as interim mobile base station DMBS, each DMBS only manages the MN (promptly forming an interim honeycomb) of all and its direct neighbor, the topology information that has whole network between the DMBS by exchange message, and MN and do not know the topology information of whole network, it is only known and belongs to which DNBS itself.If DMBS causes link to break owing to moving, the DDCC agreement will detect automatically, and selects a DMBS (forming a new interim honeycomb) again.Under the support of DDCC agreement, the route of packet in dynamic cellular just can be imitated the route in the fixed cellular networks simply: if a MN wants to send data, it just sends to packet the DMBS of own place honeycomb, packet only carries out routing forwarding between DMBS or border mobile node BMN (any two DMBS that directly are communicated with or directly continuous or continuous by one or two BMN), the final purpose DMBS that arrives sends to purpose MN by purpose DMBS with packet.The route of this imitation fixed cellular promptly need not resemble to be shown to require each mobile node all to know the topology information of whole network the driving agreement, do not resemble the on-demand routing protocol a large amount of route inquiry message of broadcasting when route discovery and route are rebuild yet, thereby, improve bag transmission thing, alleviated routing overhead.Because traditional route technology is not suitable for the mobile self-grouping network dynamic change, present technique has remedied this defective, and it is bigger to be particularly suitable for network size, and network topology change is mobile self-grouping network faster.
Description of drawings
Fig. 1 is two class boundary node schematic diagrames.
Fig. 2 is an example of the Link State of topology table record.
Fig. 3 is packet loss comparison diagram (1).
Fig. 4 is packet loss comparison diagram (2).
Fig. 5 is packet loss comparison diagram (3).
Fig. 6 is packet loss comparison diagram (4).
Fig. 7 is a flow chart of the present invention.
Embodiment
The dynamic cellular route technology is a kind of layering route technology, and node is played the part of different roles in this technology: node (mobile base station DMBS and boundary node BMN) and the general node of being responsible for forwarding.By the honeycomb election algorithm whole network is divided into dynamic cellular one by one, mobile base station and boundary node constitute the framework of whole network.Have only mobile base station and boundary node to be responsible for the forwarding of protocol massages, thereby can reduce the extra bandwidth that agreement needs.
The dynamic cellular Routing Protocol also uses table to drive the thought of Routing Protocol, and forward node periodically calculates routing table.Link-state routing protocol is that a kind of widely used table drives Routing Protocol.Our dynamic cellular Routing Protocol also uses the thought of link-state routing protocol.Each node all will be broadcasted its link information and is not that each node all needs the broadcasting link state information in our the dynamic cellular Routing Protocol in link-state routing protocol, has only the mobile base station just need generate its Link State and to Web broadcast.The node that needs the broadcasting link state message to produce by minimizing has also reduced the needed extra bandwidth of agreement.General node does not need to generate its Link State Packet and to Web broadcast, but he also can obtain the getable all-network topology information of protocol massages forward node.Because certainly exist a base-station node in the hop neighbor of each general node, and each base-station node always will be broadcasted Link State Packet its oneself or that receive to its boundary node, the general node that is in its broadcasting area also always can access these Link State Packets, therefore, general node also can obtain and the as many network topological information of base-station node.
In all mobile node MN, manage the neighbours MN that they are had separately as dynamic mobile base station DMBS according to some MN of consistency policy selection.When a DMBS has removed is that dwelling period ground sends inquiry message (hello message), and then a new MN is just come out to serve as DMBS by automatic election.Each MN (comprising DMBS) has an ownDMBS variable.The ownDMBS variable is used for the DMBS of this MN of storage administration.Being provided with of ownDMBS variable is as follows: if MN has a DMBS, then ownDMBS is set to ID number of this DMBS; If MN itself is exactly a DMBS, then ownDMBS is set to 0; Other situation ownDMBS is set to 1.The hello message that all DMBS sent is comprising the information of current network.Each DMBS collects the message of all other DMBS and the MN inventory that these DMBS managed, and sends these information in the hello message that periodically sends.All MN and its neighbours send out the hello bag mutually and collect the information of related network with this, and original network information just is eliminated and upgrades after sending each hello message bag.An above MN elects a MN with minimum ID number as their DMBS of management.Comprise its ID number in cycle in the hello message bag that MN sent in its and tell ID number of other MN oneself with this.If MNi find own ID than ID number of another MNj greatly, so, MNi just sends an elect-request message to MNj.MNj sends to MNi as replying with elect-ack message, and the ownDMBS variable is set to 0 simultaneously.After MNi received elect-ack message, just the ownDMBS variable was set to ID number of MNj.If the ID that MN is known another one MN is also littler than ID number of own DMBS, so, it also sends an election request elect-request message to this MN, when receiving that elect-ack message is replied in election, it just upgrades its ownDMBS variable, then, it sends a leave-oldDMBS message of leaving old DMES also will for the DMBS before it, after its old DMBS received this leave-oldDMBS message, it was just left out the MN that sends this message from its MN tabulation.
1) honeycomb generation method
In order to improve the performance of whole network, the selection of mobile base station is very important.The route that we know last calculating always mobile base station and boundary node alternately occurs, so the selection of mobile base station influences the service quality of entire path.Use mobile base station that minimum ID selection algorithm chooses just according to the ID of node standard alternatively, and do not consider the bandwidth, power supply etc. of mobile base station.Our technology is improved this.New ID be not select at random or only be the IP of node.New ID has considered the priority that is selected as the mobile base station of node: willing.
Willing has defined the priority that node is selected as the mobile base station, if the priority of node is high more: the bandwidth height, computing capability is strong, and electric weight is more sufficient, etc.; Willing is more little so.Therefore, the mobile base station that present minimum ID selection algorithm is chosen is the highest node of priority always, thereby optimal node is chosen as the mobile base station in neighbor node.
2) processing method of routing message
The general format of DDCC message
| Packet Length | packet sequence number | |
| Message type | message size | |
| TTL | Hop count | Message sequence number |
| Message data | ||
| Other Message | ||
Hello message
Each node in the network is periodically broadcasted hello message.By ID number of hello message to its neighbor node broadcast node, the state of node: mobile base station, general node, boundary node.Node also will be announced the mobile base station DMBS of the mobile cellular at other its places of node by hello message, and the DMBS of other honeycomb that can arrive by this node.Like this.The DMBS of node just can know coupled DMBS node after receiving this hello message, and by which node forwarding can arrive these DMBS as boundary node.According to these message, thereby can generate its Link State Packet.
Its Message type is HELLO_TYPE for Hello message, so because the TTL (Time to live) that hello message does not need to transmit in its message data is 1.(change as neighbours, perhaps its DMBS changes) its Message Sequence number increases progressively when the connection status of node changes.For Hello message, so effect is not little because he does not need the forwarding message SN.
The message data of Hello message partly comprises following content: produce the ID (comprising willing priority and IP address) of the node of hello message, the mobile base station DMBS of its place mobile cellular.And the DMBS node listing of other honeycombs that can arrive as boundary node by this node.
| Willing | originate IP | ||
| OwnDMBS | |||
| DMBS_NUM | Neighbor_NUM | ||
| DMBS1 | weight | ||
| DMBS2 | Weight | ||
| ... | |||
| Neighbor 1 | |||
| Neighbor 2 | |||
| ... | |||
Wherein willing represents that node is selected as the priority of mobile base station DMBS, and bandwidth and other resources of this and node are relevant.The ID of Willing and originate ip configuration node so as the little ID node of the amount of choosing as the mobile base station.Own DMBS is the mobile base station of node originate ip.Can arrive other mobile cellular as the border forward node so which node is neighbours' cellular node know by by the node of broadcasting its other mobile cellulars of DMBS to neighbours.Weight is used for identifying the Link State between the DMBS of originate ip node and other mobile cellular, as bandwidth or time-delay etc.Our usefulness is jumping figure between them now.The DMBS node of Originate ip and other honeycomb might not be the neighbours that directly link to each other.
In the network of being made up of three mobile cellulars as shown in Figure 1, their mobile base station is respectively B1, B2, B3.The mobile cellular at B2 and two places of B3 has overlapping.We suppose that the N3 node belongs to the mobile cellular at B2 place, and N3 directly links to each other with B2 and B3 so, and the hello message B2 by N3 knows by N3 can arrive B3.Each data field of hello message of N3 is as follows: originate ip is N3, and own DMBS is B2; The cellular basestation situation that reaches that also comprises in the hello message is: DMBS B3, weight1 (expression N3 directly links to each other with B3).
The hello message of node N3:
originate ip：N3
0wn DMBS：B2
DMBS:B3, Weight:1//expression node N3 directly links to each other with B3
Neighbors：…
As can be seen from the figure node N2 only in the mobile cellular scope of B2 place, has only B2 with the mobile base station that N2 directly links to each other.But cellular basestation B2 will with the node in the honeycomb B1 interconnected just must by with the forwarding of node N2.Therefore here node N2 belongs to the border forward node, though he is only in a honeycomb atmosphere.Node N1 also is a boundary node as a same reason.
The hello message packet of node N2 is as follows:
originate ip：N2；
Own DMBS：B2
DMBS:B1 has double bounce between Weight:2//expression N2 and the B1
The hello message packet of node N1 is as follows:
originate ip：N1
Own DMBS：B1
DMBS：B2，Weight：2
The hello message of general node and mobile base station node itself is fairly simple, and is as follows as the hello message of base-station node B2:
originate ip：B2；
Own DMBS:B2//expression node itself is the base station
Base-station node is not that therefore boundary node does not have to the situation of the DMBS of other mobile cellular, and hello message is fairly simple.
Node is to the processing method of hello message:
Some data structures below each node is preserved: the neighbor node table, the mobile cellular table links to each other.
Neighbor table comprises following content: neighbor, neighbor_state, live_time
The connected node of neighbor record node, neighbor_stat is the Link State of node and neighbor node: one way link or two-way link.Live_time is the life cycle of neighbor entry for this reason, if life cycle expired this neighbor entry will be deleted.
Continuous mobile cellular table: Neighbor_DMBS, Gate, weight, live_time.
Wherein Neighbor_DMBS represents the mobile base station node of the continuous honeycomb that node can arrive, node can directly link to each other with base-station node Neighbor_DMBS (one jump neighbours) transmit the base station that arrives by a node in the honeycomb at Neighbor_DMBS place, so also may be that a boundary node by this honeycomb arrives Neighbor_DMES if this node is the mobile base station.Gate record node arrives the approach of Neighbor_DMBS, and Gate is exactly himself if node directly links to each other so with Neighbor_DMBS, otherwise is exactly a boundary node that can arrive him.As above shown in Figure 3: node N1 can connect the base station B2 of the honeycomb that links to each other by the boundary node N2 of honeycomb B2.Node N3 can directly link to each other with the mobile cellular B3 that links to each other by own.Node B 1 then will could be visited the base station B2 node that links to each other by the node N1 of own honeycomb and the boundary node N2 of honeycomb B2.Weight record node is to the Link State of this DMBS, and we use now is jumping figure between them.Live_time is used for life cycle of identification record list item.
The continuous honeycomb table of some nodes is as follows among Fig. 3:
Node B 1: node N1:
Neighbor_DMBS：B2 Neighbor_DMBS：B2
Gate：N1 Gate：N2
Weight：3 Weight：2
Time_liye：…
Node B 2: node N3:
Neighbor_DMBS：B1 Neighbor_DMBS：B3
Gate:N2 Gate:N3//oneself
Weight：3 Weight：1
...
-------------Node B 3:
Neighbor_DMBS：B2
Gate：N3
Weight：2
Neighbor_DMBS：B3
Gate：N3
Weight：2
The processing procedure of Hello message: after node is received hello message.
If the node of broadcasting hello message generates new neighbor entry so not in the neighbor list of this node, if this node in the neighbours of hello message, then state is two-way neighbours in the record of neighbor entry, otherwise is unidirectional neighbours; Live_time=current_time+NEIGHBOR_HOLD_TIME.If write down this node in the neighbor entry of node, according to the neighbours that write down in the hello message more the new neighbor Link State upgrade live_Time simultaneously.
Key for the hello Message Processing is the renewal of continuous honeycomb table.
1) receive hello message after, if the node of broadcasting hello message all is to belong to same mobile cellular with this node: the Own DMBS in the hello message and the Own DMBS of node be identical and this node be not the DMBS node so node do not need to upgrade its base station table that links to each other.
2) be exactly the mobile base station if broadcast the node of this hello message itself: what Own DMBS in the hello message and Originate ip identified is same node, can obtain so continuous honeycomb list item so: neighbor_DMBS=hello::originate id, Gate=hello::originate id, weight=1.More there is not the list item of this neighbor_DMBS node in the present continuous mobile base station table of new node in the table of mobile base station if node links to each other, during list item adding that so directly will be new is shown, corresponding life cycle of parameter is set.Had corresponding list item if link to each other in the table of mobile base station, but Gate is not the node of hello message, delete this list item so and insert new list item (because new list item make the node and the mobile base station that links to each other jumping figure still less).
3) if the hello node is not the mobile base station, but he belongs to another mobile cellular.Just the own DMBS of own DMBS in the hello message and node is different, and the forwarding of the node that node can be by broadcasting hello message connects its DMBS.Generate new list item: neighbor_DMBS=hello::own DMBS, Gate=hello::originate id, weight=2.According to the new entry updating base station table that links to each other: if there is no insert new list item so, if exist the list item of this DMBS node and weight＜2 to abandon new list item so in the table: if the weight of new list item and old list item all be the willing of Gate of 2 list items that so relatively if the willing value of the Gate of two list items is new less than just willing (just new Gate node bandwidth etc. are better) so with new list item replacement replacement, if the Gate of two list items is identical, upgrade the live_time of list item so.
4) node itself of receiving hello message is exactly the mobile base station: if the honeycomb that the node of hello message belongs to him so, make up new list item: neighbor_DMBS=hello::DMBS for each the continuous DMBS in the hello message after receiving hello message, Gate=hello::originate id, weight=hello::DMBS::weight+1.If there has been the list item of this DMBS in the table, if the weight of new list item less than the jumping figure in the just new path of the weight of record in the table still less, so with the new old list item of list item replacement.If weight is identical and the also identical live_time identical Gate difference of weight their willing so relatively else if that upgrades so of Gate node.If the Gate node willing of new list item is less than the willing of node in the table then with new list item replacement list item just.Otherwise abandon new list item.If the node of hello message belongs to another honeycomb according to 3) handle this hello message.
It more than is the process that the hello Message Processing is upgraded the neighbor table and the DMBS table that links to each other.
The hello message of the periodic broadcasting of each node constitutes with the DMBS table that links to each other according to its neighbor table, what pay special attention to is, if node itself is the record that the DMBS node does not need its continuous DMBS that can arrive so in its hello message, he just need comprise the DMBS situation that links to each other when having only node to be boundary node in its hello message.
According to the DMBS table that links to each other of neighbor table and collection, the mobile base station node DMBS of each mobile cellular needs to its honeycomb state of Web broadcast and continuous DMBS node state.
The generation and the processing of topology control message (TC):
Our mobile cellular algorithm also is that a kind of link-state list drives Routing Protocol.Each cellular basestation node DMBS in the network periodically broadcasts its Link State, and the node that need transmit is transmitted this message and calculated routing table according to the topology of network after receiving message.The link topological message of base station broadcast comprises the continuous DMBS node set of node (perhaps neighbor node) of two aspect honeycombs.
| Originate DMBS | ||
| Neighbor_NUM | DMBS_NUM | |
| Neiohhor 1 | ||
| Neighbor 2 | ||
| ... | ||
| DMBS 1 | hop | |
| DMBS 2 | hop | |
| ... | ||
Originate DMBS is the address of node (mobile base station) in the T ℃ of message, and neighbor_MUM is the neighbours' of base-station node a number, and DMBS_NUM is the number of the continuous DMBS of node.Neighbor1, Neighbor2 ... write down neighbours' (latter is the node of honeycomb) of node respectively, DMBS1, DMBS2 ... write down the DMBS node that node links to each other respectively.Base-station node obtains these contents according to the content of the two-way neighbours in its neighbor table, fills the DMBS content according to the content of the DMBS table that links to each other.General node does not need to produce the TC message, does not need to transmit T ℃ of message yet, thereby has reduced the extra bandwidth load of agreement.
In order to prevent the winding forwarding of TC message on network, the forward node on the network needs the TC message that data structure records has been transmitted.We use duplicate to show to prevent the generation of non-return ring.The Duplicate table comprises following content: Dest_DMBS, sequence, live_time.
If node receives that node is that forward node (node is that DMBS node or boundary node one can judge that according to its continuous DMBS table he is a boundary node) is searched the duplicate table behind the TC message:
1) if there is no this list item writes down this list item, Dest_DMBS=TC::originate_DMBS, sequence=TC::message_suquence, live_time=current+DUPLICATE_HOLD_TIME so;
2) if there is the list item of this DMBS in the duplicate table.If:
A) sequence of the list item of duplicate record 〉=TC::message_sequence abandons this TC message so.
B) sequence＜TC::message_sequence of the list item of duplicate record upgrades this list item so: sequence=TC::message_sequence in the new list item, live_time=current+DUPLICATE_HOLD_TIME.Then this message is done corresponding processing and transmitted this message.
Node is to the processing of TC message
Node need use a topo_table table for the topological message that writes down the TC message of receiving, topo_table comprises following content dest, last_gate, hops, live_time.
For each neighbor node in the TC message: dest=TC::neighbor, last_gate=TC::originate_DMBS, hops=1.Such (dest, list item last_gate) write down this list item, live_time=current+TOPO_HOLD_TIME so if do not exist among the topo_table; If existed such list item to upgrade content corresponding (hops and time) so.
For each the continuous DMBS::dest=TC::DMBSi that writes down in the TC message, last_gate=TC::originate_DMBS, hops=TC::hopi.(dest, last_gate) topological list item upgrades content corresponding so accordingly if existed among the topo_table.Otherwise increase this list item in topo_table.
Fig. 2 is an example of the Link State of topology table record, and wherein red line is the mobile base station of writing down in the topology table and the link between the base station, and the black line is the link between mobile base station and its neighbours.The connection that dots among the figure between the boundary node is that local (boundary node is recorded in its neighbor table) forward node can calculate routing table according to these overall topology informations and the neighbor table of itself with the DMBS table that links to each other.
The calculating of routing table:
1. if node is that the routing table of node is the simplest so for general node (be not DMBS node neither boundary node), node at first adds routing table (dest=neighbor according to neighbor table, gate=neighbor), add then route table items (dest=any, gate=Own_DMBS).The not responsible route of just general node, it needs destination node is not that message that neighbours' need are transmitted is all given its mobile base station node and transmitted.
2. if node is the minimum route of calculating use Dijstra algorithm computation jumping figure of its routing table of forward node (DMBS or boundary node):
Add neighbours' routing table (dest=neighbor then to according to the neighbor table of record, gateway=neighbor, hop=1), add the route (dest=neighbor_DMBS of continuous DMBS node then to according to each list item in the DMBS table that links to each other, gateway=Gate, hop=weight).
Calculate the route of other nodes in the network according to the content among the topology table topo_table.For each route table items that has calculated, in the topo table, search the list item of topo::last_gatej=route::desti according to the route::desti of list item, if the topo::desti of corresponding list item does not add list item (topo::destj so in routing table, route::gatewayi, route::hopi+topo::hopj,), if if existed the hop number of so new list item to use new replacement so, otherwise insert new route table items less than the list item that has existed.So process above repeating is all accessed mistake of list item in the topo table.
Six, method is implemented and performance test
We realize and have tested this route technology respectively on windows 2000 operating systems and NS2 network simulation platform.
1) Windows is 2000 times
Test environment:
The notebook of eight windows 2000 operating system band 11Mbps PCMCIA wireless network cards is as eight portable terminals.
Test result:
Satisfy the dynamic requirement of mobile self-grouping network,, still can show good routing performance even change when very fast in network topology structure.
2) under the NS2:
Test is carried out 4 groups altogether.Each group comprises 3 tests, and AODV, the DODV of QoS, the packet transfer rate performance of DDCC Routing Protocol are supported in checking respectively.
In every group of test, the initial position of the initial position of all nodes all is at random, generates 33 udp then and connects.Each connects the bandwidth resources of all having applied for 25kbps, and brings into use the connection of building up to send data in certain moment, and transmission rate is 20kbps.All nodes move at random.
The result of 4 groups of tests is shown in Fig. 3-6:
Among Fig. 3-6, what abscissa was represented is the time, and what ordinate was represented is the average packet loss ratio of all connections.
Because the position of node at random, and node is with the random velocity fast moving below the 20m/s, so switch frequently, the report lost rate is bigger.But we still can be used for the performance of comparison AODV, DSDV, DDCC agreement.
(1) for the AODV agreement, the packet loss of 4 groups of tests is respectively: 0.303,0.249,0.314,0.169, and mean value is 0.259;
(2) for the DSDV agreement, the packet loss of 4 groups of tests is respectively: 0.250,0.220,0.158,0.126, and mean value is 0.189:
(3) for the DDCC agreement, the packet loss of 4 groups of tests is respectively: 0.144,0.210,0.111,0.143, and mean value is 0.152;
Packet transfer rate when using the DDCC agreement will be apparently higher than the situation of using AODV agreement or DSDV agreement.
Claims (4)
1, a kind of construction method of distributed dynamic cellular route of mobile self-grouping network is characterized in that the step that makes up is:
1. adopt the method that sends and accept " hello " message, dynamically find and the renewal neighbor node;
2. according to some mobile node MN of the policy selection of the consistency principle and prioritization as dynamic mobile base station DMBS;
3. produce, send, accept, handle the internet message message by the mobile base station, and generate route table items;
Dynamically select an above mobile node MN and serve as interim mobile base station DMBS from network, each DMBS only manages the MN of all and its direct neighbor, has the topology information of whole network between the DMBS by exchange message; If a MN wants to send data, it just sends to packet the DMBS of own place honeycomb, and packet only carries out routing forwarding between DMBS or border mobile node BMN, finally arrive purpose DMBS, by purpose DMBS packet is sent to purpose MN.
2, the construction method of the distributed dynamic cellular route of mobile self-grouping network as claimed in claim 1 is characterized in that: the generation method of described honeycomb is: an above MN elects a MN with limit priority as their DMBS of management; Comprise its ID number in cycle in the hello message bag that MN sent in its and tell ID number of other MN oneself with this; If MNi find own ID than ID number of another MNj greatly, so, MNi just sends an elect-request message to MNj; MNj sends to MNi as replying with elect-ack message, and the ownDMBS variable is set to 0 simultaneously; After MNi received elect-ack message, just the ownDMBS variable was set to ID number of MNj; If the ID that MN is known another one MN is also littler than ID number of own DMBS, so, it also sends an election request elect-request message to this MN, when receiving that elect-ack message is replied in election, it just upgrades its ownDMBS variable, then, it sends a leave-oldDMBS message of leaving old DMBS also will for the DMBS before it, after its old DMBS received this leave-oldDMBS message, it was just left out the MN that sends this message from its MN tabulation.
3, the construction method of the distributed dynamic cellular route of mobile self-grouping network as claimed in claim 1, it is characterized in that: the processing method of routing message is: each node in the network is periodically broadcasted hello message, by ID from hello message to its neighbor node broadcast node number, the state of node; Node also will be announced the mobile base station DMBS of the mobile cellular at other its places of node by hello message, and the DMBS of other honeycomb that can arrive by this node; Like this, the DMBS of node just can know coupled DMBS node after receiving this hello message, and by which node forwarding can arrive these DMBS as boundary node, according to these message, thereby can generate its Link State Packet.
4, the construction method of the distributed dynamic cellular route of mobile self-grouping network as claimed in claim 1, it is characterized in that: the generation and the processing method of topology control message are: each the cellular basestation node DMBS in the network periodically broadcasts its Link State, and the node that need transmit is transmitted this message and calculated routing table according to the topology of network after receiving message; The link of base station broadcast topology control message comprises the DMBS node set that has linked to each other between the node of two aspect honeycombs or the neighbor node; Base-station node obtains these contents according to the content of the two-way neighbours in its neighbor table, fills the DMBS content according to the content of the DMBS table that links to each other; General node does not need to produce topology control message, does not need forwarding topology control message yet, thereby has reduced the extra bandwidth load.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2004100649780A CN1761231A (en) | 2004-10-15 | 2004-10-15 | The construction method of the distributed dynamic cellular route of mobile self-grouping network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2004100649780A CN1761231A (en) | 2004-10-15 | 2004-10-15 | The construction method of the distributed dynamic cellular route of mobile self-grouping network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN1761231A true CN1761231A (en) | 2006-04-19 |
Family
ID=36707179
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNA2004100649780A Pending CN1761231A (en) | 2004-10-15 | 2004-10-15 | The construction method of the distributed dynamic cellular route of mobile self-grouping network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1761231A (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2010022620A1 (en) * | 2008-08-29 | 2010-03-04 | 中兴通讯股份有限公司 | Broadcasting method for mobile ad hoc network |
| CN1933618B (en) * | 2006-10-24 | 2010-04-21 | 上海华为技术有限公司 | Trunk communication system based on single base station, group and calling communicating method |
| CN101958840A (en) * | 2010-10-18 | 2011-01-26 | 中兴通讯股份有限公司 | Method and device for creating message table entry as well as method and device for forwarding multicast data stream |
| CN102036425A (en) * | 2009-09-27 | 2011-04-27 | 华为技术有限公司 | Wireless mesh network communication method and equipment based on border gateway |
| CN102625402A (en) * | 2012-03-01 | 2012-08-01 | 昆明理工大学 | Method for discovering and selecting path of mobile Ad-Hoc network |
| CN101589641B (en) * | 2007-01-25 | 2012-09-05 | 思科技术公司 | Building communities of interest and selecting borders between them based on relative motion |
| CN106231633A (en) * | 2016-10-10 | 2016-12-14 | 广东工业大学 | A kind of Ad hoc communication network optimization method and system |
-
2004
- 2004-10-15 CN CNA2004100649780A patent/CN1761231A/en active Pending
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1933618B (en) * | 2006-10-24 | 2010-04-21 | 上海华为技术有限公司 | Trunk communication system based on single base station, group and calling communicating method |
| CN101589641B (en) * | 2007-01-25 | 2012-09-05 | 思科技术公司 | Building communities of interest and selecting borders between them based on relative motion |
| WO2010022620A1 (en) * | 2008-08-29 | 2010-03-04 | 中兴通讯股份有限公司 | Broadcasting method for mobile ad hoc network |
| CN101662374B (en) * | 2008-08-29 | 2012-09-05 | 中兴通讯股份有限公司 | Broadcasting method for mobile ad hoc network |
| CN102036425A (en) * | 2009-09-27 | 2011-04-27 | 华为技术有限公司 | Wireless mesh network communication method and equipment based on border gateway |
| CN102036425B (en) * | 2009-09-27 | 2014-11-05 | 华为技术有限公司 | Wireless mesh network communication method and equipment based on border gateway |
| CN101958840A (en) * | 2010-10-18 | 2011-01-26 | 中兴通讯股份有限公司 | Method and device for creating message table entry as well as method and device for forwarding multicast data stream |
| CN101958840B (en) * | 2010-10-18 | 2014-09-10 | 中兴通讯股份有限公司 | Method and device for creating message table entry as well as method and device for forwarding multicast data stream |
| CN102625402A (en) * | 2012-03-01 | 2012-08-01 | 昆明理工大学 | Method for discovering and selecting path of mobile Ad-Hoc network |
| CN106231633A (en) * | 2016-10-10 | 2016-12-14 | 广东工业大学 | A kind of Ad hoc communication network optimization method and system |
| CN106231633B (en) * | 2016-10-10 | 2019-12-06 | 广东工业大学 | Ad hoc communication network optimization method and system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Ruiz et al. | Survey on broadcast algorithms for mobile ad hoc networks | |
| CN1886942A (en) | Method and system for routing traffic in AD HOC networks | |
| CN1926820A (en) | Method, communication device and system for checking neighbor node using NDP in wireless multi-hop network | |
| CN1886941A (en) | Predictive AD-HOC | |
| CN1906898A (en) | Method and system for efficient routing in ad hoc networks | |
| CN100341351C (en) | Mobile mesh AD-HOC networking | |
| CN1453963A (en) | Method of bluetooth routing according to request and network formation and communication method of bluetooth group network | |
| CN1607783A (en) | Processing broadcast data in a mobile ac-hoc network | |
| KR100703780B1 (en) | Method and apparatus for supporting consistency of routing table's data in wireless network | |
| Khabbazian et al. | Local broadcast algorithms in wireless ad hoc networks: Reducing the number of transmissions | |
| CN1650573A (en) | Determining quality of service (QoS) routing for mobile ad hoc networks | |
| CN1650285A (en) | Admission control in a mobile ad hoc network | |
| CN101068203A (en) | Cluster self-organizing routing method and device | |
| CN1700668A (en) | Process for generating and updating a hierarchical tree in a manet multicast routing protocol ad hoc network | |
| CN1650650A (en) | Allocating channels in a mobile ad hoc network | |
| CN1650578A (en) | Traffic policing in a mobile ad hoc network | |
| CN1483266A (en) | Multicast route in AD-HOC network | |
| CN1650283A (en) | Tracking traffic in a mobile ad hoc network | |
| CN101048012A (en) | Method for deciding route at radio mesh network | |
| CN101356771A (en) | Radio communication device and self-organization routing route information acquiring method | |
| CN1435027A (en) | Mobile IP for mobile hoc networks | |
| CN1852194A (en) | System and method for renewing network mobile node position in wireless net-like network | |
| CN1645863A (en) | Ad Hoc network functional layer structure and route method for supporting multi-speed rate transmission | |
| CN101031153A (en) | Mobile communication terminal and route selection method | |
| CN1852256A (en) | Method and system for data transmission in wireless net-like network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |