SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Soldati Pablo) "

Sökning: WFRF:(Soldati Pablo)

  • Resultat 1-10 av 41
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • António, Gonga, et al. (författare)
  • Multi-channel communication vs. adaptive routing for reliable communication in WSNs
  • 2012
  • Ingår i: IPSN'12 - ACM/IEEE Proceedings of the 11th International Conference on Information Processing in Sensor Networks, (Beijing;16 - 20 April 2012). - New York, NY, USA : ACM. - 9781450312271 ; , s. 125-126
  • Konferensbidrag (refereegranskat)abstract
    • Interference and link dynamics constitute great concerns for stability and performance of protocols in WSNs. In this paper we evaluate the impact of channel hopping and adaptive routing on delay and reliability focusing on delay critical applications.
  •  
2.
  • Antonioli, Roberto Pinto, et al. (författare)
  • Decentralized User Scheduling for Rate-Constrained Sum-Utility Maximization in the MIMO IBC
  • 2020
  • Ingår i: IEEE Transactions on Communications. - : Institute of Electrical and Electronics Engineers (IEEE). - 0090-6778 .- 1558-0857. ; 68:10, s. 6215-6229
  • Tidskriftsartikel (refereegranskat)abstract
    • While the problems of sum-rate maximization and sum-power minimization subject to quality of service (QoS) constraints in the multiple input multiple output interference broadcast channel (MIMO IBC) have been widely studied, most of the proposed solutions have neglected the user scheduling aspect assuming that a feasible set of users has been previously selected. However, ensuring QoS for each user in the MIMO IBC involves the joint optimization of transmit/receive beamforming vectors, transmit powers, and user scheduling variables. To address the full problem, we propose a novel formulation of a rate-constrained sum-utility maximization problem which allows to either deactivate users or minimize the QoS degradation for some scheduled users in infeasible scenarios. Remarkably, this is achieved avoiding the complexity of traditional combinatorial formulations, but rather by introducing a novel expression of the QoS constraints that allows to solve the problem in a continuous domain. We propose centralized and decentralized solutions, where the decentralized solutions focus on practical design and low signaling overhead. The proposed solutions are then compared with benchmarking algorithms, where we show the effectiveness of the joint scheduling and transceiver design as well as the flexibility of the proposed solution performing advantageously in several MIMO IBC scenarios.
  •  
3.
  • Antonioli, Roberto P., et al. (författare)
  • User Scheduling for Sum-Rate Maximization Under Minimum Rate Constraints for the MIMO IBC
  • 2019
  • Ingår i: IEEE Wireless Communications Letters. - : Institute of Electrical and Electronics Engineers (IEEE). - 2162-2337 .- 2162-2345. ; 8:6, s. 1591-1595
  • Tidskriftsartikel (refereegranskat)abstract
    • While the problem of sum-rate maximization of the multiple-input-multiple-output interference broadcast channel (MIMO IBC) has been extensively studied, most of the proposed solutions do not ensure a minimum rate for each scheduled user. In practice, many services require a minimum rate from the underlying communication links. Therefore, in this letter, we consider a sum-rate maximization problem with per-link minimum rate constraints for the MIMO IBC. The key idea is scheduling a suitable subset of the communication links for simultaneous transmissions, such that a minimum rate for each scheduled link can be ensured. To this end, we pose the sum-rate maximization problem as a combinatorial optimization problem, in which we introduce binary variables to the classical transceiver design problem. We propose a centralized solution based on branch-and-bound and a low-complexity semi-distributed scheme, in which a centralized unit is responsible for scheduling decisions, while the transceiver computations are distributed. Simulations show that the proposed solutions handle the user scheduling effectively, while the proposed semi-distributed scheme performs closely to the centralized scheme.
  •  
4.
  • Belleschi, Marco, et al. (författare)
  • Fast power control for cross-layer optimal resource allocation in DS-CDMA wireless networks
  • 2009
  • Ingår i: 2009 IEEE International Conference on Communications. ; , s. 4341-4346
  • Konferensbidrag (refereegranskat)abstract
    • This paper presents a novel cross-layer design for joint power and end-to-end rate control optimization in DS-CDMA wireless networks, along with a detailed implementation and evaluation in the network simulator ns-2. Starting with a network utility maximization formulation of the problem, we derive distributed power control, transport rate and queue management schemes that jointly achieve the optimal network operation. Our solution has several attractive features compared to alternatives: it adheres to the natural time-scale separation between rapid power control updates and slower end-to-end rate adjustments, and uses simplified power control mechanisms with reduced signalling requirements. We argue that these features are critical for a successful real-world implementation. To validate these claims, we present a detailed implementation of a crosslayer adapted networking stack for DS-CSMA ad-hoc networks in ns-2. We describe several critical issues that arise in the implementation, but are typically neglected in the theoretical protocol design, and evaluate the alternatives in extensive simulations.
  •  
5.
  • Demirel, Burak, et al. (författare)
  • Modular Co-Design of Controllers and Transmission Schedules in WirelessHART
  • 2011
  • Ingår i: IEEE Conference on Decision and Control. ; , s. 5951-5958
  • Konferensbidrag (refereegranskat)abstract
    • We consider the joint design of transmissionschedules and controllers for networked control loops that useWirelessHART communication for sensor and actuator data. Byparameterizing the design problem in terms of the samplingrate of the control loop, the co-design problem separates intotwo well-defined subproblems which admit optimal solutions:transmission scheduling should be done to maximize the delayconstrained reliability while the control design should optimizeclosed-loop performance under packet loss. We illustrate howthese problems can be solved and demonstrate our co-designframework for the case of linear-quadratic contro
  •  
6.
  • Demirel, Burak, et al. (författare)
  • Modular Design of Jointly Optimal Controllers and Forwarding Policies for Wireless Control
  • 2014
  • Ingår i: IEEE Transactions on Automatic Control. - 0018-9286 .- 1558-2523. ; 59:12, s. 3252-3265
  • Tidskriftsartikel (refereegranskat)abstract
    • We consider the joint design of packet forwarding policies and controllers for wireless control loops where sensor measurements are sent to the controller over an unreliable and energy-constrained multi-hop wireless network. For fixed sampling rate of the sensor, the co-design problem separates into two well-defined and independent subproblems: transmission scheduling for maximizing the deadline-constrained reliability and optimal control under packet loss. We develop optimal and implementable solutions for these subproblems and show that the optimally co-designed system can be efficiently found. Numerical examples highlight the many trade-offs involved and demonstrate the power of our approach.
  •  
7.
  • Fodor, Gabor, et al. (författare)
  • Near optimum power control and precoding under fairness constraints in network MIMO systems
  • 2009
  • Ingår i: International Journal of Digital Multimedia Broadcasting. - : Hindawi Limited. - 1687-7578 .- 1687-7586. ; 2010, s. 251719-
  • Tidskriftsartikel (refereegranskat)abstract
    • We consider the problem of setting the uplink signal-to-noise-and- interference (SINR) target and allocating transmit powers for mobile stations in multicell spatial multiplexing wireless systems. Our aim is twofold: to evaluate the potential of such mechanisms in network multiple input multiple output (MIMO) systems, and to develop scalable numerical schemes that allow real-time near-optimal resource allocation across multiple sites. We formulate two versions of the SINR target and power allocation problem: one for maximizing the sum rate subject to power constraints, and one for minimizing the total power needed to meet a sum-rate target. To evaluate the potential of our approach, we perform a semianalytical study in Mathematica using the augmented Lagrangian penalty function method. We find that the gain of the joint optimum SINR setting and power allocation may be significant depending on the degree of fairness that we impose. We develop a numerical technique, based on successive convexification, for real-time optimization of SINR targets and transmit powers. We benchmark our procedure against the globally optimal solution and demonstrate consistently strong performance in realistic network MIMO scenarios. Finally, we study the impact of near optimal precoding in a multicell MIMO environment and find that precoding helps to reduce the sum transmit power while meeting a capacity target.
  •  
8.
  • Fodor, Gabor, et al. (författare)
  • Near Optimum Power Control Under Fairness Constraints in CoMP Systems
  • 2009
  • Ingår i: GLOBECOM 2009 - 2009 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE. - 9781424441471 ; , s. 5274-5281
  • Konferensbidrag (refereegranskat)abstract
    • We consider the problem of setting the uplink signal-to-noise-and-interference (SINR) target and allocating transmit powers for mobile stations in multicell spatial multiplexing wireless systems. Our aim is twofold: to evaluate the potential of such mechanisms in coordinated multipoint transmission (CoMP) systems, and to develop scalable numerical schemes that allow real-time near-optimal resource allocation across multiple sites. We formulate two versions of the SINR target and power allocation problem: one for maximizing the sum rate subject to power constraints, and one for minimizing the total power needed to meet a sum-rate target. To evaluate the potential of our approach, we perform a semi-analytical study in Mathematica using the augmented Lagrangian penalty function method. We find that the gain of the joint optimum SINR setting and power allocation may be significant depending on the degree of fairness that we impose. We develop a numerical technique, based on successive convexification, for real-time optimization of SINR targets and transmit powers. We benchmark our procedure against the globally optimal solution, and demonstrate consistently strong performance in realistic CoMP scenarios.
  •  
9.
  • Fodor, Gabor, et al. (författare)
  • On the impact of uplink power control in network MIMO systems with MMSE and SIC receivers
  • 2010
  • Ingår i: 2010 IEEE International Symposium on 'A World of Wireless, Mobile and Multimedia Networks'. - 9781424472659
  • Konferensbidrag (refereegranskat)abstract
    • Network multiple input, multiple output (MIMO) systems are built around a broadband backbone network that allows for the fast communication of channel state information (CSI) as well as user data between different base stations. Previous works have shown that multicell channel adaptive (opportunistic) power control can minimize the sum power or maximize the sum rate when the backbone is used for the exchange of CSI in network MIMO systems. In this work we investigate the gains of multicell opportunistic power control under per user fairness constraints when both CSI and user data are shared between multiple sites. We find that multicell opportunistic power control working in concert with uplink joint signal detection is an efficient means both for the capacity and the power control problems that not only minimizes sum power or maximizes overall capacity, but is also able to provide arbitrary level of fairness.
  •  
10.
  • Ghadimi, Euhanna, et al. (författare)
  • A metric for opportunistic routing in duty cycled wireless sensor networks
  • 2012
  • Ingår i: Sensor, Mesh and Ad Hoc Communications and Networks (SECON), 2012 9th Annual IEEE Communications Society Conference on. - : IEEE. - 2155-5486 .- 2155-5494. - 9781467319058 ; , s. 335-343
  • Konferensbidrag (refereegranskat)abstract
    • Opportunistic routing is widely known to have substantially better performance than traditional unicast routing in wireless networks with lossy links. However, wireless sensor networks are heavily duty-cycled, i.e. they frequently enter deep sleep states to ensure long network life-time. This renders existing opportunistic routing schemes impractical, as they assume that nodes are always awake and can overhear other transmissions. In this paper, we introduce a novel opportunistic routing metric that takes duty cycling into account. By analytical performance modeling and simulations, we show that our routing scheme results in significantly reduced delay and improved energy efficiency compared to traditional unicast routing. The method is based on a new metric, EDC, that reflects the expected number of duty cycled wakeups that are required to successfully deliver a packet from source to destination. We devise distributed algorithms that find the EDC-optimal forwarding, i.e. the optimal subset of neighbors that each node should permit to forward its packets. We compare the performance of the new routing with ETX-optimal single path routing in both simulations and testbed-based experiments.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-10 av 41

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy