Mehul
@gcet.ac.in
Associate Professor, Electronics and Communication Department
G.H.Patel College of Engineering and Technology
Dr. Mehul. B. Shah received his Bachelor of Engineering degree in Electronics and Communication from Birla Vishwakarma Mahavidhyalaya, Sardar Patel University, Vallabh Vidhyanagar in 1997 and M.E in Communication Engineering from D.D University, India in 2003. From 1997 onwards he is working as a lecturer is G.H.Patel College of Engineering and Technology, V.V.Nagar. He worked on Cell phone based Wireless Sensor Networks and actively involved in Indo-UK Next generation network project on Pervasive sensor Environment. He has obtined PhD Degree at IIT Bombay, India. His research interests are in wireless communication and Mobile Adhoc and Sensor Networks, Sensor Networks, IOT etc
RESEARCH INTERESTS
Sensor Network, Wireless Network, Wireless Communication, Machine learning
Scopus Publications
Scholar Citations
Scholar h-index
Scholar i10-index
Scopus Publications
Amit Choksi and Mehul Shah
Wiley
AbstractVehicular ad hoc network (VANET) is a dynamic and self‐configure wireless network that connects vehicles to provide in‐vehicle infotainment services and comfort to both driver and passengers while on the move. Due to the highly dynamic environment, patchy connectivity, roadside barriers, and a scarcity of road side units (RSUs); existing routing protocols of VANET consume high energy during route construction. As a consequence, the VANET lifespan might be shortened. However, saving energy is a critical factor where VANET is projected to play a key role in the building of sustainable green infrastructure. Clustering is an imperative process where vehicle nodes join to make stable clusters based on common mobility features. In VANET, clustering‐based routing algorithms significantly improve network effectiveness and reduce infrastructure costs. This article proposes fuzzy c‐means (FM) machine learning‐based dynamic clustering algorithm (DCA) to identify trustworthy vehicles for energy‐efficient multi‐hop routing by considering different mobility parameters such as position, direction, speed, and remaining energy of each vehicle node. This article also proposes distance and power‐based variation of FM called fuzzy c‐means using distance and residual power (FMDP) to find stable cluster heads (CHs) for performing better data dissemination to the destination. The proposed DCA outperforms the existing k‐means based clustering algorithms as well as topology‐based DSR and AODV routing protocols in terms of packet delivery ratio, application throughput, end‐to‐end delay, network energy consumption, node energy consumption, and RSU energy consumption. Additionally, clustering methods FM and FMDP of suggested DCA improve end‐to‐end delay by 20%, application throughput by 5%, and reduce network energy consumption by 68% compared with the k‐means based clustering model.
Mehul B. Shah
IEEE
Novel mobile information systems are being developed with the use of smartphones. The traditional applications of wireless sensor networks such as environmental monitoring, health care, and transportation are being realized by many mobile social network applications. Smartphones forward various onboard sensor data using a store-carry-forward way to the central repositories over the internet. In this paper, inter contact time distribution of each smartphone user with other users is utilized for efficient sensor data routing. A novel threshold-based approach is used to estimate future interconnection times. Human mobility based Weighted Relaying Algorithm (Hm-WRA) is proposed for routing in opportunistic mobile sensing systems. The proposed protocol performs almost 15% to 20% better compared to an intercontact time based shortest path routing algorithm named CHARON in terms of the data delivery ratio with proper selection of threshold value at each node.
Mehul B. Shah and Anish Vahora
IEEE
Pollution data needs to be collected in urban areas for monitoring purposes. Among various approaches moving sink/ data mule based approach is more effective from energy consumption perspective. In this approach mobile sink gathers information from the static sensors of the network and transfer it to uploading server or base station. The Sink Trail protocol is one such protocol which handles this task in an efficient way. The logical coordinate system of Sink Trail protocol ease routing and forwarding without using GPS.The impact of different moving patterns of sink can affect the performance of packet received and energy consumption. In this paper various sink movements such as straight line, linear and zigzag pattern at constant speed is considered for protocol evaluation. The size of the network is also varied for different movements. The simulation results demonstrate substantial differences for different sink movements.
Rathod Yogirajsinh, Mehul B. Shah, and Parthesh Mankodi
IEEE
In wireless sensor networks data gathering is very important task. Nowadays analysis has been targeted on decreasing the energy consumption of the WSN. To solve this drawback the conception of movable sink is presented. In this approach mobile sink gather the inform the static sensors of the network and transfer it to base station. For efficiently gather the data sink's mobility pattern should be decided so the data collection time will be reduced. Sink Trail (ST) and Sink Trail-S (STS) protocols are used to find shortest path for data forwarding through the nodes to sink. Constant updating of unnecessary sink location needs to be reduced. Therefore STS protocol is proposed to overcome the difficulty of ST protocol. The logical coordinate system (LCS) is proposed for the ease of routing and forwarding and because of it any location prediction strategy or GPS not required. This protocol enhances the energy efficiency. We analyze the impact of broadcasting frequency on route length and energy consumption. The simulation result of ST with data aggregation demonstrates that the proposed method reduces the amount of network traffic which helps to reduce energy consumption.
Nikhil N. Gondaliya, Dhaval Kathiriya, and Mehul Shah
Springer India
Nikhil Gondaliya, Mehul Shah, and Dhaval Kathiriya
IEEE
Delay Tolerant Networks (DTNs) also provide the communication to the group of people who carries the mobile devices like smart phone, laptop and palmtop. By exploiting the human characteristics it becomes easy to pretend the social properties which are useful in selecting the appropriate relay node. Many routing protocols have shown the capability of these properties (eg. community and centrality) and improved the performance in terms of delivery ratio and delivery delay. The performance of community based routing protocols mainly depends on the formation of the correct community structure. The admission criteria to add the node in the local community is based on aggregated contact duration or contact frequency between node pair. Until it exceeds the predefined threshold value, node cannot be added in to the local community of each other. Even it is difficult to predict the value of threshold in advance for any data set. By analyzing a community structure at different times, it is found that a community detection similarity is very low in early phase of the simulation. Within the entire network, some nodes are more popular and interact with more nodes than others called hub or central nodes. These nodes play important role in improving the delivery ratio. Hence, we propose the simple approach to schedule the nodes for message transmission based on the two centrality measures: betweenness and degree in the absence of the community information about message's destination. We validate our proposed scheme using real time traces of two different environments: conference and campus and compared with existing scheme. The simulation results show the higher delivery ratio and low average hop count value for the traces of both the environments.
Namita Mehta and Mehul Shah
NADIA
Delay and/or Disruption-Tolerant Networking (DTN) is a novel communication prototype that can span across multiple networks and deal with unpredicted conditions in the Internet model.Delay-tolerant networks (DTNs) are partitioned wireless ad hoc networks with intermittent connectivity. Additional terminology in this family of dynamic networks includes disruption-tolerant networks, intermittently connected networks, and opportunistic networks. Routing of the packets in DTN is based on store-carry-and forward paradigm. In this paper, we study and analyze performance of well known PROPHET and Spray and Wait routing protocol, under different human mobility models such as Truncated Levy Walk mobility model (TLW),Self-similar Least Action Walk (SLAW) and Random way point (RWP) model. The MATLAB simulator is used in order to analyze the performance of these routing protocols.Simulation results illustrate that Spray and Wait significantly outperforms the PROPHET on aspects of delivery ratio, average delay and communication overhead.
Smit B Tripathi and Mehul B Shah
IEEE
Cognitive radio can be regarded as the intelligent wireless devices which can sense the medium and effectively utilize the vacant or underutilized spectrum. The cognitive radio enables the Secondary Users (SU) to opportunistically access the spectrum unused by the Primary Users (PU). There are two basic objectives of Cognitive Radio Medium Access Control (CR MAC): controlling interference and avoiding PUs and avoiding collision between SUs. We propose a MAC protocol for single channel which opportunistically utilizes the spectrum unused by the PUs. It has a licensed channel in the primary network. The time in the network is divided in terms of slot time. Slot time is of equal length and packet transmission in carried out in slots. It is partitioned in two phases which are the contention phase and the data transmission phase. The first phase selects a SU based on 802.11 DCF with RTS/CTS mechanism. The second phase is for data transmission. The SU is allowed to occupy all the time remaining after the contention phase. In case of collision, a dynamic backoff scheme is applied. We compare the results of the OSA MAC for single channel with dynamic MAC scheme. The results show that throughput of proposed scheme is better than the conventional OSA scheme.
Pratik R Parekh and Mehul B Shah
IEEE
Cognitive Radio is a novel technology in today's radio environment to improve the utilization efficiency of radio spectrum. In this paper we are going to use Orthogonal Frequency Division Multiplexing (OFDM) based spectrum sensing cognitive radio system is addressed. The main purpose is to identify the underutilized spectrum or white space without inferring the PU signal, called Existing Users (EUs) system altogether. To use the unused spectrum, spectrum sensing is needed to know whether the PU is present or not. The performance of cooperation based spectrum sensing scheme will be studied for OFDM based cognitive user using the energy detector method and wavelet based spectrum sensing scheme. Several factors like fading and shadowing affects the ability of cognitive radio to detect the PU. Here AWGN as well as Rayleigh fading channel are considered. Wavelet edge detection is one of the most widely used spectrum sensing techniques. This technique observes a spatial distribution of spectral data at multiple resolutions. The slope of the power spectral density is used as an index to differentiate between sharp and blurred peaks. Power spectra with conspicuous peaks utilize Haar wavelet transform, while for subtle peaks use Gaussian wavelet transform, and also explain how wavelet transform is advantageous then Energy detection.
Mehul B. Shah and Jignesh L. Rathod
IEEE
In an Opportunistic Sensor Network (OSN), mobile nodes equipped with sensor are tasked by Sensor Access Points (SAPs) in aid of applications running distantly on the Internet. Mobile sensor nodes upload sensed data back to the SAP once its tasked queries are sensed. In an OSN, node mobility is uncontrolled and the performance of scheduling algorithms relies on opportunistic meeting between human-attached sensors and SAPs. In this paper we are proposing and evaluating the performance of a novel Human Mobility based Shortest Job First (HMB-SJF) Scheduling algorithm for efficient query processing under the human mobility models such as Truncated Levy Walk (TLW). HMB-SJF performs better compared to naïve instantaneous mobility based MB-SJF scheduling algorithm. Number of uploading of sensed queries are improved by almost 15% for HMB-SJF compared to MB-SJF.