• Publications
  • Influence
Improving network lifetime using sensors with adjustable sensing ranges
TLDR
This paper addresses the target coverage problem in wireless sensor networks with adjustable sensing range by mathematically model solutions to the AR-SC problem and design heuristics that efficiently compute the sets. Expand
Maximum network lifetime in wireless sensor networks with adjustable sensing ranges
TLDR
This paper mathematically model solutions to the adjustable range set covers (AR-SC) problem and design heuristics that efficiently compute the sets and simulation results are presented to verify the approaches. Expand
An Efficient Algorithm for Constructing Maximum lifetime Tree for Data Gathering Without Aggregation in Wireless Sensor Networks
TLDR
Simulation results show that MITT can achieve longer network lifetime than existing algorithms and formalize the problem of tackling the challenge as to construct a min-max-weight spanning tree, in which the bottleneck nodes have the least number of descendants according to their energy. Expand
Database Resources of the BIG Data Center in 2018
  • Xingjian Lili Junwei Bixia Qing Fuhai Tingting Sisi Lili Li Xu Hao Zhu Tang Zhou Song Chen Zhang Dong Lan Wang, Xingjian Xu, +54 authors Y. Bào
  • Medicine, Computer Science
  • Nucleic Acids Res.
  • 3 October 2017
TLDR
The BIG Data Center is continually expanding, updating and enriching its core database resources through big-data integration and value-added curation, including BioCode (a repository archiving bioinformatics tool codes), Bio project library, Bio sample library, and Science Wikis. Expand
Energy-Efficient Connected Coverage of Discrete Targets in Wireless Sensor Networks
TLDR
This paper generalizes the sleep/active mode by adjusting sensing range to maximize total number of rounds and presents a distributed heuristic to address this problem. Expand
Energy-efficient connected coverage of discrete targets in wireless sensor networks
TLDR
This paper generalises the sleep/active mode by adjusting sensing range to maximise the total number of rounds and two distributed solutions are proposed and simulation results confirm the efficiency of these solutions. Expand
Opportunistic Routing Algebra and its Applications
TLDR
A new OR algebra based on the routing algebra proposed for inter-domain routing is designed, the essential properties of OR are identified in the mathematical language of the OR algebra, and the design space is analyzed in terms of routing metrics for various routing requirements. Expand
coRide: carpool service with a win-win fare model for large-scale taxicab networks
TLDR
This paper presents the first systematic work to design, implement, and evaluate a carpool service, called coRide, in a large-scale taxicab network intended to reduce total mileage for less gas consumption and presents a win-win fare model as the incentive mechanism for passengers and drivers to participate. Expand
Utility-Based Opportunistic Routing in Multi-Hop Wireless Networks
  • Jie Wu, M. Lu, F. Li
  • Computer Science
  • The 28th International Conference on Distributed…
  • 17 June 2008
TLDR
The optimality of utility-based routing through OR without allowing retransmission is explored, and it is observed that the optimal scheme requires exhaustive searching of all paths from source to destination. Expand
Bumping: A Bump-Aided Inertial Navigation Method for Indoor Vehicles Using Smartphones
TLDR
The Bumping method is presented, a Bump-Aided Inertial Navigation method that significantly alleviates the above two problems, and exploits the position information of the readily available speed bumps to provide useful references for the INS. Expand
...
1
2
3
4
5
...