Future University Hakodate

About: Future University Hakodate is a education organization based out in Hakodate, Japan. It is known for research contribution in the topics: Network packet & Mobile ad hoc network. The organization has 485 authors who have published 1338 publications receiving 13204 citations. The organization is also known as: Mirai Daigaku (Future University) Hakodate Japan.

Throughput analysis in mobile ad hoc networks with directional antennas

Abstract: A major obstacle stunting the application of mobile ad hoc networks (MANETs) is the lack of a general throughput analysis theory for such networks. The available works in this area mainly focus on asymptotic throughput study (order sense) in MANETs with omnidirectional antennas or directional antennas. Although the order sense results can help us to understand the general scaling behaviors, it tells us little about the exact achievable throughput. This paper studies the achievable throughput of a MANET where each node is equipped with a directional antenna of beamwidth ? for transmission. A generalized two hop relay scheme with packet redundancy f is adopted for packet routing. Based on the Markov chain and automatic feedback theory, we explore a general theoretical framework that enables the achievable throughput analysis to be conducted for a directional antenna-based MANET. Based on the results of the achievable per node throughput, we further explore the throughput optimization problem for a fixed beamwidth ? and determine the corresponding optimal setting of f to achieve the optimal throughput. Numerical studies are also conducted to demonstrate the efficiency of these models.It shows that the maximum achievable throughput obtained from our theoretical framework matches nicely (with at most 7% difference) with that obtained from simulation under a realistic model.

Privacy-Preserving Two-Party K-Means Clustering via Secure Approximation

Abstract: K-means clustering is a powerful and frequently used technique in data mining. However, privacy breaching is a serious problem if the k-means clustering is used without any security treatment, while privacy is a real concern in many practical applications. Recently, four privacy-preserving solutions based on cryptography have been proposed by different researchers. Unfortunately none of these four schemes can achieve both security and completeness with good efficiency. In this paper, we present a new scheme to overcome the problems occurred previously. Our scheme deals with data standardization in order to make the result more reasonable. We show that our scheme is secure and complete with good efficiency.

Entertainment feature of a game using skin conductance response

Abstract: There are many computer games in the world, but generally game players challenge either the computer, or real players in the case of many person games. In view of the strong connectivity advocated between communication and entertainment in the field of entertainment computing, the use of biological signals for computer games is of interest. Here, a novel type of game using biological signals was developed as an entertainment device. The change in skin conductance caused by sweating was measured as a signal reflecting the player's agitation during the game. This type of game incorporates various characteristics relating to communication. First, players of the game challenge themselves because they are able to view their detected biological signals. In this situation, a kind of self-reference system is constructed. Second, the environments in which the game is played changed how the game was enjoyed. Third, the game system reveals differences of context between player and observer. From these characteristics, it is considered that the use of biological signals is attractive for entertainment computing.

Lightweight Tag-Based PHY-Layer Authentication for IoT Devices in Smart Cities

Abstract: This article proposes a general and lightweight PHY-layer authentication framework for the Internet of Things (IoT) devices in smart cities, based on tag embedding and tag verification. More specifically, a tag signal carefully designed to be independent of the message signal of a transmitter [i.e., an IoT device (IoTD)] is encrypted and embedded into the signal of the device, and the tag signal is then retrieved at a receiver based on signal detection techniques to verify if it is from the legitimate IoTD or from an illegitimate adversary. With the help of matrix analysis and composite hypothesis testing theories, analytical models are further developed to depict the authentication performance of the proposed authentication framework under various tag signal models. We then provide numerical results to validate these analytical models and to illustrate how authentication performance against the typical impersonation attack varies with system parameters. Finally, we include discussions to demonstrate the effectiveness of the proposed authentication solution in resisting against other various attacks like replay, unauthorized detection, tampering, and man-in-the-middle.

QoS-Aware Secure Routing Design for Wireless Networks With Selfish Jammers

Abstract: This paper focuses on the QoS-aware secure routing design based on the physical layer security technology for a multi-hop wireless network consisting of legitimate nodes, malicious eavesdroppers, and selfish jammers. We first provide theoretical modeling for a given route to reveal how its end-to-end security/QoS performance is related to the transmitting power of legitimate nodes along the route and the jamming power of jammers in the network. We then design an incentive mechanism that stimulates jammers to generate artificial jamming for security enhancement, and also develop a non-cooperative game framework to resolve the jamming power setting issue here. Based on the security/QoS performance modeling of the route and jamming power setting, we further propose a theoretical framework to determine the optimal transmitting power of nodes along the route such that its optimal transmission security can be achieved under a QoS constraint. Finally, with the help of the power setting results of the given route, we formulate a shortest weighted path-finding problem to identify the optimal route for data delivery in the network, which can be solved by employing the Bellman-Ford or Dijkstra’s algorithm. It is demonstrated that the proposed routing scheme is individually rational , stable , distributed and computationally efficient .