Dynamic node scheduling for elimination overlapping sensing in sensor networks with dense distribution

Authors:
Kyungjun Kim;Jaemin Son;Hoseung Lee;Kijun Han;Wonyeul Lee
Affiliations:
School of Information & Communication, Daegu University, Korea;Department of Computer Engineering, Kyungpook National University, Korea;Department of Computer Engineering, Kyungpook National University, Korea;Department of Computer Engineering, Kyungpook National University, Korea;Department of Information and communication, Youngsan University, Korea
Venue:
APWeb'06 Proceedings of the 2006 international conference on Advanced Web and Network Technologies, and Applications
Year:
2006

Citing 4
Cited 0

Geography-informed energy conservation for Ad Hoc routing

Proceedings of the 7th annual international conference on Mobile computing and networking
Topology management for sensor networks: exploiting latency and density

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Optimizing Sensor Networks in the Energy-Latency-Density Design Space

IEEE Transactions on Mobile Computing
ASCENT: Adaptive Self-Configuring sEnsor Networks Topologies

IEEE Transactions on Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of the main challenges in wireless sensor networks is to maximize network life time and to minimize power consumption. We propose an energy efficient mechanism for selecting active node which involved in sensing operation in a given dense field. Unlike traditional approaches, this architecture can obtained the complete self-organization of nodes as well as the connectivity of the network. This mechanism can reduce the communication cost by decreasing the number of sensing nodes in highly dense area. Our results show that the dynamic scheduling mechanism of our proposed scheme allows them to outperform existing mechanisms over a variety of scenarios. Our simulation results show that our mechanism reduces the number of transmitted packets in dense sensing area.