WIRELESS NETWORK CHANNEL ALLOCATION METHOD AND MULTI-HOP WIRELESS NETWORK SYSTEM USING THE SAME

• US 20080151821A1
• Filed: 02/12/2007
• Published: 06/26/2008
• Est. Priority Date: 12/26/2006
• Status: Active Grant

• Current Assignee: Seoul National University Industry Foundation (Seoul National University)
• Original Assignee: Seoul National University Industry Foundation (Seoul National University)
• Inventors: KIM, Chong-kwon, CHO, Seongho
• Granted Patent: US 7,773,558 B2
• Time in Patent Office: Days
• US Class Current: 370/329
• CPC Class Codes: H04W 16/10 Dynamic resource partitioning
• CPC Class Codes: H04W 48/08 Access restriction or access information delivery, e.g. discovery data delivery signalling during connection H04W76/00
• CPC Class Codes: H04W 48/16 Discovering, processing access restriction or access information
• CPC Class Codes: H04W 72/00 Local resource management
• CPC Class Codes: H04W 72/541 using the level of interference
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks
• CPC Class Codes: H04W 88/04 adapted for relaying to or from another terminal or user

Abstract

Multi-hop wireless networks have benefits in coverage extension and throughput improvement. In this multi-hop wireless networks, multiple channels are available to improve system performance through concurrent transmission. In this invention, a multi-channel assignment method is described. For efficient utilization of multiple channels considering different channel condition at each node, the multi-channel assignment method is comprising the steps of: a) gathering neighbor relay node information by relaying control messages which include node information, such as the list of neighbor nodes, the preferable channel list of nodes, and the number of available radio interfaces; b) connectivity graph construction, by generating the multi-graph connectivity graph from the gathered node information; c) conflict graph composition, by generating the multi-channel conflict graph which exhibits interference among links from the multi-graph connectivity graph; and d) multi-channel assignment, by allocating channels to links considering channel interference by referring the multi-channel conflict graph using the list coloring algorithm.

Claims

1. A channel assignment method for a wireless network comprising:

a) receiving or collecting node information including available channel information of individual nodes in a wireless network;

b) calculating a multi-connection relationship of connection links among the individual nodes using the collected node information;

c) calculating a channel conflict relationship caused by interference of the connection links among the individual nodes according to the calculated multi-connection relationship;

d) assigning a channel to the connection links among the individual nodes by referring to the calculated channel conflict relationship; and

e) transmitting the channel assigned to each link to the individual nodes.

2. The method according to claim 1, wherein the collecting step a) includes:

receiving or collecting the node information by relaying data among the nodes.

3. The method according to claim 1, wherein the multi-connection relationship calculating step b) includes:

generating a multi-graph equipped with multiple receivers capable of performing multiple transmission/reception among the nodes.

4. The method according to claim 1, wherein the channel conflict relationship calculating step c) includes:

c1) calculating all links, each of which includes interference for each node; and

c2) generating a multi-channel conflict graph for a connection of the individual nodes by referring to the calculated links.

5. The method according to claim 4, wherein the channel conflict relationship calculating step c) includes:

determining all the links sharing the nodes to be links, each of which causes the interference to a corresponding link.

6. The method according to claim 5, wherein the channel conflict relationship calculating step c) includes:

determining a specific link as an interfering link when it satisfying one of following conditions;

c1) if link e′

shares a node with link e, e′

is a node sharing interfering link;

or c2) if any node of link e′

can hear the transmission from link e, e′

is an overhearing interfering link.

7. The method according to claim 4, wherein the channel assigning step d) includes:

d1) determining a preferable channel from among the available channels for each node, and extracting the preferable channel list from the available channels for each node;

d2) extracting a specific node capable of adapting each of all the channels as a common preferable channel, and generating a sub-graph including only a node extracted from the multi-channel conflict graph;

d3) assigning priority for each sub-graph; and

d4) assigning a channel to the individual nodes contained in the sub-graph according to the assigned priority, deleting the channel-assigned node from other sub-graphs, and assigning the channel to connection links among the nodes.

8. The method according to claim 7, wherein the priority is assigned in a descending numerical order of the number of nodes contained in the sub-graph.

9. The method according to claim 7, wherein the channel assigning step d) includes:

indicating the same connection links on the sub-graph, selecting a node having more connection links from among the multi-channel conflict graph when two nodes are connected to each other, and assigning the channel to the selected node.

10. A multi-hop wireless network system comprising:

one or more nodes, each of which includes available channel information equipped with preferable channel information, and provides corresponding channel information in the case of a channel assignment setup; and

a central node including a channel assignment module, which is connected to an external network line including the Internet, forms a network along with a sub-router, and receives or collects channel information from the sub-router, thereby performing channel assignment.

11. The system according to claim 10, wherein the channel assignment module includes:

a channel information collector for receiving or collecting available channel information including preferable channel information from the node;

a multi-graph generator for calculating a multi-connection link among the individual nodes using the collected available channel information received from the channel information collector, and generating a multi-graph using the calculated connection link;

a multi-channel conflict graph generator for calculating a channel conflict relationship caused by interference of the connection link among the individual nodes on the basis of the multi-graph received from the multi-graph generator, and generating a multi-channel conflict graph; and

a channel assignment unit for assigning a channel to the connection link among the individual nodes by referring to the multi-channel conflict graph generated by the multi-graph conflict graph generator.

12. The system according to claim 11, wherein the available channel information is received or collected by relaying data among the nodes.

13. The system according to claim 11, wherein the multi-channel conflict graph generator determines all the links sharing the nodes to be links, each of which causes interference to a corresponding link.

14. The system according to claim 13, wherein the multi-channel conflict graph generator determines a specific link including a node selected from among two nodes sharing the link to be an interference link, such that the selected node can communicate with an external node via the other node.

15. The system according to claim 11, wherein the channel assignment unit includes:

a preferable channel extractor for determining a preferable channel from among the available channels for each node, and extracting the preferable channel from the available channels for each node;

a sub-graph generator for extracting a specific node capable of adapting the extracted preferable channel as a common preferable channel, and generating a sub-graph including only the node extracted from the multi-channel conflict graph;

a channel assignment processor for assigning priority for each sub-graph;

assigning a channel to the individual nodes contained in the sub-graph according to the assigned priority, deleting the channel-assigned node from other sub-graphs, and assigning the channel to the connection link among the nodes.

16. The system according to claim 15, wherein the priority is assigned in a descending numerical order of the number of nodes contained in the sub-graph.

17. The system according to claim 15, wherein the channel assignment unit indicates the same connection links on the sub-graph, selects a node having many more connection links from among the multi-channel conflict graph when two nodes are connected to each other, and assigns the channel to the selected node.