CN102006652A - Navigation path selection method with least switching times in wireless network - Google Patents
Navigation path selection method with least switching times in wireless network Download PDFInfo
- Publication number
- CN102006652A CN102006652A CN2010105310129A CN201010531012A CN102006652A CN 102006652 A CN102006652 A CN 102006652A CN 2010105310129 A CN2010105310129 A CN 2010105310129A CN 201010531012 A CN201010531012 A CN 201010531012A CN 102006652 A CN102006652 A CN 102006652A
- Authority
- CN
- China
- Prior art keywords
- point
- wireless network
- situation
- mobile node
- sequence
- 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 invention discloses a navigation path selection method with least switching times in a wireless network, comprising the following steps of: firstly, obtaining position information for a mobile node to pre-pass through each AP (Access Point) in an area; secondly, considering an end point D and a starting point S of the mobile node and deciding a continuous AP relating sequence with the least quantity according to the position information of the AP; and finally, selecting corresponding waypoint, thereby deciding the mobile path of the mobile node in the wireless network. By combining with navigation equipment and controlling a relating protocol on the bottom layer of a wireless communication protocol, the invention can realize the corresponding optimization algorithm; the concrete scheme is provided respectively aiming to the situations with overall information and local information; and the result shows that the method can be used for greatly reducing the switching times of the AP in the mobile process.
Description
Technical field
The present invention utilizes AP(Access Point, be wireless access points) mobile node is positioned, detect the translational speed and the moving direction of mobile node,, realized the minimum navigation path selecting method of switching times in a kind of wireless network by revising traditional IEEE 802.11 agreements.
Background technology
Present wireless local area network technology, as WiFi, WiMax etc., mobile node is by AP(Access Point, be wireless access points) the access the Internet, each node can only be connected with an AP simultaneously, and each AP has only limited coverage, and this just causes the user need switch when regional moving to another one AP from an AP zone.
Yet each traditional handoff protocol is all gone back imperfection now, when mobile node switches between AP, needs the long period to rebuild connection, and this can not satisfy the needs of real-time multimedia service and the requirement of QoS far away.
The present invention optimizes mobile handover mechanism from the another one angle.Promptly the mode by path planning reduces the number of times that moves switching.
Summary of the invention
Technical problem to be solved by this invention provides the minimum navigation path selecting method of switching times in a kind of wireless network, and this method can maximize the AP switching times that reduces in the moving process by rational path planning and connection control.
The minimum navigation path selecting method of switching times in the wireless network of the present invention, it may further comprise the steps:
1) obtaining of AP position: at first obtain the positional information that mobile node passes through AP in the zone in advance;
2) AP selects: by the terminal point D and the starting point S of consideration mobile node, and the continuable AP relating sequence of the positional information of AP decision minimum number;
3) selection of mobile route: after the relating sequence that has determined AP, select corresponding waypoint, thus the mobile route of decision mobile node in wireless network.
Above-mentioned steps 1) be divided into following two kinds of situations:
Situation 1: the wireless network data storehouse has the situation by all AP positional informations in the zone, then directly obtains the positional information of all A P;
Situation 2: the wireless network data storehouse does not have the situation by all AP positional informations in the zone, then try to find out current location wireless signal on every side by network inquiry, to obtain the MAC Address of AP on every side,, obtain the AP positional information again by the database lookup of Placelab.
Above-mentioned steps 2) in, for situation 1, its concrete steps are: make up navigation picture according to the AP positional information, the construction step of this navigation picture is: each AP becomes a point in the navigation picture, calculates all internodal distances; If distance between two points is less than 2 times communication radius then added a limit between 2 o'clock, weights are 1; If with the distance of starting point S or terminal point D less than 1 times of communication radius, then increase weights and be 0 point; Seek shortest path on the navigation picture that builds, the sequence that the point on the shortest path constitutes is exactly the continuable AP relating sequence of minimum number.
For situation 2, its concrete steps are: the information according to AP around the current location is chosen associated AP, and selection rule is, the corresponding waypoint of this associated AP, make mobile node in the projection of starting point S to this line of terminal point D near terminal point D; The also i.e. waypoint of this associated AP, be with line segment OD be that center of circle communication distance is the intersection point of the circle of radius with the O point, center O point that described line segment OD is an associated AP and the line between the terminal point D.
Above-mentioned steps 3) in, for situation 1, its concrete steps are: connect each AP according to shut sequence, the mid point of getting every line is waypoint, each waypoint that is linked in sequence, and the line sequence that obtains is mobile route.
For situation 2, its concrete steps are: mobile node moves to the waypoint of associated AP from current location, if terminal point D then directly moves to terminal point D in the communication radius coverage of associated AP; Otherwise get back to step 1), up to moving to terminal point D, mobile node the path of process be mobile route.
The present invention is by combining with navigator, and by controlling the associated protocol of home control network communication protocol bottom, realize corresponding optimized Algorithm, and at the situation that has global information and only have a local message concrete scheme has been proposed respectively, the result shows that this method has all significantly reduced the AP switching times in the moving process.
Fig. 3 has shown the experimental data that the method for our propositions is compared with existing method.Wherein, OptNAV and GreedyNAV are the air navigation aids that adopts us, the 802.11st, and the agreement that present WLAN (wireless local area network) is the most frequently used, LookAhead is the method that other articles propose.Ordinate is represented the number of times that AP switches.Show that from this map analysis the AP switching times of our method is far below 802.11 agreements at present commonly used, switching times has only its half.Equally, our method also is better than the LookAhead air navigation aid.
Description of drawings:
Fig. 1 is traditional 802.11 agreement handoff procedures,
Shown in Figure 2 is to select schematic diagram at the waypoint in the local AP information algorithm,
Shown in Figure 3 is the AP switching times contrast of several air navigation aids.
Embodiment:
For realizing purpose of the present invention, the invention provides two respectively at the flow process of different application scene, be elaborated below in conjunction with accompanying drawing.
The handoff procedure of traditional wireless communication protocol such as the most frequently used 802.11 agreements need pass through scan channel, authentication, heavy chain and connect three steps, and the channel number that wherein is scanned is the key of handover delay length.As shown in Figure 1, in 802.11 traditional agreements, mobile node need scan all channels, inefficiency.Present all working all can't be with handover delay stable being controlled at satisfy under the situation in the transparent tolerance of mobile interactive application, reduce the important means that switching times in the moving process has just become to realize seamless switching.
Handover optimization flow process of the present invention is at first obtained by the positional information of AP in the zone, again according to the AP sequence of related minimum number continuously in the AP positional information decision moving process, at last according to the mobile route of relating sequence decision optimum.
Two flow processs of the present invention all need the AP positional information.The acquisition methods of AP positional information, the mode of the main database Network Based of the present invention.Placelab has just provided the database of the corresponding informance of this MAC Address and physical address.
The specific aim design that two kinds of algorithms of the present invention carry out at the difference of obtaining restriction of AP positional information just.
At first be presented in the work of knowing by flow process under the situation of all AP positional informations of zone.
1) the AP positional information obtains.
2) make up navigation picture according to the AP positional information.The construction method of navigation picture is as follows:
A. each AP becomes a point among the figure, calculates all internodal distances.
If b. distance between two points is less than 2 times communication radius then added a limit between 2 o'clock, weights are 1.
If c. with the distance of starting point or terminal point less than 1 times of communication radius, then increase weights and be 0 point.
3) on the navigation picture that builds, seek shortest path, such as the operation dijkstra's algorithm.The sequence that point on the shortest path constitutes is exactly minimum handoff association sequence.
4) according to sequence that has determined and positional information decision motion track thereof.Determining method is as follows:
A. connect each AP according to shut sequence,
B. the mid point of getting every line is waypoint.Each waypoint is linked in sequence.The line sequence that obtains is mobile track.
So move and to arrive destination node from start node according to motion track that obtains and AP relating sequence.And switching times is optimum.
Yet, generally be the positional information that can't obtain all AP of bulk zone in the actual practice, even if can scope and precision also be difficult to control.Therefore we need the navigation and an association algorithm that can obtain the AP positional information that periphery can perceive at it.Method flow is as follows:
1) by the wireless signal (Beacon information) around trying to find out, to obtain the MAC Address of AP on every side.
2), obtain the positional information of AP by the Placelab database lookup.
3) information of AP is chosen related AP around the basis.Selection rule is as follows:
A. choose such AP: his corresponding waypoint can so that mobile device in the projection of starting point S to this line of terminal point D near terminal point D.
B. the waypoint of an AP as shown in Figure 2, AP the O point so waypoint be line segment OD and be that center of circle communication distance is the intersection point of the circle of radius with the O point.
4) the related AP that selects and move to corresponding waypoint.
5) if terminal point in the communication radius coverage of associated AP, then directly moves to terminal point, otherwise gets back to step 1.
Here can see different with algorithm at global information, at the algorithm of local message because the restriction of information can't be with regard to planning department's driving path before setting out.Therefore the present invention has adopted the method for increment type to approach terminal point gradually.
The accessibility of terminal point can be illustrated by Fig. 2.See that easily waypoint point B is that O point AP coverage is interior from the nearest point of terminal point, therefore at this association and moving process, mobile device is inevitable more near terminal point, therefore finally must reach home.
Claims (4)
1. the minimum navigation path selecting method of switching times in the wireless network is characterized in that may further comprise the steps:
1) obtaining of AP position: at first obtain the positional information that mobile node passes through A P in the zone in advance;
2) AP selects: by the terminal point D and the starting point S of consideration mobile node, and the continuable AP relating sequence of the positional information of AP decision minimum number;
3) selection of mobile route: after the relating sequence that has determined AP, select corresponding waypoint, thus the mobile route of decision mobile node in wireless network.
2. the minimum navigation path selecting method of switching times in the wireless network according to claim 1 is characterized in that step 1) is divided into following two kinds of situations:
Situation 1: the wireless network data storehouse has the situation by all AP positional informations in the zone, then directly obtains the positional information of all A P;
Situation 2: the wireless network data storehouse does not have the situation by all AP positional informations in the zone, then try to find out current location wireless signal on every side by network inquiry, to obtain the MAC Address of AP on every side,, obtain the AP positional information again by the database lookup of Placelab.
3. the minimum navigation path selecting method of switching times is characterized in that step 2 in the wireless network according to claim 2) in,
For situation 1, its concrete steps are: make up navigation picture according to the AP positional information, the construction step of this navigation picture is: each AP becomes a point in the navigation picture, calculates all internodal distances; If distance between two points is less than 2 times communication radius then added a limit between 2 o'clock, weights are 1; If with the distance of starting point S or terminal point D less than 1 times of communication radius, then increase weights and be 0 point; Seek shortest path on the navigation picture that builds, the sequence that the point on the shortest path constitutes is exactly the continuable AP relating sequence of minimum number;
For situation 2, its concrete steps are: the information according to AP around the current location is chosen associated AP, and selection rule is, the corresponding waypoint of this associated AP, make mobile node in the projection of starting point S to this line of terminal point D near terminal point D; The also i.e. waypoint of this associated AP, be with line segment OD be that center of circle communication distance is the intersection point of the circle of radius with the O point, center O point that described line segment OD is an associated AP and the line between the terminal point D.
4. the minimum navigation path selecting method of switching times is characterized in that in the step 3) in the wireless network according to claim 3,
For situation 1, its concrete steps are: connect each AP according to shut sequence, the mid point of getting every line is waypoint, each waypoint that is linked in sequence, and the line sequence that obtains is mobile route;
For situation 2, its concrete steps are: mobile node moves to the waypoint of associated AP from current location, if terminal point D then directly moves to terminal point D in the communication radius coverage of associated AP; Otherwise get back to step 1), up to moving to terminal point D, mobile node the path of process be mobile route.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010105310129A CN102006652A (en) | 2010-11-04 | 2010-11-04 | Navigation path selection method with least switching times in wireless network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010105310129A CN102006652A (en) | 2010-11-04 | 2010-11-04 | Navigation path selection method with least switching times in wireless network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102006652A true CN102006652A (en) | 2011-04-06 |
Family
ID=43813621
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010105310129A Pending CN102006652A (en) | 2010-11-04 | 2010-11-04 | Navigation path selection method with least switching times in wireless network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102006652A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103686896A (en) * | 2013-12-12 | 2014-03-26 | 广州市地下铁道总公司 | Method for switching wireless access points and terminal |
| CN107911848A (en) * | 2017-12-26 | 2018-04-13 | 广东欧珀移动通信有限公司 | Method for switching network and device |
| CN107959958A (en) * | 2016-10-17 | 2018-04-24 | 上海掌门科技有限公司 | Determine destination path, realize the method and apparatus of wireless access point connection |
| WO2020210986A1 (en) * | 2019-04-16 | 2020-10-22 | 西门子股份公司 | Navigation method applied to agv, system, computing device, medium, and product |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1588919A (en) * | 2004-09-30 | 2005-03-02 | 西安西电捷通无线网络通信有限公司 | Method for selecting optimum path communication by mobile node adaptation |
| US20060268712A1 (en) * | 2005-05-26 | 2006-11-30 | International Business Machines Corporation | System, method, and service for dynamically selecting an optimum message pathway |
-
2010
- 2010-11-04 CN CN2010105310129A patent/CN102006652A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1588919A (en) * | 2004-09-30 | 2005-03-02 | 西安西电捷通无线网络通信有限公司 | Method for selecting optimum path communication by mobile node adaptation |
| US20060268712A1 (en) * | 2005-05-26 | 2006-11-30 | International Business Machines Corporation | System, method, and service for dynamically selecting an optimum message pathway |
Non-Patent Citations (2)
| Title |
|---|
| YANCHAO ZHAO, WENZHONG LI, JUE HONG, ZHUO LI, SANGLU LU AND DAOX: "On Handoff Optimization in Wireless Networks: From a Navigation Perspective", 《WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE，2010IEEE》, 21 April 2010 (2010-04-21) * |
| YU-CHUNG CHENG，YATIN CHAWATHE，ANTHONY LAMARCA，JOHN KRUMM: "Accuracy Characterization for Metropolitan-scale Wi-Fi Localization", 《PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON MOBILE SYSTEMS, APPLICATIONS, AND SERVICES》, 8 June 2005 (2005-06-08), pages 233 - 245, XP008153905, DOI: doi:10.1145/1067170.1067195 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103686896A (en) * | 2013-12-12 | 2014-03-26 | 广州市地下铁道总公司 | Method for switching wireless access points and terminal |
| CN103686896B (en) * | 2013-12-12 | 2016-06-15 | 广州市地下铁道总公司 | The changing method of WAP and terminal |
| CN107959958A (en) * | 2016-10-17 | 2018-04-24 | 上海掌门科技有限公司 | Determine destination path, realize the method and apparatus of wireless access point connection |
| CN107911848A (en) * | 2017-12-26 | 2018-04-13 | 广东欧珀移动通信有限公司 | Method for switching network and device |
| WO2020210986A1 (en) * | 2019-04-16 | 2020-10-22 | 西门子股份公司 | Navigation method applied to agv, system, computing device, medium, and product |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8559955B2 (en) | Method and system for handover in cellular wireless using route programming and training processes | |
| CN111586783B (en) | Management device, communication device, motion estimation device, system, method, and medium | |
| CN105307232B (en) | Routing optimization method based on connection probability for vehicle-mounted self-organizing network | |
| CN102378283B (en) | Radio Network System, mobile device, information server and the method for information is provided | |
| TWI248738B (en) | Method for managing and controlling the discovery and maintenance for routes in a mobile ad hoc network and the mobile ad hoc network therein | |
| US8489093B2 (en) | Systems and methods for facilitating efficient vertical handoffs in a wireless communication system | |
| US8706131B2 (en) | Device location prediction for mobile service optimization | |
| WO2015120724A1 (en) | Cell handover method and device, and computer storage medium | |
| JP2020506566A (en) | Handover preparation and tracking / paging area handling and intelligent route selection in cellular networks | |
| CN107079360A (en) | Access point auxiliary roaming | |
| JP5141739B2 (en) | Communication system and mobile terminal | |
| CN101902794B (en) | Double-layer fast switching method based on motion prediction in V2I communication | |
| US20130332075A1 (en) | Methods and devices for providing guaranteed quality of service | |
| KR20130032900A (en) | Methods and apparatus to access network connectivity information using predicted locations | |
| JP2007318354A (en) | Communication device for mobile and communication method for mobile | |
| CN105682163A (en) | Base station switching control method, base station switching control device and terminal | |
| CN102006652A (en) | Navigation path selection method with least switching times in wireless network | |
| JP4140633B2 (en) | Communications system | |
| JP2005252623A (en) | Communication terminal, information provider, and handover processing method | |
| EP2615857A1 (en) | Method for determining a future location of a mobile electronic device | |
| Mouton et al. | Enabling vehicular mobility in city-wide IEEE 802.11 networks through predictive handovers | |
| US8521168B1 (en) | Resource allocation based on wireless device motion specified in connection request | |
| US20090207766A1 (en) | Wireless network connection management system and method thereof | |
| KR100847874B1 (en) | apparatus and method of processing mode in multi mode terminal | |
| KR20180093546A (en) | Vehicle location tracking method using dynamic vehicle grouping |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20110406 |