Transmission Success Rate Research Articles

A Game-Based Survey for Security Issues in Vehicular Ad Hoc Network

A rapid growth in the number of vehicles contributes to more and more attention on vehicular ad hoc network (VANET) recently, and ensuring security plays a significant role in maintaining its stable operation. Because of some variable environmental factors, its impossible to evaluate a precise value of packets transmission success rate. To reduce the influence of errors on detection, we develop a novel two-person zero-sum intrusion detection game model for formulating confrontation behavior between intrusion detection system (IDS) and malicious node.

Fault-Tolerant Transmission Protocol for Distant Agricultural Image Acquisition

To solve the problem of the high cost in the GPRS communication and the limit transmission distance of WiFi, a transmission scheme for distant agriculture image acquisition was designed based on digital transmission radio in this paper. However, the majority of current digital transmission radio was designed for a small amount of data transmission. It could get a greater transmission distance with the help of the digital transmission radio, but the signal interference increased heavily when the digital transmission radio was used for image transmission. A fault-tolerant transmission protocol for agriculture image (FTTP-AI) based on digital transmission radio was designed in this paper. Packet verification was used to reduce the data errors caused by the signal interference of the digital transmission radio. At the same time, overtime retransmission and the lost packet retransmission were used to overcome the problem of packet loss. Experiments showed that the FTTP-AI could send the agriculture image to a remote computer center successfully in the field. With the help of the FTTP-AI, the rate of accuracy of data transmission was up to 99.2%, the success rate of image transmission was up to 95.8%, the costless distant transmission can achieve several kilometers. This scheme could satisfy the requirement of the low-cost for distant agriculture images transmission reliably.

A new patient monitoring framework and Energy-aware Peering Routing Protocol (EPR) for Body Area Network communication

The recent research in Body Area Networks (BANs) is focused on making its communication more reliable, energy efficient, secure, and to better utilize system resources. In this paper we propose a novel BAN architecture for indoor hospital environments, and a new mechanism of peer discovery with routing table construction that helps to reduce network traffic load, energy consumption, and improves BAN reliability. The three scenarios with fixed and variable number of packets sent by source nodes are considered for better analysis. Static nodes are considered in first and second scenarios whereas mobile nodes are used in third scenario. We have performed extensive simulations in the OMNeT++ based Castalia-3.2 simulation environment to show that our proposed protocol has better performance in terms of reduced BAN traffic load, increased successful transmission rate, reduced number of packets forwarded by intermediate nodes, no packets dropped due to buffer overflow, and overall lower energy consumption when compared with a similar protocols.

Optimal design of wireless monitoring system in mountain citrus orchard and improvement monitoring

In order to monitor in real time the growth environment of a mountain citrus orchard and its variation with spatio-temporal and weather status, the optimal design and evaluation of a wireless monitoring system in a mountain citrus orchard was introduced in this paper. The wireless monitoring system is comprised of end nodes used for obtaining citrus growth environment information including air temperature, air humidity, soil moisture and light; router nodes used to relay citrus growth environment information; and a network coordinator, which performs functions such as managing the nodes, collecting and analyzing the data received from the end nodes, and connecting as a gateway for remote data access. CC2530 is adopted as the core processor of the monitoring system; it has the capability of wireless communication and central processing. The optimal design was introduced in this system including information frame structure suitable for a mountain orchard environment, bidirectional instruction control function, topology discovery, routing monitoring mechanism and node information diversification collection mechanism, so as to effectively enhance the robustness and controllability of monitoring the citrus orchard environment. In this paper, the citrus orchard in the subtropical garden of SCAU (South China Agriculture University) was selected for the test. The orchard hill has sloping terrain; citrus trees are planted by terraced distribution. The average slope is 20 degrees, the citrus trees have a height of 2.8m, their shrub diameters are 3m, and the average spacing of citrus plants is 2.8m. The citrus orchard wireless channel was measured in citrus orchard, and the wireless channel model was established through blocking factor and rain attenuation factor, it was used to guide the evaluation of the wireless monitoring network. Experimental results of RSSI (Receiver Signal Strength Index) and communication quality under different distances and climates show that reliable collection and transmission were available in the mountain citrus orchard when the wireless system was deployed with an antenna height of 1.5m and a maximum single-hop communications distance of 30m. Continuous 744h online test results show that the optimized wireless monitoring system improved the transmission success rate; it has a success rate of at least 99.12% for data transmission within the 30m distance. The system ran well, worked stably, and was suitable for the remote, real-time monitoring of the citrus growth environment in a mountainous orchard.

A novel power efficient location-based cooperative routing with transmission power-upper-limit for wireless sensor networks.

The extensive usage of wireless sensor networks (WSNs) has led to the development of many power- and energy-efficient routing protocols. Cooperative routing in WSNs can improve performance in these types of networks. In this paper we discuss the existing proposals and we propose a routing algorithm for wireless sensor networks called Power Efficient Location-based Cooperative Routing with Transmission Power-upper-limit (PELCR-TP). The algorithm is based on the principle of minimum link power and aims to take advantage of nodes cooperation to make the link work well in WSNs with a low transmission power. In the proposed scheme, with a determined transmission power upper limit, nodes find the most appropriate next nodes and single-relay nodes with the proposed algorithm. Moreover, this proposal subtly avoids non-working nodes, because we add a Bad nodes Avoidance Strategy (BAS). Simulation results show that the proposed algorithm with BAS can significantly improve the performance in reducing the overall link power, enhancing the transmission success rate and decreasing the retransmission rate.

Design of an energy‐efficient cross‐layer protocol for mobile ad hoc networks

Reducing energy consumption for data transmissions and prolonging network lifetime are crucial in the design of energy-efficient routing protocols. The proportion of successful data transmissions is significant for the reduction of data transmission and traffic load energy consumption, although the energy remaining in node is important for prolonging network lifetime. In this study, the authors propose an energy-efficient cross-layer design for the network layer and medium access control (MAC) layer that reduces energy consumption and prolongs network lifetime. In the network layer, a minimum transmission energy consumption (MTEC) routing protocol is proposed for selecting the MTEC path for data transmission, based on the proportion of successful data transmissions, the number of channel events, the remaining node energy of nodes and the traffic load of nodes. The authors design an adaptive contention window (ACW) for the MAC layer that provides nodes with high successful transmission rates with greater opportunity for contending for a channel to save energy. They used simulations to compare the proposed cross-layer design (MTEC with ACW) with related protocols, including dynamic source routing, traffic-size aware and the Varaprasad routing protocol. The simulation results showed that the proposed cross-layer design (MTEC with ACW) provided better packet delivery rate and throughput than existing protocols. MTEC with ACW also exhibited lower-energy consumption during data transmission and a higher network lifetime than existing protocols.

A QoS-aware Routing Protocol for Reliability Sensitive Data in Hospital Body Area Networks

The reliability, energy efficiency, and real-time display of patient's data are important factors for Body Area Network (BAN) communication in indoor hospital environments. In this paper we propose a novel routing protocol by considering the QoS requirements of BAN data with strict reliability requirements. Our proposed algorithm increases the reliable delivery of critical BAN data at the destination We have performed extensive simulations in the OMNeT++ based simulator Castalia to demonstrate the better performance of the proposed QoS based routing protocol for reliability sensitive data in terms of successful transmission rate, lower network routing traffic (hello packets) overhead, and lower end-to-end delay (latency) in both stationary and movable patient scenarios.

Multiple-locus variable number tandem repeat analysis of Neisseria gonorrhoeae isolates in Russia

In the present study, a multiple-locus variable number tandem repeat analysis (MLVA) was used to assess the molecular epidemiology of Neisseria gonorrhoeae clinical isolates originating from different regions of Russia. MLVA, based on seven loci, was performed on 218 isolates that were previously tested for susceptibility to penicillin, tetracycline and ciprofloxacin and for the presence of certain genetic determinants of drug resistance. In total, 83 MLVA types were identified, indicating that MLVA is a highly discriminatory technique with a Hunter–Gaston discriminatory index of 0.963 (95% CI, 0.950–0.977). MLVA type 16 was shown to be the most prevalent type and is undoubtedly associated with a multidrug resistant phenotype. The spread of MLVA type 16 from Moscow to Irkutsk suggests that this type has a highly successful transmission rate. Hierarchical cluster analysis of the MLVA profiles classified 208 isolates (95%) into six large groups (containing more than 10 isolates). Clusters differed in geographical characteristics and susceptibility profiles. MLVA cluster A comprised in total 34 isolates and was unambiguously associated with multidrug resistance. Most isolates in cluster A carried mutations in penA, ponA, rpsJ, mtrR, gyrA, and parC genes. MLVA cluster D was associated with resistance to penicillin and with mutations in ponA and rpsJ genes and the presence of plasmid-borne bla(TEM-1) gene. MLVA clusters B, C and E were associated with susceptibility to ciprofloxacin and had a lack of mutations in ponA, rpsJ, gyrA, and parC genes. We conclude that MLVA will be a useful tool for N. gonorrhoeae epidemiological studies.

Energy-Efficient MAC Protocol for Wireless Sensor Networks - A Review

Energy efficiency is the kernel issue in the designing of wireless sensor network(WSN) MAC protocols. Energy efficiency is a major consideration while designing wireless sensor network nodes. Most sensor network applications require energy autonomy for the complete lifetime of the node, which may span up to several years. These energy constraints require that the system be built such that Wireless sensor networks use battery-operated computing and sensing devices. A network of these devices will collaborate for a common application such as environmental monitoring. Each component consumes minimum possible power, ensure the average successful transmission rate, decrease the data packet average waiting time, and reduce the average energy consumption. Influencing by the design principles of traditional layered protocol stack, current MAC protocol designing for wireless sensor networks (WSN) seldom takes load balance into consideration, which greatly restricts WSN lifetime. As a novel Forwarding Election-based MAC protocol, is presented to prolong WSN lifetime by means of improving energy efficiency and enhancing load balance.

항만물류 응용에서의 WiFI와 Zigbee 망간 선제적 패킷 충동 회피 알고리즘

USNs (Ubiquitous Sensor Networks) such as IEEE 802.15.4 ZigBee network share ISM (Industrial, Scientific, and Medical) frequency band with WiFi networks. Once both networks operate in a region, packet collision may happen because of frequency overlapping. To assure this possibility, we conducted experiments where WiFi and ZigBee communication networks had been installed in an area. As a result of the test, successful data transmission rate were reduced due to the frequency overlapping between a WiFi communication channel and a ZigBee communication band. To cope with this problem, we propose a collision avoidance algorithm. In the proposed algorithm, if frequency collision is sensed, new communication channel with different frequency band is allocated to each node. Performance of the proposed frequency collision avoidance algorithm was tested and the results were described.

An Effective Emergency Message Delivery Mechanism for VANET

VANETs can provide traffic warring service to help drivers drive safely based on the information of the traffic condition. The driver can drive safely through the warning service information provided by the VANET and know the traffic condition exactly more than through only the sight of driver. In this paper we suggest a new mechanism of updating the table to broadcast the message more rapidly based on the table driven method as the way of sending the emergency message in the VANETs. When updating the table, nodes sends only based on the message transmission success rate. In the result of simulation we could find that the suggested mechanism would reduce the delay time of the emergency message broadcast compared to the existing mechanism.

Heterogeneity and independency of unitary synaptic outputs from hippocampal CA3 pyramidal cells

The variation of individual synaptic transmission impacts the dynamics of complex neural circuits. We performed whole-cell recordings from monosynaptically connected hippocampal neurons in rat organotypic slice cultures using a synapse mapping method. The amplitude of unitary excitatory postsynaptic current (uEPSC) varied from trial to trial and was independent of the physical distance between cell pairs. To investigate the source of the transmission variability, we obtained patch-clamp recordings from intact axons. Axonal action potentials (APs) were reliably transmitted throughout the axonal arbour and showed modest changes in width. In contrast, calcium imaging from presynaptic boutons revealed that the amplitude of AP-evoked calcium transients exhibited large variations both among different boutons at a given trial and among trials in a given bouton. These results suggest that a factor contributing to the uEPSC fluctuations is the variability in calcium dynamics at presynaptic terminals. Finally, we acquired triple whole-cell recordings from divergent circuit motifs with one presynaptic neuron projecting to two postsynaptic neurons. Consistent with the independency of calcium dynamics among axonal boutons, a series of uEPSC fluctuations was not correlated between the two postsynaptic cells, indicating that different synapses even from the same neuron act independently.We conclude that the intra-bouton and inter-bouton variability in AP-induced calcium dynamics determine the heterogeneity and independency of uEPSCs.

Optimal Brightness-Rate Control using VR-MPPM and its Spectral Analysis for VLC System

The opportunity provided by variable-rate multipulse-position-modulation (VR-MPPM), to jointly control brightness level and data transmission rate for visible light communication system, makes it an attractive solution. An optimization problem is formulated, to exploit the underlying tradeoff between brightness resolution and successful data transmission rate, when using VR-MPPM. To analyze, how brightness control affects the bandwidth requirements for data transmission we have performed spectral analysis of VR-MPPM. Performance evaluation results provide an optimal choice of symbol frame size and experimental results show that frame error rate for different brightness levels depends on the receiver bandwidth.

A Mobile Agent Routing Algorithm in Dual-Channel Wireless Sensor Network

A mobile agent routing algorithm (MARA) is presented in this paper, and then based on the dual-channel communication model, the two-layer network combination optimization strategy is also proposed. Since this strategy deals with the collision between packets and the multicast suppression in channel competitive process well, the blocking probability of network and the error rate of packet transmission can be cut down by utilizing this strategy. Furthermore, a restore rule for the failure optimal route is presented too. By using this rule, the optimal route can restore quickly in the local of fail nodes and most of the information of original optimal route can be reserved. Compared with other existing algorithms like ant colony optimization-based dynamic energy-efficient mobile agent routing algorithm (ADEEMA) and mobile agent-based wireless sensor network (MAWSN), simulation results show that MARA performs better in improving the success rate of packet transmission and cutting down the delay of communication. The success rate of packet transmission is improved 15%. Simultaneously, this algorithm can keep the ant agents away from the nodes with less residual energy in searching for the optimal route. This way can make the energy of each nodes on the optimal route overall decline and hence improve the lifetime of network.

Epidemic theory based H + 1 hop forwarding for intermittently connected mobile ad hoc networks

In intermittently connected mobile ad hoc networks, how to guarantee the packet delivery ratio and reduce the transmission delay has become the new challenge for the researchers. Epidemic theory based routing had shown the better performance in the aspect of improving transmission successful rate and reducing the delay, which under the situation that there is no limitation of the node buffer and network bandwidth. In general, epidemic routing adopts the 2-hop or multi-hop forwarding mode to forward the relay packet. However, these two modes have the obvious disadvantage. In this article, we introduce a novel H + 1 hop forwarding mode that is based on the epidemic theory. First, we utilize the susceptible infected recovered model of epidemic theory to estimate the amount of relay node (epidemic equilibrium) and the delivery delay within the epidemic process. Second, we formulate the amount number of relay nodes into a single absorbing Markov chain model. Based on the Markov chain, we estimate the expected delay for the packet transmission. Simulation results show that compared with the basic epidemic and Spray and Wait protocols, the H + 1 hop forwarding mode has the better performance on the delivery delay and amount of copies.

A distributed backoff-channel deflection algorithm with load balancing for optical burst switching networks

Optical burst contention is one of the major factors that cause the burst loss in the optical burst switching (OBS) networks. So far, various contention resolution schemes have been proposed. Among them, the deflection path is more attractive due to its low requirement for optical buffer in capability and quantity. However, these deflection path algorithms do not consider the successful transmission rate of deflection traffic, and the deflection traffic's impacts on the original traffic of the deflection path are not concerned. Meanwhile, the offset-time deficit problem for deflected bursts is ignored. Therefore, in order to reduce the burst loss probability in OBS networks, a Distributed Backoff-channel DeFlection algorithm with load balancing, for short DBDF-LB, is proposed. It consists of two parts, that is, the deflection with load balancing and the backoff-channel buffering scheme. Firstly, from the perspective of the network-wide load balancing, the optimal deflection path, on which the contention-failure burst is deflected with the minimum hops and the least burst loss probability, is selected. Secondly, the extra offset-time for the deflected burst is provided through the backoff-channel scheme. Finally, by numerical simulations, compared with the classical shortest path deflection algorithm, the DBDF-LB can obviously reduce the burst loss probability, about 50%, with a little extra overhead.

LR-WPAN에서 실시간 재전송 성능분석

본 논문에서는 IEEE 802.15.4 표준에 따른 저속 무선 개인영역 네트워크 환경에서 재전송 슬롯 기반의 실시간 서비스 방식을 제안한다. 제안 방식에서는 LR-WPAN 표준의 비컨 활성화 모드에서, 음성 전송과 같은 실시간 데이터 서비스 중에 에러가 발생되면 패킷 재전송을 위한 특정한 슬롯이 다음 슈퍼프레임에 동적으로 배정된다. 이는 열악한 채널 에러 환경에서 시간적인 다이버시티를 얻을 수 있도록 하여 QoS가 보장되도록 한다. 성능분석 결과에서 제안 방식은 LR-WPAN 환경에서 기존의 공통채널 방식보다 패킷 에러에 강인하면서도 우수한 전송률을 제공하며, GTS 슬롯당 사용률이 개선됨을 알 수 있다. In this paper, we propose a real-time service based on retransmission slot in low rate WPAN. In the proposed scheme, during the communication period of the beacon-enabled mode in LR-WPAN standard, a special GTSs is dynamically assigned for retransmission of the packet that fails during a real-time service such as voice. This provides a time diversity in the severe channel error environments to support the required QoS. Analytical results show that this scheme achieves a much higher throughput and better transmission success rate per GTS slot than conventional schemes such as a common reserved scheme in LR WPAN.

A Reliability-Oriented Transmission Service in Wireless Sensor Networks

Reliable communications are essential for most applications in wireless sensor networks (WSNs). In traditional approaches, the per-hop and end-to-end (E2E) recovery schemes are widely used. These schemes, however, suffer from low E2E success rate and poor energy efficiency in large-scale real environments. Through empirical studies, in this paper we identify three major problems that hinder the efficient and reliable communications. To address these problems, we propose a novel in-middle recovery scheme and realize it by designing and implementing a proliferation routing. Proliferation routing integrates three core technologies, namely, capability-based path finder, a randomized dispersity, and reproduction. Proliferation routing offers great flexibilities for transmissions. It cannot only be applied with any Medium Access Control (MAC) protocols and routing metrics, but also obtains a desired service quality (i.e., transmission success rate, energy cost, etc.) by controlling the system parameters. To demonstrate the effectiveness of proliferation routing, we thoroughly analyze its performance. We also conduct performance evaluations through implementation experiments as well as simulations. In a specific experimental setup, proliferation routing can increase the E2E transmission success rate up to 80 percent compared with the well-known hop-based routing and flooding.

H<inf>∞</inf>-based fault detection for nonlinear networked systems with random packet dropout and probabilistic interval delay

The fault detection problem for the nonlinear networked control system (NCS) with packet dropout and delay is inves- tigated. A nonlinear stochastic system model is proposed to account for the NCS with random packet dropout and network- induced non-uniformly distributed time-varying delay in both from sensor to controller (S/C) and from controller to actuator (C/A). Based on the obtained NCS model, employing an observer-based fault detection filter as the residual generator, the addressed fault detection problem is converted into an auxiliary nonlinear H∞ control problem. Then, with the help of Lyapunov functional ap- proach, a sufficient condition for the desired fault detection filter is constructed in terms of certain linear matrix inequalities, which depend on not only the delay interval but also the delay interval occurrence rate and successful packet communication rate. Es- pecially, a trade-off phenomenon between the maximum allowable delay bound and successful data packet transmission rate is found, which is typically resulted from the limited bandwidth of commu- nication networks. The effectiveness of the proposed method is demonstrated by a simulation example.

A Game Theory-Based Obstacle Avoidance Routing Protocol for Wireless Sensor Networks

The obstacle avoidance problem in geographic forwarding is an important issue for location-based routing in wireless sensor networks. The presence of an obstacle leads to several geographic routing problems such as excessive energy consumption and data congestion. Obstacles are hard to avoid in realistic environments. To bypass obstacles, most routing protocols tend to forward packets along the obstacle boundaries. This leads to a situation where the nodes at the boundaries exhaust their energy rapidly and the obstacle area is diffused. In this paper, we introduce a novel routing algorithm to solve the obstacle problem in wireless sensor networks based on a game-theory model. Our algorithm forms a concave region that cannot forward packets to achieve the aim of improving the transmission success rate and decreasing packet transmission delays. We consider the residual energy, out-degree and forwarding angle to determine the forwarding probability and payoff function of forwarding candidates. This achieves the aim of load balance and reduces network energy consumption. Simulation results show that based on the average delivery delay, energy consumption and packet delivery ratio performances our protocol is superior to other traditional schemes.