An Effective Routing Cost Approximation in Many-to-Many Communication for Wireless Sensor Networks

Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 214)

Abstract

In the Wireless Sensor Network (WSN) environment, a sensor node spends most of its energy for relaying data packets to multiple sinks simultaneously. So, it is important to shorten the distance that a packet has to travel to reach the sinks. Cluster formation is the most common approach to achieve this by assigning a Cluster Header (CH) closed to member nodes to collect the sensed data. In this paper, we derive a mathematical model to partition the network into some clusters with a proper number of member nodes in order to balance the traffic load among the constituted nodes. Then CH is elected to obtain the minimum internal routing cost in data acquisition among the member nodes in their respective cluster. The elected CH routes the gathered data to sink(s) using the constituted CHs as intermediate nodes contained in the minimum routing cost path. The mechanism of reducing routing cost in every factor of WSNs can be the promising approach in the aspect of network lifetime.

Keywords

Wireless sensor network Spanning tree Cluster Routing cost Energy efficient 

References

  1. 1.
    Heinzelman, W., Chandrakasan, A., Balakrishnan, H.: Energy-efficient communication protocol for wireless microsensor networks. In: Proceedings of the 33rd Annual Hawaii International Conference on System Science (HICSS), pp. 3005–3014, (2000)Google Scholar
  2. 2.
    Yang, S., Yeo, C., Lee, B., Robust geographic routing with virtual destination based void handling for MANETs. In: Vehicular Technology Conference (VTC), pp. 1–5, (2010)Google Scholar
  3. 3.
    Mottola, L., Picco, G.: MUSTER: adaptive energy-aware multisink routing in wireless sensor networks. IEEE Netw. 10(12), 1694–1709 (2011)Google Scholar
  4. 4.
    Gnawali, O., Fonseca, R., Jamieson, K., Moss, D., Levis, P.,: Collection tree protocol. In: Proceedings of the 7th ACM Conference Embedded Ne tworked Sensor Systems, pp. 1–14, (2009)Google Scholar
  5. 5.
    Intanagonwiwat, C., Govindan, R., Estrin, D., Heidemann, J., Silva, F.: Directed diffusion for wireless sensor networking. IEEE/ACM Netw. 11(1), 2–16 (2003)CrossRefGoogle Scholar
  6. 6.
    Woo, A., Tong, T., Culler, D.: Taming the underlying challenges of reliable multihop routing in sensor networks. In: Proceedings of the 1st International Conference on Embedded Networked Sensor Systems, pp. 14–27, (2003)Google Scholar
  7. 7.
    Wu, B., Chao, K.: Spanning Trees and Optimization Problems. Chapman and Hall, Boca Raton (2004)Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2013

Authors and Affiliations

  1. 1.Division of Computer EngineeringChonbuk UniversityJeonjuSouth Korea

Personalised recommendations