Open AccessModelling collision alleviating DCF protocol with finite retry limits
Author(s) -
Madhavi T.,
Bhushana Rao G. Sasi
Publication year - 2015
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
eISSN - 1350-911X
pISSN - 0013-5194
DOI - 10.1049/el.2014.2113
Subject(s) - computer science , computer network , distributed coordination function , network packet , wireless ad hoc network , wireless network , throughput , transmission delay , transmission (telecommunications) , collision , multiple access with collision avoidance for wireless , ieee 802.11 , wireless , distributed computing , optimized link state routing protocol , routing protocol , telecommunications , computer security
IEEE 802.11‐based wireless ad hoc networks are well suited for critical scenarios such as rescue operations during natural calamities, military applications on battle fields and so on where the existing infrastructure fails. In these networks, since nodes have limited battery power, the reduction in packet collision is very important, otherwise the nodes have to spend more energy for packet transmission. In these wireless networks, the packet transmission procedure plays a pivotal role in performance. Several packet transmission procedures represented with Markov chain models have been suggested by the authors to improve the network performance. However, these procedures have not been suitable for dense networks due to the high collision rate. A new packet transmission procedure for the IEEE 802.11 distributed coordination function (DCF) protocol is proposed to reduce the number of collisions and enhance the throughput of wireless networks. A mathematical framework is carried out for transmission probability and performance analysis is presented showing that the new procedure greatly enhances the network performance and as a result can be applied in the design and performance optimisation of wireless network protocols.