default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSatbir Jain
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Ritu Nigam, Deepak Kumar Sharma
, Satbir Jain, Kartik Krishna Bhardwaj, Siddhant Banyal:
AI-enabled trust-based routing protocol for social opportunistic IoT networks. Trans. Emerg. Telecommun. Technol. 35(4) (2024)- [j8]Shikha Gupta, Satbir Jain, Mohit Agarwal, Nalin Nanda:
An encryption approach to improve the security and performance of data by integrating AES with a modified OTP technique. Int. J. Adv. Intell. Paradigms 27(2): 129-149 (2024) - 2023
- [j7]Ritu Nigam, Satbir Jain, Deepak Kumar Sharma:
RF-BBFT: a random forest based multimedia big data routing technique for social opportunistic IoT networks. Multim. Tools Appl. 82(25): 39815-39839 (2023) - 2022
- [j6]Ritu Nigam, Deepak Kumar Sharma, Satbir Jain, Gautam Srivastava:
A Local Betweenness Centrality Based Forwarding Technique for Social Opportunistic IoT Networks. Mob. Networks Appl. 27(2): 547-562 (2022) - 2020
- [j5]Pragya Kuchhal, Sanjay K. Dhurandher, Isaac Woungang, Vinesh Kumar, Satbir Jain, Sahil Gupta, Leonard Barolli:
Pareto set based optimized routing in opportunistic network. J. Ambient Intell. Humaniz. Comput. 11(2): 777-797 (2020) - [j4]Nishi Gupta, Pranav M. Pawar, Satbir Jain:
Improve Performance of Wireless Sensor Network Clustering Using Mobile Relay. Wirel. Pers. Commun. 110(2): 983-998 (2020)
2010 – 2019
- 2019
- [j3]Nishi Gupta, Satbir Jain:
Mobile relay assisted dynamic clustering in wireless sensor networks. Int. J. Space Based Situated Comput. 9(1): 31-39 (2019) - [j2]Ritu Nigam, Deepak Kumar Sharma, Satbir Jain, Sarthak Gupta, Shilpa Ghosh:
Bonding Based Technique for message forwarding in Social Opportunistic Network. Scalable Comput. Pract. Exp. 20(1): 1-15 (2019) - [c7]Pragya Kuchhal, Satbir Jain:
Performance Analysis of A∗-Based Hop Selection Technique in Opportunistic Networks Through Movement Mobility Models. WIDECOM 2019: 61-74 - 2017
- [j1]Pragya Kuchhal, Sanjay Kumar Dhurandher, Satya Jyoti Borah, Isaac Woungang, Satbir Jain, Sahil Gupta:
A* search based next hop selection for routing in opportunistic networks. Int. J. Space Based Situated Comput. 7(3): 177-186 (2017) - 2015
- [c6]Kaur Savneet, Satbir Jain, Deepali Virmani:
Deployment of Wireless Sensor Networks for intelligent information retrieval in marine environment. ICCSCE 2015: 371-376 - [i13]Kaur Savneet, Deepali Virmani, Satbir Jain:
A Novel Framework for Intelligent Information Retrieval in Wireless Sensor Networks. CoRR abs/1503.00439 (2015) - 2013
- [i12]Deepali Virmani, Satbir Jain:
Reliable Robust and Real-Time Communication Protocol for Data Delivery in Wireless sensor Networks. CoRR abs/1301.0188 (2013) - [i11]Deepali Virmani, Satbir Jain:
Performance Comparison of Proposed Lifetime Maximizing Trees for Data Aggregation in Wireless Sensor Networks. CoRR abs/1301.3997 (2013) - [i10]Deepali Virmani, Satbir Jain:
Stable Routing for achieving Quality of Service in wireless Sensor Networks. CoRR abs/1301.3999 (2013) - [i9]Deepali Virmani, Satbir Jain:
Decentralized Lifetime Minimizing Tree for Data Aggregation in Wireless Sensor Networks. CoRR abs/1301.4551 (2013) - [i8]Deepali Virmani, Satbir Jain:
Real Time scheduling with Virtual Nodes for Self Stabilization in Wireless Sensor Networks. CoRR abs/1301.4654 (2013) - [i7]Deepali Virmani, Satbir Jain:
Centralized Lifetime Maximizing Tree For Wireless Sensor Networks. CoRR abs/1301.4988 (2013) - [i6]Deepali Virmani, Satbir Jain:
Comparison of Proposed Data Dissemination Protocols for Sensor Networks Using J-Sim. CoRR abs/1302.1676 (2013) - [i5]Deepali Virmani, Satbir Jain:
An Efficient Hybrid Localization Technique in Wireless Sensor Networks. CoRR abs/1303.3817 (2013) - [i4]Deepali Virmani, Satbir Jain:
Clustering Based Lifetime Maximizing Aggregation Tree for Wireless Sensor Networks. CoRR abs/1303.5839 (2013) - [i3]Deepali Virmani, Satbir Jain:
Scalable, Robust and Real Time Communication Architecture For Wireless Sensor Networks. CoRR abs/1305.2370 (2013) - 2012
- [i2]Deepali Virmani, Satbir Jain:
Decentralized Lifetime Maximizing Tree with Clustering for Data Delivery in Wireless Sensor Networks. CoRR abs/1201.4943 (2012) - [i1]Deepali Virmani, Satbir Jain:
Real Time Communication Capacity for Data Delivery in Wireless Sensor Networks. CoRR abs/1201.4946 (2012) - 2011
- [c5]P. K. Agrawal, Brij B. Gupta, Satbir Jain:
SVM Based Scheme for Predicting Number of Zombies in a DDoS Attack. EISIC 2011: 178-182 - 2010
- [c4]Deepali Virmani, Satbir Jain:
Fault tolerant optimal path for data delivery in wireless sensor networks. A2CWiC 2010: 46:1-46:7 - [c3]Deepali Virmani, Satbir Jain:
Quality of Service On-demand Power Aware Routing Algorithm for Wireless Sensor Networks. BAIP 2010: 281-289 - [c2]Deepali Virmani, Satbir Jain:
Robust and Real Time Data Delivery in Wireless Sensor Networks. ICT 2010: 129-135 - [c1]Deepali Virmani, Satbir Jain:
Virtual Nodes for Self Stabilization in Wireless Sensor Networks. ICT 2010: 371-375
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-29 20:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
