Wireless sensor network, Computer network, Approximation algorithm, Efficient energy use and Scheduling are his primary areas of study. His Wireless sensor network study combines topics in areas such as Distributed algorithm, Distributed computing, Algorithm, Algorithm design and Energy. In general Computer network study, his work on Multicast and Blocking often relates to the realm of Cost efficiency, Rumor and Electronic mail, thereby connecting several areas of interest.
His Approximation algorithm research is multidisciplinary, relying on both Linear programming, Network model and Discrete mathematics. As part of the same scientific family, Yingshu Li usually focuses on Scheduling, concentrating on Brooks–Iyengar algorithm and intersecting with Job shop scheduling. Yingshu Li studied Real-time computing and Visual sensor network that intersect with Sensor node.
His primary scientific interests are in Wireless sensor network, Computer network, Distributed computing, Wireless network and Key distribution in wireless sensor networks. The various areas that Yingshu Li examines in his Wireless sensor network study include Distributed algorithm, Scheduling, Real-time computing and Approximation algorithm. His work in Approximation algorithm addresses subjects such as Discrete mathematics, which are connected to disciplines such as Combinatorics.
His Computer network study combines topics from a wide range of disciplines, such as Wireless and Wireless ad hoc network. Yingshu Li combines subjects such as Data aggregator, Connected dominating set and Network model with his study of Distributed computing. Yingshu Li interconnects Network topology, Mobile computing and Graph in the investigation of issues within Wireless network.
His scientific interests lie mostly in Computer security, Crowdsourcing, Mobile device, Wireless sensor network and Social network. Probabilistic logic, Location-based service and k-anonymity is closely connected to Server in his research, which is encompassed under the umbrella topic of Computer security. His Wireless sensor network study incorporates themes from Distributed algorithm, Distributed computing, Scheduling and Approximation algorithm.
The study incorporates disciplines such as Key distribution in wireless sensor networks, Algorithm design and Connected dominating set in addition to Distributed computing. Computer network covers he research in Scheduling. His Social network research incorporates themes from Machine learning, Empirical research, Maximization and Artificial intelligence.
His primary areas of study are Crowdsourcing, Computer security, Mobile device, Social network and Information privacy. His Computer security research includes themes of Blocking, Differential privacy and Mobile computing. His Mobile device study integrates concerns from other disciplines, such as Hidden Markov model, Artificial intelligence and Bounded function.
He has researched Information privacy in several fields, including Information sensitivity, Inference attack and User profile. His study looks at the intersection of Approximation algorithm and topics like Theoretical computer science with Wireless sensor network. His Wireless sensor network study improves the overall literature in Computer network.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Energy-efficient target coverage in wireless sensor networks
M. Cardei;M.T. Thai;Yingshu Li;Weili Wu.
international conference on computer communications (2005)
Distributed Data Aggregation Scheduling in Wireless Sensor Networks
B. Yu;J. Li;Y. Li.
international conference on computer communications (2009)
Collective Data-Sanitization for Preventing Sensitive Information Inference Attacks in Social Networks
Zhipeng Cai;Zaobo He;Xin Guan;Yingshu Li.
IEEE Transactions on Dependable and Secure Computing (2018)
Wireless Sensor Networks and Applications
Yingshu Li;My T Thai;Weili Wu.
Minimum connected dominating sets and maximal independent sets in unit disk graphs
Weili Wu;Hongwei Du;Xiaohua Jia;Yingshu Li.
Theoretical Computer Science (2006)
Nearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor Networks
S.C.-H. Huang;Peng-Jun Wan;C.T. Vu;Yingshu Li.
ieee international conference computer and communications (2007)
A greedy approximation for minimum connected dominating sets
Lu Ruan;Hongwei Du;Xiaohua Jia;Weili Wu.
Theoretical Computer Science (2004)
On greedy construction of connected dominating sets in wireless networks
Yingshu Li;My T. Thai;Feng Wang;Chih Wei Yi.
Wireless Communications and Mobile Computing (2005)
Sparse target counting and localization in sensor networks based on compressive sensing
Bowu Zhang;Xiuzhen Cheng;Nan Zhang;Yong Cui.
international conference on computer communications (2011)
Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks
Donghyun Kim;Yiwei Wu;Yingshu Li;Feng Zou.
IEEE Transactions on Parallel and Distributed Systems (2009)
Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: