Method and system for extending service of a door lock vehicle

Abstract

This invention discloses a method and system for extending parking space sharing services using door locks. The method includes: based on the pre-set multicast addresses of parking space sharing alliances for multiple owners' door locks, each door lock joins the corresponding multicast group via extended IGMP join messages; based on parking space sharing requests submitted by requesters, resource matching is triggered among the door locks in the alliance; based on the door locks in the multicast group that meet the application requirements, resource reservations are declared to the gateway via extended IGMP messages, and a unique reservation number is generated, ultimately determining the winner of providing shared parking spaces; based on the requests submitted by requesters for extended parking periods, the original shared parking space door locks are given priority in processing, and through time period splitting and recursive negotiation mechanisms, the extended time periods that cannot be covered are transformed into new sharing requests, triggering distributed negotiation and matching among other door locks in the alliance. Using this invention, decentralized parking space resource publishing and distributed negotiation can be achieved, improving the real-time performance, reliability, and system scalability of the sharing process.

Description

Technical Field

[0001] This invention belongs to the field of smart door lock technology, and in particular to a method and system for extending door lock vehicle services. Background Technology

[0002] With the continuous growth of private car ownership in cities, "parking difficulties" have become a widespread problem. Shared parking spaces can effectively utilize idle resources, but existing solutions mostly rely on centralized cloud platforms for parking space information dissemination and transaction matching. These solutions suffer from single-point-of-failure risks, high response latency, and significant transaction costs. Furthermore, traditional methods lack flexible and efficient mechanisms for parking space locking, dynamic extension of usage, and distributed negotiation, failing to support real-time, reliable direct interaction between multiple car owners. In addition, existing IP multicast-based network applications are mostly limited to audio and video distribution, failing to effectively integrate with edge devices such as IoT door locks to achieve plug-and-play resource publishing and distributed collaboration. Therefore, a decentralized, low-latency shared parking space implementation method that supports dynamic negotiation and extension is urgently needed. Summary of the Invention

[0003] The purpose of this invention is to provide a method and system for extending the vehicle door lock service, in order to overcome the shortcomings of the prior art, realize decentralized parking space resource publishing and distributed negotiation, and improve the real-time performance, reliability and system scalability of the sharing process.

[0004] One embodiment of this application provides a method for extending door lock vehicle service, the method comprising: Parking space sharing resource publication: Based on the pre-set multicast address of the parking space sharing alliance of multiple owners' door locks, each door lock joins the corresponding multicast group through an extended IGMP join message, and carries the parking space sharing publication information in the message, so that the direct connection gateway can bind the publisher identifier synchronously when establishing the multicast routing table entry; Shared parking space request initiation: Based on the parking space sharing application submitted by the requester, the Internet access box sends the application via multicast to the corresponding multicast group, triggering resource matching among the door locks in the alliance; Distributed bidding negotiation matching: Based on the door locks in the multicast group that meet the application requirements, the resource reservation is declared to the gateway through extended IGMP messages and a unique reservation number is generated. This triggers distributed bidding negotiation based on the multicast network. The gateway filters and forwards the bidding messages based on the reservation number, and finally determines the winner of providing the shared parking space. Extended shared parking time processing: Based on the extended parking time application submitted by the demander, the original shared parking space lock will process it first. Through time period splitting and recursive negotiation mechanism, the extended time period that cannot be covered will be transformed into a new shared application, triggering other locks in the alliance to conduct distributed negotiation and matching.

[0005] Optionally, the publication of the parking space sharing resources includes: Shared information configuration and writing: Based on the parking space sharing information set by the owner through the community APP, including parking space ID, shareable time period and sharing unit price, the information is written to the owner's door lock via near field communication; Extended multicast registration: Based on the parking space sharing information, the door lock generates an extended IGMP join message, wherein the extended fields include the message type "parking space sharing publish" and the publisher door lock ID; Network resource binding: Based on the extended IGMP join message sent by the door lock, when its direct-connected gateway establishes a (*, G) multicast routing table entry, it binds the parking space publisher tag and the publisher door lock ID on the interface that received the message.

[0006] Optionally, the shared parking space request initiation includes: Parking space sharing application submission: Based on the reservation time period and acceptable price range entered by the user on the community APP, a parking space sharing application message is generated; Message forwarding: Based on the parking space sharing application message, the community APP sends it unicast to the internet access box; Multicast request broadcast: Based on the parking space sharing application message, the Internet access box encapsulates it into a multicast message with the destination address being the corresponding multicast group address, and sends it via multicast within the community network.

[0007] Optionally, the distributed bidding negotiation matching includes: Local qualification verification and reservation: Based on the parking space sharing application multicast message received by the door lock, check whether its own sharing unit price is within the acceptable unit price range and whether the shareable time period covers the predetermined time period. If it meets the requirements, generate a unique reservation number based on the hash of the application content and record the parking space reservation information locally. The parking space reservation information includes the reservation number, the demander's family ID, the demander's door lock ID, and the reservation time period. Network reservation declaration: Based on the generated reservation number, the door lock sends an extended reverse IGMP join message containing the parking space reservation information to the direct-connected gateway to declare the resource reservation. The gateway records the reservation number in the corresponding (*, G) table entry. Trigger distributed price comparison: Based on the reserved door lock, a parking space sharing registration message containing the reserved number and its own shared unit price is sent via multicast, and the reservation negotiation win timer associated with the reserved number is started; Gateway Precise Filtering and Forwarding: Based on the registration messages received from other door locks, the gateway checks whether there is a reserved number in the (*, G) table entries, and forwards the registration message to the connected door lock only if it exists; Local price comparison and competition withdrawal: Based on the registration message received by the door lock, compare its own unit price with the unit price in the message. If its own unit price is higher or equal but its own door lock ID is larger, then delete the local reservation, clear the reservation negotiation win timer of the reserved number in the associated message, notify the gateway to cancel the reservation, and withdraw from the competition. Determine the winning party in the negotiation: If the timer for the winning negotiation associated with the reserved number expires, the door lock that still retains the reserved information locally is the winning party, and a confirmation message is sent to the Internet access box, which then forwards it to the relevant party's community APP.

[0008] Optionally, the shared duration extension process includes: Extended parking request trigger: Based on the request submitted by the user to extend the parking period, the Internet access box multicasts a parking space sharing extension request message, which includes the original shared parking space door lock ID and the requested extension period. Original parking space priority processing and time period splitting: Based on the extension application received by the original shared parking space door lock, determine whether its own shareable time period can completely cover the requested extension time period; if so, send a full confirmation message via multicast and update the local reservation; if not, split the requested time period into a confirmed extension time period that it can continue to provide and an extension time period to be claimed. Recursive negotiation trigger: Based on the partial confirmation message sent by the original shared parking space door lock multicast, which includes the extended period of waiting to be claimed, other door locks in the alliance automatically trigger a distributed bidding negotiation matching process for this period. Multi-round negotiation and recursive splitting: Based on the door locks that can only partially meet the demand for extended time periods during the negotiation, the remaining unmet time periods are automatically split again, and the next round of negotiation is triggered by sending a new partial confirmation message, until the time periods are fully allocated or the resources are exhausted. Segmented Confirmation and Notification: Based on the door locks provided for each time period as determined in each round of negotiations, confirmation messages are sent to the Internet access boxes. The boxes then aggregate the information and notify the relevant owners. If multiple parking spaces are involved, segmented parking arrangements will be indicated.

[0009] Optionally, the triggering of distributed price comparison employs a conflict suppression mechanism based on random delay, including: Random delayed start: Based on the door locks that have completed the resource reservation, each starts a random registration message sending delay timer within the range of 0 to the first preset time, and does not send the registration message immediately; First-to-time trigger and listening: Based on the door lock that times out first, multicast its parking space sharing registration message. The parking space sharing registration message carries the registration message sending delay timer information and starts the reservation negotiation win timer associated with the reservation number. Decision-making and withdrawal after listening: Based on the other door locks receiving the first registration message, immediately cancel its own random delay timer and compare its own unit price with the unit price in the message; if its own unit price is higher or equal, delete the local reservation, notify the gateway to cancel the reservation, withdraw from the competition, and no longer send any registration messages; Iterative convergence: Based on the existence of a lock with a lower unit price, after receiving the first message, it restarts a random delay timer within the range of 0 to a second preset duration. The second preset duration is the first preset duration minus the delay timer duration of the registration message in the first message. After the timer expires, it sends a registration message as the new first sender, repeating the comparison and exit process in the after-hearing decision and exit steps until the reservation negotiation winning timer associated with the reserved number expires, thus determining the final winner.

[0010] Another embodiment of this application provides a system for extending door lock vehicle service, the system comprising: The publishing module is used for publishing parking space sharing resources: based on the pre-set multicast address of the parking space sharing alliance of multiple owners' door locks, each door lock joins the corresponding multicast group through an extended IGMP join message, and carries the parking space sharing publishing information in the message, so that the direct-connected gateway can synchronously bind the publisher identifier when establishing the multicast routing table entry; The initiation module is used to initiate shared parking space requests: based on the parking space sharing application submitted by the requester, the Internet access box sends the application via multicast to the corresponding multicast group, triggering resource matching among the door locks in the alliance; The matching module is used for distributed bidding negotiation matching: based on each door lock in the multicast group that meets the application requirements, it declares resource reservation to the gateway through extended IGMP messages and generates a unique reservation number, and triggers distributed price comparison negotiation based on the multicast network. The gateway filters and forwards price comparison messages based on the reservation number, and finally determines the winner of providing shared parking spaces. The processing module is used for extended shared parking time processing: based on the extended parking time application submitted by the demander, the original shared parking space door lock is given priority to processing. Through time period splitting and recursive negotiation mechanism, the extended time period that cannot be covered is transformed into a new shared application, triggering other door locks in the alliance to conduct distributed negotiation and matching.

[0011] Another embodiment of this application provides a storage medium storing a computer program, wherein the computer program is configured to execute the method described in any of the preceding claims when running.

[0012] Another embodiment of this application provides an electronic device including a memory and a processor, wherein the memory stores a computer program and the processor is configured to run the computer program to perform the method described in any of the preceding claims.

[0013] Compared with existing technologies, the present invention provides a method for extending the vehicle lock service, which enables decentralized parking space resource publishing and distributed negotiation, improving the real-time performance, reliability and system scalability of the sharing process. Attached Figure Description

[0014] Figure 1 Hardware structure block diagram of a computer terminal for a method of extending door lock vehicle service provided in an embodiment of the present invention; Figure 2 A flowchart illustrating a method for extending vehicle door lock service according to an embodiment of the present invention; Figure 3 This is a schematic diagram of a system for extending door lock vehicle services provided in an embodiment of the present invention. Detailed Implementation

[0015] The embodiments described below with reference to the accompanying drawings are exemplary and are only used to explain the present invention, and should not be construed as limiting the present invention.

[0016] The community has limited surface parking spaces, and residents often find it difficult to find parking when guests arrive by car. The community property management has designed a parking space sharing system for residents. When a resident leaves their underground garage, their space becomes available and can be shared with other residents. If other residents have visitors who need parking, and the supply exceeds demand (i.e., there are more shared parking spaces available), they can apply for sharing in advance by comparing prices per space.

[0017] This invention first provides a method for extending door lock vehicle service, which can be applied to electronic devices, such as computer terminals, specifically ordinary computers.

[0018] The following detailed explanation uses a computer terminal as an example. Figure 1 This is a hardware block diagram of a computer terminal for a method of extending vehicle door lock service provided in an embodiment of the present invention. (See diagram below.) Figure 1 As shown, the computer device includes a processor, memory, and network interface connected via a system bus, wherein the memory may include non-volatile storage media and internal memory.

[0019] See Figure 2 The present invention provides a method for extending door lock vehicle service, which may include the following steps: S201, Parking space sharing resource publication: Based on the preset parking space sharing alliance multicast addresses of multiple owners' door locks, each door lock joins the corresponding multicast group via an extended IGMP join message, carrying parking space sharing publication information in the message, so that the direct-connected gateway synchronously binds the publisher identifier when establishing the multicast routing table entry; specifically, the parking space sharing resource publication includes: Shared information configuration and writing: Based on the parking space sharing information set by the owner through the community APP, including parking space ID, shareable time period and sharing unit price, the information is written to the owner's door lock via near field communication; Extended multicast registration: Based on the parking space sharing information, the door lock generates an extended IGMP join message, wherein the extended fields include the message type "parking space sharing publish" and the publisher door lock ID; Network resource binding: Based on the extended IGMP join message sent by the door lock, when its direct-connected gateway establishes a (*, G) multicast routing table entry, it binds the parking space publisher tag and the publisher door lock ID on the interface that received the message.

[0020] S202, Shared parking space request initiation: Based on the parking space sharing application submitted by the requester, the internet access box multicasts the application to the corresponding multicast group, triggering resource matching among the locks within the alliance; specifically, the shared parking space request initiation includes: Parking space sharing application submission: Based on the reservation time period and acceptable price range entered by the user on the community APP, a parking space sharing application message is generated; Message forwarding: Based on the parking space sharing application message, the community APP sends it unicast to the internet access box; Multicast request broadcast: Based on the parking space sharing application message, the Internet access box encapsulates it into a multicast message with the destination address being the corresponding multicast group address, and sends it via multicast within the community network.

[0021] S203, Distributed Bidding Negotiation Matching: Based on the locks within the multicast group that meet the application requirements, a resource reservation is declared to the gateway via an extended IGMP message, generating a unique reservation number. This triggers distributed bidding negotiation based on the multicast network. The gateway filters and forwards the bidding messages based on the reservation number, ultimately determining the winner who provides the shared parking space. Specifically, the distributed bidding negotiation matching includes: Local qualification verification and reservation: Based on the parking space sharing application multicast message received by the door lock, check whether its own sharing unit price is within the acceptable unit price range and whether the shareable time period covers the predetermined time period. If it meets the requirements, generate a unique reservation number based on the hash of the application content and record the parking space reservation information locally. The parking space reservation information includes the reservation number, the demander's family ID, the demander's door lock ID, and the reservation time period. Network reservation declaration: Based on the generated reservation number, the door lock sends an extended reverse IGMP join message containing the parking space reservation information to the direct-connected gateway to declare the resource reservation. The gateway records the reservation number in the corresponding (*, G) table entry. Trigger distributed price comparison: Based on the reserved door lock, a parking space sharing registration message containing the reserved number and its own shared unit price is sent via multicast, and the reservation negotiation win timer associated with the reserved number is started; Gateway Precise Filtering and Forwarding: Based on the registration messages received from other door locks, the gateway checks whether there is a reserved number in the (*, G) table entries, and forwards the registration message to the connected door lock only if it exists; Local price comparison and competition withdrawal: Based on the registration message received by the door lock, compare its own unit price with the unit price in the message. If its own unit price is higher or equal but its own door lock ID is larger, then delete the local reservation, clear the reservation negotiation win timer of the reserved number in the associated message, notify the gateway to cancel the reservation, and withdraw from the competition. Determine the winning party in the negotiation: If the timer for the winning negotiation associated with the reserved number expires, the door lock that still retains the reserved information locally is the winning party, and a confirmation message is sent to the Internet access box, which then forwards it to the relevant party's community APP.

[0022] Specifically, the triggering of distributed price comparison adopts a conflict suppression mechanism based on random delay, including: Random delayed start: Based on the door locks that have completed the resource reservation, each starts a random registration message sending delay timer within the range of 0 to the first preset time, and does not send the registration message immediately; First-to-time trigger and listening: Based on the door lock that times out first, multicast its parking space sharing registration message. The parking space sharing registration message carries the registration message sending delay timer information and starts the reservation negotiation win timer associated with the reservation number. Decision-making and withdrawal after listening: Based on the other door locks receiving the first registration message, immediately cancel its own random delay timer and compare its own unit price with the unit price in the message; if its own unit price is higher or equal, delete the local reservation, notify the gateway to cancel the reservation, withdraw from the competition, and no longer send any registration messages; Iterative convergence: Based on the existence of a lock with a lower unit price, after receiving the first message, it restarts a random delay timer within the range of 0 to a second preset duration. The second preset duration is the first preset duration minus the delay timer duration of the registration message in the first message. After the timer expires, it sends a registration message as the new first sender, repeating the comparison and exit process in the after-hearing decision and exit steps until the reservation negotiation winning timer associated with the reserved number expires, thus determining the final winner.

[0023] S204, Shared Time Extension Processing: Based on the extended parking time requests submitted by the requesters, the original shared parking space locks prioritize processing these requests. Through time period splitting and recursive negotiation mechanisms, the extended time periods that cannot be covered are converted into new shared requests, triggering distributed negotiation and matching among other locks within the alliance. Specifically, the shared time extension processing includes: Extended parking request trigger: Based on the request submitted by the user to extend the parking period, the Internet access box multicasts a parking space sharing extension request message, which includes the original shared parking space door lock ID and the requested extension period. Original parking space priority processing and time period splitting: Based on the extension application received by the original shared parking space door lock, determine whether its own shareable time period can completely cover the requested extension time period; if so, send a full confirmation message via multicast and update the local reservation; if not, split the requested time period into a confirmed extension time period that it can continue to provide and an extension time period to be claimed. Recursive negotiation trigger: Based on the partial confirmation message sent by the original shared parking space door lock multicast, which includes the extended period of waiting to be claimed, other door locks in the alliance automatically trigger a distributed bidding negotiation matching process for this period. Multi-round negotiation and recursive splitting: Based on the door locks that can only partially meet the demand for extended time periods during the negotiation, the remaining unmet time periods are automatically split again, and the next round of negotiation is triggered by sending a new partial confirmation message, until the time periods are fully allocated or the resources are exhausted. Segmented Confirmation and Notification: Based on the door locks provided for each time period as determined in each round of negotiations, confirmation messages are sent to the Internet access boxes. The boxes then aggregate the information and notify the relevant owners. If multiple parking spaces are involved, segmented parking arrangements will be indicated.

[0024] This invention addresses the situation where the supply of shared parking spaces in a residential community exceeds demand by forming a parking space sharing alliance among multiple households. It utilizes the community's existing property management system, community network APP, community network router, and residents' door locks, along with an internet access box, to achieve a parking space sharing price comparison function (the lowest price wins). This achieves the goal of distributed and collaborative parking space matching, while also reducing system deployment costs and protecting residents' privacy.

[0025] (I) Core Idea: Prerequisites: 1. The community property management system sets up a parking space sharing alliance for multiple owners who wish to share parking spaces. The parking space sharing alliance information includes each owner's family ID, door lock ID, and parking space ID. Each owner's door lock is connected to the community network through their respective floor gateway router.

[0026] 2. The property management system sets the multicast group address for each parking space sharing alliance (denoted as G1 and G2 respectively, and referred to as G below), and distributes it to the door locks of the alliance members.

[0027] 3. The internet access box is pre-configured to join various multicast groups G in the parking space sharing alliance and has a fixed LAN IP address within the community network. The property management system distributes the LAN IP address of the internet access box to each gateway within the alliance.

[0028] 4. Residents can use the community app to communicate via IP with the internet access box, which in turn can communicate with the community's network equipment. The community app also links to residents' home ID, door lock ID, and parking space ID information through communication with the property management system.

[0029] Core process: 1. Parking space sharing announcement: Residents within the parking space sharing alliance set up and publish parking space sharing information (parking space ID, available sharing time period, and sharing price) through the community app, and write this information to their door locks via NFC. After recording the information locally, the door lock sends an extended IGMP join message to its directly connected floor gateway router to request joining the corresponding multicast group G of the alliance. This message extension carries the "parking space sharing announcement" message type and the publishing door lock ID. When the gateway establishes the standard IGMP group table and (*, G) multicast routing table entry, it simultaneously binds the parking space publisher tag and the publisher door lock ID of this interface, enabling the network layer to be aware of the service resources.

[0030] 2. Parking space sharing application: Residents with visitors can submit a parking space sharing application (including the reserved time slot and acceptable price range) through the community's app. The app unicasts this application to the internet access box, which then broadcasts the application message to the entire consortium network via multicast (destination address is multicast group G).

[0031] 3. Parking space sharing application processing and reservation negotiation: After receiving the multicast request message, all lock publishers within the alliance check whether their own conditions (unit price, time period) meet the requirements. Locks that meet the requirements will perform the following operations: (1) Local reservation and network declaration: The parking space reservation information is recorded locally, and a unique "reservation number" is generated based on the application content. Then, the door lock sends a "reverse IGMP join message" carrying this reservation number to its direct-connected gateway. The gateway adds the reservation number to the corresponding (*, G) table entry, completing the binding of the network layer for this service reservation.

[0032] (2) Trigger the negotiation process: All eligible door locks immediately multicast a “parking space sharing registration” message, which includes their reserved number and parking space sharing unit price, and each starts the reserved negotiation winning timer associated with the reserved number (e.g., 2 minutes).

[0033] (3) Price comparison based on network forwarding: After receiving a registration message from another lock, the direct-connected gateway of each lock will forward the message to the connected lock only if the same reserved number exists in the (*, G) table of its own gateway. After receiving the forwarded registration message, the lock compares its own unit price with the other lock's unit price (the one with the lower unit price wins; if the unit prices are the same, the lock ID is compared). The losing lock deletes its local reservation and sends a "parking space reservation cancellation" message to the gateway. The gateway then deletes the corresponding reserved number in the table.

[0034] (4) Determine the winner: The lock that still retains the reservation information locally after the reservation negotiation win timer associated with the reservation number expires is the winner.

[0035] 4. Final confirmation of parking space sharing application: The door lock that wins the negotiation sends a confirmation message unicast to the internet access box. The box then forwards the confirmation message to the community app of both the sharing party and the requesting party, completing the reservation notification.

[0036] 5. Parking space sharing extended service application: When a visitor needs to extend their parking time, the resident submits an application including the extension period through the community's APP. This application is then multicast to the alliance multicast group G via the Internet access box.

[0037] 6. Processing and negotiation of parking space sharing extension requests: The original shared parking space lock (where the vehicle is currently parked) has priority in handling the issue, and the procedure is as follows: (1) Judgment and splitting: The door lock determines whether it can cover the extended time period. If it can fully cover the extended time period, it directly multicasts a "full confirmation" message and updates the local reserved time period. If it cannot, it splits the extended time period into a "confirmed extended time period" that it can continue to provide and a "pending claimed extended time period" that it cannot cover.

[0038] (2) Issuance of partial confirmation and new application: The door lock multicasts a "partial confirmation" message, which explicitly includes the "extended period for claiming" and the acceptable unit price range of the requester. This message itself constitutes a new parking space sharing application. At the same time, the door lock updates its local reserved information to cover its confirmed part.

[0039] (3) Recursive negotiation of the waiting period: After receiving this partial confirmation message, other door locks in the alliance (the original parking space door locks are no longer available during this period) will automatically trigger the complete distributed reservation negotiation process as described in step 3 for the "extended waiting period". If the waiting period is still long, the door locks that partially meet the requirements in this round of negotiation can split their unmet parts again and publish them as new "partial confirmation" messages to trigger the next round of negotiation until the time period is fully allocated or the resources are exhausted.

[0040] 7. Final confirmation of parking space sharing extension application: For each confirmed time slot (the original parking space confirmed and the time slots allocated to other parking spaces through multiple rounds of negotiation), the relevant door locks will send a confirmation message to the internet access box after completing their respective processes (either the original parking space is directly confirmed or the door lock timer expires after successful negotiation). The box will then aggregate all confirmation messages and notify the relevant homeowner's app. If multiple parking spaces are involved, the app will prompt the user to arrange segmented parking and vehicle relocation.

[0041] 8. Further Improvement: Distributed Negotiation Reduction Method Based on Random Delay: This step optimizes the negotiation mechanism in step 3, aiming to reduce the number of multicast packets in the network: (1) Delayed transmission and listening: After the door locks that meet the conditions in step 3 complete the local reservation and network declaration, they do not immediately send the registration message, but instead start a 0-10 second random registration message transmission delay timer.

[0042] (2) First trigger and comparison: The door lock whose timer expires first (such as door lock A) multicasts its registration message (including the reserved number and unit price) and starts the reservation negotiation winner timer associated with the reserved number.

[0043] (3) Decision-making and reduction after hearing: After receiving this message, other eligible door locks immediately cancel their own random registration message sending delay timer. Then compare their own unit price with the unit price in the message: if their own unit price is higher, they restart a random registration message sending delay timer with a shorter range (such as 0-7 seconds) to prepare to speak in the next round; if their own unit price is lower or equal, they delete the local reservation, notify the gateway to cancel the reservation, and withdraw from the competition, and no longer send any registration messages.

[0044] (4) Iterative convergence: If there is a lock with a lower unit price, after the delay timer of its newly initiated registration message expires, it will send a registration message as the new "first sender" and repeat the above comparison and exit process. This design ensures that the lock with the lowest price will eventually win, and at the same time, theoretically only a very small number of registration multicast messages are generated within the initial random time window, which greatly reduces the network load.

[0045] (II) Complete technical implementation process: Prerequisites: Same as above. Complete process: 1. Parking space sharing announcement: Within the parking space sharing alliance, each homeowner can set up parking space sharing through the community's APP. The content includes the homeowner's ID, parking space ID, available sharing time period (which can vary, such as 09:00-17:00), and parking space sharing unit price (which can vary, such as 5 yuan / hour).

[0046] Residents bring their phones, which have the community app installed, close to their door locks, and the NFC-based system transmits the parking space sharing information they've set up to the locks. Each lock in the alliance records this parking space sharing information locally, including the poster's home ID, the poster's lock ID, the parking space ID, the available sharing time period, and the parking space sharing price.

[0047] Each door lock also sends an extended IGMP join message to each directly connected gateway to join the corresponding alliance's multicast group G. The message includes the following extensions: message type (parking space sharing publication) and the publishing door lock ID.

[0048] After each direct-connected gateway of each door lock receives the extended IGMP join message, it records the correspondence between the interface and the multicast group G in its IGMP interface group table, and generates a (*, G) multicast routing table entry, in which the following information is bound to the interface that received the message: parking space publisher tag and publisher door lock ID.

[0049] 2. Parking space sharing application: Residents with visitors can apply for parking space sharing via the community app, entering the reserved time period (e.g., 13:00-16:00) and their acceptable parking space sharing price range (e.g., 5-6 yuan / hour). The community app sends a parking space sharing application message unicast to the internet access box, containing the requester's family ID, door lock ID, reserved time period, and acceptable parking space sharing price range. The internet access box then sends a parking space sharing application message multicast, containing the multicast group address (G), message type (parking space sharing application), requester's family ID, door lock ID, reserved time period, and acceptable parking space sharing price range.

[0050] 3. Parking space sharing application processing and reservation negotiation: Each lock in the alliance that joins multicast group G (i.e., the parking space sharing publisher) can receive the multicast message. If it checks and finds that its parking space sharing unit price is within the acceptable parking space sharing unit price range in the message, and the scheduled time period in the message is within its own shareable time period, then it is considered to meet the requirements.

[0051] Eligible door locks (e.g., door locks A, B, and C) send an extended IGMP message (referred to as a "reverse IGMP join message") to their directly connected gateways (e.g., gateways RA, RB, and RC) to declare resource reservations. The message extension carries: message type (parking space reservation), reservation number (generated using a fixed algorithm, such as a hash value based on the application message content (including timestamps, requester ID, etc.); for the same parking space sharing application message, the directly connected gateways of the different eligible door locks generate a consistent and unique reservation number), requester's family ID, requester's door lock ID, and reserved time period. The eligible door locks locally add the parking space reservation information to their parking space sharing publication record, including the reservation number, requester's family ID, requester's door lock ID, and reserved time period, where the reserved time period is the same as the reserved time period. At this time, the complete parking space sharing information record includes: the publisher's family ID, the publisher's door lock ID, the parking space ID, the shareable time period, the parking space sharing unit price, and the parking space reservation information (reservation number, the requester's family ID, the requester's door lock ID, the reservation time period, and the acceptable parking space sharing unit price range).

[0052] Based on this reverse IGMP join message, each directly connected gateway adds parking space reservation information (i.e., reservation number) to the entry of the qualified publisher door lock in its local (*, G) multicast routing table. At this time, the content of the (*, G) multicast routing table entry is: parking space publisher tag, publisher door lock ID, and parking space reservation information (i.e., reservation number).

[0053] Each lock that meets the requirements then sends a multicast data message for parking space sharing registration, containing the multicast group address (G), message type (parking space sharing registration), registration lock ID, reserved number, and parking space sharing unit price; then it starts a reservation negotiation win timer (e.g., 2 minutes) associated with the reserved number, and associates the reserved number.

[0054] When a direct gateway of each lock within the alliance receives a multicast data packet from another lock requesting a reservation number, it checks its local (*, G) multicast routing table. If a match is found (meaning that its own directly connected publisher lock also has a reservation for the same reservation request), it forwards the packet to its own directly connected publisher lock. If no match is found (meaning that its own directly connected publisher lock does not have a reservation for the same reservation request), it does not forward the packet to its own directly connected publisher lock.

[0055] If each eligible door lock receives the registration multicast data packet forwarded by its direct-connected gateway, it verifies whether the reserved number in the packet matches the reserved number recorded locally. If they match, it then compares its own parking space sharing unit price with the parking space sharing unit price in the multicast packet. There are three possibilities: (1) If the other party's unit price is lower: The door lock deletes its own parking space reservation information (i.e., the door lock with the lower parking space sharing unit price wins and provides the shared parking space); it clears the reservation negotiation win timer associated with the reservation number; and then sends an extended IGMP message (parking space reservation cancellation message) to the direct connection gateway, the content of which includes the message type (parking space reservation cancellation) and the reservation number.

[0056] When the direct-connect gateway receives the extended IGMP message, if it matches the reserved number in its local (*, G) multicast routing table, it deletes the reserved number from the table entry (the publisher's door lock ID information is still retained, and it can accept sharing requests from other door locks).

[0057] (2) If the other party's unit price is higher: The door locks will not be modified.

[0058] (3) If the unit prices of both parties are the same: The door lock then compares the registered door lock ID with its own door lock ID, and the one with the smaller ID wins. Similar to (1), the losing party deletes its own parking space reservation information; clears the reservation negotiation win timer associated with the reservation number; and then sends an extended IGMP message (parking space reservation cancellation message) to the direct-connect gateway. The direct-connect gateway deletes the parking space reservation information corresponding to the matching reservation number.

[0059] 4. Final confirmation of parking space sharing application: When the reservation negotiation win timer associated with the reserved number expires, each door lock in the alliance checks whether there is a record associated with the reserved number in the local parking space sharing information record. If there is, it means that it has won the reservation negotiation, and then sends a parking space sharing application confirmation message to the Internet access box via unicast. The message includes the publisher's family ID, publisher's door lock ID, publisher's parking space ID, requester's family ID, requester's door lock ID, reservation time period, and parking space sharing unit price.

[0060] Based on the parking space sharing application confirmation message, the internet access box sends sharing application confirmation messages to the community APP associated with both the sharing party and the requesting party, making it convenient for relevant homeowners to be aware of the information.

[0061] 5. Parking space sharing extended service application: If a visitor's parking time needs to exceed the originally scheduled time period, the visitor's homeowner can set an extension time period (e.g., 16:00-18:00) via the community app. The community app unicasts an extension request message to the internet access box, containing an extension request flag, the requester's door lock ID, the original shared parking space door lock ID, and the requested extension time period. The box then multicasts a parking space sharing extension request message, containing the multicast group address (G), message type (parking space sharing extension request), the requester's door lock ID, the original shared parking space door lock ID, and the requested extension time period.

[0062] 6. Processing and negotiation of parking space sharing extension requests: All locks in the alliance (i.e., parking space sharing providers) can receive this multicast message. Among them, the original shared parking space locks have priority in processing parking space sharing delay requests. The process is as follows: In the local parking space sharing information record, the lock ID of the publisher is found to be equal to the original shared parking space lock ID in the message (indicating that the vehicle is parked in the parking space associated with this lock). Further analysis of the "Shareable Time Period" field in the record reveals two possibilities: (1) If the original shared parking space can fully cover the extended time period requested (for example, if the original parking space can be shared until 18:00 or later, then there is no problem for the visitor's vehicle to continue to park in the original parking space). At this point, the original shared parking space lock sends a multicast confirmation message for the extended parking space sharing period. The message includes the multicast group address (G), message type (Full Confirmation of Parking Space Sharing Extension), requester's family ID, requester's lock ID, confirmer's lock ID (i.e., the original shared parking space lock ID), and the confirmed extension period (equal to the requested extension period). Since the confirmation is complete, no prior negotiation is required. The original shared parking space lock updates the reserved period in its local parking space sharing information record to a period from the start time of the original reserved period to the end time of the requested extension period (i.e., merging them into a single continuous time period).

[0063] Other door locks will not take any action upon receiving this full confirmation message (there is no need to conduct price comparison negotiations for this reserved time).

[0064] (2) The original shared parking space cannot fully (including not at all) cover the extended time period requested (for example, the original parking space can be shared until 17:00 at the latest, after which the owner of the original parking space may drive back, and there will be a parking conflict between the two. The original parking space can continue to be used for 1 hour, and other parking spaces in the alliance need to be found to take over for the other 1 hour). At this point, the original shared parking space lock sends a multicast confirmation message for the extended parking space sharing period. The message includes the multicast group address (G), message type (confirmation of extended parking space sharing period), requester's family ID, requester's lock ID, confirmer's lock ID (i.e., the original shared parking space lock ID), confirmed extension period (from the start time of the requested extension period to the end time of its own available sharing period), pending extension period (from the end time of its own available sharing period to the end time of the requested extension period), and acceptable parking space sharing unit price range (using the range initially set by the requester in step 2). Similarly, since partial confirmation has been made, this part does not require prior negotiation. Here, the original shared parking space lock updates the reserved period in its local parking space sharing information record to the period from the start time of the original reserved period to the end time of the confirmed extension period (i.e., merging them into a single continuous period). (It should be noted that if the confirmed extension period is 0, it means that the original parking space is completely unavailable. In this case, the pending extension period is the same as the requested extension period. The original parking space will only send a partial confirmation message (confirming the extension period is 0) and will not update or clear the local reserved information. The pending extension period will be fully taken over by other parking spaces within the alliance through price comparison.) When other locks receive this partial confirmation message, they know there is an extended period of parking space to be claimed that needs to be negotiated. At this point, the request can be transformed into a new parking space sharing request from the original parking space sharing request lock, which includes the requester's family ID, the requester's lock ID, the reserved time period (i.e., the extended period of parking space to be claimed), and the acceptable parking space sharing unit price range. Therefore, this "partial confirmation message" itself can be regarded as a new parking space sharing request multicast message for the "extended period of parking space to be claimed"; when other locks in the alliance (at this time, the original shared parking space lock is no longer available because its parking space is unavailable during this period) receive it, they will initiate the reservation negotiation process as described in step 3 based on the "extended period of parking space to be claimed" (i.e., the period of parking space to be claimed) and the "acceptable parking space sharing unit price range" contained therein.

[0065] If the aforementioned unclaimed time period is too long to be satisfied by a single parking space, after the new round of negotiation is completed, the door locks that partially meet the demand for that time period in that round will automatically split the remaining unsatisfied portion into the next round of negotiation requests (still triggered by the parking space sharing extension confirmation message sent via multicast), until all time periods are covered or no resources are available.

[0066] In this case, visitor vehicles may need to be parked in different parking spaces at different times, meaning the vehicles need to be moved at the agreed time.

[0067] 7. Final confirmation of parking space sharing extension application: Following step 6, the final confirmation message for the parking space sharing extension application falls into the following categories: (1) For the original shared parking space door lock that has updated the reserved information in step 6 (1) or 6 (2), the door lock sends a parking space sharing delay application confirmation message to the Internet access box via unicast, including the publisher's family ID, publisher's door lock ID, publisher's parking space ID, demander's family ID, demander's door lock ID, reserved time period (i.e. the updated reserved time period), and parking space sharing unit price.

[0068] (2) For the extended time period to be claimed, the door lock that wins the negotiation process in step 3 will send a parking space sharing extension application confirmation message to the Internet access box after the timer associated with the reserved number expires. The message includes the publisher's family ID, publisher's door lock ID, publisher's parking space ID, demander's family ID, demander's door lock ID, the reserved time period (i.e. the part of the extended time period to be claimed that is taken over by the door lock), and the parking space sharing unit price.

[0069] Afterwards, the internet access box sends confirmation messages for all received parking space sharing extension requests to the community apps associated with both the sharing party and the requesting party, making it convenient for relevant residents to be aware of the information. If there are confirmation messages for multiple parking spaces, the app will prompt the user to park in sections and move the car.

[0070] 8. Further Improvement: Distributed Negotiation Reduction Method Based on Random Delay: In step 3, after receiving the parking space sharing application message from the internet access box, all eligible door locks, after adding parking space reservation information locally, will multicast a parking space sharing application multicast data packet. If there are many eligible door locks in the alliance, more multicast data packets will be generated (each eligible door lock sends one multicast data packet). Further improvements to part of the process in step 3 are as follows: Upon receiving a parking space sharing application message from the internet access box, each eligible lock adds its local parking space reservation information and starts a random registration message sending delay timer (0-10 seconds). Assuming that after 3 seconds, the lock whose timer arrives first multicasts a parking space sharing registration multicast data message carrying the reservation number. This multicast allows other eligible locks (which have all sent IGMP join messages carrying the reservation number) to receive the message. Unqualified locks do not receive the message, allowing them to know the price of the first applicant and preventing later locks with higher prices from sending application messages. The message content includes the multicast group address (G), message type (parking space sharing registration), registering lock ID, reservation number, parking space sharing unit price, and registration message sending delay timer duration (i.e., the aforementioned 3 seconds). The lock then starts a reservation negotiation win timer associated with the reservation number (e.g., 2 minutes), linking the reservation number to the lock.

[0071] If any other eligible door locks receive the above parking space sharing registration multicast data packet, they immediately cancel their own registration packet sending delay timer (this prevents higher-priced door locks from executing their timers, reducing energy consumption); then they compare their own parking space sharing unit price with the parking space sharing unit price in the multicast packet, with two possible scenarios (simplified from the three scenarios in step 3): (1) If the other party's unit price is lower or both parties' unit prices are the same: The door lock deletes its own parking space reservation information; clears the reservation negotiation win timer associated with that reservation number; and then sends an extended IGMP message (parking space reservation cancellation message) to the direct-connected gateway. The door lock itself no longer sends multicast data packets for parking space sharing registration. (Note: The logic here is simplified; when prices are the same, the first-come, first-served principle is directly followed, and ID comparison is no longer performed to minimize message interaction.) (2) If the other party's unit price is higher: The door lock then restarts a random registration message sending delay timer (the duration can be dynamically shortened based on the remaining negotiation window of the current system, for example, 0-7 seconds (7 seconds because 10-3=7) to speed up subsequent convergence). (Similarly, the door lock that arrives first in the next round of timing will multicast a parking space sharing registration multicast data message; the remaining eligible door locks that receive the above message cancel their registration message sending delay timers, and then compare, judge, and process the data). In this way, theoretically, the price comparison can be completed within the initial 10-second random window.

[0072] And so on. This design can significantly reduce the number of multicast data packets sent for parking space sharing registration.

[0073] Beneficial effects: 1. High efficiency and low power consumption: Through a distributed negotiation mechanism that combines random delay with network layer service awareness, the number of multicast packets is significantly reduced, network load is lowered, and response speed and system scalability are improved.

[0074] 2. Reliable Decentralization: Distributed decision-making is carried out entirely within the local area network using multicast networks and gateways, without a single central server, avoiding single points of failure and ensuring high system robustness.

[0075] 3. Strong adaptability to different scenarios: The recursive split negotiation mechanism can elegantly handle complex segmented parking needs such as parking space delay applications, and realize efficient and automated splicing and utilization of resources.

[0076] 4. Optimal resource utilization: Through automatic price comparison and matching, shared parking spaces are quickly booked at competitive prices, improving the overall utilization rate of parking space resources and the income of owners.

[0077] Innovation points: 1. Distributed bidding negotiation architecture based on multicast network. A decentralized parking space sharing system is built using a community multicast network. Price comparison and resource reservation are completed through local interaction of door lock nodes, without the need for central server intervention, effectively reducing system deployment costs and protecting user privacy data.

[0078] 2. Distributed Transaction Identifier Synchronization Mechanism Based on Hash Algorithm. The door lock sends an extended IGMP message to declare resource reservation. A hash algorithm is used to generate a consistent reservation number based on the request content. This enables distributed nodes to establish a unique logical association identifier for the same request in a decentralized allocation environment, achieving decentralized collaborative resource locking.

[0079] 3. A precise multicast control method based on binding reserved numbers to gateway status. The gateway establishes a mapping relationship between reserved numbers and interfaces in the routing table based on extended IGMP messages, and performs deep filtering on subsequent registration messages accordingly: only messages carrying matching reserved numbers are forwarded to participating gate lock nodes, strictly limiting the network communication range to the resource contention set, greatly reducing invalid network flooding.

[0080] 4. Adaptive time-segmentation mechanism based on semantic transformation and partial confirmation. For parking space delay applications, the original shared parking space automatically converts the unclaimed time period that cannot be covered into a new bidding request through a "partial confirmation message", triggering other nodes in the alliance to start a new round of distributed negotiation, realizing intelligent matching and seamless connection of resources across parking spaces and time periods.

[0081] 5. Distributed conflict suppression method based on random backoff. A random delay timer is introduced to control the sending sequence of registration messages. The sending of first messages preempts and suppresses the sending behavior of subsequent nodes, effectively avoiding multicast message conflicts and network storms caused by multiple concurrent nodes, and significantly improving system stability.

[0082] Another embodiment of the present invention provides a system for extending door lock vehicle services, see [link to documentation]. Figure 3 The system may include: The publishing module 301 is used for publishing parking space sharing resources: based on the pre-set multicast address of the parking space sharing alliance of multiple owners' door locks, each door lock joins the corresponding multicast group through an extended IGMP join message, and carries the parking space sharing publishing information in the message, so that the direct connection gateway can synchronously bind the publisher identifier when establishing the multicast routing table entry; Initiation module 302 is used to initiate shared parking space requests: based on the parking space sharing application submitted by the requester, the Internet access box sends the application via multicast to the corresponding multicast group, triggering resource matching among the door locks in the alliance; Matching module 303 is used for distributed bidding negotiation matching: based on each door lock in the multicast group that meets the application requirements, it declares resource reservation to the gateway through extended IGMP message and generates a unique reservation number, and triggers distributed price comparison negotiation based on multicast network. The gateway filters and forwards price comparison messages based on the reservation number, and finally determines the winner of providing shared parking space. Processing module 304 is used for extended shared parking time processing: based on the extended parking time application submitted by the demander, the original shared parking space door lock is given priority to process. Through time period splitting and recursive negotiation mechanism, the extended time period that cannot be covered is transformed into a new shared application, triggering other door locks in the alliance to conduct distributed negotiation and matching.

[0083] This invention also provides a storage medium storing a computer program, wherein the computer program is configured to execute the steps in any of the above method embodiments when running.

[0084] This invention also provides an electronic device, including a memory and a processor, wherein the memory stores a computer program, and the processor is configured to run the computer program to perform the steps in any of the above method embodiments.

[0085] Specifically, the aforementioned electronic device may further include a transmission device and an input / output device, wherein the transmission device is connected to the aforementioned processor, and the input / output device is connected to the aforementioned processor.

[0086] The above description, based on the embodiments shown in the figures, details the structure, features, and effects of the present invention. The above description is only a preferred embodiment of the present invention, but the present invention is not limited to the scope of implementation shown in the figures. Any changes made in accordance with the concept of the present invention, or equivalent embodiments modified to have equivalent changes, that do not exceed the spirit covered by the specification and figures, should be within the protection scope of the present invention.

Claims

1. A method for extending vehicle door lock service, characterized in that, The method includes: Parking space sharing resource publication: Based on the pre-set multicast address of the parking space sharing alliance of multiple owners' door locks, each door lock joins the corresponding multicast group through an extended IGMP join message, and carries the parking space sharing publication information in the message, so that the direct connection gateway can bind the publisher identifier synchronously when establishing the multicast routing table entry; Shared parking space request initiation: Based on the parking space sharing application submitted by the requester, the Internet access box sends the application via multicast to the corresponding multicast group, triggering resource matching among the door locks in the alliance; Distributed bidding negotiation matching: Based on the door locks in the multicast group that meet the application requirements, the resource reservation is declared to the gateway through extended IGMP messages and a unique reservation number is generated. This triggers distributed bidding negotiation based on the multicast network. The gateway filters and forwards the bidding messages based on the reservation number, and finally determines the winner of providing the shared parking space. Extended shared parking time processing: Based on the extended parking time application submitted by the demander, the original shared parking space lock will process it first. Through time period splitting and recursive negotiation mechanism, the extended time period that cannot be covered will be transformed into a new shared application, triggering other locks in the alliance to conduct distributed negotiation and matching.

2. The method according to claim 1, characterized in that, The publication of the shared parking space resources includes: Shared information configuration and writing: Based on the parking space sharing information set by the owner through the community APP, including parking space ID, shareable time period and sharing unit price, the information is written to the owner's door lock via near field communication; Extended multicast registration: Based on the parking space sharing information, the door lock generates an extended IGMP join message, wherein the extended fields include the message type "parking space sharing publish" and the publisher door lock ID; Network resource binding: Based on the extended IGMP join message sent by the door lock, when its direct-connected gateway establishes a (*, G) multicast routing table entry, it binds the parking space publisher tag and the publisher door lock ID on the interface that received the message.

3. The method according to claim 2, characterized in that, The shared parking space request is initiated by including: Parking space sharing application submission: Based on the reservation time period and acceptable price range entered by the user on the community APP, a parking space sharing application message is generated; Message forwarding: Based on the parking space sharing application message, the community APP sends it unicast to the internet access box; Multicast request broadcast: Based on the parking space sharing application message, the Internet access box encapsulates it into a multicast message with the destination address being the corresponding multicast group address, and sends it via multicast within the community network.

4. The method according to claim 3, characterized in that, The distributed bidding negotiation matching includes: Local qualification verification and reservation: Based on the parking space sharing application multicast message received by the door lock, check whether its own sharing unit price is within the acceptable unit price range and whether the shareable time period covers the predetermined time period. If it meets the requirements, generate a unique reservation number based on the hash of the application content, and record the parking space reservation information locally. The parking space reservation information includes the reservation number, the demander's family ID, the demander's door lock ID, and the reservation time period. Network reservation declaration: Based on the generated reservation number, the door lock sends an extended reverse IGMP join message containing the parking space reservation information to the direct-connected gateway to declare the resource reservation. The gateway records the reservation number in the corresponding (*, G) table entry. Trigger distributed price comparison: Based on the reserved door lock, a parking space sharing registration message containing the reserved number and its own shared unit price is sent via multicast, and the reservation negotiation win timer associated with the reserved number is started; Gateway Precise Filtering and Forwarding: Based on the registration messages received from other door locks, the gateway checks whether there is a reserved number in the (*, G) table entries, and forwards the registration message to the connected door lock only if it exists; Local price comparison and competition withdrawal: Based on the registration message received by the door lock, compare its own unit price with the unit price in the message. If its own unit price is higher or equal but its own door lock ID is larger, then delete the local reservation, clear the reservation negotiation win timer of the reserved number in the associated message, notify the gateway to cancel the reservation, and withdraw from the competition. Determine the winning party in the negotiation: If the timer for the winning negotiation associated with the reserved number expires, the door lock that still retains the reserved information locally is the winning party, and a confirmation message is sent to the Internet access box, which then forwards it to the relevant party's community APP.

5. The method according to claim 4, characterized in that, The shared duration extension process includes: Extended parking request trigger: Based on the request submitted by the user to extend the parking period, the Internet access box multicasts a parking space sharing extension request message, which includes the original shared parking space door lock ID and the requested extension period. Original parking space priority processing and time period splitting: Based on the extension application received by the original shared parking space door lock, determine whether its own shareable time period can completely cover the requested extension time period; if so, send a full confirmation message via multicast and update the local reservation; if not, split the requested time period into a confirmed extension time period that it can continue to provide and an extension time period to be claimed. Recursive negotiation trigger: Based on the partial confirmation message sent by the original shared parking space door lock multicast, which includes the extended period of waiting to be claimed, other door locks in the alliance automatically trigger a distributed bidding negotiation matching process for this period. Multi-round negotiation and recursive splitting: Based on the door locks that can only partially meet the demand for extended time periods during the negotiation, the remaining unmet time periods are automatically split again, and the next round of negotiation is triggered by sending a new partial confirmation message, until the time periods are fully allocated or the resources are exhausted. Segmented Confirmation and Notification: Based on the door locks provided for each time period as determined in each round of negotiations, confirmation messages are sent to the Internet access boxes. The boxes then aggregate the information and notify the relevant owners. If multiple parking spaces are involved, segmented parking arrangements will be indicated.

6. The method according to claim 5, characterized in that, The triggered distributed price comparison adopts a conflict suppression mechanism based on random delay, including: Random delayed start: Based on the door locks that have completed the resource reservation, each starts a random registration message sending delay timer within the range of 0 to the first preset time, and does not send the registration message immediately; First-to-time trigger and listening: Based on the door lock that times out first, multicast its parking space sharing registration message. The parking space sharing registration message carries the registration message sending delay timer information and starts the reservation negotiation win timer associated with the reservation number. Decision-making and withdrawal after listening: Based on the other door locks receiving the first registration message, immediately cancel its own random delay timer and compare its own unit price with the unit price in the message; if its own unit price is higher or equal, delete the local reservation, notify the gateway to cancel the reservation, withdraw from the competition, and no longer send any registration messages; Iterative convergence: Based on the existence of a lock with a lower unit price, after receiving the first message, it restarts a random delay timer within the range of 0 to a second preset duration. The second preset duration is the first preset duration minus the delay timer duration of the registration message in the first message. After the timer expires, it sends a registration message as the new first sender, repeating the comparison and exit process in the after-hearing decision and exit steps until the reservation negotiation winning timer associated with the reserved number expires, thus determining the final winner.

7. A system for extending vehicle door lock service, characterized in that, The system includes: The publishing module is used for publishing parking space sharing resources: based on the pre-set multicast address of the parking space sharing alliance of multiple owners' door locks, each door lock joins the corresponding multicast group through an extended IGMP join message, and carries the parking space sharing publishing information in the message, so that the direct-connected gateway can synchronously bind the publisher identifier when establishing the multicast routing table entry; The initiation module is used to initiate shared parking space requests: based on the parking space sharing application submitted by the requester, the Internet access box sends the application via multicast to the corresponding multicast group, triggering resource matching among the door locks in the alliance; The matching module is used for distributed bidding negotiation matching: based on each door lock in the multicast group that meets the application requirements, it declares resource reservation to the gateway through extended IGMP messages and generates a unique reservation number, and triggers distributed price comparison negotiation based on the multicast network. The gateway filters and forwards price comparison messages based on the reservation number, and finally determines the winner of providing shared parking spaces. The processing module is used for extended shared parking time processing: based on the extended parking time application submitted by the demander, the original shared parking space door lock is given priority to processing. Through time period splitting and recursive negotiation mechanism, the extended time period that cannot be covered is transformed into a new shared application, triggering other door locks in the alliance to conduct distributed negotiation and matching.

8. The system according to claim 7, characterized in that, The publishing module is specifically used for: Shared information configuration and writing: Based on the parking space sharing information set by the owner through the community APP, including parking space ID, shareable time period and sharing unit price, the information is written to the owner's door lock via near field communication; Extended multicast registration: Based on the parking space sharing information, the door lock generates an extended IGMP join message, wherein the extended fields include the message type "parking space sharing publish" and the publisher door lock ID; Network resource binding: Based on the extended IGMP join message sent by the door lock, when its direct-connected gateway establishes a (*, G) multicast routing table entry, it binds the parking space publisher tag and the publisher door lock ID on the interface that received the message.

9. A storage medium, characterized in that, The storage medium stores a computer program, wherein the computer program is configured to execute the method of any one of claims 1-6 when it is run.

10. An electronic device comprising a memory and a processor, characterized in that, The memory stores a computer program, and the processor is configured to run the computer program to perform the method of any one of claims 1-6.

Images