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

Wei Lih Lim

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

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

Computer networks · 2

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
Routing and switching · 61% Network optimization and economics · 39%

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

TopicWeightPapersLastEvidence papers
Routing and switching › routing algorithms
minimum delay routing
0.412019
High Reliability, Low Latency and Cost Effective Network Planning for Industrial Wireless Mesh Networks · IEEE/ACM Trans. Netw. 2019
Network optimization and economics › network design
network planning
0.412019
High Reliability, Low Latency and Cost Effective Network Planning for Industrial Wireless Mesh Networks · IEEE/ACM Trans. Netw. 2019
Routing and switching › fault-tolerant routing
reliable routing
0.412019
High Reliability, Low Latency and Cost Effective Network Planning for Industrial Wireless Mesh Networks · IEEE/ACM Trans. Netw. 2019

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

shortest-hop routing · 0.4heuristic algorithm · 0.4
YearPublicationVenuePosition
2019 High Reliability, Low Latency and Cost Effective Network Planning for Industrial Wireless Mesh Networks
abstract
In this paper, we study high reliability, low latency and cost effective network planning for industrial wireless mesh networks. Based on the requirements of routing reliability, minimum end-to-end delay and reduced deployment cost in wireless mesh networks, such as WirelessHART network, we propose three network planning approaches following the principles of the shortest hops, the least routers and balance of the shortest hops and the least routers, respectively. We then implement the proposed algorithms respectively to generate the network deployment for a given factory layout. Simulation results show that there exists a performance trade-off between these three algorithms. The proposed algorithms have also been implemented and validated in an NS-2 WirelessHART network simulator.
Qian Chen 0005, Wei Lih Lim, Yuen Sam Kwok, Sumei Sun
IEEE/ACM Trans. Netw.3
2018 Automated Network Planning for Industrial Wireless Mesh Networks
abstract
In this paper, we study automated network planning for industrial wireless mesh networks. Based on the requirements of routing reliability in WirelessHART network, we propose two network planning approaches following the principles of the shortest hops and the least routers, respectively. We then implement them in Algorithms 1 and 2 respectively to automatically generate the network deployment for a given factory layout. Simulation results show that there exists a performance tradeoff between the two algorithms. The proposed algorithms have also been implemented and validated in an NS-2 WirelessHART network simulation.
Qian Chen 0005, Wei Lih Lim, Yuen Sam Kwok, Sumei Sun
GLOBECOM3