Secure Adaptive Topology Control for Wireless Ad-Hoc Sensor Networks

This paper presents a secure decentralized clustering algorithm for wireless ad-hoc sensor networks. The algorithm operates without a centralized controller, operates asynchronously, and does not require that the location of the sensors be known a priori. Based on the cluster-based topology, secure hierarchical communication protocols and dynamic quarantine strategies are introduced to defend against spam attacks, since this type of attacks can exhaust the energy of sensor nodes and will shorten the lifetime of a sensor network drastically. By adjusting the threshold of infected percentage of the cluster coverage, our scheme can dynamically coordinate the proportion of the quarantine region and adaptively achieve the cluster control and the neighborhood control of attacks. Simulation results show that the proposed approach is feasible and cost effective for wireless sensor networks

Topology design and scheduling in STDMA based wireless ad hoc networks

Cataloged from PDF version of article.With current advances in technology, wireless networks are increasing in popularity. Wireless networks allow users the freedom to travel from one location to another without interruption of their communication activities. Ad hoc networks, a subset of wireless networks, allow the formation of a wireless network without the need for a base station. Since no fixed infrastructure is involved in the communication, the nodes of ad hoc networks can communicate with each other or can relay data to other nodes. With this flexibility, wireless ad hoc networks have the ability to form a network anywhere, at any time, as long as two or more wireless users are willing to communicate. Managing ad hoc networks is a significantly more difficult task than managing wireline networks. The network requirements should be met by combined efforts of all the mobile nodes themselves. The nodes of ad hoc networks often operate under severe constraints, such as limited battery power, variable link quality and limited shared bandwidth. In this study, the topology design issue in ad hoc wireless networks is investigated. We employ hierarchical routing where the network topology is composed of clusters interconnected via a root node. Cluster-based topologies are suitable for military services, an important application area for ad hoc networks. The common power control technique (COMPOW) is used in this thesis where all nodes transmit at the same power level. Nodes employ the spatial TDMA (STDMA) scheme in order to access the channel. An important task is how to produce a minimum STDMA frame length, and this problem is known to be NP complete. We develop a heuristic algorithm for generating the minimum STDMA frame length. A new interference model for ad hoc networks is proposed which utilizes a hypergraph model. The relationship between the frame length, number of clusters and the transmit power level are investigated through numerical examples using a 15- node network.Ergin, Sadettin AlpM.S

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

An evolutionary game theoretic approach for stable clustering in vehicular ad hoc networks (VANETs)

University of Technology Sydney. Faculty of Engineering and Information Technology.Finding and maintaining efficient routes for data dissemination in VANETs is a very challenging problem due to the highly dynamic characteristics of VANETs. Clustering in Vehicular Ad hoc Networks (VANETs) is one of the control schemes used to provide efficient and stable routes for data dissemination in VANETs. The rapid changes in the topology of VANETs have instigated frequent cluster formation and reorganization which has seriously affected route stability in Vehicular Ad hoc Networks. Considerable work has been reported into the development of clustering protocols while keeping in view the highly dynamic topology of VANETs, but the objective of imbuing the system with a stable underlay is still in the infant stage. The analytical models used for studying the behaviour of Vehicular Ad hoc Networks have been scarced due to distributed, highly dynamic and self-organizing characteristics of VANETs. In contrast, game theory is emerging as a novel analytical tool that can be used to tackle the technical challenges concerning the current and future problems in wireless and communication networks. A two-layer novel Evolutionary Game Theoretic (EGT) framework is presented to solve the problem of in-stable clustering in VANETs. The aim of this research is to model the interactions of vehicular nodes in VANETs, to retain a stable clustering state of the network with evolutionary equilibrium as the solution of this game. A stable clustering scenario in VANETs is modelled with a reinforcement learning approach to reach the solution of an evolutionary equilibrium. Performance of the proposed “evolutionary game based clustering algorithm” is empirically investigated in different cases and the simulation results show that the system retains cluster stability

An Overview of Mobile Ad Hoc Networks for the Existing Protocols and Applications

Mobile Ad Hoc Network (MANET) is a collection of two or more devices or nodes or terminals with wireless communications and networking capability that communicate with each other without the aid of any centralized administrator also the wireless nodes that can dynamically form a network to exchange information without using any existing fixed network infrastructure. And it's an autonomous system in which mobile hosts connected by wireless links are free to be dynamically and some time act as routers at the same time, and we discuss in this paper the distinct characteristics of traditional wired networks, including network configuration may change at any time, there is no direction or limit the movement and so on, and thus needed a new optional path Agreement (Routing Protocol) to identify nodes for these actions communicate with each other path, An ideal choice way the agreement should not only be able to find the right path, and the Ad Hoc Network must be able to adapt to changing network of this type at any time. and we talk in details in this paper all the information of Mobile Ad Hoc Network which include the History of ad hoc, wireless ad hoc, wireless mobile approaches and types of mobile ad Hoc networks, and then we present more than 13 types of the routing Ad Hoc Networks protocols have been proposed. In this paper, the more representative of routing protocols, analysis of individual characteristics and advantages and disadvantages to collate and compare, and present the all applications or the Possible Service of Ad Hoc Networks.Comment: 24 Pages, JGraph-Hoc Journa

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

Distributed Clustering in Cognitive Radio Ad Hoc Networks Using Soft-Constraint Affinity Propagation

Absence of network infrastructure and heterogeneous spectrum availability in cognitive radio ad hoc networks (CRAHNs) necessitate the self-organization of cognitive radio users (CRs) for efficient spectrum coordination. The cluster-based structure is known to be effective in both guaranteeing system performance and reducing communication overhead in variable network environment. In this paper, we propose a distributed clustering algorithm based on soft-constraint affinity propagation message passing model (DCSCAP). Without dependence on predefined common control channel (CCC), DCSCAP relies on the distributed message passing among CRs through their available channels, making the algorithm applicable for large scale networks. Different from original soft-constraint affinity propagation algorithm, the maximal iterations of message passing is controlled to a relatively small number to accommodate to the dynamic environment of CRAHNs. Based on the accumulated evidence for clustering from the message passing process, clusters are formed with the objective of grouping the CRs with similar spectrum availability into smaller number of clusters while guaranteeing at least one CCC in each cluster. Extensive simulation results demonstrate the preference of DCSCAP compared with existing algorithms in both efficiency and robustness of the clusters