An energy efficient interference-aware routing protocol for underwater WSNs

Interference-aware routing protocol design for underwater wireless sensor networks (UWSNs) is one of the key strategies in reducing packet loss in the highly hostile underwater environment. The reduced interference causes efficient utilization of the limited battery power of the sensor nodes that, in consequence, prolongs the entire network lifetime. In this paper, we propose an energy-efficient interference-aware routing (EEIAR) protocol for UWSNs. A sender node selects the best relay node in its neighborhood with the lowest depth and the least number of neighbors. Combination of the two routing metrics ensures that data packets are forwarded along the least interference paths to reach the final destination. The proposed work is unique in that it does not require the full dimensional localization information of sensor nodes and the network total depth is segmented to identify source, relay and neighbor nodes. Simulation results reveal better performance of the scheme than the counterparts DBR and EEDBR techniques in terms of energy efficiency, packet delivery ratio and end-to-end delay

RESOURCE AND ENVIRONMENT AWARE SENSOR COMMUNICATIONS: FRAMEWORK, OPTIMIZATION, AND APPLICATIONS

Recent advances in low power integrated circuit devices, micro-electro-mechanical system (MEMS) technologies, and communications technologies have made possible the deployment of low-cost, low power sensors that can be integrated to form wireless sensor networks (WSN). These wireless sensor networks have vast important applications, i.e.: from battlefield surveillance system to modern highway and industry monitoring system; from the emergency rescue system to early forest fire detection and the very sophisticated earthquake early detection system. Having the broad range of applications, the sensor network is becoming an integral part of human lives. However, the success of sensor networks deployment depends on the reliability of the network itself. There are many challenging problems to make the deployed network more reliable. These problems include but not limited to extending network lifetime, increasing each sensor node throughput, efficient collection of information, enforcing nodes to collaboratively accomplish certain network tasks, etc. One important aspect in designing the algorithm is that the algorithm should be completely distributed and scalable. This aspect has posed a tremendous challenge in designing optimal algorithm in sensor networks. This thesis addresses various challenging issues encountered in wireless sensor networks. The most important characteristic in sensor networks is to prolong the network lifetime. However, due to the stringent energy requirement, the network requires highly energy efficient resource allocation. This highly energy-efficient resource allocation requires the application of an energy awareness system. In fact, we envision a broader resource and environment aware optimization in the sensor networks. This framework reconfigures the parameters from different communication layers according to its environment and resource. We first investigate the application of online reinforcement learning in solving the modulation and transmit power selection. We analyze the effectiveness of the learning algorithm by comparing the effective good throughput that is successfully delivered per unit energy as a metric. This metric shows how efficient the energy usage in sensor communication is. In many practical sensor scenarios, maximizing the energy efficient in a single sensor node may not be sufficient. Therefore, we continue to work on the routing problem to maximize the number of delivered packet before the network becomes useless. The useless network is characterized by the disintegrated remaining network. We design a class of energy efficient routing algorithms that explicitly takes the connectivity condition of the remaining network in to account. We also present the distributed asynchronous routing implementation based on reinforcement learning algorithm. This work can be viewed as distributed connectivity-aware energy efficient routing. We then explore the advantages obtained by doing cooperative routing for network lifetime maximization. We propose a power allocation in the cooperative routing called the maximum lifetime power allocation. The proposed allocation takes into account the residual energy in the nodes when doing the cooperation. In fact, our criterion lets the nodes with more energy to help more compared to the nodes with less energy. We continue to look at the problem of cooperation enforcement in ad-hoc network. We show that by combining the repeated game and self learning algorithm, a better cooperation point can be obtained. Finally, we demonstrate an example of channel-aware application for multimedia communication. In all case studies, we employ optimization scheme that is equipped with the resource and environment awareness. We hope that the proposed resource and environment aware optimization framework will serve as the first step towards the realization of intelligent sensor communications

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

A Review of the Energy Efficient and Secure Multicast Routing Protocols for Mobile Ad hoc Networks

This paper presents a thorough survey of recent work addressing energy efficient multicast routing protocols and secure multicast routing protocols in Mobile Ad hoc Networks (MANETs). There are so many issues and solutions which witness the need of energy management and security in ad hoc wireless networks. The objective of a multicast routing protocol for MANETs is to support the propagation of data from a sender to all the receivers of a multicast group while trying to use the available bandwidth efficiently in the presence of frequent topology changes. Multicasting can improve the efficiency of the wireless link when sending multiple copies of messages by exploiting the inherent broadcast property of wireless transmission. Secure multicast routing plays a significant role in MANETs. However, offering energy efficient and secure multicast routing is a difficult and challenging task. In recent years, various multicast routing protocols have been proposed for MANETs. These protocols have distinguishing features and use different mechanismsComment: 15 page

Analyzing Energy-efficiency and Route-selection of Multi-level Hierarchal Routing Protocols in WSNs

The advent and development in the field of Wireless Sensor Networks (WSNs) in recent years has seen the growth of extremely small and low-cost sensors that possess sensing, signal processing and wireless communication capabilities. These sensors can be expended at a much lower cost and are capable of detecting conditions such as temperature, sound, security or any other system. A good protocol design should be able to scale well both in energy heterogeneous and homogeneous environment, meet the demands of different application scenarios and guarantee reliability. On this basis, we have compared six different protocols of different scenarios which are presenting their own schemes of energy minimizing, clustering and route selection in order to have more effective communication. This research is motivated to have an insight that which of the under consideration protocols suit well in which application and can be a guide-line for the design of a more robust and efficient protocol. MATLAB simulations are performed to analyze and compare the performance of LEACH, multi-level hierarchal LEACH and multihop LEACH.Comment: NGWMN with 7th IEEE Inter- national Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA 2012), Victoria, Canada, 201

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

Autonomous service composition in symbiotic networks

Part 2: PhD Workshop: Autonomic Network and Service ManagementInternational audienceTo cope with the ever-growing number of wired and wireless networks, we introduce the notion of so-called symbiotic networks. These networks seamlessly operate across layers and over network boundaries, resulting in improved scalability, dependability, and energy efficiency. This particular Ph.D. research focuses on software services operating in such symbiotic networks. When two or more networks merge, the services provided on them may be combined into a service composition that is much more than the sum of its parts. Driven by two distinct use cases, we aim to enable fully autonomous service composition and resource provisioning. For the first use case, an in-building over-the-top service platform, we describe a software architecture and a set of generic resource provisioning algorithms. The second use case, which focuses on wireless body area networks, will allow us to expand our research domain into highly dynamic symbiotic network environments, where services appear and disappear more frequently