scholarly journals Channel assignment in dense MC-MR wireless networks: Scaling laws and algorithms

2013 ◽  
Author(s):  
Rahul Urgaonkar ◽  
Ram Ramanathan ◽  
Jason Redi ◽  
William N. Tetteh
Keyword(s):  
Wireless Networks ◽  
Channel Assignment ◽  
Scaling Laws

A CHANNEL ASSIGNMENT PROBLEM IN MULTIHOP WIRELESS NETWORKS AND GRAPH THEORY

2004 ◽  
Vol 13 (02) ◽  
pp. 375-385 ◽  
Author(s):  
HIROSHI TAMURA ◽  
KAORU WATANABE ◽  
MASAKAZU SENGOKU ◽  
SHOJI SHINODA
Keyword(s):  
Wireless Networks ◽  
Graph Theory ◽  
Channel Assignment ◽  
Assignment Problem ◽  
Edge Coloring ◽  
Multihop Wireless Networks ◽  
Personal Communication ◽  
Multihop Wireless ◽  
Coloring Problem ◽  
Communication Devices

Multihop wireless networks consist of mobile terminals with personal communication devices. Each terminal can receive a message and then send it to another terminal. In these networks, it is important to assign channels for communications to each terminal efficiently. There are some studies on this assignment problem using a conventional edge coloring in graph theory. In this paper, we propose a new edge coloring problem in graph and network theory on this assignment problem and we discuss the computational complexity of the problem. This edge coloring problem takes the degree of interference into consideration. Therefore, we can reuse the channels more efficiently compared with the conventional method.

Sign in / Sign up

Export Citation Format

Share Document