scispace - formally typeset
Search or ask a question
Author

Devashish Gosain

Bio: Devashish Gosain is an academic researcher from Indraprastha Institute of Information Technology. The author has contributed to research in topics: The Internet & Wireless sensor network. The author has an hindex of 9, co-authored 27 publications receiving 210 citations. Previous affiliations of Devashish Gosain include Max Planck Society & Birla Institute of Technology, Mesra.

Papers
More filters
Journal ArticleDOI
TL;DR: A novel algorithm which leverages both flat and hierarchical routing schemes for maximizing energy efficiency is proposed, and results indicate that it outperforms other protocols for network characteristics like energy minimization and scalability.

64 citations

Journal ArticleDOI
TL;DR: A novel routing algorithm for wireless sensor network, which achieves uniform energy depletion across all the nodes and thus leading to prolonged network lifetime and compared with various sensor network routing protocols, it is found that the proposed algorithm outperformed them in network lifetime, energy consumption and coverage ratio.
Abstract: In this article, we propose a novel routing algorithm for wireless sensor network, which achieves uniform energy depletion across all the nodes and thus leading to prolonged network lifetime. The proposed algorithm, divides the Region of Interest into virtual zones, each having some designated cluster head nodes. In the entire process, a node can either be a part of a cluster or it may remain as an independent entity. A non-cluster member transmits its data to next hop node using IRP-Intelligent Routing Process (based on the trade-off between the residual energy of itself as well as its neighbor, and the required energy to transmit packets to its neighbor). If on the transmission path, some cluster member is elected as a next hop, it rejects IRP and transmits the packets to cluster head, which later forwards them to sink (adopting multihop communication among cluster heads). Routing is not solely performed using clusters, rather they aid the overall routing process, hence this protocol is named as Cluster Aided Multipath Routing (CAMP). CAMP has been compared with various sensor network routing protocols, viz., LEACH, PEGASIS, DIRECT TRANSMISSION, CEED, and CBMR. It is found that the proposed algorithm outperformed them in network lifetime, energy consumption and coverage ratio.

43 citations

Proceedings ArticleDOI
31 Oct 2018
TL;DR: In this paper, a detailed study of the Internet censorship mechanism in India is presented, where the authors consolidate a list of potentially blocked websites from various public sources to assess censorship mechanisms used by nine major ISPs.
Abstract: In this work we present a detailed study of the Internet censorship mechanism in India. We consolidated a list of potentially blocked websites from various public sources to assess censorship mechanisms used by nine major ISPs. To begin with, we demonstrate that existing censorship detection tools like OONI are grossly inaccurate. We thus developed various techniques and heuristics to correctly assess censorship and study the underlying mechanism used by these ISPs. At every step we corroborated our finding manually to test the efficacy of our approach, an exercise largely ignored by several others. We fortify our findings by adjudging the coverage and consistency of censorship infrastructure, broadly in terms of average number of network paths and requested domains the infrastructure censors. Our results indicate a clear disparity among the ISPs, on how they install censorship infrastructure. For instance, in Idea network we observed the censorious middleboxes in over 90% of our tested intra-AS paths, whereas for Vodafone, it is as low as 2.5%. We conclude our research by devising our own novel anti-censorship strategies, that does not depend on third party tools (like proxies, Tor and VPNs etc.). We managed to access all blocked websites in all ISPs under test.

36 citations

Posted Content
TL;DR: This work developed various techniques and heuristics to correctly assess censorship and study the underlying mechanism used by nine major ISPs in India, and demonstrated that existing censorship detection tools like OONI are grossly inaccurate.
Abstract: This paper presents a detailed study of the Internet censorship in India. We consolidated a list of potentially blocked websites from various public sources to assess censorship mechanisms used by nine major ISPs. To begin with, we demonstrate that existing censorship detection tools like OONI are grossly inaccurate. We thus developed various techniques and heuristics to correctly assess censorship and study the underlying mechanism involved in these ISPs. At every step we corroborated our finding manually to test the efficacy of our approach, a step largely ignored by others. We fortify our findings by adjudging the coverage and consistency of censorship infrastructure, broadly in terms of average number of network paths and requested domains the infrastructure surveils. Our results indicate a clear disparity among the ISPs, on how they install censorship infrastructure. For instance, in Idea network we observed the censorious middleboxes on over 90% of our tested intra-AS paths whereas for Vodafone, it is as low as 2.5%. We conclude our research by devising our own novel anti-censorship strategies, that does not depend on third party tools (like proxies, Tor and VPNs etc.). We managed to anti-censor all blocked websites in all ISPs under test.

17 citations

Journal ArticleDOI
01 Mar 2016-Optik
TL;DR: This paper analyzes the scalability issues of various routing protocols in context to wireless sensor networks (WSN) and presents an extensive analysis of the major categories of protocols namely reactive, proactive and hybrid protocols, on various performance metrics that affect sensor networks in particular.

16 citations


Cited by
More filters
Proceedings Article
16 Oct 2012
TL;DR: The proceedings of this year's ACM Conference on Computer and Communications Security (CCS) are presented, which contains 81 full papers, a record number for any computer security conference so far, representing an acceptance rate of 19%.
Abstract: It is a pleasure to present to you the proceedings of this year's ACM Conference on Computer and Communications Security (CCS 2012), held October 16-18 in Raleigh, NC, USA. This year we received 423 submissions from 41 countries. Each submission was reviewed by a technical program committee of 61 experts as well as over 293 external reviewers. The final program contains 81 full papers, a record number for any computer security conference so far, representing an acceptance rate of 19%. The double-blind review process was organised in two rounds; it included an opportunity for authors to respond to reviews between rounds; and was followed by a discussion amongst the PC - a process that spanned overall 10 weeks. Reviews were assigned between phases dynamically to maximise scrutiny and discussion around submissions whose inclusion in the program was most uncertain. Overall 1395 reviews were filled, including 489 from external reviewers. Overall 365 papers received at least 3 reviews and 149 papers received at least 4 reviews - some 5 or 6. The decision to allocate fewer than 3 reviews to some papers was taken on the basis of both qualitative feedback, as well as a systematic quantitative analysis of the likelihood of them being included in the program given the first round reviews. Many papers that were not selected for presentation contained interesting results and ideas, and we hope that the authors have benefitted from reviews to improve them further and eventually present them. We have also worked closely with the Program Chairs of workshops associated with CCS to ensure that authors have an opportunity to submit their work in those venues.

81 citations

Journal ArticleDOI
TL;DR: A Gateway Clustering Energy-Efficient Centroid- (GCEEC-) based routing protocol where cluster head is selected from the centroid position and gateway nodes are selected from each cluster to provide more feasible WSN-based monitoring for temperature, humidity, and illumination in agriculture sector.
Abstract: Wireless sensor networks (WSNs) are becoming one of the demanding platforms, where sensor nodes are sensing and monitoring the physical or environmental conditions and transmit the data to the base station via multihop routing. Agriculture sector also adopted these networks to promote innovations for environmental friendly farming methods, lower the management cost, and achieve scientific cultivation. Due to limited capabilities, the sensor nodes have suffered with energy issues and complex routing processes and lead to data transmission failure and delay in the sensor-based agriculture fields. Due to these limitations, the sensor nodes near the base station are always relaying on it and cause extra burden on base station or going into useless state. To address these issues, this study proposes a Gateway Clustering Energy-Efficient Centroid- (GCEEC-) based routing protocol where cluster head is selected from the centroid position and gateway nodes are selected from each cluster. Gateway node reduces the data load from cluster head nodes and forwards the data towards the base station. Simulation has performed to evaluate the proposed protocol with state-of-the-art protocols. The experimental results indicated the better performance of proposed protocol and provide more feasible WSN-based monitoring for temperature, humidity, and illumination in agriculture sector.

76 citations

Journal ArticleDOI
TL;DR: A novel algorithm which leverages both flat and hierarchical routing schemes for maximizing energy efficiency is proposed, and results indicate that it outperforms other protocols for network characteristics like energy minimization and scalability.

64 citations

Journal ArticleDOI
12 Sep 2019
TL;DR: A routing method developed based on the reinforcement learning, exploiting the node information’s to establish a route that is short and stable, to minimize the energy consumption, transmission delay, and improve the delivery ratio of the packets, enhancing the throughput.
Abstract: The rapid advances in wireless communication technology has led to an extraordinary progress in the adhoc type of networking. The mobile adhoc networks being a subtype of the adhoc network almost poses the same characteristics of the adhoc network, presenting multiple challenges in framing a route for the transmission of the information from the source to the destination. So the paper proposes a routing method developed based on the reinforcement learning, exploiting the node information’s to establish a route that is short and stable. The proposed method scopes to minimize the energy consumption, transmission delay, and improve the delivery ratio of the packets, enhancing the throughput. The efficiency of the proposed method is determined by validating its performance in the network simulator-II, in terms of the energy consumption, delay in the transmission and the packet delivery ratio.

59 citations

Journal ArticleDOI
TL;DR: The proposed Taylor C-SSA algorithm shows best performance in terms of energy, number of alive nodes, delay, and throughput values of 0.129, 42, 0.291, and 0.1, respectively.

51 citations