Packet Transmission Success Rate Research Articles

Secure routing protocol based on dynamic reputation and load balancing in wireless mesh networks

Aiming at the characteristics of dynamic topology change and vulnerability of wireless mesh networks (WMN), a secure routing protocol based on dynamic reputation and load balance (SRP-DRLB) is proposed to improve the routing security and load balance. By dynamically predicting of the reputation and traffic of the node in WMN, SRP-DRLB adopts edge weight strategy and node load idleness to avoid the competitive access of a large number of data packets to nodes with high reputation. SRP-DRLB dynamically adjusts routes according to the real-time status of network nodes’ reputation and traffic, reducing the impact of malicious nodes on the network and the overload of high-reputation nodes, thus improving the identification rate of malicious nodes and node load balancing. Simulation results show that SRP-DRLB can effectively ensure the security of data transmission, and it has the advantages of improving the identification rate of malicious nodes, the success rate of packet transmission and avoiding network congestion.

Environmental Perception Q-Learning to Prolong the Lifetime of Poultry Farm Monitoring Networks

The reduction of the effects of heat-stress phenomena on poultry health and energy conservation of poultry farm monitoring networks are highly related problems. To address these problems, we propose environmental perception Q-learning (EPQL) to prolong the lifetime of poultry farm monitoring networks. EPQL consists of an environmental-perception module and Q-learning. According to the temperature and humidity model of heat stress, an environmental-perception module determines the transmission rate, while Q-learning adjusts the transmission rate according to the success rate of packet transmission and the remaining energy. In real-world tests, our poultry farm monitoring networks used only about 8% of energy in a month. The real-time information of these monitoring networks was available on smartphones. In laboratory tests, compared with CSMA/CA (23.67 days), S-MAC (109.37 days), and T-MAC (252.79 days) under real systems with 2000 mAh battery, the battery-life performance of EPQL (436.48 days) was better. Moreover, EPQL reduces the packet loss rate by about 60% while simultaneously decreasing the average delay by about 20%. Generally, based on the framework of EPQL, the implemented temperature and humidity model of heat stress for poultry could be replaced by other models to extend its applicability range.

A multi-hop routing protocol based on link state prediction for intra-body Wireless Nanosensor Networks

As a network that communicates human health information, iWNSNs (in-vivo Wireless Nanosensor Networks) must be able to detect and report back to human health in real time, and low delay and high reliability are required in iWNSNs. In view of the unstable link state in iWNSNs, a multi-hop routing protocol based on link state prediction called MRLSP is proposed. The protocol proposes a link state estimation based on Kalman filtering. In addition, an ultrasonic energy harvesting system is introduced to intermittently charge nanonodes. In the routing process, the protocol first ensures the forwarding direction of the data packet by limiting the range of the next hop node, and uses the historical state and current information of the link to estimate the link state. Finally, a fuzzy system is established using the link state, the distance and the node’s remaining energy. We use the fuzzy logic output as the criterion to select the next hop node to ensure that fewer hops complete the forwarding and successful transmission of the packet. The simulation results verify that MRLSP has advantages in end-to-end delay and data packet transmission success rate, and can maximize network performance while ensuring sufficient node energy.

An Optimized Routing OLSR Protocol with Low Control Overhead for UAV Ad Hoc Networks

OLSR (Optimized Link State Routing) protocol is a priori Routing protocol applied in MANET network. All nodes in the network have Routing information to other nodes locally and need to send a large number of control messages to maintain the topology information of the whole network. In UAV application scenarios, with the increase of node density, the control overhead will be too high and the problems of hidden terminals will be intensified. Secondly, due to the fast moving speed of UAVs, when the neighboring UAVs have moved out of the communication range of the local node, the local node still retains the routing information of the neighbor node, leading to the problem of packet loss when the link information is updated behind time. Aiming at the above problems, an OLSR protocol with low control overhead and optimal routing is proposed. The protocol uses the incremental HELLO message mechanism to ensure that only incremental information is exchanged when the network topology changes slowly, and the control overhead is greatly reduced. When calculating routing, in the range of n hops, the more stable link is selected under the same number of hops. Simulation results show that the proposed algorithm can significantly improve the success rate of packet transmission and end-to-end delay, and reduce the system control overhead.

TSIRP: A Temporal Social Interactions-Based Routing Protocol in Opportunistic Mobile Social Networks

With the increasing number of smart device users, data transmission between users is becoming more important, and a network architecture called opportunistic mobile social network (OMSN) is gaining attention. However, routing in OMSNs is a challenging problem due to the frequent disconnection between nodes and the absence of paths from the source to the destination. It results in a complex topology and a low packet transmission success rate. Therefore, we propose a novel routing algorithm called the temporal social interactions-based routing protocol (TSIRP) for solving the problem of low network performance due to the improper selection of message relay nodes. First, we focus on the temporal context of social interactions. Specifically, at a certain time of the day, a person has specific people with whom the person usually interacts (e.g., workers usually meet co-workers during working hours; students usually meet their classmates during class). Based on temporal social interactions between nodes, potential forwarding metrics are proposed and calculated for each time of the day to make forwarding decisions. Second, we propose a new scheme to control the message spreading rate, which allows achieving a balance between delivery latency and overhead ratio. In addition, an analytical model is also designed using an absorbing Markov chain to estimate the performance of TSIRP. Simulations were also conducted, and the results indicate that TSIRP can achieve better performance than existing routing protocols in terms of packet delivery ratio, delivery latency, network overhead ratio, and average hop count.

A self-adaptive network for multi-robot warehouse communication

With the growing popularity of e-commerce, warehouse communication needs to operate in a dynamic environment with multiple robots in the system. Such multi-robot systems have many practical issues in reality. Among the major issues, end-to-end reliable communication is seen to take up prominence in literature. The current work introduces a novel self-adaptive network structure with two of its essential sub-blocks namely ‘Prioritization’ and ‘Optimal Path Selection’ as part of communication protocol for effective and reliable communication. For the first sub-block, we propose transmission deadline and information content based priority model which significantly improves critical packet transmission success rate and for the second sub-block, an optimal path selection method is proposed as a new path planning method which is capable of reducing the outage probability of the failed transmission. A typical configuration of warehouse has been simulated in Network Simulator-3 (NS-3) and real warehouse data has been used in analyzing the proposed functional blocks. A closed-form expression of outage probability is also analytically derived. Results are promising to apply them for dynamic multi-robot systems in general, and specifically for warehouse applications.

An Improved Heterogeneous Motion Prediction Algorithm for Vehicle-to-Vehicle Message Ferrying in VANETs

In infrastructure-less ad-hoc networks, the nodes can converse directly with other nodes without centralized servers. The vehicular networks are derived from the features of mobile ad-hoc networks (MANETs) whereas the message transmissions between the nodes are direct with each other or through some fixed terminals. But, a unique trademark is that the vehicle-to-vehicle ad-hoc links are poor because of extreme mobility which leads to frequent route breakage that causes emergency message delivery failure. The routing protocols availed in MANETS does not suit due to quick topology changes. The hop selection is based on the best cumulative communication duration that will be failing in some cases. Also, the worst/average case scenario is that the minimum connectivity to the source vehicle is not described in existing approaches. The core idea about the proposed research is to deliver data through an optimum path and to eliminate rupture link during the packet transmission. The system uses the Heterogeneous Motion Guess (HMG) algorithm for vehicular networks to set up a vested path. The HMG will select the relay vehicle's current position is near to the target vehicle plus the vehicle will opt the relay forwarder that has good radio coverage. The link lifetime of the selected hop should be greater than the minimum connectivity duration with the source vehicle. The selected vehicle will append the link expiry time and minimum connectivity duration in Route Demand Dispatch message in a unicast manner. This approach significantly minimizes the hop count numbers and improves the stability of the path. It radically predicts the link life, so the node can decide an alternative vested route. The simulation result shows how well the reactive demand-based HMG affords optimum results in terms of packet transmission success rate, average minimum hop counts, and communication delay.

An Energy Balance Clustering Routing Protocol for Intra-Body Wireless Nanosensor Networks.

Wireless NanoSensor Networks (WNSNs) are a new type of network that combines nanotechnology and sensor networks. Because WNSNs have great application prospects in intra-body health monitoring, biomedicine and damage detection, intra-body Wireless NanoSensor Networks (iWNSNs) have become a new research hotspot. An energy balance clustering routing protocol (EBCR) is proposed for the intra-body nanosensor nodes with low computing and processing capabilities, short communication range and limited energy storage. The protocol reduces the communication load of nano-nodes by adopting a new hierarchical clustering method. The nano-nodes in the cluster can transmit data directly to the cluster head nodes by one-hop, and the cluster head nodes can transmit data to the nano control node by multi-hop routing among themselves. Furthermore, there is a tradeoff between distance and channel capacity when choosing the next hop node in order to reduce energy consumption while ensuring successful data packet transmission. The simulation results show that the protocol has great advantages in balancing energy consumption, prolonging network lifetime and ensuring data packet transmission success rate. It can be seen that EBCR protocol can be used as an effective routing scheme for iWNSNs.

Research on Routing Algorithm in Intelligent Meter Reading

The introduction to broadband micro-power wireless technology in the national network intelligent meter reading system can increase the bandwidth, improve the meter reading performance, and make up for the narrow bandwidth and low speed in narrow-band micro-power wireless and PLC technology. In the smart meter reading network, the generation and maintenance of routes are the key. This paper improves the AODVjr algorithm and improves it from full-network broadcasting to semi-directional directed broadcasting, calculating channel quality based on weight, making it suitable for real-time routing repair in broadband micro-power wireless intelligent meter reading. The improved algorithm minimizes route repair time and routing overhead while ensuring communication success rate. The simulation results show that with the increase of the number of nodes, the semi-directional broadcast has much better performance in routing request packet transmission success rate, average hop count, communication success rate, and route repair delay than the whole network broadcast.

DV-Hop Localization With Protocol Sequence Based Access

Among typical range-free localization schemes for sensor networks, DV-Hop has its distinguishing advantage of the capability to localize unknown nodes, which have less than three or even no neighbor anchors. However, existing DV-Hop based localization methods have not considered the problem of packet collisions, which can frequently happen during the throughout-whole-network broadcast of numerous data packets at the first two steps of DV-Hop. In order to effectively improve the success rate of packet transmission between nodes, this paper proposes a medium access control (MAC) method based on Chinese Remainder Theorem (CRT) protocol sequence for DV-Hop localization. First, a broadcasting strategy is designed for the proposed MAC method. Then, dedicated procedures for both anchor nodes and unknown nodes are presented to implement the designed MAC method in DV-Hop localization. Through simulation and evaluation, the performance of DV-Hop localization with the proposed MAC method is thoroughly investigated. Simulation results show that when the number of protocol sequences is larger than a certain number, the proposed MAC method can provide DV-Hop with better localization accuracy than E-CSMA/CA, while keeping similar localization time.

IEEE 802.11 네트워크에서 전력량 소모 감소를 위한 이동 호스트의 가변적인 송신 출력 제어 방법

IEEE 802.11 무선랜에서는 전력 절약을 위하여 Power Saving Mode(PSM)를 채택하고 있다. 본 논문에서는 기존의 PSM과는 다르게 경쟁기반인 DCF(Distributed Coordination Function)와 무경쟁기반인 PCF(Point Coordination Function) 수행 후에 이동 단말이 정보 전송을 할 때 이동 호스트의 전력 절약을 위한 새로운 방식을 제안한다. 본 논문에서 제안하는 방식은 정보 전송의 권한을 가진 이동 호스트가 액세스 포인트(Access point)와의 거리를 추정하고 그 거리를 고려하면서 이동 호스트의 송신 출력을 능동적으로 제어한다. 모의실험을 통하여 우리는 제안한 방법이 거리와 상관없이 동일한 전송 전력을 사용하는 기존의 방법과 비교할 때 더 작은 전송 전력을 소모하면서도 비슷한 패킷 전송의 성공률을 가짐을 알 수 있다. IEEE 802.11 Wireless Local Area Network (WLAN) adopts Power Saving Mode(PSM) to save the power. Unlike existing PSM, this paper proposes a new scheme for the power saving of the Mobile Host(MH) when a MH performs the data transmission after the competition-based DCF(Distributed Coordination Function) and competition free-based PCF(Point Coordination Function). In this paper, The proposed scheme estimates the distance between the MH with the authority of data transmission and the Access Point(AP) and then adaptively controls the power of the MH considering the distance. Through the simulation result, we find that the proposed scheme consumes the smaller transmission power and has the similar success rate of packet transmission when it is compared to the existing scheme which uses the same power without the consideration of the distance.

Opportunistic Routing Using Prioritized Forwarders with Retransmission Control

Abstract In ad hoc networks, broadcast-based forwarding protocols called opportunistic routing have been proposed. In general backoff-based opportunistic routing protocols, each receiver autonomously makes a forwarding decision using a random backoff time based on logical distance. However, each potential forwarder must wait for the expiration of the backoff timer before the packet forwarding. Moreover, they cannot gain forwarding path diversity in sparse environments. In this paper, we propose a novel forwarder selection method for opportunistic routing. In the proposed method, a terminal called, a prioritized forwarder, and which is selected from among neighbours and can forward packets without using the backoff time. In addition, we integrate a hop-by-hop retransmission control in the proposed method, which improves the packet transmission success rate in sparse environments. We evaluate the proposed method in comparison with the conventional protocols in computer simulations.

Low-SAR Path Discovery by Particle Swarm Optimization Algorithm in Wireless Body Area Networks

Sensor nodes in wireless body area networks are placed on the surface of the human skin or embedded inside the human body. When a transmitter sends packets, signals reach the receiver through the human body or skin. However, electric and magnetic field (EMF) radiation generated during packet transmission can lead to a negative influence on human health. The specific absorption rate (SAR) is defined as a measure of the amount of radio frequency energy absorbed by human tissue in units of mass. The higher the human body absorbs the value of the specific absorption rate, the more EMF radiation. Also, the degree of harm to human health is greater. This paper uses the particle swarm optimization algorithm to discover the optimal position of the relay node so that sensor nodes can send packets to the hub via the relay node through a path with the lowest SAR and the success rate of packet transmission thus can be improved.

차량 이동 방향과 밀집도를 고려한 UIGRP(Urban Intersection based Geographic Routing Protocol) 설계

Abstract This paper proposes the UIGRP, which can tackle the problem of the network disconnection and packet transmission delay caused by turning vehicles frequently in an urban intersection. The UIGRP was designed as follows. First, it calculates the direction of vehicles using the moving direction of vehicles and the location of a destination. Second, it makes the RSU measure the density of an urban intersection. Third, the TGF Algorithm inthe UIGRP decides the data transmission paths by setting as an intermediate node, not only the vehicle that is movingin the direction where a destination node is located, but also the node that has the highest density. The TGF algorithmusing a moving direction and density minimizes or removes the occurrence of local maximum problems that the existing Greedy Forwarding algorithm has. Therefore, the simulation result shows that UIGRP decreases the occurrence of local maximum problems by 3 and 1 times, and the packet transmission time by 6.12 and 2.04(ms),and increases the success rate of packet transmission by 15 and 3%, compared to the existing GPSR and GPUR.

A Routing Protocol for Emergency Communication Based on Load Balancing

Ad-hoc communications is a mobile communication networks and computer networks combine with no infrastructure support, and network survivability and flexibility is strong, especially suitable for emergency communication. As the existing mobile ad hoc network routing protocols lack of network load balancing capabilities, this paper proposed a routing protocol based on load balancing LBBR (Load Balancing Based Routing). Simulation results shows that, LBBR can improve the success rate of packet transmission, reducing the average end to end delay, thus effectively improving network performance.

WBAN 환경에서 동적 우선순위를 적용한 MAC 프로토콜에 관한 연구

IEEE 802.15.6 표준화 문서에서 WBAN을 위한 MAC 프로토콜은 의료용 센서 노드의 주기적인 데이터를 효율적으로 처리하기 위해서 8단계로 나누어진 트래픽 우선순위를 기준으로 응급 상황에서 발생하는 트래픽을 가장 높은 우선순위로 처리하는 CSMA/CA(Carrier Sense Multiple Access with Collision Avoidance) 알고리즘을 수행하게 된다. 노드가 전송하는 응급 메시지는 충돌이 발생하게 되고 응급 메시지 전송을 위한 전송 지연을 만족하지 못하는 상황이 발생할 수 있으며 재전송으로 인한 에너지 낭비를 가져올 수 있다. 본 논문에서는 이러한 문제점들을 해결하기 위해서 다음과 같이 WBAN 환경에서 데이터 종류와 전송률을 고려한 CSMA/CA 알고리즘 요소기술을 제안하였다. 성능평가 결과 제안한 MAC 프로토콜을 사용했을 때가 IEEE 802.15.6을 사용했을 때 보다 충돌 확률이 감소하여 패킷 전송 성공률과 에너지 효율이 개선된 것을 확인할 수 있었다. To support the WBAN, IEEE 802.15 Task Group 6 announced standardized documents on technical requirements of the PHY and MAC. In the IEEE 802.15.6 MAC protocol, CSMA/CA(Carrier Sense Multiple Access with Collision Avoidance) algorithm is performed based on the eight-level priorities according to the type of traffics of the periodic data from medical sensor nodes. Several nodes, which detected the changed bio signals, transmit emergency data at the same time, so latency could be higher than emergency latency and energy consumption will increase. In this thesis, we proposed a CSMA/CA algorithm in WBAN to solve these problems. Simulations are performed using a Castalia based on the OMNeT++ network simulation framework to estimate the performance of the proposed superframe and algorithms. Performance evaluation results show that the packet transmission success rate and energy efficiency are improved by reducing the probability of collision using the proposed MAC protocol.

IEEE 802.11 DoS attack detection and mitigation utilizing Cross Layer Design

Denial of Service (DoS) attack is a powerful attack that disrupts the network and deprives the legitimate users from utilizing the network resources. DoS attacks could be implemented to target any layer of the Open Systems Interconnection (OSI) layers, in this paper we are focusing on DoS attacks that target the Medium Access Control (MAC) layer in wireless networks. We present a complete solution using Cross Layer Design techniques to detect and identify the attackers and to mitigate the attack by minimizing the negative impact on the network. DoS attacks could range from plain attacks which do not require any protocol modifications or intelligence during the attack like the signal jamming attack to sophisticated attacks where the attacker is intelligent and aware of its surroundings and constantly modifying its behavior during the attack to appear as a legitimate node to avoid detection. In this paper we are focusing on the sophisticated DoS attack in wireless networks using IEEE 802.11 Distributed Coordination Function (DCF) protocols [1–3], where the attacker is striving to appear as a legitimate member of the network and fully joined the network group and possesses for instance the spread sequence or the channel coding scheme. The algorithm is examined in fixed and mobile environments with multiple Physical (PHY) layer technologies (DSSS, FHSS, and OFDM) using different MAC layer protocols (IEEE 802.11, IEEE 802.11b, and IEEE 802.11g). DoS attackers illegally alter the IEEE 802.11 DCF standards and modify the MAC firmware code in the Network Interface Card (NIC) on their communication equipment to capture the channel by maximizing the packet transmission success rate to a degree where all other legitimate node will have near zero percent success rate for their packet transmissions. This type of DoS attack generally results in bandwidth starvation and extreme power and CPU processing consumption to the legitimate nodes in the network. Two-dimensional Markov Chain is modeled to obtain the maximum throughput to identify the DoS attackers and the rest of the presented algorithm mitigates the impact of the attackers while deceiving the attackers and make them falsely believe that the attacks are still disrupting the network so they do not resort to modifying the attacking techniques. The algorithm is validated using network simulations under different condition using different technologies.

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.

MP-AODV : AODV 기반 모바일 Ad-Hoc 네트워크에서의 다중경로 라우팅 프로토콜

본 논문에서는 모바일 노드들의 움직임이 심한 MANET 환경에서 데이터의 전송을 보다 안정적이고 신뢰성 있게 하기 위해 소스 목적지 간의 다중 경로를 찾는 새로운 방법을 제시하고자 한다. 새로운 다중경로 라우팅은 먼저 AODV에 기반을 두어 주경로를 설정하고 주경로로 설정된 노드는 보조경로 탐색에 참여하지 못하도록 하여 주경로와 보조경로를 노드 비 겹침(disjoint)하게 형성한다. 또한 주경로가 설정된 후 바로 데이터 전송을 시작하고 데이터 전송이 되고 있는 중에 백그라운드로 보조경로 탐색을 실행하여 경로 탐색 시에 발생하는 데이터 전송의 지연을 주경로 탐색 시에만 발생하도록 한다. 주경로와 보조경로 중 하나의 경로가 단절되면 즉시 다른 경로로 데이터전송을 하게 되고 단절된 경로는 경로유지를 통해 다시 노드 비 겹침 경로를 찾는다. 또한 노드 비 겹침, 링크 비 겹침 방식을 혼합한 하이브리드 방식을 제안하여 네트워크의 상황에 따라 적합한 방식으로 경로를 탐색하도록 한다. Qualnet 기반 시뮬레이션을 수행한 결과, 제안한 라우팅 프로토콜을 사용한 경우 AODV, AOMDV에 비해 높은 패킷 전송률을 보이고 종단간 지연시간도 줄어든다.

Impact of successive interference canceler on the performance of ubiquitous antenna‐based SDMA system

AbstractIn this paper, in order to improve the packet error rate of a ubiquitous antenna‐based SDMA (Space Division Multiple Access) system, the application of a successive interference canceler (SIC) is proposed. In a ubiquitous antenna‐based SDMA system, radio base stations (RBS) distributed throughout the service area are connected by radio‐on‐fiber links to the central control station (CCS). By performing all signal processing functions such as wireless modulation and demodulation at the CCS, simultaneous reception of several signals transmitted in the same frequency range is made possible and hence the frequency utilization efficiency can be enhanced. When an SIC is applied to the ubiquitous antenna system, the magnitude relationship of the power received by the user is different for each RBS as the RBSs are distributed at several locations. Hence, strength comparison of the received power is not easy. In the SIC proposed in this paper, the SINR (Signal to Interference plus Noise Ratio) after MMSE is estimated, and then the interference is eliminated according to size. A computer simulation is performed assuming a QPSK‐OFDM (Quadrature Phase Shift Keyed–Orthogonal Frequency Division Multiplex) signal with a coding rate of 1/2 in accordance with the IEEE 802.11a specification. It is made clear that by the use of the proposed scheme the required transmitted power satisfying the requirement of an average BER of 10−4 can be reduced by about 7.2 dB, and that with a packet transmission success rate of 0.9 it can be reduced by 8 dB. © 2004 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 87(12): 10–25, 2004; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20076