Download Now Free registration required
The fast, organic growth of wireless networks has created a challenging problem: "How to distribute radio spectrum among network nodes on-demand while avoiding harmful interference?" This spectrum distribution problem differs from conventional channel allocation problems because the amount of spectrum assigned to each network node is often unknown and must be determined during the optimization. Solving this problem is an integral part of emerging spectrum related applications including dynamic spectrum auctions and management. The majority of existing proposals take an indirect approach: first simplify physical interference conditions into a set of pair-wise constraints (or the graph interference model), then distribute spectrum on top of them (or the graph model).
- Format: PDF
- Size: 268.6 KB