Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Parama Bhaumik

dblp:23/386 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
1since 2021 · last 2023
0000-0003-2501-0558ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2Software engineering, systems software and programming languages · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Blockchain and cryptocurrency security · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Blockchain and cryptocurrency security
blockchain applications
0.712023
A Solution to Blockchain Smart Contract Based Parametric Transport and Logistics Insurance · IEEE Trans. Serv. Comput. 2023
Blockchain and cryptocurrency security
parametric insurance
0.712023
A Solution to Blockchain Smart Contract Based Parametric Transport and Logistics Insurance · IEEE Trans. Serv. Comput. 2023
Blockchain and cryptocurrency security
smart contract
0.712023
A Solution to Blockchain Smart Contract Based Parametric Transport and Logistics Insurance · IEEE Trans. Serv. Comput. 2023
Distributed systems › distributed database
distributed ledger
0.212023
A Solution to Blockchain Smart Contract Based Parametric Transport and Logistics Insurance · IEEE Trans. Serv. Comput. 2023

Methods — techniques the papers use, named apart from their topics

smart contract design · 1.3
YearPublicationVenuePosition
2023 A Solution to Blockchain Smart Contract Based Parametric Transport and Logistics Insurance
abstract
Traditional insurance policies pay the insurer according to the actual loss or damage to a tangible object that is insured. Due to the numerous parties involved, the settlement procedure is usually highly drawn out. Comparatively, parametric insurance protects a policyholder from the occurrence of a particular event by disbursing a predetermined sum dependent on the severity of the event. In the transportation sector, supply chain disruptions caused by delays are precisely the kind of event that parametric insurance may be able to cover. Transportation delays can happen for several reasons. Events like adverse weather, heavy traffic, and poor road conditions can all slow down the logistics supply chain. An occurrence triggers parametric insurance claims. Unfavorable scenarios can be insured, and claims can be automatically processed depending on policy criteria and conditions. The standard centralized database technique can be utilized to build parametric insurance schemes; however, the data is open to manipulation. This article examines how to create parametric transport insurance using blockchain. It discusses user journey, technology solutions, design and implementation problems, and parametric service insurance. The blueprint for transportation parametric insurance can be used in other fields including Agriculture (Crop Insurance) (Jha et al, 2021), Disaster Insurance (Parametric disaster insurance, Feb. 2023), Aviation, Travel, and manufacturing industry.
Hiren Dutta, Saurabh Nagesh, Jawahar Talluri, Parama Bhaumik
IEEE Trans. Serv. Comput.4
2015 Analysing social behaviour and message dissemination in human based delay tolerant network
Suvadip Batabyal, Parama Bhaumik
Wirel. Networks2
2014 Analysis of social structure and routing in human based delay tolerant network
abstract
Recent advances in mobile communication shows proliferation in networks formed by human carried devices known as the Pocket Switched Network (PSN). In this paper we analyze the nature of community formation since communication in such networks is highly dependent on the socializing behavior of humans. Using real world mobility traces we propose an online algorithm for the nodes to detect their community members based on the mobility parameters contact time (CT) and inter-contact time (ICT). We also derive an estimator for power-law index since CT and ICT follow power-law distribution. Based on the obtained information we propose a social based routing algorithm, named Community Aware Two-Hop routing, and compare it with generic Epidemic and Prophet routing and Bubble-Rap, a social based routing. Results show that the proposed routing protocol performs better than Bubble-Rap and achieve similar performance with respect to Epidemic and Prophet, but at a much lower cost.
Suvadip Batabyal, Parama Bhaumik
MSWiM2