In Intelligent Transportation Systems (ITS), disseminating warning messages in a timely and efficient way through wireless short-range communications can save many lives and reduce traffic congestion. A geographical broadcast protocol provides data delivery to specified geographical areas, using multi-hop communications if needed. Among the main challenges for such protocols are forwarder selection and the reduction of the number of hops required to reach and cover the destination area. In this thesis we propose an efficient geographical broadcast protocol called Preferred and Contention Based Forwarding (PCBF) and evaluate it through simulations. PCBF uses a combination of contention-based forwarding and selecting preferred forwarders also found in other protocols like Emergency Message Dissemination for Vehicular Environments (EMDV). Since the preferred forwarder is allowed to immediately forward the packet (evading contention among other potential forwarders), this approach reduces end-to-end delays. Notable extensions of PCBF compared to EMDV are the use of direct negative acknowledgements in case of unnecessary rebroadcasts and the use of forwarders outside the target region. Our simulation results show that the PCBF protocol outperforms selected other protocols in terms of end-to-end delay, re-broadcast overhead and reliability in both sparse and dense networks.
| Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:hh-23982 |
| Date | January 2013 |
| Creators | Rajendran, Rajapandiyan |
| Publisher | Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE) |
| Source Sets | DiVA Archive at Upsalla University |
| Language | English |
| Detected Language | English |
| Type | Student thesis, info:eu-repo/semantics/bachelorThesis, text |
| Format | application/pdf |
| Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.0017 seconds