TY - GEN
T1 - Achieving Fairness by Using Dynamic Fragmentation and Buffer Size in Multihop Wireless Networks
AU - Hoblos, Jalaa
N1 - Publisher Copyright:
© 2019, ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering.
PY - 2019
Y1 - 2019
N2 - Wireless Networks are error-prone due to multiple physical changes including fading, noise, path loss and interferences. As a result, the channel efficiency can be severely degraded. In addition, in saturated multihop wireless networks, nodes with multiple hops away from the destination suffer additional throughput degradation signified by high collisions resulting in high packet loss. It has been shown that packets fragmentation and buffer size play an important role in improving performance. In this work, we propose a technique to dynamically estimate appropriate buffer size and fragmentation threshold for individual nodes across the network in reference of their locality from the gateway and on their traffic load. The results show that nodes far from the gateway incur significantly higher throughput. The technique also results in better fairness across all nodes. Furthermore, it enhances the total network throughput while lowering the end to end and MAC delays.
AB - Wireless Networks are error-prone due to multiple physical changes including fading, noise, path loss and interferences. As a result, the channel efficiency can be severely degraded. In addition, in saturated multihop wireless networks, nodes with multiple hops away from the destination suffer additional throughput degradation signified by high collisions resulting in high packet loss. It has been shown that packets fragmentation and buffer size play an important role in improving performance. In this work, we propose a technique to dynamically estimate appropriate buffer size and fragmentation threshold for individual nodes across the network in reference of their locality from the gateway and on their traffic load. The results show that nodes far from the gateway incur significantly higher throughput. The technique also results in better fairness across all nodes. Furthermore, it enhances the total network throughput while lowering the end to end and MAC delays.
UR - http://www.scopus.com/inward/record.url?scp=85070621722&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85070621722&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-23943-5_12
DO - 10.1007/978-3-030-23943-5_12
M3 - Conference contribution
AN - SCOPUS:85070621722
SN - 9783030239428
T3 - Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST
SP - 164
EP - 177
BT - Emerging Technologies in Computing - 2nd International Conference, iCETiC 2019, Proceedings
A2 - Miraz, Mahdi H.
A2 - Excell, Peter S.
A2 - Ware, Andrew
A2 - Soomro, Safeeullah
A2 - Ali, Maaruf
PB - Springer Verlag
T2 - 2nd International Conference on Emerging Technologies in Computing, iCETiC 2019
Y2 - 19 August 2019 through 20 August 2019
ER -