DocumentCode :
2604355
Title :
On a new edge coloring related to multihop wireless networks
Author :
Tamura, Hiroshi ; Watanabe, Kaoru ; Sengoku, Masakazu ; Shinoda, Shoji
Author_Institution :
Niigata Inst. of Technol., Kashiwazaki, Japan
Volume :
2
fYear :
2002
fDate :
2002
Firstpage :
357
Abstract :
Multihop wireless networks consist of mobile terminals with personal communication devices. Each terminal can receive a message from a terminal and send it to the other terminal. In this paper, we discuss a new edge coloring problem in terms of graph and network theory on multihop wireless networks. This edge coloring problem takes the degree of interference into consideration. Then, we discuss this problem in terms of computational complexity.
Keywords :
channel allocation; cochannel interference; communication complexity; graph colouring; mobile communication; personal communication networks; channel assignment; cochannel interference; computational complexity; degree of interference; edge coloring problem; graph theory; message reception; mobile terminals; multihop wireless networks; network theory; personal communication devices; Communications technology; Computational complexity; Electronic mail; Interchannel interference; Mobile communication; Network theory (graphs); Personal communication networks; Relays; Spread spectrum communication; Wireless networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Circuits and Systems, 2002. APCCAS '02. 2002 Asia-Pacific Conference on
Print_ISBN :
0-7803-7690-0
Type :
conf
DOI :
10.1109/APCCAS.2002.1115259
Filename :
1115259
Link To Document :
بازگشت