Md Anwarul Kaium Patwary

Mr. Md Anwarul Kaium Patwary

orcid

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 May 2021 in Electronics
Verified
Journal Article
Open access
PDF file
APAbdullah Al-Noman Patwary
Abdullah Al-Noman Patwary
Ranesh NahaRanesh Naha
Ranesh Naha
Saurabh GargSaurabh Garg
Saurabh Garg
SBSudheer Kumar Battula
Sudheer Kumar Battula
MPMd Anwarul Kaium Patwary
Md Anwarul Kaium Patwary
MGMingwei Gong
Mingwei Gong
Fog computing is an emerging computing paradigm that has come into consideration for the deployment of Internet of Things (IoT) applications amongst researchers and technology industries over the last few years. Fog is highly distributed and consists of a wide number of autonomous end devices, which contribute to the processing. However, the variety of devices offered across different users are not audited. Hence, the security of Fog devices is a major concern that should come into consideration. Therefore, to provide the necessary security for Fog devices, there is a need to understand what the security concerns are with regards to Fog. All aspects of Fog security, which have not been covered by other literature works, need to be identified and aggregated. On the other hand, privacy preservation for user’s data in Fog devices and application data processed in Fog devices is another concern. To provide the appropriate level of trust and privacy, there is a need to focus on authentication, threats and access control mechanisms as well as privacy protection techniques in Fog computing. In this paper, a survey along with a taxonomy is proposed, which presents an overview of existing security concerns in the context of the Fog computing paradigm. Moreover, the Blockchain-based solutions towards a secure Fog computing environment is presented and various research challenges and directions for future research are discussed.

1 March 2022 in The Astrophysical Journal Letters
Verified
Journal Article
Open access
MKManoj Kovalam
Manoj Kovalam
MPMd Anwarul Kaium Patwary
Md Anwarul Kaium Patwary
ASAnala K. Sreekumar
Anala K. Sreekumar
LWLinqing Wen
Linqing Wen
FPFiona Helen Panther
Fiona Helen Panther
QCQi Chu
Qi Chu
Gravitational waves from binary neutron star mergers can be used as alerts to enable prompt follow-up observations. In particular, capturing prompt electromagnetic and astroparticle emissions from the moment of a binary merger presents unique constraints on the timescale and sky localization for online gravitational-wave detection. Here we present the expected performance of the SPIIR online detection pipeline that is designed for this purpose in the upcoming international LIGO–Virgo’s 4th Science Run (O4). Using simulated Gaussian data for the two LIGO observatories with expected O4 sensitivity, we demonstrate that there is a nonnegligible opportunity to deliver premerger warnings at least 10 s before the final plunge. These alerts are expected to be issued at a nominal rate of one binary neutron star coalescence per year and localized within a median searched area of 300 deg2. We envision such detection to be extremely useful for follow-up observatories with a large field of view such as the Murchison Widefield Array radio facility in Western Australia.

29 January 2019
Verified
Conference Paper
Open access
MPMd Anwarul Kaium Patwary
Md Anwarul Kaium Patwary
Saurabh GargSaurabh Garg
Saurabh Garg
BKByeong Kang
Byeong Kang

23 December 2021 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
MPMd Anwarul Kaium Patwary
Md Anwarul Kaium Patwary
Saurabh GargSaurabh Garg
Saurabh Garg
SBSudheer Kumar Battula
Sudheer Kumar Battula
BKByeong Ho Kang
Byeong Ho Kang
The time-evolving large graph has received attention due to it's participation in real-world applications such as social networks and PageRank calculation. It is necessary to partition a large-scale dynamic graph in a streaming manner in order to overcome the memory bottleneck while partitioning the computational load. Reducing network communication and balancing the load between the partitions are the criteria for achieving effective run-time performance in graph partitioning. Moreover, an optimal resource allocation is needed to utilise the resources while storing the graph streams into the partitions. A number of existing partitioning algorithms have been proposed to address the above problem. However, these partitioning methods are incapable of scaling the resources and handling the stream of data in real-time. In this study, we propose a dynamic graph partitioning method called Scalable Dynamic Graph Partitioner(SDP) using the streaming partitioning technique. The SDP contributes a novel vertex assigning method, communication-aware balancing method, and a scaling technique in order to produce an efficient dynamic graph partitioner. Experiment results show that the proposed method achieves up to 90% reduction of communication cost and 60%-70% balancing the load dynamically, compared with previous algorithms. Moreover, the proposed algorithm significantly reduces the execution time during partitioning.

1 March 2020 in arXiv
Verified
Preprint
Open access
PDF file
APAbdullah Al-Noman Patwary
Abdullah Al-Noman Patwary
AFAnmin Fu
Anmin Fu
Ranesh NahaRanesh Naha
Ranesh Naha
SBSudheer Kumar Battula
Sudheer Kumar Battula
Saurabh GargSaurabh Garg
Saurabh Garg
EAErfan Aghasian
Erfan Aghasian
Fog computing is an emerging computing paradigm that has come into consideration for the deployment of IoT applications amongst researchers and technology industries over the last few years. Fog is highly distributed and consists of a wide number of autonomous end devices, which contribute to the processing. However, the variety of devices offered across different users are not audited. Hence, the security of Fog devices is a major concern in the Fog computing environment. Furthermore, mitigating and preventing those security measures is a research issue. Therefore, to provide the necessary security for Fog devices, we need to understand what the security concerns are with regards to Fog. All aspects of Fog security, which have not been covered by other literature works needs to be identified and need to be aggregate all issues in Fog security. It needs to be noted that computation devices consist of many ordinary users, and are not managed by any central entity or managing body. Therefore, trust and privacy is also a key challenge to gain market adoption for Fog. To provide the required trust and privacy, we need to also focus on authentication, threats and access control mechanisms as well as techniques in Fog computing. In this paper, we perform a survey and propose a taxonomy, which presents an overview of existing security concerns in the context of the Fog computing paradigm. We discuss the Blockchain-based solutions towards a secure Fog computing environment and presented various research challenges and directions for future research.

18 August 2020 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
Ujjwal KCUjjwal KC
Ujjwal KC
SBSudheer Kumar Battula
Sudheer Kumar Battula
Saurabh GargSaurabh Garg
Saurabh Garg
Ranesh NahaRanesh Naha
Ranesh Naha
MPMd Anwarul Kaium Patwary
Md Anwarul Kaium Patwary
ABAlexander Brown
Alexander Brown