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 Comparitive Study On Location based Multicast Routing Protocols of WSN: HGMR, HRPM, GMR

Wireless sensor network comprises of a set of sensor nodes that communicate among each other using wireless links and work in an open and distributed manner due to which wireless sensor networks are highly prone to attacks. This is difficult to determine the position of the sensor nodes; therefore the sensor network protocols must inculcate self-organizing competence. Location awareness is one of the important concern in WSN because for a network mostly data collection is grounded on location, so this is imperative for all the nodes to know their position whenever it is required and it is also helpful in calculating the distance between two particular nodes to deal with energy consumption issues. This paper focuses on the three location based routing multicast protocols: HGMR, HRMP, GMR and their comparison is done on the basis of different metrics like latency, PDP, encoding overhead etc

A Survey of Routing Issues and Associated Protocols in Underwater Wireless Sensor Networks

Underwater Wireless Sensor Network is newly emerging wireless technology in which small size sensors with limited energy, limited memory and bandwidth are deployed in deep sea water and various monitoring operation like tactical surveillance, environmental monitoring and data collection are performed through these tiny sensor. Underwater Wireless Sensor Network is used for exploration of underwater resources, oceanographic data collection, flood or disaster prevention, tactical surveillance system and unmanned underwater vehicles. Sensor node consist of small memory, central processing unit and antenna. Underwater network is much different from terrestrial sensor network as radio waves cannot be used in Underwater Wireless Sensor Network. Acoustic channels are used for communication in deep sea water. Acoustic Signals carries with itself many limitation. Such as Limited bandwidth, higher end to end delay, network path loss, higher propagation delay and dynamic topology. Usually these limitation results in higher energy consumption with less number of packets delivered. The main aim now a days is to operate sensor node having smaller battery for a longer time in network. This survey has discussed the state of the art Localization based and Localization free routing protocols. Routing associated issues in the area of Underwater Wireless Sensor Network has also been discussed

Selecting source image sensor nodes based on 2-hop information to improve image transmissions to mobile robot sinks in search \& rescue operations

We consider Robot-assisted Search $\&$ Rescue operations enhanced with some fixed image sensor nodes capable of capturing and sending visual information to a robot sink. In order to increase the performance of image transfer from image sensor nodes to the robot sinks we propose a 2-hop neighborhood information-based cover set selection to determine the most relevant image sensor nodes to activate. Then, in order to be consistent with our proposed approach, a multi-path extension of Greedy Perimeter Stateless Routing (called T-GPSR) wherein routing decisions are also based on 2-hop neighborhood information is proposed. Simulation results show that our proposal reduces packet losses, enabling fast packet delivery and higher visual quality of received images at the robot sink