System architecture directions for networked sensors
ACM SIGPLAN Notices
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Ad Hoc Wireless Networks: Architectures and Protocols
Ad Hoc Wireless Networks: Architectures and Protocols
The impact of spatial correlation on routing with compression in wireless sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
HEED: A Hybrid, Energy-Efficient, Distributed Clustering Approach for Ad Hoc Sensor Networks
IEEE Transactions on Mobile Computing
Isolines: Energy-Efficient Mapping in Sensor Networks
ISCC '05 Proceedings of the 10th IEEE Symposium on Computers and Communications
Routing techniques in wireless sensor networks: a survey
IEEE Wireless Communications
IEEE Communications Magazine
Sensor stream reduction for clustered wireless sensor networks
Proceedings of the 2008 ACM symposium on Applied computing
Sink mobility in wireless sensor networks: a (mis)match between theory and practice
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
The design and implementation of hierarchical evacuation alarm system
AsiaCSN '07 Proceedings of the Fourth IASTED Asian Conference on Communication Systems and Networks
Sink mobility in wireless sensor networks: when theory meets reality
SARNOFF'09 Proceedings of the 32nd international conference on Sarnoff symposium
A loop-based key management scheme for wireless sensor networks
EUC'07 Proceedings of the 2007 conference on Emerging direction in embedded and ubiquitous computing
LBKERS: a new efficient key management scheme for wireless sensor networks
MSN'07 Proceedings of the 3rd international conference on Mobile ad-hoc and sensor networks
Coverage properties of clustered wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Energy-efficient reservation-based medium access control protocol for wireless sensor networks
EURASIP Journal on Wireless Communications and Networking
ICHIT'11 Proceedings of the 5th international conference on Convergence and hybrid information technology
Coordination in wireless sensor-actuator networks: A survey
Journal of Parallel and Distributed Computing
A resource reuse method in cluster sensor networks in ad hoc networks
ACIIDS'12 Proceedings of the 4th Asian conference on Intelligent Information and Database Systems - Volume Part II
Research on the energy hole problem based on unequal cluster-radius for wireless sensor networks
Computer Communications
Correlation-based clustering in wireless sensor network for energy saving protocol
Proceedings of the Fourth Symposium on Information and Communication Technology
Proceedings of the 8th International Conference on Ubiquitous Information Management and Communication
On the optimal randomized clustering in distributed sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
The key challenge in the design and operation of wireless sensor networks (WSNs) is the maximization of system lifetime. Node clustering is commonly considered as one of the most promising techniques for dealing with the given challenge, and as such has been referred to by many researchers. It is interesting to observe, however, that very few, if any, published research works provide explicit analysis of node clustering in WSNs and/or manage to prove its actual effectiveness. In this paper we take a closer analytical look at WSNs of clustered organization. We prove that these networks do not necessarily outperform non-clustered WSNs. The condition that ensures superior performance of clustered WSNs, with absolute certainty, is that the formed clusters lie within the isoclusters of the monitored phenomenon. We also show that in clustered WSNs which satisfy the given condition, cluster sizes do not need to match the sizes of their respective underlying isoclusters. Instead, simple 5-hop clusters can provide near-optimal network performance under a wide range of cluster-tosink and cluster-to-isocluster spatial arrangements.