Name
Abstract | ||
|---|---|---|
Achieving fair and optimal data rates in wireless networks is an area of continued research. Distributed algorithms have been developed directly from mathematical optimization problems that guarantee fair and optimal rates. However, the algorithms developed thus far are based on simplified models of wireless networks. This research presents a first-principles model of wireless networks that reduces to the classical models under certain limiting conditions. The model uses random sets to represent the times during which a channel is perceived to be utilized. Although the resulting optimization problem is non-convex, its solution can be derived offline to offer insight into situations where the classical models succeed or fail. We provide the framework for a branch and bound solution to this offline problem. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/CDC.2011.6161235 | 2011 50TH IEEE CONFERENCE ON DECISION AND CONTROL AND EUROPEAN CONTROL CONFERENCE (CDC-ECC) |
Keywords | Field | DocType |
first principle,mathematical model,wireless networks,optimization,silicon,distributed algorithm,wireless network,branch and bound,optimization problem,interference,sensors | Wireless network,Branch and bound,Mathematical optimization,Radio networks,Computer science,Communication channel,Distributed algorithm,Interference (wave propagation),Optimization problem,Limiting,Distributed computing | Conference |
ISSN | Citations | PageRank |
0743-1546 | 0 | 0.34 |
References | Authors | |
10 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| David Ripplinger | 1 | 13 | 1.89 |
| Sean Warnick | 2 | 198 | 25.76 |
| Daniel Zappala | 3 | 309 | 26.66 |