11,375 research outputs found

    MAC Centered Cooperation - Synergistic Design of Network Coding, Multi-Packet Reception, and Improved Fairness to Increase Network Throughput

    Get PDF
    We design a cross-layer approach to aid in develop- ing a cooperative solution using multi-packet reception (MPR), network coding (NC), and medium access (MAC). We construct a model for the behavior of the IEEE 802.11 MAC protocol and apply it to key small canonical topology components and their larger counterparts. The results obtained from this model match the available experimental results with fidelity. Using this model, we show that fairness allocation by the IEEE 802.11 MAC can significantly impede performance; hence, we devise a new MAC that not only substantially improves throughput, but provides fairness to flows of information rather than to nodes. We show that cooperation between NC, MPR, and our new MAC achieves super-additive gains of up to 6.3 times that of routing with the standard IEEE 802.11 MAC. Furthermore, we extend the model to analyze our MAC's asymptotic and throughput behaviors as the number of nodes increases or the MPR capability is limited to only a single node. Finally, we show that although network performance is reduced under substantial asymmetry or limited implementation of MPR to a central node, there are some important practical cases, even under these conditions, where MPR, NC, and their combination provide significant gains

    Performance analysis of feedback-free collision resolution NDMA protocol

    Get PDF
    To support communications of a large number of deployed devices while guaranteeing limited signaling load, low energy consumption, and high reliability, future cellular systems require efficient random access protocols. However, how to address the collision resolution at the receiver is still the main bottleneck of these protocols. The network-assisted diversity multiple access (NDMA) protocol solves the issue and attains the highest potential throughput at the cost of keeping devices active to acquire feedback and repeating transmissions until successful decoding. In contrast, another potential approach is the feedback-free NDMA (FF-NDMA) protocol, in which devices do repeat packets in a pre-defined number of consecutive time slots without waiting for feedback associated with repetitions. Here, we investigate the FF-NDMA protocol from a cellular network perspective in order to elucidate under what circumstances this scheme is more energy efficient than NDMA. We characterize analytically the FF-NDMA protocol along with the multipacket reception model and a finite Markov chain. Analytic expressions for throughput, delay, capture probability, energy, and energy efficiency are derived. Then, clues for system design are established according to the different trade-offs studied. Simulation results show that FF-NDMA is more energy efficient than classical NDMA and HARQ-NDMA at low signal-to-noise ratio (SNR) and at medium SNR when the load increases.Peer ReviewedPostprint (published version

    Models and Performance of VANET based Emergency Braking

    Get PDF
    The network research community is working in the field of automotive to provide VANET based safety applications to reduce the number of accidents, deaths, injuries and loss of money. Several approaches are proposed and investigated in VANET literature, but in a completely network-oriented fashion. Most of them do not take into account application requirements and no one considers the dynamics of the vehicles. Moreover, message repropagation schemes are widely proposed without investigating their benefits and using very complicated approaches. This technical report, which is derived from the Master Thesis of Michele Segata, focuses on the Emergency Electronic Brake Lights (EEBL) safety application, meant to send warning messages in the case of an emergency brake, in particular performing a joint analysis of network requirements and provided application level benefits. The EEBL application is integrated within a Collaborative Adaptive Cruise Control (CACC) which uses network-provided information to automatically brake the car if the driver does not react to the warning. Moreover, an information aggregation scheme is proposed to analyze the benefits of repropagation together with the consequent increase of network load. This protocol is compared to a protocol without repropagation and to a rebroadcast protocol found in the literature (namely the weighted p-persistent rebroadcast). The scenario is a highway stretch in which a platoon of vehicles brake down to a complete stop. Simulations are performed using the NS_3 network simulation in which two mobility models have been embedded. The first one, which is called Intelligent Driver Model (IDM) emulates the behavior of a driver trying to reach a desired speed and braking when approaching vehicles in front. The second one (Minimizing Overall Braking Induced by Lane change (MOBIL)), instead, decides when a vehicle has to change lane in order to perform an overtake or optimize its path. The original simulator has been modified by - introducing real physical limits to naturally reproduce real crashes; - implementing a CACC; - implementing the driver reaction when a warning is received; - implementing different network protocols. The tests are performed in different situations, such as different number of lanes (one to five), different average speeds, different network protocols and different market penetration rates and they show that: - the adoption of this technology considerably decreases car accidents since the overall average maximum deceleration is reduced; - network load depends on application-level details, such as the implementation of the CACC; - VANET safety application can improve safety even with a partial market penetration rate; - message repropagation is important to reduce the risk of accidents when not all vehicles are equipped; - benefits are gained not only by equipped vehicles but also by unequipped ones

    Towards Optimal Distributed Node Scheduling in a Multihop Wireless Network through Local Voting

    Full text link
    In a multihop wireless network, it is crucial but challenging to schedule transmissions in an efficient and fair manner. In this paper, a novel distributed node scheduling algorithm, called Local Voting, is proposed. This algorithm tries to semi-equalize the load (defined as the ratio of the queue length over the number of allocated slots) through slot reallocation based on local information exchange. The algorithm stems from the finding that the shortest delivery time or delay is obtained when the load is semi-equalized throughout the network. In addition, we prove that, with Local Voting, the network system converges asymptotically towards the optimal scheduling. Moreover, through extensive simulations, the performance of Local Voting is further investigated in comparison with several representative scheduling algorithms from the literature. Simulation results show that the proposed algorithm achieves better performance than the other distributed algorithms in terms of average delay, maximum delay, and fairness. Despite being distributed, the performance of Local Voting is also found to be very close to a centralized algorithm that is deemed to have the optimal performance

    Spacelab system analysis: The modified free access protocol: An access protocol for communication systems with periodic and Poisson traffic

    Get PDF
    The protocol definition and terminal hardware for the modified free access protocol, a communications protocol similar to Ethernet, are developed. A MFA protocol simulator and a CSMA/CD math model are also developed. The protocol is tailored to communication systems where the total traffic may be divided into scheduled traffic and Poisson traffic. The scheduled traffic should occur on a periodic basis but may occur after a given event such as a request for data from a large number of stations. The Poisson traffic will include alarms and other random traffic. The purpose of the protocol is to guarantee that scheduled packets will be delivered without collision. This is required in many control and data collection systems. The protocol uses standard Ethernet hardware and software requiring minimum modifications to an existing system. The modification to the protocol only affects the Ethernet transmission privileges and does not effect the Ethernet receiver

    Hybrid Communication Protocols and Control Algorithms for NextGen Aircraft Arrivals

    Get PDF
    Capacity constraints imposed by current air traffic management technologies and protocols could severely limit the performance of the Next Generation Air Transportation System (NextGen). A fundamental design decision in the development of this system is the level of decentralization that balances system safety and efficiency. A new surveillance technology called automatic dependent surveillance-broadcast (ADS-B) can be potentially used to shift air traffic control to a more distributed architecture; however, channel variations and interference with existing secondary radar replies can affect ADS-B systems. This paper presents a framework for managing arrivals at an airport by using a hybrid centralized/distributed algorithm for communication and control. The algorithm combines the centralized control that is used in congested regions with the distributed control that is used in lower traffic density regions. The hybrid algorithm is evaluated through realistic simulations of operations around a major airport. The proposed strategy is shown to significantly improve air traffic control performance under various operating conditions by adapting to the underlying communication, navigation, and surveillance systems. The performance of the proposed strategy is found to be comparable to fully centralized strategies, despite requiring significantly less ground infrastructure.National Science Foundation (U.S.) (Grant CNS-931843)United States. Office of Naval Research. Multidisciplinary University Research Initiative (Grant N0014-08-0696)United States. Office of Naval Research. Multidisciplinary University Research Initiative (Grant N00014-09-1-1051)United States. Office of Naval Research. Multidisciplinary University Research Initiative (Grant N00014-12-1-0609)United States. Air Force Office of Scientific Research. Multidisciplinary University Research Initiative (Grant FA9550-10-1-0567
    • …
    corecore