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

Sindhura Tokala

dblp:77/10157 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2011
—ORCID · none

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

Computer networks · 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
Internet of things and sensor networks · 50% Wireless networking · 25% Network measurement and analytics · 25%
Databases, data mining, and information retrieval
1 paper
Web and social media mining · 100%

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

TopicWeightPapersLastEvidence papers
Internet of things and sensor networks › opportunistic networks
community-aware routing
0.112011
Overlapping communities in dynamic networks: their detection and mobile applications · MobiCom 2011
Network measurement and analytics › network mining
community detection
0.112011
Overlapping communities in dynamic networks: their detection and mobile applications · MobiCom 2011
Wireless networking
mobile ad hoc networks
0.112011
Overlapping communities in dynamic networks: their detection and mobile applications · MobiCom 2011
Internet of things and sensor networks
wireless sensor network
0.112011
Overlapping communities in dynamic networks: their detection and mobile applications · MobiCom 2011
Web and social media mining
online social networks
0.012011
Overlapping communities in dynamic networks: their detection and mobile applications · MobiCom 2011

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

overlapping community detection · 0.2dynamic network analysis · 0.2
YearPublicationVenuePosition
2011 Overlapping communities in dynamic networks: their detection and mobile applications
abstract
Many practical problems on Mobile networking, such as routing strategies in MANETs, sensor reprogramming in WSNs and worm containment in online social networks (OSNs) share an ubiquitous, yet interesting feature in their organizations: community structure. Knowledge of this structure provides us not only crucial information about the network principles, but also key insights into designing more effective algorithms for practical problems enabled by Mobile networking. However, understanding this interesting feature is extremely challenging on dynamic networks where changes to their topologies are frequently introduced, and especially when network communities in reality usually overlap with each other. We focus on the following questions (1) Can we effectively detect the overlapping community structure in a dynamic network? (2) Can we quickly and adaptively update the network structure only based on its history without recomputing from scratch? (3) How does the detection of network communities help mobile applications? We propose AFOCS, a two-phase framework for not only detecting quickly but also tracing effectively the evolution of overlapped network communities in dynamic mobile networks. With the great advantages of the overlapping community structure, AFOCS significantly helps in reducing up to 7 times the infection rates in worm containment on OSNs, and up to 11 times overhead while maintaining good delivery time and ratio in forwarding strategies in MANETs.
Nam P. Nguyen, Thang N. Dinh, Sindhura Tokala, My T. Thai
MobiCom3