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

Navin Kumar Sharma

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

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

Systems, architecture and hardware · 1Computer 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
Wireless networking · 100%

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

TopicWeightPapersLastEvidence papers
Wireless networking › wireless personal area network
bluetooth
0.112007
Bottom-Up Construction of Bluetooth Topology under a Traffic-Aware Scheduling Scheme · IEEE Trans. Mob. Comput. 2007
Wireless networking › scheduling › scheduling policy
traffic-aware scheduling
0.012007
Bottom-Up Construction of Bluetooth Topology under a Traffic-Aware Scheduling Scheme · IEEE Trans. Mob. Comput. 2007

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

priority-based polling · 0.1
YearPublicationVenuePosition
2007 Bottom-Up Construction of Bluetooth Topology under a Traffic-Aware Scheduling Scheme
abstract
We propose a Bluetooth topology construction protocol that works in conjunction with a priority-based polling scheme. A master assigns a priority to its slaves including bridges for each polling cycle and then polls them as many times as the assigned priority. The slaves can spend their idle time either in a power-saving mode or perform new node discovery. The topology construction algorithm works in a bottom-up manner in which isolated nodes join to form small piconets. These small piconets can combine to form larger piconets. Larger piconets can start sharing bridge nodes to form a scatternet. Individual piconets can also discover new nodes while participating in the master-driven polling process. The shutting down of master and slave nodes is detected for dynamic restructuring of the scatternet. The protocol can handle situations when all the Bluetooth nodes are not within radio range of each other
Rajarshi Roy 0001, Mukesh Kumar 0003, Navin Kumar Sharma, Shamik Sural
IEEE Trans. Mob. Comput.3
2004 Dynamic Topology Construction in Bluetooth Scatternets
Rajarshi Roy 0001, Mukesh Kumar 0003, Navin Kumar Sharma, Shamik Sural
HiPC3