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

Y. M. Ko

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

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

Computer networks · 1 · 1 first-author

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 · 70% Network performance modeling · 30%

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

TopicWeightPapersLastEvidence papers
Internet of things and sensor networks
data dissemination
0.112010
Epidemic-Based Information Dissemination in Wireless Mobile Sensor Networks · IEEE/ACM Trans. Netw. 2010
Network performance modeling
epidemic modeling
0.112010
Epidemic-Based Information Dissemination in Wireless Mobile Sensor Networks · IEEE/ACM Trans. Netw. 2010
Internet of things and sensor networks
wireless sensor network
0.112010
Epidemic-Based Information Dissemination in Wireless Mobile Sensor Networks · IEEE/ACM Trans. Netw. 2010
Internet of things and sensor networks
mobile sensor networks
0.012010
Epidemic-Based Information Dissemination in Wireless Mobile Sensor Networks · IEEE/ACM Trans. Netw. 2010

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

stochastic modeling · 0.1markov chain · 0.1
YearPublicationVenuePosition
2010 Epidemic-Based Information Dissemination in Wireless Mobile Sensor Networks
abstract
In this paper, we consider wireless mobile sensor networks under extreme environments where nodes: 1) have local knowledge; 2) have limited computational power; 3) make distributed decisions; and 4) move rapidly over time. Information dissemination in these networks (or gossip) can be modeled via epidemic models that analyze behavior of the system mimicking the way diseases spread (or even gossip for that matter). However, the limitation on computational power and energy of nodes forces us to consider explicit stopping criteria that are seldom done in the literature. Furthermore, harsh environments considered in this paper prevent nodes from transmitting sensed information at specified time slots and hence might cause a large variation in intertransmission time distribution. The objective of this paper is to characterize the dynamics of the information spread and obtain performance measures based on stochastic modeling. We start with modeling information flow using a Markov chain and obtain performance measures such as time to transfer information and fraction of nodes receiving information. Then, we provide a method to obtain those performance measures when the assumption on intertransmission time distribution is relaxed, e.g., time-varying transmission rates and nonexponential intertransmission time distributions, which makes our model more realistic. We make a curious finding in that, for our proposed model, the average fraction of nodes receiving information is a parameter-free constant. We also show that our model is scalable and effective.
Y. M. Ko, N. Gautam
IEEE/ACM Trans. Netw.1