CN105606111A - Navigation system based on communication resource distribution - Google Patents
Navigation system based on communication resource distribution Download PDFInfo
- Publication number
- CN105606111A CN105606111A CN201510979378.5A CN201510979378A CN105606111A CN 105606111 A CN105606111 A CN 105606111A CN 201510979378 A CN201510979378 A CN 201510979378A CN 105606111 A CN105606111 A CN 105606111A
- Authority
- CN
- China
- Prior art keywords
- route
- communication resource
- base station
- availability
- destination
- 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
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3453—Special cost functions, i.e. other than distance or default speed limit of road segments
- G01C21/3484—Personalized, e.g. from learned user behaviour or user-defined profiles
Abstract
The invention discloses a navigation system based on communication resource distribution. The navigation system is characterized in that all possible routes between two places are collected based on a departure place and a destination which are set, and the base station distribution condition of each route is calculated; the number of communication resources on each route is estimated based on the base station distribution condition, and the online user distribution condition at this moment is calculated by the density of online mobile equipment or other similar equipment information, accordingly, the availability degree of the communication resources on each route is calculated, then the routes are classified based on the availability degree of the communication resources, a travel route selection list is established for selection by users, and the users select corresponding travel routes according to specific requirements. The navigation system improves the work efficiency and saves time for the users.
Description
Technical field
The present invention relates to communication technical field, specifically describe a kind of navigation system distributing based on the communication resource.
Background technology
Now, mobile communication equipment is very general, and for most people, it has become a powerful business assistant,Especially the user of intercity commute, they need process in time company affair and attend various meetings. But be not everyOnce travelling can both be smoothly, starts or before deadline of company affair, due to various unforeseen situations in meetingThey can stop over (for example traffic congestion or airliner delay) on the road, and this will bring irremediable loss to company and individual.For example, so online trade becomes an inevitable choice (Email, the network teleconference) for businessperson.
But, no matter be 3G or 4G network, always communication network bandwidth is limited for mobile device. The people who accesses networkMore, the obtainable bandwidth that is in the same localities is just fewer. In order to ensure continuation and the instantaneity of issued transaction, mobile deviceHolder must find which bar route in stroke to have the sufficient communication resource.
Unfortunately, common Vehicular navigation system just selects some simple rules to carry out the route of filtered recommendation at present, as shortest pathLine or the no highway etc. that comprises.
According to above analysis, based on the availability of the communication resource, the present invention proposes a path commending system and provide road for userLine suggestion. User can select abundant communication resource path, can increase work efficiency like this, for user saves time greatly.
Summary of the invention
The object of this invention is to provide a kind of navigation system distributing based on the communication resource, by this system can be in travellingUser abundant communication resource path is provided, can increase work efficiency like this, for user saves time greatly.
For achieving the above object, technical scheme of the present invention is:
The present invention proposes a kind of navigation system distributing based on the communication resource, according to departure place and the destination set, collectAll possible route between two places, and the base station distribution situation of adding up each route. Estimate according to base station distribution situationGo out the quantity of each line traffic resource, then calculate now and exist by online mobile device density or other similar devices informationLine user distribution situation, thus calculate the level of availability of every route communication resource, then according to the availability of the communication resourceDegree is classified these routes, constructs the list of walking along the street line options and selects for user, and user selects corresponding according to specific needsPath trip.
Drive route of the present invention is recommended schematic diagram as shown in Figure 1;
As shown in Figure 2, its concrete steps are as follows for drive route recommended flowsheet figure of the present invention:
1. collect likely circuit of institute
Described likely circuit of collection institute, in the time being provided with starting point A and destination B, collects all from the beginning of A point and BThe potential route that point finishes. And utilize the characteristic points such as crosspoint on map, crossroad, representative building that these routes are dividedFor several sections.
2. communication resource level of availability is calculated
For the above-mentioned likely circuit of institute of collecting, the base station distribution situation of adding up each route. According to base station distribution situationEstimate the quantity of each line traffic resource, then calculate this by online mobile device density or other similar devices informationTime online user distribution situation, thereby calculate the level of availability of every route communication resource.
The communication resource data that can obtain various piece according to base station distribution, the maximum bandwidth of each base station is defined as Bm,The route of each part, can obtain band fat vector a: B_m={B_m1, B_m2, B_m3 ... B_mn}, bandwidth byThe data that subscriber equipment takies can obtain from base station inquiry, are set to: B_o={B_o1, B_o2, B_o3 ... B_on}, then meterThe available bandwidth of calculating each base station, is defined as: B_a={B_a1, B_a2, B_a3 ... B_an}, wherein, B_ai=B_mi-B_oi,Then the communication resource level of availability that defines each part route is: D_a=Min (B_ai).
The subscriber equipment quantity of considering each section is dynamic change, when user some sections of having travelled, enters the next oneBefore section, all to recalculate and upgrade Da, and filter out with destination path and differ increasing path, then againCalculate the shortest path of the maximum bandwidth from this to destination.
3. circuit recommendation
Described provide route suggestion for according to the level of availability of the communication resource by the way sort of collecting, select row as userTable. After the level of availability of the communication resource is calculated, route map has just become the topological diagram with weighted value; Route selection problem justBe converted at topological diagram and find out the shortest path with wide bandwidth. So adopting the shortest-the widest routing algorithm finds out from A to BWide bandwidth. Most popular be exactly improve after dijkstra's algorithm [1]. Detailed route discovery procedure is as follows.
First source node is set is S, and destination node is T,
Input: network G, source node S and destination node t
Output: there is the S of maximum bandwidth to the path of t
(1) each the node v in G have P[v]=0; B[v]=-∞ };
(2)B[s]＝+∞；
(3) each w adjacent with S have P[w]=s; B[w]=b ([s, w]); W is added on F; }
(4) repeat
From F, remove maximum B[u] node u
Each w adjacent with u has
Situation 1.B[w]=-∞: P[w] and=u:B[w]=min{B[u], b ([u, w]) }; W is added on F; }
Situation 2. (w is in F) and B[w] < min{B[u], b ([u, w]) }:
{P[w]＝u；B[w]＝min{B[u]，b([u,w])}}
Until B[t] ≠-∞ and t be in F.
The present invention proposes an air navigation aid distributing based on the communication resource, in the time that people go on a journey needs navigation, system baseProvide list of routes to be provided with selecting in communication resource availability, help people to find the shortest path of maximum bandwidth. Can greatly carryHigh user's operating efficiency, saves time, and this will be subject to the people's who has to work in travelling welcome.
Brief description of the drawings
Fig. 1 is for recommending drive route schematic diagram;
Fig. 2 is for recommending drive route flow chart;
Fig. 3 is that route is divided and network switch schematic diagram;
Fig. 4 is a topological structure line map example.
Detailed description of the invention
Below in conjunction with specific embodiment, the present invention is illustrated further.
The navigation system distributing based on the communication resource, is characterized in that: according to departure place and the destination set, collectAll possible route between two places, and the base station distribution situation of adding up each route. Estimate according to base station distribution situationGo out the quantity of each line traffic resource, then calculate now and exist by online mobile device density or other similar devices informationLine user distribution situation, thus calculate the level of availability of every route communication resource, then according to the availability of the communication resourceDegree is classified these routes, constructs the list of walking along the street line options and selects for user, and user selects corresponding according to specific needsPath trip.
1) collect likely circuit of institute
Described likely circuit of collection institute, in the time being provided with starting point A and destination B, collects all from the beginning of A point and BThe potential route that point finishes. And utilize the characteristic points such as crosspoint on map, crossroad, representative building that these routes are dividedFor several sections.
2) communication resource level of availability is calculated
For the above-mentioned likely circuit of institute of collecting, the base station distribution situation of adding up each route. According to base station distribution situationEstimate the quantity of each line traffic resource, then calculate this by online mobile device density or other similar devices informationTime online user distribution situation, thereby calculate the level of availability of every route communication resource.
The communication resource data that can obtain various piece according to base station distribution, the maximum bandwidth of each base station is defined as Bm,The route of each part, can obtain band fat vector a: B_m={B_m1, B_m2, B_m3 ... B_mn}, bandwidth byThe data that subscriber equipment takies can obtain from base station inquiry, are set to: B_o={B_o1, B_o2, B_o3 ... B_on}, then meterThe available bandwidth of calculating each base station, is defined as: B_a={B_a1, B_a2, B_a3 ... B_an}, wherein, B_ai=B_mi-B_oi,Then the communication resource level of availability that defines each part route is: D_a=Min (B_ai).
The subscriber equipment quantity of considering each section is dynamic change, when user some sections of having travelled, enters the next oneBefore section, all to recalculate and upgrade Da, and filter out with destination path and differ increasing path, then againCalculate the shortest path of the maximum bandwidth from this to destination.
3) circuit recommendation
Described provide route suggestion for according to the level of availability of the communication resource by the way sort of collecting, select row as userTable. After the level of availability of the communication resource is calculated, route map has just become the topological diagram with weighted value; Route selection problem justBe converted at topological diagram and find out the shortest path with wide bandwidth. So adopting the shortest-the widest routing algorithm finds out from A to BWide bandwidth. Most popular be exactly improve after dijkstra's algorithm [1]. Detailed route discovery procedure is as follows.
First source node is set is S, and destination node is T,
Input: network G, source node S and destination node t
Output: there is the S of maximum bandwidth to the path of t
(1) each the node v in G have P[v]=0; B[v]=-∞ };
(2)B[s]＝+∞；
(3) each w adjacent with S have P[w]=s; B[w]=b ([s, w]); W is added on F; }
(4) repeat
From F, remove maximum B[u] node u
Each w adjacent with u has
Situation 1.B[w]=-∞: P[w] and=u:B[w]=min{B[u], b ([u, w]) }; W is added on F; }
Situation 2. (w is in F) and B[w] < min{B[u], b ([u, w]) }:
{P[w]＝u；B[w]＝min{B[u]，b([u,w])}}
Until B[t] ≠-∞ and t be in F
Technical scheme of the present invention is not limited to the restriction of above-mentioned specific embodiment, the skill that every technical scheme according to the present invention is madeArt distortion, within all falling into protection scope of the present invention.
Claims (2)
1. the navigation system distributing based on the communication resource, is characterized in that: according to departure place and the destination set, receiveCollect all possible route between two places, and the base station distribution situation of adding up each route; Estimate according to base station distribution situationCalculate the quantity of each line traffic resource, then calculate now by online mobile device density or other similar devices informationOnline user's distribution situation, thus calculate the level of availability of every route communication resource, then available according to the communication resourceProperty degree these routes are classified, construct the list of walking along the street line options for user select, user selects phase according to specific needsThe path trip of answering.
2. the navigation system distributing based on the communication resource according to claim 1, is characterized in that:
1) collect likely circuit of institute
Described likely circuit of collection institute, in the time being provided with starting point A and destination B, collects all from the beginning of A point and BThe potential route that point finishes, and utilize the characteristic points such as crosspoint on map, crossroad, representative building that these routes are dividedFor several sections;
2) communication resource level of availability is calculated
For the above-mentioned likely circuit of institute of collecting, the base station distribution situation of adding up each route; According to base station distribution situationEstimate the quantity of each line traffic resource, then calculate this by online mobile device density or other similar devices informationTime online user distribution situation, thereby calculate the level of availability of every route communication resource;
The communication resource data that can obtain various piece according to base station distribution, the maximum bandwidth of each base station is defined as Bm,The route of each part, can obtain band fat vector a: B_m={B_m1, B_m2, B_m3 ... B_mn}, bandwidth byThe data that subscriber equipment takies can obtain from base station inquiry, are set to: B_o={B_o1, B_o2, B_o3 ... B_on}, then meterThe available bandwidth of calculating each base station, is defined as: B_a={B_a1, B_a2, B_a3 ... B_an}, wherein, B_ai=B_mi-B_oi,Then the communication resource level of availability that defines each part route is: D_a=Min (B_ai);
The subscriber equipment quantity of considering each section is dynamic change, when user some sections of having travelled, enters the next oneBefore section, all to recalculate and upgrade Da, and filter out with destination path and differ increasing path, then againCalculate the shortest path of the maximum bandwidth from this to destination;
3) circuit recommendation
Described provide route suggestion for according to the level of availability of the communication resource by the way sort of collecting, select row as userTable; After the level of availability of the communication resource is calculated, route map has just become the topological diagram with weighted value; Route selection problem justBe converted at topological diagram and find out the shortest path with wide bandwidth, so adopt the shortest-the widest routing algorithm to find out from A to BWide bandwidth, most popular is exactly dijkstra's algorithm after improving, detailed route discovery procedure is as follows:
First source node is set is S, and destination node is T,
Input: network G, source node S and destination node t,
Output: there is the S of maximum bandwidth to the path of t;
(1) each the node v in G have P[v]=0; B[v]=-∞ };
(2)B[s]＝+∞；
(3) each w adjacent with S have P[w]=s; B[w]=b ([s, w]); W is added on F; }
(4) repeat;
From F, remove maximum B[u] node u;
Each w adjacent with u has:
Situation 1.B[w]=-∞: P[w] and=u:B[w]=min{B[u], b ([u, w]) }; W is added on F; }
Situation 2. (w is in F) and B[w] < min{B[u], b ([u, w]) }:
{P[w]＝u；B[w]＝min{B[u]，b([u,w])}}
Until B[t] ≠-∞ and t be in F.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510979378.5A CN105606111A (en) | 2015-12-23 | 2015-12-23 | Navigation system based on communication resource distribution |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510979378.5A CN105606111A (en) | 2015-12-23 | 2015-12-23 | Navigation system based on communication resource distribution |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105606111A true CN105606111A (en) | 2016-05-25 |
Family
ID=55986240
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510979378.5A Pending CN105606111A (en) | 2015-12-23 | 2015-12-23 | Navigation system based on communication resource distribution |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105606111A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111279633A (en) * | 2017-10-27 | 2020-06-12 | 日本电气株式会社 | Resource allocation apparatus and resource allocation method |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2149032A1 (en) * | 2007-05-23 | 2010-02-03 | Nokia Corporation | Method, apparatus and computer program product for a social route planner |
| US8311741B1 (en) * | 2011-11-04 | 2012-11-13 | Google Inc. | Method and system for generating travel routes based on wireless coverage |
| CN103245347A (en) * | 2012-02-13 | 2013-08-14 | 腾讯科技（深圳）有限公司 | Intelligent navigation method and system based on road condition prediction |
| CN103512581A (en) * | 2012-06-28 | 2014-01-15 | 北京搜狗科技发展有限公司 | Path planning method and device |
| CN105009182A (en) * | 2013-03-06 | 2015-10-28 | 高通股份有限公司 | Methods for providing navigation route based on network availability and device attributes |
-
2015
- 2015-12-23 CN CN201510979378.5A patent/CN105606111A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2149032A1 (en) * | 2007-05-23 | 2010-02-03 | Nokia Corporation | Method, apparatus and computer program product for a social route planner |
| US8311741B1 (en) * | 2011-11-04 | 2012-11-13 | Google Inc. | Method and system for generating travel routes based on wireless coverage |
| CN103245347A (en) * | 2012-02-13 | 2013-08-14 | 腾讯科技（深圳）有限公司 | Intelligent navigation method and system based on road condition prediction |
| CN103512581A (en) * | 2012-06-28 | 2014-01-15 | 北京搜狗科技发展有限公司 | Path planning method and device |
| CN105009182A (en) * | 2013-03-06 | 2015-10-28 | 高通股份有限公司 | Methods for providing navigation route based on network availability and device attributes |
Non-Patent Citations (1)
| Title |
|---|
| 陈建二，等，: "关于实际构造最大带宽路径算法的研究", 《计算机学报》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111279633A (en) * | 2017-10-27 | 2020-06-12 | 日本电气株式会社 | Resource allocation apparatus and resource allocation method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110648022B (en) | Community public transportation network and departure frequency synchronous optimization method of connection subways considering full coverage of stations | |
| CN105096622B (en) | A kind of dynamic route guidance method communicated based on bus or train route | |
| De Bona et al. | Analysis of public bus transportation of a Brazilian city based on the theory of complex networks using the P-space | |
| CN109344529A (en) | A kind of customization public bus network design method based on two-phase heuristic algorithm | |
| CN105844362B (en) | Urban traffic comprehensive trip decision-making device | |
| CN111310077B (en) | Passenger intelligent journey recommendation system and method | |
| CN104637328B (en) | Distributed real-time navigation method based on RSU in a kind of vehicle self-organizing network | |
| CN107238393A (en) | It is a kind of to be gone on a journey Intelligent planning method based on shared economic personnel | |
| CN106643771A (en) | Navigation route selection method and system | |
| CN105489043A (en) | Real-time path planning method based on vehicular ad-hoc network | |
| US9074904B1 (en) | Method for solving carpool matching problem and carpool server using the same | |
| CN101441817A (en) | Vehicle navigation method based on dynamic traffic information of multiple information sources | |
| Leung et al. | Intra-city urban network and traffic flow analysis from GPS mobility trace | |
| CN107092986B (en) | Bus passenger travel path selection method based on stations and collinear operation | |
| CN104658297A (en) | Central type dynamic path inducing method based on Sarsa learning | |
| CN109642800A (en) | Route searching method and route searching device | |
| CN106781556A (en) | A kind of traffic lights duration determination methods suitable for vehicle-mounted short distance communication network | |
| CN102346042A (en) | Real time road condition based route planning method and service equipment thereof | |
| CN102346041A (en) | Route planning method and service equipment based on real-time road condition | |
| CN109816979A (en) | Consider bus arrival frequency and by bus the public bus network recommended method of comfort level | |
| CN109360420B (en) | Public traffic big data processing system and method | |
| CN107103169A (en) | It is a kind of to be used to meet the transportation network equilibrium calculation method that trip continuation of the journey is required | |
| CN104990559A (en) | Route recommending method based on taxi empirical data, system and client | |
| Manna et al. | Online stochastic planning for taxi and ridesharing | |
| CN107677277A (en) | A kind of determining method of path based on dijkstra's algorithm |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20160525 |
|
| RJ01 | Rejection of invention patent application after publication |