CN100596113C - Mobile node seamless switch over method in mixed mobile self-organizing network - Google Patents
Mobile node seamless switch over method in mixed mobile self-organizing network Download PDFInfo
- Publication number
- CN100596113C CN100596113C CN200710120595A CN200710120595A CN100596113C CN 100596113 C CN100596113 C CN 100596113C CN 200710120595 A CN200710120595 A CN 200710120595A CN 200710120595 A CN200710120595 A CN 200710120595A CN 100596113 C CN100596113 C CN 100596113C
- Authority
- CN
- China
- Prior art keywords
- associated nodes
- mobile node
- state
- nodes
- node
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention relates to the seamless switch technology of the mobile node route in hybrid network; the present invention mainly solves the problem that the data message can be transmitted tothe object node in a reliable and real-time way when the mobile nodes in the combined network of the radio ad hoc network and the cable network connect the multihop linkable nodes and change. The present invention comprises that: 1) The mobile node obtains the information of the peripheral multihop linkable nodes and confirms the abuttal state with the linkable nodes, and then maintains and describes the state unit doublet of the abuttal relationship with the linkable nodes; 2) The mobile node confirms whether switch preparation is needed according to the present state and the state after theswitch, and implements communication coordination with every linkable node; 3) In the process of implementing communication switch, the switch report is emitted to the original link nodes and the original link nodes transmit the report message according to the early switch preparation after receiving the report and emit the redirection information.
Description
Technical field
The present invention relates to a kind ofly in large-scale network environment, guarantee the reliable in real time method of transmitting with data integrity of communication when but handoff association concerns between the difference associated nodes when mobile node, belong to computer mixed mobile self-organizing network route technology field.
Background technology
In mobile ad-hoc network, communicate by multi-hop, self-organizing ways of connecting between the mobile node, there is not fixedly to serve as the node of infrastructure in the network, all nodes are that main frame has the function of router simultaneously again.If it is auxiliary with infrastructure networks such as wired network, satellite networks, node in the mobile ad-hoc network not only can the access infrastructure network, and can carry out communication between the mobile node by infrastructure network, thus improve the throughput of communication, reduce communication delay etc.Only need set up the mapping incidence relation of each mobile node, can transmit communication message between the mobile node by infrastructure network to " associated nodes " of certain or certain several access infrastructure networks.The characteristics of wireless network are that node can move freely, therefore, above-mentioned mapping incidence relation can change because of moving of node, in the process that the mapping incidence relation changes, just might interrupt ongoing communication or produce losing of transmission data like this.
Summary of the invention
The purpose of this invention is to provide a kind of mobile node directly link to each other with it or " associated nodes " that multi-hop links to each other between the method for seamless switching so that make the user in transition process, can not feel pause, can communicate by letter with switching node glibly.
For finishing purpose of the present invention, the technical scheme that the present invention takes is: utilize the method subsidiary communications of state transformation to switch, and in the information of specific state-maintenance necessity, communicate the necessary preparation of switching, it is as follows to comprise step:
1) but mobile node obtains the information of the associated nodes around it, but determine itself and the state of associated nodes adjacency, but and safeguard state two tuples of describing with the associated nodes syntople;
2) mobile node confirms whether to need to switch preparation according to current state with the state after will switching, but and communicate coordination with each associated nodes;
3) mobile node communicates switching when state changes, and sends the switching announcement to former current associated nodes, according to the switching preparation in early stage, transmits communication message after former current associated nodes is received and announced, the transmission redirect message.
The invention has the beneficial effects as follows: (1) but owing to consider mobile node in advance with the state relation between the associated nodes on every side and carry out necessary state exchange, therefore make the handoff procedure smooth transition, whole process can be to communication generation considerable influence; (2) because of the copy of current associated nodes, so can guarantee that datagram is not lost in the handoff procedure to alternative associated nodes forwarding datagram; (3) since mobile node in the process that incidence relation switches, its IP address does not change, network does not connect and interrupts, and only switches the incidence relation with associated nodes, thereby the influence that the communication between source end and the destination is produced is less.
Description of drawings:
Fig. 1 is application scenarios of the present invention and schematic diagram;
Fig. 2 is the application scenarios figure of state exchange;
Fig. 3 is the state transition graph of handoff procedure;
Fig. 4 is that state switches auxiliary seamless switching flow process.
Embodiment:
Mention the node of associated nodes, these two kinds of different role of mobile node herein, and the notion of infrastructure network, at first its implication is made an explanation below." mobile node " is common wireless network node, and its feature is by the Radio Link mutual communication and can moves freely." infrastructure network " refers to the network that existing wired network, satellite network, GPRS network etc. communicate by InterWorking Equipments such as communication base station, satellite, routers." associated nodes " is the boundary node that mobile ad-hoc network is linked into infrastructure network, its feature is to have two kinds of different network communication interfaces, the one, have the radio network interface that can communicate by letter with other wireless communication nodes by Radio Link, the 2nd, can be linked into the network interface in the infrastructure network, for example can be linked in the cable LAN by netting twine, it is medium that link is linked into satellite network via satellite.
Because mobile node is in moving process, syntople and incidence relation between it and the associated nodes can change, thereby cause the variation of this mobile node route, therefore need to solve the problem that this variation brings, i.e. " incidence relation of node between different associated nodes rebuild ", require zero defect, real-time reconstruction route, guarantee network application integrality, real-time requirement.Shown in the schematic diagram of Fig. 1, mobile node is moved in the signal coverage areas of associated nodes B through overlap-add region by the signal coverage areas of associated nodes A, mobile node needs the handoff association relation, and data integrity, the real-time requirement for guaranteeing transmitting simultaneously, the A node will send redirect message to transmitting terminal, and the B node then will send the mapping table updating message.In handoff procedure, the A node need duplicate the message of receiving that sends to mobile node M, is transmitted to the B node by infrastructure network again.
The present invention uses following three kinds of state symbols to represent mobile node in the network and the incidence relation between the associated nodes: represent that with D mobile node and associated nodes are by Radio Link directly link to each other (Direct Link), represent that with M mobile node links to each other (Multiple Hop Link) by the wireless multi-hop link with associated nodes, be limited to MaxHop on the jumping figure of restriction connection herein; Ф represents that mobile node and associated nodes can not link to each other or Radio Link surpasses jumping figure upper limit MaxHop by Radio Link.In the process that the mobile node incidence relation switches, consider it and the syntople between two associated nodes on every side, all possible syntople is seen shown in Figure 2, the jumping figure upper limit Maxhop of diagram use is 2.
Node adjacency among Fig. 2 relation is carried out abstract, obtain as shown in Figure 3 each mobile node and the syntople state between adjacent two associated nodes to two tuples.Wherein first data item of two tuples is represented the syntople between mobile node and the current associated nodes, does not therefore comprise inaccessible state Ф; Second data item is represented the syntople of mobile node and current alternative associated nodes.This syntople state is called the state transition table of mobile node to two tuples, and each mobile node need be safeguarded its state transition table.Identified all possible state exchange relation among the figure, along with moving of mobile node, the state relation that mobile node is safeguarded can carry out conversion according to the sign of diagram arrow.Transition arrow among the figure has indicated all possible state to transformational relation, the arrow that indicates pre is illustrated in state transformation needs preliminary treatment to prepare before, the state transformation that indicates no then needs to seek again alternative " associated nodes ", unless there is not alternative node; The state transformation that does not indicate symbol only need get final product to the associated nodes advertised states variation of oneself.Mobile node comes the possible handoff procedure of preliminary treatment by the maintenance state conversion table.
In a specific handoff scenario, there is the node of four kinds of different role: wait for the mobile node M that communication is switched; The current associated nodes A related with node M; The alternative associated nodes B that node M may switch to; And the peer node S of communication.
Following mask body is set forth the communication handoff procedure, specifically is divided into following committed step:
1) at first be " connection status " and " incidence relation " between mobile node and the adjacent associated nodes announcement with obtain.
The obtain manner of " connection status " is that mobile node passes through the wireless network Routing Protocol and obtains routing iinformation within the limited jumping figure (MaxHop), the neighbours' associated nodes that outwards sends to mobile node that the routing iinformation of being safeguarded is timed, make the mobile node in the network can obtain associated nodes information on every side, simultaneously associated nodes is obtained the information of the mobile node related with it by the timing announcement of the mobile node " incidence relation " received.
In the process that " connection status " obtained, mobile node may exist a plurality of " associated nodes " as neighbours, for this reason, to it according to connecting the laggard line ordering of jumping figure and discovery order weighting, wherein connect the number that jumping figure refers to the intermediate node of the communication path process from the mobile node to the associated nodes, discovery is meant that in proper order mobile node finds the sequencing of each " associated nodes ", the weighting ordering promptly is to above two information, according to its criticality, give the different relative importance values that influence rank (as accounting for 20% and 80% influence degree respectively) compute associations node, a possible computing formula is:
Relative importance value=100-(serial number of discovery * 80%+ connects jumping figure * 20%)
In ranking results, select the associated nodes of the highest associated nodes of relative importance value, and second as alternative associated nodes as its connection.
Its incidence relation of outside announcement that mobile node is regular is described two tuples of this mobile node to above-mentioned two associated nodes " connection status ", is maintained in the state transition table of this mobile node.This state transition table changes according to the syntople variation of the mobile generation of this mobile node." connection status " and " incidence relation " of storage simultaneously and all associated nodes on every side.Wherein " connection status " has three kinds of D, M, Ф, relevant, alternative, not related three kinds of incidence relation.
The variation of information stores when the data form in the middle of Fig. 4 left side has shown mobile node generation " state variation ", when mobile node M discovery has syntople with Node B, give its associated nodes A with this information announcement, thereby the duplicate address of the mobile node M on the node A is changed to the ip address of Node B by empty (NULL), and Node B promptly stores to the information announcement as the alternative associated nodes of mobile node M node A.
2) secondly set forth the incidence relation switching preparation that state transition method and state exchange need.
Mobile node can be associated with associated nodes by multi-hop, therefore will safeguard all " associated nodes " connection state informations that can reach with it on mobile node M.Because current mobile node M is related with node A, so M and A can not be Ф at the current time state.Therefore, the conversion that possible initial condition is possible with it is represented that by transition diagram shown in Figure 3 state among the figure is to (x, y) represent state relation between node M and A, the B respectively, B promptly is the selected alternative associated nodes of M, when y is Ф, illustrates that M does not find alternative associated nodes.
By transition diagram shown in Figure 3 as can be seen, if can be transformed under certain state (Ф, D) or (Ф during M) situation, must switch communication in advance and carry out necessary preparation, otherwise mobile node might be communicated by letter with current associated nodes at any time.In this case, mobile node M must store to current associated nodes the alternative associated nodes information announcement in time of oneself, is equipped with incidence relation switching back and uses.
It must be noted that, for the mobile node that might occur and all " but associated nodes " all can't be directly or multi-hop situation about linking, there is not possibility to accomplish the seamless switching of communicating by letter in theory, but feasible solution is to increase infrastructure and associated nodes, and it can be joined in the hybrid network.
3) set forth duplicating forwarding and switching announcement of incidence relation handoff procedure, data message at last.
Switching notification packet has following several: the one, and mobile node M sends to former associated nodes A and informs and switch the announcement that takes place, and node M is with after B is related, and B also sends related the announcement to A; The 2nd, the A node sends the redirect message message to the opposite end of M communication node S, and announcement S node sends to B with message afterwards.Provide " transitional period " of a specified time in handoff procedure, all that arrive the A node this period send to the message of M, and A is transmitted to the B node according to announcement.May can not receive the situation of M node advertised information for the A node, A then decides the destination address of redirection message according to the incidence relation announcement of last M.In " transitional period ", the B node is issued new incidence relation message in infrastructure network, upgrades the incidence relation of mobile node M in network.
With Fig. 4 is example, and when " related change ", the former associated nodes A of node M receives that the association of M changes announcement or can't communicate by letter with M, then according to the alternative associated nodes B that has stored, is forwarded to B with the message of receiving that sends to M; New associated nodes B also sends harmony messages to former associated nodes A after receiving related information, requires the message of issuing M is transmitted, and announces the change of upgrading incidence relation simultaneously in network.Simultaneously, node A is redirected announcement to the node transmission information that all are being communicated by letter with M and information still is sent to oneself, notifies them to select new transmission destination.
Utilized the Routing Protocol of wireless self-organization network to obtain the information of multi-hop associated nodes in the above scheme, but saved the expense that repeats to safeguard associated nodes, simultaneously after communication is switched, incidence relation originally is replaced, but do not change the route that still exists, therefore, as long as routing iinformation still exists, former associated nodes still can directly E-Packet to mobile node.
Comprise following content by above-mentioned the inventive method as can be known:
Its connection state information, related information are announced and obtained to associated nodes in the network, mobile node by the limited Routing Protocol of the jumping figure of wireless network, connection state information comprises that mobile node is to the sign (D of all of its neighbor associated nodes in abutting connection with situation, M, Ф), related information comprises the associated nodes and the alternative associated nodes of each mobile node, and associated nodes will be preserved the adjacency state information of the mobile node that is associated with oneself, thereby judges related generation of switching.
When mobile node generation incidence relation switches, two kinds of possible situations are arranged, a kind of is that mobile node initiatively switches to alternative associated nodes, and as own new associated nodes, at this moment mobile node need be announced related the switching and give former associated nodes with former alternative associated nodes; Having is mobile node and former associated nodes state information to have taken place become unreachablely again, and this moment, former associated nodes can obtain this state variation by limited Routing Protocol.
In case switching has taken place incidence relation,, need do following work for guaranteeing the seamless switching of communication: the first, former associated nodes obtains the announcement that related information switches by the active announcement of state variation or mobile node; The second, it is the data message of this mobile node that former associated nodes is transmitted destination address to new associated nodes; The 3rd, former associated nodes sends redirected announcement to all opposite end communication nodes that switch mobile node communication, informs the switching of incidence relation, allows the opposite end communication node send data to new associated nodes; The 4th, the storage organization that new associated nodes is formed to all associated nodes at infrastructure network edge upgrades the switching of incidence relation, makes new incidence relation inquiry can obtain correct information.
The present invention can realize that the reason of seamless switching is: after switching generation, former associated nodes can be transmitted the message of receiving after switching of issuing mobile node to alternative associated nodes, make message can be delivered to destination node; Because handoff procedure occurs in physical location at a distance of between the nearer associated nodes, so above-mentioned repeating process is less through the time delay of infrastructure network; Notice message in handoff procedure can be as soon as possible with the node that needs to all of announcing that switches.Simultaneously because the existence of the multi-hop Routing Protocol of wireless multi-hop network itself, we can allow the maximum hop count of limited Routing Protocol bigger by 1 than the restriction jumping figure that incidence relation equals Ф in realization, take place even therefore switch, former associated nodes still can be sent to data to destination node by Radio Link.
The above only is a preferred implementation of the present invention; should be understood that; for those skilled in the art; under the prerequisite that does not break away from the extensive mixed mobile self-organizing network node communication of the present invention seamless handover method principle; can also make some improvements and modifications, these improvements and modifications also should be considered as the protection range of the inventive method.
Claims (3)
1. mobile node seamless switch over method in the mixed mobile self-organizing network is characterized in that comprising following steps:
1) but mobile node obtains the information of the associated nodes around it, but determine itself and the state of associated nodes adjacency, but and safeguard state two tuples of describing with the associated nodes syntople;
2) mobile node confirms whether to need to switch preparation according to current state with the state after will switching, but and communicate coordination with each associated nodes;
3) mobile node communicates switching when state changes, and sends the switching announcement to former current associated nodes, according to the switching preparation in early stage, transmits communication message after former current associated nodes is received and announced, the transmission redirect message;
Wherein:
Described step 1) further may further comprise the steps:
1.1) mobile node is by jumping figure wireless network with limited on-demand routing protocol, obtain the connection state information and the related information of the associated nodes that is adjacent, connection state information comprises mobile node to the sign of all of its neighbor associated nodes in abutting connection with situation, and related information comprises the current associated nodes and the alternative associated nodes of each mobile node;
1.2) mobile node selects two respectively as its current associated nodes and alternative associated nodes from the associated nodes that is adjacent, outwards announce its incidence relation termly;
1.3) mobile node describes two tuples of this mobile node to its current associated nodes and alternative associated nodes connection status, and be maintained in the state transition table of this mobile node, storage and the connection status and the incidence relation of all associated nodes simultaneously on every side, wherein, connection status have directly link to each other, wireless multi-hop links to each other and can not link to each other or the Radio Link that surpasses the jumping figure restriction links to each other three kinds relevant, alternative, not related three kinds of incidence relation by Radio Link;
In described step 2) in, if the state after mobile node switches is not to link to each other with its current associated nodes but when linking to each other with its alternative associated nodes, mobile node must oneself timely the announcement to current associated nodes of alternative associated nodes information be stored;
Described step 3) further may further comprise the steps:
3.1) mobile node announcement to former current associated nodes transmission switching generation in the state switching while;
3.2) mobile node is with after former alternative associated nodes is related, former alternative associated nodes sends related announcement to all associated nodes;
3.3) former current associated nodes sends the redirect message message to the opposite end of mobile node communication node, announce this communication node message is afterwards sent to former alternative associated nodes.
2. mobile node seamless switch over method in the mixed mobile self-organizing network according to claim 1 is characterized in that:
Provide the transitional period in the handoff procedure, during this period in, all messages that send to mobile node that former current associated nodes will be received are transmitted to former alternative associated nodes; Former current associated nodes then decides the destination address of redirection message for the situation that can not receive the mobile node advertised information according to the incidence relation announcement of last mobile node.
3. mobile node seamless switch over method in the mixed mobile self-organizing network according to claim 1 is characterized in that:
In described step 1.2) in, mobile node is to a plurality of associated nodes as its neighbours, according to connect jumping figure, the weighting of discovery order is sorted, and selects wherein first as its associated nodes, and second as alternative associated nodes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200710120595A CN100596113C (en) | 2007-08-21 | 2007-08-21 | Mobile node seamless switch over method in mixed mobile self-organizing network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200710120595A CN100596113C (en) | 2007-08-21 | 2007-08-21 | Mobile node seamless switch over method in mixed mobile self-organizing network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101175035A CN101175035A (en) | 2008-05-07 |
| CN100596113C true CN100596113C (en) | 2010-03-24 |
Family
ID=39423302
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200710120595A Expired - Fee Related CN100596113C (en) | 2007-08-21 | 2007-08-21 | Mobile node seamless switch over method in mixed mobile self-organizing network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100596113C (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101304345B (en) * | 2008-06-26 | 2010-09-29 | 北京邮电大学 | Interposition type measurement node for self-organization network and measurement method thereof |
| US7990943B2 (en) * | 2008-07-01 | 2011-08-02 | Telefonaktiebolaget Lm Ericsson | Establishing channels between a domain manager and managed nodes |
| CN101437270B (en) * | 2008-12-12 | 2011-08-10 | 华为技术有限公司 | Method, apparatus and communication system for switching between networks |
| CN101917748B (en) * | 2010-08-30 | 2012-10-03 | 中国科学技术大学 | Cooperative diversity technique-based seamless switching method |
| CN103338488B (en) | 2013-06-21 | 2016-03-09 | 华为技术有限公司 | Method for switching network, terminal, controller, gateway and system |
| CN104640156B (en) * | 2015-01-22 | 2018-03-09 | 北京大学 | A kind of data distribution formula acquisition and storage method based on wire and wireless hybrid network |
-
2007
- 2007-08-21 CN CN200710120595A patent/CN100596113C/en not_active Expired - Fee Related
Non-Patent Citations (2)
| Title |
|---|
| 无线移动自组织网中的切换管理策略. 郭洋，郭伟，田永春.第九届全国青年通信学术会议论文集 , 2004 年. 2004 |
| 无线移动自组织网中的切换管理策略. 郭洋，郭伟，田永春.第九届全国青年通信学术会议论文集，2004年. 2004 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101175035A (en) | 2008-05-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR100957920B1 (en) | System and method for utilizing multiple radios to increase the capacity of a wireless communication network | |
| US8165040B2 (en) | Method for routing mobile node in wireless mesh network and a communication system thereof | |
| EP2466964B1 (en) | Wireless Ad-hoc Network | |
| CN100428711C (en) | Method of bluetooth routing according to request and network formation and communication method of bluetooth group network | |
| CN100596113C (en) | Mobile node seamless switch over method in mixed mobile self-organizing network | |
| CN101184037B (en) | Probability effective broadcast coefficient based flooding method | |
| CN101883048A (en) | Routing method of multi-dimensional network | |
| US7280800B2 (en) | Wireless communication device, wireless communication system, wireless communication method and vehicle | |
| JP2004260262A (en) | Radio base station apparatus and inter-network interface apparatus | |
| CN104735743B (en) | The routing optimization method of embedded radio self-organizing network | |
| Anggoro et al. | Performance evaluation of AODV and AOMDV with probabilistic relay in VANET environments | |
| CN101262449B (en) | A new wireless self-networking dual-frequency hierarchical routing method | |
| Bashir et al. | An energy-efficient collaborative scheme for UAVs and VANETs for dissemination of real-time surveillance data on highways | |
| CN101431810A (en) | Cross-layer cooperated routing method supporting multi-speed transmission in Ad Hoc network | |
| Rais et al. | Towards truly heterogeneous internets: Bridging infrastructure-based and infrastructure-less networks | |
| CN102457930A (en) | Routing protocol for offshore centerless ad hoc network | |
| Zhimin et al. | Key technology and experimental research in wireless mesh networks | |
| CN101854641A (en) | Method for perceiving Mesh network route | |
| JP4767329B2 (en) | Network system and communication method | |
| CN110971514B (en) | Pilot frequency gateway equipment and data interaction method of pilot frequency network | |
| Gruber et al. | Ad hoc routing for cellular coverage extension | |
| Ramachandran et al. | Mobility adaptive cross layer design for reliable route discovery in ad-hoc networks | |
| Huang et al. | Zone-based hierarchical routing in two-tier backbone ad hoc networks | |
| Demir | Simulation of Ad Hoc Networks with DSR Protocol | |
| Chand et al. | Performance Comparison of Two On-Demands Routing Protocols for Mobile Ad-hoc Networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20100324 Termination date: 20130821 |