Application of rasch model on resilience in higher education: an examination of validity and reliability of Malaysian academician happiness index (MAHI)

This preliminary study was conducted to examine and verify the validity and reliability of the instrument on the Malaysian Academician Happiness Index (MAHI) on resilience. MAHI could be seen as a tool to measure the level of happiness and stress of academicians before determining how resilient the academicians were. Resilience can be defined as a mental ability of a person to recover quickly from illness or depression. MAHI instrument consisted of 66 items. The instrument was distributed to 40 academicians from three groups of universities which were the Focus University, Comprehensive University and Research University is using a survey technique. The instrument was developed to measure three main constructs which were the organization, individual and social that would affect the happiness and stress levels of academicians. This preliminary study employed the Rasch Measurement Model uses Winsteps software version 3.69.1.11. to examine the validity and reliability of the items. The results of the analysis of the MAHI instrument showed that the item reliability was 0.87, person reliability was 0.83 and value of Alpha Cronbach was 0.84. Meanwhile, misfit analysis showed that only there was one item with 1.46 logit that could be considered for dropping or needed improvement. Therefore, it highlighted that most of the items met the constructs’ need and can be used as a measurement indicator of MAHI. The implication of this instrument can help Malaysian academicians to be more resilient in facing challenges in the future

Deep Predictive Coding Neural Network for RF Anomaly Detection in Wireless Networks

Intrusion detection has become one of the most critical tasks in a wireless network to prevent service outages that can take long to fix. The sheer variety of anomalous events necessitates adopting cognitive anomaly detection methods instead of the traditional signature-based detection techniques. This paper proposes an anomaly detection methodology for wireless systems that is based on monitoring and analyzing radio frequency (RF) spectrum activities. Our detection technique leverages an existing solution for the video prediction problem, and uses it on image sequences generated from monitoring the wireless spectrum. The deep predictive coding network is trained with images corresponding to the normal behavior of the system, and whenever there is an anomaly, its detection is triggered by the deviation between the actual and predicted behavior. For our analysis, we use the images generated from the time-frequency spectrograms and spectral correlation functions of the received RF signal. We test our technique on a dataset which contains anomalies such as jamming, chirping of transmitters, spectrum hijacking, and node failure, and evaluate its performance using standard classifier metrics: detection ratio, and false alarm rate. Simulation results demonstrate that the proposed methodology effectively detects many unforeseen anomalous events in real time. We discuss the applications, which encompass industrial IoT, autonomous vehicle control and mission-critical communications services.Comment: 7 pages, 7 figures, Communications Workshop ICC'1

Routing, Localization And Positioning Protocols For Wireless Sensor And Actor Networks

Wireless sensor and actor networks (WSANs) are distributed systems of sensor nodes and actors that are interconnected over the wireless medium. Sensor nodes collect information about the physical world and transmit the data to actors by using one-hop or multi-hop communications. Actors collect information from the sensor nodes, process the information, take decisions and react to the events. This dissertation presents contributions to the methods of routing, localization and positioning in WSANs for practical applications. We first propose a routing protocol with service differentiation for WSANs with stationary nodes. In this setting, we also adapt a sports ranking algorithm to dynamically prioritize the events in the environment depending on the collected data. We extend this routing protocol for an application, in which sensor nodes float in a river to gather observations and actors are deployed at accessible points on the coastline. We develop a method with locally acting adaptive overlay network formation to organize the network with actor areas and to collect data by using locality-preserving communication. We also present a multi-hop localization approach for enriching the information collected from the river with the estimated locations of mobile sensor nodes without using positioning adapters. As an extension to this application, we model the movements of sensor nodes by a subsurface meandering current mobility model with random surface motion. Then we adapt the introduced routing and network organization methods to model a complete primate monitoring system. A novel spatial cut-off preferential attachment model and iii center of mass concept are developed according to the characteristics of the primate groups. We also present a role determination algorithm for primates, which uses the collection of spatial-temporal relationships. We apply a similar approach to human social networks to tackle the problem of automatic generation and organization of social networks by analyzing and assessing interaction data. The introduced routing and localization protocols in this dissertation are also extended with a novel three dimensional actor positioning strategy inspired by the molecular geometry. Extensive simulations are conducted in OPNET simulation tool for the performance evaluation of the proposed protocol

Path Loss Determination Using Linear and Cubic Regression Inside a Classic Tomato Greenhouse

The production of tomatoes in greenhouses, in addition to its relevance in nutrition and health, is an activity of the agroindustry with high economic importance in Spain, the first exporter in Europe of this vegetable. The technological updating with precision agriculture, implemented in order to ensure adequate production, leads to a deployment planning of wireless sensors with limited coverage by the attenuation of radio waves in the presence of vegetation. The well-known propagation models FSPL (Free-Space Path Loss), two-ray, COST235,Weissberger, ITU-R (International Telecommunications Union—Radiocommunication Sector), FITU-R (Fitted ITU-R), offer values with an error percentage higher than 30% in the 2.4 GHz band in relation to those measured in field tests. As a substantial improvement, we have developed optimized propagation models, with an error estimate of less than 9% in the worst-case scenario for the later benefit of farmers, consumers and the economic chain in the production of tomatoes.This research received fund by the Ibero-American Postgraduate University Association (AUIP)

Adding the reliability on tree based topology construction algorithms for wireless sensor networks

Topology control is a technique used in wireless sensor networks to maximize energy efficiency and network lifetime. In previous literature, many tree based techniques have been proposed to save energy and increase the network lifetime. In tree based algorithms, the most promising solution is the formation of a network backbone, which serves on behalf of rest of the nodes in the network and therefore leading towards Connected Dominating Set (CDS) formulation. However, one imminent problem with all tree based solution is a compromise on network reliability. Therefore, to address reliability issues in tree based solutions, in this paper, we propose Poly3 which maintains cliques of size three in order to achieve network reliability on top of the CDS algorithm. This makes the network more robust to link removal. Our empirical and mathematical analysis reveals that Poly3 provides better reliability than algorithms of the same kind

Energy efficient scheme to Jointly Optimize Coverage and Connectivity in Large Scale Wireless Sensor Network

Efficient coverage and connectivity are two important factors that ensures better service quality especially during tracking targets or monitoring events in wireless sensor network. Although massive amount of studies has been carried out in the past to enhance coverage and connectivity issues, till date very few studies have witnessed a significant and standard outcomes that can opt further. Hence, this paper introduces a computationally efficient technique for jointly addressing both coverage and connectivity problems in large-scale wireless sensor network that ensures optimal network lifetime too. The proposed system has been empirically designed, and algorithms formulated to ensure energy efficient monitoring of event. The outcomes of the study are compared with standard energy efficient hierarchical protocol to benchmark the results

Array communications in wireless sensor networks

Imperial Users onl

Survey of Deployment Algorithms in Wireless Sensor Networks: Coverage and Connectivity Issues and Challenges

International audienceWireless Sensor Networks (WSNs) have many fields of application, including industrial, environmental, military, health and home domains. Monitoring a given zone is one of the main goals of this technology. This consists in deploying sensor nodes in order to detect any event occurring in the zone of interest considered and report this event to the sink. The monitoring task can vary depending on the application domain concerned. In the industrial domain, the fast and easy deployment of wireless sensor nodes allows a better monitoring of the area of interest in temporary worksites. This deployment must be able to cope with obstacles and be energy efficient in order to maximize the network lifetime. If the deployment is made after a disaster, it will operate in an unfriendly environment that is discovered dynamically. We present a survey that focuses on two major issues in WSNs: coverage and connectivity. We motivate our study by giving different use cases corresponding to different coverage, connectivity, latency and robustness requirements of the applications considered. We present a general and detailed analysis of deployment problems, while highlighting the impacting factors, the common assumptions and models adopted in the literature, as well as performance criteria for evaluation purposes. Different deployment algorithms for area, barrier, and points of interest are studied and classified according to their characteristics and properties. Several recapitulative tables illustrate and summarize our study. The designer in charge of setting up such a network will find some useful recommendations, as well as some pitfalls to avoid. Before concluding, we look at current trends and discuss some open issues