Lui Sha

Lui Sha

Auto-generated profile, based on publicly available information

Lui Sha

Department of Computer Science, University of Illinois Urbana-Champaign, Urbana, USA

Research Focus & Metrics

Academic Career Length

39Years (1988-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 July 2001 in IEEE Software
Verified
Journal Article
Closed access
LSLui Sha
Lui Sha

2 August 2004 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
WCWei-Peng Chen
Wei-Peng Chen
JHJ.C. Hou
J.C. Hou
LSLui Sha
Lui Sha
We devise and evaluate a fully decentralized, light-weight, dynamic clustering algorithm for target tracking. Instead of assuming the same role for all the sensors, we envision a hierarchical sensor network that is composed of 1) a static backbone of sparsely placed high-capability sensors which assume the role of a cluster head (CH) upon triggered by certain signal events and 2) moderately to densely populated low-end sensors whose function is to provide sensor information to CHs upon request. A cluster is formed and a CH becomes active, when the acoustic signal strength detected by the CH exceeds a predetermined threshold. The active CH then broadcasts an information solicitation packet, asking sensors in its vicinity to join the cluster and provide their sensing information. We address and devise solution approaches (with the use of Voronoi diagram) to realize dynamic clustering: (I1) how CHs operate with one another to ensure that only one CH (preferably the CH that is closes to the target) is active with high probability, (I2) when the active CH solicits for sensor information, instead of having all the sensors in its vicinity reply, only a sufficient number of sensors respond with nonredundant, essential information to determine the target location, and (I3) both the packets that sensors send to their CHs and packets that CHs report to subscribers do not incur significant collision. Through both probabilistic analysis and ns-2 simulation, we use with the use of Voronoi diagram, the CH that is usually closes to the target is (implicitly) selected as the leader and that the proposed dynamic clustering algorithm effectively eliminates contention among sensors and renders more accurate estimates of target locations as a result of better quality data collected and less collision incurred.

28 July 2003 in Proceedings of the IEEE
Verified
Journal Article
Closed access
JSJ.A. Stankovic
J.A. Stankovic
TAT.F. Abdelzaher
T.F. Abdelzaher
CLChengyang Lu
Chengyang Lu
LSLui Sha
Lui Sha
JHJ.C. Hou
J.C. Hou
Sensor networks can be considered distributed computing platforms with many severe constraints, including limited CPU speed, memory size, power, and bandwidth. Individual nodes in sensor networks are typically unreliable and the network topology dynamically changes, possibly frequently. Sensor networks also differ because of their tight interaction with the physical environment via sensors and actuators. Because of this interaction, we find that sensor networks are very data-centric. Due to all of these differences, many solutions developed for general distributed computing platforms and for ad-hoc networks cannot be applied to sensor networks. After discussing several motivating applications, this paper first discusses the state of the art with respect to general research challenges, then focuses on more specific research challenges that appear in the networking, operating system, and middleware layers. For some of the research challenges, initial solutions or approaches are identified.

9 May 2005 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
NLNing Li
Ning Li
JHJ.C. Hou
J.C. Hou
LSL. Sha
L. Sha
In this paper, we present a minimum spanning tree (MST)-based algorithm, called local minimum spanning tree (LMST), for topology control in wireless multihop networks. In this algorithm, each node builds its LMST independently and only keeps on-tree nodes that are one-hop away as its neighbors in the final topology. We analytically prove several important properties of LMST: 1) the topology derived under LMST preserves the network connectivity; 2) the node degree of any node in the resulting topology is bounded by 6; and 3) the topology can be transformed into one with bidirectional links (without impairing the network connectivity) after removal of all unidirectional links. Simulation results show that LMST can increase the network capacity as well as reduce the energy consumption.

1 April 1990 in Computer
Verified
Journal Article
Closed access
LSLui Sha
Lui Sha
JGJ.B. Goodenough
J.B. Goodenough
Rate monotonic scheduling theory puts real-time software engineering on a sound analytical footing. The authors review the theory and its implications for Ada.<>

26 June 2003
Verified
Conference Paper
Closed access
MCM. Caccamo
M. Caccamo
LZL.Y. Zhang
L.Y. Zhang
LSLui Sha
Lui Sha
GBG. Buttazzo
G. Buttazzo
Recent advances in wireless technology have brought us closer to the vision of pervasive computing where sensors/actuators can be connected through a wireless network. Due to cost constraints and the dynamic nature of sensor networks, it is undesirable to assume the existence of base stations connected by a wired backbone. In this paper, we present a network architecture suitable for sensor networks along with a medium access control protocol based on earliest deadline first.