CN102307332A - VANET broadcast method based on extra degree - Google Patents

VANET broadcast method based on extra degree Download PDF

Info

Publication number
CN102307332A
CN102307332A CN201110243492A CN201110243492A CN102307332A CN 102307332 A CN102307332 A CN 102307332A CN 201110243492 A CN201110243492 A CN 201110243492A CN 201110243492 A CN201110243492 A CN 201110243492A CN 102307332 A CN102307332 A CN 102307332A
Authority
CN
China
Prior art keywords
node
extra degree
broadcast
statement
time
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.)
Pending
Application number
CN201110243492A
Other languages
Chinese (zh)
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.)
Harbin Institute of Technology
Original Assignee
Harbin Institute of Technology
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 Harbin Institute of Technology filed Critical Harbin Institute of Technology
Priority to CN201110243492A priority Critical patent/CN102307332A/en
Publication of CN102307332A publication Critical patent/CN102307332A/en
Pending legal-status Critical Current

Links

Images

Landscapes

  • Mobile Radio Communication Systems (AREA)
  • Small-Scale Networks (AREA)

Abstract

The invention relates to a VANET broadcast method based on an extra degree and to broadcast communication method of a VANET. According to the invention, a problem that a VANET broadcast communication method that is based on a fixed threshold can not meet an application demand when a density and a frequency change is solved. The method comprises the following steps that: a source node emits a broadcast message; after each vehicle node receives the broadcast message for the first time, each the vehicle node inquiries whether a neighboring node has received the broadcast message and an extra degree of the inquired node is calculated according to a response; a vehicle node whose extra degree exceeds a threshold declares an extra degree of the declaring node; a vehicle node that has received the declaration extracts the extra degree in the declaration and makes comparison between the extracted extra degree and an extra degree of itself; if the extra degree that is declared by the declaring node is large, the node that received the declaration does not participate in forwarding of the broadcast message; if not, a declaration on the compared result is emitted and the extra degree of the node that received the declaration is declared; and if the node that emits the declaration on the compared result still can not receive a declaration on an extra degree that is greater than the extra degree of the node itself, the node forwards the broadcast message.

Description

VANET broadcasting method based on extra degree
Technical field
The present invention relates to the broadcast communication method of VANET (onboard wireless MANET).
Background technology
VANET does node with the vehicle on the road, makes that the situation of performance and traffic flow of its procotol is closely bound up.In road traffic; Sometimes traffic flow demonstrates freely flows characteristic; Be that vehicle can freely go, node density is unsaturated in free traffic flow, and its density can change within the specific limits; (certainly variable density still can not cause the network disconnection, that is to say the still hypothesis of connection Network Based of research that the present invention carries out.) and this node density variation meeting exerts an influence to the Radio Broadcasting Agreements performance, some are existing can't to satisfy the broadcast communication demand under this variable density traffic based on the preset parameter broadcast strategy.
The method of employing neighbors information exchange does not receive the influence of variable density, but under unsaturated traffic environment, node motion speed is fast, therefore makes some can't effectively implement based on the agreement of regular information exchange.In this case, if information exchange is too frequent between node, the network overhead that then brings is excessive; And if the information exchange underfrequency, the information that then has is out-of-date, and nodal information upgrades the situation that does not catch up with change in topology and takes place; Information exchange this moment is untimely, will lose meaning.In the prior art based on counting, based on the geographical position and all belong to method based on the method for distance and the method transmitted based on probability based on the fixed gate limit value; Promptly compare, and determine whether transmitting with this through certain attribute and a predefined threshold value with network node.Can effectively reduce the node number of forwarding based on fixed gate limit value method; But threshold value is pre-set, and its setting is relevant with density, under the metastable scene of density, can obtain good effect; If but density frequently changes (as in traffic environment; Vehicle flowrate is big, but cause clogging not) time, just can't satisfy application demand based on the method for fixed gate limit value.And the traffic flow density that the VANET environment constantly changes down greatly reduces the practicality of these class methods.
Summary of the invention
The purpose of this invention is to provide a kind of VANET broadcasting method, to solve the problem that when density frequently changes, can't satisfy application demand based on the onboard wireless MANET broadcast communication method of fixed gate limit value based on extra degree.
The present invention includes following step:
One, sends broadcast as the vehicle node of source node; Two, whether each vehicle node can receive this broadcast by its neighbors of inquiry after receiving this broadcast for the first time, and it is T that the time of waiting for that neighbors is replied in the back is sent in inquiry 1, do not receive that the neighbors of this broadcast was considered to new overlay node, the inquiry node can calculate the extra degree of this inquiry node according to the quantity that new overlay node is replied oneself; Three, each vehicle node T that all waits for a period of time 2,, see if there is other node and have than oneself bigger extra degree, when the time T of certain vehicle node 2To and the extra degree statement of receiving all the extra degree than oneself is little, this vehicle node all can begin to transmit arbitrated procedure, states the extra degree of this node, and wait; Four, the extra degree that the vehicle node of receiving this statement is extracted in the statement compares with oneself extra degree; If the extra degree that declaration node is stated is big; Then this node does not participate in transmitting broadcast, otherwise sends the comparative result statement, states the extra degree of this node; Five, the node that has sent statement is at stand-by period T 2Interior if receive that other statement also compares, if the extra degree of oneself greatly then continues wait, otherwise abandon transmitting broadcast; Six, the node that sends the comparative result statement is at stand-by period T 3To after still can not receive than own big extra degree statement, then this node is transmitted broadcast.
The forward node that the arbitrated procedure of being done by step 3 of the present invention to step 5 is selected all has maximum extra degree, makes that each to transmit the new node that can cover maximum.The present invention passes to all nodes in the broadcast area with broadcast message as early as possible with few hop count of trying one's best, and the influence that not changed by node density.Can effectively reduce under the dense situation of node conflict and competition that broadcasting produces, and can adapt to VANET and change fast by the topological structure that traffic flow causes.Solved the problem that when density frequently changes, can't satisfy application demand based on the onboard wireless MANET broadcast communication method of fixed gate limit value.
This agreement has adopted the method based on neighbors information, selects to have the outer node of spending of maximum as forward node through each vehicle node among the VANET and the more extra degree of its neighbors.But be different from the mode of exchanging periodically nodal information that is adopted in other method based on neighbors information; The present invention has adopted as required, and the mode of communication realizes obtaining of neighbors information; Promptly obtain neighbors information when needed, guaranteed the real-time of neighbors information through the mode of inquiring, replying.Through the extra degree of statement, the mode comparison node waited for, transmit arbitration, reduced the communication overhead that is used for switching node information effectively, node not be used in local information of preserving other node simultaneously, has also reduced the storage overhead of intranodal.In order to improve the forward efficiency of agreement, reduce the redundant conflict that causes of transmitting, agreement is guaranteeing to broadcast the number of making every effort to reduce forward node under the prerequisite of coverage rate.Select to have the outer node of spending of maximum as forward node through the process of above-mentioned acquisition of information, relatively arbitration, can both make the new node number of each forwarding covering maximum under the various density conditions, thereby reduce the purpose of hop count to reach.
Description of drawings
Fig. 1 is a vehicle node exemplary scene sketch map in the onboard wireless MANET, and wherein Reference numeral is that s, a and b are respectively vehicle node, and h is the scope that vehicle node s signal covers.Fig. 2 is the sequential chart of arbitrated procedure in the execution mode one, at t 0Time point a sends out QP to neighbours after receiving a DP, waits for T A1Time; At t 1Time point b sends out QP to neighbours after receiving a DP, waits for T B1Time; At t 2Time point a calculates extra degree and waits for T A2=2T MaxTime; At t 3Time point b calculates extra degree and waits for T B2=0, so b sends out AP; At t 4Time point a receives the AP of b, or a sends out the AP that AP listens to b afterwards; At t 5The time point b statement back stand-by period arrives, and has no objection, and b transmits.
Embodiment
Embodiment one: this execution mode comprises the steps:
VANET broadcasting when application protocol has the broadcasting demand at the middle and upper levels, is initiated broadcast communication by the vehicle of carrying out this application as source node at network.One, sends broadcast as the vehicle node of source node; Two, whether each vehicle node can receive this broadcast by its neighbors of inquiry after receiving this broadcast for the first time, and it is T that the time of waiting for that neighbors is replied in the back is sent in inquiry 1,The neighbors of not receiving this broadcast is considered to new overlay node, and the inquiry node can calculate the extra degree of this inquiry node according to the quantity that new overlay node is replied oneself, as the foundation of transmitting arbitration; Three, each vehicle node T that all waits for a period of time 2,, see if there is other node and have than oneself bigger extra degree, when the time T of certain vehicle node 2To and the extra degree statement of receiving all the extra degree than oneself is little, this vehicle node all can begin to transmit arbitrated procedure, states the extra degree of this node, and wait; Four, receive that the extra degree that the vehicle node of this statement is extracted in the statement compares with own extra degree, the extra degree of stating as if declaration node is big, and then this node does not participate in transmitting broadcast, otherwise states the extra degree of this node; Five, the node that has sent statement is at stand-by period T 2Interior if receive that other statement also compares, if the extra degree of oneself greatly then continues wait, otherwise abandon transmitting broadcast; Six, the node of statement is at stand-by period T 3To after still can not receive than own big extra degree statement, then this node is transmitted broadcast.
Communication protocol principle of the present invention is following:
(1) related definition and assumed condition
Definition 1: one of i node jumped (promptly sending or transmit broadcast one time) number of neighbors be called the node degree of i node, note is made d i
Definition 2: if node i and j neighbors each other, there is common overlay area in the two, and has common neighbours.If the broadcast data packet of node i forward node j, neighbours' number of the node i of then claiming not to be covered by node j is the extra degree of node i to node j, and note is made Δ d IjExtra degree can embody the new coverage of node when broadcasting.
The assumed condition of the inventive method is:
(1) all vehicle node all distribute (promptly only consider to go on road node) along road among the VANET, and only consider the broadcast message transmitted along road direction.
(2) node density changes, but network is communicated with all the time, does not promptly have isolated node and not segmentation in the network.
(2) classification of packet in the agreement
In agreement of the present invention, for processes such as the inquiry in the completion on-demand broadcasting, statements, designed four kinds of packets, specific as follows:
(1) broadcast data packet (Broadcast Data Packet, DP)
Refer to carrying the packet of actual broadcast content, form, information such as definition bag ID, initiation node ID and bag rise time in packet header by packet header and data field.
(2) inquiry bag (Inquiring Packet, QP)
Whether node received this DP bag in order to inquire to its neighbours after receiving broadcast data packet, thereby obtained the extra degree of this node.Its content comprises the ID of broadcast data packet and the ID of inquiry node.
(3) response packet (Responding Packet, RP)
Receive the node of QP if do not receive the broadcast packet of being inquired, then send out this bag and reply that the inquiry node can be according to receiving that the quantity of response packet calculates extra degree to the inquiry node.
(4) statement bag (Announcing Packet, AP)
Node is sent out the extra degree of this bag to its neighbor statement oneself when oneself having big extra spending thinking.Simultaneously, when receiving other node AP,, also send out this bag and demur if oneself have bigger extra degree.Its content comprises this node ID and the extra degree of this node.
Source node is initiated broadcasting based on application need, and each node is carried out following process after receiving broadcast packet,
S 1: node is received after the information that other vehicle sends at first identification bag type, sees DP or QP, if receive that QP then carries out S 2If DP then carries out S 3
S 2: extract the broadcast packet ID among the QP, inquire about oneself and whether received this DP,, then send out RP and reply, otherwise do not do operation, hang up the new information of waiting for afterwards to the inquiry node if do not receive;
S 3: the packet ID that receives is write its neighbours' broadcasting of inquiry Bao Bingxiang, inquire that whether its neighbours received this DP, carried out S then 4
S 4: wait for T 1Time is collected the RP that neighbors is replied, and the time promptly obtains the extra degree Δ d of this node i to a last node j to calculating the quantity of receiving RP Ij, then carry out S 5
S 5: stand-by period T 2,, carry out S if receive AP in order to monitor the statement bag of other node 6, the time is to carrying out S 7This time T 2In order to reduce the design of statement number of times, its length is related to algorithm efficiency, specifically is set in the back literary composition and details;
S 6: extract the extra degree among the AP, compare,, then carry out S if the extra degree of this node is big with the extra degree of this node 7, otherwise carry out S 10
S 7: stated as if this node, then carried out S 8Continue to monitor the objection statement up to T 3Time arrives, if without proper notice is then sent out AP and stated the extra degree of oneself, carries out S then 8
S 8: monitor channel T 3Time (T 3For waiting for that other node sends the statement time of objection,, then continue timing, up to T if this node had got into this wait stage 3Time arrives), if listen to other statement, then carry out S 6, if T 3Time arrives, and then carries out S 9
S 9: this node is a forward node, transmits this DP;
S 10: this node is not done forwarding, withdraws from after preserving this DP.
(3) analysis of several material times and definite in the agreement
In the agreement implementation process of the present invention, there are three stand-by period T 1, T 2And T 3, T wherein 1For node sends the time that extra degree is collected in wait acknowledge behind the QP, T 2Be be to reduce the objection statement, the time that node with different extra degree is waited for before sending out AP, T 3Wait for the time that objection is stated for node statement back, the length of these three times directly influences the performance of agreement.
At first establish T MaxFor data packet transmission arrives the time delay of neighbors farthest, promptly be transferred to the propagation delay time that signal covers the edge, T from sending node Max=R t/ V t, R wherein tBe signal transmission radius, V tBe signal velocity.T 1Time is node is collected RP after inquiry time, and its duration should be able to guarantee to inquire that QP that node is sent out can pass to its all neighbours, and all are replied RP that node sends and can both pass the inquiry node back and collected by it.So, make T 1=2T MaxT 3Set and T 1In like manner, need to guarantee node after statement, its AP can pass to neighbours farthest, and when if neighbours farthest have bigger extra spending, its objection AP can pass this node back, so also make T 3=2T MaxThe arbitration mechanism that adopts in this agreement requires to have the node of the outer degree of great number after receiving than the little AP of own extra degree, to inform that through new statement previous declaration node oneself has bigger extra degree, is more suitable for as forward node, is referred to as the objection statement at this.At this moment,, many objection AP then can occur, increase network overhead if possibly have the node statement earlier of less extra degree.Worst condition is the statement earlier of the minimum node of extra degree; The statement of raising an objection of inferior little node; The statement that continues to raise an objection of then big slightly again node, the rest may be inferred, outside having maximum, spend the node statement after statement without demur more just transmit; Cause the chain reaction of continuous statement like this, greatly reduce efficiency of transmission.Has the possible node statement earlier of the outer degree of maximum so should make every effort to let, to reduce the number of times of objection statement.Because node prolongs road and is zonal distribution among the VANET, often receive more earlier that in actual broadcast the extra degree that the node of broadcast data packet possibly have is more little, and the node far away apart from sending node more possibly cover more new node.Therefore, design stand-by period T 2Make and have the statement earlier of the possible node of big extra degree.Simultaneously, T 2The setting of stand-by period also should guarantee to have the possible node of less extra degree should be able to receive bigger extra degree statement earlier in statement, so order
T 2=2(T max-T l) (3-1)
T in the formula l---the end-to-end time delay of a node and a last forward node, promptly send DP from a last forward node and receive the time that this DP is used to node.
Fig. 1 is described to be a limiting condition, and wherein vehicle s is a source node or a last forward node, and vehicle a is the nearest neighbours of vehicle s, and vehicle b then is vehicle s neighbours farthest, and can be similar to this moment thinks T As=0 and T Bs=T Max, vehicle a and b carry on an agreement respectively, and arbitrated procedure is illustrated in fig. 2 shown below:
t 0Constantly: after node a receives the DP of node s broadcasting, send its neighbours of QP inquiry to its neighbours and whether receive this DP, wait for T then A1Time is collected RP, to calculate extra degree, wherein T A1=2T Max
t 1Constantly: node b receives DP, sends out to its neighbours whether the QP inquiry is new overlay node, then stand-by period T B1, T B1=2T Max
t 2Constantly: node a waits for T A1Time arrives, and through the RP quantity that calculating is collected, node a obtains own extra degree Δ d to node s As, begin to wait for T then A2Time;
t 3Constantly: node b waits for T B1Time arrives, and obtains own extra degree Δ d to node s Bs, node b begins to wait for T then B2Time, (3-1) can calculate T according to formula A2=2T Max, and T Bs=0, so node b sends out the extra degree Δ d of AP statement oneself Bs, and begin to wait for T B3Time;
t 4Constantly: T A2Time arrives, and node a sends out the extra degree of AP statement oneself, receives the AP of node b simultaneously, through relatively finding Δ d Bs>Δ d AsSo node a abandons transmitting, if receiving the AP of b earlier before statement, then do not state node a this moment, directly abandon transmitting;
t 5Constantly: T B3Time arrives, and node b does not receive than Δ d BsBig extra degree, the DP of node b forward node s broadcasting.
Embodiment two: cause node to communicate by letter because of the reason of vehicle itself sometimes at the VANET network, or because building blocks internodal communication link was lost efficacy temporarily.In order to reduce the influence of node and link failure to the protocol broadcast effect, the present invention has been carried out strengthening the expansion design of reliability, through select redundant forward node tolerate that key node lost efficacy and crucial link failure to the influence of message transmission,
Dependability parameter: with the parameter that decides each participation forward node number.This parameter is set based on the significance level of transmission information by source node, and transmits with broadcast packet.Note is made RL.
Jump the RL that sets according to source node at each and select redundant forward node, so that when the forward node that elects or its link lose efficacy, still had backup node to transmit temporarily.Yet; In broadcast communication; Every many forward node all can bring a large amount of additional communication expenses, and in order to obtain the enhancing of reliability with few overhead of trying one's best, the dependability parameter in this execution mode is designed to adjustable; Promptly suitably being provided with according to the concrete significance level of using transmitted information by source node, is that redundancy communication is paid suitable overhead with the method.
Implementation
Data broadcasting is initiated by source node, and source node is set dependability parameter RL according to the significance level of transmission information and it is encapsulated in the packet header of DP.Therefore, each jumping will have the individual node of RL (3 to 5) to participate in transmitting to guarantee to transmit the influence that does not receive node failure, and important information can be by broadcasting more reliably.Counter NR of each node maintenance calculates the neighbours' number with AD bigger than this node, will safeguard also that simultaneously a tabulation that has received DP preserves the ID that receives DP.Each node is wanted its NR=0 of initialization when receiving a DP for the first time.To each node i, after receiving broadcast packet, carry out following process, flow process is shown in Fig. 3-4:
S 1: node receives that at first discerning it after the information that other vehicle sends is DP or QP, if receive that QP then carries out S 2If DP then carries out S 3
S 2: extract the broadcast packet ID that is inquired among the QP, inquire about oneself and whether received this DP,, then send out AP and reply, otherwise do not do operation, hang up the new information of waiting for afterwards to the inquiry node if do not receive;
S 3: the packet ID that receives is write inquiry Bao Bingxiang its neighbours broadcast its neighbours of this QP inquiry and whether received this DP, carry out S then 4
S 4: wait for T 1Time is collected the AP that neighbors is replied, and the time promptly obtains the extra degree Δ d of this node i to a last node j to calculating the quantity of receiving AP Ij, then carry out S 5
S 5: stand-by period T 2,, carry out S if receive statement in order to monitor the statement of other node 6, the time is to carrying out S 8, (time T 2The back literary composition of specifically being set in detail);
S 6: extract the extra degree among the AP, compare,, then carry out S if the extra degree of this node is big with the extra degree of this node 5, otherwise carry out S 7
S 7: counter NR adds 1, carries out S then 5Continue to wait for;
If this node was stated, then carry out S 8Continue to monitor the objection statement up to T 3Time arrives, if without proper notice is then sent out AP and stated the extra degree of oneself, carries out S8 then;
S 8: compare the NR and the RL of this node,, carry out S then if NR<RL then sends out the AD that AP states this node 9, otherwise, carry out S 14
S 9: monitor channel T 3Time,, then carry out S if listen to other statement 10, if T 3Time arrives, and then carries out S 12
S 10: with S 6Identical, relatively receive AD and the AD of oneself, if this node AD is big, carry out S 9, otherwise carry out S 11
S 11: NR adds 1, carries out S then 9
S 12: compare the NR and the RL of this node, if NR>RL carries out S 13, otherwise, carry out S 14
S 13: store broadcast information is also transmitted this DP;
S 14: this node is not done forwarding, withdraws from after preserving this DP.

Claims (4)

1. based on the VANET broadcasting method of extra degree, it is characterized in that it comprises the steps: one, sends broadcast as the vehicle node of source node; Two, whether each vehicle node can receive this broadcast by its neighbors of inquiry after receiving this broadcast for the first time, and it is T that the time of waiting for that neighbors is replied in the back is sent in inquiry 1, do not receive that the neighbors of this broadcast was considered to new overlay node, the inquiry node can calculate the extra degree of this inquiry node according to the quantity that new overlay node is replied oneself; Three, each vehicle node T that all waits for a period of time 2,, see if there is other node and have than oneself bigger extra degree, when the time T of certain vehicle node 2To and the extra degree statement of receiving all the extra degree than oneself is little, this vehicle node all can begin to transmit arbitrated procedure, states the extra degree of this node, and wait; Four, the extra degree that the vehicle node of receiving this statement is extracted in the statement compares with oneself extra degree; If the extra degree that declaration node is stated is big; Then this node does not participate in transmitting broadcast, otherwise sends the comparative result statement, states the extra degree of this node; Five, the node that has sent statement is at stand-by period T 2Interior if receive that other statement also compares, if the extra degree of oneself greatly then continues wait, otherwise abandon transmitting broadcast; Six, the node that sends the comparative result statement is at stand-by period T 3To after still can not receive than own big extra degree statement, then this node is transmitted broadcast.
2. the VANET broadcasting method based on extra degree according to claim 1 is characterized in that T 1=2T Max, T 3=2T Max, T MaxFor packet is transferred to the propagation delay time that signal covers the edge, T from sending node Max=R t/ V t, wherein Rt is a signal transmission radius, Vt is a signal velocity,
T 2=2(T max-T l) (3-1)
T in the formula l---send broadcast data packet from a last forward node and receive the time that this broadcast data packet is used to node.
3. the VANET broadcasting method based on extra degree according to claim 1; It is characterized in that source node is encapsulated in the packet header of broadcast data packet according to the significance level setting dependability parameter RL of transmission information and with it, each jumping will have RL node to participate in transmitting broadcast.
4. the VANET broadcasting method based on extra degree according to claim 1, the number that it is characterized in that RL are 3 to 5.
CN201110243492A 2011-08-23 2011-08-23 VANET broadcast method based on extra degree Pending CN102307332A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201110243492A CN102307332A (en) 2011-08-23 2011-08-23 VANET broadcast method based on extra degree

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201110243492A CN102307332A (en) 2011-08-23 2011-08-23 VANET broadcast method based on extra degree

Publications (1)

Publication Number Publication Date
CN102307332A true CN102307332A (en) 2012-01-04

Family

ID=45381127

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201110243492A Pending CN102307332A (en) 2011-08-23 2011-08-23 VANET broadcast method based on extra degree

Country Status (1)

Country Link
CN (1) CN102307332A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104394007A (en) * 2014-12-19 2015-03-04 哈尔滨工业大学 Multi-hop warn broadcasting method for urban VANETs
US9940142B2 (en) 2016-05-20 2018-04-10 At&T Mobility Ii Llc Connected car resource manager with associated applications control

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
LIANKE ZHOU等: "A Delay Tolerant Broadcast Protocol for VANETs", 《2010 INTERNATIONAL CONFERENCE ON BROADCAST TECHNOLOGY AND MULTIMEDIA COMMUNICATION》 *
ZHOU LIANKE等: "A RELIABLILITY ENHANCED DENSITY ADAPTIVE DATA DISSEMINATION SCHEME FOR VANETS", 《JOURNAL OF ELECTRONICS(CHINA)》 *

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104394007A (en) * 2014-12-19 2015-03-04 哈尔滨工业大学 Multi-hop warn broadcasting method for urban VANETs
CN104394007B (en) * 2014-12-19 2018-10-09 哈尔滨工业大学 A kind of multi-hop warning broadcasting method of city VANETs
US9940142B2 (en) 2016-05-20 2018-04-10 At&T Mobility Ii Llc Connected car resource manager with associated applications control
US10679435B2 (en) 2016-05-20 2020-06-09 At&T Mobility Ii Llc Connected car resource manager with associated applications control
US11348383B2 (en) 2016-05-20 2022-05-31 At&T Mobility Ii Llc Connected car resource manager with associated applications control

Similar Documents

Publication Publication Date Title
CN102291448B (en) Automatic IP (Internet protocol) address allocation method based on geographical position in mobile ad hoc network
US7969914B1 (en) Method for establishing and operating a mobile Ad-Hoc network
CN101355496A (en) Multi-hop clustering route protocol initiated by base station
WO2009064740A1 (en) Method of broadcasting packets in ad-hoc network
Fan Improving broadcasting performance by clustering with stability for inter-vehicle communication
Faheem et al. Dynamic sink location update scope control mechanism for mobile sink wireless sensor networks
EP3334214A1 (en) Method, apparatus and computer program for routing a data packet
Turcanu et al. An integrated vanet-based data dissemination and collection protocol for complex urban scenarios
KR101560523B1 (en) Operating method of wireless sensor networks considering energy efficiency
CN101179501A (en) Local routing discovering method for on-demand routing of mobile ad hoc network
CN101977414A (en) Simultaneous transmission slot time distribution method of wireless sensor network
CN101262449B (en) A new wireless self-networking dual-frequency hierarchical routing method
CN103974365A (en) Ad Hoc mobile network route restoring method
CN106686680B (en) A kind of route optimization system and method for car networking
CN105072586B (en) To the management method of the forwarding of broadcast message in embedded radio self-organizing network
CN102307332A (en) VANET broadcast method based on extra degree
CN106102123B (en) A kind of network-building method based on 433MHZRF network
Aquino-Santos et al. Performance analysis of routing strategies for wireless sensor networks
Anandakumar et al. Enhanced multicast cluster-based routing protocol for delay tolerant mobile networks
CN101471864A (en) Data forwarding method based on receiver route in wireless self-organizing network
Al Sawafi et al. Toward hybrid RPL based IoT sensing for smart city
CN110167095A (en) A kind of mobile Ad-Hoc algorithm network routing based on Fermat point
Pan An improved the DSR routing protocol in mobile ad hoc networks
CN103747497A (en) Method of data download in wireless sensor network
CN104618981A (en) Position and direction based priority routing method in delay tolerant network (DTN) environment

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C02 Deemed withdrawal of patent application after publication (patent law 2001)
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20120104