CN108924896B - Community-type opportunity network data forwarding method - Google Patents
Community-type opportunity network data forwarding method Download PDFInfo
- Publication number
- CN108924896B CN108924896B CN201810856041.9A CN201810856041A CN108924896B CN 108924896 B CN108924896 B CN 108924896B CN 201810856041 A CN201810856041 A CN 201810856041A CN 108924896 B CN108924896 B CN 108924896B
- Authority
- CN
- China
- Prior art keywords
- node
- data packet
- community
- time slot
- forwarding
- 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 31
- 230000008569 process Effects 0.000 claims abstract description 7
- 230000003993 interaction Effects 0.000 claims description 16
- 238000004364 calculation method Methods 0.000 claims description 9
- 239000006185 dispersion Substances 0.000 claims description 9
- 235000008694 Humulus lupulus Nutrition 0.000 claims description 6
- 230000008859 change Effects 0.000 claims description 4
- 230000005540 biological transmission Effects 0.000 abstract description 4
- 230000007246 mechanism Effects 0.000 description 5
- 238000004891 communication Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000002452 interceptive effect Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/02—Services making use of location information
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/02—Services making use of location information
- H04W4/025—Services making use of location information using location based information parameters
- H04W4/026—Services making use of location information using location based information parameters using orientation information, e.g. compass
-
- 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/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a community-type opportunity network data forwarding method, which is characterized in that a data packet in a source node community is forwarded in a single-copy forwarding mode, the central utility value of a neighbor node is calculated, the data packet is sent to a node with the maximum central utility value in the neighbor node, and the process is repeated until the data packet is sent to a target node. When the data packet is forwarded between communities, because the community where the destination node is located is unknown, the community to which the destination node is directly sent cannot be accurately known, so that a multi-copy forwarding mode is adopted to increase the delivery rate, the data packet is sent to delivery boxes of other communities, and a node set N corresponding to the community is inquiredaTo find the destination node and then forward the packet to the destination node. The method of the invention is directly applied to the community opportunity network, so that the network transmission speed is increased, and the message load is reduced.
Description
Technical Field
The invention belongs to the field of opportunity network forwarding of delay tolerant networks, and particularly relates to a community-type opportunity network data forwarding method.
Background
With the development of society, computer network technology has been developed very well and has grown mature. Wireless networks are becoming increasingly indispensable in the day-to-day lives of humans. However, wireless networks are not well utilized because of a series of difficult problems with mobility, distance, etc.
The opportunistic network is a network which does not need to be completely communicated end to end, and messages can be smoothly sent from a source node to a destination node through the movement of nodes, the storage of data and the forwarding opportunity of the data. A hot problem in opportunistic network research is how to send messages from a source node to a destination node with higher forward delivery rate, less time delay and less information load. However, at present, no opportunistic network forwarding mechanism can be applied to all application scenarios, and a data forwarding mechanism meeting the application scenarios needs to be selected according to requirements on different occasions.
A network consisting of mobile devices carried by people with short-range communication interfaces is of a community nature. The multi-copy or single-copy routing algorithms in the current opportunistic network do not consider the community properties of the nodes, and if the algorithms are directly applied to the community type opportunistic network, the problems of large transmission delay, large message load and the like can be caused.
In view of the above, it is necessary to provide a method for forwarding network data in a community-based opportunity to solve the above problems.
Disclosure of Invention
The invention aims to provide a community type opportunity network data forwarding method with high forwarding efficiency.
In order to achieve the purpose, the invention adopts the following technical scheme: a network data forwarding method for community-type computer conference is characterized in that each community is provided with a delivery box, the delivery box stores the serial number a of the community, and a node set N of the communitya＝{na1,na2,…,nal}; the node carries the number information of the community in which the node is located, the position coordinates of the previous time slot node and the current time slot node, and the moving direction of the node in the current time slot can be calculated according to the position coordinates of the previous time slot node and the current time slot node; the data packet carries a forwarding hop count M in a source node community, a hop count G for forwarding after going out of the source node community, and position coordinates of a previous time slot and a current time slot for sending the data packet node, and the moving direction of the node when sending the data packet can be calculated according to the position coordinates of the previous time slot and the current time slot for sending the data packet node; the method mainly comprises the following steps:
step 1: in the time slot t, when a node j carries a data packet to be forwarded, if a destination node is in the neighbor nodes, the data packet is directly forwarded to the destination node; if the neighbor node does not have a destination node and the forwarding hop number M of the data packet in the source node community where the node j is located is not more than the threshold value M, forwarding the data packet to the neighbor node with the maximum central utility value until the data packet is forwarded to the destination node;
step 2: if the forwarding hop number M of the data packet in the source node community is larger than the threshold value M, the data packet is sent to a delivery box in the source node community, and a node set N is inquiredaIf the destination node with the data packet in the source node community is obtained through inquiry, the destination node is directly forwarded to the delivery box; if inquiringIf a destination node without a data packet in the source node community is obtained, the delivery box randomly forwards the destination node to the mobile node of the source node community;
and step 3: when the hop count G of forwarding after a mobile node carrying a data packet exits from a source node community is not more than a threshold value G, the data packet is sent to a delivery box of other communities when passing through other community areas, whether a destination node exists in a node set Na of the corresponding community is inquired, and if a destination node of the data packet exists in the corresponding community, the data packet is directly forwarded to the destination node by the delivery box; if a delivery box in a community receives a data packet but corresponds to a destination node without the data packet in the community, when an included angle theta between the moving direction of a mobile node in the community and the moving direction of the node when the node sends the data packet is calculated according to position coordinates carried by the data packet is within a preset range, the delivery box forwards the data packet to the mobile node in the community, the mobile node carrying the data packet passes through other community areas, the data packet is sent to delivery boxes of other communities, and each community is ensured to have one data packet until the data packet is sent to the destination node;
and 4, step 4: and when the hop number G for forwarding after the mobile node carrying the data packet exits the source node community is larger than the threshold value G, stopping forwarding all the nodes carrying the data packet and the delivery box, and waiting for the appearance of the target node and forwarding the target node to the target node.
The technical scheme of the invention is further improved as follows: in step 1, defining the central utility value of the node j as Uj：
Uj＝αv+βu
Wherein, α and β are weights, u is a normalized value of the total number of times of interaction of the node j in the time slot t, and v is a normalized value of the number of changes of the neighbor node of the node j in the time slot t.
The technical scheme of the invention is further improved as follows: the normalized value u of the total number of interactions of the node j in the time slot t is calculated by the following formula:
wherein，
Is the total number of times that node j interacts with other nodes in time slot t, μ is the average of the total number of interactions from the beginning to time slot t, and σ is the dispersion.
The technical scheme of the invention is further improved as follows: the formula for calculating the average value μ of the total number of interactions from the start to the time slot t is:
wherein,
is the total number of times node j interacts with other nodes in time slot t.
The technical scheme of the invention is further improved as follows: the formula for calculating the dispersion σ is:
wherein,
is the total number of times node j interacts with other nodes in time slot t.
The technical scheme of the invention is further improved as follows: the normalized value v of the neighbor node variation number of the node j in the time slot t is calculated by the following formula:
wherein,
the number is updated for the neighbors of node j in time slot t,
is the average of the neighbor node change numbers from the beginning to time slot t,
is the dispersion.
The technical scheme of the invention is further improved as follows: neighbor update number of node j in time slot t
The calculation formula of (a) is as follows:
wherein v isj(t) is the set of neighbor nodes for time slot t, vj(told) Is the set of neighbor nodes of the previous slot.
The technical scheme of the invention is further improved as follows: in step 3, a specific calculation process of an included angle θ between the moving direction of the mobile node in the community and the moving direction when the node sends the data packet is calculated according to the position coordinates carried by the data packet is as follows:
defining the hop number of a data packet which is not forwarded just out of a community as 0 hop, and in the 0 hop stage, the position coordinates of a mobile node carrying the data packet in the current time slot and the position coordinates of the mobile node carrying the data packet in the previous time slot are respectively (x)0,y0)，(x0',y0')；
Similarly, in the c-hop moving stage, the position coordinates of the mobile node carrying the data packet in the current time slot and the previous time slot are respectively (x)c,yc)，(xc',yc') to a host; in the c +1 jump moving stage, the position coordinates of the mobile node carrying the data packet in the current time slot and the previous time slot are respectively (x)c+1,yc+1)，(x'c+1,y'c+1)；
When the number of outgoing community forwarding hops G of the data packet is not more than the threshold value G, under c hops and c +1 hops, the calculation formula of the included angle theta between the moving direction of the mobile node and the moving direction calculated by the node when the node sends the data packet according to the position coordinates carried by the data packet is as follows:
wherein k is less than or equal to 1.
The invention has the beneficial effects that: the invention discloses a community-type opportunity network data forwarding method, when a destination node and a source node are in the same community, a data packet is sent to the destination node; when the target node and the source node are not in the same community, the mobile node of the source node community is randomly forwarded, and forwarding is continued until the mobile node is sent to the target node; thereby improving the efficiency of data forwarding in the opportunistic network.
Drawings
Fig. 1 is an inter-community forwarding diagram of the method for forwarding data in a community-based opportunistic network according to the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention will be described in detail with reference to the accompanying drawings and detailed description.
Fig. 1 is a diagram illustrating inter-community forwarding of the method for forwarding data in a community-based opportunistic network according to the present invention. The invention divides the whole plane into a plurality of communities according to the geographical position of the building, and can carry out forwarding in and among the communities. And a delivery box is arranged in each community to process the data packet of which the destination node is not in the source node community. The delivery box stores the number a of the community and the node set N of the communitya＝{na1,na2,…,nalAnd a node set NaSaving the node number of the node in the community for inquiring the destination node; the node carries the number information of the community in which the node is located, the position coordinates of the previous time slot node and the current time slot node, and the moving direction of the node in the current time slot can be calculated according to the position coordinates of the previous time slot node and the current time slot node; the data packet carries the forwarding hop count M in the source node community, the hop count G for forwarding after exiting the source node community, the position coordinates of the previous time slot and the current time slot for sending the data packet node, and the data packet can be sent according to the position coordinates of the data packet nodeAnd calculating the position coordinates of the previous time slot and the current time slot of the packet node to obtain the moving direction of the node when the node sends the data packet. Specifically, the delivery box is arranged at the central position of each community, the interaction range of the delivery box is the whole community, and the delivery box has nodes with larger information storage amount.
When the data packet is forwarded in the community, the data packet in the source node community is forwarded according to the central utility value of the node, the node with the maximum central utility value around is preferentially selected for forwarding, and the central utility value is determined by the total number of node interaction and the neighbor update number.
When the data packet is forwarded between communities, the data packet is sent to the mobile node of each community by the delivery box in each community, the mobile node calculates an included angle theta between the moving direction of the mobile node of each community and the moving direction when the mobile node sends the data packet according to the moving direction of the mobile node of each community and the position coordinate carried by the data packet, and sends the data packet to the delivery boxes of other communities, and each community is guaranteed to have one data packet until the data packet is sent to a destination node.
Specifically, the community-type opportunistic network data forwarding method comprises the following steps:
step 1: in the time slot t, when a node j carries a data packet to be forwarded, if a destination node is in the neighbor nodes, the data packet is directly forwarded to the destination node; if the neighbor node does not have a destination node and the forwarding hop number M of the data packet in the source node community where the node j is located is not more than the threshold value M, forwarding the data packet to the neighbor node with the maximum central utility value until the data packet is forwarded to the destination node;
step 2: if the forwarding hop number M of the data packet in the source node community is larger than the threshold value M, the data packet is sent to a delivery box in the source node community, and a node set N is inquiredaIf the destination node with the data packet in the source node community is obtained through inquiry, the destination node is directly forwarded to the delivery box; if the destination node without the data packet in the source node community is obtained through query, the delivery box randomly forwards the destination node to the mobile node of the source node community;
and step 3: when the mobile node carrying the data packet is out of sourceThe hop count G of forwarding after the node community is not more than the threshold value G, when the node community passes through other communities, the data packet is sent to a delivery box of other communities, and the current position coordinate of the node when the data packet is sent is (x)c,yc) The position coordinate of the previous time slot is (x)c',yc') receiving the data packet, inquiring the node set N of the corresponding community by the delivery boxaIf the destination node of the data packet exists in the corresponding community, the destination node is directly forwarded to by the delivery box; if a delivery box in a community receives a data packet but corresponds to a destination node without the data packet in the community, when an included angle theta between the moving direction of a mobile node in the community and the moving direction of the node when the node sends the data packet is calculated according to position coordinates carried by the data packet is within a preset range, the delivery box forwards the data packet to the mobile node in the community, the mobile node carrying the data packet passes through other community areas, the data packet is sent to delivery boxes of other communities, and each community is ensured to have one data packet until the data packet is sent to the destination node;
and 4, step 4: and when the hop number G for forwarding after the mobile node carrying the data packet exits the source node community is larger than the threshold value G, stopping forwarding all the nodes carrying the data packet and the delivery box, and waiting for the appearance of the target node and forwarding the target node to the target node.
In step 1, the central utility value is used for describing the capability of the source node to successfully transmit the data packet to the destination node, and the invention reflects the central utility value, namely the transmission capability, by using the total interactive times of the node and the neighbor update number.
Specifically, the step of calculating the central utility value is as follows:
defining the central utility value of node j as Uj：
Uj＝αv+βu
Wherein, α and β are weights, u is a normalized value of the total number of times of interaction of the node j in the time slot t, and v is a normalized value of the number of changes of the neighbor node of the node j in the time slot t.
Calculating the utility value U of the node centerjThen, selecting the central utility value larger than the nodeAnd the largest node forwards once.
The normalized value u of the total number of interactions of the node j in the time slot t is calculated by the following formula:
wherein,
is the total number of times that node j interacts with other nodes in time slot t, μ is the average of the total number of interactions from the start to time slot t, and σ is the dispersion.
The formula for the average value μ of the total number of interactions from the start to the time slot t is:
wherein,
is the total number of times node j interacts with other nodes in time slot t.
The formula for calculating the dispersion σ is:
wherein,
is the total number of times node j interacts with other nodes in time slot t.
The normalized value v of the neighbor node variation number of the node j in the time slot t is calculated by the following formula:
wherein,
the number is updated for the neighbors of node j in time slot t,
is the average of the neighbor node change numbers from the beginning to time slot t,
is the dispersion.
Neighbor update number of node j in time slot t
The calculation formula of (a) is as follows:
wherein v isj(t) is the set of neighbor nodes for time slot t, vj(told) Is the set of neighbor nodes of the previous slot.
The larger the total interaction times of the nodes are, the higher the neighbor change number is, and the better the transmission capability of the nodes is.
And 3, in the data packet forwarding process, the included angle theta range can be properly increased and can be sent to more communities to increase the delivery rate.
In step 3, a specific calculation process of an included angle θ between the moving direction of the mobile node in the community and the moving direction when the node sends the data packet is calculated according to the position coordinates carried by the data packet is as follows: defining the hop number of a data packet which is not forwarded just out of a community as 0 hop, and in the 0 hop stage, the position coordinates of a mobile node carrying the data packet in the current time slot and the position coordinates of the mobile node carrying the data packet in the previous time slot are respectively (x)0,y0)、(x0',y0') according to two coordinate values (x)0,y0)、(x0',y0') the direction of movement of the mobile node can be derived; in the 1-hop moving stage, the position coordinates of the mobile node carrying the data packet in the current time slot and the previous time slot are respectively (x)1,y1)、(x1',y1') to a host; similarly, in the c-hop moving stage, the position coordinates of the mobile node carrying the data packet in the current time slot and the previous time slot are respectively (x)c,yc)、(xc',yc') to a host; in the c +1 jump moving stage, the position coordinates of the mobile node carrying the data packet in the current time slot and the previous time slot are respectively (x)c+1,yc+1)、(x'c+1,y'c+1). When the hop number G of forwarding after the data packet is out of the source node community is not more than the threshold value G, under the hop of c and the hop of c +1, the calculation formula of the included angle theta between the moving direction of the mobile node and the moving direction when the node sends the data packet is calculated according to the position coordinates carried by the data packet as follows:
wherein k is less than or equal to 1, and the theta value is calculated according to the k value and ranges from 0 to 180 degrees.
Step 4, when a node waiting for the occurrence of a destination node, the node carrying a data packet checks whether the destination node occurs in the communication range of the node in each time slot, if the destination node occurs, the data packet is sent to the destination node, and if the destination node does not occur, the check is continued until the destination node occurs and the data packet is sent to the destination node; meanwhile, the node set Na of the delivery box carrying the data packet is also updated in real time so that the delivery box can inquire the target node in each time slot, if the target node appears, the data packet is sent to the target node, and if no target node appears, the inquiry is continued until the target node appears and the data packet is sent to the target node.
According to the community type opportunity network data forwarding method, because the possibility of contact between nodes in a source node community is high, a single copy forwarding mode is adopted for forwarding, the data packet is sent to the node with the maximum central utility value in the neighbor nodes by calculating the central utility value of the neighbor nodes, and the process is repeated until the data packet is sent to the destination node. When the data packet is forwarded between communities, the community where the destination node is located is unknown, and the community to which the destination node is directly sent cannot be accurately known, so that the delivery rate is increased by adopting a multi-copy forwarding mode.
In summary, the present invention is directed to the problem of low forwarding efficiency of the conventional opportunistic network data forwarding mechanism, and a new data forwarding mechanism, that is, a data forwarding method based on a node position angle mechanism, is designed and implemented on the basis of dividing a community, and when a destination node and a source node are in the same community, a data packet is sent to the destination node; when the target node and the source node are not in the same community, the mobile node of the source node community is randomly forwarded, and forwarding is continued until the mobile node is sent to the target node; therefore, the efficiency of opportunistic network data forwarding is effectively improved.
The above embodiments are only for illustrating the invention and not for limiting the technical solutions described in the invention, and the understanding of the present specification should be based on the technical personnel in the field, and although the present specification has described the invention in detail with reference to the above embodiments, the technical personnel in the field should understand that the technical personnel in the field can still make modifications or equivalent substitutions to the present invention, and all the technical solutions and modifications thereof without departing from the spirit and scope of the present invention should be covered in the claims of the present invention.
Claims (8)
1. A network data forwarding method for community-type computer conference is characterized in that each community is provided with a delivery box, the delivery box stores the serial number a of the community, and a node set N of the communitya＝{na1，na2，...，nal}; the node carries the number information of the community in which the node is located, the position coordinates of the previous time slot node and the current time slot node, and the moving direction of the node in the current time slot can be calculated according to the position coordinates of the previous time slot node and the current time slot node; the data packet carries a forwarding hop count M in a source node community, a hop count G for forwarding after going out of the source node community, and position coordinates of a previous time slot and a current time slot for sending the data packet node, and the moving direction of the node when sending the data packet can be calculated according to the position coordinates of the previous time slot and the current time slot for sending the data packet node; the method is characterized by mainly comprising the following steps:
step 1: in the time slot t, when a node j carries a data packet to be forwarded, if a destination node is in the neighbor nodes, the data packet is directly forwarded to the destination node; if the neighbor node does not have a destination node and the forwarding hop number M of the data packet in the source node community where the node j is located is not more than the threshold value M, forwarding the data packet to the neighbor node with the maximum central utility value until the data packet is forwarded to the destination node;
step 2: if the forwarding hop number M of the data packet in the source node community is larger than the threshold value M, the data packet is sent to a delivery box in the source node community, and a node set N is inquiredaIf the destination node with the data packet in the source node community is obtained through inquiry, the destination node is directly forwarded to the delivery box; if the destination node without the data packet in the source node community is obtained through query, the delivery box randomly forwards the destination node to the mobile node of the source node community;
and step 3: when the hop count G of forwarding after a mobile node carrying a data packet exits from a source node community is not more than a threshold value G, the data packet is sent to a delivery box of other communities when passing through other community areas, whether a destination node exists in a node set Na of the corresponding community is inquired, and if a destination node of the data packet exists in the corresponding community, the data packet is directly forwarded to the destination node by the delivery box; if a delivery box in a community receives a data packet but corresponds to a destination node without the data packet in the community, when an included angle theta between the moving direction of a mobile node in the community and the moving direction of the node when the node sends the data packet is calculated according to position coordinates carried by the data packet is within a preset range, the delivery box forwards the data packet to the mobile node in the community, the mobile node carrying the data packet passes through other community areas, the data packet is sent to delivery boxes of other communities, and each community is ensured to have one data packet until the data packet is sent to the destination node;
and 4, step 4: and when the hop number G for forwarding after the mobile node carrying the data packet exits the source node community is larger than the threshold value G, stopping forwarding all the nodes carrying the data packet and the delivery box, and waiting for the appearance of the target node and forwarding the target node to the target node.
2. The community-type opportunistic network data forwarding method of claim 1, wherein: in step 1, defining the central utility value of the node j as Uj：
Uj＝αv+βu
Wherein, α and β are weights, u is a normalized value of the total number of times of interaction of the node j in the time slot t, and v is a normalized value of the number of changes of the neighbor node of the node j in the time slot t.
3. The community-type opportunity network data forwarding method of claim 2, wherein: the normalized value u of the total number of interactions of the node j in the time slot t is calculated by the following formula:
wherein,
is the total number of times that node j interacts with other nodes in time slot t, μ is the average of the total number of interactions from the start to time slot t, and σ is the dispersion.
4. The community-type opportunity network data forwarding method of claim 3, wherein: the formula for the average value μ of the total number of interactions from the start to the time slot t is:
wherein,
is the total number of times node j interacts with other nodes in time slot t.
5. The community-type opportunity network data forwarding method of claim 3, wherein: the formula for calculating the dispersion σ is:
wherein,
is the total number of times node j interacts with other nodes in time slot t.
6. The community-type opportunity network data forwarding method of claim 3, wherein: the normalized value v of the neighbor node variation number of the node j in the time slot t is calculated by the following formula:
wherein,
the number is updated for the neighbors of node j in time slot t,
is the average of the neighbor node change numbers from the beginning to time slot t,
is the dispersion.
7. The community-type opportunistic network data forwarding method of claim 6, wherein: neighbor update number of node j in time slot t
The calculation formula of (a) is as follows:
wherein v isj(t) is the set of neighbor nodes for time slot t, vj(told) Is the set of neighbor nodes of the previous slot.
8. The community-type opportunistic network data forwarding method of claim 1, wherein: in step 3, a specific calculation process of an included angle θ between the moving direction of the mobile node in the community and the moving direction when the node sends the data packet is calculated according to the position coordinates carried by the data packet is as follows:
defining the hop number of a data packet which is not forwarded just out of a community as 0 hop, and in the 0 hop stage, the position coordinates of a mobile node carrying the data packet in the current time slot and the position coordinates of the mobile node carrying the data packet in the previous time slot are respectively (x)0，y0)，(x0′，y0′)；
Similarly, in the c-hop moving stage, the position coordinates of the mobile node carrying the data packet in the current time slot and the previous time slot are respectively (x)c，yc)，(xc′，yc') to a host; in the c +1 jump moving stage, the position coordinates of the mobile node carrying the data packet in the current time slot and the previous time slot are respectively (x)c+1，yc+1)，(x′c+1，y′c+1) (ii) a When the number of outgoing community forwarding hops G of the data packet is not more than the threshold value G, under c hops and c +1 hops, the calculation formula of the included angle theta between the moving direction of the mobile node and the moving direction calculated by the node when the node sends the data packet according to the position coordinates carried by the data packet is as follows:
wherein k is less than or equal to 1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810856041.9A CN108924896B (en) | 2018-07-31 | 2018-07-31 | Community-type opportunity network data forwarding method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810856041.9A CN108924896B (en) | 2018-07-31 | 2018-07-31 | Community-type opportunity network data forwarding method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108924896A CN108924896A (en) | 2018-11-30 |
| CN108924896B true CN108924896B (en) | 2021-05-04 |
Family
ID=64393227
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810856041.9A Active CN108924896B (en) | 2018-07-31 | 2018-07-31 | Community-type opportunity network data forwarding method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108924896B (en) |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103702387A (en) * | 2014-01-08 | 2014-04-02 | 重庆邮电大学 | Social network-based vehicle-mounted self-organization network routing method |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8493849B2 (en) * | 2009-02-13 | 2013-07-23 | Miraveo, Inc. | Systems and methods for creating, managing and communicating users and applications on spontaneous area networks |
-
2018
- 2018-07-31 CN CN201810856041.9A patent/CN108924896B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103702387A (en) * | 2014-01-08 | 2014-04-02 | 重庆邮电大学 | Social network-based vehicle-mounted self-organization network routing method |
Non-Patent Citations (2)
| Title |
|---|
| BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks;P. Hui;《IEEE Transactions on Mobile Computing》;20111130;第10卷(第11期);第1576-1589页 * |
| 一种基于节点移动倾向检测的社会网络机会转发机制;刘林峰;《计算机科学》;20170731;第44卷(第7期);第74-78页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108924896A (en) | 2018-11-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Marwaha et al. | Mobile agents based routing protocol for mobile ad hoc networks | |
| Sucec et al. | An efficient distributed network-wide broadcast algorithm for mobile ad hoc networks | |
| WO2020125454A1 (en) | Information processing method, system and apparatus | |
| Khan et al. | Performance comparison of on-demand and table driven ad hoc routing protocols using NCTUns | |
| CN103634232B (en) | Vehicle message method for routing based on delay-tolerant network technology | |
| CN101478805A (en) | DTN network Anycast routing method based on opportunistic communication | |
| Gorrieri et al. | Irresponsible AODV routing | |
| CN104284388B (en) | A kind of autonomous sub-clustering of mobile Ad Hoc networks and method for routing | |
| Zhang et al. | A robust and efficient flooding-based routing for wireless sensor networks | |
| CN108924896B (en) | Community-type opportunity network data forwarding method | |
| CN102420730B (en) | Safety topology construction method of high-speed mobile node | |
| Gupta et al. | Unmanned aerial vehicles (uavs): Evaluation of olsr, dsdv, aodv, and dsr dynamic routing protocols | |
| CN113225260B (en) | Mixed clustering opportunistic routing implementation method based on machine learning | |
| CN107124750B (en) | Routing forwarding method and system for opportunity network encounter prediction and distance perception | |
| Liang et al. | A broadcasting algorithm of multipath routing in narrowband power line communication networks | |
| CN102781064B (en) | Method for improving AODV (Ad hoc on-demand distance vector routing) protocol against wireless Ad hoc network | |
| Lavanya et al. | Mobility-Based Optimized Multipath Routing Protocol on Optimal Link State Routing in MANET | |
| Goyal et al. | Improving the MANET routing algorithm by GC-efficient neighbor selection algorithm | |
| Devi et al. | Towards Improving the Packet Delivery Ratio in Mobile Ad Hoc Networks Using DSDV Protocol and Cuckoo Search Algorithm | |
| Radha et al. | A Rate Control Algorithm to Improve TCP over RFID Reader Network | |
| Mishra et al. | Fault-tolerance aware green computing scheme in software-defined vehicular social network | |
| Wang et al. | Improvement and optimization of a mobile multi-agent AODV routing protocol | |
| Xiaoying et al. | Adaptive Probabilistic Broadcast in Ad Hoc Networks | |
| CN110611617B (en) | DTN routing method based on node difference and activity | |
| Liu et al. | A novel multi-path routing algorithm based on clustering for wireless mesh networks |
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 |