CN106060836B - The information sharing method of transmission delay is reduced in a kind of wireless network - Google Patents
The information sharing method of transmission delay is reduced in a kind of wireless network Download PDFInfo
- Publication number
- CN106060836B CN106060836B CN201610412468.0A CN201610412468A CN106060836B CN 106060836 B CN106060836 B CN 106060836B CN 201610412468 A CN201610412468 A CN 201610412468A CN 106060836 B CN106060836 B CN 106060836B
- Authority
- CN
- China
- Prior art keywords
- information
- alliance
- node
- mobile node
- mobile
- 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.)
- Expired - Fee Related
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/18—Network planning tools
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/02—Arrangements for optimising operational condition
-
- 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/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
-
- 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/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses the information sharing methods that transmission delay is reduced in a kind of wireless network, it include: to possess to carry out information sharing between N number of mobile node of partial information first, alliance's income is calculated based on the polymerization in game-division principle, considers the maximization of alliance's income to form disjoint small alliance；The alliance in all alliances with maximum return is found out, carries out data broadcasting as Broadcasting Union, and to other mobile nodes containing partial information；By polymerization-division principle, possesses the mobile node of total data as sending node, form new alliance with other mobile nodes for needing data to send possessed total data information；In alliance, when there are some mobile nodes not in the communication range of sending node, relay node is done by the node in communication range to forward the information of sending node, so that all mobile nodes can receive information in alliance.The present invention improves the reliability of information acquisition.
Description
Technical field
The present invention relates to transmission is reduced in information sharing field between wireless network interior joint more particularly to a kind of wireless network
The information sharing method of delay, information sharing coalition formation method of this method based on cooperative alliances game are total to reduce information
Enjoy the time delay of data transmission.
Background technique
Mobile node in wireless network, such as unmanned plane, automobile, due to either working as its shifting with faster mobility
When moving distance apart from base station farther out, it can not be formed by static infrastructure from group between these mobile nodes
Knitmesh network (Ad-hoc), in ad hoc networks by the information obtained each other (the information reconnoitred such as unmanned plane, vehicle understand
Road conditions etc.) it is shared.In existing wireless network, mobile node is usually that the information that will acquire passes to fixed base
Infrastructure (such as: ground base station), then the information of acquisition is being passed to other sections for needing the information by fixed infrastructure
Point.
The fast moving property of this mode being limited in that due to mobile node, mobile node by infrastructure when
Between it is shorter, in this way it cannot be guaranteed that mobile node can obtain whole information.On the other hand, when mobile node not covering in base station
When within the scope of lid, data transmitting not can be carried out then.Each of which increases the times required for information sharing, reduce information sharing
Reliability.
Summary of the invention
The present invention provides the information sharing methods that transmission delay is reduced in a kind of wireless network, are dependent on cooperative game reason
By, it is combined with being in communication with each other between mobile node in wireless network, thus effectively realize mobile node between
Information sharing reduces the time delay in communication process, guarantees the reliability of communication, described below:
The information sharing method of transmission delay is reduced in a kind of wireless network, the information sharing method includes following step
It is rapid:
Possess and carry out information sharing between N number of mobile node of partial information first, based on polymerization-mitogen in game
Alliance's income is then calculated, considers the maximization of alliance's income to form disjoint small alliance；
The alliance in all alliances with maximum return is found out, is believed as Broadcasting Union, and to other containing part
The mobile node of breath carries out data broadcasting；
By polymerization-division principle, possess the mobile node of total data as sending node, with other data that need
Mobile node forms new alliance to send possessed total data information；
In alliance, when there are some mobile nodes not in the communication range of sending node, by communication model
Node in enclosing does relay node to forward the information of sending node, so that all mobile nodes can receive in alliance
To information.
The beneficial effect of the technical scheme provided by the present invention is that: the present invention proposes a kind of based on the low biography for forming cooperative game
Defeated delay information sharing method, is applied in wireless network the transmitting of information between mobile node, solves mobile node
Between the larger problem of information sharing time delay.The present invention can make all mobile nodes obtain whole within a short period of time
Information, and improve the reliability of information acquisition.
Detailed description of the invention
Fig. 1 is the flow chart that the information sharing method of transmission delay is reduced in a kind of wireless network；
Fig. 2 is system model figure；
That is, indicating node original state.
Fig. 3 is to possess the schematic diagram that data are mutually transmitted between the mobile node of different information；
That is, data are mutually transmitted between the mobile node for possessing different information in small alliance, so that each mobile node
Possess the schematic diagram of total data information.
Fig. 4 is to possess the mobile node of total data to the schematic diagram of other mobile nodes transmitting information.
That is, possess each mobile node of total data and other mobile nodes of not data packet form new alliance,
Information is transmitted to other mobile nodes, mobile node in all new alliances is made to obtain all data informations.
Specific embodiment
To make the object, technical solutions and advantages of the present invention clearer, embodiment of the present invention is made below further
Ground detailed description.
In order to solve the disadvantage that in the prior art, the technology of cooperative game is applied in wireless network by the embodiment of the present invention
Communication between mobile node, the application can not only increase the reliability communicated between mobile node but also can reduce movement
The information transmission time used between node.
Cooperative game (N, v) in the form of characteristic function provides.N=1,2 ..., and n } indicate participant (players)
Set, wherein n is positive integer, indicates the number of participant.S indicates the alliance (coalition) of participant, is the subset of N,
I.e.V is the characteristic function of each alliance S in N.V (S) indicates that the game participant in alliance S obtains by cooperating with each other
The value obtained, it is expressed as participant and forms the income U (S) and the difference for forming cost C (S) required for alliance that alliance obtains.
It is differently formed situation according to participant in alliance, cooperative game can be divided into three kinds of forms: specification cooperation is rich
It plays chess, form cooperative game and figure game.Using forming cooperative game in the embodiment of the present invention, the game in forming cooperative game
Participant forms independent disjoint small alliance.If the benefit reasonable distribution of each participant, will form stabilization in small alliance
Coalition structure.
Embodiment 1
The information sharing method of transmission delay is reduced in a kind of wireless network, referring to Fig. 1, which is specifically wrapped
Include following steps:
101: possessing and carry out information sharing between N number of mobile node of partial information first, based on the polymerization-point in game
It splits principle and calculates alliance's income, consider the maximization of alliance's income to form disjoint small alliance；
102: finding out the alliance in all alliances with maximum return, contain portion as Broadcasting Union, and to other
The mobile node of information is divided to carry out data broadcasting；
103: by polymerization-division principle, possessing the mobile node of total data as sending node, need to count with other
According to mobile node form new alliance to send possessed total data information；
104: in alliance, when there are some mobile nodes not in the communication range of sending node, by logical
Node in letter range does relay node to forward the information of sending node, so that all mobile nodes can in alliance
Receive information.
In conclusion the embodiment of the present invention will be based on the low transmission delay information sharing method for forming cooperative game, application
In wireless network between mobile node information transmitting, solve that the information sharing time delay between mobile node is larger to ask
Topic.The embodiment of the present invention can make all mobile nodes obtain all information within a short period of time, and improve information acquisition
Reliability.
Embodiment 2
The scheme in embodiment 1 is described in detail below with reference to specific calculation formula, Fig. 2, Fig. 3 and Fig. 4, it should
Information sharing method based on the traffic model between mobile node in the wireless network of cooperative game theory, model referring to fig. 2, in detail
See below description:
201: possessing and carry out information sharing, base first between N number of mobile node (such as Fig. 2 interior joint 1-4) of partial information
Polymerization-division principle (Merge-Split-Rule) in game[1], alliance's income is calculated by formula (3), considers alliance
The maximization of income forms disjoint small alliance；
Wherein, the possessed data of initial mobile node are not identical, using forming cooperative game theory, between mobile node
Under conditions of not damaging number one, multiple mutually disjoint small alliances are formed for the purpose for increasing self benefits.
202: find out in all small alliances with maximum return alliance, as Broadcasting Union (such as Fig. 2 interior joint 3,
4) data broadcasting, and to other mobile nodes (such as Fig. 2 interior joint 1,2) containing partial information is carried out, such mobile node is (such as
Fig. 2 interior joint 1-4) possess all information；
Referring to fig. 2, in the case where initial, mobile node 1-4 obtains some information in moving process, and needing will each other
The information possessed is shared, and a complete information is obtained.After obtaining complete information, they pass to these information
Node 5-9, so that the mobile node in the region all has these information.
203: by polymerization-division principle, possessing the mobile node of total data as sending node (such as Fig. 3 interior joint
2,4), new alliance is formed with other mobile nodes for needing data to send possessed total data information；
204: in alliance, when there are some mobile nodes not in the communication range of sending node, can pass through
Node in communication range does relay node to forward the information of sending node, so that all mobile nodes are all in alliance
Information can be received.
Referring to Fig. 3, according to the polymerization in coalition formation algorithm-division principle, what mobile node 3 and mobile node 4 were formed
Alliance has maximum value, therefore they form Broadcasting Union, to other mobile node broadcast messages.Repeat the above mistake
Journey, until mobile node 1-4 has been owned by whole information.
Referring to fig. 4, when mobile node 1 to 4 possesses whole information, these information are passed to it by mobile node 1 to 4
Its mobile node, that is, sending node passes information to receiving node in figure.When receiving node (such as node 7,9) does not exist
When in the communication range of sending node (such as node 2,4), the mode of alliance is taken to solve this problem.These mobile nodes are formed
Alliance needs to contain information node containing at least one in alliance, by polymerization-division principle, constantly be iterated, until
Obtain stable coalition structure.It is passed information in alliance by relay node (such as node 6, node 8) and is not sending section
Node in point range.Finally, achieve the purpose that information sharing.
Wherein, the information transmission system is as shown in Figure 2,3: N number of mobile node has different information each other, according to step
201, small alliance is formed between the 202 N number of mobile nodes of realization, realizes information sharing.Step 203,204 lead to the information possessed
It crosses and to form new alliance and pass to remaining M mobile node.
Wherein, in process one (namely step 201,202), based on forming cooperative game, the revenue function of node
For[2]:
Wherein, θ is Price factor；X indicates given information sharing mechanism；PX(t)=∑i∈Ω|Γi| indicate current time slots
Possess the sum of data packet；Ω indicates the quantity for possessing the mobile node of information；I indicates mobile node；ΓiIndicate mobile node
The information that i possesses；X (t)=PX(t)-PX(t-1) quantity of the data packet of current time slots Successful transmissions is indicated；PXIt (t-1) is upper
One time slot possesses the sum of data packet.
The cost that node transmitting information needs is expressed as[2]:
Wherein, ξ is cost coefficient；| S | it is alliance's size；Therefore, the cost function of alliance are as follows:
V1(S)=U (S)-C (S) (3)
Wherein, step 203, the cost function of alliance is in 204[3]:
Wherein, β ∈ (0,1) is about handling capacity-delay parameter；Pi,jIt is success of the data packet from j node to i-node
The probability of transmission；di,jIt is receiving nodeThe distance between transmitting node j；| v | it is the phase of receiving node with transmitting node
To speed；LsIt is average throughput, | S | indicate the quantity of mobile node in alliance.
In conclusion the embodiment of the present invention will be based on the low transmission delay information sharing method for forming cooperative game, application
In wireless network between mobile node information transmitting, solve that the information sharing time delay between mobile node is larger to ask
Topic.The embodiment of the present invention can make all mobile nodes obtain all information within a short period of time, and improve information acquisition
Reliability.
It will be appreciated by those skilled in the art that attached drawing is the schematic diagram of a preferred embodiment, the embodiments of the present invention
Serial number is for illustration only, does not represent the advantages or disadvantages of the embodiments.
The foregoing is merely presently preferred embodiments of the present invention, is not intended to limit the invention, it is all in spirit of the invention and
Within principle, any modification, equivalent replacement, improvement and so on be should all be included in the protection scope of the present invention.
Bibliography:
[1]Das B,Misra S,Roy U.Coalition Formation for Cooperative Service-
based Message Sharing in Vehicular Ad Hoc Networks[J].2016(1):1-1.
[2]Wang T,Song L,Han Z,et al.Dynamic Popular Content Distribution in
Vehicular Networks using Coalition Formation Games[J].IEEE Journal on
Selected Areas in Communications,2012,31(9):538-547.
[3]Das B,Misra S,Roy U.Coalition Formation for Cooperative Service-
based Message Sharing in Vehicular Ad Hoc Networks[J].2016(1):1-1.
Claims (1)
1. reducing the information sharing method of transmission delay in a kind of wireless network, which is characterized in that the information sharing method packet
Include following steps:
1) possess has different information each other between N number of mobile node of partial information, N number of mobile node carries out information first
It is shared, alliance's income is calculated based on the polymerization in game-division principle, considers that the maximization of alliance's income is disjoint to be formed
Small alliance, N are positive integer；
2) alliance in all alliances with maximum return is found out, contains partial information as Broadcasting Union, and to other
Mobile node carry out data broadcasting；
1) possess all information with 2) mobile node through the above steps in this way, realizes information sharing；
3) by polymerization-division principle, possess the mobile node of total data as sending node, with other shiftings for needing data
Dynamic node forms new alliance to send possessed total data information；
4) in alliance, when there are some mobile nodes not in the communication range of sending node, by communication range
Interior node does relay node to forward the information of sending node, so that all mobile nodes can receive in alliance
Information；
Wherein, alliance's income is calculated based on the polymerization in game-division principle specifically:
V1(S)=U (S)-C (S)
Wherein, U (S) is the revenue function of node, and C (S) is the cost that node transmits that information needs, V1It (S) is the value letter of alliance
Number；The alliance of S expression participant；
Wherein, θ is Price factor；X indicates given information sharing mechanism；PX(t)=∑i∈Ω|Γi| indicate that current time slots possess
The sum of data packet；Ω indicates the quantity for possessing the mobile node of information；I indicates mobile node；ΓiIndicate that mobile node i is gathered around
Some information；X (t)=PX(t)-PX(t-1) quantity of the data packet of current time slots Successful transmissions is indicated；PXIt (t-1) is upper one
Time slot possesses the sum of data packet；ξ is cost coefficient；| S | it is alliance's size.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610412468.0A CN106060836B (en) | 2016-06-13 | 2016-06-13 | The information sharing method of transmission delay is reduced in a kind of wireless network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610412468.0A CN106060836B (en) | 2016-06-13 | 2016-06-13 | The information sharing method of transmission delay is reduced in a kind of wireless network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106060836A CN106060836A (en) | 2016-10-26 |
| CN106060836B true CN106060836B (en) | 2019-09-03 |
Family
ID=57170807
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610412468.0A Expired - Fee Related CN106060836B (en) | 2016-06-13 | 2016-06-13 | The information sharing method of transmission delay is reduced in a kind of wireless network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106060836B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108206728A (en) * | 2017-11-30 | 2018-06-26 | 天津津航计算技术研究所 | A kind of cooperation data packet transmission method based on Game with Coalitions |
| CN110650442A (en) * | 2019-11-06 | 2020-01-03 | 天津津航计算技术研究所 | Wireless network information sharing method |
| CN111918296B (en) * | 2020-07-01 | 2023-03-31 | 中国人民解放军陆军工程大学 | Distributed wireless network spectrum sharing system and sharing method |
| CN115696304B (en) * | 2023-01-03 | 2023-03-21 | 顺霆科技(无锡)有限公司 | Information issuing method for splitting and merging distributed application merging self-organizing network |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102984200A (en) * | 2012-09-13 | 2013-03-20 | 大连理工大学 | Method applicable for scene with multiple sparse and dense vehicular ad hoc networks (VANETs) |
| CN104661278A (en) * | 2015-02-10 | 2015-05-27 | 湖南大学 | Clustered cooperative routing method based on evolutionary game |
-
2016
- 2016-06-13 CN CN201610412468.0A patent/CN106060836B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102984200A (en) * | 2012-09-13 | 2013-03-20 | 大连理工大学 | Method applicable for scene with multiple sparse and dense vehicular ad hoc networks (VANETs) |
| CN104661278A (en) * | 2015-02-10 | 2015-05-27 | 湖南大学 | Clustered cooperative routing method based on evolutionary game |
Non-Patent Citations (2)
| Title |
|---|
| "Coalition Formation for Cooperative Service-based Message Sharing in Vehicular Ad Hoc Networks";Das B,Misra S,Roy U;《IEEE Transactions on Parallel and Distributed Systems》;20160101;全文 |
| "Dynamic Popular Content Distribution inVehicular Networks using Coalition Formation Games";Wang T,Song L,Han Z;《IEEE Journal on Selected Areas in Communications》;20130702;全文 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106060836A (en) | 2016-10-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106060836B (en) | The information sharing method of transmission delay is reduced in a kind of wireless network | |
| Kihl et al. | Reliable geographical multicast routing in vehicular ad-hoc networks | |
| Zhang et al. | A concurrent transmission based broadcast scheme for urban VANETs | |
| CN106255153B (en) | Vehicle under car networking with caching capabilities divides group's cooperation transmission method | |
| CN107171965A (en) | Car networking cross-layer chance method for routing based on Distributed Congestion Control Mechanisms | |
| CN101911644A (en) | Use of the WLAN standard for C2C communication by adding new packet types | |
| CN103078934A (en) | Vehicle-mounted network data distribution method on basis of collaborative optimization sign bit encoding | |
| CN106657261B (en) | Car-to-car data transmission method in car networking based on Game with Coalitions and range prediction | |
| Samara | Increasing network visibility using coded repetition beacon piggybacking | |
| Kenney | Standards and Regulations. | |
| Hu et al. | A LTE-Cellular-based V2X solution to future vehicular network | |
| Sadatpour et al. | A collision aware opportunistic routing protocol for VANETs in highways | |
| Samara | An intelligent routing protocol in VANET | |
| Amoroso et al. | The farther relay and oracle for VANET. preliminary results | |
| Khairnar et al. | Simulation based evaluation of highway road scenario between DSRC/802.11 p MAC protocol and STDMA for vehicle-to-vehicle communication | |
| Boukhalfa et al. | An active signaling mechanism to reduce access collisions in a distributed TDMA based MAC protocol for vehicular networks | |
| CN107509229A (en) | A kind of car networking chance method for routing calculated based on vehicle node centrality | |
| Kwon | Improving multi-channel wave-based V2X communication to support advanced driver assistance system (ADAS) | |
| Wu et al. | An adaptive TDMA scheduling strategy based on beacon messages for vehicular ad-hoc network | |
| CN106793142A (en) | A kind of dispatch channel resource optimization method of vehicle-mounted short haul connection net | |
| CN113347606B (en) | V2I/V2V network cooperative transmission method and system based on elastic partition | |
| Petrov et al. | Evaluation of packet forwarding approaches for emergency vehicle warning application in VANETs | |
| Marzouk et al. | Analysis and enhancement of platoon management in smart city | |
| Hsieh et al. | Road layout adaptive overlay multicast for urban vehicular ad hoc networks | |
| CN103888847B (en) | Vehicular ad hoc network video transmission method based on overlay structure |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20190903 Termination date: 20200613 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |