CN114885399A - Method and device for accessing operator, computer equipment and storage medium - Google Patents
Method and device for accessing operator, computer equipment and storage medium Download PDFInfo
- Publication number
- CN114885399A CN114885399A CN202210597829.9A CN202210597829A CN114885399A CN 114885399 A CN114885399 A CN 114885399A CN 202210597829 A CN202210597829 A CN 202210597829A CN 114885399 A CN114885399 A CN 114885399A
- Authority
- CN
- China
- Prior art keywords
- operator
- path
- coverage
- target
- target operator
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 52
- 238000004590 computer program Methods 0.000 claims abstract description 47
- 238000012545 processing Methods 0.000 claims description 17
- 238000012163 sequencing technique Methods 0.000 claims description 13
- 230000006855 networking Effects 0.000 abstract description 5
- 230000006870 function Effects 0.000 description 7
- 230000008859 change Effects 0.000 description 6
- 238000004891 communication Methods 0.000 description 6
- 238000010586 diagram Methods 0.000 description 5
- 230000003068 static effect Effects 0.000 description 5
- 230000000903 blocking effect Effects 0.000 description 3
- 238000011156 evaluation Methods 0.000 description 3
- 238000005259 measurement Methods 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 230000002159 abnormal effect Effects 0.000 description 2
- 230000001413 cellular effect Effects 0.000 description 2
- 238000013500 data storage Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000009182 swimming Effects 0.000 description 2
- OKTJSMMVPCPJKN-UHFFFAOYSA-N Carbon Chemical compound [C] OKTJSMMVPCPJKN-UHFFFAOYSA-N 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 229910021389 graphene Inorganic materials 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 230000002452 interceptive effect Effects 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W48/00—Access restriction; Network selection; Access point selection
- H04W48/16—Discovering, processing access restriction or access information
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W48/00—Access restriction; Network selection; Access point selection
- H04W48/02—Access restriction performed under specific conditions
- H04W48/04—Access restriction performed under specific conditions based on user or terminal location or mobility data, e.g. moving direction, speed
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W48/00—Access restriction; Network selection; Access point selection
- H04W48/18—Selecting a network or a communication service
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present application relates to a method, an apparatus, a computer device, a storage medium and a computer program product for accessing an operator. The method comprises the following steps: acquiring first operator coverage information, wherein the first operator coverage information comprises information of coverage conditions of at least one operator in a first path; selecting a first target operator according to the coverage information of the first operator; within the first path, a first target operator is accessed. The scheme is based on the selection of the whole operator coverage condition of the first path, so that the condition of frequently switching operators in the first path can be effectively reduced or avoided, and the relative network quality of the selected operator is better, thereby effectively improving the networking quality.
Description
Technical Field
The present application relates to the field of communications technologies, and in particular, to a method, an apparatus, a computer device, a storage medium, and a computer program product for accessing an operator.
Background
This causes problems in accessing the operators, since the network quality of different operators at different locations is different. For example, the vehicle-mounted terminal has access to the operator a at a location a, the network usage is good, but when the vehicle travels to a location B, the network of the operator a at the location B is very poor, which causes the vehicle-mounted terminal to drop the network, the vehicle-mounted terminal may have access to the operator B, and when the vehicle travels to a location c, the network of the operator B is very poor, which causes the vehicle-mounted terminal to drop the network again.
The traditional solution is to design a multi-card device, perform polling switching to an available operator under the condition of abnormal operator, or perform measurement once when the operator is abnormal, and select an operator with better signal, which may cause the situations of blocking, data packet loss or network drop of the device, especially for a mobile device (such as the above-mentioned vehicle-mounted terminal device), and the situations of blocking, network drop and the like may occur due to the above-mentioned manner, and the excessive range of switching times aggravates the situations of blocking, network drop and the like. That is, the conventional access operator's scheme has a problem of poor networking quality.
Disclosure of Invention
In view of the above, it is necessary to provide a method, an apparatus, a computer device, a computer readable storage medium and a computer program product for an access operator, which can improve the networking quality.
In a first aspect, the present application provides a method for accessing an operator. The method comprises the following steps: acquiring first operator coverage information, wherein the first operator coverage information comprises information of coverage conditions of at least one operator in a first path; selecting a first target operator according to the first operator coverage information; accessing the first target operator within the first path.
In one embodiment, the first target operator is an operator with the best coverage among at least one operator in the first path.
In one embodiment, the selecting a first target operator according to the first operator coverage information includes:
according to the first operator coverage information, sequencing at least one operator in the first path according to the sequence from the optimal coverage condition to the worst coverage condition to obtain a first coverage condition sequence table;
and selecting the first target operator according to the first coverage condition sequence table.
In one embodiment, the method further comprises:
when the coverage condition of the first target operator is not within a first preset range, selecting an operator with the optimal coverage condition except the first target operator from at least one operator in the first path as a second target operator;
and switching the accessed operator to the second target operator in the first path.
In one embodiment, the method further comprises:
acquiring second operator coverage information, wherein the second operator coverage information comprises information of coverage conditions of at least one operator in a second path, and the second path is a pre-switched path of the first path;
selecting a third target operator according to the second operator coverage information;
accessing the third target operator within the second path.
In one embodiment, the third target operator is an operator with the best coverage among at least one operator in the second path.
In one embodiment, the selecting a third target operator according to the coverage information of the second operator includes:
according to the second operator coverage information, sequencing at least one operator in the second path according to the sequence from the optimal coverage condition to the worst coverage condition to obtain a second coverage condition sequence table;
and selecting the third target operator according to the second coverage condition sequence table.
In one embodiment, said accessing, within said second path, said third target operator comprises:
and when the coverage condition of the third target operator is within a second preset range, accessing the third target operator in the second path.
In one embodiment, when the coverage of the third target operator is not within the second preset range, the method further includes:
selecting an operator with the optimal coverage condition except the third target operator from at least one operator in the second path as a fourth target operator;
and switching the accessed operator to the fourth target operator in the second path.
In one embodiment, the method further includes:
when the coverage condition of the first target operator is within a third preset range, keeping accessing to the first target operator in the second path; or
And when the coverage condition of the first target operator is not within a third preset range, accessing a third target operator in the second path.
In a second aspect, the present application further provides an apparatus for accessing an operator. The apparatus comprises means for enabling to implement the method of the first aspect and any one of its implementations.
In one embodiment, the apparatus comprises:
an obtaining unit, configured to obtain first operator coverage information, where the first operator coverage information includes information of a coverage situation of at least one operator in a first path;
the processing unit is used for selecting a first target operator according to the first operator coverage information;
the processing unit is further configured to access the first target operator in the first path.
In a third aspect, the present application also provides a computer device. The computer device comprises a memory storing a computer program and a processor implementing the method of the first aspect and any one of its implementation manners when executing the computer program.
In a fourth aspect, the present application further provides a computer-readable storage medium. The computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the method of the first aspect and any one of its implementations.
In a fifth aspect, the present application further provides a computer program product. The computer program product comprising a computer program that when executed by a processor implements the method of the first aspect and any one of its implementations.
The method, the device, the computer equipment, the storage medium and the computer program product for accessing the operator select the target operator according to the operator coverage condition in the first path, and access the target operator in the first path. The scheme is based on the selection of the whole operator coverage condition of the first path, so that the condition of frequently switching operators in the first path can be effectively reduced or avoided, and the relative network quality of the selected operator is better, thereby effectively improving the networking quality.
Drawings
Fig. 1 is a schematic diagram of an application environment according to an embodiment of the present application.
Fig. 2 is a flowchart illustrating a method for accessing an operator according to an embodiment of the present application.
Fig. 3 is a flowchart illustrating a step of selecting a first target operator according to an embodiment of the present application.
Fig. 4 is a flowchart illustrating a method for accessing an operator according to an embodiment of the present application.
Fig. 5 is a block diagram of an apparatus for accessing an operator according to an embodiment of the present application.
Fig. 6 is an internal structural diagram of a computer device according to an embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application.
The method for accessing to the operator provided by the embodiment of the application can be applied to the application environment shown in fig. 1. Wherein the terminal 102 communicates with the server 104 via a network. The data storage system may store data that the server 104 needs to process. The data storage system may be integrated on the server 104, or may be located on the cloud or other network server. The terminal 102 acquires the first operator coverage information from the server 104, selects a first target operator according to the first operator coverage information, and accesses the first target operator in the first path. Wherein the first operator coverage information comprises information of coverage situation of at least one operator within the first path.
The terminal 102 may be, but is not limited to, various in-vehicle terminal devices, on-board terminal devices, personal computers, notebook computers, smart phones, tablet computers, and portable wearable devices. The vehicle-mounted terminal device can be a terminal device on various vehicles such as automobiles, trains, trucks, shared bicycles, shared electric vehicles and the like. The portable wearable device can be a smart watch, a smart bracelet, a head-mounted device, and the like. The server 104 may be implemented as a stand-alone server or as a server cluster comprised of multiple servers.
In the embodiment of the present application, if the user is a human-powered movement mode, such as running, walking, skateboarding, swimming, and other various human-powered movement modes, the terminal 102 may be a personal computer, a notebook computer, a smart phone, a tablet computer, or a portable wearable device. For example, the user wears smart headphones, a mobile phone, a notebook, and the like during running. For example, a smart band is worn during swimming.
In the embodiment of the present application, if the external force movement mode is an external force movement mode, for example, a travel mode of various vehicles such as riding, and the like, the terminal 102 may be an in-vehicle terminal device, a ship-mounted terminal device, a personal computer, a notebook computer, a smart phone, a tablet computer, a portable wearable device, or the like. For example, a mobile phone, a notebook computer, a smart speaker, or the like is carried with a person who is riding a car, a train, a high-speed train, a cruise ship, a passenger ship, or the like, or a vehicle-mounted terminal device or a ship-mounted terminal device on a riding car, a train, a high-speed train, a cruise ship, or a passenger ship. For another example, when riding a shared electric vehicle or a shared bicycle, the vehicle-mounted terminal device is mounted on the vehicle.
That is, in the embodiment of the present application, any terminal device that can cause movement (i.e., change in position) may be applied. There is no limitation on how the movement is caused. The path can be understood as a movement path, that is, the path can be regarded as a path as long as movement necessarily generates a movement track (movement path). And for the static case, it can be regarded as a special case that the path length is zero.
The application scenarios of the scheme of the embodiment of the application can be divided into three categories: static scenes, moving scenes, combined scenes. In a static scenario, the terminal 102 is a static device, and may be, for example, an energy source, a shared series of internet of things devices, such as a charging pile, a shared charger, a cellular power meter reading device, and the like, and is equivalent to a path length of zero. In a mobile scenario, the terminal 102 may be any of the terminals described above that may be moved. In the combined scenario, this corresponds to when the terminal 102 is both stationary and moving. For example, a shared bicycle is a stationary device before being swept away by a sweep, a mobile device during being ridden, a stationary device after being parked, etc.
In one embodiment, as shown in fig. 2, a method for accessing an operator is provided, which is described by taking the method as an example for being applied to the terminal 102 in fig. 1, and includes the following steps:
201. first operator coverage information is obtained.
The first operator coverage information includes information of coverage of at least one operator in the first path. The coverage situation of the operator can be understood as the network condition of the operator. In the embodiment of the present application, the operator coverage condition may be an evaluation result, such as a score, of the network quality. For example, the first operator coverage information received at a certain time includes: the coverage condition of the operator A is scored as 1, the coverage condition of the operator B is scored as 5, the coverage condition of the operator C is scored as 10, the higher the score is, the better the coverage condition is, the coverage condition of the operator C is optimal, the second time the operator B is, the worst coverage condition of the operator A is.
The operator coverage information can be obtained through the internal deployment information of the operator, can also be obtained through self measurement of the terminal equipment, and can also be obtained from the cloud equipment.
In an implementation manner, the terminal device may measure and report network data of the operator, and the cloud device may analyze and obtain operator coverage information according to the reported data. Network data such as network rate, packet loss rate, network identification, etc.
In another implementation, the terminal device may receive internal deployment information of the operator, and the operator coverage within the location range of the first path may be inferred from the internal deployment information. The in-house deployment information may include, for example, the base station distribution of the operator. However, since some operators do not disclose their own in-house deployment situations, the implementation is only applicable to operators who partially disclose in-house deployment information.
In another implementation manner, the terminal device may measure network conditions of all operators in the location of the terminal device by itself, and use the measured operator network condition of the current location as the operator network condition of the first path.
It should be noted that, in addition to testing the information of all current operators, the self-measurement may also measure the information of the running path, perform information processing and store the information into a local storage device, and then, if the same path is encountered, the stored information may be used as a reference. Equivalently, a database of local operator coverage conditions is established, the scheme is suitable for a scene of a fixed path, such as a bus, a tramcar and the like, which is a typical scene that a traveling path is not changed, after one-time traveling, the path and operator coverage information are recorded, and then when an operator is selected on the path again, historical storage data can be referred to, so that a proper operator can be selected better.
Optionally, the first path may be determined according to a driving path reported by the terminal device. For example, in a navigation scenario, a first path is determined according to a start point and an end point input by a user.
Optionally, the first path may also be determined according to the current location of the terminal device. For example, in a positioning scenario, the location of the terminal device is determined according to the positioning information of the terminal device, and if the terminal device is located on a certain road, the road can be regarded as a first path.
It should be noted that, in the embodiment of the present application, the path may be divided into a fixed path and a non-fixed path (dynamic path). The fixed path is, for example, a taxi taking, a navigation, a public transportation taking and other scenes, and the reported information of the terminal equipment determines a fixed starting point and a fixed end point, otherwise, the fixed path is a non-fixed path. The non-fixed path, such as purposeless riding, self-driving and the like, can obtain the running path and direction of the current customer through an algorithm, and judge the path where the terminal device is currently located.
When a user inputs a starting point and an end point through an interactive interface of the terminal device (for example, the user can input the starting point and the end point through a touch screen or voice), a fixed path is generated. Acquiring a possible path route through a map, providing user interaction if the route has a plurality of routes, instructing a user to select and fix a desired path, recording unique path information, and ensuring the uniqueness of the path, such as from a point A to a point F, wherein the possible path 1: a- > b-c- > d; route 2: a- > x- > y- > d, if the path 2 is selected, recording a starting point and an end point of the whole path, and recording the starting point and the end point on the paths of a, x, y, d and the like to ensure the uniqueness on the path, otherwise, recording only the information of the starting point and the end point.
For a non-fixed path, current position information (such as longitude and latitude information) of terminal equipment can be acquired, the current information is positioned by the equipment to acquire a road starting point of the equipment, the direction of the road information is judged according to the position change trend, and a turnout of the current road or an end point of the current road acquired by map information is combined as an end point; and then dynamically determining the starting point and the end point of the path. If the terminal is not in the range of the already calculated dynamic path, a new non-fixed path can be calculated again according to the method.
The starting point and the end point can be definite place names on the map, and can also be specific positions. For example, the starting and ending points may be towns, mountains, parks, ponds, lakes, malls, street lights, signs or intersections, and the like. That is, the starting point and the ending point may be definite locations, such as a location coordinate point, a longitude and latitude, a tree, or regions, such as city a, city B, city C, etc.
202. And selecting a first target operator according to the first operator coverage information.
The first target operator is selected from at least one operator in the first path. As described above, the first operator coverage information includes the information of the coverage of at least one operator in the first path, so the coverage of each operator in the at least one operator in the first path may be determined according to the first operator coverage information, and then the first target operator may be selected according to the coverage of each operator. For example, an operator with better coverage can be selected.
The quality of the coverage directly affects the network quality of the terminal equipment. When the coverage condition is better, the terminal device accesses the network more smoothly, and if the coverage condition is worse, the terminal device accesses the network more slowly and is possibly blocked, even the situations of disconnection, network disconnection, service receiving and sending congestion and the like occur. For example, suppose that a base station of the a operator is located near a certain place but the base station of the B operator is far away, so that the network condition of the a operator is good and the network condition of the B operator is poor. That is, here the coverage situation of the a operator is better than the coverage situation of the B operator. At this time, if the terminal device is accessed to the operator a, the terminal device can smoothly access the network, and if the terminal device is accessed to the operator B, the terminal device may be stuck or even not connected to the network.
203. Within the first path, a first target operator is accessed.
When step 203 is performed, the terminal device may or may not be on the first path. Assuming that steps 201 and 202 are performed before the terminal device moves to the first path and the first target operator is selected, step 203 may be performed when the terminal device moves to the first path. For example, if the pedestrian walks to mall B from the entrance of mall a by using the mobile phone for navigation, and the pedestrian is 20 meters away from the entrance of mall a, step 203 may be executed when the pedestrian reaches the entrance of mall a, the mobile phone is connected to the first target operator, and the first target operator is connected to the pedestrian during walking from the entrance of mall a to the entrance of mall B. Step 203 may be executed before the pedestrian reaches the entrance of mall a, so that the first target carrier is already accessed by the mobile phone when the mobile phone is not on the first path, and the first target carrier is continuously accessed during the walking of the pedestrian from the entrance of mall a to the entrance of mall B.
Assuming that the terminal device is already on the first path and has performed steps 201 and 202 to select the first target operator, step 203 may be immediately performed to access the first target operator.
It should also be understood that within the first path, it may be upon arrival, already in the first path, or about to leave the first path.
The terminal device in the embodiment of the application may adopt a multi-card function unit to execute the operation of operator switching. The multi-card function unit can provide a function of switching among multiple operators, and comprises a multi-card device or a cloud card device.
It should be noted that, if the first target operator is the operator that the terminal device is accessing, step 203 is equivalent to continuously maintaining access to the first target operator, and if the first target operator is not the operator that the terminal device is accessing, step 203 is equivalent to switching the accessed operator to the first target operator in the first path.
In the method for accessing the operator, a target operator is selected according to the operator coverage condition in the first path, and the target operator is accessed in the first path. The scheme is based on the selection of the whole operator coverage condition of the first path, so that the condition of frequently switching operators in the first path can be effectively reduced or avoided, and the relative network quality of the selected operator is better, thereby effectively improving the networking quality.
In one embodiment, the first target operator is an operator with the best coverage among at least one operator in the first path. That is, the operator with the best coverage is selected from all operators in the first path.
In one embodiment, as shown in FIG. 3, step 202 may comprise:
301. and sequencing at least one operator in the first path according to the coverage information of the first operator from the optimal coverage condition to the worst coverage condition to obtain a first coverage condition sequence list.
As described above, the coverage of the operator can be represented by an evaluation result, such as a score, and the best to worst coverage is the evaluation result of the coverage, such as the highest to the lowest score of the coverage.
For example, assuming that the scores of the A, B, C, D operators are 30, 10, 60, and 50, respectively, the order of the coverage situations of the operators from the best to the worst is (60, 50, 30, and 10), and after the operators are sorted according to the order, the obtained coverage situation sorting table is (C, D, A, B).
302. And selecting a first target operator according to the first coverage condition sequence table.
Optionally, an operator ranked first may be selected as the first target quotient according to the first coverage condition sequence table. That is, the operator with the best coverage condition among at least one operator in the first path is selected as the first target operator.
Optionally, one operator in the top X% of the ranks may be randomly selected as the first target quotient according to the first coverage condition sequence table, where 0< X < 100. Namely, the operator with better coverage in at least one operator in the first path is selected as the first target operator. X can be adjusted as required.
Optionally, when the operator currently accessed by the terminal device is X% before the rank of the first coverage condition sequence table, the currently accessed operator may be used as the first target operator; and when the operator currently accessed by the terminal equipment is not in the top X% of the first coverage condition sequence list, selecting the operator with the first rank or randomly selecting one operator in the top X% of the first rank as a first target operator.
In the scenario shown in fig. 3, the target operator is selected from the sequence list by sorting the operators.
The scheme shown in fig. 3 can have two implementation modes, an automatic mode and a manual mode, according to whether the user participates in the dimension.
After sensing the coverage quality of the operator (namely acquiring the coverage information of the first operator), selecting the first target operator according to preferred logic without user participation, namely, an automatic mode; otherwise, only the first coverage condition sequence list is displayed to the user, and the method for prompting the user to select the proper operator is called a manual mode. It can thus be seen that the steps shown in figure 3 are those of an automatic mode, requiring no user involvement in the selection.
Fig. 4 is a schematic flow chart of a method for accessing an operator according to an embodiment of the present application.
401. First operator coverage information is obtained.
Step 401 may be viewed as an example of step 201. Reference may be made to the related contents in step 201, which are not described in detail.
402. And selecting a first target operator according to the first operator coverage information.
Step 402 may be viewed as an example of step 202. Reference may be made to the related contents in step 202, which are not described in detail.
Optionally, an operator with the best coverage condition among the at least one operator in the first path may be selected as the first target operator.
Optionally, all operators in the first path may also be sorted in order from the superior to the inferior in the coverage situation, and the first target operator may be selected according to the sorting situation. That is, according to the coverage information of the first operator, at least one operator in the first path is sorted in the order from the best to the worst coverage condition to obtain a first coverage condition sequence table; and selecting a first target operator according to the first coverage condition sequence table.
403. A first target operator is accessed within a first path.
Step 403 may be viewed as an example of step 203.
In the usual case, the first target operator may be accessed within the first path. But if special situations are encountered which result in a temporary change of the coverage of the first target operator in the first path, an attempt may be made to reselect the target operator for access. That is, step 403 may further include: when the coverage condition of the first target operator is not within a first preset range, selecting an operator with the optimal coverage condition except the first target operator from at least one operator in the first path as a second target operator; and switching the accessed operator to a second target operator in the first path. The scheme is equivalent to switching to a second target operator (a second best operator) when the coverage condition of the first target operator is poor. It should be understood that the second target operator and the first target operator are not the same operator.
The preset range may be understood as a preset range of the operator coverage, and the first preset range is a preset range of the first target operator coverage. When the actual coverage condition of the operator is not within the first preset range, the terminal device may have situations such as dropped line, dropped network, and congestion of service receiving and sending.
404. And acquiring the second operator coverage information.
The second operator coverage information includes information of coverage of at least one operator within a second path, the second path being a pre-switched path of the first path.
Optionally, the second path may be determined according to a travel path reported by the terminal device. For example, in the navigation scenario, in the middle of a road, the user switches the driving routes of the remaining roads (that is, the user changes the reported driving route), the route before the route is switched may be regarded as the first route, and the route after the route is switched may be regarded as the to-be-switched route of the first route, that is, the second route in this text.
Optionally, the second path may also be determined according to the current location of the terminal device. For example, in a positioning scene, the position of the terminal device is determined according to the positioning information of the terminal device, and if the terminal device is located on a certain road, the road can be regarded as a first route, and a road to be traveled after the road is regarded as a second route.
It should also be understood that the path may also be a road, for example, considering a travel segment on a road as a first path and considering a travel segment on a road B as a second path.
When the path does not change, for example, the taxi taking route from point a to point B, the whole path may be regarded as the first path, and the first target operator may be selected in the whole path. When a route is changed, for example, when the travel route of the remaining route is switched in the middle of the route, the route before the route is switched may be regarded as the first route, and the route after the route is switched may be regarded as the second route. The first target operator may be selected for access on the first path and the other target operators (e.g., the third target operator below) may be selected for access on the second path.
As described above, the route may also be a road, for example, if the travel link on the a road is regarded as the first route and the travel link on the B road is regarded as the second route, the first target operator may be selected for access on the first route, and the third target operator may be selected for access on the second route.
405. And selecting a third target operator according to the coverage information of the second operator.
Optionally, an operator with the best coverage condition among the at least one operator in the second path may be selected as the third target operator.
It should be appreciated that in some cases, the third target operator and the first target operator may be the same operator. That is, the operator with the best coverage in the first path and the operator with the best coverage in the second path are the same.
Optionally, all operators in the second path may also be sorted in order from the superior to the inferior in coverage, and the third target operator may be selected according to the sorting condition (sorting table). That is, according to the coverage information of the second operator, at least one operator in the second path is sorted in the order from the best to the worst coverage condition to obtain a second coverage condition sequence table; and selecting a third target operator according to the second coverage condition sequence table.
406. Within the second path, a third target operator is accessed.
Optionally, it may be determined whether the coverage of the third target operator is within a second preset range, and when the coverage of the third target operator is within the second preset range, the third target operator is accessed in the second path. That is, the target operator is reselected after switching from the first path to the second path is considered only when the third target operator satisfies the condition. If the third target operator is not eligible, no reselection is made, which avoids invalid handovers. If the third target operator does not satisfy the condition on the second path, which is equivalent to the second path having no suitable operator to access, it makes no sense to perform the handover-related operation.
Similar to step 403, in the usual case, the third target operator may be accessed within both of the second paths. But if special situations are encountered which result in a temporary change of the coverage of the third target operator in the second path, an attempt may be made to reselect the target operator for access. That is, when the coverage of the third target operator is not within the second preset range, step 406 further includes: selecting an operator with the optimal coverage condition except a third target operator as a fourth target operator from at least one operator in the second path; and switching the accessed operator to a fourth target operator (a suboptimal operator) in the second path. It should be understood that the third target operator and the fourth target operator are not the same.
The second preset range may be understood as a preset range of coverage situations of the third target operator. When the actual coverage condition of the operator is not within the second preset range, the terminal device may have a dropped connection, a dropped network, a service receiving and sending congestion, and the like. The first and second predetermined ranges may be the same or different.
In addition, the first target operator may continue to be accessed within the second path. That is, the above method may further include: when the coverage condition of the first target operator is within a third preset range, keeping accessing to the first target operator in the second path; or, when the coverage condition of the first target operator is not within a third preset range, accessing a third target operator in the second path. The third preset range may refer to the first preset range, that is, the first preset range is a preset range of the coverage condition of the first target operator on the first path, and the third preset range is a preset range of the coverage condition of the first target operator on the second path. In some cases, the third preset range may be the same as the first preset range.
It should be appreciated that when the coverage of the first target operator is within a third predetermined range, access to the first target operator is maintained in the second path. In the case that the coverage of the first target operator is also good, although the third target operator is optimal on the second path, the accessed operator is not switched, so that the switching times are reduced. And when the coverage condition of the first target operator is not within the third preset range, accessing the third target operator in the second path, which is equivalent to executing step 406 to switch the accessed operator only when the coverage condition of the first target operator is poor.
It should be understood that, although the steps in the flowcharts related to the embodiments as described above are sequentially displayed as indicated by arrows, the steps are not necessarily performed sequentially as indicated by the arrows. The steps are not performed in the exact order shown and described, and may be performed in other orders, unless explicitly stated otherwise. Moreover, at least a part of the steps in the flowcharts related to the embodiments described above may include multiple steps or multiple stages, which are not necessarily performed at the same time, but may be performed at different times, and the execution order of the steps or stages is not necessarily sequential, but may be rotated or alternated with other steps or at least a part of the steps or stages in other steps. For example, step 401 and step 404 may be performed simultaneously, or either step may be performed first. Step 402 and step 405 may be performed simultaneously or either step may be performed first. In combination with the actual scenario, the first path and the first target operator may be determined by navigation before the vehicle has not traveled, the second path and the third target operator may be determined before the first path has not ended, or the second path and the third target operator may be determined after the vehicle has traveled to the second path. The first path, the second path, the first target operator, and the third target operator may also be determined before driving. Are not listed any more.
Based on the same inventive concept, the embodiment of the present application further provides an apparatus for accessing an operator, which is used for implementing the method for accessing an operator. The implementation scheme for solving the problem provided by the device is similar to the implementation scheme described in the above method, so specific limitations in the device embodiments of one or more access operators provided below can refer to the limitations of the method for accessing the operator in the foregoing, and details are not described here.
In one embodiment, as shown in fig. 5, there is provided an apparatus for accessing an operator, the apparatus 1000 comprising: an acquisition unit 1001 and a processing unit 1002, wherein: an obtaining unit 1001 is configured to obtain first operator coverage information, where the first operator coverage information includes information of a coverage situation of at least one operator in the first path. The processing unit 1002 is configured to select a first target operator according to the first operator coverage information; within the first path, a first target operator is accessed.
In one embodiment, the first target operator is an operator with the best coverage among at least one operator in the first path.
In one embodiment, the processing unit 1002 is specifically configured to:
according to the coverage information of the first operator, sequencing at least one operator in the first path according to the sequence from the optimal coverage condition to the worst coverage condition to obtain a first coverage condition sequence table;
and selecting a first target operator according to the first coverage condition sequence table.
In one embodiment, the processing unit 1002 is further configured to: when the coverage condition of the first target operator is not within a first preset range, selecting an operator with the optimal coverage condition except the first target operator from at least one operator in the first path as a second target operator; and switching the accessed operator to a second target operator in the first path.
In one embodiment, the obtaining unit 1001 is further configured to: and acquiring second operator coverage information, wherein the second operator coverage information comprises information of the coverage condition of at least one operator in a second path, and the second path is a pre-switching path of the first path. The processing unit 1002 is further configured to: selecting a third target operator according to the coverage information of the second operator; within the second path, a third target operator is accessed.
In one embodiment, the third target operator is an operator with the best coverage among at least one operator in the second path.
In one embodiment, the processing unit 1002 is specifically configured to: according to the coverage information of the second operator, sequencing at least one operator in the second path according to the sequence from the optimal coverage condition to the worst coverage condition to obtain a second coverage condition sequence table; and selecting a third target operator according to the second coverage condition sequence table.
In one embodiment, the processing unit 1002 is specifically configured to: accessing a third target operator within the second path, including:
and when the coverage condition of the third target operator is within a second preset range, accessing the third target operator in the second path.
In an embodiment, when the coverage of the third target operator is not within the second preset range, the processing unit 1002 is further configured to:
selecting an operator with the optimal coverage condition except a third target operator from at least one operator in the second path as a fourth target operator;
and switching the accessed operator to a fourth target operator in the second path.
The obtaining unit 1001 may be configured to perform step 201, and the processing unit 1002 may be configured to perform steps 202 and 203. The obtaining unit 2002 may also be configured to perform steps 301 and 302 shown in fig. 3. The obtaining unit may be configured to perform steps 401 and 404, and the processing unit 1002 may be configured to perform steps 402, 403, 405, and 406.
In one embodiment, the obtaining unit 1001 may include a path GPS information obtaining unit and an operator coverage status obtaining unit, and the processing unit 1002 may include an operator policy selecting unit and a multi-card function unit. The route GPS information acquisition unit is used for acquiring a first route and a second route, and the operator coverage state acquisition unit is used for acquiring first operator coverage information and second operator coverage information. The operator policy selection unit may be configured to perform a step of selecting a target operator, such as the step shown in fig. 3, the step 202, the step 402 or the step 405. The multi-card function unit can provide a function of switching among multiple operators, and comprises a multi-card device or a cloud card device. When switching operators, the protocol stack is activated first, a new operator card is switched, and then the protocol stack is activated to complete network registration and provide service functions. The multi-card functional unit may be used to perform step 203, step 403 and step 406.
The various modules in the above described access operator's device may be implemented in whole or in part by software, hardware, and combinations thereof. The modules can be embedded in a hardware form or independent from a processor in the computer device, and can also be stored in a memory in the computer device in a software form, so that the processor can call and execute operations corresponding to the modules.
In one embodiment, a computer device is provided, which may be a terminal, and its internal structure diagram may be as shown in fig. 6. The computer apparatus includes a processor, a memory, a communication interface, a display unit, and an input device connected through a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device comprises a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of an operating system and computer programs in the non-volatile storage medium. The communication interface of the computer device is used for carrying out wired or wireless communication with an external terminal, and the wireless communication can be realized through WIFI, a mobile cellular network, NFC (near field communication) or other technologies. The computer program is executed by a processor to implement a method of accessing an operator. The display unit of the computer equipment can be a liquid crystal display screen or an electronic ink display screen, and the input device of the computer equipment can be a touch layer covered on the display unit, a key, a track ball or a touch pad arranged on the shell of the computer equipment, an external keyboard, a touch pad or a mouse and the like.
It will be appreciated by those skilled in the art that the configuration shown in fig. 6 is a block diagram of only a portion of the configuration associated with the present application, and is not intended to limit the computing device to which the present application may be applied, and that a particular computing device may include more or less components than those shown, or may combine certain components, or have a different arrangement of components.
In one embodiment, a computer device is provided, comprising a memory and a processor, the memory having a computer program stored therein, the processor implementing the following steps when executing the computer program:
acquiring first operator coverage information, wherein the first operator coverage information comprises information of coverage conditions of at least one operator in a first path; selecting a first target operator according to the coverage information of the first operator; within the first path, a first target operator is accessed.
In one embodiment, the processor, when executing the computer program, further performs the steps of:
sequencing at least one operator in the first path according to the coverage information of the first operator from the optimal to the worst coverage condition to obtain a first coverage condition sequence table;
and selecting a first target operator according to the first coverage condition sequence table.
In one embodiment, the processor, when executing the computer program, further performs the steps of:
when the coverage condition of the first target operator is not within a first preset range, selecting an operator with the optimal coverage condition except the first target operator from at least one operator in the first path as a second target operator;
and switching the accessed operator to a second target operator in the first path.
In one embodiment, the processor, when executing the computer program, further performs the steps of:
acquiring second operator coverage information, wherein the second operator coverage information comprises information of the coverage condition of at least one operator in a second path, and the second path is a pre-switching path of the first path;
selecting a third target operator according to the coverage information of the second operator;
within the second path, a third target operator is accessed.
In one embodiment, the processor, when executing the computer program, further performs the steps of:
according to the coverage information of the second operator, sequencing at least one operator in the second path according to the sequence from the optimal coverage condition to the worst coverage condition to obtain a second coverage condition sequence table;
and selecting a third target operator according to the second coverage condition sequence table.
In one embodiment, the processor, when executing the computer program, further performs the steps of:
and when the coverage condition of the third target operator is within a second preset range, accessing the third target operator in the second path.
In one embodiment, the processor, when executing the computer program, further performs the steps of:
when the coverage condition of the third target operator is not within a second preset range, selecting an operator with the optimal coverage condition except the third target operator as a fourth target operator from at least one operator in the second path;
and switching the accessed operator to a fourth target operator in the second path.
In one embodiment, the processor, when executing the computer program, further performs the steps of:
when the coverage condition of the first target operator is within a third preset range, keeping accessing to the first target operator in the second path; or
And when the coverage condition of the first target operator is not within a third preset range, accessing a third target operator in the second path.
In one embodiment, a computer readable storage medium is provided having a computer program stored thereon, the computer program when executed implementing the steps of:
acquiring first operator coverage information, wherein the first operator coverage information comprises information of coverage conditions of at least one operator in a first path; selecting a first target operator according to the coverage information of the first operator; within the first path, a first target operator is accessed.
In one embodiment, the computer program when executed further performs the steps of:
sequencing at least one operator in the first path according to the coverage information of the first operator from the optimal to the worst coverage condition to obtain a first coverage condition sequence table;
and selecting a first target operator according to the first coverage condition sequence table.
In one embodiment, the computer program when executed further performs the steps of:
when the coverage condition of the first target operator is not within a first preset range, selecting an operator with the optimal coverage condition except the first target operator from at least one operator in the first path as a second target operator;
and switching the accessed operator to a second target operator in the first path.
In one embodiment, the computer program when executed further performs the steps of:
acquiring second operator coverage information, wherein the second operator coverage information comprises information of the coverage condition of at least one operator in a second path, and the second path is a pre-switching path of the first path;
selecting a third target operator according to the coverage information of the second operator;
within the second path, a third target operator is accessed.
In one embodiment, the computer program when executed further performs the steps of:
according to the coverage information of the second operator, sequencing at least one operator in the second path according to the sequence from the optimal coverage condition to the worst coverage condition to obtain a second coverage condition sequence table;
and selecting a third target operator according to the second coverage condition sequence table.
In one embodiment, the computer program when executed further performs the steps of:
and when the coverage condition of the third target operator is within a second preset range, accessing the third target operator in the second path.
In one embodiment, the computer program when executed further performs the steps of:
when the coverage condition of the third target operator is not within a second preset range, selecting an operator with the optimal coverage condition except the third target operator as a fourth target operator from at least one operator in the second path;
and switching the accessed operator to a fourth target operator in the second path.
In one embodiment, the computer program when executed further performs the steps of:
when the coverage condition of the first target operator is within a third preset range, keeping accessing to the first target operator in the second path; or
And when the coverage condition of the first target operator is not within a third preset range, accessing a third target operator in the second path.
In one embodiment, there is provided a computer program product comprising a computer program that when executed performs the steps of:
acquiring first operator coverage information, wherein the first operator coverage information comprises information of coverage conditions of at least one operator in a first path; selecting a first target operator according to the coverage information of the first operator; within the first path, a first target operator is accessed.
In one embodiment, the computer program when executed further performs the steps of:
according to the coverage information of the first operator, sequencing at least one operator in the first path according to the sequence from the optimal coverage condition to the worst coverage condition to obtain a first coverage condition sequence table;
and selecting a first target operator according to the first coverage condition sequence table.
In one embodiment, the computer program when executed further performs the steps of:
when the coverage condition of the first target operator is not within a first preset range, selecting an operator with the optimal coverage condition except the first target operator from at least one operator in the first path as a second target operator;
and switching the accessed operator to a second target operator in the first path.
In one embodiment, the computer program when executed further performs the steps of:
acquiring second operator coverage information, wherein the second operator coverage information comprises information of the coverage condition of at least one operator in a second path, and the second path is a pre-switching path of the first path;
selecting a third target operator according to the coverage information of the second operator;
within the second path, a third target operator is accessed.
In one embodiment, the computer program when executed further performs the steps of:
according to the coverage information of the second operator, sequencing at least one operator in the second path according to the sequence from the optimal coverage condition to the worst coverage condition to obtain a second coverage condition sequence table;
and selecting a third target operator according to the second coverage condition sequence table.
In one embodiment, the computer program when executed further performs the steps of:
and when the coverage condition of the third target operator is within a second preset range, accessing the third target operator in the second path.
In one embodiment, the computer program when executed further performs the steps of:
when the coverage condition of the third target operator is not within a second preset range, selecting an operator with the optimal coverage condition except the third target operator as a fourth target operator from at least one operator in the second path;
and switching the accessed operator to a fourth target operator in the second path.
In one embodiment, the computer program when executed further performs the steps of:
when the coverage condition of the first target operator is within a third preset range, keeping accessing to the first target operator in the second path; or alternatively
And when the coverage condition of the first target operator is not within a third preset range, accessing a third target operator in the second path.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware instructions of a computer program, which can be stored in a non-volatile computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. Any reference to memory, database, or other medium used in the embodiments provided herein may include at least one of non-volatile and volatile memory. The nonvolatile Memory may include Read-Only Memory (ROM), magnetic tape, floppy disk, flash Memory, optical Memory, high-density embedded nonvolatile Memory, resistive Random Access Memory (ReRAM), Magnetic Random Access Memory (MRAM), Ferroelectric Random Access Memory (FRAM), Phase Change Memory (PCM), graphene Memory, and the like. Volatile Memory can include Random Access Memory (RAM), external cache Memory, and the like. By way of illustration and not limitation, RAM can take many forms, such as Static Random Access Memory (SRAM) or Dynamic Random Access Memory (DRAM), among others. The databases referred to in various embodiments provided herein may include at least one of relational and non-relational databases. The non-relational database may include, but is not limited to, a block chain based distributed database, and the like. The processors referred to in the embodiments provided herein may be general purpose processors, central processing units, graphics processors, digital signal processors, programmable logic devices, quantum computing based data processing logic devices, etc., without limitation.
The technical features of the above embodiments can be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the above embodiments are not described, but should be considered as the scope of the present specification as long as there is no contradiction between the combinations of the technical features.
The above-mentioned embodiments only express several embodiments of the present application, and the description thereof is more specific and detailed, but not construed as limiting the scope of the present application. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the concept of the present application, which falls within the scope of protection of the present application. Therefore, the protection scope of the present application shall be subject to the appended claims.
Claims (14)
1. A method for accessing an operator, the method comprising:
acquiring first operator coverage information, wherein the first operator coverage information comprises information of coverage conditions of at least one operator in a first path;
selecting a first target operator according to the first operator coverage information;
accessing the first target operator within the first path.
2. The method of claim 1, wherein the first target operator is an operator with the best coverage among at least one operator in the first path.
3. The method of claim 2, wherein selecting the first target operator according to the first operator coverage information comprises:
according to the first operator coverage information, sequencing at least one operator in the first path according to the sequence from the optimal coverage condition to the worst coverage condition to obtain a first coverage condition sequence table;
and selecting the first target operator according to the first coverage condition sequence table.
4. A method according to claim 2 or 3, characterized in that the method further comprises:
when the coverage condition of the first target operator is not within a first preset range, selecting an operator with the optimal coverage condition except the first target operator from at least one operator in the first path as a second target operator;
and switching the accessed operator to the second target operator in the first path.
5. The method of claim 1, further comprising:
acquiring second operator coverage information, wherein the second operator coverage information comprises information of coverage conditions of at least one operator in a second path, and the second path is a pre-switched path of the first path;
selecting a third target operator according to the coverage information of the second operator;
accessing the third target operator within the second path.
6. The method of claim 5, wherein the third target operator is an operator with the best coverage among the at least one operator in the second path.
7. The method of claim 5, wherein selecting a third target operator according to the second operator coverage information comprises:
according to the second operator coverage information, sequencing at least one operator in the second path according to the sequence from the optimal coverage condition to the worst coverage condition to obtain a second coverage condition sequence table;
and selecting the third target operator according to the second coverage condition sequence table.
8. The method of claim 5, wherein accessing the third target operator in the second path comprises:
and when the coverage condition of the third target operator is within a second preset range, accessing the third target operator in the second path.
9. The method of claim 8, wherein when the coverage of the third target operator is not within the second preset range, the method further comprises:
selecting an operator with the optimal coverage condition except the third target operator from at least one operator in the second path as a fourth target operator;
and switching the accessed operator to the fourth target operator in the second path.
10. The method of claim 5, further comprising:
when the coverage condition of the first target operator is within a third preset range, keeping accessing to the first target operator in the second path; or
And when the coverage condition of the first target operator is not within the third preset range, accessing the third target operator in the second path.
11. An apparatus for accessing an operator, the apparatus comprising:
an obtaining unit, configured to obtain first operator coverage information, where the first operator coverage information includes information of a coverage situation of at least one operator in a first path;
the processing unit is used for selecting a first target operator according to the first operator coverage information;
the processing unit is further configured to access the first target operator in the first path.
12. A computer device comprising a memory and a processor, the memory storing a computer program, characterized in that the processor realizes the steps of the method of any one of claims 1 to 10 when executing the computer program.
13. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the method of any one of claims 1 to 10.
14. A computer program product comprising a computer program, characterized in that the computer program realizes the steps of the method of any one of claims 1 to 10 when executed by a processor.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210597829.9A CN114885399B (en) | 2022-05-30 | 2022-05-30 | Method, device, computer equipment and storage medium for accessing operator |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210597829.9A CN114885399B (en) | 2022-05-30 | 2022-05-30 | Method, device, computer equipment and storage medium for accessing operator |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114885399A true CN114885399A (en) | 2022-08-09 |
| CN114885399B CN114885399B (en) | 2024-07-09 |
Family
ID=82679752
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210597829.9A Active CN114885399B (en) | 2022-05-30 | 2022-05-30 | Method, device, computer equipment and storage medium for accessing operator |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114885399B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105813086A (en) * | 2016-05-31 | 2016-07-27 | 宇龙计算机通信科技(深圳)有限公司 | Method and system for target network coverage detection |
| CN107484213A (en) * | 2017-08-25 | 2017-12-15 | 歌尔科技有限公司 | Method for switching network, intelligent terminal and server based on ESIM cards |
| CN108322908A (en) * | 2018-02-05 | 2018-07-24 | 深圳市有方科技股份有限公司 | A kind of base station search method and terminal |
| CN110913440A (en) * | 2019-10-29 | 2020-03-24 | 深圳市有方科技股份有限公司 | Terminal module and method for selecting target operator in weak network scene |
| CN113179530A (en) * | 2021-05-25 | 2021-07-27 | 中国联合网络通信集团有限公司 | Network optimization method and device and electronic equipment |
| CN113840346A (en) * | 2021-11-23 | 2021-12-24 | 荣耀终端有限公司 | Operator switching method and related equipment |
-
2022
- 2022-05-30 CN CN202210597829.9A patent/CN114885399B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105813086A (en) * | 2016-05-31 | 2016-07-27 | 宇龙计算机通信科技(深圳)有限公司 | Method and system for target network coverage detection |
| CN107484213A (en) * | 2017-08-25 | 2017-12-15 | 歌尔科技有限公司 | Method for switching network, intelligent terminal and server based on ESIM cards |
| CN108322908A (en) * | 2018-02-05 | 2018-07-24 | 深圳市有方科技股份有限公司 | A kind of base station search method and terminal |
| CN110913440A (en) * | 2019-10-29 | 2020-03-24 | 深圳市有方科技股份有限公司 | Terminal module and method for selecting target operator in weak network scene |
| CN113179530A (en) * | 2021-05-25 | 2021-07-27 | 中国联合网络通信集团有限公司 | Network optimization method and device and electronic equipment |
| CN113840346A (en) * | 2021-11-23 | 2021-12-24 | 荣耀终端有限公司 | Operator switching method and related equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114885399B (en) | 2024-07-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100507450C (en) | Navigation apparatus and server apparatus | |
| CN108154253B (en) | Travel mode recommendation method and device | |
| CN104864879A (en) | Navigation path planning method and device | |
| TW201330667A (en) | Using predictive technology to intelligently choose communication | |
| CN104344833A (en) | A vehicle navigation method, a device and a system | |
| JP2020056739A (en) | Route search device and computer program | |
| CN106687766A (en) | Route searching system, route searching method, and computer program | |
| CN107367287B (en) | Method and system for selectively allowing a moving user device to utilize digital content associated with a front entity | |
| JP2009093384A (en) | Poi search system, route search server and poi search method | |
| KR20230029993A (en) | Path determination method and apparatus, device, and medium | |
| US10791417B1 (en) | Low-fuel indicator enablement based on fuel station locations | |
| CN108779987A (en) | Communication terminal, server unit, route search system and computer program | |
| JP2008065396A (en) | Demand forecasting display method, demand forecasting display system, radio terminal and program | |
| JP2016212056A (en) | Notification system, server device, communication terminal device, program, and notification method | |
| CN110572770B (en) | High-speed rail mobile network user positioning method and system | |
| CN109658683A (en) | Transport services type selection method and device | |
| US20210116260A1 (en) | Information processing apparatus, information processing method, information processing system, and non-transitory storage medium storing program | |
| KR100695346B1 (en) | Navigation method using realtime traffic information of satellite DMB | |
| CN114885399B (en) | Method, device, computer equipment and storage medium for accessing operator | |
| JP5433712B2 (en) | Terminal device, method, program, and facility information display system | |
| US20240027197A1 (en) | Method and apparatus for performing multi path search | |
| JP5773202B2 (en) | Navigation system, navigation program, and navigation method | |
| JP6563682B2 (en) | Route search system, route search method and computer program | |
| JP2004012268A (en) | Information processor, and program and method for processing information | |
| CN108269396A (en) | Traffic Information processing method and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |