CA2686711A1 - Methods for optimal multi-channel assignments in vehicular ad-hoc networks - Google Patents
Methods for optimal multi-channel assignments in vehicular ad-hoc networks Download PDFInfo
- Publication number
- CA2686711A1 CA2686711A1 CA002686711A CA2686711A CA2686711A1 CA 2686711 A1 CA2686711 A1 CA 2686711A1 CA 002686711 A CA002686711 A CA 002686711A CA 2686711 A CA2686711 A CA 2686711A CA 2686711 A1 CA2686711 A1 CA 2686711A1
- Authority
- CA
- Canada
- Prior art keywords
- nodes
- node
- ordered sequence
- channels
- sequence
- 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.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/128—Shortest path evaluation for finding disjoint paths
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W76/00—Connection management
- H04W76/10—Connection setup
-
- 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
Abstract
A communications path is established among an ordered sequence of moving nodes, representing vehicles. Available channels may differ from one node to the next node and a node cannot use the same channel for both receiving and transmitting information. Three methods are described that provide an optimal sequence of channel assignments between the nodes. A sequence of channel assignments is called optimal if it establishes a communications path from the first node in the sequence to the last node in the sequence, or, if such a path does not exist, from the first node to the farthest node possible in the sequence. The first method uses a depth-first search starting from the first node in the sequence. The second method uses a "look ahead" scheme in the depth-first search method. The third method requires only a single pass through the sequence of nodes by identifying optimal channel assignments in subsequences of nodes without a need for backtracking.
Description
METHODS FOR OPTIMAL MULTI-CHANNEL ASSIGNMENTS IN
VEHICULAR AD-HOC NETWORKS
s FIELD OF INVENTION
The present invention relates to channel assignments in mobile ad-hoc networks and more specifically, the invention concerns assignment of channels in ad-hoc vehicular ,o networks comprising an ordered sequence of moving vehicles.
BACKGROUND OF THE INVENTION
A mobile ad-hoc network (MANET) is formed by multiple moving nodes 15 equipped with wireless transceivers. The mobile nodes communicate with each other through multi-hop wireless links, wherein every node can transmit and receive information. Mobile ad-hoc networks have become increasingly important in areas where deployment of communications infrastructure is difficult. Such networks are used for communications in battle fields, natural disasters, fleets on the ocean, and so forth 20 Numerous papers have been published on this topic. For example, C. Xu, K.
Liu, Y.
Yuan, and G. Liu, "A Novel Multi-Channel Based Framework for Wireless IEEE
802.11 Ad Hoc Networks", Asian Journal of Information Technology, 5, 44-47, 2006 describe a framework for multi-channel management in such networks.
25 A vehicular ad-hoc network (VANET) refers to a mobile ad-hoc network designed to provide communications among nearby vehicles and between vehicles and nearby fixed equipment. W. Chen and S. Cai, "Ad Hoc Peer-to-Peer Network Architecture for Vehicle Safety Communications", IEEE Communications Magazine, 100-107, April 2005 present background material and a networking approach that uses 30 local peer group architecture in order to establish communications among vehicles.
The use of multiple channels allows for simultaneous communications among a network of moving nodes, representing vehicles, and increases the network throughput.
Existing channel assignment methods use distributed decisions wherein each node determines which channel to use based on local information on channel availability at neighboring nodes.
The present invention focuses on establishing a communications path among an S ordered sequence of moving nodes, representing vehicles. The ordered sequence of nodes can be viewed as a directed linear tree topology where a link interconnects a node only to its successor node in the ordered sequence. A channel is used to send information from one node to the next on a wireless link. The set of available channels may differ from one node to the next due to external interferences, other ongoing communications that involve some of these nodes, different equipment used at the nodes, and the like.
Each of the available channels at a node can be used for receiving information from its predecessor node in the sequence or for transmitting information to its successor node in the sequence. However, the same channel cannot be used at a node for both receiving information from its predecessor node and transmitting information to its successor node ,S in the ordered sequence of nodes. Note that the channel used to transmit information from some node is the channel used to receive information at its successor node in the ordered sequence of nodes. The first node in the sequence, or some nearby system, has as input the information of the set of available channels at each of the nodes in the ordered sequence. The invention provides methods that determine an optimal sequence of channels assigned to the wireless links that interconnect the ordered sequence of nodes.
A sequence of channel assignments is called optimal if it establishes a communications path from the first node in the ordered sequence of nodes to the last node in that sequence, or, if such a path does not exist, it establishes a communications path from the first node to the farthest node possible.
The invention uses global information from all nodes in the sequence to come up with a globally optimal sequence of channel assignments. Current systems use distributed methods wherein each node selects a channel for transmitting information using information from only a subset of nodes.
VEHICULAR AD-HOC NETWORKS
s FIELD OF INVENTION
The present invention relates to channel assignments in mobile ad-hoc networks and more specifically, the invention concerns assignment of channels in ad-hoc vehicular ,o networks comprising an ordered sequence of moving vehicles.
BACKGROUND OF THE INVENTION
A mobile ad-hoc network (MANET) is formed by multiple moving nodes 15 equipped with wireless transceivers. The mobile nodes communicate with each other through multi-hop wireless links, wherein every node can transmit and receive information. Mobile ad-hoc networks have become increasingly important in areas where deployment of communications infrastructure is difficult. Such networks are used for communications in battle fields, natural disasters, fleets on the ocean, and so forth 20 Numerous papers have been published on this topic. For example, C. Xu, K.
Liu, Y.
Yuan, and G. Liu, "A Novel Multi-Channel Based Framework for Wireless IEEE
802.11 Ad Hoc Networks", Asian Journal of Information Technology, 5, 44-47, 2006 describe a framework for multi-channel management in such networks.
25 A vehicular ad-hoc network (VANET) refers to a mobile ad-hoc network designed to provide communications among nearby vehicles and between vehicles and nearby fixed equipment. W. Chen and S. Cai, "Ad Hoc Peer-to-Peer Network Architecture for Vehicle Safety Communications", IEEE Communications Magazine, 100-107, April 2005 present background material and a networking approach that uses 30 local peer group architecture in order to establish communications among vehicles.
The use of multiple channels allows for simultaneous communications among a network of moving nodes, representing vehicles, and increases the network throughput.
Existing channel assignment methods use distributed decisions wherein each node determines which channel to use based on local information on channel availability at neighboring nodes.
The present invention focuses on establishing a communications path among an S ordered sequence of moving nodes, representing vehicles. The ordered sequence of nodes can be viewed as a directed linear tree topology where a link interconnects a node only to its successor node in the ordered sequence. A channel is used to send information from one node to the next on a wireless link. The set of available channels may differ from one node to the next due to external interferences, other ongoing communications that involve some of these nodes, different equipment used at the nodes, and the like.
Each of the available channels at a node can be used for receiving information from its predecessor node in the sequence or for transmitting information to its successor node in the sequence. However, the same channel cannot be used at a node for both receiving information from its predecessor node and transmitting information to its successor node ,S in the ordered sequence of nodes. Note that the channel used to transmit information from some node is the channel used to receive information at its successor node in the ordered sequence of nodes. The first node in the sequence, or some nearby system, has as input the information of the set of available channels at each of the nodes in the ordered sequence. The invention provides methods that determine an optimal sequence of channels assigned to the wireless links that interconnect the ordered sequence of nodes.
A sequence of channel assignments is called optimal if it establishes a communications path from the first node in the ordered sequence of nodes to the last node in that sequence, or, if such a path does not exist, it establishes a communications path from the first node to the farthest node possible.
The invention uses global information from all nodes in the sequence to come up with a globally optimal sequence of channel assignments. Current systems use distributed methods wherein each node selects a channel for transmitting information using information from only a subset of nodes.
SUMMARY OF INVENTION
The present invention focuses on establishing a communications path among an ordered sequence of moving nodes, representing vehicles. The sequence of nodes can be viewed as a directed linear tree topology where a link interconnects a node only to its successor node in the ordered sequence. A channel is used to send information from one node to the next node on a wireless link. The set of available channels may differ from one node to the next node. Each of the available channels at a node can be used for receiving information from its predecessor node in the sequence or for transmitting information to its successor node in the sequence. However, the same channel cannot be used at a node for both receiving and transmitting information. Using information regarding the set of available channels at each of the nodes in the ordered sequence of nodes, the invention provides methods that determine an optimal sequence of channels assigned to the wireless links connecting the nodes. A sequence of channel assignments ,S is called optimal if it establishes a communications path from the first node in the ordered sequence to the last one, or, if such a path does not exist, it establishes a communications path from the first node in the ordered sequence to the farthest node possible. The present invention describes three methods that find an optimal sequence of channel assignments. The first method uses a depth-first search starting from the first node in the sequence. The second method improves upon the channel selection rule in a node by using a "look ahead" scheme that may reduce the computational effort of the depth-first search method. The third method requires only a single pass through the sequence of nodes by identifying optimal channel assignments in subsequences of nodes without a need for backtracking, resulting in computational effort that is proportional to the number of nodes in the ordered sequence of nodes.
The present invention will be more clearly understood when the following description is read in conjunction with the accompanying drawings.
BRIEF DESCRIPTION OF THE DRAWINGS
Figure 1 illustrates an ordered sequence of nodes, shown as a directed linear tree network, and the sets of available channels.
The present invention focuses on establishing a communications path among an ordered sequence of moving nodes, representing vehicles. The sequence of nodes can be viewed as a directed linear tree topology where a link interconnects a node only to its successor node in the ordered sequence. A channel is used to send information from one node to the next node on a wireless link. The set of available channels may differ from one node to the next node. Each of the available channels at a node can be used for receiving information from its predecessor node in the sequence or for transmitting information to its successor node in the sequence. However, the same channel cannot be used at a node for both receiving and transmitting information. Using information regarding the set of available channels at each of the nodes in the ordered sequence of nodes, the invention provides methods that determine an optimal sequence of channels assigned to the wireless links connecting the nodes. A sequence of channel assignments ,S is called optimal if it establishes a communications path from the first node in the ordered sequence to the last one, or, if such a path does not exist, it establishes a communications path from the first node in the ordered sequence to the farthest node possible. The present invention describes three methods that find an optimal sequence of channel assignments. The first method uses a depth-first search starting from the first node in the sequence. The second method improves upon the channel selection rule in a node by using a "look ahead" scheme that may reduce the computational effort of the depth-first search method. The third method requires only a single pass through the sequence of nodes by identifying optimal channel assignments in subsequences of nodes without a need for backtracking, resulting in computational effort that is proportional to the number of nodes in the ordered sequence of nodes.
The present invention will be more clearly understood when the following description is read in conjunction with the accompanying drawings.
BRIEF DESCRIPTION OF THE DRAWINGS
Figure 1 illustrates an ordered sequence of nodes, shown as a directed linear tree network, and the sets of available channels.
Figure 2 shows an example of the Depth-First Search Method.
Figure 3 shows an example of the Enhanced Depth-First Search Method.
Figure 4 shows an example of the One Path Method.
DETAILED DESCRIPTION
Referring now to the figures and Figure 1 in particular, there is shown an example 100 of an ordered sequence of five nodes 101-105, also labeled as nodes 1-5.
The nodes represent moving vehicles and the links 106-109 represent wireless links interconnecting the nodes. For example, link 106 connects node 1 to node 2, link 107 connects node 2 to node 3, and so forth. Note that the network comprising the nodes and links can be viewed as a directed linear tree. Each node has a set of channels available for receiving or transmitting information where the term channel is used as a logical entity. It may represent a frequency band (under FDMA), an orthogonal code (under CDMA), and the like. The set of available channels may differ from one node to the next due to external interferences, other ongoing communications that involve some of these nodes, different equipment used at the nodes, and so forth. For example, node 1 (101) can use channels 1 and 2, as depicted by the set SI = 11, 2}, node 2 (102) can use channels 1, 2 and 4 as depicted by the set S2 ={ 1, 2, 4}, and so forth. The information of all sets S;, i = 1, 2, 3, 4 and 5 is provided as input to the channel assignment methods.
Typically, the input will be available at node 1, however, it may be available at some other location, e.g., at nearby fixed devices. The channel assignment methods are generic and independent of the location of the input. The objective is to establish, if possible, a communications path that connects node 1 to node 5. If such a communications path cannot be established, the objective is to establish a communications path starting at node 1 to the farthest node along the ordered sequence of nodes. Node i may use for receiving or transmitting information only channels included in the set Si, and the channel selected on the incoming link into node i must differ from that selected on the outgoing link from node i.
The invention provides three methods that find an optimal sequence of channels assigned to the interconnecting links wherein an optimal sequence of channels establishes a communications path from node 1 to the farthest possible node along the ordered sequence of nodes. The farthest node may be node N or some node i < N.
Each of the methods provide an optimal sequence of channels, however, they may require different computational effort.
Let S; denote the set of available channels at node i where the sets S; for i = 1, 2, ..., N are provided as input for an ordered sequence of N nodes. Let Ti denote the set of available channels at node i and at node i +1, i.e., T; = S; n S; +1. The sets T; for i = 1, 2, ..., N - 1 are readily computed from the sets S; for i = 1, 2, ..., N. Since node i must use on its outgoing link a channel that is in S; and node i + 1 must use on its incoming link a ,o channel that is in Si +1, node i can interconnect with node i + 1 only on channels that are in the set T. Let f denote the channel used for transmission from node i to node i + 1. In addition, node i must use different channels for receiving information from node i - 1 and for transmitting information to node i + 1. Let FEAS; denote the set of channels that can be used to transmit information from node i and received by node i +1, given that ,s node i - 1 communicates with node i on channel f_1. Thus, FEAS1= Ti and FEAS; = T; -f_ 1 for i> 1. Note that if each of the sets Ti has two or more channels, a sequence of channels that connects node 1 to node N can trivially be assigned through arbitrary selection, starting from node 1. The challenge is to determine optimal assignments when some of the sets Ti include only one channel. Obviously, if some T; does not include any 20 channel, a feasible communications path cannot be established beyond that node.
The Depth-First Search Method (DFSM) Referring now to Figure 2, there is shown an example of the Depth-First Search 25 Method (DFSM) 200 applied to the ordered sequence of five nodes described in connection with example 100 with S, ={ 1, 2), S2 ={ 1, 2, 4), S3 ={ 1, 3}, S4 ={ 1, 3, 4}, and S5 11, 21. The DFSM method computes from the sets S; the sets T,= S; n S;
+ i, in particular, T, 1, 2), T2 ={ 1}, T3 ={ 1, 3}, and T4 ={ 1}. The method builds a search tree as follows. The method starts with node 1 (201), selecting a channel from the set T, 30 as the candidate channel on the link from node 1 (201) to node 2 (202), using some specified rule, e.g., random selection, the largest or smallest channel index, and so forth.
Suppose the method selects channel 1, as depicted by 203. Channel 1 is now deleted from the set T2 since the channel used on the outgoing link from node 2 must differ from the channel used on the input to the node, i.e., channel 1. Since the set T2 is now empty, there is no available channel to connect node 2 (202) to node 3 (204). So the search on this branch of the tree failed as depicted by 205.
The method then backtracks from 202 to 201 and channel 1 is deleted from set Tl. The method now selects the remaining channel in Tl , i.e., channel 2, to connect node 1 (201) to node 2 (206) as depicted by 207.
Since channel 2 is not in T2, the set T2 remains unchanged. Next, the method selects channel 1, as depicted by 209 to connect node 2 (206) to node 3 (208).
Channel 1 is deleted now from T3 and, as depicted by 211, the method selects channel 3 (211) to connect node 3 (208) to node 4 (210). Since channel 3 is not in T4, the set T4 remains unchanged. The method now selects channel 1, as depicted by 213 to connect node 4 (210) to node 5 (212).
1s The method succeeded in finding an optimal sequence of channels that establishes a communications path that connects node 4 to node 5. The path uses channel 2 on the link from node 1 to node 2, channel 1 on the link from node 2 to node 3, channel 3 on the link from node 3 to node 4, and channel 1 on the link from node 4 to node 5.
The Depth-First Search Method, referred to as DFSM, is summarized as follows:
DFSM
Initialization Compute sets T; = Si n S; +I for i = 1, 2, ..., N - 1.
N <- minimum[N, smallest i with Ti = QS] (a communications path cannot be established from node 1 to a node beyond the revised N).
Initialize sets TEMP = BEST = 0 (TEMP is the interim sequence of channels from node 1 to the currently reached node, and BEST records the longest sequence of channels found since the beginning of the search).
Initialize i = 1.
Figure 3 shows an example of the Enhanced Depth-First Search Method.
Figure 4 shows an example of the One Path Method.
DETAILED DESCRIPTION
Referring now to the figures and Figure 1 in particular, there is shown an example 100 of an ordered sequence of five nodes 101-105, also labeled as nodes 1-5.
The nodes represent moving vehicles and the links 106-109 represent wireless links interconnecting the nodes. For example, link 106 connects node 1 to node 2, link 107 connects node 2 to node 3, and so forth. Note that the network comprising the nodes and links can be viewed as a directed linear tree. Each node has a set of channels available for receiving or transmitting information where the term channel is used as a logical entity. It may represent a frequency band (under FDMA), an orthogonal code (under CDMA), and the like. The set of available channels may differ from one node to the next due to external interferences, other ongoing communications that involve some of these nodes, different equipment used at the nodes, and so forth. For example, node 1 (101) can use channels 1 and 2, as depicted by the set SI = 11, 2}, node 2 (102) can use channels 1, 2 and 4 as depicted by the set S2 ={ 1, 2, 4}, and so forth. The information of all sets S;, i = 1, 2, 3, 4 and 5 is provided as input to the channel assignment methods.
Typically, the input will be available at node 1, however, it may be available at some other location, e.g., at nearby fixed devices. The channel assignment methods are generic and independent of the location of the input. The objective is to establish, if possible, a communications path that connects node 1 to node 5. If such a communications path cannot be established, the objective is to establish a communications path starting at node 1 to the farthest node along the ordered sequence of nodes. Node i may use for receiving or transmitting information only channels included in the set Si, and the channel selected on the incoming link into node i must differ from that selected on the outgoing link from node i.
The invention provides three methods that find an optimal sequence of channels assigned to the interconnecting links wherein an optimal sequence of channels establishes a communications path from node 1 to the farthest possible node along the ordered sequence of nodes. The farthest node may be node N or some node i < N.
Each of the methods provide an optimal sequence of channels, however, they may require different computational effort.
Let S; denote the set of available channels at node i where the sets S; for i = 1, 2, ..., N are provided as input for an ordered sequence of N nodes. Let Ti denote the set of available channels at node i and at node i +1, i.e., T; = S; n S; +1. The sets T; for i = 1, 2, ..., N - 1 are readily computed from the sets S; for i = 1, 2, ..., N. Since node i must use on its outgoing link a channel that is in S; and node i + 1 must use on its incoming link a ,o channel that is in Si +1, node i can interconnect with node i + 1 only on channels that are in the set T. Let f denote the channel used for transmission from node i to node i + 1. In addition, node i must use different channels for receiving information from node i - 1 and for transmitting information to node i + 1. Let FEAS; denote the set of channels that can be used to transmit information from node i and received by node i +1, given that ,s node i - 1 communicates with node i on channel f_1. Thus, FEAS1= Ti and FEAS; = T; -f_ 1 for i> 1. Note that if each of the sets Ti has two or more channels, a sequence of channels that connects node 1 to node N can trivially be assigned through arbitrary selection, starting from node 1. The challenge is to determine optimal assignments when some of the sets Ti include only one channel. Obviously, if some T; does not include any 20 channel, a feasible communications path cannot be established beyond that node.
The Depth-First Search Method (DFSM) Referring now to Figure 2, there is shown an example of the Depth-First Search 25 Method (DFSM) 200 applied to the ordered sequence of five nodes described in connection with example 100 with S, ={ 1, 2), S2 ={ 1, 2, 4), S3 ={ 1, 3}, S4 ={ 1, 3, 4}, and S5 11, 21. The DFSM method computes from the sets S; the sets T,= S; n S;
+ i, in particular, T, 1, 2), T2 ={ 1}, T3 ={ 1, 3}, and T4 ={ 1}. The method builds a search tree as follows. The method starts with node 1 (201), selecting a channel from the set T, 30 as the candidate channel on the link from node 1 (201) to node 2 (202), using some specified rule, e.g., random selection, the largest or smallest channel index, and so forth.
Suppose the method selects channel 1, as depicted by 203. Channel 1 is now deleted from the set T2 since the channel used on the outgoing link from node 2 must differ from the channel used on the input to the node, i.e., channel 1. Since the set T2 is now empty, there is no available channel to connect node 2 (202) to node 3 (204). So the search on this branch of the tree failed as depicted by 205.
The method then backtracks from 202 to 201 and channel 1 is deleted from set Tl. The method now selects the remaining channel in Tl , i.e., channel 2, to connect node 1 (201) to node 2 (206) as depicted by 207.
Since channel 2 is not in T2, the set T2 remains unchanged. Next, the method selects channel 1, as depicted by 209 to connect node 2 (206) to node 3 (208).
Channel 1 is deleted now from T3 and, as depicted by 211, the method selects channel 3 (211) to connect node 3 (208) to node 4 (210). Since channel 3 is not in T4, the set T4 remains unchanged. The method now selects channel 1, as depicted by 213 to connect node 4 (210) to node 5 (212).
1s The method succeeded in finding an optimal sequence of channels that establishes a communications path that connects node 4 to node 5. The path uses channel 2 on the link from node 1 to node 2, channel 1 on the link from node 2 to node 3, channel 3 on the link from node 3 to node 4, and channel 1 on the link from node 4 to node 5.
The Depth-First Search Method, referred to as DFSM, is summarized as follows:
DFSM
Initialization Compute sets T; = Si n S; +I for i = 1, 2, ..., N - 1.
N <- minimum[N, smallest i with Ti = QS] (a communications path cannot be established from node 1 to a node beyond the revised N).
Initialize sets TEMP = BEST = 0 (TEMP is the interim sequence of channels from node 1 to the currently reached node, and BEST records the longest sequence of channels found since the beginning of the search).
Initialize i = 1.
End of initialization.
While i < N
FEAS; = Ti -f _I (fori= 1,FEASi=Ti).
If FEAS1 = 0, STOP (the set BEST provides the longest possible sequence of channels; at this stopping point the optimal communications path does not reach node N).
If FEASi = 0 (i > 1), backtracking is needed:
Begin If the sequence of channels in TEMP is longer than that in BEST, ,o then BEST <-- TEMP.
UpdateTi_1 <- Ti_I -f_i.
Update TEMP +- TEMP
UpdateiF-i-1.
Go to beginning of the while loop.
/5 End.
FEAS; :~ 0: Select channel on next link.
Begin Select channel f E FEAS; for transmitting from node i to node i + 1 using an arbitrary rule (e.g., random selection).
20 Update TEMP F- TEMP + f.
Updatei<-- i + 1.
End.
End of while loop.
BEST E- TEMP (at this stopping point the set BEST provides a communications path 25 that connects node 1 to node N).
STOP.
End of DFSM.
While i < N
FEAS; = Ti -f _I (fori= 1,FEASi=Ti).
If FEAS1 = 0, STOP (the set BEST provides the longest possible sequence of channels; at this stopping point the optimal communications path does not reach node N).
If FEASi = 0 (i > 1), backtracking is needed:
Begin If the sequence of channels in TEMP is longer than that in BEST, ,o then BEST <-- TEMP.
UpdateTi_1 <- Ti_I -f_i.
Update TEMP +- TEMP
UpdateiF-i-1.
Go to beginning of the while loop.
/5 End.
FEAS; :~ 0: Select channel on next link.
Begin Select channel f E FEAS; for transmitting from node i to node i + 1 using an arbitrary rule (e.g., random selection).
20 Update TEMP F- TEMP + f.
Updatei<-- i + 1.
End.
End of while loop.
BEST E- TEMP (at this stopping point the set BEST provides a communications path 25 that connects node 1 to node N).
STOP.
End of DFSM.
The Enhanced Depth-First Search Method (EDFSM) Referring now to Figure 3, there is shown an example of the Enhanced Depth-First Search Method (EDFSM) 300 applied to the same ordered sequence of five nodes described in example 100 with S, ={ 1, 2}, SZ ={ 1, 2, 4}, S3 ={ 1, 3}, S4 ={
1, 3, 4}, and S5 ={ 1, 2}. The method computes from the sets Si the sets T; = Si n S; + i, in particular, T, ={ 1, 2}, T2 ={ 1}, T3 ={ 1, 3}, and T4 ={ 11. EDFSM builds a search tree in the same way as DFSM. However, EDFSM uses a "look-ahead" rule to select a channel from the channels in the set FEASi. The EDFSM method first examines whether the set FEAS;
includes a channel that is not in the set T; +1, and if so it selects such a channel. Note that selecting such a channel does not decrease the selection options FEAS; + I at node i + 1. If such a channel does not exist, the same rule used in DFSM will be used.
Referring to Figure 3, the method starts with selecting a channel from the set FEAS, = T, as the candidate channel on the link from node 1 (301) to node 2 (302). Since channel 2 is the only channel in T, that is not in T2, the method selects channel 2, as depicted by 303, to connect node 1 (301) to node 2 (302). Note that by using this "look-ahead" rule we did not select channel 1 which would lead to a failure to establish a connection from node 2 to node 3 as previously demonstrated in example 200.
The remaining steps of the search in example 300 are the same as that shown in example 200. Since channel 2 is not in T2, the set T2 remains unchanged. Next, the method selects channel 1, as depicted by 305 to connect node 2 (302) to node 3 (304).
Channel 1 is deleted now from T3 and, as depicted by 307, the method selects channel 3 to connect node 3 (304) to node 4 (306). Since channel 3 is not in T4, the set T4 remains unchanged. The method now selects channel 1, as depicted by 309 to connect node 4 (306) to node 5 (308).
EDFSM succeeded in finding an optimal sequence of channels that establishes a communications path from node 1 to node 5. This is the same sequence found by using the DFSM method in example 200. The path uses channel 2 from node 1 to node 2, channel 1 form node 2 to node 3, channel 3 from node 3 to node 4, and channel 1 from node 4 to node 5. EDFSM requires, in general, less computational effort than DFSM
1, 3, 4}, and S5 ={ 1, 2}. The method computes from the sets Si the sets T; = Si n S; + i, in particular, T, ={ 1, 2}, T2 ={ 1}, T3 ={ 1, 3}, and T4 ={ 11. EDFSM builds a search tree in the same way as DFSM. However, EDFSM uses a "look-ahead" rule to select a channel from the channels in the set FEASi. The EDFSM method first examines whether the set FEAS;
includes a channel that is not in the set T; +1, and if so it selects such a channel. Note that selecting such a channel does not decrease the selection options FEAS; + I at node i + 1. If such a channel does not exist, the same rule used in DFSM will be used.
Referring to Figure 3, the method starts with selecting a channel from the set FEAS, = T, as the candidate channel on the link from node 1 (301) to node 2 (302). Since channel 2 is the only channel in T, that is not in T2, the method selects channel 2, as depicted by 303, to connect node 1 (301) to node 2 (302). Note that by using this "look-ahead" rule we did not select channel 1 which would lead to a failure to establish a connection from node 2 to node 3 as previously demonstrated in example 200.
The remaining steps of the search in example 300 are the same as that shown in example 200. Since channel 2 is not in T2, the set T2 remains unchanged. Next, the method selects channel 1, as depicted by 305 to connect node 2 (302) to node 3 (304).
Channel 1 is deleted now from T3 and, as depicted by 307, the method selects channel 3 to connect node 3 (304) to node 4 (306). Since channel 3 is not in T4, the set T4 remains unchanged. The method now selects channel 1, as depicted by 309 to connect node 4 (306) to node 5 (308).
EDFSM succeeded in finding an optimal sequence of channels that establishes a communications path from node 1 to node 5. This is the same sequence found by using the DFSM method in example 200. The path uses channel 2 from node 1 to node 2, channel 1 form node 2 to node 3, channel 3 from node 3 to node 4, and channel 1 from node 4 to node 5. EDFSM requires, in general, less computational effort than DFSM
since the "look-ahead" rule may prevent selection of channels that would lead to backtracking on the search tree. Note, however, that EDFSM may still require backtracking. This can be easily demonstrated by adding another node, referred to as node 1', between node 1 and node 2 with the set S>> = Si. Now, starting at node 1, the S "look-ahead" rule does not provide any guidance at node 1. If channel 2 is selected at node 1, channel 1 must be selected at node 1', and no channel would be available to connect node 2 to node 3. Backtracking on the search tree would then be required.
The Enhanced Depth-First Search Method, referred to as EDFSM, is as follows:
EDFSM
Initialization Compute sets T; = Si n Si +1 for i = 1, 2, ..., N - 1.
N F- minimum[N, smallest i with T, = 0] (a communications path cannot be 1.5 established from node 1 to a node beyond the revised N).
Initialize sets TEMP = BEST =0 (TEMP is the interim sequence of channels from node 1 to the currently reached node, and BEST records the longest sequence of channels found since the beginning of the search).
Initialize i = 1.
End of initialization.
While i < N
F E A S i = T,-f I (fori= 1,FEASi =T;).
If FEAS1 = 0, STOP (the set BEST provides the longest possible sequence of channels; at this stopping point the optimal communications path does not reach node N).
If FEAS; = 0 (i > 1), backtracking is needed:
Begin If the sequence of channels in TEMP is longer than that in BEST, then BEST <-- TEMP.
UpdateT,_I F- T,_I -f_i.
Update TEMP F- TEMP - f_ 1.
Update i F- i - 1.
Go to beginning of the while loop.
End.
FEASi t 0: Select channel on next link.
Begin Select channel for transmitting from node i to node i +1 as follows:
If available, select some f E FEASj\Tj + 1(i.e., f is in FEASi but not in Tj+j); otherwise, select some f E FEAS; using an arbitrary rule (e.g., ,o random selection).
Update TEMP ~- TEMP + f .
UpdateiE-i+1.
End.
End of while loop.
BEST ~- TEMP (at this stopping point the set BEST provides a communications path that connects node 1 to node N).
STOP.
End of EDFSM.
The One-Pass Method (OPM) Referring now to Figure 4, there is shown an example 400 of the One Pass Method (OPM) applied to the same ordered sequence of five nodes described in example 100withS, ={1,2},S2={1,2,4},S3={1,3},S4={1,3,4},andS5={1,2}.The method computes from the sets S; the sets T;, in particular, T, 1, 2), T2 ={
1}, T3 ={ 1, 3},andT4={1}.
Starting from node 1 (401), set T2 ={ 1} is the first set with a single channel.
Therefore, moving backwards, the method selects channel 1 on the link from node 2 (402) to node 3 (403), updates T, by deleting channel 1 from Ti, which results in T, _ {2}, and selects channel 2 on the link from node 1 (401) to node 2 (402). The selection of channels on this subsequence is depicted by 406. Channel 1 is also deleted from set T3, leading to T3 ={ 3}. The direction of the arrow in 406 emphasizes that the subsequence of channels assigned to the links is determined backwards, i.e., first for the link connecting node 2 to node 3 and then for the link connecting node 1 to node 2.
Next, starting from node 3 (403), T3 ={ 3} is the first set with a single channel.
Therefore, the second subsequence includes only a single link and the method selects, as depicted by 407, channel 3 on the link from node 3 (403) to node 4 (404).
Since T4 does not include channel 3, no update is needed.
Finally, starting from node 4 (404), node 5 (405) is reached. As depicted by 408, channel 1 is selected from node 4 (404) to node 5 (405).
The OPM method succeeded in finding an optimal sequence of channels that establishes a communications path from node 1 to node 5. This is the same sequence found by DFSM and EDFSM. The path uses channel 2 from node 1 to node 2, channel 1 form node 2 to node 3, channel 3 from node 3 to node 4, and channel 1 from node 4 to node 5.
The OPM method does not build a search tree. Instead, it looks for the first node, say node m, along the ordered sequence of nodes that has a single channel in the set T,,, and assigns the channel in T,,, to the link connecting nodes m to node m + 1 The assigned channel is deleted from set T,,, - 1. It then proceeds to node m -1 and arbitrarily assigns a channel from set T,,, _I to the link connecting node m - 1 to node m. The method continues in that manner until a channel is assigned to the link connecting node 1 to node 2. Assignment of channels to the links along the path that connects node 1 to node m +1 is completed. Note that the backwards assignment of channels to interconnect the subsequence of nodes 1 to m + 1 is guaranteed to succeed since each of the sets T; for i m - 1, m - 2, ..., 1 has at least two channels.
If node m = N - 1, the OPM method terminates since a path is established from node 1 to node N. Suppose m < N -1. The assigned channel on the link into node m + 1 is deleted from set T, and OPM searches for the next node in the ordered sequence beyond node m, say node n, that has a single channel in the set T, OPM then assigns channels to the subsequence of links that connect node n to node n + 1, node n-1 to node n, ..., node m +1 to node m + 2.
The OPM method continues to assign channels to such subsequences until a path that connects node 1 to node N is established or until some set, say Tp, is encountered with TP = 0. In the latter case, a communications path can be established only from node 1 to node p.
Note that a subsequence with node N as its last node may have more than one channel in TN_ 1, in which case the OPM method arbitrarily assigns one of these channels to the link connecting node N - 1 to node N.
The OPM method will find an optimal sequence in an effort that is proportional to the number of nodes, i.e., in an effort of O(N) (after computing the sets T;). The sequence found will generate a communications path from node 1 to node N, or, if not possible, from node 1 to the farthest node possible along the ordered sequence of nodes.
Let IT;l denote the number of channels in the set Tt. The One Path Method, referred to as OPM, is as follows:
OPM
Initialization Ti = SinSi+1 fori=1,2,...,N-1.
N minimum[N, smallest i with T, = 0] (a communications path cannot be established from node 1 to a node beyond the revised N).
MIN = 1.
End of initialization.
Subsequence Channel Assignment MAX = [i: Smallest i> MIN with IT;l = 1]; if no ITil = 1 set MAX = N - 1.
Select some fMAx E TMax using an arbitrary rule (e.g., random selection).
i = MAX.
While i > MIN
Ti-I ~- Ti_I -f.
Select some fi _I T; _I using an arbitrary rule (e.g., random selection).
iF-i-1.
End of while loop.
End of subsequence channel assignment.
Termination Checks MIN ~- MAX + 1.
If MIN = N, STOP (assigned channels fl, f2, ..., fN -1 provides a communications path from node 1 to node N).
TMIN ~- TMIN - fMIN - 1 =
If TMIN = 0, STOP (assigned channels f~, f2, ..., fMIN _1 provide a communications path to the farthest node possible - node MIN).
Go to beginning of Subsequence Channel Assignment.
End of termination checks.
End of OPM.
Suppose channels could be assigned only up to node p < N (the initial value of N) using any of the methods DFSM, EDFSM or OPM (all three methods will establish a communications path to the farthest possible node). Since the sets Si may change quite rapidly, it may be desired to establish a partial path up to node p and re-execute a channel assignment method, starting from node p, after a specified time interval. A complete path from node 1 to node N may thus be established by combining several partial communications paths established through sequential executions of a channel assignment method.
The algorithms described above are capable of being performed on an instruction execution system, apparatus, or device, such as a computing device. The algorithms themselves may be contained on a computer-readable medium that can be any means that can contain, store, communicate, propagate, or transport the program for use by or in connection with an instruction execution system, apparatus, or device, such as a computer.
While there has been described and illustrated methods for optimal multi-channel assignments in ad-hoc vehicular networks comprised of an ordered sequence of moving vehicles, it will be apparent to those skilled in the art that variations and modifications are possible without deviating from the broad teachings and scope of the present invention which shall be limited solely by the scope of the claims appended ,o hereto.
The Enhanced Depth-First Search Method, referred to as EDFSM, is as follows:
EDFSM
Initialization Compute sets T; = Si n Si +1 for i = 1, 2, ..., N - 1.
N F- minimum[N, smallest i with T, = 0] (a communications path cannot be 1.5 established from node 1 to a node beyond the revised N).
Initialize sets TEMP = BEST =0 (TEMP is the interim sequence of channels from node 1 to the currently reached node, and BEST records the longest sequence of channels found since the beginning of the search).
Initialize i = 1.
End of initialization.
While i < N
F E A S i = T,-f I (fori= 1,FEASi =T;).
If FEAS1 = 0, STOP (the set BEST provides the longest possible sequence of channels; at this stopping point the optimal communications path does not reach node N).
If FEAS; = 0 (i > 1), backtracking is needed:
Begin If the sequence of channels in TEMP is longer than that in BEST, then BEST <-- TEMP.
UpdateT,_I F- T,_I -f_i.
Update TEMP F- TEMP - f_ 1.
Update i F- i - 1.
Go to beginning of the while loop.
End.
FEASi t 0: Select channel on next link.
Begin Select channel for transmitting from node i to node i +1 as follows:
If available, select some f E FEASj\Tj + 1(i.e., f is in FEASi but not in Tj+j); otherwise, select some f E FEAS; using an arbitrary rule (e.g., ,o random selection).
Update TEMP ~- TEMP + f .
UpdateiE-i+1.
End.
End of while loop.
BEST ~- TEMP (at this stopping point the set BEST provides a communications path that connects node 1 to node N).
STOP.
End of EDFSM.
The One-Pass Method (OPM) Referring now to Figure 4, there is shown an example 400 of the One Pass Method (OPM) applied to the same ordered sequence of five nodes described in example 100withS, ={1,2},S2={1,2,4},S3={1,3},S4={1,3,4},andS5={1,2}.The method computes from the sets S; the sets T;, in particular, T, 1, 2), T2 ={
1}, T3 ={ 1, 3},andT4={1}.
Starting from node 1 (401), set T2 ={ 1} is the first set with a single channel.
Therefore, moving backwards, the method selects channel 1 on the link from node 2 (402) to node 3 (403), updates T, by deleting channel 1 from Ti, which results in T, _ {2}, and selects channel 2 on the link from node 1 (401) to node 2 (402). The selection of channels on this subsequence is depicted by 406. Channel 1 is also deleted from set T3, leading to T3 ={ 3}. The direction of the arrow in 406 emphasizes that the subsequence of channels assigned to the links is determined backwards, i.e., first for the link connecting node 2 to node 3 and then for the link connecting node 1 to node 2.
Next, starting from node 3 (403), T3 ={ 3} is the first set with a single channel.
Therefore, the second subsequence includes only a single link and the method selects, as depicted by 407, channel 3 on the link from node 3 (403) to node 4 (404).
Since T4 does not include channel 3, no update is needed.
Finally, starting from node 4 (404), node 5 (405) is reached. As depicted by 408, channel 1 is selected from node 4 (404) to node 5 (405).
The OPM method succeeded in finding an optimal sequence of channels that establishes a communications path from node 1 to node 5. This is the same sequence found by DFSM and EDFSM. The path uses channel 2 from node 1 to node 2, channel 1 form node 2 to node 3, channel 3 from node 3 to node 4, and channel 1 from node 4 to node 5.
The OPM method does not build a search tree. Instead, it looks for the first node, say node m, along the ordered sequence of nodes that has a single channel in the set T,,, and assigns the channel in T,,, to the link connecting nodes m to node m + 1 The assigned channel is deleted from set T,,, - 1. It then proceeds to node m -1 and arbitrarily assigns a channel from set T,,, _I to the link connecting node m - 1 to node m. The method continues in that manner until a channel is assigned to the link connecting node 1 to node 2. Assignment of channels to the links along the path that connects node 1 to node m +1 is completed. Note that the backwards assignment of channels to interconnect the subsequence of nodes 1 to m + 1 is guaranteed to succeed since each of the sets T; for i m - 1, m - 2, ..., 1 has at least two channels.
If node m = N - 1, the OPM method terminates since a path is established from node 1 to node N. Suppose m < N -1. The assigned channel on the link into node m + 1 is deleted from set T, and OPM searches for the next node in the ordered sequence beyond node m, say node n, that has a single channel in the set T, OPM then assigns channels to the subsequence of links that connect node n to node n + 1, node n-1 to node n, ..., node m +1 to node m + 2.
The OPM method continues to assign channels to such subsequences until a path that connects node 1 to node N is established or until some set, say Tp, is encountered with TP = 0. In the latter case, a communications path can be established only from node 1 to node p.
Note that a subsequence with node N as its last node may have more than one channel in TN_ 1, in which case the OPM method arbitrarily assigns one of these channels to the link connecting node N - 1 to node N.
The OPM method will find an optimal sequence in an effort that is proportional to the number of nodes, i.e., in an effort of O(N) (after computing the sets T;). The sequence found will generate a communications path from node 1 to node N, or, if not possible, from node 1 to the farthest node possible along the ordered sequence of nodes.
Let IT;l denote the number of channels in the set Tt. The One Path Method, referred to as OPM, is as follows:
OPM
Initialization Ti = SinSi+1 fori=1,2,...,N-1.
N minimum[N, smallest i with T, = 0] (a communications path cannot be established from node 1 to a node beyond the revised N).
MIN = 1.
End of initialization.
Subsequence Channel Assignment MAX = [i: Smallest i> MIN with IT;l = 1]; if no ITil = 1 set MAX = N - 1.
Select some fMAx E TMax using an arbitrary rule (e.g., random selection).
i = MAX.
While i > MIN
Ti-I ~- Ti_I -f.
Select some fi _I T; _I using an arbitrary rule (e.g., random selection).
iF-i-1.
End of while loop.
End of subsequence channel assignment.
Termination Checks MIN ~- MAX + 1.
If MIN = N, STOP (assigned channels fl, f2, ..., fN -1 provides a communications path from node 1 to node N).
TMIN ~- TMIN - fMIN - 1 =
If TMIN = 0, STOP (assigned channels f~, f2, ..., fMIN _1 provide a communications path to the farthest node possible - node MIN).
Go to beginning of Subsequence Channel Assignment.
End of termination checks.
End of OPM.
Suppose channels could be assigned only up to node p < N (the initial value of N) using any of the methods DFSM, EDFSM or OPM (all three methods will establish a communications path to the farthest possible node). Since the sets Si may change quite rapidly, it may be desired to establish a partial path up to node p and re-execute a channel assignment method, starting from node p, after a specified time interval. A complete path from node 1 to node N may thus be established by combining several partial communications paths established through sequential executions of a channel assignment method.
The algorithms described above are capable of being performed on an instruction execution system, apparatus, or device, such as a computing device. The algorithms themselves may be contained on a computer-readable medium that can be any means that can contain, store, communicate, propagate, or transport the program for use by or in connection with an instruction execution system, apparatus, or device, such as a computer.
While there has been described and illustrated methods for optimal multi-channel assignments in ad-hoc vehicular networks comprised of an ordered sequence of moving vehicles, it will be apparent to those skilled in the art that variations and modifications are possible without deviating from the broad teachings and scope of the present invention which shall be limited solely by the scope of the claims appended ,o hereto.
Claims (19)
1. A method for assigning channels to wireless links interconnecting an ordered sequence of nodes, comprising the steps of:
receiving information of a set of available channels at each node of an ordered sequence of nodes wherein sets of available channels at each node may be different; and assigning channels to interconnecting links of an ordered sequence of nodes using a non-exhaustive search where the channel assigned to any of the links is selected from among the channels included at the intersection of the sets of available channels at the two end-nodes of the respective link, and the channels assigned to any two sequential links with a joint node are different;
where the assigned channels to links establish a communications path from the first node of the ordered sequence of nodes to the farthest node in the sequence that can be reached.
receiving information of a set of available channels at each node of an ordered sequence of nodes wherein sets of available channels at each node may be different; and assigning channels to interconnecting links of an ordered sequence of nodes using a non-exhaustive search where the channel assigned to any of the links is selected from among the channels included at the intersection of the sets of available channels at the two end-nodes of the respective link, and the channels assigned to any two sequential links with a joint node are different;
where the assigned channels to links establish a communications path from the first node of the ordered sequence of nodes to the farthest node in the sequence that can be reached.
2. A method as set forth in Claim 1, wherein said assigning channels to interconnecting links of an ordered sequence of nodes comprises using a search tree as specified by DFSM.
3. A method as set forth in Claim 1, wherein said assigning channels to interconnecting links of an ordered sequence of nodes comprises using a search tree as specified by EDFSM.
4. A method as set forth in Claim 1, wherein said assigning channels to interconnecting links of an ordered sequence of nodes comprises using a single pass method through the ordered sequence of nodes as specified by OPM.
5. A method as set forth in Claim 4, wherein said assigning channels to interconnecting links of an ordered sequence of nodes determines all assigned channels in a computational effort that is proportional to the number of nodes in the ordered sequence of nodes.
6. A method as set forth in Claim 1, wherein said nodes represent vehicles.
7. A method as set forth in Claim 6, wherein said assigning channels to interconnecting links of an ordered sequence of nodes comprises using a search tree as specified by DFSM.
8. A method as set forth in Claim 6, wherein said assigning channels to interconnecting links of an ordered sequence of nodes comprises using a search tree as specified by EDFSM.
9. A method as set forth in Claim 6, wherein said assigning channels to interconnecting links of an ordered sequence of nodes comprises using a single pass method through the ordered sequence of nodes as specified by OPM.
10. A method as set forth in Claim 9, wherein said assigning channels to interconnecting links of an ordered sequence of nodes determines all assigned channels in a computational effort that is proportional to the number of nodes in the ordered sequence of nodes.
11. A method for establishing a communications path from a first node in an ordered sequence of nodes to the farthest possible node in an ordered sequence of nodes in an ad-hoc network comprising the steps of:
receiving information of a set of available channels at each of the nodes in an ordered sequence of nodes wherein sets of available channels at each node may be different; and;
assigning channels to interconnecting links of an ordered sequence of nodes using a non-exhaustive search where the channel assigned to any of the links is selected from among the channels included at the intersection of the sets of available channels at the two end-nodes of the respective link, and the channels assigned to any two sequential links with a joint node are different using a method selected from the group consisting of a search tree as specified in DFSM, a search tree as specified by EDFSM, and a single pass method through the ordered sequence of nodes as specified by OPM.
receiving information of a set of available channels at each of the nodes in an ordered sequence of nodes wherein sets of available channels at each node may be different; and;
assigning channels to interconnecting links of an ordered sequence of nodes using a non-exhaustive search where the channel assigned to any of the links is selected from among the channels included at the intersection of the sets of available channels at the two end-nodes of the respective link, and the channels assigned to any two sequential links with a joint node are different using a method selected from the group consisting of a search tree as specified in DFSM, a search tree as specified by EDFSM, and a single pass method through the ordered sequence of nodes as specified by OPM.
12. A method as set forth in Claim 11, wherein said assigning channels to the links interconnecting an ordered sequence of nodes is executed multiple times with a specified stoppage time from one execution time to the next execution time, wherein communications paths established for subsets of the ordered sequence of nodes are combined to establish a communications path from the first node in the ordered sequence of nodes to the farthest possible node in the ordered sequence of nodes.
13. A method as set forth in Claim 11, wherein the nodes represent vehicles.
14. A system for establishing a communications path from the first node in an ordered sequence of nodes to the farthest possible node along the ordered sequence of nodes in an ad-hoc network comprising:
means for storing information of a set of available channels at each node in an ordered sequence of nodes;
means for assigning channels to interconnecting links of an ordered sequence of nodes using a non-exhaustive search where the channel assigned to any of the links is selected from among the channels included at the intersection of the sets of available channels at the two end-nodes of the respective link, and the channels assigned to any two sequential links with a joint node are different.
means for storing information of a set of available channels at each node in an ordered sequence of nodes;
means for assigning channels to interconnecting links of an ordered sequence of nodes using a non-exhaustive search where the channel assigned to any of the links is selected from among the channels included at the intersection of the sets of available channels at the two end-nodes of the respective link, and the channels assigned to any two sequential links with a joint node are different.
15. A system as set forth in Claim 14, wherein said means for assigning channels to interconnecting links of an ordered sequence of nodes uses a search tree as specified by DFSM.
16. A system as set forth in Claim 14, wherein said means for assigning channels to interconnecting links of an ordered sequence of nodes uses a search tree as specified by EDFSM.
17. A system as set forth in Claim 14, wherein said means for assigning channels to interconnecting links of an ordered sequence of nodes uses a single pass method through the ordered sequence of nodes as specified by OPM.
18. The system as set forth in Claim 14, wherein said means for assigning channels to interconnecting links of an ordered sequence of nodes is executed multiple times with a specified stoppage time from one execution to the next execution, wherein communications paths established for subsets of the ordered sequence of nodes are combined to establish a communications path from the first node to the farthest possible node in the sequence.
19. A system as set forth in Claim 14, wherein said nodes represent vehicles.
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US11/800,849 US8116269B2 (en) | 2007-05-08 | 2007-05-08 | Methods for optimal multi-channel assignments in vehicular ad-hoc networks |
| US11/800,849 | 2007-05-08 | ||
| PCT/US2007/023852 WO2008136809A1 (en) | 2007-05-08 | 2007-11-13 | Methods for optimal multi-channel assignments in vehicular ad-hoc networks |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CA2686711A1 true CA2686711A1 (en) | 2008-11-13 |
| CA2686711C CA2686711C (en) | 2013-12-24 |
Family
ID=39943788
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA2686711A Expired - Fee Related CA2686711C (en) | 2007-05-08 | 2007-11-13 | Methods for optimal multi-channel assignments in vehicular ad-hoc networks |
Country Status (4)
| Country | Link |
|---|---|
| US (1) | US8116269B2 (en) |
| EP (1) | EP2156614A4 (en) |
| CA (1) | CA2686711C (en) |
| WO (1) | WO2008136809A1 (en) |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8059563B2 (en) * | 2008-07-31 | 2011-11-15 | Aruba Networks, Inc. | Assigning slots in a mesh network |
| US8190322B2 (en) * | 2009-01-13 | 2012-05-29 | GM Global Technology Operations LLC | Autonomous vehicle maintenance and repair system |
| CN102137402B (en) * | 2011-04-27 | 2013-09-18 | 北京大学 | Multi-channel allocation method based on road vehicle network |
| EP2750428B1 (en) * | 2011-08-24 | 2020-06-03 | Nec Corporation | Communication device, communication method, and recording medium |
| US8984090B2 (en) * | 2012-07-10 | 2015-03-17 | Nokia Corporation | Method and apparatus for providing derivative publications of a publication at one or more services |
| US9411857B1 (en) * | 2013-06-28 | 2016-08-09 | Google Inc. | Grouping related entities |
| CN106060940B (en) * | 2016-05-24 | 2019-03-22 | 重庆邮电大学 | Certainty dispatching method towards industrial wireless WIA-PA network |
Family Cites Families (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020163889A1 (en) * | 2000-02-02 | 2002-11-07 | Yechiam Yemini | Method and apparatus for providing services on a dynamically addressed network |
| US6990087B2 (en) * | 2002-04-25 | 2006-01-24 | Raytheon Company | Dynamic wireless resource utilization |
| US7852796B2 (en) * | 2002-05-13 | 2010-12-14 | Xudong Wang | Distributed multichannel wireless communication |
| US7489932B2 (en) * | 2004-06-03 | 2009-02-10 | Tropos Networks | Channel assignments within a mesh network |
| US7362711B2 (en) * | 2004-12-16 | 2008-04-22 | Palo Alto Research Center Incorporated | Method and apparatus for detecting and correcting malicious data in an ad-hoc network |
| EP1677473B1 (en) * | 2004-12-23 | 2010-06-09 | Carmel-Haifa University Economic Corp. Ltd. | Ad hoc communication system and method for routing speech packets therein |
| KR100677596B1 (en) * | 2005-06-11 | 2007-02-02 | 삼성전자주식회사 | Method and Device for allocating a channel to wireless interface |
| US8015236B2 (en) * | 2005-10-25 | 2011-09-06 | Waratek Pty. Ltd. | Replication of objects having non-primitive fields, especially addresses |
| GB2455939B (en) * | 2006-09-19 | 2011-04-27 | Firetide Inc | A multi-channel assignment method for multi-radio multi-hop wireless mesh networks |
-
2007
- 2007-05-08 US US11/800,849 patent/US8116269B2/en not_active Expired - Fee Related
- 2007-11-13 CA CA2686711A patent/CA2686711C/en not_active Expired - Fee Related
- 2007-11-13 EP EP07853117A patent/EP2156614A4/en not_active Withdrawn
- 2007-11-13 WO PCT/US2007/023852 patent/WO2008136809A1/en active Search and Examination
Also Published As
| Publication number | Publication date |
|---|---|
| WO2008136809A1 (en) | 2008-11-13 |
| EP2156614A4 (en) | 2011-12-14 |
| US20080279141A1 (en) | 2008-11-13 |
| US8116269B2 (en) | 2012-02-14 |
| CA2686711C (en) | 2013-12-24 |
| EP2156614A1 (en) | 2010-02-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA2686711C (en) | Methods for optimal multi-channel assignments in vehicular ad-hoc networks | |
| US20210058157A1 (en) | Multi-layer network system and path setting method in multi-layer network | |
| Hu | Distributed code assignments for CDMA packet radio networks | |
| US6882627B2 (en) | Methods and apparatus for selecting multiple paths taking into account shared risk | |
| US8077658B2 (en) | Packet forwarding in multi-radio multi-hop wireless networks | |
| US7852788B2 (en) | Method of organizing nodes of a network into groupings of nodes, computer program for implementing such a method and communication device forming a node of a network of nodes | |
| WO2006137764A1 (en) | Method and arrangement for route cost determination and selection with link cost interaction. | |
| CN113259864B (en) | Narrow-band communication method, interphone, equipment, storage medium and ad hoc network system | |
| US20100077103A1 (en) | Route calculation system, network management device, route calculation engine, route calculation method and program product | |
| CN105451255A (en) | Processing method and processing device of district interference management strategy | |
| CN104254130A (en) | Method, device and system for allocating D2D (Device-to-Device) user link and cellular user shared resources | |
| Liu et al. | Bootstrapping free-space optical networks | |
| KR20060084443A (en) | Channel assignment for scalable a d-h o c networks | |
| US20050063312A1 (en) | Determining two node-disjoint paths using on-demand flooding | |
| KR101758845B1 (en) | A method and an apparatus for scheduling based physical layer network coding for bidirectional traffic | |
| Kashyap et al. | Integrated topology control and routing in wireless optical mesh networks | |
| CN104796794A (en) | Video transmission path determination method and device | |
| US10848262B2 (en) | Optical path design apparatus and optical path design method | |
| CN101394337B (en) | Method, system and device for message routing between network nodes based on P2P | |
| CN105119818A (en) | A method and system for establishing a multichannel clustering rout in a dense wavelength division network | |
| Luss et al. | Optimal Multi-Channel Assignments in Vehicular Ad-Hoc Networks | |
| Cao | An integer linear programming approach for topology design in OWC networks | |
| CN105933945A (en) | Data download route design method capable of supporting P2P sharing mechanism and applicable to D2D network | |
| CN112019436A (en) | Transmission path selection method, device, equipment and medium | |
| US11750955B2 (en) | Routing method for dynamic WDM optical networks with wavelength continuity constraints |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| MKLA | Lapsed |
Effective date: 20201113 |