Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
Modeling the 802.11 distributed coordination function in nonsaturated heterogeneous conditions
IEEE/ACM Transactions on Networking (TON)
A general model of wireless interference
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
New insights from a fixed-point analysis of single cell IEEE 802.11 WLANs
IEEE/ACM Transactions on Networking (TON)
Numerical analysis of IEEE 802.11 broadcast scheme in multihop wireless ad hoc networks
ICOIN'05 Proceedings of the 2005 international conference on Information Networking: convergence in broadband and mobile networking
DGPS-Based Vehicle-to-Vehicle Cooperative Collision Warning: Engineering Feasibility Viewpoints
IEEE Transactions on Intelligent Transportation Systems
Performance analysis of the IEEE 802.11 distributed coordination function
IEEE Journal on Selected Areas in Communications
Reliable and secure broadcast communication over resource constrained systems
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
EURASIP Journal on Wireless Communications and Networking - Special issue on advances in quality and performance assessment for future wireless communication services
Hi-index | 0.00 |
Broadcast communication plays a critical role in ad hoc networks especially vehicular communication where a large number of applications are being envisioned to use the broadcast services of IEEE 802.11p. These safety applications exchange messages at very low rates compared to voice and streaming applications but have very stringent latency requirements. The broadcast packets undergoing collision are not retransmitted as the source cannot detect collisions, hence, obtaining the collision probability is critical for the success of applications relying on broadcast communication. In this paper, we initially assume our nodes to be bufferless and model them using a two-state Markov Chain to obtain the collision probability. We then extend our model for finite buffers to study the system under higher data traffic loads.