Title
Hypergraph T-coloring for automatic frequency planning problem in wireless LAN
Abstract
Abstract—Frequency,assignment,is one of the main,issues in radio networks,planning. The multiple interferences are seldom taken into account,in literature. There is not a framework,with their modeling. A hypergraph,modeling,of the network,gives a more,realistic representation,of this phenomenon. We generalize the T-coloring problem,for graphs,to hyper- graphs. We apply this new,modeling,to IEEE 802.11b/g wireless networks,and study its interest.
Year
DOI
Venue
2008
10.1109/PIMRC.2008.4699726
Cannes
Keywords
Field
DocType
telecommunication network planning,wireless LAN,802.11 wireless networks,automatic frequency planning problem,hypergraph T-coloring,multiple interferences,wireless LAN
Wireless network,Wireless,Computer science,Constraint graph,Signal-to-noise ratio,Hypergraph,Quality of service,Computer network,Interference (wave propagation),Frequency assignment
Conference
ISBN
Citations 
PageRank 
978-1-4244-2644-7
2
0.41
References 
Authors
15
4
Name
Order
Citations
PageRank
Alexandre Gondran1123.28
Oumaya Baala25911.09
Hakim Mabed310014.07
Alexandre Caminada410723.61