L
Loren Schwiebert
Researcher at Wayne State University
Publications - 89
Citations - 3335
Loren Schwiebert is an academic researcher from Wayne State University. The author has contributed to research in topics: Wireless sensor network & Key distribution in wireless sensor networks. The author has an hindex of 28, co-authored 86 publications receiving 3191 citations. Previous affiliations of Loren Schwiebert include Intel & Arizona State University.
Papers
More filters
Proceedings ArticleDOI
Research challenges in wireless networks of biomedical sensors
TL;DR: The aim is to motivate vigorous research in this area by illustrating the need for more application-specific and novel approaches toward developing wireless networking solutions for human-implanted smart sensors.
Proceedings ArticleDOI
Preserving source location privacy in monitoring-based wireless sensor networks
TL;DR: Wang et al. as mentioned in this paper proposed GROW (greedy random walk), a two-way random walk, i.e., from both source and sink, to reduce the chance an eavesdropper can collect the location information.
Proceedings ArticleDOI
Power efficient topologies for wireless sensor networks
TL;DR: This paper proposes a power-aware routing protocol and simulates the performance, showing that the routing protocol adapts routes to the available power and leads to a reduction in the total power used as well as more even power usage across nodes.
Journal ArticleDOI
Communication scheduling to minimize thermal effects of implanted biosensor networks in homogeneous tissue
TL;DR: This work is the first to consider rotating the cluster leadership to minimize the heating effects on human tissues and proposes a simplified scheme, temperature increase potential, to efficiently predict the temperature increase in tissues surrounding implanted sensors.
Proceedings ArticleDOI
On tree-based convergecasting in wireless sensor networks
TL;DR: A heuristic algorithm is proposed (convergecasting tree construction and channel allocation algorithm (CTCCAA), which constructs a tree with schedules assigned to nodes for collision free convergecasting, and is capable of code allocation in case multiple codes are available to minimize the total duration required for convergecasting.