default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDD. Arivudainambi
Person information
- affiliation: Anna University, Department of Mathematics, Chennai, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j18]R. Pavithra
, D. Arivudainambi:
Coverage-Aware Sensor Deployment and Scheduling in Target-Based Wireless Sensor Network. Wirel. Pers. Commun. 130(1): 421-448 (2023)- 2021
- [j17]D. Arivudainambi, R. Pavithra:
Vertex coloring approach for Q-coverage problem in wireless sensor network. J. Intell. Fuzzy Syst. 40(5): 8683-8695 (2021) - [j16]D. Arivudainambi, K. A. Varun Kumar, Suresh Chandra Satapathy:
Correlation based malicious traffic analysis system. Int. J. Knowl. Based Intell. Eng. Syst. 25(2): 195-200 (2021) - 2020
- [j15]D. Arivudainambi, K. A. Varun Kumar, R. Vinoth Kumar, P. Visu:
Ransomware Traffic Classification Using Deep Learning Models: Ransomware Traffic Classification. Int. J. Web Portals 12(1): 1-11 (2020) - [j14]D. Arivudainambi, R. Pavithra:
Coverage and Connectivity-Based 3D Wireless Sensor Deployment Optimization. Wirel. Pers. Commun. 112(2): 1185-1204 (2020)
2010 – 2019
- 2019
- [j13]D. Arivudainambi, K. A. Varun Kumar, S. Sibi Chakkaravarthy, P. Visu:
Malware traffic classification using principal component analysis and artificial neural network for extreme surveillance. Comput. Commun. 147: 50-57 (2019) - [j12]D. Arivudainambi, D. Dhanya:
Resource allocation through optimized three-phase scheduled VMs by grey wolf optimization and introspection security analysis. J. Intell. Fuzzy Syst. 36(5): 4327-4340 (2019) - [j11]D. Dhanya, D. Arivudainambi:
Dolphin partner optimization based secure and qualified virtual machine for resource allocation with streamline security analysis. Peer-to-Peer Netw. Appl. 12(5): 1194-1213 (2019) - 2018
- [j10]D. Arivudainambi, Sethuraman Balaji, B. Sripathy, P. Vijayaraju:
Enhancing Quality of Coverage for Target Coverage Problem Using Discrete Haar Wavelet. Wirel. Pers. Commun. 101(4): 1817-1837 (2018) - 2017
- [j9]D. Arivudainambi, M. Gowsalya:
Analysis of an M/G/1 retrial queue with Bernoulli vacation, two types of service and starting failure. Int. J. Artif. Intell. Soft Comput. 6(3): 222-249 (2017) - [j8]D. Arivudainambi, Sethuraman Balaji:
Improved Memetic Algorithm for Energy Efficient Sensor Scheduling with Adjustable Sensing Range. Wirel. Pers. Commun. 95(2): 1737-1758 (2017) - [c5]D. Arivudainambi, Sethuraman Balaji, R. Pavithra, R. N. Shakthivel:
Energy efficient sensor scheduling for Q-Coverage problem. CAMAD 2017: 1-6 - [c4]D. Arivudainambi, Sethuraman Balaji, T. S. Poorani:
Sensor deployment for target coverage in underwater wireless sensor network. PEMWN 2017: 1-6 - 2016
- [j7]Kathiroli Raja, Arivudainambi Deivasigamani, Vidhya Ravi:
A Reliant Certificate Revocation of Malicious Nodes in MANETs. Wirel. Pers. Commun. 90(2): 435-455 (2016) - 2015
- [j6]D. Arivudainambi, P. Godhandaraman:
Retrial queueing system with balking, optional service and vacation. Ann. Oper. Res. 229(1): 67-84 (2015) - 2014
- [c3]D. Arivudainambi, Sethuraman Balaji, Duraisamy Rekha:
Improved memetic algorithm for energy efficient target coverage in wireless sensor networks. ICNSC 2014: 261-266 - [c2]Sanjeev Kumar Saini, S. Senthil Anand, D. Arivudainambi, C. N. Krishnan:
A web-based degree program in open source education: a case study. WWW (Companion Volume) 2014: 1083-1086 - 2013
- [j5]D. Arivudainambi, Duraisamy Rekha:
Broadcast Scheduling Problem in TDMA Ad Hoc Networks using Immune Genetic Algorithm. Int. J. Comput. Commun. Control 8(1): 18-29 (2013) - [j4]D. Arivudainambi, Duraisamy Rekha:
Memetic algorithm for minimum energy broadcast problem in wireless ad hoc networks. Swarm Evol. Comput. 12: 57-64 (2013) - 2012
- [j3]D. Arivudainambi, Duraisamy Rekha:
An evolutionary algorithm for broadcast scheduling in wireless multihop networks. Wirel. Networks 18(7): 787-798 (2012) - 2011
- [c1]D. Arivudainambi, Duraisamy Rekha:
Broadcast scheduling problem for TDMA ad-hoc networks. ACWR 2011: 461-464
2000 – 2009
- 2006
- [j2]B. Krishna Kumar, D. Arivudainambi, Achyutha Krishnamoorthy:
Some results on a generalized M/G/1 feedback queue with negative customers. Ann. Oper. Res. 143(1): 277-296 (2006) - 2002
- [j1]B. Krishna Kumar, A. Vijayakumar, D. Arivudainambi:
An M/G/1 Retrial Queueing System with Two-Phase Service and Preemptive Resume. Ann. Oper. Res. 113(1-4): 61-79 (2002)
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-10-24 21:32 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:
