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

Distributed Service Discovery for Heterogeneous Wireless Sensor Networks

Service discovery in heterogeneous Wireless Sensor Networks is a challenging research objective, due to the inherent limitations of sensor nodes and their extensive and dense deployment. The protocols proposed for ad hoc networks are too heavy for sensor environments. This paper presents a resourceaware solution for the service discovery problem, which exploits the heterogeneous nature of the sensor network and alleviates the high-density problem from the flood-based approaches. The idea is to organize nodes into clusters, based on the available resources and the dynamics of nodes. The clusterhead nodes act as a distributed directory of service registrations. Service discovery messages are exchanged among the nodes in the distributed directory. The simulation results show the performance of the service discovery protocol in heterogeneous dense environments

Machine Learning in Wireless Sensor Networks: Algorithms, Strategies, and Applications

Wireless sensor networks monitor dynamic environments that change rapidly over time. This dynamic behavior is either caused by external factors or initiated by the system designers themselves. To adapt to such conditions, sensor networks often adopt machine learning techniques to eliminate the need for unnecessary redesign. Machine learning also inspires many practical solutions that maximize resource utilization and prolong the lifespan of the network. In this paper, we present an extensive literature review over the period 2002-2013 of machine learning methods that were used to address common issues in wireless sensor networks (WSNs). The advantages and disadvantages of each proposed algorithm are evaluated against the corresponding problem. We also provide a comparative guide to aid WSN designers in developing suitable machine learning solutions for their specific application challenges.Comment: Accepted for publication in IEEE Communications Surveys and Tutorial

EFFICIENT E-MRZT ALGORITHM BASED TREE CONSTRUCTION TECHNIQUE FOR ZIGBEE MOBILE WIRELESS NETWORKS

In Wireless Personal Area Networks (WPANs), the Zigbee protocol/IEEE 802.15.4 standard is a protocol specification for low range, less cost and low power systems. The Zigbee network is usually constructed using cluster trees for the purpose of performing data delivery among nodes and for power saving. Here the data delivery failures occur due to node mobility. In order to handle node movements so as to increase data delivery we use mobility-robust tree construction technique with clustering mechanism. In this paper we propose an E-MRZT (Extended MRZT) algorithm. We collect information about regularity of mobility patterns and by using this history, perform data delivery. We employ a clustering mechanism in our network to obtain a set of cluster trees; each with a specific mobility pattern. The entire setup is developed and simulated by using NS2 network simulator. The result is that we obtain mobility-robust tree with a considerable increase in data delivery

Security and Privacy Issues in Wireless Mesh Networks: A Survey

This book chapter identifies various security threats in wireless mesh network (WMN). Keeping in mind the critical requirement of security and user privacy in WMNs, this chapter provides a comprehensive overview of various possible attacks on different layers of the communication protocol stack for WMNs and their corresponding defense mechanisms. First, it identifies the security vulnerabilities in the physical, link, network, transport, application layers. Furthermore, various possible attacks on the key management protocols, user authentication and access control protocols, and user privacy preservation protocols are presented. After enumerating various possible attacks, the chapter provides a detailed discussion on various existing security mechanisms and protocols to defend against and wherever possible prevent the possible attacks. Comparative analyses are also presented on the security schemes with regards to the cryptographic schemes used, key management strategies deployed, use of any trusted third party, computation and communication overhead involved etc. The chapter then presents a brief discussion on various trust management approaches for WMNs since trust and reputation-based schemes are increasingly becoming popular for enforcing security in wireless networks. A number of open problems in security and privacy issues for WMNs are subsequently discussed before the chapter is finally concluded.Comment: 62 pages, 12 figures, 6 tables. This chapter is an extension of the author's previous submission in arXiv submission: arXiv:1102.1226. There are some text overlaps with the previous submissio

Identified the Cluster Based Stretch and Shrink Method Based On Load Balancing Algorithm for Ad Hoc Network Topology Stability

No Abstrac

Routing in mobile Ad Hoc Networks

A Mobile Ad Hoc Network (MANET) is built on the fly where a number of wireless mobile nodes work in cooperation without the engagement of any centralized access point or any fixed infrastructure. Two nodes in such a network can communicate in a bidirectional manner if and only if the distance between them is at most the minimum of their transmission ranges. When a node wants to communicate with a node outside its transmission range, a multihop routing strategy is used which involves some intermediate nodes. Because of the movements of nodes, there is a constant possibility of topology change in MANET. Considering this unique aspect of MANET, a number of routing protocols have been proposed so far. This chapter gives an overview of the past, current, and future research areas for routing in MANET. In this chapter we will learn about the following things: - The preliminaries of mobile ad hoc network - The challenges for routing in MANET - Expected properties of a MANET routing protocol - Categories of routing protocols for MANET - Major routing protocols for MANET - Criteria for performance comparison of the routing protocols for MANET - Achievements and future research directions - Expectations and realit

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