The following pages link to Ming-Jer Tsai (Q436763):
Displayed 10 items.
- Distributed reformation of core-based group-shared multicast trees in mobile ad hoc networks (Q436764) (← links)
- An efficient algorithm for enumerating longest common increasing subsequences (Q2695270) (← links)
- On the Construction of Data Aggregation Tree with Minimum Energy Cost in Wireless Sensor Networks: NP-Completeness and Approximation Algorithms (Q2985262) (← links)
- (Q3148345) (← links)
- Constructing a Wireless Sensor Network to Fully Cover Critical Grids by Deploying Minimum Sensors on Grid Points Is NP-Complete (Q4564165) (← links)
- Constructing a Message-Pruning Tree with Minimum Cost for Tracking Moving Objects in Wireless Sensor Networks Is NP-Complete and an Enhanced Data Aggregation Structure (Q4589597) (← links)
- Retrieval-Guaranteed Location-Aware Information Brokerage Scheme in 3D Wireless Ad Hoc Networks (Q5274377) (← links)
- GPS-Free, Boundary-Recognition-Free, and Reliable Double-Ruling-Based Information Brokerage Scheme in Wireless Sensor Networks (Q5274699) (← links)
- Message-Efficient Location Prediction for Mobile Objects in Wireless Sensor Networks Using a Maximum Likelihood Technique (Q5280575) (← links)
- ProgressFace: An Algorithm to Improve Routing Efficiency of GPSR-Like Routing Protocols in Wireless Ad Hoc Networks (Q5280756) (← links)