Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben
Wireless Networks
Erschienen in: Wireless Networks 2/2011

01.02.2011

Aggregation convergecast scheduling in wireless sensor networks

verfasst von: Baljeet Malhotra, Ioanis Nikolaidis, Mario A. Nascimento

Erschienen in: Wireless Networks | Ausgabe 2/2011

Einloggen

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

search-config
loading …

Abstract

We consider the problem of scheduling in wireless sensor networks for the purposes of aggregation convergecast. We observe that existing schemes adopt essentially a two phase approach, consisting of, first, a tree construction and, second, a scheduling phase. Following a similar approach, we propose two new improvements, one to each of the two phases. Starting with a new lower bound on the schedule length, we make use of it in the tree construction phase. The tree construction phase consists of solutions to instances of bipartite graph semi-matchings. The scheduling phase is a weight-based priority scheme that obeys dependency (tree) and interference constraints. Our extensive experiments show that, overall, our proposed solution not only outperforms all previously proposed solutions in terms of schedule length, but it also significantly extends the network’s lifetime.
Vorheriger Artikel Capacity of data collection in randomly-deployed wireless sensor networks
Nächster Artikel Distributed algorithms for resource allocation of physical and transport layers in wireless cognitive ad hoc networks

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

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!

Jetzt informieren

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!

Jetzt informieren

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!

Jetzt informieren
Fußnoten
1
That meets the constraints outlined in Sect. 2.
 
2
In this paper whenever we mention an optimal semi-matching, we mean that the semi-matching is optimal with respect to L ∞ norm.
 
3
Because of ties many nodes could produce the same value.
 
4
PER is defined as the ratio of the number of packets that were received successfully over the number of packets that were transmitted.
 
Literatur
1.
2.
Annamalai, V., Gupta, S. K. S., & Schwiebert, L. (2003). On tree-based convergecasting in wireless sensor networks. Proceedings of the IEEE Conference on Wireless Communications and Networking (WCNC’03), 3, 1942–1947.MATH
3.
Chen, X., Hu, X., & Zhu, J. (2005). Minimum data aggregation time problem in wireless sensor networks. Lecture Notes in Computer Sciences, 3794, 133–142.CrossRef
4.
Harvey, N. J. A., Ladner, R. E., Lovász, L., & Tamir, T. (2006). Semi-matchings for bipartite graphs and load balancing. Journal of Algorithms, 59(1), 53–78.MATHCrossRefMathSciNet
5.
Heinzelman, W. H., Chandrakasan, A., & Balakrishnan, H. (2000). Energy-efficient communication protocol for wireless microsensor networks. Proceedings of the 33rd Annual Hawaii International Conference on System Sciences, 2, 1–10.
6.
Huang, S. C.-H., Wan, P.-J., Vu, C. T., Li, Y., & Yao, F. (2007). Nearly constant approximation for data aggregation scheduling in wireless sensor networks. Proceedings of the 26th Conference on Computer Communications (INFOCOM’07), pp. 366–372.
7.
Kesselman, A., & Kowalski, D. R. (2006). Fast distributed algorithm for convergecast in ad hoc geometric radio networks. Journal of Parallel and Distributed Computing, 66(4), 578–585.MATHCrossRef
8.
Madden, S., Franklin, M. J., Hellerstein, J. M., & Hong W. (2002). TAG: A tiny aggregation service for ad-hoc sensor networks. Proceedings of the 5th symposium on Operating systems design and implementation (OSDI’02), 36, 131–146.
9.
Malhotra, B., Nascimento, M. A., & Nikolaidis, I. (2009). Exact top-k queries in wireless sensor networks. Technical Report TR09-16, Dept. of Computing Science, Univ. of Alberta.
10.
Silberstein, A., Munagala, K., & Yang, J. (2006). Energy-efficient monitoring of extreme values in sensor networks. Proceedings of the ACM Conf. on Management of Data (SIGMOD’06), pp. 169–180.
11.
Wan, P.-J., Alzoubi, K. M., & Frieder, O. (2004). Distributed construction of connected dominating set in wireless ad hoc networks. Mobile Networks and Applications, 9(2), 141–149.CrossRef
12.
Wan, P.-J., Huang, S. C.-H., Wang, L., Wan, Z., & Jia, X. (2009) Minimum-latency aggregation scheduling in multihop wireless networks. Proceedings of the 10th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC’09), pp. 185–194.
13.
Wu, M., Xu, J., Tang, X., & Lee, W.-C. (2007). Top-k monitoring in wireless sensor networks. IEEE Transactions on Knowledge and Data Engineering, 19(7), 962–976.CrossRef
14.
Yu, B., Li, J., & Li, Y. (2009). Distributed data aggregation scheduling in wireless sensor networks. Proceedings of the 28th Conference on Computer Communications (INFOCOM’09).
15.
Yu, X., Mehrotra, S., & Venkatasubramanian, N. (2007). Sensor scheduling for aggregate monitoring in wireless sensor networks. Proceedings of the 19th International Conference on Scientific and Statistical Database Management (SSDBM’07), p. 24.
16.
Zhu, J., & Hu, X. (2008). Improved algorithm for minimum data aggregation time problem in wireless sensor networks. Journal of Systems Science and Complexity, 21(4), 626–636.MATHCrossRefMathSciNet
Metadaten
Titel
Aggregation convergecast scheduling in wireless sensor networks
verfasst von
Baljeet Malhotra
Ioanis Nikolaidis
Mario A. Nascimento
Publikationsdatum
01.02.2011
Verlag
Springer US
Erschienen in
Wireless Networks / Ausgabe 2/2011
Print ISSN: 1022-0038
Elektronische ISSN: 1572-8196
DOI
https://doi.org/10.1007/s11276-010-0282-y

Weitere Artikel der Ausgabe 2/2011

Wireless Networks 2/2011 Zur Ausgabe

OriginalPaper

Novel algorithms for the network lifetime problem in wireless settings

OriginalPaper

Model-based object tracking in wireless sensor networks

OriginalPaper

Application layer QoS optimization for multimedia transmission over cognitive radio networks

OriginalPaper

Optimal transmission of high definition video transmission in WiMedia systems

OriginalPaper

A non-cooperative game-theoretic approach to channel assignment in multi-channel multi-radio wireless networks

OriginalPaper

A scalable distributed dynamic address allocation protocol for ad-hoc networks

Neuer Inhalt

    Bildnachweise