Open Access. Powered by Scholars. Published by Universities.®
- Discipline
Articles 1 - 3 of 3
Full-Text Articles in Computer Engineering
Clustering Algorithms For Maximizing The Lifetime Of Wireless Sensor Networks With Energy-Harvesting Sensors, Pengfei Zhang, Gaoxi Xiao, Hwee-Pink Tan
Clustering Algorithms For Maximizing The Lifetime Of Wireless Sensor Networks With Energy-Harvesting Sensors, Pengfei Zhang, Gaoxi Xiao, Hwee-Pink Tan
Research Collection School Of Computing and Information Systems
Motivated by recent developments in wireless sensor networks (WSNs), we present several efficient clustering algorithms for maximizing the lifetime of WSNs, i.e., the duration till a certain percentage of the nodes die. Specifically, an optimization algorithm is proposed for maximizing the lifetime of a single-cluster network, followed by an extension to handle multi-cluster networks. Then we study the joint problem of prolonging network lifetime by introducing energy-harvesting (EH) nodes. An algorithm is proposed for maximizing the network lifetime where EH nodes serve as dedicated relay nodes for cluster heads (CHs). Theoretical analysis and extensive simulation results show that the proposed …
Energy-Neutral Scheduling And Forwarding In Environmentally-Powered Wireless Sensor Networks, Alvin Cerdena Valera, Weng Seng Soh, Hwee-Pink Tan
Energy-Neutral Scheduling And Forwarding In Environmentally-Powered Wireless Sensor Networks, Alvin Cerdena Valera, Weng Seng Soh, Hwee-Pink Tan
Research Collection School Of Computing and Information Systems
In environmentally-powered wireless sensor networks (EPWSNs), low latency wakeup scheduling and packet forwarding is challenging due to dynamic duty cycling, posing time-varying sleep latencies and necessitating the use of dynamic wakeup schedules. We show that the variance of the intervals between receiving wakeup slots affects the expected sleep latency: when the variance of the intervals is low (high), the expected latency is low (high). We therefore propose a novel scheduling scheme that uses the bit-reversal permutation sequence (BRPS) – a finite integer sequence that positions receiving wakeup slots as evenly as possible to reduce the expected sleep latency. At the …
Analysis Of The Feasibility Of Utilizing Wakeup Radios To Optimize Energy And Latency Performance Of Wireless Sensor Networks, Benjamin D. Parks
Analysis Of The Feasibility Of Utilizing Wakeup Radios To Optimize Energy And Latency Performance Of Wireless Sensor Networks, Benjamin D. Parks
Computer and Electronics Engineering: Dissertations, Theses, and Student Research
Wireless sensor networks (WSNs) have the potential to radically improve our lives by pervasive environmental monitoring in many applications. However, there are many applications that would be ideal for WSNs, but where reportable events occur with long (days, weeks) or unpredictable durations between occurrences. These uses are hampered by the high energy and latency costs of always-on and periodic wakeup networks, which waste energy on node synchronization and idle monitoring of the RF channel, and exhibit unacceptably high latency for urgent events, e.g., alarms. This thesis proposes, designs, assembles and tests, in a multi-hop WSN test bed, a wakeup receiver …