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

Kulpreet Singh

dblp:23/3951 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2009
0009-0009-4959-3445ORCID · corroborated

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

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

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
Wireless networking · 50% Content delivery and video streaming · 50%
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
Content delivery and video streaming › content retrieval
content discovery
0.112009
Probabilistic Discovery of Semantically Diverse Content in MANETs · IEEE Trans. Mob. Comput. 2009
Wireless networking
mobile ad hoc networks
0.112009
Probabilistic Discovery of Semantically Diverse Content in MANETs · IEEE Trans. Mob. Comput. 2009
Distributed systems
distributed coordination
0.012009
Probabilistic Discovery of Semantically Diverse Content in MANETs · IEEE Trans. Mob. Comput. 2009
Distributed systems
gossip protocols
0.012009
Probabilistic Discovery of Semantically Diverse Content in MANETs · IEEE Trans. Mob. Comput. 2009

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

stochastic analysis · 0.2randomized dissemination · 0.2gossip protocol · 0.2
YearPublicationVenuePosition
2009 Probabilistic Discovery of Semantically Diverse Content in MANETs
abstract
Mobile ad hoc networks rely on the opportunistic interaction of autonomous nodes to form networks without the use of infrastructure. Given the radically decentralized nature of such networks, their potential for autonomous communication is significantly improved when the need for a priori consensus among the nodes is kept to a minimum. This paper addresses an issue within the domain of semantic content discovery, namely, its current reliance on the preexisting agreement between the schema of content providers and consumers. We present OntoMobil, a semantic discovery model for ad hoc networks that removes the assumption of a globally known schema and allows nodes to publish information autonomously. The model relies on the randomized dissemination and replication of metadata through a gossip protocol. Given schemas with partial similarities, the randomized metadata dissemination mechanism facilitates eventual semantic agreement and provides a substrate for the scalable discovery of content. A discovery protocol can then utilize the replicated metadata to identify content within a predictable number of hops using semantic queries. A stochastic analysis of the gossip protocol presents the different trade-offs between discoverability and replication. We evaluate the proposed model by comparing OntoMobil against a broadcast-based protocol and demonstrate that semantic discovery with proactive replication provides good scalability properties, resulting in a high discovery ratio with less overhead than a reactive nonreplicated discovery approach.
Andronikos Nedos, Kulpreet Singh, Raymond Cunningham, Siobhán Clarke
IEEE Trans. Mob. Comput.2
2007 A Gossip Protocol to Support Service Discovery with Heterogeneous Ontologies in MANETs
Andronikos Nedos, Kulpreet Singh, Raymond Cunningham, Siobhán Clarke
WiMob2
2006 Mobile Ad Hoc Services: Semantic Service Discovery in Mobile Ad Hoc Networks
Andronikos Nedos, Kulpreet Singh, Siobhán Clarke
ICSOC2