TY - GEN
T1 - Throughput-oriented MAC for mobile ad hoc networks with variable packet sizes
AU - Wang, Fan
AU - Younis, Ossama
AU - Krunz, Marwan
PY - 2006
Y1 - 2006
N2 - Improving the network throughput is a primary objective in mobile ad hoc networks (MANETs), which is motivated by the over-conservative nature of the 802.11 standard. Transmission power control (TPC) was proposed for improving spatial reuse and reducing energy consumption in MANETs. Previous TPC protocols either incur extra hardware cost (e.g., require multiple transceivers) or do not fully exploit the potential of power control. In this work, we propose distributed, single-channel MAC protocols for MANETs that exploit TPC and account for different packet sizes in the system to further maximize spatial reuse. We model channel contention in the network as a non-cooperative game. Multiple potential transmitters are first involved in an admission phase which enables terminals to compute the transmission powers that achieve a Nash equilibrium (NE) for a given utility function. Subsequently, successful contenders in the same neighborhood can simultaneously proceed with their transmissions. Simulation results show that our protocols significantly improve the network throughput (in terms of transmitted bits/second or the number of admitted contenders) over previously proposed schemes. Our results also indicate that these gains do not require additional energy cost.
AB - Improving the network throughput is a primary objective in mobile ad hoc networks (MANETs), which is motivated by the over-conservative nature of the 802.11 standard. Transmission power control (TPC) was proposed for improving spatial reuse and reducing energy consumption in MANETs. Previous TPC protocols either incur extra hardware cost (e.g., require multiple transceivers) or do not fully exploit the potential of power control. In this work, we propose distributed, single-channel MAC protocols for MANETs that exploit TPC and account for different packet sizes in the system to further maximize spatial reuse. We model channel contention in the network as a non-cooperative game. Multiple potential transmitters are first involved in an admission phase which enables terminals to compute the transmission powers that achieve a Nash equilibrium (NE) for a given utility function. Subsequently, successful contenders in the same neighborhood can simultaneously proceed with their transmissions. Simulation results show that our protocols significantly improve the network throughput (in terms of transmitted bits/second or the number of admitted contenders) over previously proposed schemes. Our results also indicate that these gains do not require additional energy cost.
UR - http://www.scopus.com/inward/record.url?scp=44049093286&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=44049093286&partnerID=8YFLogxK
U2 - 10.1109/SAHCN.2006.288498
DO - 10.1109/SAHCN.2006.288498
M3 - Conference contribution
AN - SCOPUS:44049093286
SN - 1424406269
SN - 9781424406265
T3 - 2006 3rd Annual IEEE Communications Society on Sensor and Adhoc Communications and Networks, Secon 2006
SP - 421
EP - 430
BT - 2006 3rd Annual IEEE Communications Society on Sensor and Adhoc Communications and Networks, Secon 2006
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2006 3rd Annual IEEE Communications Society on Sensor and Ad hoc Communications and Networks, Secon 2006
Y2 - 25 September 2006 through 28 September 2006
ER -