Skip to main content
Erschienen in: Wireless Personal Communications 1/2014

01.09.2014

Construction of Tree Network with Limited Delivery Latency in Homogeneous Wireless Sensor Networks

verfasst von: Shengdong Xie, Yuxiang Wang

Erschienen in: Wireless Personal Communications | Ausgabe 1/2014

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In this paper we propose an approximation algorithm, which is called ADCMCST (algorithm with the minimum number of child nodes when the depth is restricted), to construct a tree network for homogeneous wireless sensor network, so as to reduce and balance the payload of each node, and consequently prolong the network lifetime. When the monitoring node obtains the neighbor graph, ADCMCST tries to find a tree topology with a minimum number of child nodes, and then broadcast the topology to every node, and finally a tree network is constructed. Simulation results show that ADCMCST could greatly reduce the topology formation time, and achieve good approximation results; when the compression ratio is less than 70 %, the network lifetime of ADCMCST will be larger than that of energy driven tree construction.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Wang, F., & Liu, J. (2011). Networked wireless sensor data collection: Issues, challenges, and approaches. IEEE Communications Surveys & Tutorial, 13(4), 1–15.CrossRef Wang, F., & Liu, J. (2011). Networked wireless sensor data collection: Issues, challenges, and approaches. IEEE Communications Surveys & Tutorial, 13(4), 1–15.CrossRef
2.
Zurück zum Zitat Zhao, M., Gong, D. W., & Yang, Y. Y. (2010). A cost minimization algorithm for mobile data gathering in wireless sensor networks. In IEEE 7th international conference on mobile adhoc and sensor systems (MASS), San Francisco, CA, pp. 322–331. Zhao, M., Gong, D. W., & Yang, Y. Y. (2010). A cost minimization algorithm for mobile data gathering in wireless sensor networks. In IEEE 7th international conference on mobile adhoc and sensor systems (MASS), San Francisco, CA, pp. 322–331.
3.
Zurück zum Zitat Hwang, K., Choi, B. J., & Kang, S. H. (2010). Enhanced self-configure scheme for a robust Zigbee based home automation. IEEE Transactions on Consumer Electronics, 56(3), 583–590.CrossRef Hwang, K., Choi, B. J., & Kang, S. H. (2010). Enhanced self-configure scheme for a robust Zigbee based home automation. IEEE Transactions on Consumer Electronics, 56(3), 583–590.CrossRef
4.
Zurück zum Zitat Puccinelli, D., & Haenggi, M. (2009, April). Lifetime benefits through load balancing in homogeneous sensor networks. In IEEE wireless communications and networking conference (WCNC) (pp. 1–6). Hungary: Budapest. Puccinelli, D., & Haenggi, M. (2009, April). Lifetime benefits through load balancing in homogeneous sensor networks. In IEEE wireless communications and networking conference (WCNC) (pp. 1–6). Hungary: Budapest.
5.
Zurück zum Zitat Corchado, J. M., Bajo, J., Tapia, D. I., & Abraham, A. (2010). Using heterogeneous wireless sensor networks in a telemonitoring system for healthcare. IEEE Transactions on Information Technology in Biomedicine, 14(2), 234–240.CrossRef Corchado, J. M., Bajo, J., Tapia, D. I., & Abraham, A. (2010). Using heterogeneous wireless sensor networks in a telemonitoring system for healthcare. IEEE Transactions on Information Technology in Biomedicine, 14(2), 234–240.CrossRef
6.
Zurück zum Zitat He, J., Ji, S. L., Yang, M. Y., & Li, Y. S. (2012). Load-balanced CDS construction in wireless sensor networks via genetic algorithm. International Journal of Sensor Networks, 11(3), 166–178.CrossRef He, J., Ji, S. L., Yang, M. Y., & Li, Y. S. (2012). Load-balanced CDS construction in wireless sensor networks via genetic algorithm. International Journal of Sensor Networks, 11(3), 166–178.CrossRef
7.
Zurück zum Zitat Hsieh, M. Y. (2011). Data aggregation model using energy efficient delay scheduling in multi-hop hierarchical wireless sensor networks. IET Communications, 5(18), 2703–2711.CrossRefMATHMathSciNet Hsieh, M. Y. (2011). Data aggregation model using energy efficient delay scheduling in multi-hop hierarchical wireless sensor networks. IET Communications, 5(18), 2703–2711.CrossRefMATHMathSciNet
8.
Zurück zum Zitat Ding, M., & Cheng, X. Z. (2003). Aggregation tree construction in sensor networks. In IEEE 58th vehicular technology conference (VTC) (pp. 2168–2172). Florida, Orlando. Ding, M., & Cheng, X. Z. (2003). Aggregation tree construction in sensor networks. In IEEE 58th vehicular technology conference (VTC) (pp. 2168–2172). Florida, Orlando.
9.
Zurück zum Zitat Wu, Y., Fahmy, S., & Ness, B. S. (2008). On the construction of a maximum lifetime data gathering tree in sensor networks: NP-completeness and approximation algorithm (pp. 356–365). Phoenix, USA: IEEE InfoCom. Wu, Y., Fahmy, S., & Ness, B. S. (2008). On the construction of a maximum lifetime data gathering tree in sensor networks: NP-completeness and approximation algorithm (pp. 356–365). Phoenix, USA: IEEE InfoCom.
10.
Zurück zum Zitat Singhal, D., Barjatiya, & S., Ramamurthy, G. (2011). A novel network architecture for cognitive wireless sensor network. In Proceedings of 2011 international conference on signal processing, communications, computing and networking technologies (pp. 76–80) Thuckalay, India. Singhal, D., Barjatiya, & S., Ramamurthy, G. (2011). A novel network architecture for cognitive wireless sensor network. In Proceedings of 2011 international conference on signal processing, communications, computing and networking technologies (pp. 76–80) Thuckalay, India.
11.
Zurück zum Zitat Andreou, P., Pamboris, A., Zeinalipour, D., Chrysanthis, P.K., & Samaras, G. (2009). ETC: Energy driven tree construction in wireless sensor networks. In IEEE 10th international conference on mobile data management: Systems, services and middleware (MDM), pp. 513–518. Andreou, P., Pamboris, A., Zeinalipour, D., Chrysanthis, P.K., & Samaras, G. (2009). ETC: Energy driven tree construction in wireless sensor networks. In IEEE 10th international conference on mobile data management: Systems, services and middleware (MDM), pp. 513–518.
12.
Zurück zum Zitat Georigios, C., Demetrios, Z. Y., & Dimitrios, G. (2010). Minimum hot spot query tree for wireless sensor networks (pp. 1–8). Indianapolis: ACM MobiDE. Georigios, C., Demetrios, Z. Y., & Dimitrios, G. (2010). Minimum hot spot query tree for wireless sensor networks (pp. 1–8). Indianapolis: ACM MobiDE.
13.
Zurück zum Zitat Pan, M. S., Tsai, C. H., & Tseng, Y. C. (2009). The orphan problem in Zigbee wireless networks. IEEE Transactions on Mobile Computing, 8(11), 1573–1584.CrossRef Pan, M. S., Tsai, C. H., & Tseng, Y. C. (2009). The orphan problem in Zigbee wireless networks. IEEE Transactions on Mobile Computing, 8(11), 1573–1584.CrossRef
14.
Zurück zum Zitat Su, Z., Oguro, M., Okada, Y., Katto, J., & Okubo, S. (2010). Overlay tree construction to distribute layered streaming by application layer multicast. IEEE Transactions on Consumer Electronics, 56(3), 1957–1962.CrossRef Su, Z., Oguro, M., Okada, Y., Katto, J., & Okubo, S. (2010). Overlay tree construction to distribute layered streaming by application layer multicast. IEEE Transactions on Consumer Electronics, 56(3), 1957–1962.CrossRef
15.
Zurück zum Zitat Tavli, B., Bagci, I. E., & Ceylan, O. (2010). Optimal data compression and forwarding in wireless sensor networks. IEEE Communications Letters, 14(5), 408–410.CrossRef Tavli, B., Bagci, I. E., & Ceylan, O. (2010). Optimal data compression and forwarding in wireless sensor networks. IEEE Communications Letters, 14(5), 408–410.CrossRef
16.
Zurück zum Zitat Tsai, H. P., Yang, D. N., & Chen, M. S. (2011). Exploring application level semantics for data compression. IEEE Transactions on Knowledge and Data Engineering, 23(1), 95–109.CrossRef Tsai, H. P., Yang, D. N., & Chen, M. S. (2011). Exploring application level semantics for data compression. IEEE Transactions on Knowledge and Data Engineering, 23(1), 95–109.CrossRef
17.
Zurück zum Zitat Blin, L., & Butelle, F. (2004). The first approximated distributed algorithm for the minimum degree spanning tree problem on general graphs. International Journal of Foundations of Computer Science, 15(3), 507–516.CrossRefMATHMathSciNet Blin, L., & Butelle, F. (2004). The first approximated distributed algorithm for the minimum degree spanning tree problem on general graphs. International Journal of Foundations of Computer Science, 15(3), 507–516.CrossRefMATHMathSciNet
18.
Zurück zum Zitat Lavault, C., & Mario, V. P. (2008). A distributed approximation algorithm for the minimum degree minimum weight spanning trees. Journal of Parallel and Distributed Computing, 68(2), 200–208.CrossRefMATH Lavault, C., & Mario, V. P. (2008). A distributed approximation algorithm for the minimum degree minimum weight spanning trees. Journal of Parallel and Distributed Computing, 68(2), 200–208.CrossRefMATH
19.
Zurück zum Zitat Martin, F., & Balaji, R. (1992). Approximating the minimum degree spanning tree to within one from the optimal degree. In 3th ACM/SIAM symposium on discrete algorithms (SODA) (pp. 317–324). Florida, Orlando. Martin, F., & Balaji, R. (1992). Approximating the minimum degree spanning tree to within one from the optimal degree. In 3th ACM/SIAM symposium on discrete algorithms (SODA) (pp. 317–324). Florida, Orlando.
20.
Zurück zum Zitat Radha, K., & Balaji, R. (2001). The directed minimum degree spanning tree problem. Lecture notes in computer science (LNCS), pp. 232–243. Radha, K., & Balaji, R. (2001). The directed minimum degree spanning tree problem. Lecture notes in computer science (LNCS), pp. 232–243.
21.
Zurück zum Zitat Intanagonwiwat, C., Govindan, R., & Estrin, D. (2000). Directed diffusion: A scalable and robust communication paradigm for sensor networks. In Proceedings of the 6th annual international conference on mobile computing and networking (pp. 56–67). MobiCom: New York, NY. Intanagonwiwat, C., Govindan, R., & Estrin, D. (2000). Directed diffusion: A scalable and robust communication paradigm for sensor networks. In Proceedings of the 6th annual international conference on mobile computing and networking (pp. 56–67). MobiCom: New York, NY.
Metadaten
Titel
Construction of Tree Network with Limited Delivery Latency in Homogeneous Wireless Sensor Networks
verfasst von
Shengdong Xie
Yuxiang Wang
Publikationsdatum
01.09.2014
Verlag
Springer US
Erschienen in
Wireless Personal Communications / Ausgabe 1/2014
Print ISSN: 0929-6212
Elektronische ISSN: 1572-834X
DOI
https://doi.org/10.1007/s11277-014-1748-5

Weitere Artikel der Ausgabe 1/2014

Wireless Personal Communications 1/2014 Zur Ausgabe

Neuer Inhalt