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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Sanjay Segu Nagesh

dblp:331/1850 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2024
0000-0001-5588-0701ORCID · corroborated

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

Computer networks · 1 · 1 first-author · 1 since 2021Security and privacy · 1 · 1 first-author · 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.

Computer networks
1 paper
Edge and fog computing · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%

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

TopicWeightPapersLastEvidence papers
Edge and fog computing › mobile edge computing
computation offloading
0.612022
Opportunistic mobile crowd computing: task-dependency based work-stealing · MobiCom 2022
Parallel and multicore computing › load balancing › dynamic load balancing
work stealing
0.612022
Opportunistic mobile crowd computing: task-dependency based work-stealing · MobiCom 2022

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

work-stealing algorithm · 1.1
YearPublicationVenuePosition
2024 Honeybee-RS: Enhancing Trust through Lightweight Result Validation in Mobile Crowd Computing
abstract
Mobile Crowd Computing (MCC) leverages the collaborative power of nearby devices to solve resource-intensive tasks, offering transformative potential across various fields. However, ensuring device reliability—which directly impacts the trustworthiness of devices in MCC environments—poses a significant challenge. Balancing validation accuracy with performance and energy efficiency is particularly difficult due to MCC’s dynamic and resource-constrained decentralized nature. Existing validation methods are not feasible in MCC, as they can negatively affect speed and energy consumption. This paper introduces the Honeybee-RS framework, a novel approach for validating offloaded computational results in MCC environments. Honeybee-RS provides delegator-based validation mechanisms and derives reliability scores from the validation process. Experiments demonstrate the effectiveness of these mechanisms, significantly enhancing reliability in MCC while maintaining performance.
Sanjay Segu Nagesh, Niroshinie Fernando, Seng W. Loke, Azadeh Ghari Neiat, Pubudu N. Pathirana
TrustCom1
2022 Opportunistic mobile crowd computing: task-dependency based work-stealing
abstract
Mobile devices are ubiquitous, heterogeneous and resource constrained. Execution of complex tasks in mobile devices are resource demanding and time-consuming, forcing developers to offload portions of the complex task to cloud or edge computing resources. Task offloading becomes increasingly challenging due to intermittent Internet connectivity, remote resource unavailability, high costs, latency, and limited energy of the mobile device. A mobile device user is typically surrounded by other mobile devices, which can be leveraged to collaboratively compute a resource-intensive task. With the help of a work sharing framework, it is feasible for devices to communicate and collaborate. However, some mobile devices are incapable of computing complex portions of the task, and some can compute in accelerated mode. In this demonstration, we introduce Honeybee-T a collaborative mobile crowd computing framework that uses a work-stealing algorithm. The algorithm allows work sharing with collaborating devices based on devices' computational ability and task-dependencies. The experiments show that by employing Honeybee-T framework, when compared to monolithic execution of a large compute-intensive task, there is a considerable performance gain, as well as energy savings.
Sanjay Segu Nagesh, Niroshinie Fernando, Seng W. Loke, Azadeh Ghari Neiat, Pubudu N. Pathirana
MobiCom1