CN100576826C - A kind of vehicle-mounted Ad hoc network cluster dividing method based on the signal bonding strength - Google Patents
A kind of vehicle-mounted Ad hoc network cluster dividing method based on the signal bonding strength Download PDFInfo
- Publication number
- CN100576826C CN100576826C CN200710179578A CN200710179578A CN100576826C CN 100576826 C CN100576826 C CN 100576826C CN 200710179578 A CN200710179578 A CN 200710179578A CN 200710179578 A CN200710179578 A CN 200710179578A CN 100576826 C CN100576826 C CN 100576826C
- Authority
- CN
- China
- Prior art keywords
- node
- bunch
- clustering
- information
- sub
- 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
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a kind of vehicle-mounted Ad hoc network cluster dividing method, provide a kind of and start with, participate in same bunch formation and the network cluster dividing of maintenance process and the method for maintenance between the vehicle that travels in the same way from vehicle traveling direction information based on signal strength signal intensity.After node initializing, setting up interim bunch of head in the same way between driving vehicle, in the double bounce scope of interim bunch of head, form neighbours and connect table, the node that node connects signal strength signal intensity weights maximum is a bunch first node, and all the other nodes are the ordinary node or the gateway node of this bunch; Maintenance process is based on the travel direction information and the node bonding strength signal of automobile.The present invention is owing to considered travel direction information and node connection signal strength signal intensity, so the relative additive method of clustering vehicle mounted Ad hoc network structure will be stablized under urban traffic environment, node change number of times and the control information quantity relevant with sub-clustering are few, the invention solves that vehicle-mounted Ad hoc network performance under the urban traffic environment is low, life-span of prolonging bunch, improved network state.
Description
Technical field
Vehicle-mounted Ad hoc network cluster dividing method based on signal strength signal intensity belongs to large-scale wireless Ad hoc network cluster dividing route research field.
Background technology
Mobile Ad hoc network (MANET) is a network a kind of multi-hop, self-organizing, each node is a main frame, is again router, between two nodes if communicate, if the other side not in the signal cover of oneself, need transmit by other nodes.The quality of Route Selection has influenced the performance of network to a great extent.Because the node in the MANET network may move at any time, and does not have the central control equipment of base station and so on to be attached thereto, this brings great convenience to the user on the one hand, has also brought difficulty for the design appropriate routing protocol on the other hand.
Consider that from the architecture aspect of network mobile Ad hoc network (MANET) can be divided into plane formula and stagewise.Planar structure is relatively more healthy and stronger, but it is big to control expense, and extensibility is not good, mainly is applicable to small-/medium-sized Intranet.In the hierarchy, network is divided cluster, and each bunch comprises a bunch of head and a plurality of bunches of members, and bunch head and gateway constitute virtual backbone network.The advantage of hierarchy is that network expansibility is good, realizes Network Management and synchronous easily.In addition, based on cluster structured, MANET can adopt the resource allocation methods of similar cellular network.Bunch in, service access request and reasonable distribution bandwidth that bunch head can Control Node.Therefore by the sub-clustering algorithm network is divided the performance that cluster can improve Ad hoc network, significant.At present, a lot of heuristic sub-clustering algorithms have been proposed, as minimum node sub-clustering algorithm, high node degree sub-clustering algorithm, node weights sub-clustering algorithm, weighting sub-clustering algorithm as required, and effectively reduce multi-hop clustering algorithm of a bunch quantity or the like.Wherein, the principle of maximum node degree algorithm is the number that as far as possible reduces bunch, the hop count when reducing message transmissions.Each node can be known the number of its neighbor node by mutual control messages, then the number of degrees (not calculated its node degree by the node of sub-clustering) of oneself is broadcasted to neighbor node.All not by the sub-clustering node in, the node of selecting number of degrees maximum is as a bunch head.When the number of degrees were identical, the node of then selecting the ID minimum was as bunch head.The neighbor node of bunch head then becomes the member of this bunch, and the generative process that no longer participates in bunch, carries out above process repeatedly and all adds certain bunch up to all nodes.The advantage of this algorithm is that the sub-clustering algorithm is simple, and the number in the network bunch is less, promptly the source destination node between average number of hops less, thereby reduced the grouping round-trip delay.The shortcoming of this algorithm is that the election algorithm of bunch first node optimizes inadequately, and network cluster dividing do not consider the node motion directional information, and therefore when node mobility by force the time, the renewal frequency of bunch head sharply rises, and has caused a large amount of maintenance costs.Therefore, how designing a kind of high efficiency sub-clustering generation and maintenance strategy, solve the existing the problems referred to above of the vehicle-mounted Ad hoc of extensive high mobility network, is the key issue that current clustering route protocol is studied.
Summary of the invention
The object of the present invention is to provide and a kind ofly can optimize the sub-clustering performance, stablize cluster structured vehicle-mounted Ad hoc network cluster dividing method based on signal strength signal intensity.
The invention is characterized in that it contains following steps successively:
Step (1.): node initializing: in each node, set up a hop neighbor table, the linking relationship of record node and all hop neighbor nodes, comprising: neighbor node ID, this node is connected signal strength signal intensity with neighbor node; Set up the sub-clustering information table, comprising: bunch interior nodes ID, node type, priority, connection jumping figure information; Set up the two-hop neighbor node connection matrix in interim bunch of first node, connection matrix is the N*N square formation, and N is the quantity of all two-hop neighbor node., W wherein
IjThe signal bonding strength of expression node i and node j, 0 for there not being connection;
Step (2.): individual node participates in the formation of sub-clustering according to following steps after the table initialization is finished:
Step (2.1): after node starts towards periphery two-hop neighbor node send the hello packet that comprises travel direction information, the neighbor node back message using that travels in the same way comprises the state of link and this node.If find the double bounce interior nodes bunch first node that has existed is arranged, then statement adds this group, wait acknowledge; If receive interim bunch of first statement, then enter step (2.2); If both discovery bunch first node was not received interim bunch of first statement yet then was jumped into step (2.3).
Step (2.2): a hop neighbor table of this node is issued interim bunch of first node.
Step (2.3): the node in this node double bounce scope sends interim bunch of first statement, receives that the node of statement carries out step (2.2) operation.
Step (2.4): a hop neighbor link information of each node that interim bunch of first node will be received gathers the hop neighbor node connection matrix for all nodes in comprising bunch, and carry out a bunch first-selection according to following method and select: obtain the two-hop neighbor node connection matrix by a hop neighbor node connection matrix is carried out square operation, the element sum of each row of matrix is exactly the cum rights connection degree of this journey institute corresponding node, calculating the node of choosing connection degree maximum after the cum rights connection degree is bunch first node, and election results are broadcasted, receive that the node of broadcast message judges whether oneself is a bunch first node, not then to send application for registration to a bunch first node, receive that return information then successfully adds the group, when this node has been the group members of other groups, after then receiving broadcast message oneself is registered as gateway node, and to neighbor node and related bunch first node send state information; Last bunch of first node generates bunch membership table, and member in being broadcast to bunch.Clustering process finishes.
Step (3.): after clustering process was finished, a bunch interior nodes entered the sub-clustering maintenance phase, and the sub-clustering maintenance process comprises that new node adds, node leaves, bunch first the change, processes such as the registration of gateway node and cancellation, and maintenance process is carried out according to following steps:
Step (3.1): the node that does not add any bunch is at first waited for two seconds, if receive Hello information in two seconds from other bunch head, then judge it oneself whether has been arbitrary bunch bunch member node, if, then trigger application process and apply to become gateway node to this bunch, if oneself do not add any bunch, then application is rank and file's node of this bunch; Do not receive the Hello information of any bunch of head when two seconds interior nodes, then the node broadcasts request towards periphery of this node adds information, comprise node ID in the information, travel direction information etc., and the jumping figure that this broadcasting is set is a double bounce, receive that the general node and the gateway node of broadcast message be responsible for transmitting message, bunch first node of receiving broadcast message is then judged the travel direction information in the request adding information, if it is identical with this bunch travel direction, then return confirmation, this node is added this bunch, and relevant information is saved in the sub-clustering information table, sub-clustering information table after will upgrading is subsequently broadcasted, and other member receives the sub-clustering information table related content of upgrading oneself after the broadcast message in bunch; If different, then ignore the request of receiving with this bunch travel direction.
Step (3.2): the communication range of any node in bunch member node is left the group, or effective route requests takes place but under the situation of failing to reach, temporary 30 seconds of bunch first node state information that node is relevant therewith and solicited message, if still can't detect destination node in 30 seconds occurs once more, announce that then this member leaves this bunch, and in the sub-clustering information table, delete this nodal information, start sub-clustering information table broadcasting renewal process; If receive that detecting destination node occurs once more in 30 seconds, then keep original sub-clustering information;
Step (3.3): in the connection weights of bunch first node drop to bunch, connect the highest node of weights 1/3 the time, bunch first node change process of startup, former bunch of first node abandoned the position of bunch head, connecting the highest node statement of weights in bunch oneself is a bunch first node, and starts sub-clustering route information table renewal process;
Step (3.4): when two move in the same way bunch in bunch first node motion to each other one when jumping within the communication range, the size that compares two sub-clusterings, bunch node that number of members is less is abandoned a bunch first qualification, bunch node that number of members is bigger continues to keep bunch first qualification, gateway node change identity between original two bunches is rank and file's node of existing bunch, nullified bunch in original member node, if within the double bounce communication range of existing bunch of first node, then statement oneself is existing bunch a member node, and other nodes then restart clustering process;
Step (3.5): when all gateway nodes between two bunches all with certain cluster when first out of touch, a bunch first node of two bunches announces to remove neighbours' bunch relation.
The running car characteristic that the present invention is directed in the real road is carried out the design of sub-clustering algorithm, taken into full account the characteristics of vehicle-mounted Ad hoc network, and utilized the information of node bonding strength to assist sub-clustering, the sub-clustering flow process is simple, the node computation burden is little, and algorithm is that half distributed algorithm and complexity are little; Adopt the present invention to carry out sub-clustering, clustering architecture is stable, and node change number of times is few, can effectively reduce the control information that produces in the sub-clustering, improves the performance of network, has solved the low problem of the vehicle-mounted performance of Ad hoc network in actual environment.
Description of drawings
Fig. 1. consider the sub-clustering strategy schematic diagram of vehicle traveling direction information, the circle of numeral 1 to 4 sign is represented the vehicle of four groups of different travel directions, 1 the node of being designated within the border circular areas of two black curves sign is respectively ordinary node or bunch first node in two bunches, and the zone that intersect in two round territories is interior, and to be expressed as 1 node be gateway node.；
Fig. 2. sub-clustering forms the algorithm flow chart in stage;
Fig. 3. the process chart that node leaves bunch;
Fig. 4. the process chart of bunch first node conflict;
Embodiment
The traditional sub-clustering algorithm that is applied to Ad hoc network is of a great variety, but does not mostly consider the concrete application scenario of sub-clustering algorithm.At first, under the real road environment, because the vehicle mobility is strong, relative moving speed is very big between the vehicle of different travel directions, if adopt traditional sub-clustering strategy, will inevitably cause cluster structuredly can't stablize, the problem of bunch first node frequent updating, make that control information occupies the massive band width resource in the network, system robustness descends, and network performance seriously reduces.Secondly, the tradition cluster-dividing method is not considered signal strength signal intensity between the node, thereby the cluster and the gateway node that may cause adopting the method to elect do not have good communication capacity and stability, and the cluster that therefore brings and the frequent updating of gateway node can be brought very big influence to network performance equally.Design and a kind ofly consider that the vehicle-mounted Ad hoc sub-clustering algorithm of real road environment and vehicle traveling direction information and terminal room signal bonding strength is main contribution of the present invention.
Consider that the sub-clustering strategy schematic diagram of vehicle traveling direction information sees Fig. 1: this figure can clearly show the characteristics when automobile this sub-clustering strategy during to different direction running, among the figure, the vehicle of four groups of different travel directions is represented with the circle of numeral 1 to 4 sign, the other arrow of circle is represented the direction of motion of node, when the sub-clustering formation stage begins, vehicle within the one jumping communication range at first exchanges travel direction information each other, the vehicle of different directions does not participate in clustering process each other, 1 the node of being designated among the figure within the border circular areas of two black curves sign is respectively ordinary node or bunch first node in two bunches, and the zone that intersect in two round territories is interior, and to be expressed as 1 node be gateway node.By bunch head and gateway node, when bunch interior nodes need communicate with a bunch exterior node, according to the information of bunch membership table and routing table, bunch member by gateway node and other bunches communicated with bunch vehicle communication.
In description of the invention, the sub-clustering strategy is divided into sub-clustering forming process and sub-clustering maintenance process two parts, node initializing and sub-clustering forming process that the first is finished by step (2.).Its main thought is: after node initializing is finished, at first wait for two seconds, if receive Hello information in two seconds from other bunch head, then judge it oneself whether has been arbitrary bunch bunch member node, if, then trigger application process and apply to become gateway node to this bunch, if oneself do not add any bunch, then application is rank and file's node of this bunch; Do not receive the Hello information of any bunch of head when two seconds interior nodes, clustering process is triggered, at first judge double bounce with interior have do not have interim bunch of first node, if not then statement oneself be an interim bunch of first node, a hop neighbor table of each node that interim bunch of first node basis received gathers the jumping connection matrix A for all nodes in comprising bunch:
A wherein
IjThe signal bonding strength of expression node i and node j.Obtain two jumping connection matrix B by a step connection matrix being carried out square operation:
W wherein
IjBetween expression node i and the node two jumped the signal bonding strength.The element sum of each row is exactly the cum rights connection degree W of this journey institute corresponding node in the matrix B
i, computing formula is as follows:
Calculating the node of choosing connection degree maximum after the cum rights connection degree is bunch first node, and election results are broadcasted.Other nodes that participate in this sub-clustering are determined the role of oneself according to the sub-clustering result who receives, if be elected as a bunch first node, then wait for the application of other nodes, and reply log-on message, if rank and file's node or gateway node are then registered to a bunch first node respectively.
It two is sub-clustering maintenance processes of being finished by step (3).The sub-clustering maintenance phase can be divided into several different situations and handle: first kind of situation is to be connected with its disconnection double bounce and route requests can't arrive the time when a bunch first existing arbitrary node, just trigger the maintenance processor that node leaves, 30 seconds phase buffer at first is set, if interior nodes came back in bunch first control range in 30 seconds, then just upgrading the routing iinformation relevant with this node gets final product, if can't rediscover this node in 30 seconds, announce that then node leaves bunch, and carry out the renewal of corresponding bunch of membership table according to the difference of node type; The trigger condition of second kind of situation is: when bunch first existing connection weights when bunch first node drop to the connection weights are the highest in the group node 1/3 the time, satisfy this condition and then trigger a bunch first node change process, former bunch of first node abandoned the position of bunch head, connecting the highest node statement of weights in bunch oneself is a bunch first node, and starts sub-clustering route information table renewal process; The third situation be when two move in the same way bunch in bunch first node motion to each other one when jumping within the communication range, the size that compares two sub-clusterings, bunch node that number of members is less is abandoned a bunch first qualification, bunch node that number of members is bigger continues to keep bunch first qualification, gateway node change identity between original two bunches is rank and file's node of existing bunch, nullified bunch in original member node, if within the double bounce communication range of existing bunch of first node, then statement oneself is existing bunch a member node, and other nodes then restart clustering process.
Claims (1)
1, a kind of vehicle-mounted Ad hoc network cluster dividing method based on the signal bonding strength, it is characterized in that actual features that this method is based on vehicle-mounted Ad hoc network consider vehicle traveling direction information and utilize the signal bonding strength for weights carry out sub-clustering and bunch maintenance process, this method contains following steps:
Step (1.): node initializing: in each node, set up a hop neighbor table, the linking relationship information of record node and all hop neighbor nodes, linking relationship information comprises: the signal bonding strength of neighbor node ID, this node and neighbor node; Set up the sub-clustering information table, comprise in the sub-clustering information table: bunch interior nodes ID, node type, priority and be connected jumping figure information; Set up the two-hop neighbor node connection matrix in interim bunch of first node, connection matrix is the N*N square formation, and N is the quantity of all two-hop neighbor node, and the connection matrix element is designated as W
Ij, W
IjThe signal bonding strength of expression node i and node j, W
IjValue is that 0 expression does not have connection;
Step (2.): individual node participates in the formation of sub-clustering according to following steps after the table initialization is finished:
Step (2.1): two-hop neighbor node transmission towards periphery comprised the hello packet of travel direction information after node started, neighbor node back message using in the same way travels, the state that comprises link and this node, when finding that the double bounce interior nodes has bunch first node that has existed, then statement adds this bunch, wait acknowledge; When receiving interim bunch of first statement, then enter step (2.2); Both discovery bunch first node was not received interim bunch of first statement yet, then jumped into step (2.3);
Step (2.2): a hop neighbor table of this node is issued interim bunch of first node, enter step (2.4);
Step (2.3): the node in this node double bounce scope sends interim bunch of first statement, receives that the node of statement carries out step (2.2) operation;
Step (2.4): the linking relationship information of a hop neighbor node of each node that interim bunch of first node will be received gathers for one of all nodes in comprising bunch jumps connection matrix, and carry out a bunch first-selection according to following method and select: obtain the two-hop neighbor node connection matrix by a jumping connection matrix is carried out square operation, the element sum of each row of matrix is exactly the cum rights connection degree of this journey institute corresponding node, calculating the node of choosing cum rights connection degree maximum after the cum rights connection degree is bunch first node, and election results are broadcasted, receive that the node of broadcast message judges whether oneself is a bunch first node, not then to send application for registration to a bunch first node, receive that return information then successfully adds bunch, when this node has been bunch member of other bunches, after then receiving broadcast message oneself is registered as gateway node, and to neighbor node and related bunch first node send state information; Last bunch of first node generates bunch membership table, and member in being broadcast to bunch, and clustering process finishes;
Step (3.): after clustering process was finished, a bunch interior nodes entered the sub-clustering maintenance phase, and the sub-clustering maintenance process comprises that new node adds, node leaves, bunch first the change and the registration and the log off procedure of gateway node, and maintenance process is carried out according to following steps:
Step (3.1): the node that does not add any bunch is at first waited for two seconds, in two seconds, receive Hello information from other bunch head, judge that then whether oneself has been arbitrary bunch bunch member node: be then to trigger application process and apply to become gateway node to this bunch; When oneself not adding any bunch, then application is rank and file's node of this bunch; Do not receive the Hello information of any bunch of head when two seconds interior nodes, then the node broadcasts request towards periphery of this node adds information, comprise node ID and travel direction information in the information, and the jumping figure that this broadcasting is set is a double bounce, receive that the general node and the gateway node of broadcast message be responsible for transmitting message, bunch first node of receiving broadcast message is then judged the travel direction information in the request adding information, when identical with this bunch travel direction, then return confirmation, this node is added this bunch, and relevant information is saved in the sub-clustering information table, sub-clustering information table after will upgrading is subsequently broadcasted, and other member receives the sub-clustering information table related content of upgrading oneself after the broadcast message in bunch; When different, then ignore the request of receiving with this bunch travel direction;
Step (3.2): the communication range of any node in bunch member node is left bunch, or effective route requests takes place but under the situation of failing to reach, temporary 30 seconds of bunch first node state information that node is relevant therewith and solicited message, still can't detect destination node in 30 seconds occurs once more, announce that then this member leaves this bunch, and in the sub-clustering information table, delete this nodal information, start sub-clustering information table broadcasting renewal process; Receive that in 30 seconds detecting destination node occurs once more, then keeps original sub-clustering information;
Step (3.3): the node that cum rights connection degree is the highest in the cum rights connection degree of bunch first node drops to bunch 1/3 the time, bunch first node change process of startup, former bunch of first node abandoned the position of bunch head, the node statement that cum rights connection degree is the highest in bunch oneself is a bunch first node, and starts sub-clustering route information table renewal process;
Step (3.4): when two move in the same way bunch in bunch first node motion to each other one when jumping within the communication range, the size that compares two sub-clusterings, bunch bunch first node that number of members is less is abandoned a bunch first qualification, bunch first node that bunch number of members is bigger continues to keep bunch first qualification, gateway node change identity between original two bunches is rank and file's node of existing bunch, nullified bunch in original member node, within double bounce communication range at existing bunch of first node, then statement oneself is existing bunch a member node, and other nodes then restart clustering process;
Step (3.5): when all gateway nodes between two bunches all with certain cluster when first out of touch, a bunch first node of two bunches announces to remove neighbours' bunch relation.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200710179578A CN100576826C (en) | 2007-12-14 | 2007-12-14 | A kind of vehicle-mounted Ad hoc network cluster dividing method based on the signal bonding strength |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200710179578A CN100576826C (en) | 2007-12-14 | 2007-12-14 | A kind of vehicle-mounted Ad hoc network cluster dividing method based on the signal bonding strength |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101207572A CN101207572A (en) | 2008-06-25 |
| CN100576826C true CN100576826C (en) | 2009-12-30 |
Family
ID=39567468
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200710179578A Expired - Fee Related CN100576826C (en) | 2007-12-14 | 2007-12-14 | A kind of vehicle-mounted Ad hoc network cluster dividing method based on the signal bonding strength |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100576826C (en) |
Families Citing this family (39)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101360033B (en) * | 2008-09-28 | 2010-11-17 | 熊猫电子集团有限公司 | Mobile self-organizing network cluster dividing method based on state mechanism |
| CN101394353B (en) * | 2008-10-13 | 2011-11-02 | 北京邮电大学 | Data packet competition forwarding method used in vehicle-mounted Ad hoc network |
| CN101431468B (en) * | 2008-12-05 | 2011-03-23 | 天津大学 | Greed data forwarding method based on direction in vehicle-mounted network |
| CN101437304B (en) * | 2008-12-17 | 2011-06-01 | 西安交通大学 | Loose virtual cluster division method for power heterogeneous point Ad Hoc network |
| CN102176789A (en) * | 2009-10-24 | 2011-09-07 | 佛山市顺德区汉达精密电子科技有限公司 | Disconnection response method and system of wireless local area network |
| CN102196602B (en) * | 2011-04-27 | 2013-07-31 | 北京大学 | Real time data fusion algorithm for vehicle self-organized network |
| CN102158983B (en) * | 2011-05-04 | 2013-09-04 | 常熟理工学院 | Method for constructing 6LoWPAN wireless sensor network |
| TWI459737B (en) * | 2011-06-17 | 2014-11-01 | Inst Information Industry | Routing analyzing apparatus and routing analyzing method thereof for use in power line communication network |
| CN102325306B (en) * | 2011-08-23 | 2014-01-22 | 哈尔滨工业大学 | VANET (vehicular ad-hoc network) clustered broadcasting method based on comprehensive weighting |
| CN102307373B (en) * | 2011-08-23 | 2014-01-22 | 哈尔滨工业大学 | VANET clustering method taking regard of vehicle traffic characteristic |
| CN102413178B (en) * | 2011-11-14 | 2014-02-12 | 无锡南理工科技发展有限公司 | Safe automatic clustering method of wireless sensor network nodes |
| CN102685808A (en) * | 2012-05-18 | 2012-09-19 | 电子科技大学 | Distribution type clustering method based on power control |
| CN102883263B (en) * | 2012-09-19 | 2015-11-18 | 合肥工业大学 | A kind of VANET sub-clustering maintaining method based on Adjacent vehicles distance |
| CN102857990B (en) * | 2012-09-29 | 2015-08-12 | 苏州贝尔塔数据技术有限公司 | The two cluster head cluster-dividing method of three grades of tree structure tokens towards high speed node Ad Hoc network |
| CN102869016B (en) * | 2012-09-29 | 2015-04-01 | 苏州贝尔塔数据技术有限公司 | Safe adding method of nodes in high speed node ad hoc network |
| CN103501270B (en) * | 2013-10-15 | 2017-03-22 | 南通大学 | Rapid node cluster head recommending method |
| CN103607456B (en) * | 2013-11-21 | 2018-12-18 | 厦门雅迅网络股份有限公司 | A kind of method of the remote software upgrading of cluster mobile terminal |
| CN104754592B (en) * | 2013-12-31 | 2018-03-06 | 北京大唐高鸿软件技术有限公司 | A kind of vehicle-mounted short distance communication network cluster-dividing method suitable for urban road environment |
| CN106034342B (en) * | 2015-03-12 | 2019-08-27 | 北京信威通信技术股份有限公司 | The abnormal processing method of cluster routing is taken off in a kind of wireless self-networking |
| 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 |
| CN106060888B (en) * | 2016-05-26 | 2019-04-16 | 南京理工大学 | One kind being based on the central VANET cluster routing method of complex network |
| US10524101B2 (en) * | 2016-05-26 | 2019-12-31 | Theo Kanter | Distributed context-sharing networks |
| CN106211197A (en) * | 2016-06-23 | 2016-12-07 | 石家庄铁道大学 | A kind of construction method of air-sea orientation self-organizing network space division multiplexing time division multiple acess access model |
| CN106131161B (en) * | 2016-06-28 | 2019-09-20 | 中山大学 | The vehicle-mounted road based on stability sub-clustering is by protocol method under a kind of urban environment |
| CN106254146B (en) * | 2016-09-07 | 2019-09-10 | 上海市信息网络有限公司 | A kind of massive wireless sensor topology discovery method and system |
| CN108024305A (en) * | 2016-09-26 | 2018-05-11 | 北京信威通信技术股份有限公司 | A kind of system of selection of centralized control node for self-organizing network |
| CN106413014B (en) * | 2016-10-21 | 2019-07-26 | 国网黑龙江省电力有限公司信息通信公司 | Electric car remote communication method under heterogeneous network |
| CN107274713B (en) * | 2017-07-11 | 2020-06-30 | 东华大学 | Cluster-based parking guidance method |
| CN107426683B (en) * | 2017-09-13 | 2020-01-24 | 云南浩辰环保科技有限公司 | Intelligent sewage monitoring system |
| 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 |
| CN109041127B (en) * | 2018-09-26 | 2021-11-23 | 北航（四川）西部国际创新港科技有限公司 | Self-adaptive stable clustering method and system suitable for load balancing of high-dynamic wireless network |
| CN110602167B (en) * | 2019-08-09 | 2021-11-05 | 南京泛函智能技术研究院有限公司 | Distributed data storage system under wireless ad hoc network environment |
| CN110662182B (en) * | 2019-09-25 | 2020-10-13 | 北京航空航天大学 | Clustering method, device and equipment suitable for high-dynamic large-scale Internet of vehicles |
| CN110602257A (en) * | 2019-10-09 | 2019-12-20 | 中铁第四勘察设计院集团有限公司 | Emergency communication system and method based on air-to-air vehicle-ground communication network |
| CN110650458B (en) * | 2019-11-04 | 2021-05-28 | 中山大学 | Stable clustering method applied to vehicle-mounted self-organizing network route establishment |
| CN110995333B (en) * | 2019-11-29 | 2020-12-01 | 北京航空航天大学 | Cluster QoS route design method |
| CN112423362B (en) * | 2020-10-10 | 2023-03-24 | 锐捷网络股份有限公司 | Method and device for establishing neighbor relation in ad hoc network |
-
2007
- 2007-12-14 CN CN200710179578A patent/CN100576826C/en not_active Expired - Fee Related
Non-Patent Citations (2)
| Title |
|---|
| 无线传感器网络的路由算法研究. 周贤伟，刘宾，覃伯平.传感技术学报，第19卷第2期. 2006 |
| 无线传感器网络的路由算法研究. 周贤伟，刘宾，覃伯平.传感技术学报，第19卷第2期. 2006 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101207572A (en) | 2008-06-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100576826C (en) | A kind of vehicle-mounted Ad hoc network cluster dividing method based on the signal bonding strength | |
| Dror et al. | Fast randomized algorithm for hierarchical clustering in vehicular ad-hoc networks | |
| CN102291448B (en) | Automatic IP (Internet protocol) address allocation method based on geographical position in mobile ad hoc network | |
| EP2869629B1 (en) | Method and device for coordinating access points for backhaul aggregation in a telecommunications network | |
| CN101197748A (en) | Multi-jump wireless self-organizing network construction method based on partition tree | |
| CN101573994A (en) | A roadside network unit using local peer groups as network groups | |
| Dror et al. | Fast randomized algorithm for 2-hops clustering in vehicular ad-hoc networks | |
| CN101558676A (en) | Method and communication device for routing unicast and multicast messages in an ad-hoc wireless network | |
| CN107071843A (en) | Mobile self-organizing network cluster dividing method | |
| Tsao et al. | Design and evaluation of a two-tier peer-to-peer traffic information system | |
| CN104580407A (en) | VANET (vehicular ad hoc network) time slot reservation method based on game theory | |
| KR102168576B1 (en) | Edge-assisted Cluster-based Media Access Control Protocol for Safe Driving in Highway | |
| Satyajeet et al. | Heterogeneous approaches for cluster based routing protocol in vehicular ad hoc network (vanet) | |
| Turcanu et al. | An integrated vanet-based data dissemination and collection protocol for complex urban scenarios | |
| CN105682175A (en) | Cluster routing method based on AdHoc Network | |
| Ram et al. | Density-connected cluster-based routing protocol in vehicular ad hoc networks | |
| CN103369620A (en) | WSN (wireless sensor network)-oriented minimum transmission multicast routing method | |
| Fan et al. | Theoretical analysis of a directional stability-based clustering algorithm for VANETs | |
| Bali et al. | An intelligent clustering algorithm for VANETs | |
| Syfullah et al. | Mobility-based clustering algorithm for multimedia broadcasting over IEEE 802.11 p-LTE-enabled VANET | |
| Abuashour | An efficient Clustered IoT (CIoT) routing protocol and control overhead minimization in IoT network | |
| CN101854641A (en) | Method for perceiving Mesh network route | |
| Huang et al. | A new distributed mobility-based multi-hop clustering algorithm for vehicular ad hoc networks in highway scenarios | |
| Mansoor et al. | CoAd: A cluster based adhoc cognitive radio networks architecture with broadcasting protocol | |
| Huang et al. | The k-hop V2V data offloading using the predicted utility-centric path switching (PUPS) method based on the SDN-controller inside the multi-access edge computing (MEC) architecture |
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 | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20091230 Termination date: 20121214 |