Survey on Data-Centric based Routing Protocols for Wireless Sensor Networks

The great concern for energy that grew with the technological advances in the field of networks and especially in sensor network has triggered various approaches and protocols that relate to sensor networks. In this context, the routing protocols were of great interest. The aim of the present paper is to discuss routing protocols for sensor networks. This paper will focus mainly on the discussion of the data-centric approach (COUGAR, rumor, SPIN, flooding and Gossiping), while shedding light on the other approaches occasionally. The functions of the nodes will be discussed as well. The methodology selected for this paper is based on a close description and discussion of the protocol. As a conclusion, open research questions and limitations are proposed to the reader at the end of this paper

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

Proactive Highly Ambulatory Sensor Routing (PHASeR) protocol for mobile wireless sensor networks

This paper presents a novel multihop routing protocol for mobile wireless sensor networks called PHASeR (Proactive Highly Ambulatory Sensor Routing). The proposed protocol uses a simple hop-count metric to enable the dynamic and robust routing of data towards the sink in mobile environments. It is motivated by the application of radiation mapping by unmanned vehicles, which requires the reliable and timely delivery of regular measurements to the sink. PHASeR maintains a gradient metric in mobile environments by using a global TDMA MAC layer. It also uses the technique of blind forwarding to pass messages through the network in a multipath manner. PHASeR is analysed mathematically based on packet delivery ratio, average packet delay, throughput and overhead. It is then simulated with varying mobility, scalability and traffic loads. The protocol gives good results over all measures, which suggests that it may also be suitable for a wider array of emerging applications

On Mobility Management in Multi-Sink Sensor Networks for Geocasting of Queries

In order to efficiently deal with location dependent messages in multi-sink wireless sensor networks (WSNs), it is key that the network informs sinks what geographical area is covered by which sink. The sinks are then able to efficiently route messages which are only valid in particular regions of the deployment. In our previous work (see the 5th and 6th cited documents), we proposed a combined coverage area reporting and geographical routing protocol for location dependent messages, for example, queries that are injected by sinks. In this paper, we study the case where we have static sinks and mobile sensor nodes in the network. To provide up-to-date coverage areas to sinks, we focus on handling node mobility in the network. We discuss what is a better method for updating the routing structure (i.e., routing trees and coverage areas) to handle mobility efficiently: periodic global updates initiated from sinks or local updates triggered by mobile sensors. Simulation results show that local updating perform very well in terms of query delivery ratio. Local updating has a better scalability to increasing network size. It is also more energy efficient than ourpreviously proposed approach, where global updating in networks have medium mobility rate and speed

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