CN107808432A - A kind of shared bicycle method for unlocking based on DV Hop algorithms - Google Patents

A kind of shared bicycle method for unlocking based on DV Hop algorithms Download PDF

Info

Publication number
CN107808432A
CN107808432A CN201710785301.3A CN201710785301A CN107808432A CN 107808432 A CN107808432 A CN 107808432A CN 201710785301 A CN201710785301 A CN 201710785301A CN 107808432 A CN107808432 A CN 107808432A
Authority
CN
China
Prior art keywords
mrow
msub
hop
anchor node
node
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201710785301.3A
Other languages
Chinese (zh)
Inventor
龙华
吴睿
邵玉斌
杜庆治
熊新
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Kunming University of Science and Technology
Original Assignee
Kunming University of Science and Technology
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Kunming University of Science and Technology filed Critical Kunming University of Science and Technology
Priority to CN201710785301.3A priority Critical patent/CN107808432A/en
Publication of CN107808432A publication Critical patent/CN107808432A/en
Pending legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G07—CHECKING-DEVICES
    • G07C—TIME OR ATTENDANCE REGISTERS; REGISTERING OR INDICATING THE WORKING OF MACHINES; GENERATING RANDOM NUMBERS; VOTING OR LOTTERY APPARATUS; ARRANGEMENTS, SYSTEMS OR APPARATUS FOR CHECKING NOT PROVIDED FOR ELSEWHERE
    • G07C9/00—Individual registration on entry or exit
    • G07C9/00174—Electronically operated locks; Circuits therefor; Nonmechanical keys therefor, e.g. passive or active electrical keys or other data carriers without mechanical keys
    • G07C9/00309—Electronically operated locks; Circuits therefor; Nonmechanical keys therefor, e.g. passive or active electrical keys or other data carriers without mechanical keys operated with bidirectional data transmission between data carrier and locks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/02—Services making use of location information
    • H04W4/023—Services making use of location information using mutual or relative location information between multiple location based services [LBS] targets or of distance thresholds

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The present invention relates to a kind of shared bicycle method for unlocking based on DV Hop algorithms, belong to shared technical field of transportation means.The present invention innovatively refer to DV Hop algorithms and the unlocking mode for sharing bicycle be improved.Regard the shared bicycle of a designated area as unknown node first；Then 20% anchor node of shared bicycle total quantity is evenly arranged to this region, the position of the shared bicycle to be unlocked is obtained using DV Hop algorithms；The position of mobile phone is obtained finally by GPS location, obtains the distance of shared bicycle and mobile phone；If the distance of shared bicycle and mobile phone is less than 1m, it can unlock, otherwise not unlock.The present invention compared with prior art, mainly solves and works as the phenomenon that shared bicycle caused by shared bicycle inputs the input error that its coding unlocking occurs is lost, be directed to preventing shared bicycle loss, protect public property.

Description

A kind of shared bicycle method for unlocking based on DV-Hop algorithms
Technical field
The present invention relates to a kind of shared bicycle method for unlocking based on DV-Hop algorithms, belongs to shared technology of transportation vehicle neck Domain.
Background technology
Modern society, the trip of people generally be unable to do without the vehicles, and the utilization rate more and more higher of shared bicycle, because It is it while bringing convenient, decreases carbon emission amount.
In actual life, the numbering that the unlocking mode of shared bicycle has the shared bicycle of input is unlocked, but inputs numbering Unlocking sometimes can cause to have held shared bicycle elsewhere because of inputing by mistake, so as to result in the loss of shared bicycle, make Into the loss of public property.
The content of the invention
The technical problem to be solved in the present invention is the limitation and deficiency for prior art, there is provided one kind is calculated based on DV-Hop The shared bicycle method for unlocking of method, it innovatively refer to DV-Hop algorithms and the unlocking mode for sharing bicycle be improved, with Solve to work as the phenomenon that shared bicycle caused by shared bicycle inputs the input error that its coding unlocking occurs is lost, be directed to preventing Shared bicycle is lost, and protects public property.
The technical scheme is that：A kind of shared bicycle method for unlocking based on DV-Hop algorithms, is concretely comprised the following steps：
(1) the shared bicycle of a designated area is regarded as unknown node, each shared bicycle is all one unknown Node；
(2) 20% anchor node of the district-share bicycle total quantity, each anchor node i are evenly arranged to designated area By bootstrap information bag of the Web broadcast containing its own ID, coordinate and the hop-count value for being initialized as 0, in unknown node When once receiving anchor node broadcast, each recipient node records anchor node i position and just remembers hop count hop in the tablei, Hop count hop is remembered accordingly for each anchor nodei, a lower note hop count is included in same anchor node information when receiving When, remember hop count hopiIt will update, all unknown nodes all obtain anchor node coordinate and to each anchor node in network Most short biography hop count；
(3) after anchor node i acquires the minimum hop count of other anchor nodes, averagely each hop distance is calculated hopsizei；
(4) after hopsize is calculated, among hopsize is broadcast to whole network by anchor node i, unknown node receives The hopsize of each anchor node, the hopsize of nearest anchor node is selected as Average hop distance, each unknown section Point j calculates its own to the distance between each anchor node i dij；
(5) hop count threshold values is set, and screening influences maximum anchor node on unknown node；
(6) unknown node calculates theirs according to the coordinate and range information of the anchor node after screening using least square method Position；
(7) positional information of mobile phone is obtained by GPS positioning technology, the position of the unknown node obtained in conjunction with step (6) Confidence ceases, and calculates the distance S of mobile phone and shared bicycle, if distance S is less than 1m, unlocks, otherwise do not unlock.
Average each hop distance hopsize is calculated in the step (3)iFormula be：
Wherein, N is the total quantity of anchor node, hopsizeijIt is the hop count between anchor node i and j, (xi,yi) and (xj,yj) it is the respective coordinate of anchor node i and j.
Each unknown node j calculates its own to the distance between each anchor node i d in the step (4)ijPublic affairs Formula is：dij=hopsizei×hopij。
Screening influences maximum anchor node on unknown node in the step (5), meets the reservation of hop count threshold values, otherwise gives up Abandon.
According to the coordinate of anchor node and apart from the formula that unknown node is calculated using least square method in the step (6) For：
Wherein, (xk,yk) be unknown node k coordinate, dkiIt is the distance between unknown node k and anchor node i.
Because there is quadratic term, the equation proposed is nonlinear.In order that whole equation group becomes linear, it is used N-1 preceding equation subtracts last equation, as a result can be written as being write as AX=B form again.A, B and X formula are such as Under：
The formula that the position of unknown node is estimated according to least square method in the step (6) is：
The formula of calculating mobile phone and the distance S of shared bicycle is in the step (7)：
Wherein, (xm,ym) be mobile phone position.
The beneficial effects of the invention are as follows：DV-Hop algorithms are innovatively refer to change the unlocking mode for sharing bicycle Enter.Compared with prior art, solve and share bicycle caused by shared bicycle inputs the input error of its coding unlocking appearance The phenomenon of loss, it is directed to preventing shared bicycle from losing, protects public property.
Brief description of the drawings
Fig. 1 is steps flow chart schematic diagram of the present invention；
Fig. 2 is step of the present invention (2)~(6) schematic flow sheet.
Embodiment
With reference to the accompanying drawings and detailed description, the invention will be further described.
Embodiment 1：As shown in Figure 1-2, a kind of shared bicycle method for unlocking based on DV-Hop algorithms, specifically not step For：
(1) the shared bicycle of a designated area is regarded as unknown node, each shared bicycle is all one unknown Node；
(2) 20% anchor node of the district-share bicycle total quantity, each anchor node i are evenly arranged to designated area By bootstrap information bag of the Web broadcast containing its own ID, coordinate and the hop-count value for being initialized as 0, in unknown node When once receiving anchor node broadcast, each recipient node records anchor node i position and just remembers hop count hop in the tablei, Hop count hop is remembered accordingly for each anchor nodei, a lower note hop count is included in same anchor node information when receiving When, remember hop count hopiIt will update, all unknown nodes all obtain anchor node coordinate and to each anchor node in network Most short biography hop count；
(3) after anchor node i acquires the minimum hop count of other anchor nodes, averagely each hop distance is calculated hopsizei；
(4) after hopsize is calculated, among hopsize is broadcast to whole network by anchor node i, unknown node receives The hopsize of each anchor node, the hopsize of nearest anchor node is selected as Average hop distance, each unknown section Point j calculates its own to the distance between each anchor node i dij；
(5) hop count threshold values is set, and screening influences maximum anchor node on unknown node；
(6) unknown node calculates theirs according to the coordinate and range information of the anchor node after screening using least square method Position；
(7) positional information of mobile phone is obtained by GPS positioning technology, the position of the unknown node obtained in conjunction with step (6) Confidence ceases, and calculates the distance S of mobile phone and shared bicycle, if distance S is less than 1m, unlocks, otherwise do not unlock.
Average each hop distance hopsize is calculated in the step (3)iFormula be：
Wherein, N is the total quantity of anchor node, hopsizeijIt is the hop count between anchor node i and j, (xi,yi) and (xj,yj) it is the respective coordinate of anchor node i and j.
Each unknown node j calculates its own to the distance between each anchor node i d in the step (4)ijPublic affairs Formula is：dij=hopsizei×hopij。
Screening influences maximum anchor node on unknown node in the step (5), meets the reservation of hop count threshold values, otherwise gives up Abandon.
According to the coordinate of anchor node and apart from the formula that unknown node is calculated using least square method in the step (6) For：
Wherein, (xk,yk) be unknown node k coordinate, dkiIt is the distance between unknown node k and anchor node i.
The formula of calculating mobile phone and the distance S of shared bicycle is in the step (7)：
Wherein, (xm,ym) be mobile phone position.
Above in association with accompanying drawing to the present invention embodiment be explained in detail, but the present invention be not limited to it is above-mentioned Embodiment, can also be before present inventive concept not be departed from those of ordinary skill in the art's possessed knowledge Put that various changes can be made.

Claims (6)

  1. A kind of 1. shared bicycle method for unlocking based on DV-Hop algorithms, it is characterised in that：
    (1) the shared bicycle of a designated area is regarded as unknown node, each shared bicycle is all a unknown node；
    (2) 20% anchor node of the district-share bicycle total quantity is evenly arranged to designated area, each anchor node i passes through Bootstrap information bag, coordinate and the hop-count value that is initialized as 0 of the Web broadcast containing its own ID, in unknown node for the first time When receiving anchor node broadcast, each recipient node records anchor node i position and just remembers hop count hop in the tablei, for Each anchor node remembers hop count hop accordinglyi, when receive include a lower note hop count in same anchor node information when, note Hop count hopiIt will update, all unknown nodes all obtain anchor node coordinate and the most short biography to each anchor node in network Hop count；
    (3) after anchor node i acquires the minimum hop count of other anchor nodes, averagely each hop distance hopsize is calculatedi；
    (4) after hopsize is calculated, among hopsize is broadcast to whole network by anchor node i, unknown node receives each The hopsize of individual anchor node, the hopsize of nearest anchor node is selected as Average hop distance, each unknown node j meters Its own is calculated to the distance between each anchor node i dij；
    (5) hop count threshold values is set, and screening influences maximum anchor node on unknown node；
    (6) unknown node calculates their position using least square method according to the coordinate and range information of the anchor node after screening Put；
    (7) positional information of mobile phone is obtained by GPS positioning technology, the position letter of the unknown node obtained in conjunction with step (6) Breath, the distance S of mobile phone and shared bicycle is calculated, if distance S is less than 1m, unlocks, does not otherwise unlock.
  2. 2. the shared bicycle method for unlocking according to claim 1 based on DV-Hop algorithms, it is characterised in that：The step (3) average each hop distance hopsize is calculated iniFormula be：
    <mrow> <msub> <mi>hopsize</mi> <mi>i</mi> </msub> <mo>=</mo> <mfrac> <mrow> <munderover> <mo>&amp;Sigma;</mo> <mrow> <mi>j</mi> <mo>=</mo> <mn>1</mn> <mo>,</mo> <mi>i</mi> <mo>&amp;NotEqual;</mo> <mi>j</mi> </mrow> <mi>N</mi> </munderover> <msqrt> <mrow> <msup> <mrow> <mo>(</mo> <msub> <mi>x</mi> <mi>i</mi> </msub> <mo>-</mo> <msub> <mi>x</mi> <mi>j</mi> </msub> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mo>+</mo> <msup> <mrow> <mo>(</mo> <msub> <mi>y</mi> <mi>i</mi> </msub> <mo>-</mo> <msub> <mi>y</mi> <mi>j</mi> </msub> <mo>)</mo> </mrow> <mn>2</mn> </msup> </mrow> </msqrt> </mrow> <mrow> <munderover> <mo>&amp;Sigma;</mo> <mrow> <mi>j</mi> <mo>=</mo> <mn>1</mn> <mo>,</mo> <mi>i</mi> <mo>&amp;NotEqual;</mo> <mi>j</mi> </mrow> <mi>N</mi> </munderover> <msub> <mi>hop</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> </mrow> </mfrac> </mrow>
    Wherein, N is the total quantity of anchor node, hopsizeijIt is the hop count between anchor node i and j, (xi,yi) and (xj,yj) For the respective coordinate of anchor node i and j.
  3. 3. the shared bicycle method for unlocking according to claim 1 based on DV-Hop algorithms, it is characterised in that：The step (4) each unknown node j calculates its own to the distance between each anchor node i d inijFormula be：dij= hopsizei×hopij。
  4. 4. the shared bicycle method for unlocking according to claim 1 based on DV-Hop algorithms, it is characterised in that：The step (5) screening influences maximum anchor node on unknown node in, meets the reservation of hop count threshold values, otherwise gives up.
  5. 5. the shared bicycle method for unlocking according to claim 1 based on DV-Hop algorithms, it is characterised in that：The step (6) it is according to the coordinate of anchor node and apart from the formula using least square method calculating unknown node in：
    <mfenced open = "{" close = ""> <mtable> <mtr> <mtd> <mrow> <msup> <mrow> <mo>(</mo> <msub> <mi>x</mi> <mi>k</mi> </msub> <mo>-</mo> <msub> <mi>x</mi> <mn>1</mn> </msub> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mo>+</mo> <msup> <mrow> <mo>(</mo> <msub> <mi>y</mi> <mi>k</mi> </msub> <mo>-</mo> <msub> <mi>y</mi> <mn>1</mn> </msub> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mo>=</mo> <msubsup> <mi>d</mi> <mrow> <mi>k</mi> <mn>1</mn> </mrow> <mn>2</mn> </msubsup> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <msup> <mrow> <mo>(</mo> <msub> <mi>x</mi> <mi>k</mi> </msub> <mo>-</mo> <msub> <mi>x</mi> <mn>2</mn> </msub> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mo>+</mo> <msup> <mrow> <mo>(</mo> <msub> <mi>y</mi> <mi>k</mi> </msub> <mo>-</mo> <msub> <mi>y</mi> <mn>2</mn> </msub> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mo>=</mo> <msubsup> <mi>d</mi> <mrow> <mi>k</mi> <mn>2</mn> </mrow> <mn>2</mn> </msubsup> </mrow> </mtd> </mtr> <mtr> <mtd> <mo>.</mo> </mtd> </mtr> <mtr> <mtd> <mo>.</mo> </mtd> </mtr> <mtr> <mtd> <mo>.</mo> </mtd> </mtr> <mtr> <mtd> <mrow> <msup> <mrow> <mo>(</mo> <msub> <mi>x</mi> <mi>k</mi> </msub> <mo>-</mo> <msub> <mi>x</mi> <mi>N</mi> </msub> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mo>+</mo> <msup> <mrow> <mo>(</mo> <msub> <mi>y</mi> <mi>k</mi> </msub> <mo>-</mo> <msub> <mi>y</mi> <mi>N</mi> </msub> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mo>=</mo> <msubsup> <mi>d</mi> <mrow> <mi>k</mi> <mi>N</mi> </mrow> <mn>2</mn> </msubsup> </mrow> </mtd> </mtr> </mtable> </mfenced>
    Wherein, (xk,yk) be unknown node k coordinate, dkiIt is the distance between unknown node k and anchor node i.
  6. 6. the shared bicycle method for unlocking according to claim 1 based on DV-Hop algorithms, it is characterised in that：The step (7) formula of calculating mobile phone and the distance S of shared bicycle is in：
    <mrow> <mi>S</mi> <mo>=</mo> <msqrt> <mrow> <msup> <mrow> <mo>(</mo> <msub> <mi>x</mi> <mi>k</mi> </msub> <mo>-</mo> <msub> <mi>x</mi> <mi>m</mi> </msub> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mo>+</mo> <msup> <mrow> <mo>(</mo> <msub> <mi>y</mi> <mi>k</mi> </msub> <mo>-</mo> <msub> <mi>y</mi> <mi>m</mi> </msub> <mo>)</mo> </mrow> <mn>2</mn> </msup> </mrow> </msqrt> </mrow>
    Wherein, (xm,ym) be mobile phone position.
CN201710785301.3A 2017-09-04 2017-09-04 A kind of shared bicycle method for unlocking based on DV Hop algorithms Pending CN107808432A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710785301.3A CN107808432A (en) 2017-09-04 2017-09-04 A kind of shared bicycle method for unlocking based on DV Hop algorithms

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710785301.3A CN107808432A (en) 2017-09-04 2017-09-04 A kind of shared bicycle method for unlocking based on DV Hop algorithms

Publications (1)

Publication Number Publication Date
CN107808432A true CN107808432A (en) 2018-03-16

Family

ID=61569835

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710785301.3A Pending CN107808432A (en) 2017-09-04 2017-09-04 A kind of shared bicycle method for unlocking based on DV Hop algorithms

Country Status (1)

Country Link
CN (1) CN107808432A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108961585A (en) * 2018-06-26 2018-12-07 上海理工大学 A kind of two-dimensional code scanning unlocking system and method based on the correction of location coding set

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101359047A (en) * 2008-09-23 2009-02-04 西部矿业股份有限公司 Downhole wireless positioning method based on understanding
CN102497669A (en) * 2011-12-23 2012-06-13 无锡虹业自动化工程有限公司 Wireless sensor network (WSN) node positioning method
CN106341785A (en) * 2015-07-12 2017-01-18 上海明想电子科技有限公司 Improved wireless sensor DV-Hop algorithm
CN106530795A (en) * 2017-01-03 2017-03-22 上海量明科技发展有限公司 Method, device and system for responding to shared vehicle
CN106600796A (en) * 2017-01-13 2017-04-26 上海量明科技发展有限公司 Sharing transportation vehicle, and unlocking method, unlocking device and unlocking system
CN106682970A (en) * 2017-01-13 2017-05-17 上海量明科技发展有限公司 Shared transportation means opening method, client-side and system
CN106710052A (en) * 2017-01-21 2017-05-24 上海量明科技发展有限公司 Intelligent sharing vehicle, realization method of intelligent sharing vehicle, client and system

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101359047A (en) * 2008-09-23 2009-02-04 西部矿业股份有限公司 Downhole wireless positioning method based on understanding
CN102497669A (en) * 2011-12-23 2012-06-13 无锡虹业自动化工程有限公司 Wireless sensor network (WSN) node positioning method
CN106341785A (en) * 2015-07-12 2017-01-18 上海明想电子科技有限公司 Improved wireless sensor DV-Hop algorithm
CN106530795A (en) * 2017-01-03 2017-03-22 上海量明科技发展有限公司 Method, device and system for responding to shared vehicle
CN106600796A (en) * 2017-01-13 2017-04-26 上海量明科技发展有限公司 Sharing transportation vehicle, and unlocking method, unlocking device and unlocking system
CN106682970A (en) * 2017-01-13 2017-05-17 上海量明科技发展有限公司 Shared transportation means opening method, client-side and system
CN106710052A (en) * 2017-01-21 2017-05-24 上海量明科技发展有限公司 Intelligent sharing vehicle, realization method of intelligent sharing vehicle, client and system

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108961585A (en) * 2018-06-26 2018-12-07 上海理工大学 A kind of two-dimensional code scanning unlocking system and method based on the correction of location coding set

Similar Documents

Publication Publication Date Title
CN103116696B (en) Personnel based on the mobile phone location data of sparse sampling reside place recognition methods
EP2359545B1 (en) Method for providing safety mechanisms in wireless mesh networks
CN107808432A (en) A kind of shared bicycle method for unlocking based on DV Hop algorithms
CN110490381B (en) Bus trunk line planning method based on mixed integer planning
CN102740394B (en) Center calculation wireless sensor network 2-node disjoint multipath routing algorithm
CN104240042A (en) Carbon emission management system based on public bicycle system and accumulating method for carbon emission management system
CN206975822U (en) Low power consumption wireless meter reading system
CN103581922A (en) Cooperative spectrum sensing method based on multi-process D-S evidence theory
CN107070463A (en) A kind of efficient building method of polarization code
CN104618852B (en) Convergence method and system based on hierarchical clustering
Wang et al. Evolution, accessibility and dynamics of road networks in China from 1600 BC to 1900 AD
CN104301259A (en) Resource allocation method applicable to multi-hop wireless mesh network
CN104158604B (en) A kind of distributed collaborative frequency spectrum sensing method based on average common recognition
CN103701697A (en) Link-quality-based hierarchical routing method
CN105306157B (en) A kind of vehicle-carrying communication modeling method based on network-in-dialing
CN111896013A (en) Pretreatment planning method for long-distance path of truck in large-scale road network
CN105701511A (en) Adaptive spectral clustering method of extracting network node community attribute
CN107679653A (en) A kind of OD distribution methods based on advantage trip distance
CN107464084A (en) Container requirement management systems and its method
CN103501270A (en) Rapid node cluster head recommending method
Yang et al. Evaluation of urban rail transit sustainable development based on the PSR model
Shi et al. Sensor data scheduling over a packet-dropping network
CN103415021A (en) Method for allocating wireless frequencies based on satisfiability problem protocol
CN107979605A (en) A kind of safe big data network communication method
Wu et al. An automatic route selection method for shipping transportation based on heuristic algorithm

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
RJ01 Rejection of invention patent application after publication

Application publication date: 20180316

RJ01 Rejection of invention patent application after publication