2,602 research outputs found
Cross-layer optimizations in multi-hop ad hoc networks
Unlike traditional wireless networks, characterized by the presence of last-mile, static and
reliable infrastructures, Mobile ad Hoc Networks (MANETs) are dynamically formed by
collections of mobile and static terminals that exchange data by enabling each other's
communication. Supporting multi-hop communication in a MANET is a challenging
research area because it requires cooperation between different protocol layers (MAC,
routing, transport). In particular, MAC and routing protocols could be considered
mutually cooperative protocol layers. When a route is established, the exposed and
hidden terminal problems at MAC layer may decrease the end-to-end performance
proportionally with the length of each route. Conversely, the contention at MAC layer
may cause a routing protocol to respond by initiating new routes queries and routing table
updates.
Multi-hop communication may also benefit the presence of pseudo-centralized virtual
infrastructures obtained by grouping nodes into clusters. Clustering structures may
facilitate the spatial reuse of resources by increasing the system capacity: at the same
time, the clustering hierarchy may be used to coordinate transmissions events inside the
network and to support intra-cluster routing schemes. Again, MAC and clustering
protocols could be considered mutually cooperative protocol layers: the clustering
scheme could support MAC layer coordination among nodes, by shifting the distributed
MAC paradigm towards a pseudo-centralized MAC paradigm. On the other hand, the
system benefits of the clustering scheme could be emphasized by the pseudo-centralized
MAC layer with the support for differentiated access priorities and controlled contention.
In this thesis, we propose cross-layer solutions involving joint design of MAC, clustering
and routing protocols in MANETs.
As main contribution, we study and analyze the integration of MAC and clustering
schemes to support multi-hop communication in large-scale ad hoc networks. A novel
clustering protocol, named Availability Clustering (AC), is defined under general nodes'
heterogeneity assumptions in terms of connectivity, available energy and relative
mobility. On this basis, we design and analyze a distributed and adaptive MAC protocol,
named Differentiated Distributed Coordination Function (DDCF), whose focus is to
implement adaptive access differentiation based on the node roles, which have been
assigned by the upper-layer's clustering scheme. We extensively simulate the proposed
clustering scheme by showing its effectiveness in dominating the network dynamics,
under some stressing mobility models and different mobility rates. Based on these results,
we propose a possible application of the cross-layer MAC+Clustering scheme to support
the fast propagation of alert messages in a vehicular environment.
At the same time, we investigate the integration of MAC and routing protocols in large
scale multi-hop ad-hoc networks. A novel multipath routing scheme is proposed, by
extending the AOMDV protocol with a novel load-balancing approach to concurrently
distribute the traffic among the multiple paths. We also study the composition effect of a
IEEE 802.11-based enhanced MAC forwarding mechanism called Fast Forward (FF),
used to reduce the effects of self-contention among frames at the MAC layer. The
protocol framework is modelled and extensively simulated for a large set of metrics and
scenarios.
For both the schemes, the simulation results reveal the benefits of the cross-layer
MAC+routing and MAC+clustering approaches over single-layer solutions
Mengenal pasti masalah pemahaman dan hubungannya dengan latar belakang matematik, gaya pembelajaran, motivasi dan minat pelajar terhadap bab pengawalan kos makanan di Sekolah Menengah Teknik (ert) Rembau: satu kajian kes.
Kajian ini dijalankan untuk mengkaji hubungan korelasi antara latar belakang Matematik, gaya pembelajaran, motivasi dan minat dengan pemahaman pelajar terhadap bab tersebut. Responden adalah seramai 30 orang iaitu terdiri daripada pelajar tingkatan lima kursus Katering, Sekolah Menengah Teknik (ERT) Rembau, Negeri Sembilan. Instrumen kajian adalah soal selidik dan semua data dianalisis menggunakan program SPSS versi 10.0 untuk mendapatkan nilai min dan nilai korelasi bagi memenuhi objektif yang telah ditetapkan. Hasil kajian ini menunjukkan bahawa hubungan korelasi antara gaya pembelajaran pelajar terhadap pemahaman pelajar adalah kuat. Manakala hubungan korelasi antara latar belakang Matematik, motivasi dan minat terhadap pemahaman pelajar adalah sederhana. Nilai tahap min bagi masalah pemahaman pelajar, latar belakang Matematik, gaya pembelajaran, motivasi dan minat terhadap bab Pengawalan Kos Makanan adalah sederhana. Kajian ini mencadangkan penghasilan satu Modul Pembelajaran Kendiri bagi bab Pengawalan Kos Makanan untuk membantu pelajar kursus Katering dalam proses pembelajaran mereka
Secure and robust multi-constrained QoS aware routing algorithm for VANETs
Secure QoS routing algorithms are a fundamental part of wireless networks that aim to provide services with QoS and security guarantees. In Vehicular Ad hoc Networks (VANETs), vehicles perform routing functions, and at the same time act as end-systems thus routing control messages are transmitted unprotected over wireless channels. The QoS of the entire network could be degraded by an attack on the routing process, and manipulation of the routing control messages. In this paper, we propose a novel secure and reliable multi-constrained QoS aware routing algorithm for VANETs. We employ the Ant Colony Optimisation (ACO) technique to compute feasible routes in VANETs subject to multiple QoS constraints determined by the data traffic type. Moreover, we extend the VANET-oriented Evolving Graph (VoEG) model to perform plausibility checks on the exchanged routing control messages among vehicles. Simulation results show that the QoS can be guaranteed while applying security mechanisms to ensure a reliable and robust routing service
Routing schemes in FANETs: a survey
Flying ad hoc network (FANET) is a self-organizing wireless network that enables inexpensive, flexible, and easy-to-deploy flying nodes, such as unmanned aerial vehicles (UAVs), to communicate among themselves in the absence of fixed network infrastructure. FANET is one of the emerging networks that has an extensive range of next-generation applications. Hence, FANET plays a significant role in achieving application-based goals. Routing enables the flying nodes to collaborate and coordinate among themselves and to establish routes to radio access infrastructure, particularly FANET base station (BS). With a longer route lifetime, the effects of link disconnections and network partitions reduce. Routing must cater to two main characteristics of FANETs that reduce the route lifetime. Firstly, the collaboration nature requires the flying nodes to exchange messages and to coordinate among themselves, causing high energy consumption. Secondly, the mobility pattern of the flying nodes is highly dynamic in a three-dimensional space and they may be spaced far apart, causing link disconnection. In this paper, we present a comprehensive survey of the limited research work of routing schemes in FANETs. Different aspects, including objectives, challenges, routing metrics, characteristics, and performance measures, are covered. Furthermore, we present open issues
A Comparative Survey of VANET Clustering Techniques
© 2016 Crown. A vehicular ad hoc network (VANET) is a mobile ad hoc network in which network nodes are vehicles - most commonly road vehicles. VANETs present a unique range of challenges and opportunities for routing protocols due to the semi-organized nature of vehicular movements subject to the constraints of road geometry and rules, and the obstacles which limit physical connectivity in urban environments. In particular, the problems of routing protocol reliability and scalability across large urban VANETs are currently the subject of intense research. Clustering can be used to improve routing scalability and reliability in VANETs, as it results in the distributed formation of hierarchical network structures by grouping vehicles together based on correlated spatial distribution and relative velocity. In addition to the benefits to routing, these groups can serve as the foundation for accident or congestion detection, information dissemination and entertainment applications. This paper explores the design choices made in the development of clustering algorithms targeted at VANETs. It presents a taxonomy of the techniques applied to solve the problems of cluster head election, cluster affiliation, and cluster management, and identifies new directions and recent trends in the design of these algorithms. Additionally, methodologies for validating clustering performance are reviewed, and a key shortcoming - the lack of realistic vehicular channel modeling - is identified. The importance of a rigorous and standardized performance evaluation regime utilizing realistic vehicular channel models is demonstrated
- …