856 research outputs found

    Wireless model-based predictive networked control system over cooperative wireless network

    Get PDF
    Owing to their distributed architecture, networked control systems (NCSs) are proven to be feasible in scenarios where a spatially distributed feedback control system is required. Traditionally, such NCSs operate over real-time wired networks. Recently, in order to achieve the utmost flexibility, scalability, ease of deployment, and maintainability, wireless networks such as IEEE 802.11 wireless local area networks (LANs) are being preferred over dedicated wired networks. However, conventional NCSs with event-triggered controllers and actuators cannot operate over such general purpose wireless networks since the stability of the system is compromised due to unbounded delays and unpredictable packet losses that are typical in the wireless medium. Approaching the wireless networked control problem from two perspectives, this work introduces a practical wireless NCS and an implementation of a cooperative medium access control protocol that work jointly to achieve decent control under severe impairments, such as unbounded delay, bursts of packet loss and ambient wireless traffic. The proposed system is evaluated on a dedicated test platform under numerous scenarios and significant performance gains are observed, making cooperative communications a strong candidate for improving the reliability of industrial wireless networks

    Splitting algorithm for DMT optimal cooperative MAC protocols in wireless mesh networks

    Get PDF
    A cooperative protocol for wireless mesh networks is proposed in this paper. The protocol implements both on-demand relaying and a selection of the best relay terminal so only one terminal is relaying the source message when cooperation is needed. Two additional features are also proposed. The best relay is selected with a splitting algorithm. This approach allows fast relay selection within less than three time-slots, on average. Moreover, a pre-selection of relay candidates is performed prior to the splitting algorithm. Only terminals that are able to improve the direct path are pre-selected. So efficient cooperation is now guaranteed. We prove that this approach is optimal in terms of diversity-multiplexing trade-off. The protocol has been designed in the context of Nakagami-mfading channels. Simulation results show that the performance of the splitting algorithm does not depend on channel statistics

    DMT Optimal Cooperative Protocols with Destination-Based Selection of the Best Relay

    Get PDF
    We design a cooperative protocol in the context of wireless mesh networks in order to increase the reliability of wireless links. Destination terminals ask for cooperation when they fail in decoding data frames transmitted by source terminals. In that case, each destination terminal D calls a specific relay terminal B with a signaling frame to help its transmission with source terminal S. To select appropriate relays, destination terminals maintain tables of relay terminals, one for each possible source address. These tables are constituted by passively overhearing ongoing transmissions. Hence, when cooperation is needed between S and D, and when a relay B is found by terminal D in the relay table associated with terminal S, the destination terminal sends a negative acknowledgment frame that contains the address of B. When the best relay B has successfully decoded the source message, it sends a copy of the data frame to D using a selective decode-andforward transmission scheme. The on-demand approach allows maximization of the spatial multiplexing gain and the cooperation of the best relay allows maximization of the spatial diversity order. Hence, the proposed protocol achieves optimal diversitymultiplexing trade-off performance. Moreover, this performance is achieved through a collision-free selection process

    RECOMAC: a cross-layer cooperative network protocol for wireless ad hoc networks

    Get PDF
    A novel decentralized cross-layer multi-hop cooperative protocol, namely, Routing Enabled Cooperative Medium Access Control (RECOMAC) is proposed for wireless ad hoc networks. The protocol architecture makes use of cooperative forwarding methods, in which coded packets are forwarded via opportunistically formed cooperative sets within a region, as RECOMAC spans the physical, medium access control (MAC) and routing layers. Randomized coding is exploited at the physical layer to realize cooperative transmissions, and cooperative forwarding is implemented for routing functionality, which is submerged into the MAC layer, while the overhead for MAC and route set up is minimized. RECOMAC is shown to provide dramatic performance improvements of eight times higher throughput and one tenth of end-to-end delay than that of the conventional architecture in practical wireless mesh networks

    On-Demand Cooperation MAC Protocols with Optimal Diversity-Multiplexing Tradeoff

    Get PDF
    This paper presents access protocols with optimal Diversity-Multiplexing Tradeoff (DMT) performance in the context of IEEE 802.11-based mesh networks. The protocols are characterized by two main features: on-demand cooperation and selection of the best relay terminal. The on-demand characteristic refers to the ability of a destination terminal to ask for cooperation when it fails in decoding the message transmitted by a source terminal. This approach allows maximization of the spatial multiplexing gain. The selection of the best relay terminal allows maximization of the diversity order. Hence, the optimal DMT curve is achieved with these protocols

    Optimal Cooperative MAC Protocol with Efficient Selection of Relay Terminals

    Get PDF
    A new cooperative protocol is proposed in the context of wireless mesh networks. The protocol implements ondemand cooperation, i.e. cooperation between a source terminal and a destination terminal is activated only when needed. In that case, only the best relay among a set of available terminals is re-transmitting the source message to the destination terminal. This typical approach is improved using three additional features. First, a splitting algorithm is implemented to select the best relay. This ensures a fast selection process. Moreover, the duration of the selection process is now completely characterized. Second, only terminals that improve the outage probability of the direct link are allowed to participate to the relay selection. By this means, inefficient cooperation is now avoided. Finally, the destination terminal discards the source message when it fails to decode it. This saves processing time since the destination terminal does not need to combine the replicas of the source message: the one from the source terminal and the one from the best relay. We prove that the proposed protocol achieves an optimal performance in terms of Diversity-Multiplexing Tradeoff (DMT)

    DMT Optimal On-Demand Relaying for Mesh Networks

    Get PDF
    This paper presents a new cooperative MAC (Medium Access Control) protocol called BRIAF (Best Relay based Incremental Amplify-and-Forward). The proposed protocol presents two features: on-demand relaying and selection of the best relay terminal. “On-demand relaying” means that a cooperative transmission is implemented between a source terminal and a destination terminal only when the destination terminal fails in decoding the data transmitted by the source terminal. This feature maximizes the spatial multiplexing gain r of the transmission. “Selection of the best relay terminal” means that a selection of the best relay among a set of (m-1) relay candidates is implemented when a cooperative transmission is needed. This feature maximizes the diversity order d(r) of the transmission. Hence, an optimal DMT (Diversity Multiplexing Tradeoff) curve is achieved with a diversity order d(r) = m(1-r) for 0 ≤ r ≤ 1

    A cross layer multi hop network architecture for wireless Ad Hoc networks

    Get PDF
    In this paper, a novel decentralized cross-layer multi-hop cooperative network architecture is presented. Our architecture involves the design of a simple yet efficient cooperative flooding scheme,two decentralized opportunistic cooperative forwarding mechanisms as well as the design of Routing Enabled Cooperative Medium Access Control (RECOMAC) protocol that spans and incorporates the physical, medium access control (MAC) and routing layers for improving the performance of multihop communication. The proposed architecture exploits randomized coding at the physical layer to realize cooperative diversity. Randomized coding alleviates relay selection and actuation mechanisms,and therefore reduces the coordination among the relays. The coded packets are forwarded via opportunistically formed cooperative sets within a region, without communication among the relays and without establishing a prior route. In our architecture, routing layer functionality is submerged into the MAC layer to provide seamless cooperative communication while the messaging overhead to set up routes, select and actuate relays is minimized. RECOMAC is shown to provide dramatic performance improvements, such as eight times higher throughput and ten times lower end-to-end delay as well as reduced overhead, as compared to networks based on well-known IEEE 802.11 and Ad hoc On Demand Distance Vector (AODV) protocols
    corecore