CN103873485B - Cluster MAC protocol implementation method based on the link persistent period in vehicular ad hoc network - Google Patents

Cluster MAC protocol implementation method based on the link persistent period in vehicular ad hoc network Download PDF

Info

Publication number
CN103873485B
CN103873485B CN201410133166.0A CN201410133166A CN103873485B CN 103873485 B CN103873485 B CN 103873485B CN 201410133166 A CN201410133166 A CN 201410133166A CN 103873485 B CN103873485 B CN 103873485B
Authority
CN
China
Prior art keywords
node
cluster
cluster head
persistent period
link
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
Application number
CN201410133166.0A
Other languages
Chinese (zh)
Other versions
CN103873485A (en
Inventor
唐伦
郜宁
陈前斌
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Chongqing University of Post and Telecommunications
Original Assignee
Chongqing University of Post and Telecommunications
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Chongqing University of Post and Telecommunications filed Critical Chongqing University of Post and Telecommunications
Priority to CN201410133166.0A priority Critical patent/CN103873485B/en
Publication of CN103873485A publication Critical patent/CN103873485A/en
Application granted granted Critical
Publication of CN103873485B publication Critical patent/CN103873485B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Abstract

The invention discloses the cluster MAC protocol implementation method based on the link persistent period in a kind of vehicular ad hoc network, belong to vehicular ad hoc network technical field, specifically include a kind of clustering method based on the link persistent period, determine the priority of node by the average link link time of vehicle node and node degree of communication, what priority was maximum becomes leader cluster node, the node that priority is only second to cluster head becomes standby cluster head, and backup cluster head is conducive to improving the stability of cluster in the renewal of cluster and maintenance process and reduces expense.Cluster head broadcasts Clustering control message to neighbor node, invites neighbor node to add the sub-clustering with present node as cluster head.After cluster, carry out multi-zone supervision, network is divided into multiple clusters, each cluster interior nodes is communicated with leader cluster node using CSMA/TDMA mixed mechanism, reduce the collision of data, and leader cluster node is communicated hence it is evident that being improve the reliability of data transfer using CSMA/CA mechanism with neighbours' cluster head, data transfer delay can be effectively reduced.

Description

Cluster MAC protocol implementation method based on the link persistent period in vehicular ad hoc network
Technical field
The invention belongs to vehicular ad hoc network technical field, it is related to continue based on link in a kind of vehicular ad hoc network The cluster MAC protocol implementation method of time, specifically include in a kind of vehicular ad hoc network based on the link persistent period Clustering method, continued based on link in the update method of cluster and a kind of vehicular ad hoc network in a kind of vehicular ad hoc network The cluster MAC protocol of time.
Background technology
Develop to high transfer rate, high reliability and high-efficiency direction with vehicular ad hoc network (VANET), vehicle Between information transmission mechanisms be subject to common concern and research.But because vehicle node translational speed is very fast, lead to network topology Often change so that traditional MAC protocol faces unprecedented challenge.
The network structure of cluster has good grade difference and job-division mechanism, carries out the biography of message using Clustering Algorithm Pass, effective message transfer mechanism can be produced.The main purpose of cluster is to choose suitable cluster head so that this cluster head can Safeguard related routing iinformation and network topological information, be capable of the stability of largerization cluster, reduction is brought due to change in topology Impact, decreases offered load, is easy to the management to whole network it is adaptable to large scale network.
Main advantage is that it can well adapt to the change of network, working method the most based on the MAC protocol of competition Very flexible, do not need between node to carry out accurate synchronization.And it is brought maximum the drawbacks of be under this mechanism by Losing in the information that conflict causes is that this quasi-protocol cannot be fully solved.And the MAC protocol based on distribution mechanism, pass through One channel is divided into many sub-channels, then the mode by subchannel distribution node, the data transfer having staggered between node, keeps away Exempt from the generation conflicting, but with respect to the MAC protocol based on competition, the adaptability of such Protocol Through Network change is poor.
Content of the invention
In view of this, it is an object of the invention to provide the cluster based on the link persistent period in a kind of vehicular ad hoc network MAC protocol implementation method, has specifically included a kind of clustering method based on the link persistent period in vehicular ad hoc network, car Carry the cluster MAC protocol based on the link persistent period in the update method of cluster and vehicular ad hoc network in self-organizing network.
For reaching above-mentioned purpose, the present invention provides following technical scheme:
A kind of clustering method based on the link persistent period in vehicular ad hoc network, comprises the following steps:Step one: Node obtains the position of vehicle node, speed, acceleration, node type information by GPS and periodically basic control message; Step 2:The average link persistent period between node and neighbor node is determined according to the node location obtaining, velocity information;Step Three:History neighborhood according to node and current neighbours set determine the degree of communication of this node;Step 4:According between node The size of average link persistent period and degree of communication chooses the maximum node of priority as cluster head;Step 5:According to node The node that priority selection is only second to cluster head becomes standby cluster head;Step 6:Cluster head disappears to its cluster interior nodes broadcast Clustering control Breath, declares oneself to become cluster head, and cluster interior nodes according to the position of oneself and receive status message and determine it oneself is cluster interior nodes, and Reply to cluster head.
Further, described average linked according to what the node location obtaining, velocity information determined between node and neighbor node Time, specially:
Node i obtains current location S by GPSi, speed vi, acceleration aiInformation;
Node i passes through the current location S that periodically basic control message obtains neighbor node jj, speed vj, acceleration aj Information;
Node i calculates, according to following formula, the position relationship that can communicate with node j:
Wherein, t1Represent that two cars start to the time having required for same speed from initial link,
Node i calculates the link time with neighbor node j according to following formula:
Node i calculates the average link time and between neighbors according to following formula:
Wherein:N is the neighbor node number not determining state, tiFor between present node and node i (i=1,2 ..., N) The link persistent period, tmaxThe maximum link persistent period between for node.
Further, the described history neighborhood according to node and current neighbours set determine that the degree of communication of node is concrete For:
Node passes through periodically interaction mode information, records t0Moment neighbor node set N0(i), and current time t1 Neighbor node set N1(i), prediction neighbor node change frequent degree;
Node i calculates the degree of communication and between neighbors according to following formula:
Wherein:|N0(i)∪N1(i) | for node in t0Moment and t1Moment all neighbor nodes number, | N0(i)∩N1(i) | for node in t0Moment and t1The number of the neighbor node that the moment has simultaneously.
Further, described selection average link persistent period highest node is as cluster head, including:
The priority of node is determined according to the average link persistent period of node, the link persistent period is bigger, node connects Degree is less, then priority is bigger, and using the node with the highest link persistent period as cluster head, priority is only second to the section of cluster head Point becomes standby cluster head;Cluster head to its cluster interior nodes broadcast Clustering control message, declare oneself to become cluster head, cluster interior nodes according to It oneself is cluster interior nodes or standby cluster head that the state of oneself determines, and replys to cluster head;Other neighbours are not had to save around node Point, then this node form single cluster, set oneself cluster head.
Present invention also offers in a kind of vehicular ad hoc network cluster update method, specifically include:
The change according to self-position of leader cluster node CH, bunch member node CM and standby cluster head BKCH and the change of priority It is updated;
Leader cluster node is periodically detected, if the average link persistent period of cluster member CM is more than itself, should Member node becomes cluster head, and broadcasts Clustering control message, and former leader cluster node becomes member node;If leader cluster node CH's is flat All the link persistent period is still maximum, then leader cluster node only need to maintain the state of oneself, updates speed, position of its cluster member etc. Information;If leader cluster node does not receive the periodic broadcasting status messages of certain member node, then cluster head is this member node Delete from its membership table;
If it exceeds 10% cluster member leaves the scope of cluster head, but do not leave the scope of standby cluster head, just standby Cluster head is converted into cluster head;If cluster head enters into the 1/3 of neighbours' cluster head transmission range, just set standby cluster head as cluster head, if standby With cluster head still the 1/3 of neighbours' cluster head transmission range, just send last information, announce to be merged into neighbours' cluster, other clusters become Member or addition neighbours' cluster, or return to unsettled condition.
Present invention also offers the cluster MAC protocol based on the link persistent period in a kind of vehicular ad hoc network, including:Cluster After the completion of foundation, enter the stabilization sub stage of cluster, start the transmitting-receiving of business datum in the stabilization sub stage of cluster;In hierarchical network, cluster Head node must and oneself cluster in the ordinary node retention time on synchronization, make the upload that data is orderly;Cluster in cluster MAC protocol Interior nodes are communicated using CSMA/TDMA mixed mechanism and leader cluster node;In cluster MAC protocol, leader cluster node adopts CSMA/CA Mechanism and neighbours' cluster head are communicated;Solved produced pre- when two clusters meet in cluster MAC protocol according to syncretizing mechanism between cluster About time slot distribution collision problem.
Further, in the synchronous period, leader cluster node broadcasts cluster head control message to cluster interior nodes, and this message is in each cluster The concrete moment that node distribution is communicated with cluster head, the control message that cluster interior nodes are issued according to cluster head, arrange the activity of oneself, when Oneself communication is needed to be switched on communication module, not during demand oneself communication, then communication close module enters resting state.
Further, cluster head, to member node broadcast tdma communication slot table in cluster, after cluster member receives broadcast, is belonging to certainly Competitive channel in oneself time slot, sends, to cluster head, the data monitoring;Cluster head be responsible for receiving the data that sends of cluster interior nodes and Information in the cluster receiving is merged, and is communicated with adjacent cluster head;
The time frame that cluster head generates, is made up of several time slots and a time slot;Become in each time frame in, cluster Member respectively assigns to a time slot, and member node could send data to cluster head by preferential busy channel only in the time slot of oneself;Cluster Head issues the distribution of next round time slot, new clock sync signal in time slot, and in cluster, member node is all in intercepting shape State, completes the communication with cluster head, and updates time slot and clock.
Further, after cluster head receives the information of cluster interior nodes transmission, realized and neighbours' cluster head between using CSMA/CA mechanism Communication;Before sending data, down hop neighbours' cluster head first sends claim frame to cluster head, and its neighbours' cluster head sends after receiving RTS CTS carries out response, and cluster head sends data to neighbours' cluster head, after neighbours' cluster head receives packet, sends ACK frame to source cluster head true Recognize packet to be correctly received;After other neighbours' cluster heads wait until after listening to RTS or CTS that the transmission of this packet terminates In competitive channel.
Further, according to node, node is divided into three kinds of different roles by the diverse location in cluster:Cluster head front nodal point, cluster Head node and cluster head posterior nodal point;The node of diverse location adopts different rules when selecting the reserving time slots of oneself, if section Point selection reserving time slots n requires n%2=0 as the basic time slot of oneself, then cluster head front nodal point, and cluster head posterior nodal point requires n%2=1; After two clusters meet, two nodes meeting first if it find that in two clusters time slot be assigned the situation of conflict just itself In FI, corresponding time slot is set to the free time, notifies the new time slot of the node application conflicting to solve time slot distribution conflict, realize cluster Fusion.
The beneficial effects of the present invention is:The invention provides being based on the link persistent period in a kind of vehicular ad hoc network Cluster MAC protocol implementation method, the method be conducive to improve vehicular ad hoc network in cluster stability, reduce network overhead; Significantly improve the reliability of data transfer, data transfer delay can be effectively reduced.
Brief description
In order that the purpose of the present invention, technical scheme and beneficial effect are clearer, the present invention provides drawings described below to carry out Explanation:
Fig. 1 is the flow chart that in the embodiment of the present invention, self-organizing network is formed by unsettled condition to cluster head;
Fig. 2 periodically sends for embodiment of the present invention interior joint and accepts basic control message form;
Fig. 3 is that in the embodiment of the present invention, middle cluster updates and the state transition diagram in maintenance process;
Fig. 4 is that the synchronization on the ordinary node retention time in leader cluster node and oneself cluster in the embodiment of the present invention is illustrated Figure;
Fig. 5 is the schematic diagram of syncretizing mechanism between cluster in the embodiment of the present invention;
Fig. 6 is that the distribution principle that in the embodiment of the present invention, cluster head broadcasts tdma communication slot table to member node in cluster is illustrated Figure;
Fig. 7 is that in the embodiment of the present invention, MAC protocol channel distribution utilizes schematic diagram;
Fig. 8 is MAC protocol algorithm flow chart in the embodiment of the present invention.
Specific embodiment
Below in conjunction with accompanying drawing, the preferred embodiments of the present invention are described in detail.
Fig. 1 is the flow chart that in the embodiment of the present invention, self-organizing network is formed by unsettled condition to cluster head, as illustrated, section The detailed process that point chooses cluster head can include:
The information such as the position of step A1-- acquisition node and its neighbours, speed, acceleration.
It is described in detail below, node obtains the information such as the position of itself by GPS positioning system, and pass through periodic base This control message informs the information such as the position of oneself, speed and acceleration to neighbours.
The information of the neighbor node by receiving for the node calculates the average link persistent period of oneself.
Referring to Fig. 2, the periodicity that Fig. 2 obtains information of neighbor nodes for the vehicle providing in the embodiment of the present invention controls substantially Message format.Node judges the state of oneself according to type of message, and type of message Type includes:0 is the state letter of neighbor node Breath, 1 is first information of cluster head, and 2 is cluster head control message, and 3 is last information of cluster head.
According to the node location obtaining, speed, acceleration information determines average between node and neighbor node step A2-- Connect the persistent period.
Specifically, node i obtains current location S by GPSi, speed vi, acceleration aiEtc. information, node i passes through the cycle Property basic control message obtain the current location S of neighbor node jj, speed vj, acceleration ajEtc. information.Node can be with neighbours Node communicates, then position relationship needs to meet below equation.
Wherein, t1Represent that two cars start to the time having required for same speed from initial link,
Node is according to the average link time between below equation calculate node and neighbor node.
Wherein,
Step A3 node determines the degree of communication of node according to the neighbor node set of interaction mode information acquisition.
Specifically, node passes through periodically interaction mode information, records t0Moment neighbor node set N0(i), and currently Moment t1Neighbor node set N1(i), prediction neighbor node change frequent degree;Node i calculates and neighbors according to following formula Between degree of communication.
|N0(i)∪N1(i) | for node in t0Moment and t1Moment all neighbor nodes number, | N0(i)∩N1(i) | for section Point is in t0Moment and t1The number of the neighbor node that the moment has simultaneously, t0And t1Interval less, calculate more accurate, but meeting Increase network overhead, therefore define it and be spaced apart the cycle of status information interaction;
Step A4 chooses cluster head according to the average connection persistent period between node and node degree of communication.
All node broadcasts status informations, node receives average connection persistent period E [link] of neighbor node, with oneself E [link] compare, the maximum node of E [link] becomes cluster head, if there being multiple maximum E [link], chooses degree of communication MC Value less for cluster head.
Cluster head broadcasts Clustering control message to neighbor node, declares oneself to become cluster head and invite neighbor node addition to be somebody's turn to do Cluster.If neighbor node does not receive Clustering control message in the range of intervalometer, oneself forms single cluster.If neighbours Node receives Clustering control message and has the E [link] being only second to cluster head, then set oneself as standby cluster head.
Referring to Fig. 3, Fig. 3 is the state transition diagram that in the embodiment of the present invention, cluster updates and safeguards.Quick shifting due to node Dynamic, frequently result in the communication range that bunch member node leaves cluster head, therefore cluster timely updates and safeguards is necessary.
The renewal of step A5 cluster head and maintenance.
Specifically, cluster head periodically detects the basic status information of cluster member, if there being the E of node in bunch member node [link] value is more than leader cluster node, then the node being set with maximum E [link] is cluster head, and former leader cluster node becomes member node, Otherwise leader cluster node only updates the information such as speed, acceleration and the position of bunch member node.If cluster head does not receive cluster member Status information, then this member is just deleted from this cluster by cluster head.
When the distance away from cluster head for the vehicle exceedes transmission range, just leave cluster and find next cluster addition, or oneself become Individually cluster.In the range of cluster head, in addition to cluster head, the car of highest E [link] is set to standby cluster head, and this standby cluster head is not formed One new cluster, waiting being merged into other clusters or changing the state of oneself becomes a main cluster.
A period of time after cluster member still in the range of cluster head, cluster head just maintains the state of oneself.Plus-minus due to vehicle Speed leads to border cluster member to leave cluster.If it exceeds 10% cluster member leaves the scope of cluster head, but do not leave standby cluster head Scope, just standby cluster head is converted into cluster head.
If cluster head enters into the 1/3 of neighbours' cluster head transmission range, just set standby cluster head as cluster head, if standby cluster head is still The 1/3 of neighbours' cluster transmission range, just send last information, announce to be merged into neighbours' cluster, other clusters member or addition Neighbours' cluster, or return to independent state.
In the embodiment of the present invention, the cluster MAC process of CSMA/TDMA mixed mechanism includes:
Synchronization in step B1 cluster head and cluster interior nodes retention time.
Specifically, referring to Fig. 4, when Fig. 4 is the ordinary node holding in leader cluster node and oneself cluster in the embodiment of the present invention Between on synchronous schematic diagram.In the synchronous period, leader cluster node broadcasts cluster head control message to cluster interior nodes, within the message for every The concrete moment that individual cluster interior nodes distribution is communicated with cluster head, the control message that cluster interior nodes are issued according to cluster head, arrange oneself Activity, when needing oneself communication to be switched on communication module, not during demand oneself communication, then communication close module enters dormancy shape State.
It is member's distribution time slot in cluster that step B2 leader cluster node adopts syncretizing mechanism between cluster.
Specifically, referring to Fig. 5, Fig. 5 is the schematic diagram of syncretizing mechanism between cluster in the embodiment of the present invention.Cluster syncretizing mechanism is concrete Process is as follows.
i:Between cluster, node is divided into three kinds of different roles according to the different position of node by syncretizing mechanism:Cluster head front nodal point, Leader cluster node and cluster head posterior nodal point.
ii:The node of diverse location adopts different rules when selecting the reserving time slots of oneself, if node selects in advance About time slot n requires n%2=0 as the basic time slot of oneself, then cluster head front nodal point, and cluster head posterior nodal point requires n%2=1.
iii:Node receives FI frame every time and just updates the time slot distribution list of oneself, uses same if there are two nodes Time slot, then be set to the free time by this time slot.
iv:The node clashing will re-start the application of time slot.
After two clusters meet, two nodes meeting first if it find that in two clusters time slot be assigned the situation of conflict Just in the FI of itself, corresponding time slot is set to the free time, notifies the new time slot of the node application conflicting to solve time slot distribution punching Prominent, realize the fusion of cluster.
Step B3 cluster head is according to the time slot being distributed to cluster member's time slot table.
The time frame that cluster head generates, is made up of several time slots and a time slot.Referring to Fig. 6, Fig. 6 is that the present invention is real Apply the distribution principle schematic diagram that cluster head in example broadcasts tdma communication slot table to member node in cluster.In each time frame in, cluster Interior member respectively assigns to a time slot, and member node could send number to cluster head by preferential busy channel only in the time slot of oneself According to.Cluster head issues the distribution of next round time slot, new clock sync signal in time slot, and in cluster, member node is all in detecing Listen state, complete the communication with cluster head, and update time slot and clock.
Step B4 cluster head and cluster interior nodes are communicated according to cluster MAC protocol.
Specifically, in each cluster interior nodes of CSMA/TDMA period in oneself allocated time slot preferential and leader cluster node Communication, with other cluster interior nodes contention access channels in overstepping one's bounds timing gap.In CSMA period leader cluster node competitive channel, compete Communicate with neighbours' cluster head after channel success, now, cluster interior nodes enter resting state.
Referring to Fig. 7, Fig. 7 is that in the embodiment of the present invention, MAC protocol channel distribution utilizes schematic diagram.Channel is with 100ms for one In the individual cycle, each cycle is divided into two parts:CSMA time period and TDMA time period.Each time period is respectively 50ms.Will Each time period is divided into 10 time slots, each time slot 5ms.
Adopt CSMA contention access channel between CSMA time period CH, carry out data transmission.In the CSMA/TDMA time Section, CH allocates time slot in advance to each CM, CM contention access channel, the CM priority access letter in the assigned timeslot of CH distribution Road, the waiting time is SIFS.If not in the time slot that oneself is distributed, CM equally can with contention access channel, but wait when Between be DIFS.So ensure that other CM also can access channel, improves the utilization of channel when CM is idle in the time slot being distributed Rate.
Referring to Fig. 8, Fig. 8 is the flow chart based on link persistent period cluster MAC process provided in an embodiment of the present invention.Cluster In MAC, the process of cluster head and cluster interior nodes access channel transmission data is as follows:
Cluster is formed by Clustering Algorithm, chooses cluster head;
Cluster head distributes corresponding time slot according to syncretizing mechanism between synchronization mechanism and cluster for cluster interior nodes;
Node controls the period of frame arrangement according to the condition adjudgement of oneself;
If cluster head and cluster member communication's period, cluster member judges whether oneself is the time slot that cluster head is distributed, if it is, Wait competitive channel after SIFS, otherwise wait for after DIFS in competitive channel;
If the communication time period between cluster head, communicated with neighbours' cluster head using CSMA mechanism.
Finally illustrate, preferred embodiment above only in order to technical scheme to be described and unrestricted, although logical Cross above preferred embodiment the present invention to be described in detail, it is to be understood by those skilled in the art that can be In form and various changes are made to it, without departing from claims of the present invention limited range in details.

Claims (3)

1. the clustering method based on the link persistent period in a kind of vehicular ad hoc network it is characterised in that:Walk including following Suddenly:Node passes through GPS and periodically the position of control message acquisition vehicle node, speed, acceleration, node type are believed substantially Breath;The average link persistent period between node and neighbor node is determined according to the node location obtaining, velocity information;
History neighborhood according to node and current neighbours set determine the degree of communication of this node;
Size according to the average link persistent period between node and degree of communication chooses the maximum node of priority as cluster head;
Standby cluster head is become according to the node that the priority selection of node is only second to cluster head;
Cluster head broadcasts Clustering control message to its cluster interior nodes, declares oneself to become cluster head, cluster interior nodes are according to the position of oneself Determine it oneself is cluster interior nodes with receiving status message, and reply to cluster head;
Described average link time between node and neighbor node is determined according to the node location obtaining, velocity information, specially:
Node i obtains current location S by GPSi, speed vi, acceleration aiInformation;
Node i passes through the current location S that periodically basic control message obtains neighbor node jj, speed vj, acceleration ajLetter Breath;
Node i calculates, according to following formula, the position relationship that can communicate with neighbor node j:
1 2 ( a j - a i ) t 2 + ( v j - v i ) t = R - ( S j - S i ) 0 ≤ t ≤ t 1 1 2 ( a j - a i ) t 2 + ( v j - v i ) t = R + ( S j - S i ) t > t 1
Wherein, t1Represent that two cars start to the time having required for same speed from initial link,
Node i calculates the link time with neighbor node j according to following formula:
T i = m i n ( t , t m a x ) a j - a i ≠ 0 , v j - v i = 0 t m a x a j - a i = 0 , v j - v i = 0
Node i calculates the average link time and between neighbors according to following formula:
E [ l i n k ] = Σ i = 1 N T i N
Wherein:N is the neighbor node number not determining state, TiFor the chain between present node and node i (i=1,2 ..., N) The road persistent period, tmaxThe maximum link persistent period between for node.
2. the clustering method based on the link persistent period in vehicular ad hoc network according to claim 1, its feature It is:The described history neighborhood according to node and current neighbours set determine that the degree of communication of node is specially:
Node passes through periodically interaction mode information, records t0Moment neighbor node set N0(i), and current time t1Neighbours Node set N1(i), prediction neighbor node change frequent degree;
Node i calculates the degree of communication and between neighbors according to following formula:
M C [ i ] = | N 0 ( i ) ∩ N 1 ( i ) | - | N 0 ( i ) ∩ N 1 ( i ) | | N 0 ( i ) ∪ N 1 ( i ) |
Wherein:N0(i)∪N1I () is node in t0Moment and t1Moment all neighbor nodes number, N0(i)∩N1I () is node In t0Moment and t1The number of the neighbor node that the moment has simultaneously.
3. the clustering method based on the link persistent period in vehicular ad hoc network according to claim 2, its feature It is:Described selection average link persistent period highest node as cluster head, including:
The priority of node is determined according to the average link persistent period of node, the link persistent period is bigger, and node degree of communication is got over Little, then priority is bigger, and using the node with the highest link persistent period as cluster head, the node that priority is only second to cluster head becomes For standby cluster head;
Cluster head broadcasts Clustering control message to its cluster interior nodes, declares oneself to become cluster head, cluster interior nodes are according to the state of oneself Determine it oneself is cluster interior nodes or standby cluster head, and reply to cluster head;
There is no other neighbor nodes around node, then this node forms single cluster, set oneself cluster head.
CN201410133166.0A 2014-04-03 2014-04-03 Cluster MAC protocol implementation method based on the link persistent period in vehicular ad hoc network Active CN103873485B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410133166.0A CN103873485B (en) 2014-04-03 2014-04-03 Cluster MAC protocol implementation method based on the link persistent period in vehicular ad hoc network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410133166.0A CN103873485B (en) 2014-04-03 2014-04-03 Cluster MAC protocol implementation method based on the link persistent period in vehicular ad hoc network

Publications (2)

Publication Number Publication Date
CN103873485A CN103873485A (en) 2014-06-18
CN103873485B true CN103873485B (en) 2017-03-08

Family

ID=50911612

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410133166.0A Active CN103873485B (en) 2014-04-03 2014-04-03 Cluster MAC protocol implementation method based on the link persistent period in vehicular ad hoc network

Country Status (1)

Country Link
CN (1) CN103873485B (en)

Families Citing this family (32)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104618245B (en) * 2014-12-23 2017-08-29 西安电子工程研究所 The integrated Designing of ad hoc network method of MAC/ routes coordinated based on cluster head
CN106034280A (en) * 2015-03-12 2016-10-19 北京信威通信技术股份有限公司 Node-identity-feature-based clustering method in Ad-Hoc network
CN106034301A (en) * 2015-03-14 2016-10-19 北京信威通信技术股份有限公司 Node-characteristic-based clustering method in ad-hoc network
CN106034305A (en) * 2015-03-14 2016-10-19 北京信威通信技术股份有限公司 Clustering method based on node identity characteristic in ad-hoc network
CN106303986A (en) * 2015-06-26 2017-01-04 中兴通讯股份有限公司 The system of selection of headstock and device in fleet
CN106331980A (en) 2015-06-26 2017-01-11 中兴通讯股份有限公司 Method and device for managing vehicles in vehicle to everything
CN105245563B (en) * 2015-08-27 2018-05-15 重庆邮电大学 A kind of dynamic clustering method based on vehicle node connection stability
CN105681012B (en) * 2016-03-15 2019-01-15 厦门大学 A kind of gateway cooperated MAC protocol implementation method based on cluster in In-vehicle networking
CN105657068A (en) * 2016-03-28 2016-06-08 厦门大学 Implement method based on vehicle moving information clustering
CN105788354B (en) * 2016-04-19 2018-02-23 东华大学 A kind of indoor parking position based on VANET is found and reserving method
CN107071843B (en) * 2016-12-28 2020-04-28 上海海事大学 Mobile self-organizing network clustering method
CN106792977A (en) * 2017-01-25 2017-05-31 南通大学 Double cluster head method for routing based on traffic density in vehicular ad hoc network
CN107426694B (en) * 2017-06-26 2020-06-09 湖南大学 Fuzzy clustering method for vehicle-mounted self-organizing network
CN107241774B (en) * 2017-08-15 2020-12-08 中国联合网络通信集团有限公司 Switching method and system of self-organizing network
CN107659651A (en) * 2017-09-19 2018-02-02 南昌工程学院 The method and system of group-net communication between a kind of vehicle
CN109361598B (en) * 2018-08-15 2020-12-08 西安电子科技大学 Wired and wireless mixed Internet of things system and clustering method
CN108881016B (en) * 2018-08-30 2020-12-08 同济大学 Method for constructing self-organizing network community of Internet of vehicles and balancing communication load of community nodes
US20220141625A1 (en) * 2019-04-04 2022-05-05 Ntt Docomo, Inc. Cluster head parameter determination method and terminal
CN110139334B (en) * 2019-04-28 2023-09-22 沈阳航空航天大学 Cluster routing method based on influence maximization of software-defined vehicle-mounted network
CN112055394B (en) * 2019-06-06 2023-01-24 佛山科学技术学院 Wireless sensor network clustering routing method and system for rapid inclusion elimination
CN110366135B (en) * 2019-07-17 2020-12-25 吉林大学 Channel competition method in wireless self-organizing network based on TDMA and application
CN110855563B (en) * 2019-10-29 2021-09-17 南京邮电大学 Vehicle clustering method based on link reliability and stability
CN110933648A (en) * 2019-12-17 2020-03-27 华东理工大学 Vehicle-mounted ad hoc network clustering method based on link reliability
CN111131031B (en) * 2019-12-27 2022-05-20 南京邮电大学 VANET cluster clustering optimization method based on mobility weight
CN111194018B (en) * 2020-01-06 2021-03-02 北京邮电大学 Vehicle ad hoc network-oriented mobile edge data uploading method and system
CN111510933A (en) * 2020-04-16 2020-08-07 上海无线电设备研究所 Ad hoc network clustering method of multi-directional antenna
CN111626352A (en) * 2020-05-26 2020-09-04 多伦科技股份有限公司 Adaptive energy consumption optimal vehicle clustering method based on fuzzy C-means
CN112383925B (en) * 2020-11-25 2022-06-17 海南大学 Cluster-based design method of space-time scheduling MAC protocol
CN112867160B (en) * 2021-04-25 2021-09-07 北京理工大学 Multi-cluster networking communication method, system, electronic equipment and storage medium
CN114979315B (en) * 2022-03-30 2023-12-22 江苏杰泽罗通信科技有限公司 Channel resource sharing access method for vehicle-mounted self-organizing network
CN115226139B (en) * 2022-09-19 2022-12-27 北京天辰合创科技有限公司 Method and system for pushing and maintaining dual-redundancy high-reliability cluster head of wireless self-organizing network
CN116709532B (en) * 2023-08-08 2023-10-20 合肥工业大学 Data scheduling method based on conflict graph and clustering in Internet of vehicles environment

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103259744A (en) * 2013-03-26 2013-08-21 北京航空航天大学 Method for mapping mobile virtual network based on clustering
US8600341B2 (en) * 2008-03-14 2013-12-03 William J. Johnson System and method for location based exchanges of data facilitating distributed locational applications

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8600341B2 (en) * 2008-03-14 2013-12-03 William J. Johnson System and method for location based exchanges of data facilitating distributed locational applications
CN103259744A (en) * 2013-03-26 2013-08-21 北京航空航天大学 Method for mapping mobile virtual network based on clustering

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
车载自组织网络簇机制及路由协议研究;陈培菊;《万方学位论文》;20131231;第17-64页 *

Also Published As

Publication number Publication date
CN103873485A (en) 2014-06-18

Similar Documents

Publication Publication Date Title
CN103873485B (en) Cluster MAC protocol implementation method based on the link persistent period in vehicular ad hoc network
CN103096327B (en) A kind of vehicular ad hoc network network self-adapting time slot distribution method based on TDMA
CN101409660B (en) Channel access control method for wireless sensor network
US7298716B2 (en) Clustering based load adaptive sleeping protocol for ad hoc networks
CN101827378B (en) Blending MAC protocol design method suitable for wireless sensor network
Yahya et al. Towards a classification of energy aware MAC protocols for wireless sensor networks
US9351301B2 (en) Maintenance of time slot usage indicators and self-organizing networking
CN105722231B (en) A kind of design method for the vehicle-mounted net MAC protocol of multichannel continuously coordinated
TWI441494B (en) An asymmetric and asynchronous energy conservation protocol for vehicular networks
CN102122973A (en) Clustering-wireless-sensor-network-orientated two-stage adaptive frequency-hopping method
CN102695287B (en) VANET (vehicular ad-hoc network) media access control method
CN101184005B (en) Double cluster wireless sensor network based adaptive communication method
CN100588168C (en) Double cluster based wireless sensor network distributed topology control method
CN109673045B (en) Wireless sensor network time slot allocation multi-hop synchronous transmission system and method
CN103415045B (en) A kind of method for designing of efficient wireless information interaction procotol
CN102300257A (en) Channel booking mechanism-based multi-channel multi-address access method in wireless ad hoc network
CN105050117A (en) Ad-hoc network communication method based on business type competition and coordination time division multiple access (TDMA)
Cunningham et al. Time bounded medium access control for ad hoc networks
Gao et al. A hybrid clustering-based MAC protocol for vehicular ad hoc networks
CN105188117B (en) The farmland wireless sensor network frequency interlace cut-in method of time-space domain multiplexing
CN101282299B (en) Method for measuring displacement speed of motion body in multi-hop network
Zhang et al. A clustering-based collision-free multichannel MAC protocol for vehicular ad hoc networks
CN103281731B (en) A kind of MAC method for managing resource based on competition
Zhang et al. A tdma based cooperative communication mac protocol for vehicular ad hoc networks
Wu et al. An adaptive TDMA scheduling strategy based on beacon messages for vehicular ad-hoc network

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant