Skip to main content

Über dieses Buch

This book highlights the latest research findings, innovative research results, methods and development techniques from both theoretical and practical perspectives related to the emerging areas of information networking and their applications. It includes the Proceedings of the 20th International Conference on Network-Based Information Systems (NBiS-2017), held on August 24–26, 2017 in Toronto, Canada.

Today’s networks and information systems are evolving rapidly. Further, there are dynamic new trends and applications in information networking such as wireless sensor networks, ad hoc networks, peer-to-peer systems, vehicular networks, opportunistic networks, grid and cloud computing, pervasive and ubiquitous computing, multimedia systems, security, multi-agent systems, high-speed networks, and web-based systems. These networks are expected to manage the increasing number of users, provide support for a range of services, guarantee the quality of service (QoS), and optimize their network resources. In turn, these demands are the source of various research issues and challenges that have to be overcome – and which these Proceeding address.



The 20 International Conference on Network-Based Information Systems (NBiS-2017)


Performance Evaluation of WMNs by WMN-PSOSA Simulation System Considering Constriction and Linearly Decreasing Inertia Weight Methods

Wireless Mesh Networks (WMNs) have many advantages such as low cost and increased high speed wireless Internet connectivity, therefore WMNs are becoming an important networking infrastructure. In our previous work, we implemented a Particle Swarm Optimization (PSO) based simulation system for node placement in WMNs, called WMN-PSO. Also, we implemented a simulation system based on Simulated Annealing (SA) for solving node placement problem in WMNs, called WMN-SA. In this paper, we implement a hybrid simulation system based on PSO and SA, called WMN-PSOSA. We evaluate the performance of WMN-PSOSA by conducting computer simulations considering two replacement methods: Constriction Method (CM) and Linearly Decreasing Inertia Weight Method (LDIWM). Simulation results show that the LDIWM has better performance than CM.

Shinji Sakamoto, Kosuke Ozera, Makoto Ikeda, Leonard Barolli

A Fuzzy-Based Approach for Improving Team Collaboration in MobilePeerDroid Mobile System: Effects of Time Delay on Collaboration Work

Mobile computing has many application domains. One important domain is that of mobile applications supporting collaborative work, such as, eLearning and eHealth. In this work we present a distributed event-based awareness approach for P2P groupware systems. Unlike centralized approaches, several issues arise and need to be addressed for awareness in P2P groupware systems, due to their large-scale, dynamic and heterogeneous nature. In such applications, a team of people collaborate online using smartphones to accomplish a common goal, such as a project development in e-Business. Often, however, the members of the team has to take decision or solve conflicts in project development (such as delays, changes in project schedule, task assignment, etc.) and therefore members have to vote. Voting can be done in many ways, and in most works in the literature consider majority voting, in which every member of the team accounts on for a vote. In this work, we consider a more realistic case where a vote does not account equal for every member, but accounts on according to member’s active involvement and reliability in the groupwork. We present a voting model, that we call qualified voting, in which every member has a voting score according to three parameters. Then, we use fuzzy based model to check the effect of time delay on collaboration work. This model will be implemented in MobilePeerDroid system to give more realistic view of the collaborative activity and better decisions for the groupwork, while encouraging peers to increase their reliability in order to increase their voting score.

Yi Liu, Kosuke Ozera, Keita Matsuo, Leonard Barolli

A Comparison Study of WLAN and WLAN Triage Systems Considering Throughput Parameter

Many devices communicate over Wireless Local Area Networks (WLANs). The IEEE 802.11e standard for WLANs is an important extension of the IEEE 802.11 standard focusing on QoS that works with any PHY implementation. The IEEE 802.11e standard introduces EDCF and HCCA. Both these schemes are useful for QoS provisioning to support delay-sensitive voice and video applications. EDCF uses the contention window to differentiate high priority and low priority services. However, it does not consider the priority of users. In this paper, in order to deal with this problem, we propose a Fuzzy-based Admission Control System (FACS). We compare the performance of WLAN and WLAN Triage systems considering throughput parameter. The experimental results show that the implemented testbed performs better than conventional WLAN.

Kosuke Ozera, Takaaki Inaba, Shinji Sakamoto, Leonard Barolli

An Eco Algorithm for Dynamic Migration of Virtual Machines in a Server Cluster

Electric energy consumed in server clusters has to be reduced. In our previous studies, the dynamic virtual machine migration (DVMM) algorithm is proposed to reduce the total electric energy consumption of servers. In this paper, we improve the DVMM algorithm to furthermore reduce the electric energy consumption. If an application issues a process to a cluster, a most energy-efficient host server is first selected and the process is performed on a virtual machine on the server. Then, a virtual machine migrates from a host server to a more energy-efficient guest server. In the evaluation, we show not only the total electric energy consumption and active time of servers but also the average execution time of processes can be reduced in the DVMM algorithm compared with other algorithms.

Dilawaer Duolikun, Ryo Watanabe, Tomoya Enokido, Makoto Takizawa

A Simple Energy-Aware Virtual Machine Migration Algorithm in a Server Cluster

It is critical to reduce the electric energy consumption of servers in a cluster. In this paper, we discuss a migration approach to reducing the electric energy consumption where virtual machines with application processes migrate to more energy-efficient servers. In the SEAM algorithm previously proposed, a host server to perform a process and to migrate a virtual machine is selected whose expected electric energy consumption is minimum. In this paper, the SEAM algorithm is improved where a host server is selected with minimum expected electric energy consumed by not only the host server but also the other servers. We show the total electric energy consumption of the servers can be reduced in the improved SEAM (ISEAM) algorithm compared with non-migration algorithms and the SGEA algorithm in the evaluation.

Ryo Watanabe, Dilawaer Duolikun, Qin Cuiqin, Tomoya Enokido, Makoto Takizawa

Evaluation of Flexible Synchronization Protocol to Prevent Illegal Information Flow in P2PPS Systems

We consider the peer-to-peer type of topic-based publish/subscribe (P2PPS) model where each process (peer) can publish and subscribe event messages with no centralized coordinator. Some information of a peer may flow to target peers by exchanging event messages. Here, the peer forgets topics which are in a publication of the event message but not in the subscription of the peer. In our previous studies, the flexible synchronization (FS) protocol and the relevance concept of topics are proposed. However, it is difficult, maybe impossible for each peer to know about every topic in a system. Each time a peer receives an event message, topics carried by the event message which the peer does not know but are related with subscribed topics are obtained in the peer. Thus, each peer learns and obtains new topics through receiving event messages. In the evaluation, we show the more number of topics each peer can initially subscribe, the fewer number of notifications are banned and the more number of forgotten topics are added to the subscription. However, the advantage obtained by initially including more number of topics decreases as the number of event messages exchanged among peers increases.

Shigenari Nakamura, Lidia Ogiela, Tomoya Enokido, Makoto Takizawa

Energy-Efficient Role Ordering Scheduler

In information systems, conflicting methods issued by multiple transactions have to be serialized to keep objects mutually consistent. There are various ways to serialize multiple conflicting transactions like timestamp ordering (TO) and FIFO schemes. In this paper, the energy-efficient role ordering (EERO) scheduler is proposed to not only serialize multiple conflicting transactions in the significant order of subjects but also reduce the total energy consumption of servers by omitting meaningless methods.

Tomoya Enokido, Dilawaer Duolikun, Makoto Takizawa

A GA-Based Simulation System for WMNs: A Comparison Study for Different WMN Architectures Considering Exponential and Weibull Distributions, HWMP and TCP Protocols

In our previous work, we implemented WMN-GA system which is based on Genetic Algorithms (GAs) and used it for node placement problem in WMNs. In this paper, we compare the performance of Exponential and Weibull distributions of mesh clients for two WMN architectures considering PDR, throughput, delay, fairness index and energy metrics. For simulations, we used ns-3, Hybrid Wireless Mesh Protocol (HWMP) and TCP. The simulation results show that the PDR for both distributions is almost the same. The throughput of Exponential distribution is a little bit higher than Weibull distribution. The delay of Weibull distribution is lower than Exponential distribution. For Hybrid WMN, the fairness index of Exponential distribution is higher than Weibull distribution. But for I/B WMN, the fairness index of Weibull distribution is higher than Exponential distribution.

Admir Barolli, Tetsuya Oda, Makoto Ikeda, Leonard Barolli, Makoto Takizawa

An Energy-Aware One-to-one Routing Protocol in Wireless Ad-Hoc Network

In wireless ad-hoc networks, messages are exchanged among nodes in wireless communication networks in ad-hoc routing protocols. Here, the electric energy consumed by nodes to send messages has to be reduced. The ESU (Energy-Saving Unicast routing) protocol is proposed in our previous study, where the electric energy consumption of each node can be reduced, but the length of source-destination route, i.e. number of nodes increases. In this paper, we newly propose an EAO (Energy-Aware One-to-one routing) protocol to shorten the length of a route and reduce the total electric energy consumption of nodes in a route. In the evaluation, we show the total electric energy consumption of nodes in a source-destination route can be reduced in the EAO protocol compared with other protocols.

Emi Ogawa, Shigenari Nakamura, Tomoya Enokido, Makoto Takizawa

Effect of Packet Error Rate on Selection of Actor Nodes in WSANs: A Comparison Study of Two Fuzzy-Based Systems

A group of wireless devices with the ability to sense physical events (sensors) or/and to perform relatively complicated actions (actors), is referred to as Wireless Sensor and Actor Network (WSAN). In this work, we propose and implement two Fuzzy Based Systems (FBS): FBS1 and FBS2 for actor selection in WSANs. The systems decide whether the actor will be selected for the required job or not, based on data supplied by sensors and actual actor condition. We evaluated the proposed system by computer simulations. Comparing FBS1 with FBS2, the FBS2 is more complex than FBS1, because it has more rules in FRB, but using FBS2 a better actor node can be selected, because the PER is low and the reliability of selected node is increased.

Donald Elmazi, Miralda Cuka, Tetsuya Oda, Elis Kulla, Makoto Ikeda, Leonard Barolli

Delay Tolerant Networking with Antenna Directional Controls with the Weight Function for the Multiple Vehicular Communication

The rapid development of the V2V communication expects us to realize new kinds of applications in recent. However, in fact, the vehicular wireless connections are considered to be difficult because of the obstacles or the rapid movements. Therefore, this paper proposes the Delay Tolerant Network System with the Adaptive Array Antenna to realize the Vehicular Network. Moreover, this article proposes the Antenna directions control DTN methods by using the weight functions in case of the multiple vehicular communication. Then, the prototype system is introduced, and the experiments are discussed for the future studies of the proposed systems.

Noriki Uchida, Tomoyuki Ishida, Yoshitaka Shibata

A Localization Free Variable Transmit Power Routing Protocol for Underwater Wireless Sensor Networks

In underwater wireless sensor networks (UWSNs), adjusting the transmit power of a sensor node in response to the time-varying characteristics of the aquatic medium is one of the promising techniques to combat the hostile environment. It can be used to mitigate the unwanted effects of noise, fading and attenuation on data and reliably deliver it from source to destination utilizing more transmit power. For favorable channel conditions, data packets can be reached to destination at the expense of lower energy consumption. In this chapter, we propose a localization-free variable transmit power routing (LF-VTPR) protocol for UWSNs. The proposed protocol adjusts the transmit power level of the data to send in proportion to the latest link quality states of the routing trajectories. The proposed work is unique and never been done in that it does not involve calculation of position information of nodes. All the conventional and variable transmit power routing protocols that involve localization of nodes require that the three dimensional position coordinates of sensor nodes must be known. Localization is energy inefficient for the limited battery life of sensor nodes in underwater communications. Also, it is difficult to achieve when nodes change their positions with water currents. The LF-VTPR uses the depth and response time information of sensor nodes to forward data to final destination. Simulation results reveal that the scheme outperforms some of the existing schemes in terms of throughput and end-to-end delay.

Anwar Khan, Ihsan Ali, Hasan Mahmood

Security of Visual Captcha for Authentication Procedures

In this paper will be described new idea of security procedures using visual captcha, and dedicated to authentication procedures. In particular will be presented the most important aspects connected with security of visual captcha used in security procedures, implemented in service management solutions in Cloud environment. Services management in Cloud Computing will be connected with application of secure cognitive information and cognitive management systems, supporting management activities and securing data using visual captcha solutions.

Urszula Ogiela, Makoto Takizawa, Lidia Ogiela

Mobility Information Infrastructure in Challenged Network Environment Based on IoT Technology

As progress of declining birth birthrate and population concentration to big cities, most of the local areas are suffering from depopulation and shrink of economy. The economic activity is degreasing and social infrastructure is deriving poor social infrastructure such as bad road conditions and challenged information communication infrastructure. For those reasons, we propose a new mobility information infrastructure using sensor technology. Road side wireless nodes and mobile nodes with various sensors and different wireless communication devices organize a large scale information infrastructure without conventional wired network. Eventually, very economical and low priced mobility network environment can be realized by V2X communication protocols. In this paper, its system configuration and architecture are precisely explained. The expected applications and services for residents are also discussed. A preliminary performance of the communication network is evaluated and discussed.

Yoshitaka Shibata, Kenta Ito

Energy Management in Residential Area using Genetic and Strawberry Algorithm

In our work, we consider the problem of load management in residential area. We adopt Genetic Algorithm (GA) and Strawberry Algorithm (SBA) for load scheduling. These algorithms are used to manage residential load between shoulder, on-peak and off-peak hours. Time of Use (ToU) pricing scheme has been used for bill calculation. Simulation results show that GA based energy optimization controller perform good than SBA based energy optimization controller in term of Peak to Average Ratio (PAR), electricity bill reduction and waiting time.

Salma Asif, Khadija Ambreen, Hina Iftikhar, Hasan Nasir Khan, Rubab Maroof, Nadeem Javaid

Biogeography Based Optimization for Home Energy Management in Smart Grid

In this paper, we use meta-heuristic algorithm: Genetic Algorithm (GA) and Biogeography based Optimization (BBO) integrated in Energy Management Controller (EMC) to evaluate the performance of home energy management in residential area. EMC is introduced with the objective of cost reduction and to manage high peak demand problem. Time of use tariff model is used for electricity bill calculation. Simulation results show the effectiveness and efficiency of proposed scheme by load management and cost reduction. BBO based EMC performs better than GA based EMC. We also perform comparison both GA based EMC and BBO based EMC with unscheduled scheme and results show both outperform than unscheduled. BBO based EMC is more efficient in electricity cost minimization and peak to average ratio minimization as compared to GA based EMC.

Hina Iftikhar, Salma Asif, Rubab Maroof, Khadija Ambreen, Hasan Nasir Khan, Nadeem Javaid

Demand Side Management Using Strawberry Algorithm and Bacterial Foraging Optimization Algorithm in Smart Grid

In Home Energy Management System (HEMs), consumer has the opportunity to schedule home appliances. In this paper, we have purposed an efficient HEMs by using two heuristic techniques: Bacterial Foraging Optimization Algorithm (BFA) and Strawberry Algorithm (SBA). We divide the appliances into three categories. The primary objective of this work is electricity cost and Peak to Average Ratio (PAR) minimization. Simulation results show that our optimization schemes reduce the total electricity cost and peak to average ratio by shifting the load from on peak hours to off peak hours. Results show that BFA performs better than SBA regarding electricity cost minimization. However, a trade-off always exists between cost and user comfort.

Hasan Nasir Khan, Hina Iftikhar, Salma Asif, Rubab Maroof, Khadija Ambreen, Nadeem Javaid

Demand Side Management Using Meta-Heuristic Techniques and ToU in Smart Grid

In this paper, we perform performance evaluation of home energy management system (HEMS) for demand side management (DSM) in smart grid. In this work, smart home is equipped with HEMS, smart meter, and smart appliances for two-way communication between utility and consumer. HEMS performs scheduling of smart appliances based on meta-heuristic techniques to balance load for whole day to avoid peak creation in any hour. Smart meter performs electricity cost calculation for consumed energy based on time of use (ToU) pricing signal provided by utility. Our focus is to efficiently handle user demand, reduction in peak-to-average ratio (PAR) and electricity cost minimization. The implemented meta-heuristic techniques in this work are: Enhanced differential evolution (EDE), harmony search algorithm (HSA), bacterial foraging algorithm (BFA), and genetic algorithm (GA). The simulation results show the performance of HEMS based on optimization techniques using ToU.

Sajeeha Ansar, Wajeeha Ansar, Kainat Ansar, Mohammad Hashir Mehmood, Muhammad Zabih Ullah Raja, Nadeem Javaid

Home Energy Management Based on Harmony Search Algorithm and Crow Search Algorithm

In this work, we evaluated the performance of home energy management system (HEMS) using two meta-heuristic optimization algorithms: harmony search algorithm (HSA) and crow search algorithms (CSA). For electricity bill calculation we use real time pricing (RTP) signals. Our main objectives are optimization of energy consumption, electricity cost minimization and peak to average ratio (PAR) reduction. Our results depict that CSA performs better than HSA in term of cost and HSA perform better than CSA in term of PAR reduction and user comfort (UC) maximization. Results also verify that there will always be trade-off between electricity cost and waiting time.

Ishtiaq Ali, Pamir, Muhammad Sufyan Khan, Hazrat Abubakar Sadiq, Syed Hasnain Faraz, Nadeem Javaid

Meta-Heuristic and Nature Inspired Approaches for Home Energy Management

In this paper, an energy management controller (EMC) is designed using three optimization techniques: harmony search algorithm (HSA), firefly algorithm (FA) and enhanced differential evolution (EDE). The objectives of this work are to minimize electricity cost as well as peak to average ratio (PAR) while maintaining the user comfort (UC). Critical peak pricing (CPP) is used for the calculation of electricity bill. The trade-off between UC and electricity cost is exploited in such a way that a stability is achieved among UC and electricity price that is preferred by the consumer. Reduction in PAR is beneficial for both consumer and utility as it provides stability to the electric grid.

Zain Ul Abideen, Fouzia Jamshaid, Asma Zahra, Anwar Ur Rehman, Sidra Razzaq, Nadeem Javaid

Home Energy Management Using Social Spider and Bacterial Foraging Algorithm

Electricity is a controllable and convenient form of energy and it provides power to appliances. As the population of world is increasing, the electricity demand is also increasing which leads to energy crisis. This problem can be control by using Demand Side Management (DSM) and Energy Management Scheduler (EMS). In this paper, we design EMS for residential area using two heuristic algorithms: Bacteria Foraging Algorithm (BFA) and Social Spider Optimization (SSO) algorithm. Our main objectives are to minimize electricity cost and Peak to Average Ratio (PAR). These algorithms help to shift the load from on-peak to off-peak hours. We use Real Time Price (RTP) signal for electricity bill calculation. Simulation results demonstrate that our designed EMS achieved our objectives effectively. SSO perform better in term of PAR and User Comfort (UC).

Waqar Ali, Anwar Ur Rehman, Muhammad Junaid, Sayed Ali Asjad Shaukat, Zafar Faiz, Nadeem Javaid

Home Energy Management Using HSA, FA, BFOA Algorithms in Smart Grids

In this paper, we have designed home energy management scheduler (HEMS) based on three heuristic algorithms such as, harmony search algorithm (HSA), firefly algorithm (FA) and bacteria foraging optimization algorithm (BFOA) with combination of critical peak pricing (CPP) signal model. Moreover, we are evaluating performance of above mentioned algorithms on the basis of electricity cost, peak hour scheduling, user comfort (UC) and peak to average ratio (PAR). Simulation results depict that our proposed HEMS significantly achieved targeted objectives. BFOA based HEMS outperformed FA and HSA in terms of PAR minimization, electricity cost reduction and maximization of UC.

Asma Zahra, Zain Ul Abideen, Anwaar Ur Rehmaan, Sidra Razzaq, Ayesha Anjum, Nadeem Javaid

Comparison of BFA and EWA in Home Energy Management System Using RTP

With the usage of demand side management (DSM) techniques, consumers such as residential, commercial and industrial are more flexible to use electricity according to their need. Many techniques are proposed to manage electricity cost, load, peak to average ratio (PAR) and user comfort of consumer appliances. In this paper we proposed a technique Earthworm Optimization Algorithm (EWA) that is developed for residential area in SG and compare with the Bacterial Foraging Algorithm (BFA). These algorithms are used for the scheduling the appliance load in real time pricing. Both algorithms are used to shifting the load from on-peak hours to off-peak hours in RTP and reduced the electric cost and PAR. We compare both algorithms in terms of electricity cost, PAR and used comfort. Our simulation results show that the EWA outperformed the BFA in terms of electricity cost however, BFA reduced the PAR as compared to EWA.

Syed Hassnain Faraz, Sajawal ur Rehman, Muhammad Azeem Sarwar, Ishtiaq Ali, Mashab Farooqi, Nadeem Javaid

Data Collecting System Based on CCN with Congestion Avoidance Routing on WSN

Recently, it is desired that realization of data collection without aware the data location by applying NDN, to WSN. Applying to NDN to WSN, however, is needed to consider the different situation compared with the wired network. The broadcast nature of wireless communication, induces the multiple reception of interest packets. Hence, in order to reduce needless transmissions, relay nodes among the requestor and contents holder, must selects appropriate next hop node. In this paper, we propose new forwarding method for selecting appropriate route on NDN under WSN environment. The proposal reduces the redundant transmissions by selecting proper route in accordance with the network conditions.

Tetsuro Kuniyasu, Tetsuya Shigeyasu

A Method for Vehicle Control at T-Junctions for the Diffusion Period of Autonomous Vehicles

The number of people who must drive even as they age is increasing. Therefore, traffic accidents caused by elderly people are also increasing. Additionally, reductions in traffic jams and CO2 emissions are increasingly expected by societies. Car manufacturers are actively researching autonomous vehicles that will be introduced in the market in the near future. However, there are accidents that cannot be avoided by autonomous vehicles. Currently, there is a lack of legal structure for determining responsibility in such accidents. Moreover, even if all new vehicles are autonomous, a mixed environment of autonomous and non-autonomous vehicles is expected to exist for at least the typical life span of a vehicle, ten years. In this paper, in effort to reduce the potential for traffic jams, the authors develop a behavior model for autonomous vehicles, which is then simulated on a traffic simulation of a T-junction in a provincial city, measuring success by the reduction in the resulting length of the traffic jam. Finally, we propose a method for implementation of the supporting system and discuss the result.

Hiroto Furukawa, Masashi Saito, Yuichi Tokunaga, Ryozo Kiyohara

Mechanism for Adopting Device-to-Device Communication in Cellular Networks

Recently Device-to-Device (D2D) communication has been proposed to efficiently utilize the resources of cellular networks by offloading some traffic of Base Station (BS) to direct links between User Equipments (UEs), i.e., cellular users. While there are many works on optimization of resource sharing for D2D communication in cellular networks, a little works has been done on how to attract users to adopt and take part in D2D communication. In this paper, in order to encourage users to adopt D2D communication, we present users achievable data rate both in D2D link and cellular link when they ask Base Station (BS) for contents. If the data rate in D2D link is less than cellular link, users will ask for reward for taking part in D2D communication. We also present how much reward will be awarded for taking part in D2D communication. By simulation, we show the percentage of users asking for rewards under various conditions. We see that all users do not ask rewards and willfully take part in D2D communication.

Bhed Bahadur Bista, Jiahong Wang, Toyoo Takata

Optimal Transmission Range in Sleeping Wireless Networks

Assigning the transmission range for wireless networks is a critical aspect that has been well studied. But, there has been no work on assigning optimal transmission ranges in energy-constrained wireless networks, where nodes periodically sleep in order to prolong the life-time. In this paper, we focus on building an analytical model for networks with mostly sleeping nodes. We study the impact of varying transmission ranges for different networks subjected to varied network loads on both per hop delay and end-to-end delay. Our model is general enough to be applied to any type sleep scheduling mechanism. Extensive simulation results in ns-2 validate our model.

Vamsi Paruchuri, Arjan Durresi

Load Balancing in Wireless Mesh Networks Based on OpenFlow

The wireless mesh network (WMN) is a state-of-the-art networking standard for the next generation of wireless networks. The construction of these networks is based on a network of wireless routers forwarding each other’s packets in a multi-hop manner. The advantages of WMNs are that they can be constructed over a wide area at low cost and have excellent expandability and flexibility. In order to communicate with high throughput in a WMN, routing with load balancing is needed. For this issue, distributed routing algorithms or the centralized architecture of the OpenFlow protocol have been proposed. However, in the distributed routing protocol, once a route is created, it continues to be used, even if the load increases, until one of its routers drops out. However, there are no load-balancing algorithms for large-scale WMNs with a centralized architecture. In this study, we propose a new routing architecture that centrally manages the results of distributed routing protocols by OpenFlow and dynamically balances the load. We also performed simulations to confirm the effectiveness of the proposed scheme using OpenFlow.

Shota Kubota, Fumiaki Sato

Directional Preference Collector Tree Protocol for Mobile Wireless Sensing

Wireless Sensor Networks (WSN) have become the topic of much study recently. The ability to handle mobility in WSNs have given rise to many new and exciting applications. However mobility has provided additional challenges in this field of study. Various protocols and algorithms have been modified in order to accommodate for mobility. In this paper, we present a modification to the popular Collection Tree Protocol (CTP) that allows the algorithm to perform better when tasked with maintain communication with mobile nodes in a network.

David Krynicki, Ramiro Liscano

Beyond Beacons – An Interactive Positioning and Tracking System Solely Based on BLE Mesh Network

Nowadays, more and more exhibition centers and store owners are deploying beacon devices to implement location-based services. However, the beacon technology can only provide one-way communication. If we need the smartphones to respond to the beacon messages, the smartphone users have to rely on their own mobile Internet connections to send the information back to the backend system. In some cases the mobile Internet services may not be always available. Therefore, we develop an interactive positioning and tracking system based solely on the BLE technology. Specifically, we make the beacon devices capable of two-way communication. On one hand, our beacon devices can detect the presence of a specific customer at specific locations, and then the presence information can be sent to the application server via the BLE mesh network consisting of beacon devices. On the other hand, the application server can send a personalized location-based message to the customer, again via the relay of beacon devices. The benefit of our system is two-fold: not only the customers without Internet connections can enjoy the positioning services, but also the backend system can be aware of the presence of specific customers and track their real-time locations. Experimental results showed that our system is practicable with moderate transmission latencies in the BLE mesh network.

You-Wei Lin, Chi-Yi Lin

Development of a Monitoring System Based on Power Consumption

In recent years, there has been an increase in demand for monitoring systems to help ensure the safety and wellbeing of elderly people and children [1, 2]. In this paper, we collaborate with a local company to collect power consumption data from home energy management systems (HEMS). Our goal is to determine the wake-up time of elderly household residents and obtain information about their general wellbeing. From our case study, it was determined that sensor data should be recorded at 5-minute intervals. In addition, we concluded that the door sensor and motion sensor are more useful in our system.

Kentaro Aburada, Kengo Todaka, Hisaaki Yamaba, Tetsuro Katayama, Mirang Park, Norio Shiratori, Naonobu Okazaki

A Study of Detecting Child Pornography on Smart Phone

Child Pornography is an increasingly visible rising cybercrime in the world today. Over the past decade, with rapid growth in smart phone usage, readily available free Cloud Computing storage, and various mobile communication apps, child pornographers have found a convenient and reliable mobile platform for instantly sharing pictures or videos of children being sexually abused. Within this new paradigm, law enforcement officers are finding that detecting, gathering, and processing evidence for the prosecution of child pornographers is becoming increasingly challenging. Deep learning is a machine learning method that models high-level abstractions in data and extracts hierarchical representations of data by using a deep graph with multiple processing layers. This paper presents a conceptual model of deep learning approach for detecting child pornography within the new paradigm by using log analysis, file name analysis and cell site analysis which investigate text logs of events that have happened in the smart phone at the scene of the crime using physical and logical acquisition to assists law enforcement officers in gathering and processing child pornography evidence for prosecution. In addition, this paper shows an illustrative example of logical and physical acquisition on smart phones using forensics tools.

Farkhund Iqbal, Andrew Marrington, Patrick C. K. Hung, Jing-Jie Lin, Guan-Pu Pan, Shih-Chia Huang, Benjamin Yankson

Computational Public Safety: The Evolution to Public Safety Research

The proliferation of internet connected devices, sensors and big data is changing the way public safety is being studied. Traditionally, statistical methods are used to extrapolate information from data in which public safety decisions based upon. The current state of interconnected systems and devices such as internet of thing (IoT), generate a continuous deluge of data are unable to be accommodated traditional means processing and mining. This paper surveys public safety topics in the context of digital systems and algorithms. Furthermore, we propose Computational Public Safety as the study of digital systems and algorithms that promote the welfare and protection of the general public.

Nhan Tran, Muthana Zouri, Alex Ferworn

Load Experiments of the vDACS Scheme in Case of the 600 Connections by 300 Clients

In the current Internet system, there are many problems using anonymity of the network communication such as personal information leaks and crimes using the Internet system. This is why TCP/IP protocol used in Internet system does not have the user identification information on the communication data, and it is difficult to supervise the user performing the above acts immediately. As a study for solving the above problem, there is the study of Policy Based Network Management (PBNM). This is the scheme for managing a whole Local Area Network (LAN) through communication control for every user. In this PBNM, two types of schemes exist. The first is the scheme for managing the whole LAN by locating the communication control mechanisms on the path between network servers and clients. The second is the scheme of managing the whole LAN by locating the communication control mechanisms on clients. As the second scheme, we have studied theoretically about the Destination Addressing Control System (DACS) Scheme. By applying this DACS Scheme to Internet system management, we will realize the policy-based Internet system management. In this paper, as the progression phase for the last goal, we perform the load experiment of the cloud type virtual PBNM named the vDACS Scheme, which can be used by plural organizations, for applications to the small and medium size scale organization. The number of clients used in an experiment is 600.

Kazuya Odagiri, Shogo Shimizu, Naohiro Ishii, Makoto Takizawa

QoS Aware Virtual Network Embedding in SDN-Based Metro Optical Network

A framework using Software Defined Networking (SDN) architecture to map the Virtual Network (VN) requests onto Edge Clouds interconnected by Metropolitan Optical Network (MON) is presented in this paper. As the proposed mathematical model relies on SDN for making an informed decision, the framework is termed as, Virtual Network Embedding on Metro Optical Network (VNE-MON). The proposed optimizer considers distinct characteristics of Optical Network and Multimedia applications to ensure Quality of Service (QoS) for the accepted VN requests. SDN enabled ensuring of proper coordination between different modules of the proposed framework. The proof of concept was demonstrated on a SDN and Generalized Multi-Protocol Label Switching (GMPLS) testbed. The two control planes were evaluated on different QoS metrics after VN embedding phase. Numerical result reveals that the proposed SDN-based model outperformed the current state of the art control plane GMPLS for optical network.

Faisal Zaman, Abdallah Jarray, Ahmed Karmouch

Verification of Data Collection Methods for Live Migration Protection Mechanism

This paper describes the live migration data protection mechanism. At the beginning of the live migration process, the proposed data protection mechanism verifies whether movement of the application’s data is allowed, based on the content of regulations related to data usage issued by the country and organization. This mechanism performs live migration only when migration is allowed. This mechanism enables the use of appropriate data while protecting privacy during the live migration process. We will describe and evaluate the implementation of the data protection mechanism. As a result, our mechanism is considered that there is no influence on the live migration time.

Toshihiro Uchibayashi, Yuichi Hashi, Seira Hidano, Shinsaku Kiyomoto, Takuo Suganuma, Masahiro Hiji

Evaluation and Improvement of Farmers Market Information System to Connect with Some Social Stakeholders

Large part of Tanzania population are rural smallholder farmers. Due to lack of market information, farmers sell their crops to middlemen at lower prices and hence don’t get enough profits. Previously we developed WEB and SMS (Short Message Service) based Farmers Market Information System using Waterfall model which replies farmers’ requests for market prices of crops through SMS. We then improved the system to enable farmers to access crop buyers’ details through SMS and crop buyers to access farmers’ details through SMS or WEB. In this paper we evaluate effectiveness of the system after implementing it in Tanzania in SWAHILI language. We also improve the system to enable farmers and crop buyers to access crop demand report before selling or buying crops. Findings show that the system helped farmers to increase incomes and access market information in shorter time. The system was also easy to learn and use.

Isakwisa Gaddy Tende, Shin-Ichiro Kubota, Kentaro Aburada, Naonobu Okazaki

Performance Evaluation of a Learning Logger System for Active Learning Using Smartphone

In our previous work, we presented an interactive learning process, which use the students’ study records in order to improve the students’ learning motivation and the self-learning time. To improve the progress speed of a lecture and the efficiency of the Self-learning, we proposed an Active Learning System (ALS) using smartphone. In addition, we suggested the group discussion system of ALS. However, the previous interfaces for interactive learning had limited adequacy in maintaining participants’ concentration when their skill levels vary. To solve this problem, we proposed the interface of smartphone on our ALS to improve the learning concentration. In this paper, we show the performance evaluation of ALS that use improved human interface on the mobile devices. The evaluation results show that the interactive lecture using ALS increases the students’ concentration.

Noriyasu Yamamoto, Noriki Uchida

Validation of 3D Convolutional Neural Networks for Customer Satisfaction Estimation Using Videos

Companies and public entities administer customer satisfaction surveys to identify business problems. However, devising and analyzing questionnaires is burdensome for investigators, and answering questionnaires imposes a burden on customers. In addition, the response rate is frequently low. Here, to address these problems, we attempt to estimate customer satisfaction using sensing technology. We hypothesize that satisfaction can be discerned through facial expressions and body movements. To validate this hypothesis, we applied three-dimensional convolution neural networks.

Tomofumi Nakano, Shohei Kato

Hybrid Learning Using Profit Sharing and Genetic Algorithm for Partially Observable Markov Decision Processes

Reinforcement learning is generally performed in the Markov decision processes (MDPs). However, the agent might not be able to correctly observe the environment because of the perception ability of the sensor. This is called the partially observable Markov decision process (POMDP). In a POMDP environment, an agent may observe the same information at more than one state. HQ-learning and episode-based profit sharing (EPS) are well-known methods for solving this problem. HQ-learning divides a POMDP environment into subtasks. EPS distributes the same reward to state-action pairs in the episode when an agent achieves a goal. However, these methods have disadvantages related to the learning efficiency and localized solutions. In this paper, we propose a hybrid learning method that combines profit sharing and genetic algorithm. We also report the effectiveness of our method by using some experiments with partially observable mazes.

Kohei Suzuki, Shohei Kato

Resource Propagation Algorithm to Reinforce Knowledge Base in Linked Data

Linked Data are data of directed graph with labels to describe based on Resource Description Framework (RDF), and can create a knowledge base by linking each resource on the Web. However, a large amount of Linked Data does not have enough links since resources defined at Internationalized Resource Identifier (IRI) data type are scanty. Therefore, this paper presents that Resource Propagation Algorithm predicts links between resources in Linked Data based on semantic distance, and reinforces the knowledge base. The algorithm was confirmed that it was able to generate semantic links between the resources considering predicate dictionary.

Toshitaka Maki, Kazuki Takahashi, Toshihiko Wakahara, Akihisa Kodate, Noboru Sonehara

Metadata Complement Method by Linked Open Data for Literature Search

In the current papers of the academic society, there are often cases where the literature metadata such as keywords or abstracts are insufficient. In this paper, we propose a new literature retrieval support system that complements the data using the open data and facilitates the search when the relational literature metadata are missing or insufficient using Linked Open Data (LOD). The missing keywords are estimated from the existing titles and abstracts of the literature by extracting the semantic information of the papers. We constructed a prototype of new literature search support system using IEICE Knowledge Discovery System (I-Scover) and confirmed that as a result of experiments using this support system, search accuracy and search time were also improved.

Toshihiko Wakahara, Toshitaka Maki, Kazuki Takahashi

Neuro-Evolutionary Approach to Multi-objective Optimization in One-Player Mahjong

In Mahjong, there are several objectives at play to win the game: to (1) win early, (2) gain a large number of points, (3) avoid losing points, and (4) prevent other players from winning. These objectives often conflict with each other, thereby creating tradeoffs. In this research, we make a evaluating function of Mahjong as a multiobjective optimization. Further, Mahjong requires multimodal behavior, particularly because the first-place player must win early and avoid losing points by the last-place player gaining a large number of points in the final hand. In this paper, we propose an evaluation function for Mahjong in the form of a multi-objective optimization problem. Modular multi-objective neuro-evolution of augmenting topologies (MM-NEAT) is a framework for evolving modular neural networks in which each module defines a separate policy. Evolution optimize these policies and when to use them. Given the above, we focus on two objectives in one-player Mahjong: to (1) win early and (2) gain a large number of points. We also verify the effectiveness of MM-NEAT for Mahjong.

Koya Ihara, Shohei Kato

Tor Fingerprinting: Tor Browser Can Mitigate Browser Fingerprinting?

The onion router (Tor) is currently the most powerful and prominent tool to achieve online privacy on the Internet. As a browser, Tor can protect web users by not revealing the source or destination IP address, and it also prevents web tracking with HTTP cookies. Tor browser has been updated continuously to resist de-anonymizing attacks by restricting the browser’s functions, e.g., excluding all plugins such as Flash player. On March 2016, Jose Norte posted the article as “Advanced Tor Browser Fingerprinting” in his blog [37]. It suggested that browser fingerprinting can track Tor browser. In this paper, we examined how secure Tor browser version 5.5 is against browser fingerprinting. Our study concludes that Tor user accesses can be distinguished: 14.28% of Tor browser version 5.5 can be identified within two weeks at our experimental sites, although 70.0% of the older versions can. In this paper, we analyze the current features of Tor browser against browser fingerprinting and also show capabilities to track Tor browser accesses.

Takamichi Saito, Kazushi Takahashi, Koki Yasuda, Kazuhisa Tanabe, Masayuki Taneoka, Ryohei Hosoya

Study on Persuasion Effect of Computer Virus Measures Based on Collective Protection Motivation Theory

Virus infections remain a problem for the PC owner. Despite receiving instructions on how to fix the virus and warnings about the dangers of not doing so, there are many cases where owners are still not taking the required recovery action. Research on individual behavior and decision-making in a virus-infection situation is important for developing protection systems for information security. This paper describes a threat appeals model for information security based on collective protection motivation theory. The analytical results obtained using this model are also discussed. Our results show that the response efficacy for the Japanese Students is effective in persuading a person to initiate protection measures. And the results also indicate that a trustworthy source of media for providing the security information is necessary to realize a protection measure for Australia students.

Noriaki Yoshikai, Kana Shimbo, John Stavrakakis, Toshio Takahashi

Empirical Evaluation of Rhythm-Based Authentication Method for Mobile Devices

Mobile devices require a screen lock method for authentication. Although conventional screen locks are typically based on pattern, PIN code or password authentication, they are vulnerable to shoulder-surfing attacks and video recording attacks. To avoid such vulnerability, a rhythm-based authentication (RA) method that leverages the timing of screen taps has been proposed as an authentication factor. This method uses features, such as tap pressure, distance between taps, and tap timing, for authentication. However, this method requires a server for a user to be authenticated. In this paper, we propose an improved RA method that can be applied in a mobile device by using a Random Forest classifier. We conducted a series of experiments to clarify (i) importance of the features (ii) classification accuracy, and (iii) required number of taps. The proposed RA method was tested by 24 participants. After carefully choosing features, we show that when the number of taps is five, the accuracy is 94.16%, which is an improvement of 1.79%.

Takahiro Hori, Yoshihiro Kita, Kentaroh Toyoda, Naonobu Okazaki, Mirang Park

Slyware Prevention: Threat of Websites Inducing Accidental Taps and Countermeasures

Malicious software is defined as malware but in recent years, the amount of software that behaves maliciously while still acting legally has been increasing. We propose that this type of software should be referred to as “slyware.” Typical examples of slyware are implemented as smartphone websites with hyperlinks (links) that are designed to induce the visitor to make accidental taps, which we call “mistap-slyware.” Mistap-slyware can initiate the performance of illegal or dishonest acts, although mistap-slyware is not actually illegal. Thus, we propose a cancelable transition method as a countermeasure. In the proposed method, a link will start blinking when it is tapped. If the user taps the link again, then moving to the page is canceled; otherwise, moving to the page occurs after a few seconds. We evaluated the proposed method and an existing method in terms of their usability and safety.

Kohei Mukaiyama, Masahiro Fujita, Takeharu Shirai, Shinya Kobayashi, Masakatsu Nishigaki

An Efficient Privacy-Preserving Comparison Protocol

We address an efficient privacy-preserving comparison protocol using somewhat homomorphic encryption based on ring learning with errors (ring-LWE) problem in the semi-honest model. Here we take two l-bit integers a and b as input and produce the output indicating $$a<b$$a<b or $$a\ge b$$a≥b. To accomplish this task, Damgård, Geisler, and Krøigård (DGK) [Int. J. of Appl. Cryptol., 1(1), 2008] proposed an efficient protocol using an additively homomorphic encryption scheme in the semi-honest model. Thereafter many attempts were made to improve the performance for the privacy-preserving integer comparison but the improvement is not remarkable. Until now, the DGK protocol is believed to be one of the efficient comparison protocols using homomorphic encryption. The DGK protocol executes an integer comparison within 969 ms (resp., 1977 ms) for 16-bit (resp., 32-bit) integers under the 112-bit security level (by using the 2048-bit RSA). In this paper, we propose a more efficient comparison protocol than the DGK protocol. For the efficiency, we propose two new packing methods to make the comparison computation faster for some packed ciphertexts. The first packing method helps the multiple Hamming distance computation and the second packing method helps to compute the bit differences of two l-bit integers. Finally, our experiments at the 140-bit security level show that our method is about 147 times faster for 16-bit integers comparison and 146 times faster for 32-bit integers comparison than that of the DGK protocol.

Tushar Kanti Saha, Takeshi Koshiba

A k-nearest Neighbour Query Processing Strategy Using the mqr-tree

This paper presents a k-nearest neighbour query processing strategy that utilizes a recently proposed spatial access method, the mqr-tree, to narrow down the search for candidate nearest neighbours. It requires the traversal of only one path of the tree, and in the majority of cases, does not require backtracking all the way to the root. The mqr-tree-based k-nearest neighbour strategy is evaluated both individually and compared against the brute-force method for running time. It is shown that the proposed approach performs better in many cases. In addition, the running time is not affected by the number of points being indexed or the number of nearest neighbour being sought.

Wendy Osborn

Dynamic Resource Adaptation Method by Cooperative User Devices in Wireless Network

In recent years, network traffic has been increasing and when large events or natural disasters occur more network resources are requested at end points of network. Also, with the spread of smart devices can communicate with high-speed such as LTE, anyone are becoming to be able to communicate with high-speed. In order to efficiently handle traffic that locally and temporarily increases, it is effective to utilize smart devices owned by users. However, because there is a limit to the amount of the traffic that a smart device can handle, it is necessary to cooperate smart devices, nevertheless a system that cooperates smart devices and aggregates netwerk resources has not been established. In this paper, we proposed a dynamic resource adaptation method that aggregates the network resources of smart devices and increases the available bandwidth. In evaluation experiments, a relationship between the amount of smart devices and network throughput was evaluated.

Kazuaki Togawa, Koji Hashimoto

A Method for Improving Cache Hit Ratio by Virtual Capacity Multiplication

Recently, ICN (Information Centric Networking) attracts many number of network researchers as the key technology for supporting future networking. The future network needs to deliver the multimedia contents consist of large bits size over the network in the request from a bunch of consumer. As the solution for such contents delivery, ICN propose to implement in-network cache for reducing amount of traffic and response time induced by contents request and contents delivery. However, due to the capacity of contents router’s limitation, cache hit ratio of the ICN degrades when the number of requests from users is increased. Hence, in this paper, we propose a method to increase cache hit ratio on ICN against increasing contents requests. Our method increases cache hit ratio by virtually increasing capacity of contents routers by cooperation among the routers.

Miho Aoki, Tetsuya Shigeyasu

LEAS: A Load-Aware Energy-Efficient Adaptive Scheduling for Heterogeneous Wireless Sensor Networks

The growing interest in applications that demand certain end-to-end performance guarantees and the introduction of imaging and video sensors have posed additional challenges. Transmission of data in such cases requires both energy and QoS aware network management in order to ensure efficient usage of the sensor resources and effective access to the gathered measurements. In this paper we present LEAS, a Lightweight Energy-efficient Scheduling Scheme, a novel power management and routing scheme for heterogeneous wireless sensor networks.LEAS is a network adaptive, lightweight, distributed, randomized algorithm where nodes make local decisions on whether to sleep, or to be active. Each node randomly chooses its active schedules. Thus, while reducing energy wasted due to idle listening, LEAS keeps latency low and balances the energy consumption among the sensors according to their residual energy levels. We present analysis and experiments to study energy savings, latency and load balancing with LEAS.

Vamsi Paruchuri, Arjan Durresi

GD-CAR: A Genetic Algorithm Based Dynamic Context Aware Routing Protocol for Opportunistic Networks

Opportunistic Networks (OppNets) are an extension of Mobile Ad Hoc Networks (MANETs) in which high mobility of nodes, unawareness of network topology, and unstable node to node connections are very common. These factors inhibit the implementation of traditional routing protocols in OppNets. Hence, an efficient routing technique for OppNets is required to make communication faster, efficient and reliable. In this paper, an advanced context based routing protocol named as GD-CAR is proposed. The GD-CAR protocol uses the genetic search algorithm to predict the path for a message by dynamically updating the context information. This information is stored by each node regarding the environment in which it is operating. A fitness criterion is used to parameterise the predicted path which is finally used to evaluate the efficiency of neighbouring nodes. Simulation results show that GD-CAR protocol outperforms Prophet and GAER protocols in terms of messages delivered and average buffer time while the results for overhead ratio are comparable.

Deepak Kumar Sharma, Sanjay Kumar Dhurandher, Isaac Woungang, Aman Bansal, Apoorv Gupta

The 12 International Workshop on Network-based Virtual Reality and Tele-existence (INVITE-2017)


Implementation of a Community-Based Disaster Prevention Information System

In this research, we implemented a Community-Based Disaster Prevention Information System. The Community-Based Disaster Prevention Information System consists of the disaster information input system, the disaster information output system, and the disaster information notification system. The disaster information input system realizes registration processing of damage information, evacuation information and the like. The disaster information output system realizes sharing processing of disaster information registered in the disaster information input system. In addition, the disaster information notification system transmits disaster information registered in the disaster information input system to the residents. In this research, we conducted a questionnaire survey on 11 municipalities to evaluate the effectiveness of each system. As a result, we received a high evaluation results on the effectiveness of sharing the disaster information input system among multiple municipalities and the effectiveness of the disaster information output system at the disaster headquarters decision-making.

Tomoyuki Ishida, Yusuke Hirohara, Noriki Uchida, Yoshitaka Shibata

An Automatic Image Registration Method Using Downhill Simplex Method and Its Applications

In this paper, we proposed an effective method for time series CT image registration using Mutual Information (MI) and downhill simplex method. By using this method it was possible to obtain correct results in a shorter time. When we include all range of histogram in MI evaluation, the value of MI becomes worse. In order to prevent this problem, we find a suitable range of image histogram in MI calculation by using discriminant analysis. Moreover, in order to speed up the convergence, we propose an effective initial position specification and geometry based finish condition (vector terminate). In the experiment, 3D rigid body alignment is performed successfully by six variables of movement and rotation.

Akio Doi, Tomohiro Chiba

Multilingual Information Service Based on Combination of Smartphone and Digital Signage

Recently, a lot of people often visit foreign countries due to the progress of globalization in the world, and Japan also aims to become a tourism oriented nation. However, various languages are used in the world, and it has become a bottleneck for the people to visit other countries. In this research, by combining the smartphone and the digital signage based on iBeacon technology, multilingual information service system was developed. This system was implemented into the information service in Shirakawa-go that is one of the UNESCO world heritage site, and the evaluation experiment was conducted. In the experiment, several foreign tourists were asked to use the multilingual information service system and the effectiveness of this system was evaluated.

Tetsuro Ogi, Kenichiro Ito, Seiichiro Ukegawa

Ultra Definition Display Environment for Disaster Management GIS

This paper introduces a new design of disaster state presentation system using large size and ultra high definition displaying system to satisfy requirement of quick and wide collecting and sharing disaster state information from disaster areas to make decision by the officers as decision makers who work in the countermeasure disaster headquarters. The proposed presentation system, we call LIVEWall, displays both GIS based location information and multimedia information in parallel on the same display to realize quick and correct understanding the disaster state in wide area. The collected disaster state information are processed as workspace and interactively controlled using workspace controller to display on the Tiled Display Wall (TDW). We designed and implemented our system using current available technology as a prototype.

Akira Sakuraba, Tomoyuki Ishida, Koji Hashimoto, Yoshitaka Shibata

A Study on the Operation of Infrastructure Management System with Citizens’ Participation Using the ICT Technology

In Japan, the aging process of infrastructure has developed very rapidly. The risk of serious accidents and fatal damage are increasing. As one of infrastructure aging measures, a system is required to solve infrastructure problems by cooperation between citizens and municipalities. This system gathers infrastructure information from citizens, and the information is shared with citizens and infrastructure management departments. In this research, we constructed a web application system for gathering infrastructure aging information using smartphones. We conducted social experiments using this system for citizens and infrastructure management departments in two municipalities. The result is that we verified the effectiveness of the system, and clarified operational issues to spread the system through social experiments.

Miki Kuroki, Michitoshi Niibori, Tomoyuki Ishida, Tatsuhiro Yonekura

Development and Evaluation of Operation Interface for Lesson Using Large-Scale Screen in Elementary and Secondary Education

In the elementary and secondary education, teachers are inclined to pay much attention to operate in the lesson with audiovisual teaching material on large-scale screen such as projector and wide-sized display in classroom, and affect the progress of the lesson. Therefore, teachers have difficulty to perceive the state of the students and the understanding level of the lesson. To solve these problems, we have developed the prototype of operation interface for large-scale screen to conduct the lesson smoothy sing large-scale screen in elementary and secondary education. The interface is wearable, lightweight, compact and enables to walk freely around the classroom. In this paper, we have evaluated on the operability and the usability by using the operation interface in a large-scale screen environment.

Yasuo Ebara, Hiroshi Hazama

Implementation of Multimedia Contents for Supporting Different Types of Self-learning

In recent years, The Information Technology (IT) has been introduced to various educational fields. Using IT, a student can study to play multimedia contents anywhere and anytime. However, in general students spend short time on self-learning. Considering this fact, we propose a multimedia switching system to improve their learning time and understanding. In the proposed system, multimedia contents are provided to reflect both knowledge and skills for keeping the self-learning time, motivation and understanding. In this paper, we present the implementation of the multimedia contents for supporting different types of self-learning.

Takuya Inumaru, Kaoru Sugita

Development of Integrated Visual Analytic Tool with 3D Visualization

This is an interim report of a project to develop a new type of visualization system which integrates the conventional 3D visualization with data analysis tools such as parallel coordinates plot, correlation diagram and correlation matrix map. In this paper, we introduce the key functions and the usage. Through the interview to the potential customers, we learned that the collaboration of visualization and data analysis bring us a new data extraction ways but the design is suitable for observation based studies but not to some simulation studies.

Hideo Miyachi, Isamu Kuroki, Daisuke Matsuoka, Koji Koyamada

The 11 International Workshop on Advanced Distributed and Parallel Network Applications (ADPNA-2017)


Hybrid Replication Schemes of Processes in Energy-Efficient Server Clusters

In order to fault-tolerantly perform an application process in a server cluster, the process is replicated on multiple servers. Even if some replicas of the process is faulty, e.g. due to stop-fault of the host server, the process can be successfully performed as long as some number of replicas are operational. The more number of replicas of a process are performed, the more reliably and availably the process can be performed but the more electric energy is consumed. In this paper, we make clear what software components each replica of a process includes. We newly propose new replication schemes which are composed of a primary replica and more types of secondary replicas so that the total electric energy consumption can be reduced while the reliability and availability of each process can be increased. In the evaluation, we show the electric energy consumption of servers can be reduced in the replication schemes compared with the traditional active and passive replication schemes.

Ryuji Oma, Shigenari Nakamura, Tomoya Enokido, Makoto Takizawa

Gossip-Style Message Dissemination Based on Biconnected Components

In peer-to-peer networks, each node directly connects to other nodes without access points. This type of network system is useful for information sharing by using mobile devices (e.g., smartphones). Although it is easy to construct an ad-hoc network, there are several problems, for instance, the management of the network, message delivery and so on. On message delivery over the network, it is very difficult to assume the static routing if the structure of the network can be changed frequently by node churn. In this paper, we propose a gossip-style message dissemination protocol based on biconnected components with churn-prone nodes and show the performance evaluation of other gossip protocols. Specifically, we focus on the churn rate and the distribution of links on the network in the evaluation.

Takumu Hirooka, Daisuke Yamamasu, Naohiro Hayashibara

Energy Efficient Raft Consensus Algorithm

Protocols which solve agreement problems are essential building blocks for fault-tolerant distributed applications. Raft consensus protocol proposed by Ongaro and Ousterhout is a simple consensus protocol. It basically consumes every resource in the system for achieving an agreement. Thus, there is a problem on resource and energy consumption. This paper proposes an energy-efficient Raft protocol with the resource management mechanism. Then, we show the performance evaluation of the proposed protocol regarding messages sent by nodes.

Takuro Nakagawa, Naohiro Hayashibara

Scalable Distributed Data Analysis on Structured P2P Network

In recent years, a lot of Internet of Things (IoT) devices have been developed, so we can obtain a huge amount of data (big data) from the IoT devices. In order to utilize the big data, a scalable data analysis system is required. Therefore, in this paper, I propose a scalable distributed data analysis system on a structured P2P network. In the proposed system, the IoT devices communicate with each other as nodes of a ring-type structured P2P network such as Chord. When a node requests a data analysis process, each node performs a part of the data analysis process, and the request node aggregates the partial analysis results. In my previous study, I made a scalable distributed aggregation system which calculates summations or averages of values obtained by each node. The proposed system is an extended system of the previous study, but the proposed system supports not only simple data aggregation but also data analysis such as Principal Component Analysis. In this paper, I explain how to analyze big data on a structured P2P network. In addition, I also present some simulation results, and I show that the amount of communication data required for each node is $$O(\log N)$$O(logN), where N is the number of nodes.

Atsushi Takeda

Risk Assessment for Privacy Protection of Information Literacy Beginners in Big Data Era

The utilization of big data by companies such as Facebook and Google is increasing, and the possibility of producing an unprecedented new service and system using such data is expected. However, the issue of privacy protection is a concern in the utilization of big data. Consequently, risk assessment in connection with the privacy protection is an important issue, especially the privacy of information literacy beginners (people less familiar with data security). This paper explores the issue of privacy protection of information literacy beginners in big data utilization. We first conducted a risk assessment in a qualitative analysis of privacy protection from a comprehensive viewpoint. As a result, 29 risk factors were extracted, and countermeasures were proposed. The important elements of the proposed measures were determined to be strengthening the security of terminals and thoroughly defining terminal use rules. Next, we described a quantitative evaluation of these risk factors obtained as a result of the qualitative analysis. Specifically, a risk value based on a formula was calculated for each risk factor. On the basis of the risk value, the effect of the countermeasures on the risks was then quantitatively evaluated. It was shown that the countermeasures can reduce their corresponding risk factors by about 49%. The results of this study are expected to contribute to the safe and secure use of big data.

Shigeaki Tanimoto, Shun Totsuka, Motoi Iwashita, Yoshiaki Seki, Hiroyuki Sato, Atsushi Kanai

Performance Evaluation of Peer–to–Peer Network Applications on Multiple Overlay Networks

A peer–to–peer (P2P) network applications support peers or contents search based on overlay networks constructed by considering several criteria. Since overlay networks are constructed based on profiles of peers, overlay networks enable to search contents by each peer effectively. In case of overlay network based on trend of contents peers have, each peer does not always select a peer that is the closest to the searching peer. On the other hand, in case of overlay network based on network distance between peers, it takes a long time to search rare contents or a lot of search packets are transmitted. In this paper, we reported experimental results by contents distribution system implemented on the agent platform PIAX in order to verify effectiveness of system that switches overlay networks.

Kazunori Ueda

The 8 International Workshop on Heterogeneous Networking Environments and Technologies (HETNET-2017)


Residential Area Power Management Using Genetic Algorithm and Biogeography Based Optimization in Smart Grid

For residential consumers demand of energy is a main issue. To resolve this issue different techniques are being proposed. In this paper, our focus is on shifting the load from on-peak hours to off-peak hours to minimize peak to average ratio (PAR) and electricity cost. To fulfill these requirements, we adapt two heuristic algorithms, genetic algorithm (GA) and biogeography based optimization (BBO) algorithm. For energy pricing, we use real time pricing (RTP) scheme. Results demonstrate that the proposed algorithm minimize the PAR and electricity bill.

Rubab Maroof, Hasan Nasir Khan, Khadija Ambreen, Hina Iftikhar, Salma Asif, Nadeem Javaid

A Social Spider Optimization Based Home Energy Management System

Home energy management within the traditional grid is difficult, so Smart Grid (SG) is introduced by upgrading the traditional grid, i.e., adding the Information Technology (IT) and Sensors Network (SN) to traditional grids. SG manages the Demand of electricity and help in solving the electricity load management problem. Demand Side response has two parts monitoring the electricity and notify consumers about its pricing scheme and bill, this can be done using smart meters. In smart metering system homes are integrated with Energy Management Controller (EMC) which uses Demand Side Management (DSM) systems based on a optimization technique. In this paper a system is proposed which manages the load by shifting from peak hours to off peak hours, reduce electricity bill, reduce waiting time and reduce Peak to Average Ratio (PAR). For simulations we use classification consist of 3 classes of appliances, Time of Use (ToU) as our pricing signal and Social Spider Optimization (SSO) our technique. The simulations results show the achievements of the system.

Mujeeb Ur Rehman, Tamour Bilal, Muhammad Awais, Muhammad Junaid, Asma Zahra, Nadeem Javaid

Collecting Data in Sensor Networks Using Homesick Lévy Walk

Random walks play an important role in computer science, spreading a wide range of topics in theory and practice, including networking, distributed systems, and optimization. Homesick Lévy walk is a family of random walks whose the distance of a walk is chosen from the power law distribution. It also comes back to a starting point in a certain probability. Thus, it is attractive for collecting data in large-scale sensor networks. In this paper, we propose an algorithm for Homesick Lévy walk and analyze the behavior of the algorithm on grid graphs.

Kouichirou Sugihara, Naohiro Hayashibara

Privacy Preservation for Trajectory Data Publishing and Heuristic Approach

With the increasing of location-aware devices, it is easy to collect the trajectory of a person which can be represented as a sequence of visited locations with regard to timestamps. The trajectory data publishing can be useful in real-life applications, such as location-based advertising, traffic management, and geo-marketing. However, the trajectory data publishing also poses privacy threats especially when an adversary has the target user’s background knowledge, i.e. partial trajectory information. In general, data transformation is needed to ensure privacy preservation before data releases. Not only the privacy has to be preserved, but also the data quality issue must be addressed, i.e. the impact on data quality after the transformation should be minimized. In this paper, we focus on maintaining the data quality in the scenarios which the generalization technique is applied to transform the trajectory data. We propose a heuristic approach to preserve the privacy based on the LKC-privacy model. Subsequently, our proposed algorithm is validated with thorough experiments. From the results, the proposed algorithm is highly efficient, and the effectiveness of the proposed work can be achieved particularly when the value of K is high and the value of C and L are low.

Nattapon Harnsamut, Juggapong Natwichai

The 8 International Workshop on Intelligent Sensors and Smart Environments (ISSE-2017)


A Transmission Method to Guarantee QoS Parameters in Wireless Sensor Network

Due to the energy constraint and high packet loss rate, energy-efficient and reliable data transmission are crucial issues in WSNs. In order to increase the network reliability and throughput, multipath forwarding is used in many applications. However because of using multiple paths between source and destination, the multipath forwarding mechanism increases the network overhead. By splitting the original messages and forwarding each sub-packet through multipath routing protocols energy consumption and network overhead can be reduced. This paper proposed a flexible recovery mechanism which increase reliability and minimize both energy consumption and delay. The proposed scheme caches sub-packets at some special intermediate nodes and retransmits from these nodes instead of source node whenever it is necessary. Performance evaluations of sub-packet caching (SPC) demonstrate that using multipath forwarding with caching data can effectively increase the reliability and reduce the energy consumption and latency.

M. Kordlar, G. Ekbatanifard, A. Jahangiry, R. Ahmadi

3D Model Generation of Black Cattle Using Multiple RGB Cameras for Their BCS

This paper presents 3D model generation of black cattle using multiple RGB cameras for their BCS. The use of advanced ICT has a certain possibility to improve various agricultural activities. The authors have such a project whose targets are beef cattle. The goal of the project is to capture 3D shape information of black cattle for the estimation of their body condition scores (BCS). Cattle are always moving because they are animals. Therefore, it is very difficult to capture their body shape information even using a commercial 3D scanner. Another reason is that the color of beef cattle is almost black and then a commercial 3D scanner like a laser range finder cannot be used. So, as the first trial, the authors used multiple RGB cameras to capture RGB images of a cow, generated manually its silhouette images, and employed Shape-from-Silhouette(SfS) method to generate its 3D model. The authors took multiple RGB camera images of cows in a natural environment and generated their 3D models. From the generated 3D models of cows, it can be found that it is possible to estimate the weight of each cow correctly if its accurate silhouette images are generated manually. Here, the problem is how the accurate silhouette images can be obtained automatically in a natural environment. From several experiments, the authors conclude it is impossible. Therefore, the authors propose the use of new method based on multicolor attributed voxels instead of SfS method. This paper clarifies the availability of the new method by showing several experimental results.

Hiroki Tamari, Shohei Nakamura, Shigeru Takano, Yoshihiro Okada

Load Scheduling Optimization Using Heuristic Techniques and Combined Price Signal

In this paper, a comparative analysis of two heuristic algorithms, i.e., enhanced differential evolution (EDE) and tabu search (TS) with unschedule load approach for its optimality is proposed. This paper aims to achieve minimum electricity bill and maximum peak to average ratio (PAR) reduction while considering the factor of user satisfaction. In order to achieve our aim, an objective function of electricity cost reduction is made based upon the scheduling strategies. A combined model of pricing schemes, i.e., time of use (ToU) and critical peak pricing (CPP) is used to calculate electricity bill and to tackle the instability. We implemented a state of art user-defined taxonomy of appliances in our paper to deal with the user comfort appropriately in a residential area. Simulation results shows that our proposed strategy works better to encourage the users for intelligent power consumption.

Iqra Fatima, Sikandar Asif, Sundas Shafiq, Ch Anwar ul Hassan, Sajeeha Ansar, Nadeem Javaid

Home Energy Managment System Using Meta-heuristic Techniques

In this paper, we have evaluated the performance of Home Energy Management (HEM) using two meta-heuristic techniques: Chicken Swarm Optimization (CSO) and Bacterial Foraging Algorithm (BFA). We have classified the appliances in two catagories: fixed and shiftable/elastic appliances. Time of Use (ToU) pricing scheme is used for the calculation of electricity bill. The main objective of this paper is the minimization of electricity cost, reduction of Peak to Average (PAR) and balancing of load between peak and off peak hours while taking User Comfort (UC) under consideration. These algrithms performs efficiently in achieving multiple objectives. However results and simulations shows that CSO performs better than BFA in terms of PAR reduction, while BFA performs better in reducing electrcity cost.

Tamour Bilal, Muhammad Awais, Muhammad Junaid, Zafar Faiz, Mujeeb Ur Rehman, Nadeem Javaid

Improvement of Indoor Position Estimation of Open-Campus Event System Using BLE Beacon

At the Nagoya Institute of Technology, the “MMDAgent” voice interaction toolkit has been developed for voice-based interactive communication between a system and user. Moreover, based on this spoken dialogue method, an interactive open-campus event system has been developed. This system supports campus visits using MMDAgent, which runs on a smartphone. Existing systems entail some problems related to the accuracy of indoor position estimation. As described herein, we propose an advanced system to improve indoor position estimation using a Bluetooth Low Energy (BLE) beacon. Moreover, we show the effectiveness of proposed system thorough experiment.

Takahiro Uchiya, Kiyotaka Sato, Shinsuke Kajioka, Daisuke Yamamoto, Ichi Takumi

Development of Review Selection System Reflecting User Preference Using SVM

In recent years, along with the spread of e-commerce sites, reviews of goods and services are often posted on the web. In a “review”, a user comments and evaluates a specific product or service. Examples of e-commerce sites are Amazon( and Netflix( Users make selections based on the performance and review of goods and services. Especially in the case of items which cannot be compared by performance, selection is difficult. Therefore, the review is an important selection factor of the item for a user. However, the perspectives of reviews vary depending on the different preferences of people. For that reason, a review that refers to the content a user wants to know is difficult to find quickly. For this study, we developed a system that distinguishes review sentences based on a user preference using machine learning. Then the system presents them to the user. This information will support decision making by users of e-commerce sites and will contribute to the improvement of information collection efficiency.

Yuto Ishida, Takahiro Uchiya, Ichi Takumi

The 8 International Workshop on Trustworthy Computing and Security (TwCSec-2017)


Function Secret Sharing Using Fourier Basis

Function secret sharing (FSS) scheme, formally introduced by Boyle et al. at EUROCRYPT 2015, is a mechanism that calculates a function f(x) for $$x\in \{0,1\}^n$$x∈{0,1}n which is shared among p parties, by using distributed functions $$f_{i}:\{0,1\}^n \rightarrow \mathbb {G}$$fi:{0,1}n→G$$(1\le i\le p)$$(1≤i≤p), where $$\mathbb {G}$$G is an Abelian group, while the function $$f:\{0,1\}^n \rightarrow \mathbb {G}$$f:{0,1}n→G is kept secret to the parties. We observe that any function f can be described as a linear combination of the basis functions by regarding the function space as a vector space of dimension $$2^n$$2n and give a new framework for FSS schemes based on this observation. Based on the new framework, we introduce a new FSS scheme using the Fourier basis. This method provides efficient computation for a different class of functions (e.g., hard-core predicates of one-way functions), which may be inefficient to compute if we use the standard basis such as point functions. Our FSS scheme based on the Fourier basis is quite simple due to the fact that the Fourier basis is closed under the multiplication, while the previous constructions have to incorporate some complex mechanisms to overcome the difficulty.

Takuya Ohsawa, Naruhiro Kurokawa, Takeshi Koshiba

Secure Non-transferable Proxy Re-encryption for Group Membership and Non-membership

In proxy re-encrytpion (PRE) scheme, the message is sent by a delegator to a delegatee with a help of the trusted third party proxy without knowing the existing plaintext. PRE schemes are widely used in various applications. However, the standard PRE scheme has some proxy problems called private key generator (PKG) despotism problem. This means that PKG can make re-encryption key without permission from delegator. And also, if someone can attack PKG in a PRE scheme, they can decrypt both the original ciphertext and the re-encrypted ciphertext which means the key-escrow problem. A solution for these two problems is to use non-transferable PRE scheme. Non-transferable PRE scheme solved the above PKG despotism problem and key-escrow problem. We would like to introduce our PRE scheme with a new approach. In our scheme, there are three sub-processes, which are based on a non-transferable PRE scheme and group signature. Our scheme will provide the security for delegator i, delegatee j (who is in the same group with delegator i), and delegatee k (who is in a different group with delegator i).

Ei Mon Cho, Lwin San, Takeshi Koshiba

A Performance Evaluation of Data Storage Approach for High Availability and Confidentiality on Multi-cloud

Recently, various public cloud services have been popular, and we can use these services at low cost. However, public cloud services have some security issues, for example, an end user can store a file on public cloud services managed by an uncontrollable administrator. Therefore, we propose an approach to solve this security issue for a storage service from the viewpoints of confidentiality and availability by using multiple public services simultaneously. In this paper, we describe how we developed our prototype for multiple actual public service usage and evaluated the performance of our approach. The practicality of our approach is shown.

Yamato Miura, Naoki Wakabayashi, Shohei Ueno, Atsushi Kanai, Shigeaki Tanimoto, Hiroyuki Sato

Risk of Re-Identification Based on Euclidean Distance in Anonymized Data PWSCUP2015

We propose a new method to re-identify anonymized data by using Euclidean distance between the original record and the anonymized record and evaluate the accuracy of the proposed method. In order to clarify performance of several anonymization methods used in the competition of the PWSCUP2015, we examine each of single methods and attempt to estimate the accuracy of the combination of some methods.

Satoshi Ito, Hiroaki Kikuchi

Highly Responsive Distributed Denial-of-Service Attacks Detection by Using Real-Time Burst Detection Method

The accuracy of statistical methods for detecting a distributed denial-of-service (DDoS) attack improves with increasing packet sequence number (window size). However, such methods tend to suffer from low responsiveness. An alternative approach, real-time burst detection, offers two advantages over traditional statistical methods. First, it can be used for real-time detection when a DDoS event is occurring, and second, it can be judged with less processing as information about events can be compressed, even if a large number of events occur. Here, we propose a highly response burst detection method for DDoS attacks, perform experiments to evaluate its effectiveness, and discuss its detection accuracy and processing performance.

Shotaro Usuzaki, Yuki Arikawa, Hisaaki Yamaba, Kentaro Aburada, Shin-Ichiro Kubota, Mirang Park, Naonobu Okazaki

Efficient Secure Arithmetic on Floating Point Numbers

Technology called cloud computing entrusts a huge amount of information processing that can not be done sufficiently with only its own computing resources by connecting internal and external computing resources. By using a method called secure computation, it is also possible to perform calculation processing while keeping the data concealed. In order to practically use secure computation, it is desirable that there is no load equal to or greater than the usual calculation processing time, independent of the data type to be handled. The data types dealt with in the existing secure computation studies are mainly integers, especially arithmetics on finite fields. But when using actual data such as statistics and geographic information, it is difficult to calculate them with integer arithmetic. Recently secure computation studies dealing with real numbers has increased. In this paper, based on Aliasgari’s method that achieve secure computation on floating point which can obtain sufficient precision, performance improvement of the methods is proposed and evaluated. As a result, improvement of performance is shown.

Wakana Omori, Akira Kanaoka

An Extension of -Threshold Secret Sharing Schemes

Fast (k, n)-threshold secret sharing schemes with XOR operations have proposed by Kurihara et al. and Fujii et al. independently. Their method are ideal that share size is equal to the size of the data to be distributed with the benefits that can be handled very fast for using the only XOR operations at distribution and reconstruction processes. In these cases for the number of shares n, target data must be equally divided into individual $$n_p-1$$np-1 pieces where $$n_p$$np is a prime more than n. The existing methods described above are configured using the cyclic matrices with prime order. On the other hand, a new method in WAIS2013 has proposed, this leads to general constructions of $$(2,p+1)$$(2,p+1)-threshold secret sharing schemes. Moreover, we use m-dimensional vector spaces over $$\mathbb {Z}_2$$Z2 on having bases that meet certain conditions in order to construct proposed methods. Moreover, existences of $$(2,2^m)$$(2,2m)-threshold secret sharing schemes are published (in NBiS2013) by using a new notion “2-propagation bases set” as a bases set in m-dimensional vector spaces over $$\mathbb {Z}_2$$Z2. However this construction for all parameter m is wrong, in other words, it constitutes just only $$(2,m(m+1)/2)$$(2,m(m+1)/2)-SSS, not $$(2,2^m)$$(2,2m)-SSS. This paper corrects mistakes of construction and also proposes an accurate construction by using Galois field $$GF(2^m)$$GF(2m) that elements are represented in the ring $$F_p[X]/f(X)$$Fp[X]/f(X) where f(X) is an irreducible polynomial, these functionalities lead to general constructions of $$(2,2^m)$$(2,2m)-threshold secret sharing schemes.

Yuji Suga

High-Speed Forensic Technology Against Targeted Cyber Attacks (Extended Abstract)

This paper introduces the high-speed forensics technology that promptly analyzes the damage after the targeted cyber attack had been detected and visualizes the whole picture of the attack by binding the communication packets and users’ logs.

Yuki Unno, Takanori Oikawa, Kazuyoshi Furukawa, Masanobu Morinaga, Masahiko Takenaka, Tetsuya Izu

The 7 International Workshop on Information Networking and Wireless Communications (INWC-2017)


A Modified Energy-Aware B.A.T.M.A.N Routing Protocol

B.A.T.M.A.N routing algorithm was originally designed as a better approach to Mobile Ad hoc Networks (MANET), in order to deal with networks that are based on unreliable links. Mainly, each B.A.T.M.A.N node updates its routing tables based on the received number of small broadcast packets. However, with recent development in mobile technologies, Wireless Sensor Networks (WSNs), Low Power and Lossy Networks (LLNs) are emerging. In order to address the routing problem in these networks, in this paper, we propose a modification to the original B.A.T.M.A.N algorithm. With the main objective of increasing network lifetime, each B.A.T.M.A.N node considers the energy of its neighbors, when updating its routing table. In order to do so, the broadcast packet is equipped with an additional field, which indicates the remaining energy of the node. We explain in details the new algorithm and discuss its advancements and challenges.

Hiroya Oda, Elis Kulla, Kengo Katayama

BER Comparison of Constant Envelope DCT and FFT Based OFDM with Phase Modulation

This paper examines the performance of a generalized constant envelope Discrete Cosine Transform and Fast Fourier Transform based Orthogonal Frequency Division Multiplexing (CE-DCT-OFDM and CE-FFT-OFDM) system over AWGN channel. In the system, M-ary pulse amplitude modulation (M-ary PAM) mapper is considered and closed-form expressions for bit error rate of these systems are derived. The receiver structure consists of a phase demodulator followed by the standard OFDM demodulator. Both analytical and simulations results of BER performance of CE-FFT-OFDM and CE-DCT-OFDM systems are persented. It is shown that at bit error rate of $$10^{-4}$$10-4, the CE-DCT-OFDM system has 3 dB performance loss compared to CE-FFT-OFDM system.

Rayan H. Alsisi, Raveendra K. Rao

Design of Microwave Circuit with Periodic Structure for Channel Switching by Carrier Frequency

Design of a microwave circuit in photonic crystal structure is proposed for channel switching which depends on the carrier frequency, based on an experimental study. Waveguide structure with a line defect is situated in periodic array of ceramic rods. Another waveguide for switched output is coupled through a cavity with the input/output waveguide. Due to resonance in the cavity, the specific frequency component is coupled and guided into the waveguide after resonant coupling. Fairly high resonance and clear separation is obtained in the experiment. The result is applicable for signal switching in frequency division multiplexing system.

Hiroshi Maeda, Xiang Zheng Meng, Keisuke Haari, Naoki Higashinaka

A Message Suppression Method for Inter-Vehicle Communications

In our previous work, we evaluated the performance of our proposed method for message suppression in Vehicular Ad-hoc Networks (VANETs). In this paper, we propose a calculation method of message suppression time for inter-vehicle communications. The proposed method considers time-series data of newly discovered vehicles and neighbors parameters. From the simulation results, we observed that our proposed method increased the efficiency by taking smaller message suppression time than conventional method.

Makoto Ikeda, Daichi Koga, Yu Yoshino, Leonard Barolli

Demand Side Management Using Strawberry and Enhanced Differential Evolution Algorithms

Today, electricity is the most worthwhile resource which makes human life very easy. To overcome the gap among demand and supply of electricity, new techniques and methods are being explored. However, electricity demand is increasing constantly, which causes serious crisis. To tackle this problem, demand side management integrated with traditional grids through intercommunication between utility and customers. In this research work, we comparatively look over the two meta-heuristic algorithms: strawberry algorithm (SBA) and enhanced differential evolution (EDE) algorithm in terms of cost minimization, peak to average ratio reduction and maximizing user comfort. For electricity bill calculation, critical peak pricing (CPP) scheme is used. Simulation results show that both optimization techniques work significantly to achieve the desired objectives. SBA performs better then EDE in term of cost minimization while EDE performs better then SBA in terms of user comfort (UC) maximization, PAR reduction and energy consumption minimization.

Hazrat Abubakar Sadiq, Muhammad Sufyan Khan, Ihsan Ali, Ishtiaq Ali, Pamir, Nadeem Javaid

A Heuristic Scheduling Approach for Demand Side Energy Management

In this paper, we proposed a mechanism for power scheduling problem in Home Energy Management System using two heuristic algorithms Tabu Search (TS) and Enhanced Differential Equation (EDE) with Real time pricing scheme. The aim of this proposed scheduling mechanism is to find an optimal daily load schedule which can achieve a balanced trade-off between electricity cost and user comfort with respect to management of peak hour load. Simulation results show that TS has achieved a lower waiting time than EDE. Whereas, EDE has performed better than TS in reducing cost. Moreover, according to overall results TS performed better in comparison to other as it achieves a balanced trade-off between cost and user comfort and also avoids peak formation.

Sikandar Asif, Sundas Shafiq, Iqra Fatima, CH Anwar ul Hassan, Zain Ul Abideen, Nadeem Javaid

The 6 International Workshop on Advances in Data Engineering and Mobile Computing (DEMoC-2017)


Generating Manzai-Scenario Using Entity Mistake

Today, many communication robots have been developed. Nevertheless, smooth communication with humans is difficult for robots. We specifically examine communication between robots based on dialogue. Here, we create a dialogue-based scenario for the robots. Our proposed scenario includes not only daily dialogue but also dialogue with humor to make the news familiar for people. Our proposed dialogue-based scenario is called a Manzai scenario. We have already proposed a means of generating Manzai scenarios automatically. Our proposed Manzai scenario consists of Introduction part, Body part, and Conclusion part. Introduction part consists of some components, one of the components is rival word extraction. There are some problem in our earlier proposed Manzai scenario creation system. Then, in this paper, we modify rival word extraction using Word2Vec. Furthermore, we modify the Introduction part based on an entity mistake. We conducted an experiment to measure the benefits of our proposed method. The experiment results underscore its benefits.

Satoshi Aoki, Tomohiro Umetani, Tatsuya Kitamura, Akiyo Nadamoto

A k-anonymized Text Generation Method

In this paper, we propose a method for automatically generating k-anonymized texts from texts which include sensitive information. Many texts are posted on social media, but these texts sometimes include sensitive information, such as living places, phone numbers, and SSNs. Even if sensitive information is removed from the texts, readers still be able to estimate the sensitive information from the anonymized texts, because the readers can guess sensitive information using remained information. To solve this problem, we propose a method for anonymizing texts using k-anonimization based techniques. This anonymization process is time consuming, we cannot identify appropriate anonymized strings in real time. Therefore, we proposed a method for generating an anonymization dictionary, and anonymize texts using the anonymization dictionary. In our experiments, we confirmed that our proposed method can anonymize texts in a practical time.

Yu Suzuki, Koichiro Yoshino, Satoshi Nakamura

A System Design for Detecting Moving Objects in Capturing Video Images Using Laser Range Scanners

When video images are obtained from a camera in an IoT environment, preliminary processing, such as the addition of metadata, may be conducted for smoother and more interactive data usage. However, it is often difficult to perform high-load processing, such as video image analysis to obtain metadata, in the case of general camera devices, which typically have lower processing capability than personal computers. While it is possible to add metadata by using an edge device that can conduct desired calculations on a communication pathway (such as a router with edge computation functionality connected to a camera), this approach may not be sufficient for high-load processing. Against this backdrop, we propose a technique that enables preliminary processing on an edge device using a variety of external sensor information, rather than conducting high-load processing. As a case study, we discuss a video system that employs a laser range scanner for motion detection and an edge device that coordinates with a camera to add the positions of moving objects as metadata on a video image.

Yoshimasa Ishi, Tomoya Kawakami, Tomoki Yoshihisa, Yuuichi Teranishi, Shinji Shimojo

Proposition of Division-Based Broadcasting System for Delivering Multiple Videos

Due to the recent popularization of IP multicasts, the continuous broadcasting of audio or video media data is attracting great attention. Although servers can concurrently deliver data to many clients, they have to wait until their data are broadcast. In division-based broadcasting, many researches have proposed scheduling methods to reduce waiting time. We have proposed a division-based broadcasting system to evaluate these scheduling methods. However, this system does not consider the problem for delivering multiple videos synchronously. In this paper, we propose a division-based broadcasting system for delivering multiple videos.

Yusuke Gotoh, Yusuke Inoue

The 6 International Workshop on Web Services and Social Media (WSSM-2017)


A Block-Based Structure Editor for the English Language

A structure editor is developed which helps its user compose grammatically correct English sentences. Its user-interface is inspired by Scratch which is a block-based structure editor for the programming language. Scratch allows its user to compose a program of block-shaped components only if their arrangement is syntactically correct so that the user can experience coding without fear of committing syntax errors. So does the developed editor for the English sentences. The editor allows the user to drag blocks freely around and bond them together only if their combination matches the grammar described in the BNF notation. Then the user can compose a correct English sentence with good attention to the grammar. That makes it possible for a beginner, who is not perfect in understanding the English grammar, to try composing a sentence and learn the grammar by experiences. A prototype of the structure editor is presented that covers only simple affirmative sentences.

Osamu Goto, Michitoshi Niibori, Masaru Kamada

A Web Application for Passengers to Watch Coming Buses in Rural Areas

We present a web application for passengers to watch their bus come on the display of their smart phones. It is intended to serve the passengers of local community bus services in rural areas where people have been suffering from sparse and unpredictable arrivals of buses due to infrequent and delayed operations. First the user picks up a bus trip. Then the current position of the bus is superimposed over the Google Maps along with the route and stops of the trip. The passenger can deploy a virtual sentry on the route. When the bus comes close to the sentry, the web application alerts to the user that the bus is arriving soon and the user should get prepared to catch the bus. Until then, the passengers can spend their time on working, having coffee, or taking a nap without fear of missing the bus. We have just started an experimental service to the community bus service in a nearby city in attempt to make the bus service more convenient and popular. At an extremum, we may reach a situation that people do not have to care about the fixed time tables but only the alert notifying that our bus is approaching, just like the urban people do.

Yukiya Yamaguchi, Ryosuke Iiya, Michitoshi Niibori, Erjing Zhou, Masaru Kamada, Osamu Saitou, Susumu Shibusawa

An HTML5 Implementation of Web-Com for Recording Chalk Annotations and Talk Voices onto Web Pages

Web-Com is a tool for teachers to record their chalk annotations and talk voices onto textbook pages on the web to produce lively e-learning contents. It was originally developed as a Windows application in 2005 and then upgraded to work on the web browsers by means of the Adobe Flash platform. The fall of Flash platform from its dominancy in 2015 motivated us to develop this latest version solely on the basis of HTML5 and JavaScript so that it works on any contemporary web browsers.

Shuji Ogawa, Michitoshi Niibori, Tatsuhiro Yonekura, Masaru Kamada

A Web-Based Visualization System for Interdisciplinary Research Using Japanese Local Political Corpus

This paper describes a web-based visualization system, for interdisciplinary research, using the Japanese local political corpus. We illustrate the system for the corpus, which contains the local assembly minutes of 47 Japanese prefectures from April 2011 to March 2015. This four-year period coincides with the office term for assembly members in most local governments. Our system provides full-text search features for utterances, context word extraction using Key Words in Context (KWIC), map visualization, cross-tabulation tables, and political keyword extraction using TF–IDF. We endowed the system with these features to promote its wide range use in various research fields.

Hokuto Ototake, Hiroki Sakaji, Keiichi Takamaru, Akio Kobayashi, Yuzu Uchida, Yasutomo Kimura

Text-Based Video Scene Segmentation: A Novel Method to Determine Shot Boundaries

We propose a video data management system built on a hierarchical structure, in which each video is a work that is divided into scenes, and the scenes are further subdivided into shots to improve search efficiency. In our system, scene-level video segmentations are manually defined according to scene transitions. However, shot-level video segmentations within a scene should be defined automatically, because the numbers of shots is relatively large compared to that of scenes. Therefore, in this study, we developed a method to calculate shot segmentation automatically, based on information contained in closed captions, and we conducted an experiment using the method. This paper presents both a description of the novel segmentation method and the result of our experiment.

Jun Iio, Tongjin Lee

ELVIDS: Video Search System Prototype with a Three-Level Hierarchy Model

We propose a video search system with a three-level hierarchy model for searching videos from works, scenes, and shots. Videos are useful research materials; however, their scholarly use is very limited because finding the desired information is a time-consuming task for scholars. To provide solutions to this problem, we developed a system with functions to increase search efficiency. This paper mentions the reasons preventing the scholarly use of videos and describes the methods used to develop the system, focusing on database creation and the prototype’s interface.

Tongjin Lee, Jun Iio

Comparison of Typing Efficiency Between PC and Smartphone in the Case of Younger Generations

In recent years, smartphones have increased its penetration rate every year, and in 2015 the holding rate of each household exceeds 65%. Especially the rate is very high in Japanese twenties. Especially in the 20s smartphone utilization rate is high, exceeding 90% and it is the highest number among all ages. In this way, while the utilization of smartphones increases among young people, the ownership rate of Personal Computers (PCs) decreases year by year. Under the background of the spread of smartphones, students who write documents such as university reports by smartphones are appearing. From the appearance of such a student, we made the following hypothesis; for young people who have more opportunities to touch smartphones than personal computers, it is more efficient to type on smartphones than typing on a personal computer. In order to verify this hypothesis, we compare the typing efficiency using keyboards of PC and that of software keyboard of smartphones in this study. In order to collect necessary data for comparison, we created an online typing service named “hogehoge typing.” And we conducted typing experiments using this service for 21 students around 20’s. Analysis of the data obtained from the experiment revealed that the smartphone can perform typing more efficiently.

Mitsuhiko Kai, Takuya Tsukamoto, Jun Iio

Extracting Laboratory Front Pages from University Websites

In this paper, we propose a method for extracting laboratory front pages from university websites. There are more than 779 universities and colleges in Japan. For selecting a university or a college, some high school students want to know what laboratories these universities or colleges have. To learn about these laboratories, high school students have to search the laboratory front pages from the university websites. However, sometimes it is difficult to find a laboratory front page because they are sometimes buried deep in the hierarchy of university websites. Our method extracts laboratory front pages by using a support vector machine model and applying certain rules. We also developed a laboratory search system that can be used to retrieve laboratory front pages extracted with our method. We evaluated our method and confirmed that is attained 85.0% precision and 65.5% recall.

Hiroki Sakaji, Atsuya Miyazaki, Hiroyuki Sakai, Kiyoshi Izumi

Activity Estimation Using Device Positions of Smartphone Users

Various activity-based services have been created for use by smartphone users. In the field of activity recognition, researchers frequently use smartphones or devices equipped with built-in sensors to estimate activities. However, in contrast to wristwatch devices that are worn on the arm, users may change the position of the smartphone depending on their situation; this may include placing the device in a bag or pocket. Therefore, a change in the device position should be considered when estimating activities using a smartphone. Considerable research has been conducted under conditions in which a smartphone is placed in a trouser pocket, however, few studies have focused on the changing context and location of the smartphone. Using the Support Vector Machine (SVM) on an Android smartphone, this paper classifies seven types of activity with three types of smartphone position. The results of an experiment conducted with seven smartphone users, indicate that seven possible states were classified with an average accuracy of greater than 95.75%, regardless of the device position.

Yuki Oguri, Shogo Matsuno, Minoru Ohyama

A Topic Trend on P2P Based Social Media

This paper shows a topic trend on a P2P based Social Network Service. There is a text-based Social Network Service (SNS) named Mastodon. Mastodon is a peer-to-peer and open-source SNS. Many persons and companies run Mastodon instances. We consider that there is a topic trend for each node. In this paper, we collect text messages and infer topic trend on a Mastodon instance using Latent Dirichlet Allocation(LDA). The understanding a topic trend helps to choice an instance that a user should participate.

Masaki Kohana, Hiroki Sakaji, Akio Kobayashi, Shusuke Okamoto

A Method for Extracting Correct Links from Automatic Created Links on Folksonomy

A folksonomy is a system to classify an online item/concept by a short text label as a tag that is applied by users. Many folksonomies include many tags that consist words of long-tail contents. To explain these tags, A wiki-like system provided by some folksonomy services for user understanding. These systems provide a function that creates a link to another article automatically that described in an article for enriching the articles. The cause of the automatic link construction function, those wiki-like systems includes many incorrect links. By these incorrect links, it is hard to use the systems for applications that use Wikipedia internal links. Therefore, we propose a method for extracting correct links from all of the automatically created links.

Akio Kobayashi, Hiroki Sakaji, Masaki Kohana


Weitere Informationen

Premium Partner