—E-limited (or K-limited) scheduling is attractive because its performance is close to that of the exhaustive scheduling which is proven to be the optimal polling scheme for symm...
An optimal routing and data aggregation scheme for wireless sensor networks is proposed in this paper. The objective is to maximize the network lifetime by jointly optimizing data ...
Transmissions over wireless and other unreliable networks can lead to packet loss. An area that has received limited research attention is how to tailor multimedia information tak...
The pervasiveness and operational autonomy of mesh-based wireless sensor networks (WSNs) make them an ideal candidate in offering sustained monitoring functions at reasonable cost...
Rick W. Ha, Pin-Han Ho, Sherman X. Shen, Junshan Z...
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...