JOINT OPTIMAL DATA RATE AND POWER ALLOCATION IN LOSSY MOBILE AD HOC NETWORKS WITH DELAY-CONSTRAINED TRAFFICS
•Transferir como DOCX, PDF•
0 gostou•129 visualizações
I3E Technologies, #23/A, 2nd Floor SKS Complex, Opp. Bus Stand, Karur-639 001. IEEE PROJECTS AVAILABLE, NON-IEEE PROJECTS AVAILABLE, APPLICATION BASED PROJECTS AVAILABLE, MINI-PROJECTS AVAILABLE. Mobile : 99436 99916, 99436 99926, 99436 99936 Mail ID: i3eprojectskarur@gmail.com Web: www.i3etechnologies.com, www.i3eprojects.com
Recomendados
Recomendados
Mais conteúdo relacionado
Mais procurados
Mais procurados (8)
Semelhante a JOINT OPTIMAL DATA RATE AND POWER ALLOCATION IN LOSSY MOBILE AD HOC NETWORKS WITH DELAY-CONSTRAINED TRAFFICS
Semelhante a JOINT OPTIMAL DATA RATE AND POWER ALLOCATION IN LOSSY MOBILE AD HOC NETWORKS WITH DELAY-CONSTRAINED TRAFFICS (20)
Mais de I3E Technologies
Mais de I3E Technologies (20)
Último
Último (20)
JOINT OPTIMAL DATA RATE AND POWER ALLOCATION IN LOSSY MOBILE AD HOC NETWORKS WITH DELAY-CONSTRAINED TRAFFICS
- 1. JOINT OPTIMAL DATA RATE AND POWER ALLOCATION IN LOSSY MOBILE AD HOC NETWORKS WITH DELAY-CONSTRAINED TRAFFICS ABSTRACT In this paper, we consider lossy mobile ad hoc networks where the data rate of a given flow becomes lower and lower along its routing path. One of the main challenges in lossy mobile ad hoc networks is how to achieve the conflicting goal of increased network utility and reduced power consumption, while without following the instantaneous state of a fading channel. To address this problem, we propose a cross-layer rate-effective network utility maximization (RENUM) framework by taking into account the lossy nature of wireless links and the constraints of rate outage probability and average delay. In the proposed framework, the utility is associated with the effective rate received at the destination node of each flow instead of the injection rate at the source of the flow. We then present a distributed joint transmission rate, link power and average delay control algorithm, in which explicit broadcast message passing is required for power allocation algorithm. Motivated by the desire of power control devoid of message passing, we give a near-optimal power-allocation scheme that makes use of autonomous SINR measurements at each link and enjoys a fast convergence rate. The proposed algorithm is shown through numerical simulations to outperform other network utility maximization algorithms without rate outage probability/average delay constraints, leading to a higher effective rate, lower power consumption and delay. Furthermore, we conduct extensive network-wide simulations in NS-2 simulator to evaluate the performance of the algorithm in terms of throughput, delay, packet delivery ratio and fairness.