Enhancing Data Forwarding Efficiency in SIoT with Multidimensional Social Relations

Effective data communication is a crucial aspect of the Social Internet of Things(SIoT)and continues to be a significant research focus.This paper proposes a data forwarding algorithm based on Multidimensional Social Relations(MSRR)in SIoT to solve this problem.The proposed algorithm separates message forwarding into intra-and cross-community forwarding by analyzing interest traits and social connections among nodes.Three new metrics are defined:the intensity of node social relationships,node activity,and community connectivity.Within the community,messages are sent by determining which node is most similar to the sender by weighing the strength of social connections and node activity.When a node performs cross-community forwarding,the message is forwarded to the most reasonable relay community by measuring the node activity and the connection between communities.The proposed algorithm was compared to three existing routing algorithms in simulation experiments.Results indicate that the proposed algorithmsubstantially improves message delivery efficiency while lessening network overhead and enhancing connectivity and coordination in the SIoT context.

Lightweight Robust Forwarding Scheme for Multi-Hop Wireless Networks

The Gossip-Based Relay Protocol (GRP) is developed based on Ad Hoc on Demand Distance Vector Protocol (AODV) and proposed to increase the efficiency of package routing functionality in ad hoc networks through specific flooding scheme. This lightweight protocol reduced the collisions on the network through specific mechanisms. Request to Send/Clear to Send (RTS/CTS) mechanism is widely used in ad hoc environment with Temporarily Ordered Routing Algorithm (TORA) in order to eliminate collisions and allow access to the shared medium through proposed authentication methods. Since GRP contains specific mechanism of directed acyclic Graph (DAG) mechanism to mitigate overhead problem, RTS/CTS modified TORA might result in similar performance metrics. In this paper, TORA protocol has a modification of new RTS/CTS mechanism and has been simulated in order to be compared with proposed lightweight robust forwarding GRP scheme in terms of specific performance metrics such as network throughput, end-to-end delay and message flooding rate over the network through OPNET simulation package in order to expose the optimal solution to increase overall network throughput in ad hoc environment.

AVO forwarding modeling in two-phase media: multiconstrained matrix mineral modulus inversion

AVO forward modeling is based on two-phase medium theory and is considered an effective method for describing reservoir rocks and fluids. However, the method depends on the input matrix mineral bulk modulus and the rationality of the two-phase medium model. We used the matrix mineral bulk modulus inversion method and multiple constraints to obtain a two-phase medium model with physical meaning. The proposed method guarantees the reliability of the obtained AVO characteristicsin two-phase media. By the comparative analysis of different lithology of the core sample, the advantages and accuracy of the inversion method can be illustrated. Also, the inversion method can be applied in LH area, and the AVO characteristics can be obtained when the porosity, fluid saturation, and other important lithology parameters are changed. In particular, the reflection coefficient amplitude difference between the fast P wave and S wave as a function of porosity at the same incidence angle, and the difference in the incidence angle threshold can be used to decipher porosity.

Forwarding控制方法的改进及其在惯性摆系统中的应用

针对常规积分Forwarding设计的局限性,提出了—种新的设计方案。该方案增加了积分运算的自由度,因而有效地拓展了Forwarding设计的使用范围。运用所提出的方法对惯性摆系统进行了控制器的设计。此外,设计过程中同时还构造出该系统的控制Lyapunov函数。理论与实际表明了这种控制方案的有效性。

基于行为模型的IP Forwarding异常检测方法

通过研究网络流动态特征,基于路由变化、流变化和包延迟,以及IP报文头信息(例如TTL、源/目的地址、报文长度和路由器时间戳)建立网络行为模型,通过高性能测量和在线分析网络流和路由信息对初始网络异常产生实时报警,实现了IP forwarding网络异常的有效检测和识别。定义了网络行为模型的五种功能模块,通过关联空间和时间状态信息检测识别网络异常为大范围监测网络提供强大支持。

International Freight Forwarding Services Network in the Yangtze River Delta, 2005–2015: Patterns and Mechanisms

This study examined the spatio-temporal trajectories of the international freight forwarding service(IFFS) in the Yangtze River Delta(YRD) and explored the driving mechanisms of the service. Based on a bipartite network projection from an IFFS firm-city data source, we mapped three IFFS networks in the YRD in 2005, 2010, and 2015. A range of statistical indicators were used to explore changes in the spatial patterns of the three networks. The underlying influence of marketization, globalization, decentralization, and integration was then explored. It was found that the connections between Shanghai and other nodal cities formed the backbones of these networks. The effects of a city's administrative level and provincial administrative borders were generally obvious. We found several specific spatial patterns associated with IFFS. For example, the four non-administrative centers of Ningbo, Suzhou, Lianyungang, and Nantong were the most connected cities and played the role of gateway cities. Furthermore, remarkable regional equalities were found regarding a city's IFFS network provision, with notable examples in the weakly connected areas of northern Jiangsu and southwestern Zhejiang. Finally, an analysis of the driving mechanisms demonstrated that IFFS network changes were highly sensitive to the influences of marketization and globalization, while regional integration played a lesser role in driving changes in IFFS networks.

Enhancing Interest Forwarding for Fast Recovery from Unanticipated Data Access Failure in NDN

We show that an aggregated Interest in Named Data Networking (NDN) may fail to retrieve desired data since the Interest previously sent upstream for the same content is judged as a duplicate one and then dropped by an upstream node due to its multipath forwarding. Furthermore, we propose NDRUDAF, a NACK based mechanism that enhances the Interest forwarding and enables Detection and fast Recovery from such Unanticipated Data Access Failure. In the NDN enhanced with NDRUDAF, the router that aggregates the Interest detects such unanticipated data access failure based on a negative acknowledgement from the upstream node that judges the Interest as a duplicate one. Then the router retransmits the Interest as soon as possible on behalf of the requester whose Interest is aggregated to fast recover from the data access failure. We qualitatively and quantitatively analyze the performance of the NDN enhanced with our proposed NDRUDAF and compare it with that of the present NDN. Our experimental results validate that NDRUDAF improves the system performance in case of such unanticipated data access failure in terms of data access delay and network resource utilization efficiency at routers.

REDUCING BURST PACKET LOSS THROUGH ROUTE-FREE FORWARDING

It is well known that today's inter-domain routing protocol, Border Gateway Protocol (BGP), converges slowly during network failures. Due to the distribution nature of Internet routing decisions and the rate-limiting timer Minimum Route Advertisement Interval (MRAI) of BGP, unavoidable convergence latency is introduced in reaction to network changes. During the period of convergence temporarily routing table inconsistencies cause short-term routing blackholes and loops which result in widespread temporary burst packet loss. In this paper, we present ROute-Free Forwarding (ROFF) - a novel technique for packet delivering continuously during periods of convergence. With slightly modifications on IP packet header and BGP, route loops and blackholes can be avoided. Our preliminary evaluation demonstrates that ROFF succeeds in reducing the number of Autonomous Systems (ASes) which experience burst packet loss and the duration of packet loss.

Detection of Insider Selective Forwarding Attack Based on Monitor Node and Trust Mechanism in WSN

The security problems of wireless sensor networks (WSN) have attracted people’s wide attention. In this paper, after we have summarized the existing security problems and solutions in WSN, we find that the insider attack to WSN is hard to solve. Insider attack is different from outsider attack, because it can’t be solved by the traditional encryption and message authentication. Therefore, a reliable secure routing protocol should be proposed in order to defense the insider attack. In this paper, we focus on insider selective forwarding attack. The existing detection mechanisms, such as watchdog, multipath retreat, neighbor-based monitoring and so on, have both advantages and disadvantages. According to their characteristics, we proposed a secure routing protocol based on monitor node and trust mechanism. The reputation value is made up with packet forwarding rate and node’s residual energy. So this detection and routing mechanism is universal because it can take account of both the safety and lifetime of network. Finally, we use OPNET simulation to verify the performance of our algorithm.

ESMD-Flow: An Intelligent Flow Forwarding Scheme with Endogenous Security Based on Mimic Defense in Space-Air-Ground Integrated Network

The Space-Air-Ground Integrated Network(SAGIN) realizes the integration of space, air,and ground networks, obtaining the global communication coverage.Software-Defined Networking(SDN) architecture in SAGIN has become a promising solution to guarantee the Quality of Service(QoS).However, the current routing algorithms mainly focus on the QoS of the service, rarely considering the security requirement of flow. To realize the secure transmission of flows in SAGIN, we propose an intelligent flow forwarding scheme with endogenous security based on Mimic Defense(ESMD-Flow). In this scheme, SDN controller will evaluate the reliability of nodes and links, isolate malicious nodes based on the reliability evaluation value, and adapt multipath routing strategy to ensure that flows are always forwarded along the most reliable multiple paths. In addition, in order to meet the security requirement of flows, we introduce the programming data plane to design a multiprotocol forwarding strategy for realizing the multiprotocol dynamic forwarding of flows. ESMD-Flow can reduce the network attack surface and improve the secure transmission capability of flows by implementing multipath routing and multi-protocol hybrid forwarding mechanism. The extensive simulations demonstrate that ESMD-Flow can significantly improve the average path reliability for routing and increase the difficulty of network eavesdropping while improving the network throughput and reducing the average packet delay.

Multi-Hop Free Space Optical Communications Using Serial Decode-and-Forward Relay Transmissions

This paper investigates the performance of multi-hop Free Space Optical(FSO) communications using serial Decode-and-Forward(DF) relay transmissions.A statistical model for the optical intensity fluctuation at the receiver due to the combined effects of atmospheric turbulence-induced fading,mis alignment fading and pass-loss is presented.Under given weather and mis alignment conditions,a closed-form analytical expression for the end-to-end outage probability of serial Decode-and-Forward(DF) multi-hop FSO communications is derived.Numerical results show that the serial DF multi-hop transmission is a promising technology to enhance the performance of FSO communications.Moreover,the derived analytical expression can provide close approximations to the simulation results.

DESIGN AND EVALUATION OF A PIPELINED FORWARDING ENGINE

Recent advances in broadband technology have caused forwarding engines to handle pack- ets with over 10 gigabit per second. In this paper, we present a high-speed forwarding pipeline which can finish all of the routing and forwarding tasks in the way of pipelining. We also establish the analysis model of the pipeline with which one can evaluate some key performance parameters of the forwarding engine such as forwarding rate and forwarding delay. We find that the pipeline is of good scalability and can forward unicast packets up to the speed of 40Gbit/s.

A Direction-Based Data Forwarding Algorithm for Opportunistic Networks

In this paper, the forwarding objective and mobility law of nodes in opportunistic networks are first investigated to establish a mathematical model for further analysis, then a gradually accelerated data forwarding algorithm is proposed. In this algorithm, according to the distance between data carriers （nodes） and the destination, some intermediate nodes are selected to relay the data. Especially, the forwarded copies can be increased when the delay reaches a threshold, to guarantee the required delivery ratio. The simulation results show that the proposed algorithm can effectively reduce the storage occupancies of nodes and forwarding delay, and guarantee the delivery ratio simultaneously.

REMUDA: A Practical Topology Control and Data Forwarding Mechanism for Wireless Sensor Networks

In wireless sensor networks, topology control plays an important role for data forwarding efficiency in the data gathering applications. In this paper, we present a novel topology control and data forwarding mechanism called REMUDA, which is designed for a practical indoor parking lot management system. REMUDA forms a tree-based hierarchical network topology which brings as many nodes as possible to be leaf nodes and constructs a virtual cluster structure. Meanwhile, it takes the reliability, stability and path length into account in the tree construction process. Through an experiment in a network of 30 real sensor nodes, we evaluate the performance of REMUDA and compare it with LEPS which is also a practical routing protocol in TinyOS. Experiment results show that REMUDA can achieve better performance than LEPS.

Improved forwarding control design method and its application

Integrator forwarding is a recursive nonlinear design technique for the stabilization of feed-forward systems. However, this method still has some limitation. An improved design method is proposed to extend the field of application of this technique. This method is used to design a stabilizer for the inertia wheel pendulum system. Moreover, it is shown that the control Lyapunov function which is obtained from this method can also be used to design a globally asymptotically stabilizing controller with optimality.

Trajectory-Based Data Forwarding Schemes for Vehicular Networks

This paper explains trajectory-based data forwarding schemes for multihop data delivery in vehicular networks where the trajectory is the GPS navigation path for driving in a road network. Nowadays, GPS-based navigation is popular with drivers either for efficient driv- ing in unfamiliar road networks or for a better route, even in familiar road networks with heavy traffic. In this paper, we describe how to take advantage of vehicle trajectories in order to design data-forwarding schemes for information exchange in vehicular networks. The design of data-forwarding schemes takes into account not only the macro-scoped mobility of vehicular traffic statistics in road net- works, but also the micro-scoped mobility of individual vehicle trajectories. This paper addresses the importance of vehicle trajectory in the design of multihop vehicle-to-infrastructure, infrastructure-to-vehicle, and vehicle-to-vehicle data forwarding schemes. First, we explain the modeling of packet delivery delay and vehicle travel delay in both a road segment and an end-to-end path in a road net- work. Second, we describe a state-of-the-art data forwarding scheme using vehicular traffic statistics for the estimation of the end-to- end delivery delay as a forwarding metric. Last, we describe two data forwarding schemes based on both vehicle trajectory and vehicu- lar traffic statistics in a privacy-preserving manner.

A Novel Forwarding Method for Full-Duplex Two-Way Relay Networks

An estimate-and-forward(EF) scheme for single-input single-output(SISO) and multiple-input multiple-output(MIMO) full-duplex two-way relay networks is proposed and analyzed. The relay estimates the received signal from two terminal nodes by a minimum mean squared error(MMSE) estimation and forwards a scaled version of the MMSE estimate to the destination. The proposed EF outperforms conventional amplify-and-forward(AF) and decode-and-forward(DF) across all signal-to-noise ratio(SNR) region. Because its computational complexity is high for relays with a large number of antennas(large MIMO) and/or high order constellations, an approximate EF scheme, called list EF, are thus proposed to reduce the computational complexity. The proposed list EF computes a candidate list for the MMSE estimate by using a sphere decoder, and it approaches the performance of the exact EF relay at a negligible performance loss. The proposed forwarding approach also could be used to other relay networks, such as half-duplex, one-way or massive MIMO relay networks.

A Cooperative Forwarding Scheme for VANET Routing Protocols

Providing efficient packet delivery in vehicular ad hoc networks （VANETs） is particularly challenging due to the vehicle move- ment and lossy wireless channels. A data packet can be lost at a forwarding node even when a proper node is selected as the for- warding node. In this paper, we propose a loss-tolerant scheme for unicast routing protocols in VANETs. The proposed scheme employs multiple forwarding nodes to improve the packet reception ratio at the forwarding nodes. The scheme uses network coding to reduce the number of required transmissions, resulting in a significant improvement in end-to-end packet delivery ratio with low message overhead. The effectiveness of the proposed scheme is evaluated by using both theoretical analysis and computer sim-

Track-Monitoring and Analyzing Machine Clearances during Wood Forwarding

This article reports on track-monitoring and analyzing machine clearances during wood forwarding across seasons and weather, using ultrasonic distance sensors in combination with time-stamped GPS xy locations, at 10 sec intervals. The resulting data, obtained from 54 harvesting blocks, were analyzed by machine type (two wood forwarders and one grapple skidder), stand type (softwood plantation versus natural hardwood stands), month, slope, cartographic depth-to-water (DTW) classes, number of passes along track, and machine speed. For the most part, clearances were highly variable, due to passing over stumps, rocks, harvest slash, brushmats, ruts, and snow cover when present. This variability was on average greater for the lighter-weight wood forwarders than for the heavier-weight skidder, with the former mostly moving along equally spaced lines on brushmats, while the paths of the latter spread away from central wood-landing sites. In terms of trends, machines moved 1) more slowly on wet ground, 2) faster during returning than forwarding, and 3) fastest along wood-landing roads, as to be expected. Low clearances were most notable during winter on snow-covered ground, and on non-frozen shallow DTW and wet multiple-pass ground. During dry weather conditions, clearances also increased from low-pass tracks to multi-pass tracks due to repeat soil compaction of broadened tracks. These results are presented block-by-block and by machine type. Each block-based clearance frequency pattern was quantified through regression analysis and using a gamma probability distribution function.

Coverage Area Based Opportunistic Forwarding Algorithm in VANETs

The highly mobility of vehicles, intermittent communication between the vehicles and the requirements of real time applications are some of the main challenges of multi-hop message delivery in Vehicular Ad Hoc Networks （ VANETs ）. There are also additional challenges, especially when the destination for the message delivery is a moving vehicle. In this paper, we propose a novel multihop message delivery method, called the Coverage Area-based oPportunistic message forwarding algorithm （CAP）. The main idea of CAP is to cover the potential area of a moving target vehicle as much as possible with the reachable area of the required delivery messages, so that the message can be delivered successfully. Because the success ratio and overhead of the multi-hop message delivery are two important but incompatible parameters in CAP, two tunings are discussed in the algorithm in order to maintain the balance of the two parameters. The simulation results show that compared with other reference approaches, CAP provides an efficient message delivery with a higher success ratio and a shorter message deNNy.