Probability Of Successful Communication Research Articles

Performance Analysis of Distance-Based D2D Matching Mechanism

The traditional cellular architecture where devices connect to their service base station (BS) may cause poor performance especially for edge users. Device-to-device (D2D) communication enables nearby user as a relay to help BS forward information, thereby improving the network coverage and quality of service (QoS) of edge users. This paper proposes a distance-based D2D matching mechanism for general cellular networks, where a relay user who successfully connects to its targeted BS can transmit data to its closest user for D2D communication. A link of BS to D2D pair contains two sublinks, which occur at different time phases in each cell. Assuming a nonsynchronous system, we consider that there exists cross-layer interference for D2D links. Based on the techniques of stochastic geometry, we develop the performance of coverage probability and ergodic rate of the D2D network. A key intermediate step in this analysis is the derivation of the interference expressions for D2D links caused by BSs and cochannel D2D users. Then, we derive the meta distribution of the signal-to-interference ratio (SIR) to capture the performance changes of individual links. Simulation results demonstrate that our matching mechanism based on the appropriate time resource allocation favors the edge users with a higher probability of successful communication and transmission rate.

There is no Theoretical Limit for Noise Reduction in Digital Communications

Shannon entropy is a basic characteristic of communications from energetic point of view. Entropy has been expressed as a function of signal to noise ratio, and lower bound for entropy has been investigated. We prove that finite nonzero bound does not exist, therefore in case of M-QAM modulation, there is no theoretical limit for reduction of the effect of noise. In our investigations, averaging is considered, exploiting the zero expected value of the Gaussian noise.
 
 Index Terms—Shannon entropy, probability of successful communication, bit error rate, signal to noise ratio, bound for noise reduction.

A Distributed Mode Selection Scheme for Full-Duplex Device-to-Device Communication

Networks with device-to-device (D2D) technology allow for two possible communication modes: traditional communication via the base station, and direct communication between the users. Recent studies show that in-band full-duplex (IBFD) operations can be advantageously combined with D2D communication to improve the spectral efficiency. However, no algorithms for selecting the communication mode of mobile users in IBFD networks have yet appeared in the literature. In this paper, we design a distributed mode selection scheme for users in D2D-enabled IBFD networks. The proposed scheme maximizes the users’ prob-ability of successful communication by leveraging only existing signaling mechanisms.

MAC protocol with clock synchronization correction for a practical infrastructure monitoring system

Sensor networks for infrastructure monitoring systems require battery-operated sensing nodes with a lifetime of 10 years, a standardized technology, and low engineering costs. Receiver-initiated transmission and coordinated sampled listening are promising power-saving communication methods that can be used for infrastructure monitoring. First, we compared receiver-initiated transmission and coordinated sampled listening from the viewpoint of power consumption and communication success probability. The results of the comparison showed that if we can continue coordinated sampled listening synchronous communication mode, we can satisfy the low power consumption performance required for infrastructure monitoring. However, coordinated sampled listening synchronous communication cannot be maintained for a longer period owing to performance variations of the clock crystal oscillator (CXO). We solved this problem by developing energy efficient system-media access control protocol (NES MAC), a MAC protocol with the additional function of correcting the dispersion of CXO and maintaining synchronization for a long time. NES-MAC is fully compatible with coordinated sampled listening. Furthermore, NES-MAC also has a high power-saving effect when communicating with normal coordinated sampled listening. Therefore, it is possible to expand the network easily and economically without affecting the power-saving performance. In addition, we found that through actual equipment evaluation that sensor nodes that adopt NES-MAC can operate for more than 10 years with two CR123A-type batteries.

Cognitive Radio-Based Smart Grid Traffic Scheduling With Binary Exponential Backoff

This paper develops the traffic models of smart grid electronic data ( ${E}$ data) and multimedia video over cognitive radio (CR). Unlike the traditional “Poisson” arrival model, each arrival monitoring stream follows fixed time triggered Gaussian distribution which approximates to the reality, and the video data is classified as key frame data with higher priority than nonkey frame data to reduce communication burden. To enhance the delivery probability of ${E}$ data and multimedia data, we adopt a buffer mechanism to store the “sending fail” data and try to resend them together with new coming data by using the new data’s sending opportunity. To avoid buffer overflow, the unsent data should be compressed and some should be removed, and the new coming data rate should be reduced to alleviate the congestion of the CR communication network. In this paper, we propose a new binary exponential backoff (NBEB) algorithm to “compress” the unsent data which can keep key information but recover the electronic tendency as much as possible. With NBEB, the new coming data can be temporally selected and thrown into the buffer and more new data can be put in the buffer. The algorithm can reduce the arrival traffic rate exponentially related with the sending failure times. The results show that NBEB can significantly decrease the blocking/dropping probability, increase the communication success probability, and improve the communication performance.

An ant colony algorithm based on cross-layer design for routing and wavelength assignment in optical satellite networks

This paper introduces an ant colony routing and wavelength assignment algorithm based on cross-layer design (CL-ACRWA), which can overcome the adverse effects of Doppler wavelength shift on data transmission in optical satellite networks. Firstly, a cross-layer optimization model is built, which considers the Doppler wavelength shift, the transmission delay as well as wavelength-continuity constraint. Then an ant colony algorithm is utilized to solve the cross-layer optimization model, resulting in finding an optimal light path satisfying the above constraints for every connection request. The performance of CL-ACRWA is measured by the communication success probability, the convergence property and the transmission delay. Simulation results show that CL-ACRWA performs well in communication success probability and has good global search ability as well as fast convergence speed. Meanwhile, the transmission delay can meet the basic requirement of real-time transmission of business.

Transmit Power Control for D2D-Underlaid Cellular Networks Based on Statistical Features

By allowing two nearby mobile devices to communicate via a direct link between them, device-to-device (D2D) communications can efficiently increase the capacity of D2D-underlaid cellular networks, in which D2D and cellular communications share the same frequency band. However, the coexistence of D2D and cellular communications in the same frequency band will cause interference between the D2D and cellular users, thus degrading their performance. One may control the transmit power based on the real-time channel-state information (CSI) to mitigate this interference, but it is difficult to acquire the real-time CSI between D2D/cellular transmitters and D2D receivers. To overcome this difficulty, we propose novel statistical-feature-based power control (SFPC), which determines the transmit power based on statistical (instead of real-time) CSI. The proposed SFPC combines the power control—that is aware of D2D success likelihood—with opportunistic access control to 1) reduce the interference caused by D2D communications and 2) maximize the area spectral efficiency of D2D communications. Specifically, it aims to minimize the D2D transmit power and optimize the selection of access threshold. Our simulation results show that SFPC can increase both the cellular communication success probability and the energy efficiency of D2D communications, as well as reduce the average D2D transmit power.

Priority-Based Dynamic Multichannel Transmission Scheme for Industrial Wireless Networks

Industrial wireless sensor network (IWSN) applications are required to provide precise measurement functions as feedback for controlling devices. Current industrial wireless communication protocols, such as ISA100.11a and wirelessHART, have difficulty, however, in guaranteeing latency for unpredictable on-demand communications. In this paper, a priority-based dynamic multichannel transmission scheme is proposed for IWSNs. In the proposed scheme, a root node controls the transmission timing of high-priority packets, while other nodes autonomously decide what channel to use and when to transmit packets to a neighbor. Simulation results show that real time control is possible where a response delay from transmission of a request to reception of a reply at a root node is within 1,140 ms at per-link communication success probability with a retry of higher than 93%.

Information Exchange in Randomly Deployed Dense WSNs With Wireless Energy Harvesting Capabilities

As large-scale dense and often randomly deployed wireless sensor networks (WSNs) become widespread, local information exchange between co-located sets of nodes may play a significant role in handling the excessive traffic volume. Moreover, to account for the limited life-span of the wireless devices, harvesting the energy of the network transmissions provides significant benefits to the lifetime of such networks. In this paper, we study the performance of communication in dense networks with wireless energy harvesting (WEH)-enabled sensor nodes. In particular, we examine two different communication scenarios (direct and cooperative) for data exchange and we provide theoretical expressions for the probability of successful communication. Then, considering the importance of lifetime in WSNs, we employ state-of-the-art WEH techniques and realistic energy converters, quantifying the potential energy gains that can be achieved in the network. Our analytical derivations, which are validated by extensive Monte-Carlo simulations, highlight the importance of WEH in dense networks and identify the trade-offs between the direct and cooperative communication scenarios.

Evaluation of mobile ad hoc network reliability using propagation-based link reliability model

A wireless mobile ad hoc network (MANET) is a collection of solely independent nodes (that can move randomly around the area of deployment) making the topology highly dynamic; nodes communicate with each other by forming a single hop/multi-hop network and maintain connectivity in decentralized manner. MANET is modelled using geometric random graphs rather than random graphs because the link existence in MANET is a function of the geometric distance between the nodes and the transmission range of the nodes. Among many factors that contribute to the MANET reliability, the reliability of these networks also depends on the robustness of the link between the mobile nodes of the network. Recently, the reliability of such networks has been evaluated for imperfect nodes (transceivers) with binary model of communication links based on the transmission range of the mobile nodes and the distance between them. However, in reality, the probability of successful communication decreases as the signal strength deteriorates due to noise, fading or interference effects even up to the nodes' transmission range. Hence, in this paper, using a propagation-based link reliability model rather than a binary-model with nodes following a known failure distribution to evaluate the network reliability (2TRm, ATRmand AoTRm) of MANET through Monte Carlo Simulation is proposed. The method is illustrated with an application and some imperative results are also presented.

Perfect Cell Partitioning Scheme for Micro-Cellular Networks

A perfect cell partitioning (PCP) scheme is described for controlling the transmission power of base stations in a cellular communication system to prevent radio frequency interference among adjacent base stations. A base station using this scheme can use its entire frequency range, while one using the conventional scheme can use only a quarter of it. Simulation and analytic results showed that the PCP scheme is more effective than the conventional one when the node density is lower than 6. However, the probability of successful communication is relatively low. A modified version of this scheme in which the base station sacrifices the nodes near its border has a significantly higher probability. Simulation and analytic results showed that the success probability of the modified scheme is as much as 0.67 higher than that of the original one when the occupation ratio is 1.2 and that a base station using the modified scheme can use its frequency range more effectively than one using the original or conventional scheme.

Redundant data transmission in control/estimation over lossy networks

In lossy networks the probability of successful communication can be significantly increased by transmitting multiple copies of a same message through independent channels. In this paper we show that communication protocols that exploit this by dynamically assigning the number of transmitted copies of the same data can significantly improve the control performance in a networked control system with only a modest increase in the total number of transmissions. We develop techniques to design communication protocols that exploit the transmission of multiple packets while seeking a balance between stability/estimation performance and communication rate. An average cost optimality criterion is employed to obtain a number of optimal protocols applicable to networks with different computational capabilities. We also discuss stability results under network contention when multiple nodes utilize these protocols.

Analysis of Directional Communication via Relaying Devices in mmWave WPANs

This letter analyzes the communication success probability of two randomly selected devices in mmWave wireless personal area networks (WPANs). Devices are randomly distributed in a piconet, each device is equipped with a directional antenna, and the antenna direction of each device is randomly chosen and fixed during the communication. The communication of the selected pair can be performed either directly or via relaying devices. In the analysis, the probability density function of the distance for devices is used and transmissions with ideal antenna and practical antenna are considered. Numerical results show an optimal beamwidth enables efficient spatial reuse to maximize the successful communication probability of a pair of devices. It also shows that the communication of a pair of devices is difficult when the directions of antennas of devices are fixed and the transmission through sidelobe of a transmitter gives a good effect in some circumstances. The obtained results will provide a criterion for the practical design of mmWave network systems, for implementing appliances using high data rate, and for developing the technology of mmWave band.

The effects of wireless communication failures on group behavior of mobile sensors

ABSTRACTIn social groups, complex group behavior often emerges from the local interaction among simple individuals. Throughout this study, we assume that individuals can access information by way of wireless communication. In this case, individuals are able to exchange accurate information with each other as long as wireless communication links between them are allowed. Subsequently, we propose a consensus decision‐making model for studying the consistency of group behavior considering both the wireless communication range and the probability of successful communication. Our simulation results show the following conclusions: (i) consistency of the group behavior is absolutely achieved, when the wireless communication range is large enough and the probability of successful communication p = 1; (ii) when the wireless communication range is large enough, the consistency of the group behavior is still achieved as long as p is bigger than some small constant; and (iii) the law in (iii) remains applicable when the number of individuals in the group changes. Therefore, one may infer that consistency of group behavior in mobile sensors is much more related to the extent of distribution of obtainable information than the amount of information, where the extent of distribution of obtainable information means that each individual can obtain information from wider area or from those individuals who are not only in its local area. Copyright © 2012 John Wiley & Sons, Ltd.

Integrated Traffic–Communication Simulation Evaluation Environment for IntelliDrive Applications Using SAE J2735 Message Sets

Vehicle-to-vehicle and vehicle-to-infrastructure communications made possible by IntelliDrive will enable new transportation applications and services. To understand and quantify potential benefits from Intelli-Drive applications, these applications should be evaluated before field deployment. An IntelliDrive simulation environment was developed; it replicated precise vehicular movements, incorporated IntelliDrive wireless communications based on wireless access in vehicular environments–dedicated short-range communication standards, and simulated real IntelliDrive message sets defined in the Society of Automotive Engineers J2735 standard. A case study of a prototype lane changing advisory algorithm revealed that communication delays were not likely to be a significant factor and showed maximum delays of only 55 ms for the basic safety message (BSM) and 1.3 ms for the a la carte message (ACM). The probability of successful communication can affect evaluation results. For example, for a lane changing advisory algorithm, the probability of successful transmission of a series of required messages—three BSMs and one ACM—was only 50% when fewer than 120 vehicles were within a communication radius of 50 m. This result implied a significant degradation in algorithm performance. The results demonstrate the feasibility of integrating traffic and communication simulation models and the need to consider both components in IntelliDrive evaluation.

Practical sequential bounds for approximating two-terminal reliability

With increasing emphases on better and more reliable services, network systems have incorporated reliability analysis as an integral part in their planning, design and operation. This article first presents a simple exact decomposition algorithm for computing the NP-hard two-terminal reliability, which measures the probability of successful communication from specified source node to sink node in the network. Then a practical bounding algorithm, which is indispensable for large networks, is presented by modifying the exact algorithm for obtaining sequential lower and upper bounds on two-terminal reliability. Based on randomly generated large networks, computational experiments are conducted to compare the proposed algorithm to the well-known and widely used edge-packing approximation model and to explore the performance of the proposed bounding algorithm. Computational results reveal that the proposed bounding algorithm is superior to the edge-packing model, and the trade-off of accuracy for execution time ensures that an exact difference between upper and lower bounds on two-terminal reliability can be obtained within an acceptable time.

Interference Avoidance Algorithms for Passive RFID Systems Using Contention-Based Transmit Abortion

SUMMARY The performance of a passive RFID system in a dense multi-reader environment is limited by both reader-to-reader interference and reader-to-tag interference. In this paper, we formulate a practical RFID system model which takes into account the non-linear demodulation of the tags and the transmission spectrum of the readers. Using this model, we derive a novel linear programming formulation to obtain the optimum communication probability of the readers for a given reader deployment scenario. We then propose two novel distributed interference avoidance algorithms based on the detect-and-abort principle for multi-channel readers which can effectively mitigate the reader-to-tag interference as well as the reader-to-reader interference. Computer simulations show that the proposed algorithms can improve the successful communication probability and fairness among readers in dense reader environments, compared with the conventional listen-before-talk algorithm.

Reliable communication in networks with Byzantine link failures

AbstractWe consider the problem of communication between nodes of a network whose links are subject to arbitrary failures: A failed link may not only stop transmitting messages but may corrupt them in any possible way. We characterize networks allowing communication in spite of at most t failures. Also, for every fixed link failure probability p ≤ .29, we construct a class of networks for which the probability of successful communication converges to 1 as the number of nodes grows. It is shown that the number of links in these networks is asymptotically smallest possible to assure reliable communication. Moreover, in these networks, communication can be completed in just two information exchange rounds. Finally, we give a protocol assuring reliable communication in the hypercube if link failure probability is p ≤ .02 and show that no such protocol exists if p ≥ .15.

VHF Radio System Performance Model for Predicting Communications Operational Ranges in Irregular Terrain

This paper describes a VHF communication system performance model which can predict the probability of successful communications (p <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">s</inf> ) in irregular terrain for both analog and digital systems. The Longley-Rice model is used to predict the propagation effects. A new noise model, based upon information in CCIR Report 258, is used to help estimate predetection signal-to-noise ratios ( <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">R</tex> ). A communication success is achieved when <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">R \geq R_{r}</tex> where R <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">r</inf> is a value of <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">R</tex> required for user-determined acceptable performance. The value of R <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">r</inf> for a given system is either estimated analytically or determined empirically for a given application. Therefore, the model predicts the probability that <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">R \geq R_{r}</tex> versus range (or other variables of interest). After a user has established an operationally required probability of successful communication <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">(p'_{sr})</tex> , the operational range (OR) of a radio system in irregular terrain can be defined as the range at which <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">p_{s} = p_{sr}</tex> . The model was used to compute p <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">s</inf> versos range for VHF-FM voice systems for several cases involving helicopters, and the results were compared with measured p <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">s</inf> data. Reasonable agreement between the predictions and observations wan obtained, but the sample size of the measured p <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">s</inf> value was too small to consider the comparison to be a validation of the model.

Exact calculation of computer network reliability

AbstractIn designing a distributed computer network, the reliability and availability of the communication paths between all pairs of centers is a primary consideration. Many different approaches have been taken to calculate exactly the probability of successful communication between any specified pair of centers, for a given failure probability of the individual computer systems and communication facilities. However, almost all of these methods are not computationally feasible for large networks. Consequently, approximate calculations of network reliability have been suggested. In this paper a procedure is given for the exact calculation of the probability that all paths between a pair of nodes in a given network are interrupted. The procedure generates mutually exclusive sets of cutting states and calculates the probability of the related events. Summing these values one obtains the probability of service interruption between the specified pair of nodes. If all links fail with equal probability p, the coefficients of a polynomial can be calculated, describing the service disruption probability as a function of p.