Data-Gathering and Aggregation Protocol for Networked Carrier Ad Hoc Networks: The Optimal and Heuristic Approach

In this chapter, we address the problem of data-gathering and aggregation (DGA) in navigation carrier ad hoc networks (NC-NET), in order to reduce energy consumption and enhance network scalability and lifetime. Several clustering algorithms have been presented for vehicle ad hoc network (VANET) and other mobile ad hoc network (MANET). However, DGA approach in harsh environments, in terms of long-range transmission, high dynamic topology and three-dimensional monitor region, is still an open issue. In this chapter, we propose a novel clustering-based DGA approach, namely, distributed multiple-weight data-gathering and aggregation (DMDG) protocol, to guarantee quality of service (QoS)-aware DGA for heterogeneous services in above harsh environments. Our approach is explored by the synthesis of three kernel features. First, the network model is addressed according to specific conditions of networked carrier ad hoc networks (NC-NET), and several performance indicators are selected. Second, a distributed multiple-weight data-gathering and aggregation protocol (DMDG) is proposed, which contains all-sided active clustering scheme and realizes long-range real-time communication by tactical data link under a time-division multiple access/carrier sense multiple access (TDMA/CSMA) channel sharing mechanism. Third, an analytical paradigm facilitating the most appropriate choice of the next relay is proposed. Experimental results have shown that DMDG scheme can balance the energy consumption and extend the network lifetime notably and outperform LEACH, PEACH and DEEC in terms of network lifetime and coverage rate, especially in sparse node density or anisotropic topologies

An ACO Algorithm for Effective Cluster Head Selection

This paper presents an effective algorithm for selecting cluster heads in mobile ad hoc networks using ant colony optimization. A cluster in an ad hoc network consists of a cluster head and cluster members which are at one hop away from the cluster head. The cluster head allocates the resources to its cluster members. Clustering in MANET is done to reduce the communication overhead and thereby increase the network performance. A MANET can have many clusters in it. This paper presents an algorithm which is a combination of the four main clustering schemes- the ID based clustering, connectivity based, probability based and the weighted approach. An Ant colony optimization based approach is used to minimize the number of clusters in MANET. This can also be considered as a minimum dominating set problem in graph theory. The algorithm considers various parameters like the number of nodes, the transmission range etc. Experimental results show that the proposed algorithm is an effective methodology for finding out the minimum number of cluster heads.Comment: 7 pages, 5 figures, International Journal of Advances in Information Technology (JAIT); ISSN: 1798-2340; Academy Publishers, Finlan

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

Clustering and Hybrid Routing in Mobile Ad Hoc Networks

This dissertation focuses on clustering and hybrid routing in Mobile Ad Hoc Networks (MANET). Specifically, we study two different network-layer virtual infrastructures proposed for MANET: the explicit cluster infrastructure and the implicit zone infrastructure. In the first part of the dissertation, we propose a novel clustering scheme based on a number of properties of diameter-2 graphs to provide a general-purpose virtual infrastructure for MANET. Compared to virtual infrastructures with central nodes, our virtual infrastructure is more symmetric and stable, but still light-weight. In our clustering scheme, cluster initialization naturally blends into cluster maintenance, showing the unity between these two operations. We call our algorithm tree-based since cluster merge and split operations are performed based on a spanning tree maintained at some specific nodes. Extensive simulation results have shown the effectiveness of our clustering scheme when compared to other schemes proposed in the literature. In the second part of the dissertation, we propose TZRP (Two-Zone Routing Protocol) as a hybrid routing framework that can balance the tradeoffs between pure proactive, fuzzy proactive, and reactive routing approaches more effectively in a wide range of network conditions. In TZRP, each node maintains two zones: a Crisp Zone for proactive routing and efficient bordercasting, and a Fuzzy Zone for heuristic routing using imprecise locality information. The perimeter of the Crisp Zone is the boundary between pure proactive routing and fuzzy proactive routing, and the perimeter of the Fuzzy Zone is the boundary between proactive routing and reactive routing. By adjusting the sizes of these two zones, a reduced total routing control overhead can be achieved