Dr. T. S. B. Sudarshan completed his Ph. D. in Techniques to Enhance Web Performance in Fixed Networks and Mobile Networks from BITS, Pilani in 2007 under the guidance of Dr. G. Raghurama. He did his M. E.(Systems) in Design Of Systolic Array Parallel Processing System for Multidimensional Discrete Fourier Transform from Birla Instituite of Technology, Mesra in 1993. Before joining Amrita, Dr. T. S. B. Sudarshan worked as Group Leader (HoD), CS & IS Group , BITS, Pilani, India.



Professional Activity


  • FACE (Forum for Aspiring Computer Engineers) 2010-present

Professional Bodies

  • Member, IEEE, USA (90490092) Valid through 31 Dec 2010
  • Member, ACM, USA (2974519) Valid till 31 Aug 2014
  • Member, ACM SIGBED
  • Member, VLSI Society of India
  • Life Member, ISTE, India (LM14894)
  • Member, International Association of Engineers (IAENG), USA.
  • Fellow Member, Association of Computer Electronics and Electrical Engineers (ACEEE) (7000083)


  • Member, Technical Program Committee, International Workshop on Advances in Peer-to-Peer Technology  (IWAP2PT’09), Bangalore, Dec 9-11, 2009.
  • Technical Chair, International Conference on Advances in Communication, Network and Computing (CNC 2010),  Calicut, Kerala, Sep 22-24, 2010.
  • Member, Technical Program Committee, Student Research Symposium, International Conference on High Performance Computing (HiPC 2009), Kochi, Dec 16-19 2009.
  • Organising Co-Chair, EEE International Conference on Advances in Recent Technologies in Communication and Computing, (ARTCom 2009), Kottayam, Kerala, Oct 27-28, 2009
  • Advisory Member, Workshop on Introduction to Graph and Geometric Algorithms in collaboration with TIFR, Mumbai, 22-24 January 2009, BITS, Pilani.
  • Member, Technical Committee, National Conference on Computer Networks, Reva ITM, Bangalore, 20-21 February 2009
  • Member, International Technical Advisory Board, International Congress on Pervasive Computing and Management, New Delhi, 12-14 December 2008.
  • Conference Co-chair, National Conference on High Performance Technologies, AITS, Rajkot, Gujarat, 22nd November, 2008
  • Member, International Technical Advisory Board, International Congress on Pervasive Computing and Management, New Delhi, 12-14 December 2008.
  • Member, Program Committee, International Joint Journal Conference in Engineering 2009, April 2009
  • Member, Technical Committee, National Conference on Computer Networks, Reva ITM, Bangalore, 20-21 February 2009.




  • Integration, The VLSI Journal, Elsevier (as a crypto-hardware expert)
  • International Journal of Secure Digital Information Age (IJSDIA)


  • Reviewer, International Workshop on Advances in Peer-to-Peer Technology  (IWAP2PT’09), Bangalore, Dec 9-11, 2009.
  • Reviewer, IEEE International Conference on Advances in Recent Technologies in Communication and Computing, (ARTCom 2009), Kottayam, Kerala, Oct 27-28, 2009
  • Reviewer, IEEE Region 10 Colloquium and Third International Conference on Industrial and Information Systems (ICIIS 2008) Dec 8-10, 2008, IIT Kharagpur, India
  • Reviewer, 12th  IEEE VLSI Design & Test Symposium,, (VDAT 2008) July 23-26, 2008, Bangalore, India.
  • Reviewer, 2007 IEEE International Conference on Advanced Computing & Communications, (ADCOM 2007) Dec 18-21, 2007, IIT, Gawahati.
  • Reviewer, 11th  IEEE VLSI Design & Test Symposium,, (VDAT) Aug 8-11, 2007, Kolkata, India.
  • Reviewer, 2007 IEEE International Symposium on Circuits and Systems, (ISCAS 2007) May 27-30, 2007, New Orleans, USA.
  • Reviewer, 4th IEEE International Conference on Information Technology: New Generations, (ITNG 2007)April 2-4, 2007, Las Vegas, USA
  • Reviewer, 10th IEEE VLSI  Design & Test Symposium, Aug 9-12, 2006, Goa, India.
  • Reviewer, International Conf. on Embedded Systems, Mobile Commn. & Computing Aug 4-5, 2006, Bangalore, India.

Industry Links

  • Member, Technical Advisory Board, Cradle Technologies, USA. (2002-2004)   (Application Development on Multi-Core DSP Platform)
  • Research Scholar, Nokia Research Inc., Boston (2001-2004)

Institute Activities

  • Group Leader (Head), Computer Science & Information Systems (CS & IS) Group, BITS Pilani, (from 16th April 2008 to 18th July 2009)
  • Founder Professor-in-charge, BITS ACM Student Chapter (2008)
  • PhD Admissions Coordinator, Admissions Division (2007-2008)
  • Nucleus Member, Admissions & Placement Unit (2000 - 2006)
  • Member, PhD Qualifying Examination Committee (2001- present)
  • Member, Intensive Teaching Workshop for newly recruited faculty members (2006, 2007)
  • Coordinator, Research Seminars in Computer Science & Information Systems Group (2006-2008)
  • Member, Library Committee (2004, 2006)
  • Web Administrator, CS & IS Group (2006)


Publication Type: Conference Paper
Year of Publication Publication Type Title
2015 Conference Paper M. Rajesh, Jose, G. R., and T.S.B. Sudarshan, “Multi robot exploration and mapping using frontier cell concept”, in 11th IEEE India Conference: Emerging Trends and Innovation in Technology, INDICON 2014, 2015.[Abstract]

In this work, a new technique is developed for exploration and map building in multiple mobile robots. This proposed technique uses the concept of frontier cells. This system tries to extend the existing exploration and mapping techniques of single robot to multi-robot to increase the exploration efficiency (i.e. to reduce the environment exploration time required). The goal of the proposed mechanism is to design and develop an efficient multi-robot exploration scheme which will explore a given unknown area in the shortest time possible while coordinating their actions and sharing their local maps in certain time instances. In this technique, each robot tries to localize itself and identify the cell in which it is located. Based on a probabilistic model, it selects a frontier cell to be its next target cell, which is not already explored by other robots. Once the robot reaches the new target cell, it updates the status of the cell as explored and shares this information with all other robots. © 2014 IEEE.

More »»
2015 Conference Paper I. Mamatha, Raj, J. N., Tripathi, S., and T.S.B. Sudarshan, “Systolic architecture implementation of 1D DFT and 1D DCT”, in 2015 IEEE International Conference on Signal Processing, Informatics, Communication and Energy Systems, SPICES 2015, 2015.[Abstract]

Discrete Fourier Transform is widely used in signal processing for spectral analysis, filtering, image enhancement, OFDM etc. Cyclic convolution based approach is one of the techniques used for computing DFT. Using this approach an N point DFT can be computed using four pairs of [(M-1)/2]-point cyclic convolution where M is an odd number and N=4M. This work proposes an architecture for convolution based DFT and its FPGA implementation. Proposed architecture comprises of a pre-processing element, systolic array and a post processing stage. Processing element of systolic array uses a tag bit to decide on the type of operation (addition/subtraction) on the input signals. Proposed architecture is simulated for 28 point DFT using ModelSim 6.5 and synthesized using Xilinx ISE10.1 using Vertex 5 xc5vfx100t-3ff1738 FPGA as the target device and can operate at a maximum frequency of 224.9MHz. The performance analysis is carried out in terms of hardware utilization and computation time and compared with existing similar architectures. Further, as the convolution based DCT has two systolic arrays similar to that of DFT, a unified architecture is proposed for 1D DFT/1D DCT. © 2015 IEEE.

More »»
2015 Conference Paper B. Uma Maheswari and T.S.B. Sudarshan, “An ECDD technique to optimize QoS in wireless overlay network for multipath video streaming”, in Proceedings of the 2015 International Conference on Applied and Theoretical Computing and Communication Technology, iCATccT 2015, 2015, pp. 50-53.[Abstract]

Multimedia applications over wireless networks are growing day by day. To provide better user experience the use of overlay network is the promising solution. However, maintaining overlay in wireless network is the challenging task which produces additional overheads. This overhead degrades the quality of the video transmitted over overlay networks. To overcome these issues ECDD model is proposed in this paper. mTreebone is used to build an overlay This model also adopts FEC scheme for error correction and video data is transmitted by using sub packetization method in multiple paths. The simulation results show the improved performance of the algorithm with respect to end to end delay and retransmission requests. Number of retransmission requests is reduced by 52.27% than SPMLD. © 2015 IEEE.

More »»
2015 Conference Paper P. Vivek, G. Radhakrishnan, Deepa Gupta, and T.S.B. Sudarshan, “Clustering of robotic environment using image data stream”, in International Conference Communication, Control and Intelligent Systems, CCIS 2015, 2015, pp. 208-213.[Abstract]

Mobile robots are being used in various applications like space shuttles, intelligent home security, military applications or other service oriented applications where human intervention is limited. A robot has to understand its environment by analyzing the data to take the appropriate actions in the given environment. Mostly the data collected from the sensors on the robots are huge and continuous, making it impossible to store the entire data in main memory and hence allowing only single scan of data. Traditional clustering algorithms like k-means cannot be used in such environment as they require multiple scan of data. This paper presents an experimental study on the implementation of Stream KM++, a data stream clustering algorithm that effectively cluster these time series robotic image data within the memory restrictions under various conditions. Promising results are obtained from the various experiments carried out. More »»
2015 Conference Paper M. Rajesh, Vanishree, K., and T.S.B. Sudarshan, “Stable route AODV routing protocol for mobile Wireless Sensor Networks”, in 2015 International Conference on Computing and Network Communications, CoCoNet 2015, 2015, pp. 917-923.[Abstract]

Wireless Sensor Networks (WSN) are widely used for various applications such as habitat monitoring, structural health monitoring, logistics, patient monitoring etc. Mobility of nodes in these applications are different. Generally usual MANET based routing protocols are adapted for these type of WSNs. AODV is one of the most commonly used routing protocol for both MANETs and WSNs. But in WSNs, when the mobility is high, AODV needs to find new paths to the destination frequently as the already established links breaks because of node movement. The proposed method aims at enhancing the traditional AODV protocol in such WSN applications by building a stable route during the route discovery phase, thus avoiding link breaks that happen due to node movement. This method uses Received Signal Strength Indicator (RSSI) to determine the participation of a node in the route building process. To mitigate the effects of RSSI variations due to environment, an Exponential Moving Average filter is used to smooth out the RSSI variations. If this RSSI value is less than a threshold, the node is not selected to be part of the active route. Lesser RSSI indicates longer distance between the nodes and more chances of link breakage. A neighbor node with the highest RSSI, that meets the threshold criteria, is selected to be the next forwarding node, thereby avoiding link break and ensuring stability of the active route between the source node and the destination node. This would in turn, reduce the energy consumed in the network and hence increase the network lifetime of the WSN. To conclude the effectiveness of the proposed scheme, the simulations are carried out in a WSN scenario and the results are analyzed in comparison with the traditional AODV protocol. Network Simulator, NS2 is used to carry out the simulation. © 2015 IEEE.

More »»
2015 Conference Paper M. Rajesh, George, A., and T.S.B. Sudarshan, “Energy efficient deployment of Wireless Sensor Network by multiple mobile robots”, in 2015 International Conference on Computing and Network Communications, CoCoNet 2015, 2015, pp. 72-78.[Abstract]

Disaster management is one of the most critical applications that can be performed by a Wireless Sensor Network (WSN). The optimized deployment of sensor nodes is required for the successful relay of information. This paper proposes the deployment of sensor nodes by multiple autonomous mobile robots in an unexplored large disaster prone territory. The use of multiple robots provides important advantages over human-assisted placement like safety, accurate positioning and flexibility. For accurate location of an event, localization of the sensor nodes is very important which is achieved by using Received Signal Strength (RSS) from anchor nodes and the sensor nodes which act as anchor node after being placed. Placement of node by robots helps in achieving the location information of all the nodes that makes up the network. Communication and coordination between the multiple robots over the sensor nodes is used to achieve accurate localization, faster exploration and network creation. In this study, energy efficient utilization of the sensor node is achieved when it acts as an anchor node as it only responds when it receives the node discover command which a property of Zigbee protocol from the robot placing the sensor nodes. Hardware simulation of the proposed scheme is carried out by using Firebird V robots and Zigbee protocol is used for communication and coordination between the robots. © 2015 IEEE.

More »»
2015 Conference Paper G. Radhakrishnan, Deepa Gupta, Sindhuula, S., Khokhawat, S., and T.S.B. Sudarshan, “Experimentation and analysis of time series data from multi-path robotic environment”, in 2015 IEEE International Conference on Electronics, Computing and Communication Technologies, CONECCT 2015, 2015.[Abstract]

Autonomous mobile robots are increasingly used in many application areas. In most applications, they have to explore and gather knowledge about the environment they are deployed in. These robots transfer real time data about the environment continuously. This paper discusses a set of experiments that have been carried out to simulate various robotic environments. A robot attached with four sensors is used to collect information about the environment as the robot moves in multiple straight line paths. Time series data collected from these experiments are clustered using data mining techniques. Experimental results show clustering accuracies vary depending on the number of clusters formed. © 2015 IEEE.

More »»
2013 Conference Paper J. R. Srivastava and T.S.B. Sudarshan, “Intelligent traffic management with wireless sensor networks”, in Proceedings of IEEE/ACS International Conference on Computer Systems and Applications, AICCSA, Ifrane, 2013.[Abstract]

Vehicular travel is gaining importance everywhere, particularly in large urban areas. The current technologies that support vehicular travel like wired sensors, inductive loops, surveillance camera etc., are expensive and also require high maintenance cost. Further the accuracy of these devices also depends on environment conditions. The typical traditional approaches attempt to optimize traffic lights control for a particular density and configuration of traffic. However, the major disadvantage of using these techniques is that the dynamic behavior of traffic densities and configurations change is difficult to model constantly. Traffic seems to be an adaptation problem rather than an optimization problem. This paper therefore tries to address the above issue, and hence we propose algorithms which perform adaptive traffic light control using a wireless sensor network setup. The paper aims at analyzing methods to build an intelligent system that can blend and support some of the existing technologies of traffic control and therefore reduce the average waiting time of vehicles on a junction. The proposed algorithms are adaptive to traffic flow at any intersection point of roads. Simulations of the real-life traffic scenarios are conducted in a simulated platform called Green Light District Simulator (GLD) to generate graph average waiting time versus cycles. The results generated show that the proposed method is effective for the traffic control in a real road intersection. © 2013 IEEE.

More »»
2012 Conference Paper G. Radhakrishnan, Deepa Gupta, Abhishek, R., Ajith, A., and T.S.B. Sudarshan, “Analysis of multimodal time series data of robotic environment”, in International Conference on Intelligent Systems Design and Applications, ISDA, Kochi, 2012, pp. 734-739.[Abstract]

<p>Autonomous mobile robots equipped with an array of sensors are being increasingly deployed in disaster environments to assist rescue teams. The sensors attached to the robots send multimodal time series data about the disaster environments which can be analyzed to extract useful information about the environment in which the robots are deployed. A set of data mining tasks that effectively cluster various robotic environments have been investigated. The effectiveness of these data mining techniques have been demonstrated using an available robotic dataset. The accuracy of the proposed technique has been measured using a manual reference cluster set. © 2012 IEEE.</p>

More »»
Publication Type: Journal Article
Year of Publication Publication Type Title
2015 Journal Article B. Uma Maheswari and T.S.B. Sudarshan, “Fenwick tree based capability-aware live multimedia streaming in sparse MANETs”, International Journal of Applied Engineering Research, vol. 10, pp. 12655-12670, 2015.[Abstract]

Recent advancement in the network technology and infrastructure support video streaming over multiple paths. Realizing high quality video streaming over Mobile Adhoc Networks (MANET) is a very challenging task. This paper proposes an Application Layer Based Capability Aware protocol for single server multi user live streaming application. In wireless network each device has different capability in terms of data-storage, mobility, forwarding data, availability etc., and proposed protocol aims to realize these capabilities and to distribute video chunks in multiple paths by segmenting the stream based on its capacity. This is achieved with the help of Fenwick Tree – a data structure which is integrated in the Application Layer. The system is implemented and tested under various scenarios. The results show there is a considerable increase in throughput and decrease in total transfer time. © Research India Publications

More »»
2015 Journal Article I. Mamatha, T.S.B. Sudarshan, Tripathi, S., and Bhattar, N., “Triple-Matrix Product-Based 2D Systolic Implementation of Discrete Fourier Transform”, Circuits, Systems, and Signal Processing, vol. 34, pp. 3221–3239, 2015.[Abstract]

Realization of N -point discrete Fourier transform (DFT) using one-dimensional or two-dimensional systolic array structures has been developed for power of two DFT sizes. DFT algorithm, which can be represented as a triple-matrix product, can be realized by decomposing N into smaller lengths. Triple-matrix product form of representation enables to map the N -point DFT on a 2D systolic array. In this work, an algorithm is developed and is mapped to a two-dimensional systolic structure where DFT size can be non-power of two. The proposed work gives flexibility to choose N for an application where N is a composite number. The total time required to compute N -point DFT is 2 ( N 1 - 1 ) + N 2 + N for any N = N 1 N 2 . The array can be used for matrix–matrix multiplication and also to compute the diagonal elements of triple-matrix multiplication for other applications. The proposed architecture produces in-order stream of DFT sequence at the output avoiding need for reordering buffer. Large sized DFT can be computed by repeatedly using the proposed systolic array architecture. More »»
2014 Journal Article J. R, ,, and T.S.B. Sudarshan, “Energy-efficient cache node placement using genetic algorithm in wireless sensor networks”, Soft Computing , 2014.[Abstract]

Wireless sensor network (WSN) applications are required to report events and service queries with minimum delay and minimal energy consumption. The network lifetime of a WSN can be extended if the amount of communication in the network is reduced. We can achieve this by caching useful data closer to the requesting node. Caching successfully reduces data access latency and also the number of packet transmissions in the network, thereby increasing network lifetime. However, the important aspect of caching schemes is to identify nodes that can implement caching decisions and also place such cache nodes in a way that they can provide services to as many sensor nodes as possible in their vicinity. This has led to the study of optimal deployment of these cache nodes in a WSN. We carried out experiments to demonstrate the use of a multi-objective genetic algorithm (GA) for cache node placement in a WSN. In this paper, GA optimization aims to increase two parameters: sensors per cache in charge and field coverage. We also show that the GA successfully helps in selecting sensor nodes to implement caching and request forwarding decisions. Finally, we run the Scaled Power Community Index Cooperative Caching scheme (scaPCICC) on the optimized network and compare the delay and total number of overhead messages in the network. We conclude that by reducing the number of messages in the network and reducing the data access latency, the energy consumption of the network is reduced and network lifetime is increased. The experiments were run on MATLAB and ns2. More »»
2013 Journal Article Nippun Kumaar A A and T.S.B. Sudarshan, “Learning from demonstration with state based obstacle avoidance for mobile service robots”, Applied Mechanics and Materials, vol. 394, pp. 448-455, 2013.[Abstract]

<p>Learning from Demonstration (LfD) is a technique for teaching a system through demonstration. In areas like service robotics the robot should be user friendly in terms of coding, so LfD techniques will be of greater advantage in this domain. In this paper two novel approaches, counter based technique and encoder based technique is proposed for teaching a mobile service robot to navigate from one point to another with a novel state based obstacle avoidance technique. The main aim of the work is to develop an LfD Algorithm which is less complex in terms of hardware and software. Both the proposed methods along with obstacle avoidance have been implemented and tested using Player/Stage robotics simulator. © (2013) Trans Tech Publications, Switzerland.</p>

More »»
Faculty Details


Faculty Email: