Katakan tidak pada rasuah

Isu atau masalah rasuah menjadi topik utama sama ada di peringkat antarabangsa mahupun di peringkat dalam negara. Pertubuhan Bangsa- bangsa Bersatu menegaskan komitmen komuniti antarabangsa bertegas untuk mencegah dan mengawal rasuah melalui buku bertajuk United Nations Convention against Corruption. Hal yang sama berlaku di Malaysia. Melalui pernyataan visi oleh mantan Perdana Menteri Malaysia, Tun Dr. Mahathir bin Mohamed memberikan indikasi bahawa kerajaan Malaysia komited untuk mencapai aspirasi agar Malaysia dikenali kerana integriti dan bukannya rasuah. Justeru, tujuan penulisan bab ini adalah untuk membincangkan rasuah dari beberapa sudut termasuk perbincangan dari sudut agama Islam, faktor-faktor berlakunya gejala rasuah, dan usaha-usaha yang dijalankan di Malaysia untuk membanteras gejala rasuah. Perkara ini penting bagi mengenalpasti penjawat awam menanamkan keyakinan dalam melaksanakan tanggungjawab dengan menghindari diri daripada rasuah agar mereka sentiasa peka mengutamakan kepentingan awam

Energy-aware peering routing protocol for indoor hospital body area network communication

The recent research in Body Area Networks (BAN) is focused on making its communication more reliable, energy efficient, secure, and to better utilize system resources. In this paper we propose a novel BAN network architecture for indoor hospital environments, and a new mechanism of peer discovery with routing table construction that helps to reduce network traffic load, energy consumption, and improves BAN reliability. We have performed extensive simulations in the Castalia simulation environment to show that our proposed protocol has better performance in terms of reduced BAN traffic load, increased number of successful packets received by nodes, reduced number of packets forwarded by intermediate nodes, and overall lower energy consumption compared to other protocols

Combined Coverage Area Reporting and Geographical Routing in Wireless Sensor-Actuator Networks for Cooperating with Unmanned Aerial Vehicles

In wireless sensor network (WSN) applications with multiple gateways, it is key to route location dependent subscriptions efficiently at two levels in the system. At the gateway level, data sinks must not waste the energy of the WSN by injecting subscriptions that are not relevant for the nodes in their coverage area and at WSN level, energy-efficient delivery of subscriptions to target areas is required. In this paper, we propose a mechanism in which (1) the WSN provides an accurate and up-to-date coverage area description to gateways and (2) the wireless sensor network re-uses the collected coverage area information to enable efficient geographical routing of location dependent subscriptions and other messages. The latter has a focus on routing of messages injected from sink nodes to nodes in the region of interest. Our proposed mechanisms are evaluated in simulation

An Energy Efficient, Load Balancing, and Reliable Routing Protocol for Wireless Sensor Networks

AN ENERGY EFFICIENT, LOAD BALANCING, AND RELIABLE ROUTING PROTOCOL FOR WIRELESS SENSOR NETWORKS by Kamil Samara The University of Wisconsin-Milwaukee, 2016 Under the Supervision of Professor Hossein Hosseini The Internet of Things (IoT) is shaping the future of Computer Networks and Computing in general, and it is gaining ground very rapidly. The whole idea has originated from the pervasive presence of a variety of things or objects equipped with the internet connectivity. These devices are becoming cheap and ubiquitous, at the same time more powerful and smaller with a variety of onboard sensors. All these factors with the availability of unique addressing, provided by the IPv6, has made these devices capable of collaborating with each other to accomplish common tasks. Mobile AdHoc Networks (MANETS) and Wireless Sensor Networks (WSN) in particular play a major role in the backbone of IoT. Routing in Wireless Sensor Networks (WSN) has been a challenging task for researchers in the last several years because the conventional routing algorithms, such as the ones used in IP-based networks, are not well suited for WSNs because these conventional routing algorithms heavily rely on large routing tables that need to be updated periodically. The size of a WSN could range from hundreds to tens of thousands of nodes, which will make routing tables’ size very large. Managing large routing tables is not feasible in WSNs due to the limitations of resources. The directed diffusion algorithm is a well-known routing algorithm for Wireless Sensor Networks (WSNs). The directed diffusion algorithm saves energy by sending data packets hop by hop and by enforcing paths to avoid flooding. The directed diffusion algorithm does not attempt to find the best or healthier paths (healthier paths are paths that use less total energy than others and avoid critical nodes). Hence the directed diffusion algorithm could be improved by enforcing the use of healthier paths, which will result in less power consumption. We propose an efficient routing protocol for WSNs that gives preference to the healthier paths based on the criteria of the total energy available on the path, the path length, and the avoidance of critical nodes. This preference is achieved by collecting information about the available paths and then using non-incremental machine learning to enforce path(s) that meet our criteria. In addition to preferring healthier paths, our protocol provides Quality of Service (QoS) features through the implementation of differentiated services, where packets are classified as critical, urgent, and normal, as defined later in this work. Based on this classification, different packets are assigned different priority and resources. This process results in higher reliability for the delivery of data, and shorter delivery delay for the urgent and critical packets. This research includes the implementation of our protocol using a Castalia Simulator. Our simulation compares the performance of our protocol with that of the directed diffusion algorithm. The comparison was made on the following aspects: • Energy consumption • Reliable delivery • Load balancing • Network lifetime • Quality of service Simulation results did not point out a significant difference in performance between the proposed protocol and the directed diffusion algorithm in smaller networks. However, when the network’s size started to increase the results showed better performance by the proposed protocol

Car-Park Management using Wireless Sensor Networks

A complete wireless sensor network solution for car-park management is presented in this paper. The system architecture and design are first detailed, followed by a description of the current working implementation, which is based on our DSYS25z sensing nodes. Results of a series of real experimental tests regarding connectivity, sensing and network performance are then discussed. The analysis of link characteristics in the car park scenario shows unexpected reliability patterns which have a strong influence on MAC and routing protocol design. Two unexpected link reliability patterns are identified and documented. First, the presence of the objects (cars) being sensed can cause significant interference and degradation in communication performance. Second, link quality has a high temporal correlation but a low spatial correlation. From these observations we conclude that a) the construction and maintenance of a fixed topology is not useful and b) spatial rather than temporal message replicates can improve transport reliability

Approach to minimizing consumption of energy in wireless sensor networks

The Wireless Sensor Networks (WSN) technology has benefited from a central position in the research space of future emerging networks by its diversity of applications fields and also by its optimization techniques of its various constraints, more essentially, the minimization of nodal energy consumption to increase the global network lifetime. To answer this saving energy problem, several solutions have been proposed at the protocol stack level of the WSN. In this paper, after presenting a state of the art of this technology and its conservation energy techniques at the protocol stack level, we were interested in the network layer to propose a routing solution based on a localization aspect that allows the creation of a virtual grid on the coverage area and introduces it to the two most well-known energy efficiency hierarchical routing protocols, LEACH and PEGASIS. This allowed us to minimize the energy consumption and to select the clusters heads in a deterministic way unlike LEACH which is done in a probabilistic way and also to minimize the latency in PEGASIS, by decomposing its chain into several independent chains. The simulation results, under "MATLABR2015b", have shown the efficiency of our approach in terms of overall residual energy and network lifetime