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 5/2009

01.07.2009

Energy-efficient scheduling with individual packet delay constraints over a fading channel

verfasst von: Wanshi Chen, Urbashi Mitra, Michael J. Neely

Erschienen in: Wireless Networks | Ausgabe 5/2009

Einloggen

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

search-config
loading …

Abstract

This article focuses on energy-efficient packet transmission with individual packet delay constraints over a fading channel. The problem of optimal offline scheduling (vis-à-vis total transmission energy), assuming information of all packet arrivals and channel states before scheduling, is formulated as a convex optimization problem with linear constraints. The optimality conditions are analyzed. From the analysis, a recursive algorithm is developed to search for the optimal offline scheduling. The optimal offline scheduler tries to equalize the energy-rate derivative function as much as possible subject to causality and delay constraints, in contrast to the equalization of transmission rates for optimal scheduling in static channels. It is shown that the optimal offline schedulers for fading and static channels have a similar symmetry property. Combining the symmetry property with potential idling periods, upper and lower bounds on the average packet delay are derived. The properties of the optimal offline schedule and the impact of packet sizes, individual delay constraints, and channel variations are demonstrated via simulations. A heuristic online scheduling algorithm, assuming causal traffic and channel information, is proposed and shown via simulations to achieve energy and delay performances comparable to those of the optimal offline scheduler in a wide range of scenarios.
Vorheriger Artikel Maximizing network utilization with max–min fairness in wireless sensor networks
Nächster Artikel Rechargeable sensor activation under temporally correlated events

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
Anhänge
Nur mit Berechtigung zugänglich
Fußnoten
1
The case when D = 1 is trivial and hence not considered.
 
2
This continuity argument is due to the fact that the issue herein can be formulated as a convex optimization problem with linear constraints, where the packet sizes are part of the linear constraints, as will be shown in Sect. 3.
 
3
Note that if slot \(m\,{\ge}\,M\) ends with an empty buffer, all the subsequent slots will be idle since no arrivals are assumed after slot M.
 
4
Effectively, \(r\le r_m^k,\) since the information always flows right as shown in [30].
 
5
Note that the delay constraint has to updated by replacing m by \(m+l-1\) in (8). In addition, \(r_{m+1}^{\ast} =\cdots= r_{m+l-1}^{\ast} = 0\) (idle slots).
 
6
The result also holds for any channel gains when the joint probability distribution for the random packet vector [g 1,...,g M+D−1] is identically distributed to the reversed packet vector [g M+D−1,...,g 1]. However, for practical interest, we will only focus on the i.i.d. channel gains in this article.
 
7
That is, the time interval from when packet B m arrives till when its last bit’s transmission is completed, which is not necessarily aligned with slot boundaries.
 
8
Note that the DD online scheduler assumes that the causal channel states are known or can be estimated at the transmitter. Otherwise, the DD online scheduler degenerates to the online flush scheduler.
 
9
Note that for fair comparison, the total transmission duration for the single deadline model is equal to (M + D − 1) slots as well.
 
Literatur
1.
Berry, R., & Gallager, R. G. (2002). Communication over fading channels with delay constraints. IEEE Transactions on Information Theory, 48(5), 1135–1149.CrossRefMathSciNet
2.
Bertsekas, D. P. (1995). Nonlinear programming. Boston: Athena Scientific.MATH
3.
Bettesh, I., & Shamai, S. (2006). Optimal power and rate control for minimal average delay: The single-user case. IEEE Transactions on Information Theory, 52(9), 4115–4141.CrossRefMathSciNet
4.
Bhatia, R. (1997). Matrix analysis. New York: Springer-Verlag.
5.
Caire, G., Taricco, G., & Biglieri, E. (1999). Optimal power control over fading channels. IEEE Transactions on Information Theory, 45, 1468–1489.MATHCrossRefMathSciNet
6.
Chen, W., & Mitra, U. (2006). Energy efficient scheduling with individual packet delay constraints. IEEE INFOCOM, Barcelona.
7.
Chen, W., Neely, M. J., & Mitra, U. (2007). Energy efficient scheduling with individual packet delay constraints: Offline and online results. IEEE INFOCOM, Anchorage, AL.
8.
Chen, W., Neely, M. J., & Mitra, U. (2007). Energy-efficient transmissions with individual packet delay constraints. IEEE Transactions on Information Theory (accepted).
9.
Collins, B., & Cruz, R. (1999). Transmission policies for time varying channels with average delay constraints, Proceedings of Allerton Conference on Communication, Control, and Computing, pp. 709–717.
10.
Ferracioli, M., Tralli, V., & Verdone, R. (2000). Channel based adaptive resource allocation at the MAC layer in UMTS TD-CDMA systems. Vehicular Technology Conference, 2, 2549–2555.
11.
Fu, A., Modiano, E., & Tsitsiklis, J. (2006). Optimal transmission scheduling over a fading channel with energy and deadline constraints. IEEE Transactions on Wireless Communications, 5(3), 630–641.CrossRef
12.
Goldsmith, A. J., & Varaiya, P. P. (1997). Capacity of fading channels with channel side information. IEEE Transactions on Information Theory, 43, 1986–1992.MATHCrossRefMathSciNet
13.
Goyal, M., Kumar, A., & Sharma, V. (2003). Power constrained and delay optimal policies for scheduling transmission over a fading channel. IEEE INFOCOM, San Francisco, pp. 311–320.
14.
Grossglauser, M., & Tse, D. N. C. (2002). Mobility increases the capacity of ad hoc networks. IEEE/ACM Transactions on Networking, 10, 477–486.CrossRef
15.
Hanly, S. V., & Tse, D. N. C. (1998). Multiaccess fading channels—Part II: Delay-limited capacities. IEEE Transactions on Information Theory, 44(7), 2816–2831.MATHCrossRefMathSciNet
16.
Khojastepour, M. A., & Sabharwal, A. (2004). Delay-constrained scheduling: Power efficiency, filter design, and bounds. IEEE INFOCOM, Hong Kong, pp. 1939–1950.
17.
Lin, X., & Shroff, N. B. (2004). Towards achieving the maximum capacity in large mobile wireless networks. KICS/IEEE Journal of Communications and Networks, 6(4), 352–361.
18.
Liu, X., & Goldsmith, A. (2002). Optimal power allocation over fading channels with stringent delay constraint. Proceedings of ICC’02, New York, NY, pp. 1416–1418.
19.
Neely, M. J. (2006). Optimal energy and delay tradeoffs for multi-user wireless downlinks. IEEE INFOCOM, Barcelona.
20.
Neely, M. J., & Modiano, E. (2005). Capacity and delay tradeoffs for ad-hoc mobile networks. IEEE Transactions on Information Theory, 51, 1917–1937.CrossRefMathSciNet
21.
Negi, R., & Cioffi, J. (2002). Delay-constrained capacity with causal feedback. IEEE Transactions on Information Theory, 48, 2478–2494.MATHCrossRefMathSciNet
22.
Nielsen, M. A. (2001). Characterizing mixing and measurement in quantum mechanics. Physical Review A, 63.
23.
Nuggehalli, P., Srinivasan, V., & Rao, R. R. (2006). Energy efficient transmission scheduling for delay constrained wireless networks. IEEE Transactions on Wireless Communications, 5(3), 531–539.CrossRef
24.
Ozarow, L., Shamai, S., & Wyner, A. D. (1994). Information theoretic considerations for cellular mobile radio. IIEEE Transaction Vehicular Technology Conference, 43, 359–378.CrossRef
25.
Rajan, D., Sabharwal, A., & Aazhang, B. (2004). Delay-bounded packet scheduling of bursty traffic over wireless channels. IEEE Transactions on Information Theory, 50(1), 125–144.CrossRefMathSciNet
26.
Sharma, G., Mazumdar, R. R., & Shroff, N. B. (2006). Delay and capacity trade-offs in mobile ad hoc networks: A global perspective. IEEE INFOCOM, Barcelona.
27.
Toumpis, S., & Goldsmith, A. J. (2004). Large wireless networks under fading, mobility, and delay constraints. IEEE INFOCOM, Hong Kong, pp. 609–619.
28.
Tse, D. N. C., & Hanly, S. V. (1998). Multiaccess fading channels - Part I: Polymatroid structure, optimal resource allocation and throughput capacities. IEEE Transactions on Information Theory, 44(7), 2796–2815.MATHCrossRefMathSciNet
29.
Tsybakov, B. (2002). File transmission over wireless fast fading downlink. IEEE Transactions on Information Theory, 48(8), 2323–2337.MATHCrossRefMathSciNet
30.
Uysal-Biyikoglu, E., Gamal, A. E. (2004). On adaptive transmission for energy efficiency in wireless data networks. IEEE Transactions on Information Theory, 50(12), 3081–3094.CrossRef
31.
Uysal-Biyikoglu, E., Gamal, A. E., & Prabhakar, B. (2002). Adaptive transmission of variable-rate data over a fading channel for energy efficiency. Proceedings of IEEE GLOBECOM 2002, Taipei, Taiwan.
32.
Uysal-Biyikoglu, E., Prabhakar, B., & Gamal, A. E. (2002). Energy-efficient packet transmission over a wireless link. IEEE/ACM Transactions on Networking, 10(4), 487–499.CrossRef
33.
Wong, C., Tsui, C., Cheng, R., & Letaief, K. (1999). A real-time sub-carrier allocation scheme for multiple access downlink OFDM transmission. IEEE 50th Vehicular Technology Conference, 2, 1124–1128.
34.
Zafer, M. A., & Modiano, E. (2005). A calculus approach to minimum energy transmission policies with quality of service gurantees, IEEE INFOCOM, Miami, pp. 548–559.
35.
Zafer, M. A., & Modiano, E. (2007). Delay-constrained energy efficient data transmission over a wireless fading channel, Information Theory and Applications Workshop, University of California, San Diego.
36.
Zhong, X., & Xu, C. (2005). Delay-constrained energy-efficient wireless packet scheduling with QoS guarantees. GLOBECOM’05, vol. 6, 3336–3340.
Metadaten
Titel
Energy-efficient scheduling with individual packet delay constraints over a fading channel
verfasst von
Wanshi Chen
Urbashi Mitra
Michael J. Neely
Publikationsdatum
01.07.2009
Verlag
Springer US
Erschienen in
Wireless Networks / Ausgabe 5/2009
Print ISSN: 1022-0038
Elektronische ISSN: 1572-8196
DOI
https://doi.org/10.1007/s11276-007-0093-y

Weitere Artikel der Ausgabe 5/2009

Wireless Networks 5/2009 Zur Ausgabe

OriginalPaper

Detection of mobile targets on the plane and in space using heterogeneous sensor networks

OriginalPaper

Multicast scheduling with resource fairness constraints

OriginalPaper

Maximizing network utilization with max–min fairness in wireless sensor networks

EditorialNotes

Guest editorial

OriginalPaper

Rechargeable sensor activation under temporally correlated events

OriginalPaper

From link dynamics to path lifetime and packet-length optimization in MANETs

Neuer Inhalt

    Bildnachweise