Most wireless networks are specified as using the data link protocol, i.e. layer 2 (L2). Recently, IoT and big data processing have promoted the use of wireless sensor networks to connect and send data to data center applications over the Internet. To do so, the implementation of an IP stack on the wireless node, or the gateway of the IP and wireless L2 network, has been proposed. Both approaches were developed to allow applications on the IP network to access L2 wireless network nodes. However, since wireless sensor networks do not require any network protocol, an IP is not essential for collecting data. Therefore, we propose a novel bridging VPN for connecting wireless networks, in which the application and wireless end nodes are not required to acknowledge an IP address or network protocol. In this way, the IP network merely serves to transport the data link frames of wireless networks. We believe that this is another style of IoT and recommend that this VPN be used as a test bed for small IoT businesses and institutions before they start to implement an IP stack on their systems.
Fanxin ZENG Lijia GE Xiping HE Guixin XUAN Guojun LI Zhenyu ZHANG Yanni PENG Linjie QIAN Sheng LU
The shift-and-add property (SAP) of a p-ary m-sequence {ak} with period N=pn-1 means that this sequence satisfies the equation {ak+η}+{ak+τ}={ak+λ} for some integers η, τ and λ. For an arbitrarily-given p-ary m-sequence {ak}, we develop an algebraic approach to determine the integer λ for the arbitrarily-given integers η and τ. And all trinomials can be given. Our calculation only depends on the reciprocal polynomial of the primitive polynomial which produces the given m-sequence {ak}, and the cyclotomic cosets mod pn-1.
In this paper, we first evaluate Breadcrumbs in wireless multi-hop networks and reveal that they brings throughput improvement of not only popular content but also less popular content. Breadcrumbs can distribute popular content traffic towards edges of a wireless network, which enables low-popularity content to be downloaded from the gateway node. We also propose a new caching decision, called receiver caching. In receiver caching, only the receiver node caches the transmitted content. Our simulation results show that receiver caching prevents frequent replacement of cached content, which reduces invalid Breadcrumbs trails to be remained. And they also show that receiver caching significantly improves the total throughput performance of Breadcrumbs.
Shuhei YAMAKAMI Masaki NIWA Yojiro MORI Hiroshi HASEGAWA Ken-ichi SATO Fumikazu INUZUKA Akira HIRANO
Link-level and node-level blocking in photonic networks has been intensively investigated for several decades and the C/D/C approach to OXCs/ROADMs is often emphasized. However, this understanding will have to change in the future large traffic environment. We herein elucidate that exploiting node-level blocking can yield cost-effective large-capacity wavelength routing networks in the near future. We analyze the impact of link-level and node-level blocking in terms of traffic demand and assess the fiber utilization and the amount of hardware needed to develop OXCs/ROADMs, where the necessary number of link fibers and that of WSSs are used as metrics. We clarify that the careful introduction of node-level blocking is the more effective direction in creating future cost effective networks; compared to C/D/C OXCs/ROADMs, it offers a more than 70% reduction in the number of WSSs while the fiber increment is less than ~2%.
Stefan COVACI Matteo REPETTO Fulvio RISSO
5G infrastructures will heavily rely on novel paradigms such as Network Function Virtualization and Service Function Chaining to build complex business chains involving multiple parties. Although virtualization of security middleboxes looks a common practice today, we argue that this approach is inefficient and does not fit the peculiar characteristics of virtualized environments. In this paper, we outline a new paradigm towards autonomous security assurance in 5G infrastructures, leveraging service orchestration for semi-autonomous management and reaction, yet decoupling security management from service graph design. Our work is expected to improve the design and deployment of complex business chains, as well as the application of artificial intelligence and machine learning techniques over large and intertwined security datasets. We describe the overall concept and architecture, and discuss in details the three architectural layers. We also report preliminary work on implementation of the system, by introducing relevant technologies.
Yuyin YU Zongxiang YI Chuanming TANG Jian GAO
For any positive integer n, define an iterated function $f(n)=left{ egin{array}{ll} n/2, & mbox{ $n$ even, } 3n+1, & mbox{ $n$ odd. } end{array}
ight.$ Suppose k (if it exists) is the lowest number such that fk(n)
Yutaka TABUCHI Shuhei TAMATE Yasunobu NAKAMURA
In this paper, we briefly review the concept of superconducting quantum computers and discuss their hardware architecture. We also describe the necessary technologies for the development of a medium-scale quantum computer with more than tens of thousands of quantum bits.
The optical-transition edge sensors are single-photon detectors that can determine photon energies at visible to telecommunication wavelengths. They offer a high detection efficiency and negligible dark count, which are very attractive qualities for applications in quantum optics or bioimaging. This study reviews the operating principles of such detectors and the current status of their development.
Yurino SATO Hiroyuki KOGA Takeshi IKENAGA
Packet losses significantly degrade TCP performance in high-latency environments. This is because TCP needs at least one round-trip time (RTT) to recover lost packets. The recovery time will grow longer, especially in high-latency environments. TCP keeps transmission rate low while lost packets are recovered, thereby degrading throughput. To prevent this performance degradation, the number of retransmissions must be kept as low as possible. Therefore, we propose a scheme to apply a technology called “forward error correction” (FEC) to the entire TCP operation in order to improve throughput. Since simply applying FEC might not work effectively, three function, namely, controlling redundancy level and transmission rate, suppressing the return of duplicate ACKs, interleaving redundant packets, were devised. The effectiveness of the proposed scheme was demonstrated by simulation evaluations in high-latency environments.
Order preserving matching refers to the problem of reporting substrings in the text which are order-isomorphic to the pattern. In this paper, we show a simple heuristic which runs in linear time on average, based on finding the largest elements in each substring and checking their locations against that of the pattern. It is easy to implement and experimental results showed that the running time grows linearly.
Guangna ZHANG Yuanyuan GAO Huadong LUO Nan SHA Shijie WANG Kui XU
In this paper, we investigate a cooperative communication system comprised of a source, a destination, and multiple decode-and-forward (DF) relays in the presence of a potential malicious eavesdropper is within or without the coverage area of the source. Based on the more general Nakagami-m fading channels, we analyze the security performance of the single-relay selection and multi-relay selection schemes for protecting the source against eavesdropping. In the single-relay selection scheme, only the best relay is chosen to assist in the source transmission. Differing from the single-relay selection, multi-relay selection scheme allows multiple relays to forward the source to the destination. We also consider the classic direct transmission as a benchmark scheme to compare with the two relay selection schemes. We derive the exact closed-form expressions of outage probability (OP) and intercept probability (IP) for the direct transmission, the single-relay selection as well as the multi-relay selection scheme over Nakagami-m fading channel when the eavesdropper is within and without the coverage area of the source. Moreover, the security-reliability tradeoff (SRT) of these three schemes are also analyzed. It is verified that the SRT of the multi-relay selection consistently outperforms the single-relay selection, which of both the single-relay and multi-relay selection schemes outperform the direct transmission when the number of relays is large, no matter the eavesdropper is within or without the coverage of the source. In addition, as the number of DF relays increases, the SRT of relay selection schemes improve notably. However, the SRT of both two relay selection approaches become worse when the eavesdropper is within the coverage area of the source.
Hoai Son NGUYEN Dinh Nghia NGUYEN Shinji SUGAWARA
DHT routing algorithms can provide efficient mechanisms for resource placement and lookup for distributed file sharing systems. However, we must still deal with irregular and frequent join/leave of nodes and the problem of load unbalancing between nodes in DHT-based file sharing systems. This paper presents an efficient file backup scheme based on dynamic DHT key space clustering in order to guarantee data availability and support load balancing. The main idea of our method is to dynamically divide the DHT network into a number of clusters, each of which locally stores and maintains data chunks of data files to guarantee the data availability of user data files even when node churn occurs. Further, high-capacity nodes in clusters are selected as backup nodes to achieve adequate load balancing. Simulation results demonstrate the superior effectiveness of the proposed scheme over other file replication schemes.
If a shared IP network is to deliver large-volume streaming media content, such as real-time videos, we need a technique for explicitly setting and dynamically changing the transmission paths used to respond to the congestion situation of the network, including multi-path transmission of a single-flow, to maximize network bandwidth utilization and stabilize transmission quality. However, current technologies cannot realize flexible multi-path transmission because they require complicated algorithms for route searching and the control load for route changing is excessive. This paper proposes a scheme that realizes routing control for multi-path transmission by combining multiple virtual networks on the same physical network. The proposed scheme lowers the control load incurred in creating a detour route because routing control is performed by combining existing routing planes. In addition, our scheme simplifies route searching procedure because congestion avoidance control of multi-path transmission can be realized by the control of a single path. An experiment on the JGN-X network virtualization platform finds that while the time taken to build an inter-slice link must be improved, the time required to inspect whether each slice has virtual nodes that can be connected to the original slice and be used as a detour destination can be as short as 40 microseconds per slice even with large slices having more than 100 virtual nodes.
Yutaro HAYAKAWA Kenichi YASUKATA Jin NAKAZAWA Michio HONDA
Increasing hardware resources, such as multi-core and multi-socket CPUs, memory capacity and high-speed NICs, impose significant challenges on Network Function Virtualization (NFV) backends. They increase the potential numbers of per-server NFs or tenants, which requires a packet switching architecture that is not only scalable to large number of virtual ports, but also robust to attacks on the data plane. This is a real problem; a recent study has reported that Open vSwitch, a widely used software switch, had a buffer-overflow bug in its data plane that results the entire SDN domain to be hijacked by worms propagated in the network. In order to address this problem, we propose REdge. It scales to thousands of virtual ports or NFs (as opposed to hundreds in the current state-of-the art), and protect modular, flexible packet switching logic against various bugs, such as buffer overflow and other unexpected operations using static program checking. When 2048 NFs are active and packets are distributed to them based on the MAC or IP addresses, REdge achieves 3.16 Mpps or higher packet forwarding rates for 60 byte packets and achieves the wire rate for 1500 byte packets in the 25 Gbps link.
Tianyu LU Haibo DAI Juan ZHAO Baoyun WANG
We investigate the uplink channel selection problem of unmanned aerial vehicle (UAV)-aided data collection system in delay-sensitive sensor networks. In the studied model, the fixed-wing UAV is dispatched to gather sensing information from terrestrial sensor nodes (SNs) and they contend for uplink channels for transmission. With the goal of minimizing the system-wide delay, we formulate a resource allocation problem. Encountered with the challenge that the flight trajectory of UAV is unknown to SNs and the wireless channel is time-varying, we solve the problem by stochastic game approach and further propose a fully distributed channel selection algorithm which is proved to converge to a pure strategy Nash Equilibrium (NE). Simulation results are presented to show that our proposed algorithm has good performance.
Yifei LIU Yuan ZHAO Jun ZHU Bin TANG
A novel Nyquist Folding Receiver (NYFR) based passive localization algorithm with Sparse Bayesian Learning (SBL) is proposed to estimate the position of a spaceborne Synthetic Aperture Radar (SAR).Taking the geometry and kinematics of a satellite into consideration, this paper presents a surveillance geometry model, which formulates the localization problem into a sparse vector recovery problem. A NYFR technology is utilized to intercept the SAR signal. Then, a convergence algorithm with SBL is introduced to recover the sparse vector. Furthermore, simulation results demonstrate the availability and performance of our algorithm.
Tiansa ZHANG Chunlei HUO Zhiqiang ZHOU Bo WANG
By taking advantages of deep learning and reinforcement learning, ADNet (Action Decision Network) outperforms other approaches. However, its speed and performance are still limited by factors such as unreliable confidence score estimation and redundant historical actions. To address the above limitations, a faster and more accurate approach named Faster-ADNet is proposed in this paper. By optimizing the tracking process via a status re-identification network, the proposed approach is more efficient and 6 times faster than ADNet. At the same time, the accuracy and stability are enhanced by historical actions removal. Experiments demonstrate the advantages of Faster-ADNet.