.01

ABOUT

PERSONAL DETAILS
IIT Kharagpur, India
rohit.verma@iitkgp.ac.in
Department of CSE, IIT, Kharagpur
Hello. I am a Programmer Researcher Programmer Researcher Programmer
I am passionate about programming and coding
Welcome to my Personal profile

BIO

ABOUT ME

I am PhD Student at the Indian Institute of Technology, Kharagpur, under the supervision of Dr. Sandip Chakraborty and Dr. Bivas Mitra. My primary area of interest is in the field of Mobile Computing.
Prior to joining PhD, I was working as a Software Developer with Schneider Electric India Pvt. Ltd for two years (2013-2015). I then joined as a Junior Research Fellow at IIT Kharagpur in 2015 and then joined as a PhD student in January 2016. I am a recipient of the TCS Research Fellowship.

HOBBIES

INTERESTS

I like developing android applications for fun. The interest started from my SDE days at Schneider Electric.

I enjoy reading. Fiction novels, crime fiction and thrillers in particular, always find their place on my bookshelf. Programming and fiction, a curious mix indeed it is

Traveling is a huge love. In fact it is something which rejuvenates me, bringing me back to work with ever more increased energy. Be it the seas, the mountains, the cities with their histories or just a long drive, I make sure I have my escapades.


.02

RESUME

  • EDUCATION
  • 2016
    Present
    Kharagpur, India

    COMPUTER SCIENCE AND ENGINEERING - PHD

    INDIAN INSTITUTE OF TECHNOLOGY

    Research Area: Mobile Computing
    Guide: Dr. Sandip Chakraborty, Dr. Bivas Mitra
  • 2009
    2013
    Durgapur, India

    COMPUTER SCIENCE AND ENGINEERING

    NATIONAL INSTITUTE OF TECHNOLOGY

  • ACADEMIC AND PROFESSIONAL POSITIONS
  • 2015
    2016
    Khragpur, India

    JUNIOR RESEARCH FELLOW

    INDIAN INSTITUTE OF TECHNOLOGY

    Project: DiSARM
  • 2013
    2015
    Bangalore, India

    SOFTWARE DEVELOPER

    SCHNEIDER ELECTRIC INDIA PVT. LTD.

    .NET and ANDROID Development
  • 2012
    2012
    Kharagpur, India

    INTERN

    INDIAN INSTITUTE OF TECHNOLOGY

    Guide: Dr. Niloy Ganguly
    Project Title: Analyzing a Fastest Path Algorithm for Spatio-Temporal Networks
  • 2011
    2011
    Kharagpur, India

    INTERN

    INDIAN INSTITUTE OF TECHNOLOGY

    Guide: Dr. Niloy Ganguly
    Project Title: Delay Tolerant Network and its Application in Post Disaster Management
  • HONORS AND AWARDS
  • 2016
    Kharagpur, India

    TCS PhD Fellowship

.03

PUBLICATIONS

PUBLICATIONS LIST
29 AUG 2017

Smart-phone based Spatio-temporal Sensing for Annotated Transit Map Generation

REDONDO BEACH - USA

Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems(SIGSPATIAL 2017)
Project page Link

Conferences Selected PDF R. Verma, Surjya Ghosh, N. Ganguly, B. Mitra and S. Chakraborty
img

Smart-phone based Spatio-temporal Sensing for Annotated Transit Map Generation

R. Verma, Surjya Ghosh, N. Ganguly, B. Mitra and S. Chakraborty Conferences Selected

City transit maps are one of the important resources for public navigation in today’s digital world. However, the availability of transit maps for many developing countries is very limited, primarily due to the various socio-economic factors that drive the private operated and partially regulated transport services. Public transports at these cities are marred with many factors such as uncoordinated waiting time at bus stoppages, crowding in the bus, sporadic road conditions etc., which also need to be annotated so that commuters can take informed decision. Interestingly, many of these factors are spatio-temporal in nature. In this paper, we develop CityMap, a system to automatically extract transit routes along with their eccentricities from spatio-temporal crowdsensed data collected via commuters’ smart-phones. We apply a learning based methodology coupled with a feature selection mechanism to filter out the necessary information from raw smart-phone sensor data with minimal user engagement and drain of battery power. A thorough evaluation of CityMap, conducted for more than two years over 11 different routes in 3 different cities in India, show that the system effectively annotates bus routes along with other route and road features with more than 90% of accuracy.

01 NOV 2016

Unsupervised Annotated City Traffic Map Generation

SAN FRANCISCO - USA

Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems(SIGSPATIAL 2016)
Project page Link

Conferences Selected PDF R. Verma, Surjya Ghosh, A. Shrivastava, N. Ganguly, B. Mitra and S. Chakraborty
img

Unsupervised Annotated City Traffic Map Generation

R. Verma, Surjya Ghosh, A. Shrivastava, N. Ganguly, B. Mitra and S. Chakraborty Conferences Selected

Public bus services in many cities in countries like India are controlled by private owners, hence, building up a database for all the bus routes is non-trivial. In this paper, we leverage smart-phone based sensing to crowdsource and populate the information repository for bus routes in a city. We have developed an intelligent data logging module for smart-phones and a server side processing mechanism to extract roads and bus routes information. From a 3 month long study involving more than 30 volunteers in 3 different cities in India, we found that the developed system, CrowdMap, can annotate bus routes with a mean error of 10m, while consuming 80% less energy compared to a continuous GPS based system.

29 JUN 2016

Design Of Efficient Lightweight Strategies To Combat Dos Attack In Delay Tolerant Network Routing

Wireless Networks, pp. 1-22
Springer US

Journal Paper PDF S. Saha, S. Nandi, R. Verma, S. Sengupta, K. Singh, V. Sinha, S.K. Das
img

Design Of Efficient Lightweight Strategies To Combat Dos Attack In Delay Tolerant Network Routing

S. Saha, S. Nandi, R. Verma, S. Sengupta, K. Singh, V. Sinha, S.K. Das Journal Paper

Delay tolerant networks (DTNs) are characterized by delay and intermittent connectivity. Satisfactory network functioning in a DTN relies heavily on co-ordination among participating nodes. However, in practice, such co-ordination cannot be taken for granted due to possible misbehaviour by relay nodes. Routing in a DTN is, therefore, vulnerable to various attacks, which adversely affect network performance. Several strategies have been proposed in the literature to alleviate such vulnerabilities—they vary widely in terms of throughput, detection time, overhead etc. One key challenge is to arrive at a tradeoff between detection time and overhead. We observe that the existing table-based reactive strategies to combat Denial-of-service (DoS) attacks in DTN suffer from two major drawbacks: high overhead and slow detection. In this paper, we propose three secure, light-weight and time-efficient routing algorithms for detecting DoS attacks (Blackhole and Grey-hole attacks) in the Spray & Focus routing protocol. The proposed algorithms are based on use of a small fraction of privileged (trusted) nodes. The first strategy, called TN, outperforms the existing table-based strategy with 20–30 % lesser detection time, 20–25 % higher malicious node detection and negligible overhead. The other two strategies, CTN_MI and CTN_RF explore the novel idea that trusted nodes are able to utilize each others’ information/experience using their long range connectivity as and when available. Simulations performed using an enhanced ONE simulator reveals that investing in enabling connectivity among trusted nodes (as in CTN_RF) can have significant performance benefits.

26 JUN 2016

Margdarshak: A Mobile Data Analytics based Commute Time Estimator cum Route Recommender

SINGAPORE

Proceedings of the 3rd International on Workshop on Physical Analytics (WPA 2016)

Conferences Selected PDF R. Verma, A. Shrivastava, S. Chakraborty, B. Mitra
img

Margdarshak: A Mobile Data Analytics based Commute Time Estimator cum Route Recommender

R. Verma, A. Shrivastava, S. Chakraborty, B. Mitra Conferences Selected

Waiting at traffic signals and getting stuck in traffic congestion eats a lot of time for a commuter in most of the metro cities of the world. Although there exists a large pool of navigation applications, but all of them turn out to be ineffective for dynamically finding out the best route under uncertainty. In this work, we present Margdarshak, a navigation system which utilizes the impact of congestion and wait time at traffic signals for estimating the travel time over a route. We collected a month-long traffic data from different routes at five various cities in India for analyzing the problem in detail. The evaluations performed over the system show that Margdarshak gives a mean estimation error of ±1.5$ minutes, and performs significantly better under uncertainty, compared to other state of the art navigation systems like Google Maps, Here Maps and Waze.

09 APR 2016

UrbanEye: An outdoor localization system for public transport

SAN FRANCISCO - USA

Proceedings of The 35th Annual IEEE International Conference on Computer Communications (IEEE INFOCOM 2016)
Project page Link

Conferences Selected PDF R. Verma, A. Shrivastava, B. Mitra, S. Saha, N. Ganguly, S. Nandi, S. Chakraborty
img

UrbanEye: An outdoor localization system for public transport

R. Verma, A. Shrivastava, B. Mitra, S. Saha, N. Ganguly, S. Nandi, S. Chakraborty Conferences Selected

Public transport in suburban cities (covers 80% of the urban landscape) of developing regions suffer from the lack of information in Google Transit, unpredictable travel times, chaotic schedules, absence of information board inside the vehicle. Consequently, passengers suffer from lack of information about the exact location where the bus is at present as well as the estimated time to be taken to reach the desired destination. We find that off-the-shelf deployment of existing (non-GPS) localization schemes exhibit high error due to sparsity of stable and structured outdoor landmarks (anchor points). Through rigorous experiments conducted over a month however, we realize that there are a certain class of volatile landmarks which may be useful in developing efficient localization scheme. Consequently, in this paper, we design a novel generalized energy-efficient outdoor localization scheme - UrbanEye, which efficiently combines the volatile and non-volatile landmarks using a specialized data structure, the probabilistic timed automata. UrbanEye uses speed-breakers, turns and stops as landmarks, estimates the travel time with a mean accuracy of ±2.5 mins and produces a mean localization accuracy of 50 m. Results from several runs taken in two cities, Durgapur and Kharagpur, reveal that UrbanEye provides more than 50% better localization accuracy compared to the existing system Dejavu, and consumes significantly less energy.

12 JAN 2014

e-ONE: enhanced ONE for simulating challenged network scenarios

Journal of Networks 9.12, pp.3290-3304
Academy Publishers

Journal Paper PDF S. Saha, R. Verma, S. Saika, P.S. Paul, S. Nandi
img
S. Saha, R. Verma, S. Saika, P.S. Paul, S. Nandi Journal Paper

Delay Tolerant Network (DTN) empowers sparse mobile ad-hoc networks and other challenged network environments, such as interplanetary communication network or deep sea communication network, where traditional networking protocols either fail to work completely or do not work well. The Opportunistic Networking Environment (ONE) Simulator has gained considerable popularity as an efficient tool for validating and analysing DTN routing and application protocols. It provides options for creating different mobility models and routing strategies as per the users' requirements. Nowadays, challenged networks such as rural internet connection, social networks, post-disaster communication systems, etc. use DTN along with some hybrid infrastructure networks. Incorporating such real life network systems in ONE needs extensive modification of the same. In this paper, we present the enhanced ONE (e-ONE) simulator as an extension of ONE to facilitate simulation of challenged networks and describe the enhancements we have added to the ONE. As a case study, we consider a challenged network, which we call a latency aware 4-tier planned hybrid architecture designed for post-disaster management. We describe, in detail, how this enhanced version of the ONE simulator is useful in analysis and evaluation of the scenario considered.

22 AUG 2012

Is It Worth Taking A Planned Approach To Design Ad Hoc Infrastructure For Post Disaster Communication?

ISTANBUL - TURKEY

e-ONE: enhanced ONE for simulating challenged network scenarios

Proceedings of The Seventh ACM International Workshop on Challenged Networks (CHANTS 2012)

Conferences Selected PDF S. Saha, V K Shah, R Verma, R. Mandal, S. Nandi
img

Is It Worth Taking A Planned Approach To Design Ad Hoc Infrastructure For Post Disaster Communication?

Sujoy Saha, Vijay Kumar Shah, Rohit Verma, Ratna Mandal, Subrata Nandi Conferences Selected

After any natural disaster the availability of existing conventional communication infrastructure almost gets ruled out. After the devastation, to restore the communication system in ad hoc basis; ensuring almost 100% packet delivery within acceptable latency with optimal utilization of resources are prime design motives. Our work proposes a four tier planned hybrid architecture, which conforms the aforesaid motives yielding a desired performance in terms of delivery probability within least latency, for a given disaster hit area map with a suitable heuristic algorithm. Our study also reveals that there exists no deterministic polynomial time solution that can implement the desired design motives as well as the feasibility of our planned methodology. Compared to any brute force strategy, as per the simulation results, our approach shows 42% higher delivery probability and 49% lower latency.

13 JUL 2012

SRSnF: A Strategy for Secured Routing in Spray and Focus Routing Protocol for DTN

CHENNAI - INDIA

Proceedings of the Second International Conference on Advances in Computing and Information Technology (ACITY)

Conferences Selected PDF S. Saha, R. Verma, S. Sengupta, V. Mishra, S. Nandi
img

SRSnF: A Strategy for Secured Routing in Spray and Focus Routing Protocol for DTN

S. Saha, R. Verma, S. Sengupta, V. Mishra, S. Nandi Conferences Selected

This paper deals with the aspect of security in Delay Tolerant Networks (DTN). DTNs are characterized with decentralized control. Network performance and trustworthiness of transmitted information in DTNs depend upon the level of co-operation among participating nodes. As a result, DTNs are vulnerable towards untoward activities arising out of node selfishness as well as malicious intentions. In this paper, we limit our focus to the Black Hole Denial-of-Service attack. We develop a table-based strategy to record network history and use this information to detect discrepancies in the behavior of nodes, followed by elimination of those detected as malicious. We explain our detection mechanism considering Spray and Focus routing protocol as the representative routing scheme. The detection mechanism has been described in detail with examples pertaining to various case scenarios. Furthermore, we study the effect of variation of various parameters on detection efficiency and message transmission through simulation results.