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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Chong, C.Y., Kumar, S.P.: Sensor Networks: Evolution, Opportunities, and Challenges. In: Proceeding of the IEEE, August 2003, vol. 91(8), pp. 1247–1256 (2003)
Cerpa, A., Estrin, E.: ASCENT: Adaptive Self-Configuring sEnsor Networks Topologies. IEEE Transaction on Mobile Computing 3(3), 272–284 (2004)
Xu, Y., Heidemann, J., Estrin, D.: Geography-informed Energy Conservation for Ad Hoc Routing. In: Proc. of Mobicom 2001, pp. 70–84 (July 2001)
Tian, D., Georganas, N.D.: A Node Scheduling Scheme for Energy Conservation in large Wireless Sensor Networks. Wireless Communication and Mobile Computing 3, 271–289 (2003)
Zhu, J., Papavassiliou, S.: On the Energy-Efficient Organization and the Lifetime of Multi-Hop Sensor Network. IEEE Communication Letter 7(11), 535–539 (2004)
Arnon, S.: Deriving an Upper Bound on the Average Operation Time of a Wireless Sensor Network. IEEE Communication Letter 9(2), 535–539 (2005)
Schurgers, C., Tsiatsis, V., Ganeriwal, S., Srivastava, M.: Topology Management for Sensor Netwroks: Exploiting Latency and Density. In: Proc. of International Symposium on Mobile Ad Hoc Networking & Computing (MobiHoc 2002), vol. 1(1), pp. 135–145 (June 2002)
Liu, J., Li, B.: Distributed Topology Control in Wireless Sensor Networks with Asymmetric Links. In: Proc. of IEEE GLOBECOM 2003, vol. 3, pp. 1257–1262 (December 2003)
Gober, P., Ziviani, A., Todorova, P., Amorim, M.D., Unerberg, P.H., Fdida, S.: Topology Control and Localization in Wireless Ad Hoc and Sensor Networks. Ad Hoc & Sensor Wireless Networks 1, 301–321 (2005)
Simon, R., Farrugia, E.: Topology Transparent Support for Sensor Networks. In: Karl, H., Wolisz, A., Willig, A. (eds.) EWSN 2004. LNCS, vol. 2920, pp. 122–137. Springer, Heidelberg (2004)
Chan, H., Perrig, A.: ACE: An Emergent Algorithm for Highly Uniform Cluster Formation. In: Karl, H., Wolisz, A., Willig, A. (eds.) EWSN 2004. LNCS, vol. 2920, pp. 154–171. Springer, Heidelberg (2004)
Arnon, S.: Deriving an Upper Bound on the Average Operation Time of a Wireless Sensor Network. IEEE Communication Letter 9(2), 535–539 (2005)
Schurgers, C., Tsiatsis, V., Ganerival, S., Srivastava, M.: Optimizing Sensor Networks in the Energy-Latency-Density Design Space. IEEE Transactions on mobile Computing 1(1), 70–80 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, K., Son, J., Lee, H., Han, K., Lee, W. (2006). Dynamic Node Scheduling for Elimination Overlapping Sensing in Sensor Networks with Dense Distribution. In: Shen, H.T., Li, J., Li, M., Ni, J., Wang, W. (eds) Advanced Web and Network Technologies, and Applications. APWeb 2006. Lecture Notes in Computer Science, vol 3842. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11610496_58
Download citation
DOI: https://doi.org/10.1007/11610496_58
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31158-4
Online ISBN: 978-3-540-32435-5
eBook Packages: Computer ScienceComputer Science (R0)