CN116760762B - Decentralised ad hoc network method and device - Google Patents
Decentralised ad hoc network method and device Download PDFInfo
- Publication number
- CN116760762B CN116760762B CN202311017576.4A CN202311017576A CN116760762B CN 116760762 B CN116760762 B CN 116760762B CN 202311017576 A CN202311017576 A CN 202311017576A CN 116760762 B CN116760762 B CN 116760762B
- Authority
- CN
- China
- Prior art keywords
- current node
- distance
- node
- identification code
- list
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 50
- 238000004891 communication Methods 0.000 claims abstract description 70
- 230000004044 response Effects 0.000 claims abstract description 7
- 238000004590 computer program Methods 0.000 claims description 11
- 238000004422 calculation algorithm Methods 0.000 claims description 7
- 230000008569 process Effects 0.000 claims description 6
- 101100217298 Mus musculus Aspm gene Proteins 0.000 claims description 5
- 238000004364 calculation method Methods 0.000 claims description 4
- 230000006855 networking Effects 0.000 abstract description 10
- 238000000265 homogenisation Methods 0.000 abstract description 5
- 238000012545 processing Methods 0.000 description 6
- 238000010586 diagram Methods 0.000 description 5
- 230000009471 action Effects 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 230000006870 function Effects 0.000 description 2
- 230000003993 interaction Effects 0.000 description 2
- 238000007726 management method Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000013459 approach Methods 0.000 description 1
- 238000003491 array Methods 0.000 description 1
- 238000013473 artificial intelligence Methods 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000010801 machine learning Methods 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 230000001953 sensory effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
- H04L45/021—Ensuring consistency of routing table updates, e.g. by using epoch numbers
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
- H04L9/0643—Hash functions, e.g. MD5, SHA, HMAC or f9 MAC
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
- H04L9/0866—Generation of secret information including derivation or calculation of cryptographic keys or passwords involving user or device identifiers, e.g. serial number, physical or biometrical information, DNA, hand-signature or measurable physical characteristics
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The present disclosure provides a decentralizing ad hoc network method and device, applied to nodes forming an ad hoc network, belonging to the technical field of network communication, the method comprising: acquiring a distance identification code of a current node; determining the distance between the current node and the current node according to the distance identification code of the current node and the distance identification code of the current node; and adding the current node to the communication node list of the current node in response to the distance between the current node and the current node being smaller than a first preset threshold value. In this way, homogenization of the network can be achieved, thus making networking simple, decentralizing, and suitable for small networks.
Description
Technical Field
Embodiments of the present disclosure relate generally to the field of network communication technology and, more particularly, to a decentralised ad hoc network method and apparatus.
Background
When a multi-node communication network is established, many networking algorithms exist. These networking algorithms are usually centralized, i.e. one node is responsible for managing all nodes, and other nodes need to communicate with this node for joining or leaving, such as node management methods in the Hadoop framework, etc. In the non-centralized networking scheme, although a central node is not needed, the networking is complex, the node management is difficult, or the method is not suitable for a small-sized network.
Disclosure of Invention
According to an embodiment of the present disclosure, a decentralised ad hoc network scheme is provided for building an ad hoc network.
In a first aspect of the present disclosure, there is provided a decentralised ad hoc network method applied to nodes forming an ad hoc network, comprising:
acquiring a distance identification code of a current node;
determining the distance between the current node and the current node according to the distance identification code of the current node and the distance identification code of the current node;
and adding the current node to the communication node list of the current node in response to the distance between the current node and the current node being smaller than a first preset threshold value.
In some embodiments, the method further comprises a process of generating the distance identification code of the method in advance, and specifically comprises the following steps:
splicing the IP address and the MAC address of the user to generate a character string to be encrypted;
and encrypting the character string to be encrypted by using an SHA1 algorithm to generate a distance identification code.
In some embodiments, the determining the distance from the current node according to the distance identification code of the current node and the distance identification code of the current node comprises:
comparing whether the distance identification code of the current node is the same as characters at corresponding positions in the distance identification code of the current node, and taking the number of character bits with different characters as the distance between the current node and the characters.
In some embodiments, further comprising:
grouping nodes in the ad hoc network according to the distance between the nodes, and grouping the nodes with the distance between the nodes smaller than a second preset threshold value into the same group, wherein the second preset threshold value is smaller than the first preset threshold value.
In some embodiments, further comprising:
updating the nodes in the communication node list, and dynamically adding the node sequence with the distance smaller than the first preset threshold value to the communication node list.
In some embodiments, further comprising:
and removing the nodes which do not communicate with the nodes in the preset time interval from the communication node list.
In some embodiments, further comprising:
after adding a current node to a communication node list of the current node, sending the communication node list of the current node to the current node, wherein the current node takes the communication node list as the communication node list of the current node;
the current node updates the communication node list of the current node, acquires the communication node list of the node in the updated communication node list, and continuously updates the communication node list of the current node;
the process is repeated until the communication node list of the current node is no longer changed within the preset time interval.
In a second aspect of the present disclosure, there is provided a decentralised ad hoc network apparatus for use in a node forming an ad hoc network, comprising:
the distance identification code acquisition module is used for acquiring the distance identification code of the current node;
the distance calculation module is used for determining the distance between the current node and the current node according to the distance identification code of the current node and the distance identification code of the current node;
and the communication node list updating module is used for adding the current node to the communication node list of the communication node list in response to the fact that the distance between the communication node list and the current node is smaller than a first preset threshold value.
In a third aspect of the present disclosure, there is provided an electronic device comprising a memory having a computer program stored thereon and a processor that when executing the program implements the method as described above.
In a fourth aspect of the present disclosure, a computer readable storage medium is provided, on which a computer program is stored, which program, when being executed by a processor, implements a method as described above.
By the decentralizing ad hoc network method, the homogenization of the network can be realized, so that the networking is simple, the decentralizing is realized, and the method is suitable for a small-sized network.
The matters described in the summary section are not intended to limit key or critical features of the embodiments of the present disclosure nor to limit the scope of the present disclosure. Other features of the present disclosure will become apparent from the following description.
Drawings
The above and other features, advantages and aspects of embodiments of the present disclosure will become more apparent by reference to the following detailed description when taken in conjunction with the accompanying drawings. In the drawings, wherein like or similar reference numerals denote like or similar elements, in which:
FIG. 1 is a flow chart of a method of decentralizing ad hoc networking in accordance with an embodiment of the present disclosure;
fig. 2 is a schematic structural diagram of an decentralized ad hoc network device according to a second embodiment of the disclosure;
fig. 3 shows a schematic block diagram of an electronic device used to implement an embodiment of the present disclosure.
Detailed Description
For the purposes of making the objects, technical solutions and advantages of the embodiments of the present disclosure more apparent, the technical solutions of the embodiments of the present disclosure will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present disclosure, and it is apparent that the described embodiments are some embodiments of the present disclosure, but not all embodiments. All other embodiments, which can be made by one of ordinary skill in the art without undue burden from the disclosure, are within the scope of the disclosure.
In addition, the term "and/or" herein is merely an association relationship describing an association object, and means that three relationships may exist, for example, a and/or B may mean: a exists alone, A and B exist together, and B exists alone. In addition, the character "/" herein generally indicates that the front and rear associated objects are an "or" relationship.
The decentralizing ad hoc network method disclosed by the embodiment of the invention can realize the homogenization of the network, so that the networking is simple, the decentralizing is realized, and the method is suitable for a small-sized network.
Specifically, as shown in fig. 1, a flowchart of a decentralizing ad hoc network method according to a first embodiment of the disclosure is shown. As an optional embodiment of the disclosure, in this embodiment, the method for decentralizing ad hoc network may be applied to a node in an ad hoc network, and includes the following steps:
s101: and acquiring the distance identification code of the current node.
The decentralizing ad hoc network method of the embodiment can be applied to network nodes in an ad hoc network, and particularly can be applied to the increase of the network nodes in the ad hoc network. When a node (current node) accesses a node in the ad hoc network (denoted as a target node), the target node acquires the distance identification code of the current node.
In this embodiment, the distance identification code is generated from the IP address and MAC address (local area network address) of the node itself. Specifically, the IP address and the MAC address may be spliced to generate a character string to be encrypted; the above-mentioned character string to be encrypted is encrypted by using the SHA1 algorithm to generate a distance identification code, and in the embodiment of the present disclosure, the generated distance identification code is a binary character string with 160 bits.
Thus, in the ad hoc network of this embodiment, when there is a new node added, the target node needs to acquire the distance identification code of the current node.
S102: and determining the distance between the current node and the current node according to the distance identification code of the current node and the distance identification code of the current node.
In this embodiment, after the target node obtains the distance identifier of the current node, the distance between the current node and itself may be further calculated. Specifically, whether the distance identification code of the current node is the same as the character at the corresponding position in the distance identification code of the current node is compared, and the number of character bits with different characters is used as the distance from the current node. The above calculation method is described in terms of 8-bit hash value: given two 8-bit hash values, the following is given:
hash1 = 00010101
hash2 = 00110100
the 3 rd bit and the 8 th bit of the two hash values are different, so the return value is 2. In this embodiment, the hash value used is 160 bits in length, so the value returned is 0-160 when compared, and 160 when all bits are returned to 0 at the same time and all are not identical.
In this way, the distance between the current node and the target node can be determined.
S103: and adding the current node to the communication node list of the current node in response to the distance between the current node and the current node being smaller than a first preset threshold value.
In this embodiment, each node in the ad hoc network maintains a list of communication nodes for recording the nodes with which it communicates. After the target node determines the distance to the current node, if the distance is less than a preset threshold, e.g., 50, the current node is added to its own communication node list.
The decentralizing ad hoc network method disclosed by the embodiment of the invention can realize the homogenization of the network, so that the networking is simple, the decentralizing is realized, and the method is suitable for a small-sized network.
In addition, as an optional embodiment of the disclosure, in the foregoing embodiment, the nodes in the ad hoc network may be further grouped according to a distance between the nodes, and the nodes with a distance between the nodes smaller than a second preset threshold value may be classified into the same group, where the second preset threshold value is smaller than the first preset threshold value.
For example, the second preset threshold may be 10, so that nodes in the ad hoc network having a distance smaller than 10 from each other may be classified into the same group.
In the embodiment of the disclosure, the distance estimation is estimated by using the hash value based on SHA1, so that the method has better randomness, and the cluster balance of each node is ensured, and too many nodes can not appear in the same cluster, so that the homogenization of the network can be realized.
As an optional embodiment of the present disclosure, in the foregoing embodiment, the process that the target node updates the nodes in its own communication node list may be further included, that is, the nodes having a distance from itself less than the first preset threshold value are continuously discovered, and the newly discovered nodes are dynamically added to the communication node list in sequence, that is, the nodes in the communication node list are in a sequential order, where the position of the node added to the communication node list first is earlier than the position of the node added to the communication node list later. And simultaneously, removing the nodes which do not communicate with the nodes in the preset time interval from the communication node list. Thus over time, the more front nodes in the list, the better their online stability.
Further, as another embodiment of the present disclosure, after the target node adds the current node to its own communication node list, the own communication node list is sent to the current node, and the current node takes the communication node list as its own communication node list.
The current node updates the communication node list of the current node, namely, the node with the distance smaller than a first preset threshold value is reserved, the node with the distance not smaller than the first preset threshold value is deleted, after the update is completed, the communication node list of the node in the updated communication node list is continuously acquired, the rule is continuously utilized to update the communication node list of the current node, the communication node list of the node in the updated communication node list is continuously acquired, and the communication node list of the current node is continuously updated; the process is repeated until the communication node list of the current node is no longer changed within the preset time interval.
In addition, the node searching can be performed based on the ad hoc network in the embodiment of the present disclosure, and the searching rule for querying the node N2 at the node N1 is as follows:
if N2 is in the neighbor list of N1, directly returning to N2, and ending the query;
otherwise, find several nodes nearest to N2 from N1 neighbor nodes, send out the message to make them inquire N2 in their own neighbor list, return N2 or the nearest node to N2;
if the returned result is N2, the query is ended; otherwise, repeating the step 2 to directly find N2, or after inquiring for a certain time period t, ending the inquiry.
It should be noted that, for simplicity of description, the foregoing method embodiments are all expressed as a series of action combinations, but it should be understood by those skilled in the art that the present disclosure is not limited by the order of actions described, as some steps may take other order or occur simultaneously in light of the present disclosure. Further, those skilled in the art will also appreciate that the embodiments described in the specification are all alternative embodiments, and that the acts and modules referred to are not necessarily required by the present disclosure.
The foregoing is a description of embodiments of the method, and the following further describes embodiments of the present disclosure through examples of apparatus.
Fig. 2 is a schematic structural diagram of a decentralised ad hoc network device according to a second embodiment of the present disclosure. The decentralized ad hoc network device of the present embodiment includes:
the distance identification code obtaining module 201 is configured to obtain a distance identification code of a current node.
The distance calculation module 202 is configured to determine a distance between the current node and the current node according to the distance identifier of the current node and the distance identifier of the current node.
The communication node list updating module 203 is configured to add the current node to its own communication node list in response to the distance between the current node and the communication node list updating module is smaller than a first preset threshold.
It will be clear to those skilled in the art that, for convenience and brevity of description, specific working procedures of the described modules may refer to corresponding procedures in the foregoing method embodiments, which are not described herein again.
Fig. 3 shows a schematic block diagram of an electronic device 300 that may be used to implement embodiments of the present disclosure. Electronic devices are intended to represent various forms of digital computers, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other appropriate computers. The electronic device may also represent various forms of mobile devices, such as personal digital processing, cellular telephones, smartphones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are meant to be exemplary only, and are not meant to limit implementations of the disclosure described and/or claimed herein.
The electronic device 300 includes a computing unit 301 that can perform various appropriate actions and processes according to a computer program stored in a ROM302 or a computer program loaded from a storage unit 308 into a RAM 303. In the RAM303, various programs and data required for the operation of the electronic device 300 may also be stored. The computing unit 301, the ROM302, and the RAM303 are connected to each other by a bus 304. I/O interface 305 is also connected to bus 304.
Various components in the electronic device 300 are connected to the I/O interface 305, including: an input unit 306 such as a keyboard, a mouse, etc.; an output unit 307 such as various types of displays, speakers, and the like; a storage unit 308 such as a magnetic disk, an optical disk, or the like; and a communication unit 309 such as a network card, modem, wireless communication transceiver, etc. The communication unit 309 allows the electronic device 300 to exchange information/data with other devices through a computer network such as the internet and/or various telecommunication networks.
The computing unit 301 may be a variety of general and/or special purpose processing components having processing and computing capabilities. Some examples of computing unit 301 include, but are not limited to, a Central Processing Unit (CPU), a Graphics Processing Unit (GPU), various specialized Artificial Intelligence (AI) computing chips, various computing units running machine learning model algorithms, a Digital Signal Processor (DSP), and any suitable processor, controller, microcontroller, etc. The computing unit 301 performs the various methods and processes described above, such as the decentralised ad hoc network method. For example, in some embodiments, the decentralised ad hoc networking method may be implemented as a computer software program tangibly embodied on a machine-readable medium, such as the storage unit 308. In some embodiments, part or all of the computer program may be loaded and/or installed onto the electronic device 300 via the ROM302 and/or the communication unit 309. When the computer program is loaded into RAM303 and executed by computing unit 301, one or more steps of the de-centralized ad hoc network method described above may be performed. Alternatively, in other embodiments, the computing unit 301 may be configured to perform the decentralised ad hoc approach by any other suitable means (e.g. by means of firmware).
Various implementations of the systems and techniques described here above may be implemented in digital electronic circuitry, integrated circuitry, field Programmable Gate Arrays (FPGAs), application Specific Integrated Circuits (ASICs), application Specific Standard Products (ASSPs), systems-on-chips (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include: implemented in one or more computer programs, the one or more computer programs may be executed and/or interpreted on a programmable system including at least one programmable processor, which may be a special purpose or general-purpose programmable processor, that may receive data and instructions from, and transmit data and instructions to, a storage system, at least one input device, and at least one output device.
Program code for carrying out methods of the present disclosure may be written in any combination of one or more programming languages. These program code may be provided to a processor or controller of a general purpose computer, special purpose computer, or other programmable data processing apparatus such that the program code, when executed by the processor or controller, causes the functions/operations specified in the flowchart and/or block diagram to be implemented. The program code may execute entirely on the machine, partly on the machine, as a stand-alone software package, partly on the machine and partly on a remote machine or entirely on the remote machine or server.
In the context of this disclosure, a machine-readable medium may be a tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. The machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. The machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
To provide for interaction with a user, the systems and techniques described here can be implemented on a computer having: display means for displaying information to a user; and a keyboard and pointing device (e.g., a mouse or trackball) by which a user can provide input to the computer. Other kinds of devices may also be used to provide for interaction with a user; for example, feedback provided to the user may be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form, including acoustic input, speech input, or tactile input.
The systems and techniques described here can be implemented in a computing system that includes a background component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front-end component (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such background, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: local Area Networks (LANs), wide Area Networks (WANs), and the internet.
The computer system may include a client and a server. The client and server are typically remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other. The server may be a cloud server, a server of a distributed system, or a server incorporating a blockchain.
It should be appreciated that various forms of the flows shown above may be used to reorder, add, or delete steps. For example, the steps recited in the present disclosure may be performed in parallel, sequentially, or in a different order, provided that the desired results of the disclosed aspects are achieved, and are not limited herein.
The above detailed description should not be taken as limiting the scope of the present disclosure. It will be apparent to those skilled in the art that various modifications, combinations, sub-combinations and alternatives are possible, depending on design requirements and other factors. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present disclosure are intended to be included within the scope of the present disclosure.
Claims (8)
1. The decentralizing ad hoc network method is applied to nodes forming an ad hoc network, and is characterized by comprising the following steps:
obtaining a distance identification code of a current node, wherein the distance identification code is generated by the following steps:
splicing the IP address and the MAC address of the user to generate a character string to be encrypted; encrypting the character string to be encrypted by using an SHA1 algorithm to generate a distance identification code;
determining the distance between the current node and the current node according to the distance identification code of the current node and the distance identification code of the current node, wherein the method comprises the following steps: comparing whether the distance identification code of the current node is the same as characters at corresponding positions in the distance identification code of the current node, and taking the number of character bits with different characters as the distance between the current node and the current node;
and adding the current node to the communication node list of the current node in response to the distance between the current node and the current node being smaller than a first preset threshold value.
2. The ad hoc network method according to claim 1, further comprising:
grouping nodes in the ad hoc network according to the distance between the nodes, and grouping the nodes with the distance between the nodes smaller than a second preset threshold value into the same group, wherein the second preset threshold value is smaller than the first preset threshold value.
3. The ad hoc network method according to claim 2, further comprising:
updating the nodes in the communication node list, and dynamically adding the node sequence with the distance smaller than the first preset threshold value to the communication node list.
4. The ad hoc network method according to claim 3, further comprising:
and removing the nodes which do not communicate with the nodes in the preset time interval from the communication node list.
5. The ad hoc network method of claim 4, further comprising:
after adding a current node to a communication node list of the current node, sending the communication node list of the current node to the current node, wherein the current node takes the communication node list as the communication node list of the current node;
the current node updates the communication node list of the current node, acquires the communication node list of the node in the updated communication node list, and continuously updates the communication node list of the current node;
the above process is repeated until the communication node list of the current node is not changed any more within the preset time interval.
6. An apparatus for decentralizing an ad hoc network, applied to nodes forming the ad hoc network, comprising:
the distance identification code acquisition module is used for acquiring the distance identification code of the current node; wherein the distance identification code is generated by: splicing the IP address and the MAC address of the user to generate a character string to be encrypted; encrypting the character string to be encrypted by using SHA1 algorithm to generate a distance identification code
The distance calculation module is used for determining the distance between the current node and the current node according to the distance identification code of the current node and the distance identification code of the current node, and comprises the following steps: comparing whether the distance identification code of the current node is the same as characters at corresponding positions in the distance identification code of the current node, and taking the number of character bits with different characters as the distance between the current node and the current node;
and the communication node list updating module is used for adding the current node to the communication node list of the communication node list in response to the fact that the distance between the communication node list and the current node is smaller than a first preset threshold value.
7. An electronic device comprising a memory and a processor, the memory having stored thereon a computer program, wherein the processor, when executing the program, implements the method of any of claims 1-5.
8. A computer readable storage medium, on which a computer program is stored, characterized in that the program, when being executed by a processor, implements the method according to any one of claims 1-5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311017576.4A CN116760762B (en) | 2023-08-14 | 2023-08-14 | Decentralised ad hoc network method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311017576.4A CN116760762B (en) | 2023-08-14 | 2023-08-14 | Decentralised ad hoc network method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116760762A CN116760762A (en) | 2023-09-15 |
| CN116760762B true CN116760762B (en) | 2023-11-07 |
Family
ID=87959338
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311017576.4A Active CN116760762B (en) | 2023-08-14 | 2023-08-14 | Decentralised ad hoc network method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116760762B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2012097104A1 (en) * | 2011-01-14 | 2012-07-19 | Qualcomm Incorporated | Providing positioning assistance to mobile stations via a self - organizing network |
| CN102883401A (en) * | 2012-10-17 | 2013-01-16 | 江苏省邮电规划设计院有限责任公司 | Realization method for prolonging life cycle of wireless multihop self-organizing network |
| CN110446210A (en) * | 2019-08-21 | 2019-11-12 | 科航（苏州）信息科技有限公司 | Ad hoc network wireless communication system |
| CN110493730A (en) * | 2019-08-21 | 2019-11-22 | 科航（苏州）信息科技有限公司 | Wireless self-networking communication node localization method and communication node |
| CN110493716A (en) * | 2019-08-21 | 2019-11-22 | 科航（苏州）信息科技有限公司 | Communication node automatic deployment method and device |
| CN114204979A (en) * | 2021-12-24 | 2022-03-18 | 清华大学 | Unmanned aerial vehicle ad hoc network method and device based on relative position |
| CN116015419A (en) * | 2022-12-29 | 2023-04-25 | 广州极智高新科技有限公司 | Unmanned aerial vehicle ad hoc network device and method based on relative positions |
-
2023
- 2023-08-14 CN CN202311017576.4A patent/CN116760762B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2012097104A1 (en) * | 2011-01-14 | 2012-07-19 | Qualcomm Incorporated | Providing positioning assistance to mobile stations via a self - organizing network |
| CN102883401A (en) * | 2012-10-17 | 2013-01-16 | 江苏省邮电规划设计院有限责任公司 | Realization method for prolonging life cycle of wireless multihop self-organizing network |
| CN110446210A (en) * | 2019-08-21 | 2019-11-12 | 科航（苏州）信息科技有限公司 | Ad hoc network wireless communication system |
| CN110493730A (en) * | 2019-08-21 | 2019-11-22 | 科航（苏州）信息科技有限公司 | Wireless self-networking communication node localization method and communication node |
| CN110493716A (en) * | 2019-08-21 | 2019-11-22 | 科航（苏州）信息科技有限公司 | Communication node automatic deployment method and device |
| CN114204979A (en) * | 2021-12-24 | 2022-03-18 | 清华大学 | Unmanned aerial vehicle ad hoc network method and device based on relative position |
| CN116015419A (en) * | 2022-12-29 | 2023-04-25 | 广州极智高新科技有限公司 | Unmanned aerial vehicle ad hoc network device and method based on relative positions |
Non-Patent Citations (1)
| Title |
|---|
| 基于加权的具有相同移动特性的车载自组网分簇算法;李雪等;空军工程大学学报;第1部分 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116760762A (en) | 2023-09-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9596295B2 (en) | Computing connected components in large graphs | |
| US9110884B2 (en) | Message publishing and subscribing method and apparatus | |
| CN114253979B (en) | Message processing method and device and electronic equipment | |
| CN113568860B (en) | Deep learning-based multi-machine cluster topology mapping method and device and program product | |
| US20150052575A1 (en) | Steering Traffic Among Multiple Network Services Using a Centralized Dispatcher | |
| CN108347377B (en) | Data forwarding method and device | |
| CN113067860B (en) | Method, apparatus, device, medium and product for synchronizing information | |
| CN113344074B (en) | Model training method, device, equipment and storage medium | |
| CN113900810A (en) | Distributed graph processing method, system and storage medium | |
| CN111126613A (en) | Method, apparatus and computer program product for deep learning | |
| CN116760762B (en) | Decentralised ad hoc network method and device | |
| CN106878356B (en) | Scheduling method and computing node | |
| CN114070889B (en) | Configuration method, traffic forwarding device, storage medium, and program product | |
| US10708221B1 (en) | Generating a natural name data structure to prevent duplicate network data associated with an asynchronous distributed network operating system | |
| CN113691403A (en) | Topological node configuration method, related device and computer program product | |
| CN115118654B (en) | Data forwarding method, system, device and program product under virtual network | |
| CN112988738A (en) | Data slicing method and device for block chain | |
| CN117082029B (en) | Access method and device based on line cache, electronic equipment and storage medium | |
| CN112580803B (en) | Model acquisition method, apparatus, electronic device, storage medium, and program product | |
| CN110866002A (en) | Method and device for processing sub-table data | |
| CN115242733B (en) | Message multicast method, multicast gateway, electronic device and storage medium | |
| JP7289381B2 (en) | Methods and devices for acquiring information, electronic devices, storage media, and computer programs | |
| CN115955404B (en) | Internet of things scene management method, device, equipment and medium | |
| CN116996481B (en) | Live broadcast data acquisition method and device, electronic equipment and storage medium | |
| CN116546009B (en) | Asset discovery method, device, electronic equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |