CN108834229B - Fuzzy clustering algorithm of vehicle-mounted self-organizing network - Google Patents

Fuzzy clustering algorithm of vehicle-mounted self-organizing network Download PDF

Info

Publication number
CN108834229B
CN108834229B CN201810706880.2A CN201810706880A CN108834229B CN 108834229 B CN108834229 B CN 108834229B CN 201810706880 A CN201810706880 A CN 201810706880A CN 108834229 B CN108834229 B CN 108834229B
Authority
CN
China
Prior art keywords
vehicle
cluster head
energy consumption
head vehicle
networking
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
Application number
CN201810706880.2A
Other languages
Chinese (zh)
Other versions
CN108834229A (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.)
Jiangxi Vocational College of Finance and Economics
Original Assignee
Jiangxi Vocational College of Finance and Economics
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 Jiangxi Vocational College of Finance and Economics filed Critical Jiangxi Vocational College of Finance and Economics
Priority to CN201810706880.2A priority Critical patent/CN108834229B/en
Publication of CN108834229A publication Critical patent/CN108834229A/en
Application granted granted Critical
Publication of CN108834229B publication Critical patent/CN108834229B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/46—Cluster building
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/02—Services making use of location information
    • H04W4/021—Services related to particular areas, e.g. point of interest [POI] services, venue services or geofences
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/06—Selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS]; Services to user groups; One-way selective calling services
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • 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
    • H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Multimedia (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention provides a fuzzy clustering algorithm of a vehicle-mounted self-organizing network, belonging to the technical field of vehicle-mounted self-organizing networks, wherein a vehicle owner sets maximum energy consumption data of the vehicle-mounted free networking of a self-vehicle and stores the maximum energy consumption data in vehicle-mounted equipment; a base station or a relay station primarily determines cluster head vehicles in a networking area range; cluster head vehicle broadcasting and node communication networking in a networking area range are realized to realize communication; according to the invention, the maximum energy consumption of the vehicle is set by the owner user, so that the networking energy consumption can be set according to the owner user, the networking is more humanized, and the phenomenon that some owners consume too high energy after the own vehicle becomes a cluster head vehicle, and the user agent is not satisfied is reduced; meanwhile, after entering the change area, the cluster head vehicle automatically searches for a cluster member node vehicle in a new cluster selection area to select the next cluster head vehicle, so that the cluster head vehicle can serve the networking for the longest time after being selected, and the whole networking network is more stable.

Description

Fuzzy clustering algorithm of vehicle-mounted self-organizing network
Technical Field
The invention relates to the technical field of vehicle-mounted self-organizing networks, in particular to a fuzzy clustering algorithm of a vehicle-mounted self-organizing network.
Background
With the rapid development of key technologies such as wireless communication technology, vehicle-mounted embedded computing, various vehicle-mounted sensors and the like, a vehicle-mounted ad hoc network (VANET) is considered to be a super-large-scale mobile ad hoc network with higher practical degree at present. The vehicle-mounted self-organizing network is an intelligent traffic system which is formed by the mutual communication of vehicles and Roadside Units (RSUs) and has a safe, quick, effective and open structure and is used for the communication between vehicles, and can realize the applications of accident warning, driving assistance and the like. For example, in the accident warning application, a driver can obtain the vehicle conditions (such as the speed, the direction, the position, the pressure of a brake plate and the like) and the real-time road condition information of other vehicles in the beyond-visual-range by means of vehicle-mounted communication, so that traffic accidents and congestion are effectively avoided, and the vehicle traffic is safer and quicker. Due to wide application prospects and huge social and economic benefits, VANET receives high attention from governments, academic circles, industrial circles and the like.
Chinese patent grant publication No.: CN101720059A, 6.2010, 2.2010, discloses a method for realizing vehicle-mounted mobile ad hoc network routing, which comprises the following steps: each intersection is provided with a node, and when a source node forwards a data packet, the source node can forward the data packet to a node which is at one end of a road section where the source node is located and is close to a destination node; when the node forwards the data packet, firstly judging whether a node closer to a target node exists in a neighbor table, if so, directly forwarding the data packet to the corresponding node; otherwise, selecting the adjacent road section which is not the road section which just receives the data packet according to the road section selection algorithm, wherein the road section direction is close to the road section of the target node, and then, designating the node at the other end of the selected road section as a road section receiving end node; when the routing node receives the same data packet sent by the same source node from different road sections, the routing node selects an optimal path with higher success rate of receiving the data packet and shorter delay time, and forbids the non-optimal receiving paths. Because the vehicles are all private properties, the authorization of the vehicle owners is required to be passed many times during networking, particularly when the vehicles are used as cluster head vehicles, the cluster head vehicles generally need to consume more energy, the information needing to be transmitted is larger, and the like, so that the energy consumption is very large, and the like. Meanwhile, the existing vehicle-mounted self-organizing network has high vehicle speed, so that the networking is very unstable. Therefore, it is necessary to design a more humanized ad hoc network method, and at the same time, the networking is very stable.
Disclosure of Invention
The invention provides a fuzzy clustering algorithm of a vehicle-mounted self-organizing network, which solves the technical problems that the conventional vehicle-mounted networking is unstable, the networking energy consumption cannot be determined according to a vehicle owner and the like.
The invention solves the problems through the following technical scheme:
a fuzzy clustering algorithm of a vehicle-mounted self-organizing network comprises the following steps:
step 1: the method comprises the following steps that a vehicle owner sets maximum energy consumption data of a vehicle-mounted free networking of the vehicle and stores the maximum energy consumption data in vehicle-mounted equipment;
step 2: a base station or a relay station primarily determines cluster head vehicles in a networking area range;
and step 3: cluster head vehicle broadcasting and node communication networking in a networking area range are realized to realize communication;
and 4, step 4: counting the number of nodes by the cluster head vehicle, budgeting energy consumption of cluster head vehicle communication, carrying out networking communication, judging whether the cluster head vehicle enters a change area, if so, entering the next step, and if not, returning to the step 4;
and 5: searching a next cluster head after the cluster head vehicle enters a change area, and selecting the next cluster head vehicle according to the area distance and the energy consumption;
step 6: the cluster head vehicle transmits the area node networking information and the contact information with the base station or the relay station to the next cluster head vehicle which is selected;
and 7: establishing connection between the selected next cluster head vehicle broadcast and each node and a base station or a relay station, and transmitting the established connection structure to the cluster head vehicle;
and 8: and (4) disconnecting the original cluster head vehicle from each node and the base station or the relay station, selecting the next cluster head vehicle to become the cluster head vehicle, enabling the original cluster head vehicle to become the node, and returning to the step 4.
The maximum energy consumption data in the step 1 is the sum of energy consumption of the cluster head vehicle for broadcasting to each node once, energy consumption for receiving the information fed back by each node once and energy consumption for transmitting the information fed back by each node to the base station or the relay station.
The specific process of primarily determining the cluster head vehicle in the step 2 is as follows: the base station or the relay station broadcasts to vehicles in a networking area range, the vehicles return response information after receiving the broadcast, the base station or the relay station receives the response information of the vehicles, and the vehicles in the first cluster head are selected according to the signal intensity of the response information; the central point in the networking area range is communicated with the base station or the relay station by using the test vehicle in advance, the test communication signal strength of the central point vehicle and the base station or the relay station in the networking area range is measured, and then the vehicle with the response information signal strength closest to the test communication signal strength is selected as a primary cluster head vehicle during broadcasting.
The specific process of estimating the energy consumption of the cluster head vehicle communication in the step 4 is as follows:
firstly, calculating the energy E required by the cluster head vehicle to receive the l bits of data returned by each nodeTx，
ETx(l,d)＝l*(Eele+f*d2)
Wherein E iseleThe power consumption for receiving each bit of data,fthe energy consumption coefficient required for power amplification under the free space model is a known quantity, and d is the distance between the cluster head vehicle and the node vehicle and is a known quantity; the cluster head vehicle receives data sent by the n cluster member nodes, and sends the data to the distance d after fusiontoBSThe calculation formula of the number of data frames sent by the cluster head vehicle to the base station is as follows:
Figure GDA0002619710140000031
wherein T represents the total time of transmitting data in each cluster in the stable data transmission stage, and T tableThe time spent for each cluster member to send data to the cluster head is shown, and T' shows the time spent for the cluster head vehicle fused data to be sent to the base station; thereby obtaining the predicted energy consumption E of the cluster head vehicle in the data transmission stageCHCan be expressed as:
ECH＝N*(ETx(l,d'))
wherein d' is the distance between the cluster head vehicle and the base station or the relay station;
wherein, the energy consumption of the cluster head vehicle broadcasting once can be directly counted as E in the cluster head vehicleaThus, the total energy consumption can be budgeted as:
Egeneral assembly＝ECH+Ea+ETx(l,d1)+ETx(l,d2)+...+ETx(l,dn)
Wherein d isnThe distance between the nth cluster member node and the cluster head vehicle.
And (5) after the cluster head vehicle enters the change area in the step (5), sending a change request to the cluster member node vehicles in the new cluster selection area, returning the maximum energy consumption data in the step (1) after the nodes in the selection area receive the request, screening out the cluster head vehicle when the maximum energy consumption data is larger than the budget total energy consumption, and then selecting the cluster member node vehicle which is farthest away from the cluster head vehicle as the next cluster head vehicle.
The invention has the advantages and effects that:
according to the invention, the maximum energy consumption of the vehicle is set by the vehicle owner user, so that networking energy consumption can be performed according to the setting of the vehicle owner, more humanization is realized, and the phenomenon that some vehicle owners consume too high energy after the vehicle owners become cluster-head vehicles, and the user agent is not satisfied is reduced; meanwhile, after entering the change area, the cluster head vehicle automatically searches for a cluster member node vehicle in a new cluster selection area to select the next cluster head vehicle, so that the cluster head vehicle can serve the networking for the longest time after being selected, and the whole networking network is more stable.
Drawings
FIG. 1 is a flow chart of the method of the present invention.
FIG. 2 is a diagram illustrating a networking firmware architecture according to the present invention.
Reference numbers in the figures: 1 networking area range, 2 new cluster selection area, 3 change area and 4 roads.
Detailed Description
The present invention is further illustrated by the following examples.
A fuzzy clustering algorithm for a vehicle-mounted ad hoc network, as shown in fig. 1, includes the following steps:
step 1: the vehicle owner sets the maximum energy consumption data of the vehicle-mounted free networking of the vehicle and stores the data in the vehicle-mounted equipment. The maximum energy consumption data is the sum of energy consumption of the cluster head vehicle for broadcasting once to each node, energy consumption for receiving the information fed back once by each node and energy consumption for transmitting the information fed back by each node to the base station or the relay station. That is, the owner sets the energy consumption according to the own needs, and the set value can not be lower than the energy consumption required by the communication of the node.
Step 2: the base station or the relay station primarily determines cluster head vehicles within the networking area. The specific process of primarily determining the cluster head vehicle comprises the following steps: the base station or the relay station broadcasts to vehicles in a networking area range, the vehicles return response information after receiving the broadcast, the base station or the relay station receives the response information of the vehicles, and the vehicles in the first cluster head are selected according to the signal intensity of the response information; the central point in the networking area range is communicated with the base station or the relay station by using the test vehicle in advance, the test communication signal strength of the central point vehicle and the base station or the relay station in the networking area range is measured, and then the vehicle with the response information signal strength closest to the test communication signal strength is selected as a primary cluster head vehicle during broadcasting. And primarily determining cluster head vehicles, namely selecting vehicles at the central point in the networking area range as the cluster head vehicles.
And step 3: and the cluster head vehicle broadcast is communicated and networked with the nodes in the networking area range, so that communication is realized. And after the cluster head vehicle broadcasts, feedback information of each node is received, and the organization network is completed. And communication is realized with each other.
And 4, step 4: and (4) counting the number of nodes by the cluster head vehicle, budgeting the energy consumption of the cluster head vehicle communication, carrying out networking communication, judging whether the cluster head vehicle enters a change area, if so, entering the next step, and if not, returning to the step 4. The specific process for estimating the energy consumption of cluster head vehicle communication is as follows:
firstly, calculating the energy E required by the cluster head vehicle to receive the l bits of data returned by each nodeTx，
ETx(l,d)＝l*(Eele+f*d2)
Wherein E iseleThe power consumption for receiving each bit of data,fthe energy consumption coefficient required for power amplification under the free space model is a known quantity, and d is the distance between the cluster head vehicle and the node vehicle and is a known quantity. The cluster head vehicle receives data sent by the n cluster member nodes, and sends the data to the distance d after fusiontoBSBase station or relay station. The calculation formula of the number of data frames sent by the cluster head vehicle to the base station is as follows:
Figure GDA0002619710140000041
wherein T represents the total time of transmitting data in each cluster in the stable data transmission stage, T represents the time of transmitting data to the cluster head by each cluster member, and T' represents the time of transmitting data fused by the cluster head vehicles to the base station. Thereby obtaining the predicted energy consumption E of the cluster head vehicle in the data transmission stageCHCan be expressed as:
ECH＝N*(ETx(l,d'))
wherein d' is the distance between the cluster head vehicle and the base station or the relay station;
wherein, the energy consumption of the cluster head vehicle broadcasting once can be directly counted as E in the cluster head vehicleaThus, the total energy consumption can be budgeted as:
Egeneral assembly＝ECH+Ea+ETx(l,d1)+ETx(l,d2)+...+ETx(l,dn)
Wherein d isnThe distance between the nth cluster member node and the cluster head vehicle.
And 5: and searching the next cluster head after the cluster head vehicle enters the change area, and selecting the next cluster head vehicle according to the area distance and the energy consumption. And (3) after the cluster head vehicle enters a change area, sending a change request to the cluster member node vehicles in the new cluster selection area, returning the maximum energy consumption data in the step (1) after the nodes in the selection area receive the request, screening out that the maximum energy consumption data is larger than the budget total energy consumption by the cluster head vehicle, and then selecting the cluster member node vehicle which is farthest away from the cluster head vehicle as the next cluster head vehicle.
Step 6: and the cluster head vehicle transmits the area node networking information and the contact information with the base station or the relay station to the selected next cluster head vehicle. The area node networking information is mainly information head information for establishing a connection relation between a cluster head vehicle and each node in communication. Other vehicles can use the information to broadcast and then can communicate with each node. The same principle as the base station or relay station contact information.
And 7: and the selected next cluster head vehicle broadcasts to establish connection with each node and the base station or the relay station, and transmits the established connection structure to the cluster head vehicles. After a new cluster head vehicle appears, the same function as that of the previous cluster head vehicle is realized, and the real networking service is realized.
And 8: and (4) disconnecting the original cluster head vehicle from each node and the base station or the relay station, selecting the next cluster head vehicle to become the cluster head vehicle, enabling the original cluster head vehicle to become the node, and returning to the step 4. The primary link of the original cluster head vehicle is completed, and then repeated multiple times of change are carried out, so that the stability of networking is realized at the time of change (the change refers to the change or the update of the cluster head).
As shown in FIG. 2, the networking area range 1 is approximately circular, but the road 4 is rectangular, and the networking of the invention is only performed on vehicles in the same driving direction. When the cluster head vehicle enters the change area 3, the vehicle in the new cluster selection area 2 is searched as the next new cluster head vehicle, if the vehicle in the new cluster selection area 2 is suitable, the vehicle can be selected according to the distance in the forward direction, and the vehicle with the new cluster head is selected after other conditions are met. Wherein the distance of cluster head vehicle and each node vehicle can go on or calculate out through signal strength according to beidou system.
While the preferred embodiments of the present invention have been described in detail, it is to be understood that the invention is not limited thereto, and that various equivalent modifications and substitutions may be made by those skilled in the art without departing from the spirit of the present invention and are intended to be included within the scope of the present application.

Claims (3)

1. A fuzzy clustering algorithm of a vehicle-mounted self-organizing network is characterized by comprising the following steps:
step 1: the method comprises the steps that a vehicle owner sets maximum energy consumption data of a vehicle-mounted free networking of the vehicle and stores the maximum energy consumption data in vehicle-mounted equipment, wherein the maximum energy consumption data is the sum of energy consumption of a cluster head vehicle for broadcasting once to each node, energy consumption for receiving once feedback information of each node and energy consumption for transmitting the information fed back by each node to a base station or a relay station;
step 2: a base station or a relay station primarily determines cluster head vehicles in a networking area range;
and step 3: cluster head vehicle broadcasting and node communication networking in a networking area range are realized to realize communication;
and 4, step 4: the cluster head vehicles count the number of nodes, estimate energy consumption of cluster head vehicle communication, perform networking communication, judge whether the cluster head vehicles enter a change area, if so, enter the next step, if not, return to the step 4, and the specific process of estimating the energy consumption of the cluster head vehicle communication is as follows:
firstly, calculating the energy E required by the cluster head vehicle to receive the l bits of data returned by each nodeTx，
ETx(l,d)＝l*(Eele+f*d2)
Wherein E iseleThe power consumption for receiving each bit of data,fthe energy consumption coefficient required for power amplification under the free space model is a known quantity, and d is the distance between the cluster head vehicle and the node vehicle and is a known quantity; the cluster head vehicle receives data sent by the n cluster member nodes, and sends the data to the distance d after fusiontoBSThe calculation formula of the number of data frames sent by the cluster head vehicle to the base station is as follows:
Figure FDA0002619710130000011
wherein T represents the total time of transmitting data of each cluster in the stable data transmission stage, T represents the time of transmitting data to the cluster head by each cluster member, and T' represents the time of transmitting data fused by the cluster head vehicles to the base station; thereby obtaining the predicted energy consumption E of the cluster head vehicle in the data transmission stageCHCan be expressed as:
ECH＝N*(ETx(l,d'))
wherein d' is the distance between the cluster head vehicle and the base station or the relay station;
wherein, the energy consumption of the cluster head vehicle broadcasting once can be directly counted as E in the cluster head vehicleaThus, the total energy consumption can be budgeted as:
Egeneral assembly＝ECH+Ea+ETx(l,d1)+ETx(l,d2)+...+ETx(l,dn)
Wherein d isnThe distance between the nth cluster member node and the cluster head vehicle is obtained;
and 5: searching a next cluster head after the cluster head vehicle enters a change area, and selecting the next cluster head vehicle according to the area distance and the energy consumption;
step 6: the cluster head vehicle transmits the area node networking information and the contact information with the base station or the relay station to the next cluster head vehicle which is selected;
and 7: establishing connection between the selected next cluster head vehicle broadcast and each node and a base station or a relay station, and transmitting the established connection structure to the cluster head vehicle;
and 8: and (4) disconnecting the original cluster head vehicle from each node and the base station or the relay station, selecting the next cluster head vehicle to become the cluster head vehicle, enabling the original cluster head vehicle to become the node, and returning to the step 4.
2. The fuzzy clustering algorithm of the vehicle-mounted self-organizing network according to claim 1, characterized in that: the specific process of primarily determining the cluster head vehicle in the step 2 is as follows: the base station or the relay station broadcasts to vehicles in a networking area range, the vehicles return response information after receiving the broadcast, the base station or the relay station receives the response information of the vehicles, and the vehicles in the first cluster head are selected according to the signal intensity of the response information; the central point in the networking area range is communicated with the base station or the relay station by using the test vehicle in advance, the test communication signal strength of the central point vehicle and the base station or the relay station in the networking area range is measured, and then the vehicle with the response information signal strength closest to the test communication signal strength is selected as a primary cluster head vehicle during broadcasting.
3. The fuzzy clustering algorithm of the vehicle-mounted self-organizing network according to claim 1, characterized in that: and (5) after the cluster head vehicle enters the change area in the step (5), sending a change request to the cluster member node vehicles in the new cluster selection area, returning the maximum energy consumption data in the step (1) after the nodes in the selection area receive the request, screening out the cluster head vehicle when the maximum energy consumption data is larger than the budget total energy consumption, and then selecting the cluster member node vehicle which is farthest away from the cluster head vehicle as the next cluster head vehicle.
CN201810706880.2A 2018-07-02 2018-07-02 Fuzzy clustering algorithm of vehicle-mounted self-organizing network Expired - Fee Related CN108834229B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810706880.2A CN108834229B (en) 2018-07-02 2018-07-02 Fuzzy clustering algorithm of vehicle-mounted self-organizing network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810706880.2A CN108834229B (en) 2018-07-02 2018-07-02 Fuzzy clustering algorithm of vehicle-mounted self-organizing network

Publications (2)

Publication Number Publication Date
CN108834229A CN108834229A (en) 2018-11-16
CN108834229B true CN108834229B (en) 2020-10-16

Family

ID=64133555

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810706880.2A Expired - Fee Related CN108834229B (en) 2018-07-02 2018-07-02 Fuzzy clustering algorithm of vehicle-mounted self-organizing network

Country Status (1)

Country Link
CN (1) CN108834229B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110310480B (en) * 2019-06-25 2021-12-03 电子科技大学 Real-time path planning method based on congestion control

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103024849A (en) * 2012-09-27 2013-04-03 西安电子科技大学 LEACH (Low-energy Adaptive Clustering Hierarchy)-based wireless sensor network clustering method
CN103391555A (en) * 2013-07-16 2013-11-13 任炬 Novel node distribution method for maximizing service lives of clustering wireless sensor networks
CN106488507A (en) * 2015-08-27 2017-03-08 四川师范大学 The Uneven Cluster sensor network energy cavity avoiding method of routing overhead shunting
CN107426694A (en) * 2017-06-26 2017-12-01 湖南大学 A kind of fuzzy cluster algorithm of vehicular ad hoc network

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103024849A (en) * 2012-09-27 2013-04-03 西安电子科技大学 LEACH (Low-energy Adaptive Clustering Hierarchy)-based wireless sensor network clustering method
CN103391555A (en) * 2013-07-16 2013-11-13 任炬 Novel node distribution method for maximizing service lives of clustering wireless sensor networks
CN106488507A (en) * 2015-08-27 2017-03-08 四川师范大学 The Uneven Cluster sensor network energy cavity avoiding method of routing overhead shunting
CN107426694A (en) * 2017-06-26 2017-12-01 湖南大学 A kind of fuzzy cluster algorithm of vehicular ad hoc network

Non-Patent Citations (5)

* Cited by examiner, † Cited by third party
Title
An Energy-Efficient Mobile Cluster-Based Approach for Vehicular Wireless Sensor Networks;Inwhee Joe;《INC2010：6th International Conference on Networked Computing》;20100614;全文 *
Cluster Head Selection Protocol using Fuzzy Logic for Wireless Sensor Networks;Sachin Gajjar;《International Journal of Computer Applications》;20140731;全文 *
FLECH: Fuzzy Logic Based Energy Efficient Clustering Hierarchy for Nonuniform Wireless Sensor Networks;Baranidharan Balakrishnan;《Wireless Communications and Mobile Computing》;20171231;全文 *
LEACH-MAC: a new cluster head selection algorithm for Wireless Sensor Networks;Payal Khurana Batra;《Wireless Netw》;20150426;全文 *
OPTIMIZING ENERGY CONSUMPTION IN VEHICULAR SENSOR NETWORKS BY CLUSTERING USING FUZZY C-MEANS AND FUZZY SUBTRACTIVE ALGORITHMS;Aref Ebrahimi;《The International Archives of the Photogrammetry》;20171010;全文 *

Also Published As

Publication number Publication date
CN108834229A (en) 2018-11-16

Similar Documents

Publication Publication Date Title
Gao et al. V2VR: reliable hybrid-network-oriented V2V data transmission and routing considering RSUs and connectivity probability
Al-Rabayah et al. A new scalable hybrid routing protocol for VANETs
CN102625237B (en) Method for selecting optimum relay in communication between wayside device and vehicle
CN105376152B (en) A kind of more candidate compound relay data transmission methods in In-vehicle networking
CN108650656B (en) Distributed city Internet of vehicles routing method based on intersection
CN103200526A (en) Vehicular ad hoc network routing method based on road side units (RSUs)
CN107302576A (en) Adaptive service data distribution method based on opportunistic communication under car networking environment
Jiang et al. TMC: Exploiting trajectories for multicast in sparse vehicular networks
CN102883263A (en) VANET clustering and maintenance method based on distance of adjacent vehicles
CN105101086B (en) A kind of data transfer path system of selection based on traffic density distribution
CN107105389B (en) Geographic information routing method based on road topological structure in vehicle-mounted network
CN105844370B (en) Urban road vehicle degree of communication optimization method based on particle swarm algorithm
CN109005524A (en) Based on throughput ratio compared with car networking RSU switching method
CN102883402A (en) Vehicular Ad hoc network data transmission method based on position and topological characteristic
Yadav et al. Secure and reliable routing protocols for VANETs
CN108834229B (en) Fuzzy clustering algorithm of vehicle-mounted self-organizing network
CN105448115A (en) A method for communication among passive-clustering vehicles in a high-speed traffic network
Sindhwani et al. Implementation of K-Means Algorithm and Dynamic Routing Protocol in VANET.
CN106851765A (en) A kind of method for optimizing of the transmission trunking node of In-vehicle networking emergency safety message
Rana et al. VANET: expected delay analysis for location aided routing (LAR) Protocol
CN106900026B (en) Method for selecting route backbone path based on network communication
CN107343301B (en) Efficient and reliable routing method of vehicle-mounted ad hoc network based on message aggregation
CN108769948A (en) A kind of resource allocation methods of isomery In-vehicle networking
CN106254250B (en) Car networking short-distance networking method
CN103095592B (en) The zone multicast route system of vehicle self-organizing network and method

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20201016

Termination date: 20210702