Supporting Protocols for Structuring and Intelligent Information Dissemination in Vehicular Ad Hoc Networks

The goal of this dissertation is the presentation of supporting protocols for structuring and intelligent data dissemination in vehicular ad hoc networks (VANETs). The protocols are intended to first introduce a structure in VANETs, and thus promote the spatial reuse of network resources. Segmenting a flat VANET in multiple cluster structures allows for more efficient use of the available bandwidth, which can effectively increase the capacity of the network. The cluster structures can also improve the scalability of the underlying communication protocols. The structuring and maintenance of the network introduces additional overhead. The aim is to provide a mechanism for creating stable cluster structures in VANETs, and to minimize this associated overhead. Further a hybrid overlay-based geocast protocol for VANETs is presented. The protocol utilizes a backbone overlay virtual infrastructure on top of the physical network to provide geocast support, which is crucial for intervehicle communications since many applications provide group-oriented and location-oriented services. The final contribution is a structureless information dissemination scheme which creates a layered view of road conditions with a diminishing resolution as the viewing distance increases. Namely, the scheme first provides a high-detail local view of a given vehicle\u27s neighbors and its immediate neighbors, which is further extended when information dissemination is employed. Each vehicle gets aggregated information for road conditions beyond this extended local view. The scheme allows for the preservation of unique reports within aggregated frames, such that safety critical notifications are kept in high detail, all for the benefit of the driver\u27s improved decision making during emergency scenarios

Minimum-cost multicast over coded packet networks

We consider the problem of establishing minimum-cost multicast connections over coded packet networks, i.e., packet networks where the contents of outgoing packets are arbitrary, causal functions of the contents of received packets. We consider both wireline and wireless packet networks as well as both static multicast (where membership of the multicast group remains constant for the duration of the connection) and dynamic multicast (where membership of the multicast group changes in time, with nodes joining and leaving the group). For static multicast, we reduce the problem to a polynomial-time solvable optimization problem, and we present decentralized algorithms for solving it. These algorithms, when coupled with existing decentralized schemes for constructing network codes, yield a fully decentralized approach for achieving minimum-cost multicast. By contrast, establishing minimum-cost static multicast connections over routed packet networks is a very difficult problem even using centralized computation, except in the special cases of unicast and broadcast connections. For dynamic multicast, we reduce the problem to a dynamic programming problem and apply the theory of dynamic programming to suggest how it may be solved

Structured Peer-to-Peer Overlay Deployment on MANET: A Survey

There are many common characteristics between Peer-to-Peer (P2P) overlay networks and Mobile Ad-hoc Networks (MANET). Self-organization, decentralization, dynamicity and changing topology are the most shared features. Furthermore, when used together, the two approaches complement each other. P2P overlays provide data storage/retrieval functionality, and their routing information can complement that of MANET. MANET provides wireless connectivity between clients without depending on any pre-existing infrastructure. The aim of this paper is to survey current P2P over MANET systems. Specifically, this paper focuses on and investigates structured P2P over MANET. Overall, more than thirty distinct approaches have been classified into groups and introduced in tables providing a structured overview of the area. The survey addresses the identified approaches in terms of P2P systems, MANET underlay systems and the performance of the reviewed systems

Mesh based and Hybrid Multicast routing protocols for MANETs: Current State of the art

This paper discusses various multicast routing protocols which are proposed in the recent past each having its own unique characteristic, with a motive of providing a complete understanding of these multicast routing protocols and present the scope of future research in this field. Further, the paper specifically discusses the current development in the development of mesh based and hybrid multicasting routing protocols. The study of this paper addresses the solution of most difficult task in Multicast routing protocols for MANETs under host mobility which causes multi-hop routing which is even more severe with bandwidth limitations. The Multicast routing plays a substantial part in MANETs

Recent Multicast Routing Protocols in VANET: Classification and Comparison

الشبكة المخصصة للسيارات (VANET) صنفت باعتبارها واحدة من أهم فئات شبكات الجيل التالي التي طورت في السنوات الأخيرة بسرعة بالنسبة للمركبات وعمليات نقل الطرق. هذه الشبكه يمكن أن تساعد في تنفيذ مجموعة كبيرة من التطبيقات المتعلقة بالمركبات، اشارة المرور، ازدحام المرور، السائقين، الركاب، الإسعاف، الشرطة، سيارات الإطفاء وحتى المشاة. التوجيه هو المشكلة الأبرز في نقل المعلومات في الـ VANET وهناك العديد من وسائط النشر: البث الاحادي، البث المتعدد و البحث في منطقه جغرافيه معينه (geocast). في هذه المقاله سوف نركز فقط على الإرسال المتعدد الذي يشير إلى عملية إرسال معلومات من عقدة واحدة (تسمى المركبة المصدر) إلى مجموعة من العقد الموجودة في مواقع مختلفة (تسمى المركبات الهدف). والغرض من هذه المقالة هو دراسة بروتوكولات توجيه الإرسال المتعدد الموجودة في الـ VANET وإنتاج دراسه جيد عنها وتحديد مزايا وعيوب كل منها وكذلك تصنيفها إلى فئات مختلفة استنادا إلى بعض العوامل المؤثرة مثل نوعية الخدمة، مسار المركبة وما إلى ذلك. وبعد تحليل بروتوكولات التوجيه هذه وجدنا أن هناك حاجة ملحة لإنتاج بروتوكول توجيه متعدد الإرسال فعال لهذه الشبكة لتقليل استهلاك الموارد وتحسين الأداء العام.Vehicular Ad Hoc Network (VANET) classified as one of the most important classes of next generation networks that developed in recent years rapidly for vehicles and road transmissions. It can help in implementing a large set of applications related to vehicles, traffic light, traffic jam, drivers, passengers, ambulance, police, fire trucks and even pedestrians. Routing is the most prominent problem in the transmission of information in VANETs and there are many modes of dissemination: unicast, broadcast, multicast and geocast. In this paper, we will focus only on the multicast that is referring to a process of sending information from one node (called source vehicle) to a group of nodes that found in different locations (called destination vehicles). The purpose of this paper is to study the existing multicast routing protocols in VANET and produce good survey about them and determine the advantages and disadvantages of each one as well as classify them into different categories based on some effected parameters such as quality of service, vehicle trajectory and etc. After analyzing these routing protocols we concluded that there is persistent need to produce efficient multicast routing protocol in this network to decrease the resource consumption and improve the overall performance

Usability of legacy p2p multicast in multihop ad hoc networks: an experimental study

There has recently been an increasing interest in convergence of p2p and ad hoc network research. Actually, p2p systems and multihop ad hoc networks share similar features, such as self-organisation, decentralisation, self-healing, and so forth. It is thus interesting to understand if p2p systems designed for the wired Internet are suitable also for ad hoc networks and, if they are not, in which direction they should be improved. In this paper, we report our experience in running p2p applications in real multihop ad hoc network testbeds. Specifically, we used group-communication applications that require p2p systems made up of an overlay network and a p2p multicast protocol. In this paper, we present experimental results specifically related to the performance of a well-known p2p shared-tree multicast protocol (Scribe). Our results show that such a solution is far from being efficient on ad hoc networks. We emphasize that the structured multicast approach is one of the main causes of inefficiency, and suggest that stateless solutions could be preferable