388 research outputs found

    Practical applications of probabilistic model checking to communication protocols

    Get PDF
    Probabilistic model checking is a formal verification technique for the analysis of systems that exhibit stochastic behaviour. It has been successfully employed in an extremely wide array of application domains including, for example, communication and multimedia protocols, security and power management. In this chapter we focus on the applicability of these techniques to the analysis of communication protocols. An analysis of the performance of such systems must successfully incorporate several crucial aspects, including concurrency between multiple components, real-time constraints and randomisation. Probabilistic model checking, in particular using probabilistic timed automata, is well suited to such an analysis. We provide an overview of this area, with emphasis on an industrially relevant case study: the IEEE 802.3 (CSMA/CD) protocol. We also discuss two contrasting approaches to the implementation of probabilistic model checking, namely those based on numerical computation and those based on discrete-event simulation. Using results from the two tools PRISM and APMC, we summarise the advantages, disadvantages and trade-offs associated with these techniques

    Thirty Years of Machine Learning: The Road to Pareto-Optimal Wireless Networks

    Full text link
    Future wireless networks have a substantial potential in terms of supporting a broad range of complex compelling applications both in military and civilian fields, where the users are able to enjoy high-rate, low-latency, low-cost and reliable information services. Achieving this ambitious goal requires new radio techniques for adaptive learning and intelligent decision making because of the complex heterogeneous nature of the network structures and wireless services. Machine learning (ML) algorithms have great success in supporting big data analytics, efficient parameter estimation and interactive decision making. Hence, in this article, we review the thirty-year history of ML by elaborating on supervised learning, unsupervised learning, reinforcement learning and deep learning. Furthermore, we investigate their employment in the compelling applications of wireless networks, including heterogeneous networks (HetNets), cognitive radios (CR), Internet of things (IoT), machine to machine networks (M2M), and so on. This article aims for assisting the readers in clarifying the motivation and methodology of the various ML algorithms, so as to invoke them for hitherto unexplored services as well as scenarios of future wireless networks.Comment: 46 pages, 22 fig

    Throughput modeling of single hop CSMA networks with non-negligible propagation delay

    Get PDF
    Cataloged from PDF version of article.We analyze the performance of the CSMA protocol under propagation delays that are comparable with packet transmission times. We propose a semi-Markov model for the 2-node CSMA channel. For the 2-node case, the capacity reduces to 40% of the zero-delay capacity when the one-way propagation delay is 10% of the packet transmission time. We then extend this model and obtain the optimum symmetric probing rate that achieves the maximum network throughput as a function of the average propagation delay, d¯, and the number of nodes sharing the channel, N. The proposed model predicts that the total capacity decreases with d¯−1 as N goes to infinity when all nodes probe the channel at the optimum rate. The optimum probing rate for each node decreases with 1/N and the total optimum probing rate decreases faster than d¯−1 as N goes to infinity. We investigate how the short-term unfairness problem in CSMA worsens as the propagation delay increases and propose a back-off mechanism to mitigate this issue. The theoretical results presented in this paper can be used as a benchmark for the performance improvements provided by algorithms that have already been developed

    Probabilistic Model Checking of the CSMA/CD Protocol Using PRISM and APMC

    Get PDF
    AbstractCarrier Sense Multiple Access/Collision Detection (CSMA/CD) is the protocol for carrier transmission access in Ethernet networks (international standard IEEE 802.3). On Ethernet, any Network Interface Card (NIC) can try to send a packet in a channel at any time. If another NIC tries to send a packet at the same time, a collision is said to occur and the packets are discarded. The CSMA/CD protocol was designed to avoid this problem, more precisely to allow a NIC to send its packet without collision. This is done by way of a randomized exponential backoff process. In this paper, we analyse the correctness of the CSMA/CD protocol, using techniques from probabilistic model checking and approximate probabilistic model checking. The tools that we use are PRISM and APMC. Moreover, we provide a quantitative analysis of some CSMA/CD properties

    Remote software upload techniques in future vehicles and their performance analysis

    Get PDF
    Updating software in vehicle Electronic Control Units (ECUs) will become a mandatory requirement for a variety of reasons, for examples, to update/fix functionality of an existing system, add new functionality, remove software bugs and to cope up with ITS infrastructure. Software modules of advanced vehicles can be updated using Remote Software Upload (RSU) technique. The RSU employs infrastructure-based wireless communication technique where the software supplier sends the software to the targeted vehicle via a roadside Base Station (BS). However, security is critically important in RSU to avoid any disasters due to malfunctions of the vehicle or to protect the proprietary algorithms from hackers, competitors or people with malicious intent. In this thesis, a mechanism of secure software upload in advanced vehicles is presented which employs mutual authentication of the software provider and the vehicle using a pre-shared authentication key before sending the software. The software packets are sent encrypted with a secret key along with the Message Digest (MD). In order to increase the security level, it is proposed the vehicle to receive more than one copy of the software along with the MD in each copy. The vehicle will install the new software only when it receives more than one identical copies of the software. In order to validate the proposition, analytical expressions of average number of packet transmissions for successful software update is determined. Different cases are investigated depending on the vehicle\u27s buffer size and verification methods. The analytical and simulation results show that it is sufficient to send two copies of the software to the vehicle to thwart any security attack while uploading the software. The above mentioned unicast method for RSU is suitable when software needs to be uploaded to a single vehicle. Since multicasting is the most efficient method of group communication, updating software in an ECU of a large number of vehicles could benefit from it. However, like the unicast RSU, the security requirements of multicast communication, i.e., authenticity, confidentiality and integrity of the software transmitted and access control of the group members is challenging. In this thesis, an infrastructure-based mobile multicasting for RSU in vehicle ECUs is proposed where an ECU receives the software from a remote software distribution center using the road side BSs as gateways. The Vehicular Software Distribution Network (VSDN) is divided into small regions administered by a Regional Group Manager (RGM). Two multicast Group Key Management (GKM) techniques are proposed based on the degree of trust on the BSs named Fully-trusted (FT) and Semi-trusted (ST) systems. Analytical models are developed to find the multicast session establishment latency and handover latency for these two protocols. The average latency to perform mutual authentication of the software vendor and a vehicle, and to send the multicast session key by the software provider during multicast session initialization, and the handoff latency during multicast session is calculated. Analytical and simulation results show that the link establishment latency per vehicle of our proposed schemes is in the range of few seconds and the ST system requires few ms higher time than the FT system. The handoff latency is also in the range of few seconds and in some cases ST system requires less handoff time than the FT system. Thus, it is possible to build an efficient GKM protocol without putting too much trust on the BSs

    On a Joint Physical Layer and Medium Access Control Sublayer Design for Efficient Wireless Sensor Networks and Applications

    Get PDF
    Wireless sensor networks (WSNs) are distributed networks comprising small sensing devices equipped with a processor, memory, power source, and often with the capability for short range wireless communication. These networks are used in various applications, and have created interest in WSN research and commercial uses, including industrial, scientific, household, military, medical and environmental domains. These initiatives have also been stimulated by the finalisation of the IEEE 802.15.4 standard, which defines the medium access control (MAC) and physical layer (PHY) for low-rate wireless personal area networks (LR-WPAN). Future applications may require large WSNs consisting of huge numbers of inexpensive wireless sensor nodes with limited resources (energy, bandwidth), operating in harsh environmental conditions. WSNs must perform reliably despite novel resource constraints including limited bandwidth, channel errors, and nodes that have limited operating energy. Improving resource utilisation and quality-of-service (QoS), in terms of reliable connectivity and energy efficiency, are major challenges in WSNs. Hence, the development of new WSN applications with severe resource constraints will require innovative solutions to overcome the above issues as well as improving the robustness of network components, and developing sustainable and cost effective implementation models. The main purpose of this research is to investigate methods for improving the performance of WSNs to maintain reliable network connectivity, scalability and energy efficiency. The study focuses on the IEEE 802.15.4 MAC/PHY layers and the carrier sense multiple access with collision avoidance (CSMA/CA) based networks. First, transmission power control (TPC) is investigated in multi and single-hop WSNs using typical hardware platform parameters via simulation and numerical analysis. A novel approach to testing TPC at the physical layer is developed, and results show that contrary to what has been reported from previous studies, in multi-hop networks TPC does not save energy. Next, the network initialization/self-configuration phase is addressed through investigation of the 802.15.4 MAC beacon interval setting and the number of associating nodes, in terms of association delay with the coordinator. The results raise doubt whether that the association energy consumption will outweigh the benefit of duty cycle power management for larger beacon intervals as the number of associating nodes increases. The third main contribution of this thesis is a new cross layer (PHY-MAC) design to improve network energy efficiency, reliability and scalability by minimising packet collisions due to hidden nodes. This is undertaken in response to findings in this thesis on the IEEE 802.15.4 MAC performance in the presence of hidden nodes. Specifically, simulation results show that it is the random backoff exponent that is of paramount importance for resolving collisions and not the number of times the channel is sensed before transmitting. However, the random backoff is ineffective in the presence of hidden nodes. The proposed design uses a new algorithm to increase the sensing coverage area, and therefore greatly reduces the chance of packet collisions due to hidden nodes. Moreover, the design uses a new dynamic transmission power control (TPC) to further reduce energy consumption and interference. The above proposed changes can smoothly coexist with the legacy 802.15.4 CSMA/CA. Finally, an improved two dimensional discrete time Markov chain model is proposed to capture the performance of the slotted 802.15.4 CSMA/CA. This model rectifies minor issues apparent in previous studies. The relationship derived for the successful transmission probability, throughput and average energy consumption, will provide better performance predictions. It will also offer greater insight into the strengths and weaknesses of the MAC operation, and possible enhancement opportunities. Overall, the work presented in this thesis provides several significant insights into WSN performance improvements with both existing protocols and newly designed protocols. Finally, some of the numerous challenges for future research are described

    Queueing and Stability Analysis of Buffered CSMA/CD Local Networks.

    Get PDF
    This dissertation develops a joint probability generating function for the message quene lengths in a slotted p-persistent CSMA/CD (Carrier-Sense Multiple-Access with Collision Detection) system with a finite population of buffered users. Each user is assumed to have an independent and identical process of packet generation and an infinite buffer for storing outstanding packets. A closed form formula is obtained for the generating function in case of a two user system. Analytic formulas for the stability condition of a p-persistent CSMA/CD system are derived using the generating function. The range of the transmission probability p that leads to stability is examined through numerical analysis over a wide variety of the user\u27s communication demand, the packet length distribution, the number of users on the network, and the time to detect and abort collided packets

    Enhanced Collision Resolution for the IEEE 802.11 Distributed Coordination Function

    Get PDF
    The IEEE 802.11 standard relies on the Distributed Coordination Function (DCF) as the fundamental medium access control method. DCF uses the Binary Exponential Backoff (BEB) algorithm to regulate channel access. The backoff period determined by BEB depends on a contention window (CW) whose size is doubled if a station suffers a collision and reset to its minimum value after a successful transmission. BEB doubles the CW size upon collision to reduce the collision probability in retransmission. However, this CW increase reduces channel access time because stations will spend more time sensing the channel rather than accessing it. Although resetting the CW to its minimum value increases channel access, it negatively affects fairness because it favours successfully transmitting stations over stations suffering from collisions. Moreover, resetting CW leads to increasing the collision probability and therefore increases the number of collisions. % Quality control editor: Please ensure that the intended meaning has been maintained in the edits of the previous sentence. Since increasing channel access time and reducing the probability of collisions are important factors to improve the DCF performance, and they conflict with each other, improving one will have an adverse effect on the other and consequently will harm the DCF performance. We propose an algorithm, \gls{ECRA}, that solves collisions once they occur without instantly increasing the CW size. Our algorithm reduces the collision probability without affecting channel access time. We also propose an accurate analytical model that allows comparing the theoretical saturation and maximum throughputs of our algorithm with those of benchmark algorithms. Our model uses a collision probability that is dependent on the station transmission history and thus provides a precise estimation of the probability that a station transmits in a random timeslot, which results in a more accurate throughput analysis. We present extensive simulations for fixed and mobile scenarios. The results show that on average, our algorithm outperformed BEB in terms of throughput and fairness. Compared to other benchmark algorithms, our algorithm improved, on average, throughput and delay performance
    corecore