Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

2013

Computer and Systems Architecture

Singapore Management University

Wireless sensor network

Articles 1 - 2 of 2

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 Oct 2013

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 May 2013

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 …