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
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Bücher
Zeitschriften
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
MTZ-Fachkongress

Antriebe und Energiesysteme von morgen


Austausch von Automobil- und Energiewirtschaft

Am 14./15. Mai geht es in Chemnitz um die Mobilitätswende durch Elektro- und Wasserstofffahrzeuge.
Erweiterte Suche
Anmelden
nach oben
Wireless Personal Communications
Erschienen in: Wireless Personal Communications 2/2019

04.05.2019

SATC: A Simulated Annealing Based Tree Construction and Scheduling Algorithm for Minimizing Aggregation Time in Wireless Sensor Networks

verfasst von: Walid Osamy, Ahmed A. El-sawy, Ahmed M. Khedr

Erschienen in: Wireless Personal Communications | Ausgabe 2/2019

Einloggen

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

search-config
loading …

Abstract

Data collection is one of the most important task in wireless sensor networks where a set of sensor nodes measure properties of a phenomenon of interest and send their data over a routing tree to the sink. In this paper, we propose a new simulated annealing based tree construction algorithm (SATC) to aggregate data with a collision-free schedule for node transmissions. SATC minimizes the time duration of delivering aggregated data to the sink. In the proposed algorithm, the average time latency is considered as the fitness function for the SA algorithm and it is evaluated based on Routing aware MAC scheduling methods. The efficiency of the proposed algorithm is studied through simulation and compared with existing state-of-the-art approaches in terms of average latency and average normalized latency.
Vorheriger Artikel Learning-Based Relay Selection for Cooperative Networks with Space–Time Network Coding
Nächster Artikel Novel Approach of Key Predistribution for Grid Based Sensor Networks

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!

Jetzt informieren

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 "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
Literatur
1.
Salim, A., Osamy, W., & Khedr, A. M. (2014). IBLEACH: Effective LEACH protocol for wireless sensor networks. Wireless Networks, 20, 1515–1525.CrossRef
2.
3.
Aziz, A., Singh, K., Osamy, W., & Khedr, A. M. (2019). Effective algorithm for optimizing compressive sensing in IoT and periodic monitoring applications. Journal of Network and Computer Applications, 126, 12–28.CrossRef
4.
Salim, A., & Osamy, W. (2015). Distributed multi chain compressive sensing based routing algorithm for wireless sensor networks. Wireless Networks, 21, 1379–1390.CrossRef
5.
Natarajan, M. (2012). A comprehensive review and performance analysis of data gathering algorithms for wireless sensor networks. International Journal of Interdisciplinary Telecommunications and Networking (IJITN), 4(2), 1–29.CrossRef
6.
7.
Fasolo, E., Rossi, M., Widmer, J., & Zorzi, M. (2007). In-network aggregation techniques for wireless sensor networks: A survey. IEEE Wireless Communications Journal, 14(2), 7087.
8.
Pham, D., & Karaboga, D. (2012). Intelligent optimisation techniques: Genetic algorithms, tabu search, simulated annealing and neural networks. Berlin: Springer.MATH
9.
Louail, L., & Felea, V. (2016). Routing-aware TDMA scheduling for wireless sensor networks. In 2016 12th annual conference on Wireless On-demand Network Systems and Services (WONS), Cortina d’Ampezzo, pp. 1–8.
10.
Louail, L., & Felea, V. (2016). Routing-aware time slot allocation heuristics in contention-free sensor networks. In L. Mamatas, I. Matta, P. Papadimitriou & Y. Koucheryavy (Eds.), Wired/Wireless Internet Communications. WWIC.
11.
Xujin, C., Hu, X., & Zhu, J. (2005). Minimum data aggregation time problem in wireless sensor networks. In International conference on mobile ad-hoc and sensor netsworks. Berlin, Heidelberg: Springer.
12.
Xujin, C., Hu, X., & Zhu, J. (2009). Data gathering schedule for minimal aggregation time in wireless sensor networks. International Journal of Distributed Sensor Networks, 5(4), 321–337.CrossRef
13.
Bertrand Fotue Fotso, D. (2013). Efficient data aggregation and routing in wireless sensor networks. Networking and Internet Architecture [cs.NI], Tlcom ParisTech, chapter 3.
14.
Yu, B., & Li, J.-Z. (2011). Minimum-time aggregation scheduling in duty-cycled wireless sensor networks. Journal of Computer Science and Technology, 26(6), 962–970.CrossRefMATH
15.
Min Kyung, A., Lam, N. X., Huynh, D. T., & Nguyen, T. N. (2011). Minimum data aggregation schedule in wireless sensor networks. IJ Computers Applications, 18(4), 254–262.
16.
Natarajan, M. (2015). A benchmarking algorithm to determine minimum aggregation delay for data gathering trees and an analysis of the diameter-aggregation delay tradeoff. Algorithms, 8(3), 435–458.MathSciNetCrossRefMATH
17.
Xu, X., Song, M., & Alani, M. (2014). Duty-cycle-aware minimum latency multiflow scheduling in multi-hop wireless networks. In Global Communications Conference (GLOBECOM). IEEE.
18.
Nguyen, N., et al. (2018). An efficient minimum-latency collision-free scheduling algorithm for data aggregation in wireless sensor networks. IEEE Systems Journal, 12(3), 2214–2225.CrossRef
19.
Elham, M., & Ghaffari, A. (2016). Data aggregation tree structure in wireless sensor networks using cuckoo optimization algorithm. Information Systems and Telecommunication, 4, 182–190.
20.
Chou, C., & Chuang, K. (2005) CoLaNet : A cross-layer design of energy-efficient wireless sensor networks. In ICW/ICHSN/ICMCS/SENET, pp. 364–369.
21.
Pham, D., & Karaboga, D. (2012). Intelligent optimisation techniques: Genetic algorithms, tabu search, simulated annealing and neural networks. Berlin: Springer.MATH
22.
23.
Onat, F. A., & Stojmenovic, I. (2007). Generating random graphs for wireless actuator networks. In 2007 IEEE international symposium on a world of wireless, mobile and multimedia networks, Espoo, Finland, pp. 1–12.
24.
Shao-Shan, J., Huang, C.-H., & Guangqiong, Z. (2007). A minimum hop routing protocol for wireless sensor networks. Hua University, 24 2007.12 [China 96.12], pp. 45–57.
Metadaten
Titel
SATC: A Simulated Annealing Based Tree Construction and Scheduling Algorithm for Minimizing Aggregation Time in Wireless Sensor Networks
verfasst von
Walid Osamy
Ahmed A. El-sawy
Ahmed M. Khedr
Publikationsdatum
04.05.2019
Verlag
Springer US
Erschienen in
Wireless Personal Communications / Ausgabe 2/2019
Print ISSN: 0929-6212
Elektronische ISSN: 1572-834X
DOI
https://doi.org/10.1007/s11277-019-06440-9

Weitere Artikel der Ausgabe 2/2019

Wireless Personal Communications 2/2019 Zur Ausgabe

OriginalPaper

Use of Nakagami-m Fading Channel in SSK Modulation and Its Performance Analysis

OriginalPaper

Novel Approach of Key Predistribution for Grid Based Sensor Networks

OriginalPaper

A Probabilistic Model of Clock Offset Estimator (PMCOE) for Clock Synchronization in Wireless Sensor Network

OriginalPaper

Overlay Cognitive Radio Based on OFDM with Channel Estimation Issues

OriginalPaper

Reducing Near–Far Problem in a VDSL Network with Modified IWF Algorithm by Using Fixed Spectral Mask Yielding Improved Data Rate of Near End User

OriginalPaper

Device Discovery Signal Design for Proximal Devices in D2D Communication

Neuer Inhalt

    Bildnachweise