CN111601352B - Vehicle-mounted self-organizing network routing method and system based on social attributes - Google Patents
Vehicle-mounted self-organizing network routing method and system based on social attributes Download PDFInfo
- Publication number
- CN111601352B CN111601352B CN202010167337.7A CN202010167337A CN111601352B CN 111601352 B CN111601352 B CN 111601352B CN 202010167337 A CN202010167337 A CN 202010167337A CN 111601352 B CN111601352 B CN 111601352B
- Authority
- CN
- China
- Prior art keywords
- node
- message
- vehicle
- community
- communities
- 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
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/023—Limited or focused flooding to selected areas of a network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/30—Services specially adapted for particular environments, situations or purposes
- H04W4/40—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a social attribute-based vehicle-mounted self-organizing network routing method and a social attribute-based vehicle-mounted self-organizing network routing system, wherein the method comprises the following steps: in a specific area, all vehicles in the area are divided into a plurality of communities according to the social habits of owners of the vehicles, and each vehicle belongs to one community. When a message needs to be distributed in an area, the node carrying the message calculates the forwarding priority of the node according to the association value of each community to the message, the number of the community nodes in a communication range and the node meeting probability, meanwhile, the forwarding priorities of the neighbor nodes are collected, the node with the highest forwarding priority is selected as a next hop node, the message is forwarded to the next hop node, and the next hop node continues to forward the message until all target nodes receive the message or the message expires. According to the method, the forwarding capacity of the community where the neighbor node is located and other communities is integrated according to the association values of different messages and different communities, and a proper forwarding node is selected, so that the message distribution efficiency is improved.
Description
Technical Field
The invention relates to the technical field of vehicle-mounted data transmission, in particular to a social attribute-based vehicle-mounted self-organizing network routing method and system.
Background
In the vehicle-mounted ad hoc network, as the number of vehicles sharply increases, the complexity of the message increases, and how to effectively spread the message in time is still a problem to be solved. If the message stays in the network for a long time or cannot reach the destination quickly, a large amount of resources are wasted and occupied, and the network performance is influenced.
The generated messages are effectively diffused in time in the vehicle-mounted self-organizing network according to the specific routing protocol, and the method has important values for enhancing the stability of the vehicle-mounted self-organizing network and improving the utilization rate of network resources. If a simple flooding algorithm is used, the message is delivered when the vehicle carrying the message encounters a new neighbor, a large number of duplicate messages will be generated in the network, and efficient delivery of the message to the destination cannot be ensured.
In recent years, researchers experiment and analyze the performance of different vehicle-mounted network routing protocols and explore more efficient and faster message transmission methods. At present, based on an SARP routing protocol provided by vehicle-mounted social networks (VSNs), three social characteristic indexes are comprehensively considered to calculate a forwarding strategy, namely, the social group acquaintance, the social activity aggressiveness and the communication capacity. Simulation experiments under the conditions of different moving speeds and different node densities show that the protocol shortens the end-to-end delay of message transmission and improves the transmission rate of the message. In addition, researchers provide an interest-based social perception network forwarding scheme, and the proposed protocol BEEINFO simulates that when bees seek food, the paths flying to honey can be found by perceiving the behaviors of the bees from and to the bees. The protocol is applied to the Internet of vehicles, and the density of shopping centers, hospitals and schools along other vehicles is judged to be used as a basis for selecting the next hop node. Besides, some researchers search different data transmission modes in the VSNs, and the researches find that the message transmission effect according to the social behaviors and the mobile modes of the vehicle-mounted nodes is good.
However, most studies currently distribute messages to all vehicles in a particular area without considering the difference in priority of distribution of different messages among different social groups, for example, some messages in the peripheral areas of schools need to be spread only among teachers, while other messages are more likely to be spread to peripheral residents. Meanwhile, there has been research on selecting a next hop node mainly by using factors such as a position, a speed, a moving direction of a vehicle, etc., social attributes of the nodes are not fully considered, repeated messages are easily generated, and stability of a network and timeliness of message propagation are affected.
Based on this, in the existing vehicle-mounted ad hoc network, a method how to quickly cover the message to the target group in a specific area according to the social attributes of the vehicle owner is urgently needed.
Disclosure of Invention
The present invention is directed to solving, at least to some extent, one of the technical problems in the related art.
Therefore, the invention aims to provide a vehicle-mounted self-organizing network routing method based on social attributes, which fully considers the social attributes of vehicle-mounted nodes and ensures the stability of the network and the timeliness of message propagation.
Another objective of the present invention is to provide a social attribute-based routing system for an in-vehicle ad hoc network.
In order to achieve the above object, an embodiment of the present invention provides a social attribute-based routing method for a vehicle-mounted ad hoc network, including the following steps: step S1, determining a community to which the current vehicle-mounted node belongs in a specific area; step S2, when the message carried by the current vehicle-mounted node is forwarded, the current vehicle-mounted node forwards the correlation value of the message and all communities and the forwarding priority of the current vehicle-mounted node to the neighbor node; step S3, processing the correlation values of the message and all communities to obtain the forwarding priorities of all neighbor nodes, judging whether the forwarding priority of each neighbor node is greater than the forwarding priority of the current vehicle-mounted node, if so, continuing to carry the message by the current vehicle-mounted node, and iteratively executing the steps S2-S3 until the forwarding priority of the neighbor node is greater than the forwarding priority of the vehicle-mounted node or all target nodes receive the message; if the current priority is higher than the current priority, the forwarding priorities of the neighbor nodes are sent to the current vehicle-mounted node, the forwarding priorities of all the neighbor nodes are arranged in a descending order, the message is forwarded to the neighbor node with the maximum priority, and the steps S1-S3 are executed in an iterative mode until all the target nodes receive the message.
According to the routing method of the vehicle-mounted self-organizing network based on the social attributes, when the next hop forwarding node is selected in the area, the forwarding capacity of the community where the neighbor node is located and other communities is integrated according to the association values of different messages and different communities, the appropriate forwarding node is selected, and the message distribution efficiency is improved.
In addition, the routing method for the vehicle-mounted ad hoc network based on the social attributes according to the above embodiments of the present invention may further have the following additional technical features:
further, in an embodiment of the present invention, the association value between the message and all communities is an association value between the message carried by the current vehicle-mounted node and all communities in the communication range of the current vehicle-mounted node, and the neighbor nodes are other neighbor nodes in the communication range of the current vehicle-mounted node.
Further, in one embodiment of the invention, the association value of any message with different communities is different, and the association value of the neighbor node in the same community with the current vehicle-mounted node is larger.
Further, in one embodiment of the invention, the communities are vehicle-mounted node sets with the same social attribute, and a plurality of communities are contained in a specific area.
Further, in an embodiment of the present invention, the calculation formula of the forwarding priority of any vehicle-mounted node is:
where α is the neighbor Community weight, CommunityAAs a community, KxIs a group of communities to which the neighbor nodes belong,
for sets of communities other than the community to which the neighbour node belongs, NAThe number of neighbor nodes of the community to which r belongsxAIs the probability, omega, that a node has historically met with a node of a communityAPIs the association value of any message and any community.
In order to achieve the above object, an embodiment of another aspect of the present invention provides a social attribute-based vehicle-mounted ad hoc network routing system, including: the determining module is used for determining a community to which the current vehicle-mounted node belongs in a specific area; the data forwarding module is used for forwarding the message carried by the current vehicle-mounted node, and the current vehicle-mounted node forwards the correlation value of the message and all communities and the forwarding priority of the current vehicle-mounted node to the neighbor node; the message forwarding module is used for processing the correlation values of the message and all communities to obtain the forwarding priorities of all neighbor nodes, judging whether the forwarding priority of each neighbor node is greater than the forwarding priority of the current vehicle-mounted node, if so, continuing to carry the message by the current vehicle-mounted node, and skipping back to the data forwarding module until the forwarding priority of the neighbor node is greater than the forwarding priority of the vehicle-mounted node or all target nodes receive the message; if the current forwarding priority is higher than the current forwarding priority, the forwarding priorities of the neighbor nodes are sent to the current vehicle-mounted node, the forwarding priorities of all the neighbor nodes are arranged in a descending order, the message is forwarded to the neighbor node with the highest priority, and the determining module is jumped back until all the target nodes receive the message.
According to the routing system of the vehicle-mounted self-organizing network based on the social attributes, when the next hop forwarding node is selected in the area, the forwarding capacity to the community where the neighbor node is located and other communities is integrated according to the association values of different messages and different communities, the appropriate forwarding node is selected, and the message distribution efficiency is improved.
In addition, the vehicle ad hoc network routing system based on social attributes according to the above embodiment of the present invention may further have the following additional technical features:
further, in an embodiment of the present invention, the association value between the message and all communities is an association value between the message carried by the current vehicle-mounted node and all communities in the communication range of the current vehicle-mounted node, and the neighbor nodes are other neighbor nodes in the communication range of the current vehicle-mounted node.
Further, in one embodiment of the invention, the association value of any message with different communities is different, and the association value of the neighbor node in the same community with the current vehicle-mounted node is larger.
Further, in one embodiment of the invention, the communities are vehicle-mounted node sets with the same social attribute, and a plurality of communities are contained in a specific area.
Further, in an embodiment of the present invention, the calculation formula of the forwarding priority of any vehicle-mounted node is:
where α is the neighbor Community weight, CommunityAAs a community, KxIs a group of communities to which the neighbor nodes belong,
for sets of communities other than the community to which the neighbour node belongs, NAThe number of neighbor nodes of the community to which r belongsxAIs the probability, omega, that a node has historically met with a node of a communityAPIs the association value of any message and any community.
Additional aspects and advantages of the invention will be set forth in part in the description which follows and, in part, will be obvious from the description, or may be learned by practice of the invention.
Drawings
The foregoing and/or additional aspects and advantages of the present invention will become apparent and readily appreciated from the following description of the embodiments, taken in conjunction with the accompanying drawings of which:
FIG. 1 is a flow diagram of a method for routing a vehicle ad hoc network based on social attributes, according to an embodiment of the present invention;
FIG. 2 is a diagram of a neighbor dense scenario in accordance with an embodiment of the present invention;
FIG. 3 is a diagram illustrating a neighbor sparse scene in accordance with an embodiment of the present invention;
fig. 4 is a schematic structural diagram of a routing system of a vehicle-mounted ad hoc network based on social attributes according to an embodiment of the present invention.
Detailed Description
Reference will now be made in detail to embodiments of the present invention, examples of which are illustrated in the accompanying drawings, wherein like or similar reference numerals refer to the same or similar elements or elements having the same or similar function throughout. The embodiments described below with reference to the drawings are illustrative and intended to be illustrative of the invention and are not to be construed as limiting the invention.
The following describes a vehicle-mounted ad hoc network routing method and system based on social attributes according to an embodiment of the present invention with reference to the drawings, and first, the vehicle-mounted ad hoc network routing method based on social attributes according to an embodiment of the present invention will be described with reference to the drawings.
Fig. 1 is a flowchart of a routing method for a vehicle ad hoc network based on social attributes according to an embodiment of the present invention.
As shown in fig. 1, the social attribute-based routing method for the vehicle-mounted ad hoc network includes the following steps:
in step S1, the community to which the current in-vehicle node belongs is determined within the specific area.
Further, in one embodiment of the invention, the communities are vehicle-mounted node sets with the same social attribute, and a plurality of communities are contained in a specific area.
For example, assuming that any on-board node x in the area already has social attribute A, on-board nodes having the same social attribute A are divided into a Community CommunityAThat is, the vehicle-mounted node x belongs to the Community CommunityAX ∈ CommunnityA. The set of all communities in the area is denoted as CS.
In step S2, when the message carried by the current vehicle-mounted node is forwarded, the current vehicle-mounted node forwards the association value between the message and all communities and the forwarding priority of the current vehicle-mounted node to the neighboring node.
Further, in an embodiment of the present invention, the association value between the message and all the communities is the association value between the message carried by the current vehicle-mounted node and all the communities in the communication range of the current vehicle-mounted node, and the neighbor node is another neighbor node in the communication range of the current vehicle-mounted node. Wherein, the association value of any Message and different communities is different, and the Message of any Message is recordedPAnd any Community CommunityAIs ωAPThe larger the correlation value of the neighbor nodes in the same community with the current vehicle-mounted node is.
In step S3, the association values of the message and all communities are processed to obtain the forwarding priorities of all neighboring nodes, and it is determined whether the forwarding priority of each neighboring node is greater than the forwarding priority of the current vehicle-mounted node,
if the current forwarding priority of the neighbor node is less than the forwarding priority of the vehicle-mounted node, the current vehicle-mounted node continues to carry the message, and the steps S2-S3 are executed in an iterative manner until the forwarding priority of the neighbor node is greater than the forwarding priority of the vehicle-mounted node or all target nodes receive the message;
if the priority is greater than the current priority, the forwarding priorities of the neighbor nodes are sent to the current vehicle-mounted node, the forwarding priorities of all the neighbor nodes are arranged in a descending order, the message is forwarded to the neighbor node with the maximum priority, and the steps S1-S3 are executed in an iterative mode until all the target nodes receive the message.
Further, in an embodiment of the present invention, the calculation formula of the forwarding priority of any vehicle-mounted node is:
where α is the neighbor Community weight, CommunityAAs a community, KxIs a group of communities to which the neighbor nodes belong,
for collections of communities other than the community to which the neighbor node belongs
NAThe number of neighbor nodes of the community to which r belongsxAIs the probability, omega, that a node has historically met with a node of a communityAPIs the association value of any message and any community.
That is, when carrying the MessagePWhen the vehicle-mounted node x meets other vehicle-mounted nodes (namely other vehicle-mounted nodes in the communication range of the vehicle-mounted node x, called neighbor nodes) in the area driving process, the vehicle-mounted node x calculates the forwarding priority of the vehicle-mounted node x, collects the forwarding priorities of the neighbor nodes at the same time, and selects the node with the highest forwarding priority as the next hop node. If the next hop node is not the next hop node, the vehicle-mounted node x sends a Message to the next hop nodePAnd forwarded to the next hop node.
It should be noted that, the related symbols applied in the embodiment of the present invention are abbreviated as the following table one:
table one: short for symbol
To sum up, the method for selecting the route of the vehicle-mounted self-organizing network based on the social attributes comprises the following specific implementation steps:
the method comprises the following steps that firstly, a vehicle-mounted node x is started, the social attribute of a vehicle owner of the vehicle-mounted node x is requested from a server, and the social attribute is stored in an in-vehicle system;
step two, when the vehicle-mounted node x enters the Area, monitoring the message and preparing to forward;
step three, in the Area, when carrying the MessagePWhen the vehicle-mounted node x has the neighbor node, the following judgment is carried out:
vehicle-mounted node x sends Message toPCorrelation values with all communities and forwarding priorities of the communities themselves
Forwarding to the neighbor node;
when the neighbor node y of the vehicle-mounted node x receives the MessagePCalculating the self-to-Message when the association value of all communitiesPForward priority of
If it is not
The node y sends the forwarding priority of the node y to the node x and waits for the feedback of the node x;
the vehicle-mounted node x receives the messages of all the neighbor nodes with the forwarding priority higher than that of the vehicle-mounted node x, and selects one neighbor node with the highest forwarding priority from the messages, wherein the node y is assumed at the moment. Node x informs node y to forward the Message in place of itselfPWhile node x stops responding to the MessagePForwarding;
if the vehicle-mounted node x does not receive any message of the node with the forwarding priority higher than the forwarding priority of the node x, the node x continues to forward the message, and the third step is circulated.
Step four, in the Area, when the node y receives the MessagePWhen the Message is notified, the Message transmission is startedPAnd find the next hop node.
In the following description, the social attribute-based routing method for a vehicle-mounted ad hoc network according to the present invention is applied to the following specific embodiments:
suppose there are three communities within the known Area, namely student S, teacher T and worker W; there are four different types of messages, within an AreaO、MessageQ、MessageRAnd MessageUThe association value of each community to different messages is shown in table two:
table two: association value of each community to different messages
There are two situations in a vehicle-mounted node x neighbor distribution scene in Area, namely neighbor density and neighbor sparsity. The statistical value of the meeting probability of the nodes among different communities is shown in the third table.
Table three: statistical table of node meeting probability (r) among different communities
| Community name | S | T | W |
| S | 0 | 0.7 | 0.3 |
| T | 0.7 | 0 | 0.3 |
| W | 0.3 | 0.3 | 0 |
The neighbor community weight α is 0.5. Then the forwarding priority value of any node x is given in two scenarios
The calculation method of (c) is as follows:
scene one: as shown in fig. 2, when the neighbor of node x is dense, the method for calculating the forwarding priority of node x is as follows:
(a) vehicle node x pair MessageOForwarding priority of (2):
(b) vehicle node x pair MessageQForward priority of：
(c) Vehicle node x pair MessageRForwarding priority of (2):
(d) vehicle node x pair MessageUForwarding priority of (2):
in a second scenario, as shown in fig. 3, when the neighborhood of the vehicle-mounted node x is sparse, the method for calculating the forwarding priority value of the vehicle-mounted node x is as follows:
(a) vehicle node x pair MessageOForwarding priority of (2):
(b) vehicle node x pair MessageQForwarding priority of (2):
(c) vehicle node x pair MessageRForwarding priority of (2):
(d) the forwarding priority of the vehicle-mounted node to the message is as follows:
the statistics of forwarding priority values of different messages by the vehicle-mounted node under different scenes are shown in the following table four:
according to the routing method of the vehicle-mounted self-organizing network based on the social attributes, provided by the embodiment of the invention, when the next hop forwarding node is selected in the area, the forwarding capability to the community where the neighbor node is located and other communities is integrated according to the association values of different messages and different communities, and a proper forwarding node is selected, so that the message distribution efficiency is improved.
The following describes a social attribute-based vehicle-mounted ad hoc network routing system proposed according to an embodiment of the present invention with reference to the drawings.
Fig. 4 is a schematic structural diagram of a social attribute-based vehicular ad hoc network routing system according to an embodiment of the present invention.
As shown in fig. 4, the system 10 includes: a determination module 100, a data forwarding module 200 and a message forwarding module 300.
The determining module 100 is configured to determine a community to which a current vehicle-mounted node belongs within a specific area.
Further, in one embodiment of the invention, the communities are vehicle-mounted node sets with the same social attribute, and a plurality of communities are contained in a specific area.
The data forwarding module 200 is configured to forward a message carried by a current vehicle-mounted node, where the current vehicle-mounted node forwards association values of the message and all communities and forwarding priorities of the current vehicle-mounted node to neighboring nodes.
Further, in an embodiment of the present invention, the association value between the message and all the communities is the association value between the message carried by the current vehicle-mounted node and all the communities in the communication range of the current vehicle-mounted node, and the neighbor node is another neighbor node in the communication range of the current vehicle-mounted node. The association value of any message is different from that of different communities, and the association value of the message and the neighbor node of the current vehicle-mounted node in the same community is larger.
The message forwarding module 300 is configured to process the association values of the message and all communities to obtain the forwarding priorities of all neighboring nodes, and determine whether the forwarding priority of each neighboring node is greater than the forwarding priority of the current vehicle-mounted node,
if the current forwarding priority of the neighbor nodes is less than the forwarding priority of the vehicle-mounted node, the current vehicle-mounted node continues to carry the message and skips back to the data forwarding module until the forwarding priority of the neighbor nodes is greater than the forwarding priority of the vehicle-mounted node or all target nodes receive the message;
if the priority is greater than the maximum priority, the forwarding priorities of the neighbor nodes are sent to the current vehicle-mounted node, the forwarding priorities of all the neighbor nodes are arranged in a descending order, the message is forwarded to the neighbor node with the maximum priority, and the determining module is jumped back until all the target nodes receive the message.
Further, in an embodiment of the present invention, the calculation formula of the forwarding priority of any vehicle-mounted node is:
where α is the neighbor Community weight, CommunityAAs a community, KxIs a group of communities to which the neighbor nodes belong,
for collections of communities other than the community to which the neighbor node belongs
NAThe number of neighbor nodes of the community to which r belongsxAIs the probability, omega, that a node has historically met with a node of a communityAPIs the association value of any message and any community.
According to the routing system of the vehicle-mounted self-organizing network based on the social attributes, provided by the embodiment of the invention, when the next hop forwarding node is selected in the area, the forwarding capability to the community where the neighbor node is located and other communities is integrated according to the association values of different messages and different communities, and a proper forwarding node is selected, so that the message distribution efficiency is improved.
Furthermore, the terms "first", "second" and "first" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one such feature. In the description of the present invention, "a plurality" means at least two, e.g., two, three, etc., unless specifically limited otherwise.
In the description herein, references to the description of the term "one embodiment," "some embodiments," "an example," "a specific example," or "some examples," etc., mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, the schematic representations of the terms used above are not necessarily intended to refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, various embodiments or examples and features of different embodiments or examples described in this specification can be combined and combined by one skilled in the art without contradiction.
Although embodiments of the present invention have been shown and described above, it is understood that the above embodiments are exemplary and should not be construed as limiting the present invention, and that variations, modifications, substitutions and alterations can be made to the above embodiments by those of ordinary skill in the art within the scope of the present invention.
Claims (6)
1. A social attribute-based routing method for a vehicle-mounted ad hoc network is characterized by comprising the following steps:
step S1, determining a community to which the current vehicle-mounted node belongs in a specific area;
step S2, when the message carried by the current vehicle-mounted node is forwarded, the current vehicle-mounted node forwards the correlation value of the message and all communities and the forwarding priority of the current vehicle-mounted node to the neighbor node;
step S3, processing the association value of the message and all communities to obtain the forwarding priority of all neighboring nodes, and judging whether the forwarding priority of each neighboring node is larger than the forwarding priority of the current vehicle-mounted node,
if the current vehicle-mounted node carries the message continuously, the current vehicle-mounted node carries the message repeatedly, and the steps S2-S3 are executed until the forwarding priority of the neighbor node is greater than the forwarding priority of the vehicle-mounted node or all target nodes receive the message;
if the current communication priority is greater than the preset value, sending the forwarding priority of the neighbor node to the current vehicle-mounted node, sequencing the forwarding priorities of all the neighbor nodes in a descending order, forwarding the message to the neighbor node with the maximum priority, and iteratively executing the steps S1-S3 until all the target nodes receive the message, wherein the association value between the message and all the communities is the association value between the message carried by the current vehicle-mounted node and all the communities in the communication range of the current vehicle-mounted node, the neighbor nodes are other neighbor nodes in the communication range of the current vehicle-mounted node, and the calculation formula of the forwarding priority of any vehicle-mounted node is as follows:
where α is the neighbor Community weight, A is the social attribute, CommunityAIs a community, x is a vehicle node, KxTo which neighbor node belongsA set of communities is provided with a community set,
for sets of communities other than the community to which the neighbour node belongs, NAThe number of neighbor nodes of the community to which r belongsxAIs the probability of the node meeting the node history of the community, P is the message, omegaAPIs the association value of any message and any community.
2. The social attribute-based routing method for the vehicle-mounted ad hoc network according to claim 1, wherein the information carried by the current vehicle-mounted node is different from the association values of different communities, and the association value of the neighbor node in the same community with the current vehicle-mounted node is larger.
3. The social attribute-based routing method for vehicle-mounted ad hoc networks according to claim 1, wherein the communities are a set of vehicle-mounted nodes with the same social attribute, and a plurality of communities are included in a specific area.
4. An on-board ad hoc network routing system based on social attributes, comprising:
the determining module is used for determining a community to which the current vehicle-mounted node belongs in a specific area;
the data forwarding module is used for forwarding the message carried by the current vehicle-mounted node, and the current vehicle-mounted node forwards the correlation value of the message and all communities and the forwarding priority of the current vehicle-mounted node to the neighbor node;
a message forwarding module for processing the correlation values of the message and all communities to obtain the forwarding priorities of all neighbor nodes and judging whether the forwarding priority of each neighbor node is greater than the forwarding priority of the current vehicle-mounted node,
if the current vehicle-mounted node carries the message continuously, the current vehicle-mounted node jumps back to the data forwarding module until the forwarding priority of the neighbor node is greater than the forwarding priority of the vehicle-mounted node or all target nodes receive the message;
if the current vehicle-mounted node is larger than the preset value, the forwarding priority of the neighbor node is sent to the current vehicle-mounted node, the forwarding priorities of all the neighbor nodes are arranged in a descending order, the message is forwarded to the neighbor node with the maximum priority, the determining module is jumped back until all the target nodes receive the message, the association value between the message and all the communities in the communication range of the current vehicle-mounted node is the association value between the message carried by the current vehicle-mounted node and all the communities in the communication range of the current vehicle-mounted node, the neighbor nodes are other neighbor nodes in the communication range of the current vehicle-mounted node, and the calculation formula of the forwarding priority of any vehicle-mounted node is as follows:
where α is the neighbor Community weight, A is the social attribute, CommunityAIs a community, x is a vehicle node, KxIs a group of communities to which the neighbor nodes belong,
for sets of communities other than the community to which the neighbour node belongs, NAThe number of neighbor nodes of the community to which r belongsxAIs the probability of the node meeting the node history of the community, P is the message, omegaAPIs the association value of any message and any community.
5. The social attribute-based vehicle-mounted ad hoc network routing system according to claim 4, wherein the information carried by the current vehicle-mounted node is different from the association values of different communities, and the association value of the neighbor node in the same community with the current vehicle-mounted node is larger.
6. The social attribute-based vehicular ad hoc network routing system of claim 4, wherein the communities are a set of vehicular nodes having the same social attribute, and a plurality of communities are included in a specific area.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010167337.7A CN111601352B (en) | 2020-03-11 | 2020-03-11 | Vehicle-mounted self-organizing network routing method and system based on social attributes |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010167337.7A CN111601352B (en) | 2020-03-11 | 2020-03-11 | Vehicle-mounted self-organizing network routing method and system based on social attributes |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111601352A CN111601352A (en) | 2020-08-28 |
| CN111601352B true CN111601352B (en) | 2022-04-05 |
Family
ID=72191101
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010167337.7A Active CN111601352B (en) | 2020-03-11 | 2020-03-11 | Vehicle-mounted self-organizing network routing method and system based on social attributes |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111601352B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113114735B (en) * | 2021-03-25 | 2022-07-01 | 首都师范大学 | Data forwarding method and device for intersection in urban social networking service |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2337280A1 (en) * | 2009-12-21 | 2011-06-22 | Thomson Licensing | Method to manage an opportunistic communication network |
| CN103345531B (en) * | 2013-07-26 | 2017-05-24 | 苏州大学 | Method and device for determining network community in complex network |
| KR101601774B1 (en) * | 2015-02-17 | 2016-03-10 | 서강대학교산학협력단 | Routing method for vanet |
| CN109600815B (en) * | 2018-12-12 | 2021-03-16 | 东软集团（北京）有限公司 | Method, device, storage equipment and program product for realizing data forwarding |
| CN109656898B (en) * | 2018-12-14 | 2021-05-07 | 中国人民解放军国防科技大学 | Distributed large-scale complex community detection method and device based on node degree |
| CN110213806A (en) * | 2019-05-14 | 2019-09-06 | 华中师范大学 | The mobile opportunistic network routing method of Spray & Wait based on node social property |
-
2020
- 2020-03-11 CN CN202010167337.7A patent/CN111601352B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN111601352A (en) | 2020-08-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP1298837B1 (en) | Method and system for dynamic grouping of mobile objects | |
| Azizian et al. | A distributed D-hop cluster formation for VANET | |
| Saleh et al. | A reliable routing protocol for vehicular ad hoc networks | |
| CN1474614A (en) | Mobile AD-HOC network based on weighting quality measuration and executive function thereof | |
| Hossain et al. | Multi-objective Harris hawks optimization algorithm based 2-Hop routing algorithm for CR-VANET | |
| Meneguette et al. | SERVitES: An efficient search and allocation resource protocol based on V2V communication for vehicular cloud | |
| Ahmadi et al. | A hybrid algorithm for preserving energy and delay routing in mobile ad-hoc networks | |
| Kandali et al. | An intelligent machine learning based routing scheme for VANET | |
| Arkian et al. | FcVcA: A fuzzy clustering-based vehicular cloud architecture | |
| CN111601352B (en) | Vehicle-mounted self-organizing network routing method and system based on social attributes | |
| CN107148064A (en) | A kind of In-vehicle networking routed path optimization method based on population | |
| Huang et al. | Data dissemination of application service by using member-centric routing protocol in a platoon of internet of vehicle (IoV) | |
| Kasana et al. | A geographic routing algorithm based on Cat Swarm Optimization for vehicular ad-hoc networks | |
| CN105228215B (en) | More copy method for routing based on decision tree mechanism in vehicular ad hoc network | |
| WO2012171362A1 (en) | Method and device for establishing coordinated multi-point transmission cell coordination set | |
| Bali et al. | An intelligent clustering algorithm for VANETs | |
| CN108881016B (en) | Method for constructing self-organizing network community of Internet of vehicles and balancing communication load of community nodes | |
| Zhong et al. | Dynamic periodic location encounter network analysis for vehicular social networks | |
| Elhdhili et al. | CASAN: Clustering algorithm for security in ad hoc networks | |
| CN111818484A (en) | Safety route control method for Internet of vehicles | |
| KR101979119B1 (en) | Determining method for location of coordinator collecting sensing data | |
| Sudhakar et al. | A hybrid swarm intelligent framework to support efficient military communication in MANET | |
| Zheng et al. | A stable ant-based routing protocol for flying ad hoc networks | |
| Royer et al. | An enhanced 1-hop clustering algorithm for Publish/Subscribe systems in AANETS | |
| Dwivedy et al. | Clustering Adaptive Elephant Herd Optimization Based Data Dissemination Protocol for VANETs |
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 |