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

Hüseyin Özgür Tan

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

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

Systems, architecture and hardware · 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 · 91% Routing and switching · 9%

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

TopicWeightPapersLastEvidence papers
Internet of things and sensor networks › wireless sensor network › data aggregation
data aggregation tree
0.112011
Computing Localized Power-Efficient Data Aggregation Trees for Sensor Networks · IEEE Trans. Parallel Distributed Syst. 2011
Internet of things and sensor networks › energy efficiency
energy-efficient routing
0.112011
Computing Localized Power-Efficient Data Aggregation Trees for Sensor Networks · IEEE Trans. Parallel Distributed Syst. 2011
Internet of things and sensor networks
wireless sensor network
0.112011
Computing Localized Power-Efficient Data Aggregation Trees for Sensor Networks · IEEE Trans. Parallel Distributed Syst. 2011
Routing and switching › routing protocol
route maintenance
0.012011
Computing Localized Power-Efficient Data Aggregation Trees for Sensor Networks · IEEE Trans. Parallel Distributed Syst. 2011

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

minimum spanning tree approximation · 0.1localized topology construction · 0.1
YearPublicationVenuePosition
2011 Computing Localized Power-Efficient Data Aggregation Trees for Sensor Networks
abstract
We propose localized, self organizing, robust, and energy-efficient data aggregation tree approaches for sensor networks, which we call Localized Power-Efficient Data Aggregation Protocols (L-PEDAPs). They are based on topologies, such as LMST and RNG, that can approximate minimum spanning tree and can be efficiently computed using only position or distance information of one-hop neighbors. The actual routing tree is constructed over these topologies. We also consider different parent selection strategies while constructing a routing tree. We compare each topology and parent selection strategy and conclude that the best among them is the shortest path strategy over LMST structure. Our solution also involves route maintenance procedures that will be executed when a sensor node fails or a new node is added to the network. The proposed solution is also adapted to consider the remaining power levels of nodes in order to increase the network lifetime. Our simulation results show that by using our power-aware localized approach, we can almost have the same performance of a centralized solution in terms of network lifetime, and close to 90 percent of an upper bound derived here.
Hüseyin Özgür Tan, Ibrahim Korpeoglu, Ivan Stojmenovic
IEEE Trans. Parallel Distributed Syst.1
2007 A Distributed and Dynamic Data Gathering Protocol for Sensor Networks
abstract
In this paper we propose a distributed, self organizing, robust and energy efficient data gathering algorithm for sensor networks operating in environments where all the sensor nodes are not in direct communication range of each other and data aggregation is used while routing. Proposed algorithm is based on local minimum spanning tree (LMST) structure, which nodes can construct from the position of their 1-hop neighbors. Reporting tree is constructed from the sink by allowing only edges of LMST to join the tree, plus possibly some direct links to the sink. Each node selects as parent the LMST neighbor so that the total energy cost of route to the sink is minimal. We also describe route maintenance protocols to respond to predicted sensor failures and addition of new sensors. Our simulation results show that our algorithm prolongs the network lifetime significantly compared to some alternative schemes.
Hüseyin Özgür Tan, Ibrahim Korpeoglu, Ivan Stojmenovic
AINA1