TY - GEN
T1 - A game theoretic approach to increase performance in multihop wireless mesh networks
AU - Backens, Jonathan
AU - Song, Min
PY - 2011
Y1 - 2011
N2 - Multihop wireless mesh networks have potential to meet the growing demand for flexible, self-organizing, large-scale wireless communication systems. However, these networks remain plagued by relatively poor performance compared to traditional infrastructure based networks. With variable number of nodes and diverse network densities, multihop wireless mesh networks can have low overall network capacity, poor internode fairness and high power consumption. Therefore, we present the decentralized Traffic Aware Iterative Water filling (TAIW) power allocation algorithm. TAIW applies techniques from non-cooperative game theory applied to cognitive radio devices to develop a solution that balances network capacity, node fairness and power consumption. Through extensive simulations we show the TAIW can increase inter-node fairness by 300% and reduce power consumption by 80% over current decentralized power allocation algorithms while maintaining near optimal network capacity.
AB - Multihop wireless mesh networks have potential to meet the growing demand for flexible, self-organizing, large-scale wireless communication systems. However, these networks remain plagued by relatively poor performance compared to traditional infrastructure based networks. With variable number of nodes and diverse network densities, multihop wireless mesh networks can have low overall network capacity, poor internode fairness and high power consumption. Therefore, we present the decentralized Traffic Aware Iterative Water filling (TAIW) power allocation algorithm. TAIW applies techniques from non-cooperative game theory applied to cognitive radio devices to develop a solution that balances network capacity, node fairness and power consumption. Through extensive simulations we show the TAIW can increase inter-node fairness by 300% and reduce power consumption by 80% over current decentralized power allocation algorithms while maintaining near optimal network capacity.
UR - http://www.scopus.com/inward/record.url?scp=84856140944&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84856140944&partnerID=8YFLogxK
U2 - 10.1109/MSN.2011.6
DO - 10.1109/MSN.2011.6
M3 - Conference contribution
AN - SCOPUS:84856140944
SN - 9780769546100
T3 - Proceedings - 2011 7th International Conference on Mobile Ad-hoc and Sensor Networks, MSN 2011
SP - 223
EP - 230
BT - Proceedings - 2011 7th International Conference on Mobile Ad-hoc and Sensor Networks, MSN 2011
T2 - 2011 7th International Conference on Mobile Ad-hoc and Sensor Networks, MSN 2011
Y2 - 16 December 2011 through 18 December 2011
ER -