CN110752987A - Community-based ship network routing algorithm - Google Patents
Community-based ship network routing algorithm Download PDFInfo
- Publication number
- CN110752987A CN110752987A CN201910859766.8A CN201910859766A CN110752987A CN 110752987 A CN110752987 A CN 110752987A CN 201910859766 A CN201910859766 A CN 201910859766A CN 110752987 A CN110752987 A CN 110752987A
- Authority
- CN
- China
- Prior art keywords
- ship
- ships
- social
- community
- network
- 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.)
- Granted
Links
Images
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/14—Routing performance; Theoretical aspects
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
- G06Q50/01—Social networking
-
- 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/16—Multipoint routing
-
- 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
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
Abstract
The invention discloses a community-based ship network routing algorithm, and particularly relates to the technical field of data transmission of a marine ship ad hoc network. The algorithm calculates the social relation among the ships according to the historical navigation information of the ships, constructs a ship social network according to the social relation, and guides the next hop selection of the route according to the meeting probability among the ships reflected in the ship social network information. The routing algorithm mainly comprises the following steps: the method comprises the steps that history and real-time navigation information are uploaded to a ship network by a ship, and a ship social network formed by the social familiarity among the ships is generated. Secondly, the ship social network is divided into communities, and the communication intermediary capacity of each ship among different communities is calculated. And finally, the ship can select the ship in the same community with the target ship or with stronger communication capability to the target community as the next hop, and the routing protocol greatly reduces the transmission cost on the basis of ensuring the transmission success rate and the transmission delay and is very suitable for the ship self-organizing network.
Description
Technical Field
The invention relates to the technical field of data transmission of marine ship ad hoc networks, in particular to a ship network routing algorithm based on a community.
Background
The wireless self-organizing network communication technology for the marine ships is a core technology and an important guarantee for the development of marine internet of things, smart marine engineering, marine fishery construction and international marine cargo transportation. The wireless communication modes of the current marine offshore vessel mainly comprise offshore cellular network wireless communication, maritime communication satellites, intermediate frequency/high frequency/very high frequency radio communication, single-side band wireless communication, fishing interphones and the like. As a novel marine ship wireless communication technology, the ship wireless self-organizing network has the advantages of low cost, high efficiency, high reliability, high flexibility and the like, and attracts research and development personnel in academic circles and industrial circles of various countries to carry out extensive and deep technical research and system development.
The characteristics and limitations of the existing marine vessel wireless communication mode mainly focus on the aspects of coverage, deployment cost, communication rate and bandwidth, communication stability and the like. First, ships such as offshore fishing vessels and cargo ships entering ports can access the offshore cellular base station through mobile phones to perform communication, but the coverage range of shore-based cellular wireless communication can only reach about 10 nautical miles or 15 kilometers offshore, and real-time communication of offshore fishing vessels or ocean cargo ships cannot be supported. Second, the communication method based on the marine communication satellite or the mobile communication satellite has the advantages of wide coverage and strong real-time performance, but the communication cost is high, the communication bandwidth is small, and the communication method is more commonly used for communication in emergency situations. Thirdly, the communication distance of the medium-high frequency radio communication mode is different from dozens of seas to hundreds of seas, but the communication quality is poor, the communication is mainly unidirectional, a special radio transceiver is required to be equipped, the operation is carried out according to the standard by a professional operator, and the medium-high frequency radio communication mode is generally applied to ocean traffic management systems of ocean vessels and cargo ships with large tonnage, such as an automatic vessel identification system. Fourth, single side band radio communication has improved interference killing feature and communication quality compared in medium-high frequency radio communication, but communication equipment is more complicated, and the blind area is great, and speech communication's both sides also can not speak simultaneously. Finally, the fishing interphone is a communication mode with low cost, flexible and convenient allocation and use and limited communication distance, and is mainly used for local instant communication in fishing boat formation. In summary, the existing wireless communication method for marine vessels cannot meet the increasing different types of communication requirements of the current different types of marine vessels, and particularly, there are great gaps in low cost, high bandwidth, instantaneity, stability, flexibility and the like of communication. The ship wireless self-organizing network is a kind of example of the wireless mobile self-organizing network, and is similar to the vehicle self-organizing network, the mobile sensor network and the like. The main research content of the ship wireless self-organizing network technology is to achieve high-efficiency and reliable multi-hop data transmission in a self-organizing manner in a distributed computing mode based on the wireless communication capacity of limited distance between mobile nodes, and achieve various network application targets such as node positioning, data routing, anomaly detection, environment monitoring and the like of the whole network. The ship wireless self-organizing network technology has the advantages of low deployment and communication cost, high communication efficiency, wide coverage range, flexible application and the like.
The current research on the ship self-organizing network routing algorithm is basically blank, relevant research is not based on real ship track data, and most simulators are adopted to simulate the movement of ships so as to realize simple routing simulation. The characteristics of the ship network are not researched and analyzed in a targeted mode, and a routing algorithm for the ship self-organizing network is not researched.
Disclosure of Invention
Aiming at the defects, the invention provides a community-based ship network routing algorithm which is used for excavating the internal social contact among ships, constructing a ship social network, and reducing the transmission range of a data packet by dividing the ship social community by deeply analyzing the track data of the ships.
The invention specifically adopts the following technical scheme:
the ship network routing algorithm based on the community comprises the following steps:
step 1: the ship uploads navigation information and encounter information with other ships in a distributed manner through communication during encounter;
step 2: the ship network platform calculates social familiarity F (a, b) among ships according to navigation information uploaded by ships and meeting information among the ships, and the specific calculation formula is shown as formula (1):
wherein the content of the first and second substances,
representing the weight corresponding to the state when the two ships meet, when the ship a meets the ship b, the social relationship gain between the ship a and the ship b is α, when the ship a meets the ship b, the social relationship gain is β, when the ship a meets the ship b, the social relationship gain is gamma, T represents the total meeting times of the two ships within a period of time, and tau represents the duration of a certain meeting;
and step 3: constructing a ship social network by taking ships as nodes and taking social familiarity F (a, b) among the ships as weight of edges;
and 4, step 4: dividing the ship social network into communities by using a community detection algorithm Louvain algorithm;
and 5: calculating the mediation centrality of all ship nodes in the ship community network relative to any two social intervals, wherein the mediation centrality of the social intervals represents the characteristic of the importance of the ship as social interval communication;
step 6: the ship can access the intermediation condition of each ship and the community attribution condition of each ship in the current ship networking in real time;
and 7: when a ship carrying data packets encounters a ship, the ship firstly communicates with a target ship to exchange the condition of the data packets carried by the ship, and when the other party does not have the data packets carried by the other party, the ship starts to judge whether to forward the program.
Preferably, the process of determining whether to forward in step 7 is: firstly, judging that the opposite party is a destination ship of the data packet, if so, forwarding, and successfully delivering the data packet; if the opposite party is not the target ship, judging whether the opposite party and the target ship belong to the same community, and if so, forwarding; otherwise, judging whether the value of the mediation centrality of the opposite party to the community where the target ship is located is larger than the value from the opposite party to the target community, if so, forwarding, otherwise, not forwarding.
Preferably, the social network construction among ships needs to take the ships as nodes and take the social familiarity among the ships as edges.
Preferably, the social familiarity between the ships requires calculating historical encounter conditions between the ships, including timestamps when the encounters, locations when the encounters, states of the two ships when the encounters, speeds of the two ships when the encounters are made, and durations.
The invention has the following beneficial effects:
the community-based ship network routing algorithm introduces a social network analysis theory into the design of a ship self-organizing network distributed routing method, excavates and verifies the existence and the characteristics of social characteristics in a real ship network based on a large-scale real ship navigation GPS track record, and applies the social network analysis theory to the problem of distributed multicast routing, so that the comprehensive transmission performance of multicast data communication in the ship self-organizing network is improved;
compared with the principles of track prediction, position greedy, real-time topology discovery, random walk, flooding and the like which are based on the traditional routing method, the social characteristics of the ship network can better reflect the deep and long-term stable interaction rule and development trend in the network, so that the method has high reliability and practicability and is more suitable for improving the comprehensive performance of data routing;
the routing algorithm is designed according to a ship network and is very suitable for the routing of a ship self-organizing network;
the routing method of the invention abandons the traditional routing thought, does not need to establish transmission topology in advance, does not need to maintain and rebuild the transmission topology, eliminates the maintenance cost brought by the transmission topology, and can greatly reduce the transmission cost on the basis of ensuring the transmission success rate and the transmission delay.
Drawings
FIG. 1 is a schematic diagram of a ship self-organizing network;
FIG. 2 is a schematic diagram of a community-based ship self-organizing network routing algorithm;
FIG. 3 is a comparison of five routing algorithms in transmission cost;
fig. 4 is a comparison of the transmission delays of the five routing algorithms.
Detailed Description
The following description of the embodiments of the present invention will be made with reference to the accompanying drawings:
the ship network routing algorithm based on the community comprises the following steps:
step 1: the ship uploads navigation information and encounter information with other ships in a distributed manner through communication during encounter;
step 2: the ship network platform calculates social familiarity F (a, b) among ships according to navigation information uploaded by ships and meeting information among the ships, and the specific calculation formula is shown as formula (1):
wherein the content of the first and second substances,
representing the weight corresponding to the state when the two ships meet, when the ship a meets the ship b, the social relationship gain between the ship a and the ship b is α, when the ship a meets the ship b, the social relationship gain is β, when the ship a meets the ship b, the social relationship gain is gamma, T represents the total meeting times of the two ships within a period of time, and tau represents the duration of a certain meeting;
and step 3: constructing a ship social network by taking ships as nodes and taking social familiarity F (a, b) among the ships as weight of edges; calculating the social familiarity among the ships by using historical ship navigation records, constructing a ship social network according to the social familiarity, dividing the ship social network into ship communities, and determining whether to forward a data packet according to the relationship between an adjacent ship and a community in which a target ship is located. The construction of the social network among the ships needs to take the ships as nodes and take the social familiarity among the ships as edges. Social familiarity between vessels requires calculation of historical encounter conditions between vessels, including timestamps when encounters, locations when encounters, status of two vessels when encounters (sailing, fishing, berthing, etc.), speed and duration of two vessels when encounters.
And 4, step 4: dividing the ship social network into communities by using a community detection algorithm Louvain algorithm;
and 5: calculating the mediation centrality of all ship nodes in the ship community network relative to any two social intervals, wherein the mediation centrality of the social intervals represents the characteristic of the importance of the ship as social interval communication;
the judgment of the intermediary centrality, which is an index of the intermediary communication capacity of the ship relative to the two communities, refers to the situation that one ship in a ship network is relative to the space between two communities.
Step 6: the ship can access the intermediation condition of each ship and the community attribution condition of each ship in the current ship networking in real time;
and 7: when a ship carrying data packets encounters a ship, the ship firstly communicates with a target ship to exchange the condition of the data packets carried by the ship, and when the other party does not have the data packets carried by the other party, the ship starts to judge whether to forward the program.
The process of judging whether to forward is as follows: firstly, judging that the opposite party is a destination ship of the data packet, if so, forwarding, and successfully delivering the data packet; if the opposite party is not the target ship, judging whether the opposite party and the target ship belong to the same community, and if so, forwarding; otherwise, judging whether the value of the mediation centrality of the opposite party to the community where the target ship is located is larger than the value from the opposite party to the target community, if so, forwarding, otherwise, not forwarding.
Fig. 1 is a communication scenario showing a ship ad hoc network at sea. Each ship carries a wireless device capable of communicating, the wireless device having a communication radius. When the two ships approach to a certain distance, the two ships can communicate to perform subsequent operations of judging whether datagram exchange is needed or not. Such as ship s wanting to communicate with ship d but too far away, but ship s can now communicate with e, and the packet can be passed to e, where it continues until ship d is encountered.
Fig. 2 is a working schematic diagram showing a community-based ship ad hoc network routing algorithm designed by the invention. Ship Vs2For a source node with a communication requirement, it generates a data packet to be transmitted to the ship Vd2. Source node Vs2With two vessels V within the communication radiusdAnd VcThe ship can be helped to transmit the data packet, but the ship V is judged by the algorithm of the inventiondOften as a target vessel Vd2In the case of communication in the community, i.e. ship VdFor target community C1There is a higher value of centrality of intermediaries. So that the ship will pass the data packet to VdThen by ship VdData is transferred to target community C as soon as possible1. When the data package is transmitted to the target community, the data package is transmitted among all members in the community until the target ship V is foundd2。
Fig. 3 shows a comparison of five routing algorithms (random walk RW, Greedy location, Flooding, routing algorithm FBR based on social familiarity, routing algorithm CBR based on community) in transmission cost, where the CBR effect of the routing algorithm of the present invention has an obvious advantage over the classical Flooding and random walk, and significantly reduces the transmission cost.
Fig. 4 is a diagram showing a comparison of five routing algorithms in terms of transmission delay, wherein the CBR effect of the algorithm of the present invention shows substantially the same delay effect as the fastest flooding. It is stated that the algorithm also significantly reduces the cost of transmission while ensuring faster transmission performance, which is the object and advantage of the present invention.
It is noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions.
It is to be understood that the above description is not intended to limit the present invention, and the present invention is not limited to the above examples, and those skilled in the art may make modifications, alterations, additions or substitutions within the spirit and scope of the present invention.
Claims (4)
1. The ship network routing algorithm based on the community comprises the following steps:
step 1: the ship uploads navigation information and encounter information with other ships in a distributed manner through communication during encounter;
step 2: the ship network platform calculates social familiarity F (a, b) among ships according to navigation information uploaded by ships and meeting information among the ships, and the specific calculation formula is shown as formula (1):
wherein the content of the first and second substances,
representing the weight corresponding to the state when the two ships meet, when the ship a meets the ship b, the social relationship gain between the ship a and the ship b is α, when the ship a meets the ship b, the social relationship gain is β, when the ship a meets the ship b, the social relationship gain is gamma, T represents the total meeting times of the two ships within a period of time, and tau represents the duration of a certain meeting;
and step 3: constructing a ship social network by taking ships as nodes and taking social familiarity F (a, b) among the ships as weight of edges;
and 4, step 4: dividing the ship social network into communities by using a community detection algorithm Louvain algorithm;
and 5: calculating the mediation centrality of all ship nodes in the ship community network relative to any two social intervals, wherein the mediation centrality of the social intervals represents the characteristic of the importance of the ship as social interval communication;
step 6: the ship can access the intermediation condition of each ship and the community attribution condition of each ship in the current ship networking in real time;
and 7: when a ship carrying data packets encounters a ship, the ship firstly communicates with a target ship to exchange the condition of the data packets carried by the ship, and when the other party does not have the data packets carried by the other party, the ship starts to judge whether to forward the program.
2. The community-based ship network routing algorithm according to claim 1, wherein the step 7 of determining whether to forward is performed by: firstly, judging that the opposite party is a destination ship of the data packet, if so, forwarding, and successfully delivering the data packet; if the opposite party is not the target ship, judging whether the opposite party and the target ship belong to the same community, and if so, forwarding; otherwise, judging whether the value of the mediation centrality of the opposite party to the community where the target ship is located is larger than the value from the opposite party to the target community, if so, forwarding, otherwise, not forwarding.
3. The community-based ship network routing algorithm of claim 1, wherein the construction of the social network among ships requires ships as nodes and social familiarity among ships as edges.
4. The community-based ship network routing algorithm of claim 1, wherein the social familiarity between ships requires computation of historical encounter conditions between ships, including timestamp of encounter, location of encounter, status of two ships at encounter, speed and duration of two ships at encounter.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910859766.8A CN110752987B (en) | 2019-09-11 | 2019-09-11 | Community-based ship network routing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910859766.8A CN110752987B (en) | 2019-09-11 | 2019-09-11 | Community-based ship network routing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110752987A true CN110752987A (en) | 2020-02-04 |
| CN110752987B CN110752987B (en) | 2021-09-03 |
Family
ID=69276356
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910859766.8A Active CN110752987B (en) | 2019-09-11 | 2019-09-11 | Community-based ship network routing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110752987B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113895571A (en) * | 2021-09-27 | 2022-01-07 | 海南超船电子商务有限公司 | Communication ship for marine information transmission |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102625292A (en) * | 2012-03-02 | 2012-08-01 | 重庆邮电大学 | Social intermittent connection network dynamic address allocation and network performance optimization method |
| CN103368838A (en) * | 2013-07-03 | 2013-10-23 | 北京理工大学 | Delay tolerant network forwarding method based on weighted socialgram |
| CN104486741A (en) * | 2014-12-13 | 2015-04-01 | 重庆邮电大学 | Trust state perceiving mixed service discovery method |
| US10133765B1 (en) * | 2012-02-09 | 2018-11-20 | Google Llc | Quality score for posts in social networking services |
| CN110177389A (en) * | 2019-05-14 | 2019-08-27 | 华中师范大学 | Method for routing based on the social group degree of association |
-
2019
- 2019-09-11 CN CN201910859766.8A patent/CN110752987B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10133765B1 (en) * | 2012-02-09 | 2018-11-20 | Google Llc | Quality score for posts in social networking services |
| CN102625292A (en) * | 2012-03-02 | 2012-08-01 | 重庆邮电大学 | Social intermittent connection network dynamic address allocation and network performance optimization method |
| CN103368838A (en) * | 2013-07-03 | 2013-10-23 | 北京理工大学 | Delay tolerant network forwarding method based on weighted socialgram |
| CN104486741A (en) * | 2014-12-13 | 2015-04-01 | 重庆邮电大学 | Trust state perceiving mixed service discovery method |
| CN110177389A (en) * | 2019-05-14 | 2019-08-27 | 华中师范大学 | Method for routing based on the social group degree of association |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113895571A (en) * | 2021-09-27 | 2022-01-07 | 海南超船电子商务有限公司 | Communication ship for marine information transmission |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110752987B (en) | 2021-09-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Acar et al. | ACMENet: an underwater acoustic sensor network protocol for real-time environmental monitoring in coastal areas | |
| Yau et al. | Maritime networking: Bringing internet to the sea | |
| Nayyar et al. | Comprehensive analysis of routing protocols surrounding underwater sensor networks (UWSNs) | |
| Xie | An enhanced OLSR routing protocol based on node link expiration time and residual energy in ocean FANETS | |
| Plate et al. | Utilizing kinematics and selective sweeping in reinforcement learning-based routing algorithms for underwater networks | |
| CN111901088B (en) | Method and device for distributing erasure correcting coding blocks in multi-path transmission of ad hoc network of underwater sensor | |
| Venkateswarulu et al. | An efficient routing protocol based on polar tracing function for underwater wireless sensor networks for mobility health monitoring system application | |
| Hyder et al. | Self-organized ad hoc mobile (SOAM) underwater sensor networks | |
| Domingo | Marine communities based congestion control in underwater wireless sensor networks | |
| Su et al. | A new node coordination scheme for data gathering in underwater acoustic sensor networks using autonomous underwater vehicle | |
| CN110752987B (en) | Community-based ship network routing method | |
| CN110691395B (en) | Ship network routing method based on social familiarity | |
| Zhang et al. | Communication network and qos evaluation for formation control of unmanned surface vehicles | |
| Xian et al. | Novel energy-efficient opportunistic routing protocol for marine wireless sensor networks based on compressed sensing and power control | |
| Misra et al. | DATUM: Dynamic topology control for underwater wireless multimedia sensor networks | |
| CN110247850B (en) | Ship networking protocol implementation method based on dynamic routing table | |
| Wang et al. | A new analytical model for highway inter-vehicle communication systems | |
| Xiaoyang et al. | Performance Analysis of Sea Unmanned Ship Routing Protocol Based on Ad Hoc Network | |
| Chen et al. | QUO VADIS: QoS-aware underwater optimization framework for inter-vehicle communication using acoustic directional transducers | |
| Mahmood et al. | A comprehensive survey on the performance analysis of underwater wireless sensor networks (uwsn) routing protocols | |
| Cardei | Energy-efficient scheduling and hybrid communication architecture for underwater littoral surveillance | |
| CN110636137B (en) | Cluster-based NFV service chain optimization method in ocean view monitoring network | |
| Ismail et al. | A novel routing protocol for underwater wireless sensor networks based on shifted energy efficiency and priority | |
| Ribeiro et al. | Deepwater monitoring system using logistic-support vessels in underwater sensor networks | |
| CN113692031B (en) | Routing method based on multidimensional communities in ship self-organizing network |
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 |