Loren Schwiebert

Dr. Loren Schwiebert

orcid

Research Focus & Metrics

Academic Career Length

33Years (1994-Present)

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

Representative Publications

View All Publications
16 July 2001
Verified
Conference Paper
Open access
PDF file
LSLoren Schwiebert
Loren Schwiebert
SGSandeep K.S. Gupta
Sandeep K.S. Gupta
JWJennifer Weinmann
Jennifer Weinmann

22 August 2017 in Physical Review C
Verified
Journal Article
Open access
PDF file
SCShanshan Cao
Shanshan Cao
CPC. Park
C. Park
RBR. A. Barbieri
R. A. Barbieri
SBS. A. Bass
S. A. Bass
DBD. Bazow
D. Bazow
TCThe JETSCAPE Collaboration
The JETSCAPE Collaboration
The modification of hard jets in an extended static medium held at a fixed temperature is studied using three different Monte Carlo event generators: linear Boltzmann transport (LBT), modular all twist transverse-scattering elastic-drag and radiation (MATTER), and modular algorithm for relativistic treatment of heavy-ion interactions (MARTINI). Each event generator contains a different set of assumptions regarding the energy and virtuality of the partons within a jet versus the energy scale of the medium and, hence, applies to a different epoch in the space-time history of the jet evolution. Here modeling is developed where a jet may sequentially transition from one generator to the next, on a parton-by-parton level, providing a detailed simulation of the space-time evolution of medium modified jets over a much broader dynamic range than has been attempted previously in a single calculation. Comparisons are carried out for different observables sensitive to jet quenching, including the parton fragmentation function and the azimuthal distribution of jet energy around the jet axis. The effect of varying the boundary between different generators is studied and a theoretically motivated criterion for the location of this boundary is proposed. The importance of such an approach with coupled generators to the modeling of jet quenching is discussed.

1 January 2001
Verified
Conference Paper
Closed access
ASA. Salhieh
A. Salhieh
JWJ. Weinmann
J. Weinmann
MKM. Kochhal
M. Kochhal
LSLoren Schwiebert
Loren Schwiebert
Wireless sensor networks have become possible because of the on-going improvements in sensor technology and VLSI. One issue in smart sensor networks is achieving efficient operation because of the limited available power. For important classes of sensor networks, such as biomedical sensors, the locations of the sensing nodes are fixed and the placement can be pre-determined. In this paper, we consider the topology that best supports communication among these sensor nodes. We propose a power-aware routing protocol and simulate the performance, showing that our routing protocol adapts routes to the available power. This leads to a reduction in the total power used as well as more even power usage across nodes. We consider different routes and topologies, demonstrating the difference in performance and explaining the underlying causes.

1 January 2005
Verified
Book Chapter
Closed access
PDF file
QTQinghui Tang
Qinghui Tang
NTNaveen Tummala
Naveen Tummala
SGSandeep K. S. Gupta
Sandeep K. S. Gupta
LSLoren Schwiebert
Loren Schwiebert

1 February 2017 in JMIR mHealth and uHealth
Verified
Journal Article
Open access
LBLorraine Buis
Lorraine Buis
LHLindsey Hirzel
Lindsey Hirzel
RDRachelle M Dawood
Rachelle M Dawood
KDKatee L Dawood
Katee L Dawood
LNLauren P Nichols
Lauren P Nichols
PLPhillip Levy
Phillip Levy
Mobile and tablet apps, ubiquitous and pervasive computing, wearable computing and domotics for health.

1 January 2003
Verified
Conference Paper
Closed access
VAV. Annamalai
V. Annamalai
SGS.K.S. Gupta
S.K.S. Gupta
LSLoren Schwiebert
Loren Schwiebert
A Wireless Sensor Network (WSN) consists of sensors implanted in an environment for collecting and transmitting data re- garding changes in the environment based on the requests from a controlling device (called base station) using wireless communica- tion. WSNs are being used in medical, military, and environment monitoring applications. Broadcast (dissemination of information from a central node) and Convergecast (gathering of information towards a central node) are important communication paradigms across all application domains. Most sensor applications involve both convergecasting and broadcasting. The time taken to complete either of them has to be kept minimal. This can be accomplished by con- structing an efficient tree for both broadcasting as well as converge- casting and allocating wireless communication channels to ensure collision-free communication. There exist several works on broad- casting in multi-hop radio networks (a.k.a. ad hoc networks) which can also be used for broadcasting in WSNs. These algorithms con- struct a broadcast tree and compute a schedule for transmitting and receiving for each node to achieve collision-free broadcasting. In this paper we show that we need a new algorithm for applica- tions which involve both convergecasting and broadcasting since the broadcast tree may not be efficient for convergecasting. So we pro- pose a heuristic algorithm (Convergecasting Tree Construction and Channel Allocation Algorithm (CTCCAA)) which constructs a tree with schedules assigned to nodes for collision free convergecasting. The algorithm is capable of code allocation (Direct Sequence Spread Spectrum (DSSS)/ Frequency Hopping Spread Spectrum (FHSS)), in case multiple codes are available, to minimize the total duration required for convergecasting. We also show that the same tree can be used for broadcasting and is as efficient as a tree exclusively con- structed for broadcasting.