Suriyadeepan R

Independent Researcher

About

I am an Independent Researcher interested in Artificial Intelligence, Natural Language Processing and Cognitive Architectures. I have degrees from Pondicherry Engineering College and BITS Pilani. During my time at BITS Pilani Goa Campus, I worked in Wireless Sensor Networks. My current research focuses on Dialogue systems based on Sequence to Sequence Learning, Deep Reinforcement Learning and Memory Networks.

Streaming multimedia data in WSN is a challenge due to constraints such as bandwidth, energy and delay. Moreover, it is not economical to have multimedia sensors integrated with static nodes in the field. In this paper, we propose the use of mobile sensor nodes, which are equipped with multimedia sensors for event monitoring. These mobile entities are capable of streaming high bandwidth data by splitting it and routing the packet to the base station using Frequency Division Multiplexer (FDM) modules. This is done with the support of multi-channel disjoint path routing aided with the static WSN deployed. Experiments were done using MicaZ and TelosB motes to evaluate the performance with the help of our custom designed robotic vehicle. The paper adopts a node disjoint multi-path routing protocol for establishing parallel paths between the sender and the receiver. Experimental results indicate that the proposed approach can be effectively used for transferring high bandwidth data to the base station.

Area exploration in WSN is used for a multitude of applications from data collection to network maintenance. In this paper, we propose a new approach - Max-Gain approach to explore an area with obstacles by modifying the utility function of frontier-based approach. The proposed approach moves the mobile nodes to a distant unexplored optimal position rather than directing it to a near frontier. The main focus of this paper is the fast area exploration using mobile nodes. We extend this approach to recover partitions in a disconnected network and hence restore connectivity. The results indicate that our approach guarantees fast area exploration with minimum communication overhead. Proposed area exploration approach is not limited to wireless sensor networks, but to any area exploration applications using mobile units.

Connectivity restoration in Wireless Sensor Network (WSN) is a common problem and several solutions has been proposed in the literature. Reasons for partition include initial random deployment, node failure due to low battery life, hardware malfunction etc. This paper focuses on partition discovery and hence restoring connectivity in a segmented network using Mobile Relay (MR) nodes. We propose a hybrid of frontier-based and random-direction exploration approaches for detecting partitions in a given area. An approximation algorithm for Steiner point based minimum spanning tree is adopted to determine the topology for connecting the discovered partition. Optimal assignment of mobile relays in this topology is visualized as a Bottleneck Assignment Problem (BAP). Our approach guarantees use of minimum number of MR nodes to be placed in minimum time. Experimental results indicate that the proposed approach can be effectively used for connectivity restoration in a partitioned network.