| 1. |
Bin Chen, 中村 優吾, 荒川 豊, A Study on 3D Gaze Recognition from the Environment Side by Multiple Optical Sensors, 2022.07. |
| 2. |
MinYen Lu, ChenHao Chen, 石田 繁巳, 中村 優吾, 荒川 豊, A study on estimating the accurate head IMU motion from Video, 2022.07. |
| 3. |
Quantifying a Multi-person Meeting based on Multi-modal Micro-behavior Analysis
In this paper, we present an end-to-end online meeting quantifying system, which can exactly detect and quantify three micro-behavior indicators, speaking, nodding, and smile, for online meeting evaluation. For active speaker detection (ASD), we build a multi-modal neural network framework which consists of audio and video temporal encoders, audio-visual cross-attention mechanism for inter-modality interaction, and a self-attention mechanism to capture long-term speaking evidence. For nodding detection, based on the WHENet framework proposed in the research field of head pose estimation (HPE), we can estimate the head pitch angles as the nodding feature. Then we build a gated recurrent unit (GRU) network with squeeze-and-excitation (SE) module to recognize nodding movement from videos. Finally, we utilize a Haar cascade classifier for smile detection. The experimental results using K-fold Cross Validation show that the F1-score of each detection module achieves 94.9%, 79.67% and 71.19% respectively.. |
| 4. |
Construction and evaluation of a human-in-the-loop video annotation system for nodding during meetings
Annotation is one of the time consuming manipulation for human to do. In our previous work, we made a nodding recognition model using annotated video data made by an annotator. We find that consumption of annotation time and the work load require for the annotator is huge. In this work we come up with the idea of human-in-the-loop video annotation system, which the machine leaning model create annotation result before the annotator finalize the annotation result.With this system we evaluated how average time consumed in annotation is reduced.. |
| 5. |
Difficulties in continuous physiological sensing in-the-wild
To realize ubiquitous services based on physiological sensing, it is important to assume that commercially available sensors will be used in daily life. Collecting physiological data from ordinary people for a long period of time in-the-wild is completely different from performing highly accurate physiological sensing using dedicated sensors in a controlled laboratory environment. In this presentation, we will share the various problems we have experienced and clarify the points that need to be considered in order to achieve stable sensing in a real environment.. |
| 6. |
情報技術で3密回避を支援 : 時差通勤・通学を促すためのバス停混雑度情報可視化システムの開発. |
| 7. |
itocon: Bus Stop Congestion Visualizing System with Multiple Congestion Sensors. |
| 8. |
Masato Uchino, Billy Dawton, Yuki Hori, Shigemi Ishida, Shigeaki Tagashira, Yutaka Arakawa, Akira Fukuda, Initial Design of Two-Stage Acoustic Vehicle Detection System for High Traffic Roads, The 2nd International Workshop on Pervasive Computing for Vehicular Systems, 2020.03. |
| 9. |
SMArch : Software Architecture for Smart Mobility (ITS). |
| 10. |
SMArch : Software Architecture for Smart Mobility (ITS). |
| 11. |
Initial Evaluation of Lane Estimation System using Sidewalk Microphones. |
| 12. |
Initial Evaluation of Lane Estimation System using Sidewalk Microphones. |
| 13. |
Yusuke Soneda, Yuki Matsuda, Yutaka Arakawa, Keiichi Yasumoto, Multimodal recording system for collecting facial and postural data in a group meeting, 27th International Conference on Computers in Education, ICCE 2019, 2019.11, By the spread of active learning and group work, the ability to collaborate and discuss among the participants becomes more important than before. Although several studies have reported on that micro facial expressions and body movements give psychological effects to others during conversation, most of them are lacking in quantitative evaluation and there are few datasets about group discussion. In this research, we proposed a highly reproducible system that helps to make datasets of group discussions with multiple devices such as an omnidirectional camera (360-degree camera), an eye tracker and a motion sensor. Our system operates those devices in one-stop to realizing synchronized recording. To confirm the feasibility, we built the proposed system with an omnidirectional camera, 4 eye trackers, and 4 motion sensors. Finally, we succeeded to make a dataset by recording 8 times group meeting by using our developed system easily.. |
| 14. |
Yuito Sugata, Yutaka Arakawa, Keiichi Yasumoto, Battery-less Place Recognition System using Multiple Energy Harvesting Elements, 18th IEEE Sensors, SENSORS 2019, 2019.10, We propose a room-level place recognition system which uses energy harvesting elements as both sensor and power source. As energy harvesting elements, we focus on solar cells. In our previous work, by combining multiple types of cells and learning the difference of the generated power, we succeeded to distinguish ten places thanks to different characteristics of solar cells according to their materials. However, since the previous research focused on investigating the feasibility of our fundamental idea, it used a microcomputer board that requires an additional battery to measure the amount of generated power. Hence, it did not reach the level to utilize the energy harvesting elements as a power supply required for running the whole system. In this paper, we re-design our previously proposed mechanism to measure the amount of generated power of the energy harvesting elements and propose the novel mechanism to measure the amount of generated power by using the generated power without any additional battery. In stead of measuring the amount of generated power, our system has the circuit that counts how many times the electrolytic capacitor has been fully charged. The capacitor used is the minimum size required for reading the time stamp and write it to the memory. Finally, we can measure the amount of generated power by counting the time stamps recorded per unit of time. We designed and implemented the new circuit on PCB, and applied our system to room-level place recognition. As a result, we confirmed that our system can accurately distinguish the eight places.. |
| 15. |
Yusuke Soneda, Yuki Matsuda, Yutaka Arakawa, Keiichi Yasumoto, M3B Corpus
Multi-modal meeting behavior corpus for group meeting assessment, 2019 ACM International Joint Conference on Pervasive and Ubiquitous Computing and 2019 ACM International Symposium on Wearable Computers, UbiComp/ISWC 2019, 2019.09, This paper is the first trial to create a corpus on human-to-human multi-modal communication among multiple persons in group discussions. Our corpus includes not only video conversations but also the head movement and eye gaze. In addition, it includes detailed labels about the behaviors appeared in the discussion. Since we focused on the micro-behavior, we classified the general behavior into more detailed behaviors based on those meaning. For example, we have four types of smile: response, agree, interesting, sympathy. Because it takes much effort to create such corpus having multiple sensor data and detailed labels, it seems that no one has created it. In this work, we first attempted to create a corpus called “M3B Corpus (Multi-Modal Meeting Behavior Corpus),” which includes 320 minutes discussion among 21 Japanese students in total by developing the recording system that can handle multiple sensors and 360-degree camera simultaneously and synchronously. In this paper, we introduce our developed recording system and report the detail of M3B Corpus.. |
| 16. |
Haruka Wada, Zhihua Zhang, Manato Fujimoto, Yutaka Arakawa, Keiichi Yasumoto, Quickcarerecord
Efficient care recording application with location-based automatic view transition and information complement, 13th International Symposium on Medical Information and Communication Technology, ISMICT 2019, 2019.05, In Japan, the demand for nursing home is increasing due to the increase in the number of elderly people. However, the work burden for nursing staffs is very large. Specially, they spend much time in making care reports which reduces the time for doing the essential care for residents in a nursing home. Therefore, to reduce the load for staffs, the system on which staffs can create reports easily and instantly is needed. In this paper, we propose a mobile memo system that switches the view according to the location automatically and assists inputting the necessary information. Our proposed system enables care staffs to prepare the care report about caring for the elderly person quickly. Through the evaluation in the emulated environment, we show that our system succeed to reduce the time for recording by 37.9% and 58.9%, compared with the conventional system and traditional handwriting, respectively.. |
| 17. |
Atsushi Otsubo, Hirohiko Suwa, Yutaka Arakawa, Keiichi Yasumoto, BeatSync
Walking Pace Control Through Beat Synchronization between Music and Walking, 2019 IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2019, 2019.03, Walking has been attracting attention as an important means for prevention and improvement of lifestyle diseases such as high blood pressure and diabetes. In contrast of its importance, not many people know the appropriate pace or amount of walking for themselves. In our previous research, we proposed a system to recommend a route with appropriate walking speed/pace for consuming target calories while keeping load within a moderate range by predicting heart rate variation if walking along the road. However, no system is available which enables a user to naturally adjust his/her walking speed to the specified one while walking. In this paper, focusing on the entertainment effect of the music, we propose a smartphone application called BeatSync which leads everyone to walk naturally and accurately toward the target walking speed.. |
| 18. |
Kenta Taki, Yuki Matsuda, Yutaka Arakawa, Keiichi Yasumoto, Design and Implementation of Notification Information Survey System and Survey Results Toward Use-Side Adaptive Notification Management, 2019 IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2019, 2019.03, Many interrupt notification methods have been studied, but most of the existing research assumes that, except for the target application, the applications do not control the notification timing. However, if other applications are controlled by the same notification timing, interrupt timing will become concentrated and the effects of notification timing control may not be exerted. In addition, since the installed applications are different for each user, it is necessary to control notification timings while taking into consideration the behaviors of all the applications installed on a user's smartphone. In this research, we define notification timing control while considering the behaviors of all installed applications as 'Adaptive Notification Management' and then conduct diversity surveys of notifications received by users. In this paper, we report on a system that acquires all notification information while excluding privacy data. We also report on experimental results using actual data collected using crowdsourcing and discuss how to realize the application realizing adaptive notification management.. |
| 19. |
Zhihua Zhang, Yutaka Arakawa, Harri Oinas-Kukkonen, Design of Behavior Change Environment with Interactive Signage Having Active Talk Function, 2019 IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2019, 2019.03, In this paper, we construct an interactive signage system, which is able to actively talk to users who are passing the signage system and at the same time tries to induce behavioral changes through visual and auditory stimulation. On top of our previous feasibility study, we re-design our proposed system based on the persuasive system design (PSD) model and the behavior change support system (BCSS) theory. The new design consists of 4 parts: recognizing (identifying and classifying users), executing (sending triggers and inducing behavior change), reviewing (recording users' reaction), and feedback (keeping or improving users' motivation). To track users' status and performance, we use the smartphone and the smartwatch to collect users' bio-data (e.g. heart rate, number of steps) and users' location. To send user triggers continuously without being interrupted by notifications from other applications, we set the interactive signage in the daily action line of users and present information to users when they pass the signage. In order to make the system more persuasive, we pick up eight features from the 28-feature list of PSD and apply them to our design.. |
| 20. |
Naoki Yoneoka, Yutaka Arakawa, Keiichi Yasumoto, Detecting Surrounding Users by Reverberation Analysis with a Smart Speaker and Microphone Array, 2019 IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2019, 2019.03, Recently, smart speakers like Amazon Echo and Google Home have been spread widely. Those devices support users' life through voice interface by receiving voice commands to operate appliances and order goods to online shops. Meanwhile, it is reported that smart speakers are vulnerable to some malicious attacks which steal personal information and/or order unnecessary goods by uttering voice from a device nearby the speaker, abusing the fact that the smart speakers cannot distinguish human voice from machine voice. A new type of attack called DolphinAttack which utters ultrasonic voice inaudible to human is also reported. Therefore, a method to identify which of human or machine is sending voice commands to a smart speaker is desired. In this paper, to prevent such machine-voice based attacks to a smart speaker in absence of residents, we propose a system consisting of a speaker and a microphone array to detect the existence of a human nearby, supposing it can be incorporated in a smart speaker in the future. In our proposed system, the speaker emits sonar sound generated based on Orthogonal Frequency Division Multiplexing (OFDM) in all directions, the microphone array with 8 channels attached on top of the speaker receives the reflected sound, and the human existence is judged by comparing the reflected sound with that measured in the same environment without human. Through experiments with a prototype system, we confirmed that our proposed system can detect the human existence by measuring the reflected signal of 0.5 second.. |
| 21. |
Yoshinori Umetsu, Yugo Nakamura, Yutaka Arakawa, Manato Fujimoto, Hirohiko Suwa, EHAAS
Energy harvesters as a sensor for place recognition on wearables, 2019 IEEE International Conference on Pervasive Computing and Communications, PerCom 2019, 2019.03, A wearable based long-term lifelogging system is desirable for the purpose of reviewing and improving users lifestyle habits. Energy harvesting (EH) is a promising means for realizing sustainable lifelogging. However, present EH technologies suffer from instability of the generated electricity caused by changes of environment, e.g., the output of a solar cell varies based on its material, light intensity, and light wavelength. In this paper, we leverage this instability of EH technologies for other purposes, in addition to its use as an energy source. Specifically, we propose to determine the variation of generated electricity as a sensor for recognizing "places" where the user visits, which is important information in the lifelogging system. First, we investigate the amount of generated electricity of selected energy harvesting elements in various environments. Second, we design a system called EHAAS (Energy Harvesters As A Sensor) where energy harvesting elements are used as a sensor. With EHAAS, we propose a place recognition method based on machine-learning and implement a prototype wearable system. Our prototype evaluation confirms that EHAAS achieves a place recognition accuracy of 88.5% F-value for nine different indoor and outdoor places. This result is better than the results of existing sensors (3-axis accelerometer and brightness). We also clarify that only two types of solar cells are required for recognizing a place with 86.2% accuracy.. |
| 22. |
Wataru Sasaki, Masashi Fujiwara, Manato Fujimoto, Hirohiko Suwa, Yutaka Arakawa, Keiichi Yasumoto, Predicting Occurrence Time of Daily Living Activities Through Time Series Analysis of Smart Home Data, 2019 IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2019, 2019.03, Recently, various smart home services such as smart air-conditioning, monitoring of elderly/kids and energy-efficient appliance operations are emerging, thanks to technologies of indoor positioning of users and recognition of Activity of Daily Living (ADL). Meanwhile, to realize more convenient home services, it will become more important to be able to predict occurrence time of each ADL. ADL prediction is a challenging problem since it is difficult to train a prediction model by general machine learning algorithms which use only the data at a moment for classification. In this paper, taking into account temporal dependency of data (consumed power of appliances and position of users) collected during daily life, we propose a method for constructing models to predict ADL with LSTM (Long Short-Term Memory). In the proposed method, we construct LSTM-based models by setting occurrence time of each activity to an objective variable. First, we tried to construct a multi-class classification model which outputs one of several predefined time ranges (time elapsed from present) as the occurrence time of the activity. Through preliminary experiment, we found that this model results in low accuracy in predicting the occurrence time. Then, as the second approach, we constructed a before-or-after classification model which judges if the activity occurs within a specified time or not. We applied this model to our smart home data and confirmed that it achieves better prediction accuracy for all activities.. |
| 23. |
Masashi Takata, Yugo Nakamura, Yohei Torigoe, Manato Fujimoto, Yutaka Arakawa, Keiichi Yasumoto, Strikes-Thrusts Activity Recognition Using Wrist Sensor Towards Pervasive Kendo Support System, 2019 IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2019, 2019.03, In this paper, we focus on Kendo, which is a traditional sport in Japan, and propose a strikes-thrusts activity recognition method using a wrist sensor towards a pervasive Kendo support system. We collected the inertial sensor data set from 6 subjects. We attached 3 inertial sensor units (IMUs) on the subjects body, and 2 IMUs on the Shinai (bamboo sword used for Kendo). On the body, IMUs were placed on the Right Wrist, Waist and Right Ankle. On the Shinai, they were placed on the Tsuba and Saki-Gawa. We first classified strikes-thrusts activities consisting of 4 general types, Men, Tsuki, Do, and Kote, followed by further classification into 8 detailed types. We achieved 90.0% of F-measure in the case of 4-type classification and 82.6% of F-measure in the case of 8-type classification when learning and testing the same subjects data for only Right Wrist. Further, when adding data of sensors attached to the Waist and Right Ankle, we achieved 97.5% of F-measure for 4-type classification and 91.4% of F-measure for 8-type classification. As a result of leave-one-person-out cross-validation from 6 subjects to confirm generalized performance, in the case of 4-type classification, we achieved 77.5% of F-measure by using only 2 IMUs (Right Wrist and Shinai Tsuba).. |
| 24. |
Dmitrii Fedotov, Yuki Matsuda, Yuta Takahashi, Yutaka Arakawa, Keiichi Yasumoto, Wolfgang Minker, Towards Real-Time Contextual Touristic Emotion and Satisfaction Estimation with Wearable Devices, 2019 IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2019, 2019.03, Following the technical progress and growing touristic market, demand on guidance systems is constantly increasing. Current systems are not personalized, they usually provide only a general information on sightseeing spot and do not concern about the tourist's perception of it. To design more adjustable and context-aware system, we focus on collecting and estimating emotions and satisfaction level, those tourists experience during the sightseeing tour. We reducing changes in their behaviour by collecting two types of information: conscious (short videos with impressions) and unconscious (behavioural pattern recorded with wearable devices) continuously during the whole tour. We have conducted experiments and collected initial data to build the prototype system. For each sight of the tour, participants provided an emotion and satisfaction labels. We use them to train unimodal neural network based models, fuse them together and get the final prediction for each recording. As tourist himself is the only source of labels for such system, we introduce an approach of post-experimental label correction, based on paired comparison. Such system built together allows us to use different modalities or their combination to perform real-time tourist emotion recognition and satisfaction estimation in-the-wild, bringing touristic guidance systems to the new level.. |
| 25. |
Yuta Kido, Teruhiro Mizumoto, Hirohiko Suwa, Yutaka Arakawa, Keiichi Yasumoto, A Cooking Support System for Seasoning with Smart Cruet, 5th International Conference on Human Aspects of IT for the Aged Population, ITAP 2019, held as part of the 21st International Conference on Human-Computer Interaction, HCI International 2019, 2019.01, In recent years, the number of people who use online recipe services in order to cook has increased. It is difficult to match food taste to user’s preference because an online recipe page shows a recipe to realize just one taste even though there are countless numbers of recipes in an online recipe service. Our preliminary experiment using convenience food to investigate the user’s preference showed that the preference of almost participants differed from the taste of food cooked following the recipe printed in the package. It has also been reported that 76.5% of housewives are interested in cooking activities. However, using measuring spoon is difficult to use in order to determine the exact amount of seasonings. When we conducted a preliminary experiment to confirm the error between the input amount based on a rough estimation and the specific amount, the average error for small spoon was 46.2%, and the average error for large spoon was 31.8% even though the participants cook frequently. Especially, for an elderly person requiring low salt or low sugar, if the error becomes too big than appropriate amount, leading to endangering his life or losing the pleasures of eating. However, since there is no device currently in use that can assist in putting seasonings, a device other than measuring spoon is needed to determine the amount of seasoning for cooking. In this research, we aim to bring the taste of food with an online recipe close to the user’s preferable taste without burdening the user. In this paper, we propose a cooking support system which analyzes user’s preference from user’s feedback according to the five grade evaluation for each meal, adjusts the amount of seasoning for a recipe depending on user’s preference, and supports to add the seasoning by Smart Cruet equipped with motion sensors, LED light, and BLE communication interface. We conducted an experiment for 14 days to confirm how many days are needed to bring the adjustment of the seasonings close to the preferable taste for the user. We were able to reach the desired adjustment in 7 days. Furthermore, we found Smart Cruet could measure the adding amount of seasoning with 5.56% average error.. |
| 26. |
Yuki Matsuda, Dmitrii Fedotov, Yuta Takahashi, Yutaka Arakawa, Keiichi Yasumoto, Wolfgang Minker, Estimating user satisfaction impact in cities using physical reaction sensing and multimodal dialogue system, 9th International Workshop on Spoken Dialogue System Technology, IWSDS 2018, 2019.01, Following the increase in use of smart devices, various real-time environmental information becomes available everywhere. To provide more context-aware information, we also need to know emotion and a satisfaction level in a viewpoint of users. In this paper, we define it as “a user satisfaction impact (USI)” and propose a method to estimate USI by combining dialogue features and physical reaction features. As dialogue features, facial expression and acoustic feature are extracted from multimodal dialogue system on a smartphone. As physical reactions, head motion, eye motion, and heartbeat are collected by wearable devices. We conducted the preliminary experiments in the real-world to confirm the feasibility of this study in the tourism domain. Among various features, we confirmed that eye motion correlates with satisfaction level up to 0.36.. |
| 27. |
Digital Gimmick for Behavior Changes in Working Places. |
| 28. |
Digital Gimmick for Behavior Changes in Working Places. |
| 29. |
Tour Video Curation Method for Intuitive Sightseeing Tour Planning. |
| 30. |
災害時の混雑情報を考慮した避難場所決定手法の提案. |
| 31. |
Edith Talina Luhanga, Akpa Akpro Elder Hippocrate, 荒川 豊, 安本 慶一, Factors that Affect Success in Group Behavior Change Applications, 行動変容と社会システム vol.02, 2017.06. |
| 32. |
Improving Accuracy of In-Home Activity Recognition by Adding Time-Related Features. |
| 33. |
Edith Talina Luhanga, Akpa Akpro Elder Hippocrate, 荒川 豊, 安本 慶一, Factors that Affect Success in Group Behavior Change Applications, 行動変容と社会システム vol.02, 2017.06. |
| 34. |
Improving Accuracy of In-Home Activity Recognition by Adding Time-Related Features. |
| 35. |
IoTデータ流を実時間で分散処理するためのIoTデバイス向け共通ミドルウェアの設計と評価. |
| 36. |
TRONO Edgar Marko, KUME Yuka, ARAKAWA Yutaka, YASUMOTO Keiichi, ARIYOSHI Masayuki, Implementation of a mountainside sensor network with an ambient air pressure-based routing scheme (ヘルスケア・医療情報通信技術), 電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, 2015.01, In this demonstration, we present an implementation of a low-cost mountainside sensor network that leverages used Android smartphones and an ambient air pressure-based routing scheme. Used Android smartphones are one of the promising platforms for a low-cost sensor network, because these have various sensors and network interfaces. Both Bluetooth and Wi-Fi Direct are utilized for creating a low-power sensor network. In addition, we introduce an ambient air pressure-based routing scheme, which can suppress the overhead of a constant exchange of network topology information, because our target environment is a mountainside. Each node measures the ambient air pressure with their embedded barometers respectively and appends the measurements to their broadcasted wireless interface identifiers. Nodes that need to transmit data perform a discovery cycle and compare the broadcasted pressure values of neighbor nodes to their own. Data are routed up a slope by choosing nodes with lower pressure values. We implement our sensor network based on 3 Android smartphones, and will show that our system can transmit a data based on air pressure values through a hybrid network created by Bluetooth and Wi-Fi Direct.. |
| 37. |
TRONO Edgar Marko, KUME Yuka, ARAKAWA Yutaka, YASUMOTO Keiichi, ARIYOSHI Masayuki, Implementation of a mountainside sensor network with an ambient air pressure-based routing scheme (モバイルネットワークとアプリケーション), 電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, 2015.01, In this demonstration, we present an implementation of a low-cost mountainside sensor network that leverages used Android smartphones and an ambient air pressure-based routing scheme. Used Android smartphones are one of the promising platforms for a low-cost sensor network, because these have various sensors and network interfaces. Both Bluetooth and Wi-Fi Direct are utilized for creating a low-power sensor network. In addition, we introduce an ambient air pressure-based routing scheme, which can suppress the overhead of a constant exchange of network topology information, because our target environment is a mountainside. Each node measures the ambient air pressure with their embedded barometers respectively and appends the measurements to their broadcasted wireless interface identifiers. Nodes that need to transmit data perform a discovery cycle and compare the broadcasted pressure values of neighbor nodes to their own. Data are routed up a slope by choosing nodes with lower pressure values. We implement our sensor network based on 3 Android smartphones, and will show that our system can transmit a data based on air pressure values through a hybrid network created by Bluetooth and Wi-Fi Direct.. |
| 38. |
M-010 Smartphone-based Estimation of sleep onset time for short sleep support. |
| 39. |
M-010 Smartphone-based Estimation of sleep onset time for short sleep support. |
| 40. |
Demonstration experiment of location-based information delivery system using smart wireless tag (SNFC). |
| 41. |
Demonstration experiment of location-based information delivery system using smart wireless tag (SNFC). |
| 42. |
Yoshitaka Ueyama, Morihiko Tamai, Yutaka Arakawa, Keiichi Yasumoto, Gamification-based incentive mechanism for participatory sensing, 2014 IEEE International Conference on Pervasive Computing and Communication Workshops, PERCOM WORKSHOPS 2014, 2014.01, Since participatory sensing relies on users' active participation, several monetary incentive mechanisms for attracting users' participation have been proposed. However, to make users participate in 'heavy' sensing tasks (either physically or mentally), stronger incentive is required. Thus, the total amount of rewards paid by the client will quickly rise. In this paper, we propose a novel incentive mechanism based on gamification for participatory sensing to reduce the total amount of rewards paid by the client. The proposed incentive mechanism incorporates a status level scheme depending on earned reward points like airline's mileage services, so that users with higher status can earn more reward points. We also introduce a ranking scheme among users and a badge scheme based on gamification so that users are attracted by getting not only monetary reward points but also sense of accomplishment. We formulate the problem of sensing given PoI (points of interest) with minimal reward points and devise a heuristic algorithm for deriving the set of users to which requests are sent and appropriate reward points for each request. The algorithm requires the participation probability distribution for each tuple of a user, reward points, and the burden of a sensing task. To obtain the probability distribution, we implemented a prototype of a participatory sensing system with the proposed incentive mechanism and conducted an experiment with 18 users for 30 days. As a result, we confirmed that the gamification mechanism increased participation probability from 53% (without gamification) to 73%.. |
| 43. |
Yutaka Arakawa, Yuki Sonoda, Koki Tomoshige, Shigeaki Tagashira, Akira Fukuda, Implementation of WiFi/Bluetooth-based Smart Narrow Field Communication, 2014 7th International Conference on Mobile Computing and Ubiquitous Networking, ICMU 2014, 2014.01, In this poster, we introduce our developed wireless tag system called Smart Narrow Field Communication (SNFC). The purpose of SNFC is to provide a long url of the contents on the Internet easily like QR code and NFC (Near Field Communication). SNFC assumes a device name of wireless applications as a tag for recognizing a target content. The relationship between a device name and the url is managed on our cloud system. In addition to a device name, our system takes other user contexts such as gender and age into consideration for deciding the target content. The advantage of SNFC is that all the common devices such as WiFi router or Bluetooth mouse can be used as a tag.. |
| 44. |
Yuko Hirabe, Yutaka Arakawa, Keiichi Yasumoto, Logging all the touch operations on Android, 2014 7th International Conference on Mobile Computing and Ubiquitous Networking, ICMU 2014, 2014.01, Touch operation has already become a common technique, and will be adopted to most electrical appliances in the future. Therefore, we suppose that a user's touch operation will be one of important contexts for realizing the future context-aware system. Through observation of the user's touch operation, a system could estimate the user's emotion, skill, etc. In this demonstration, we exhibit our system for logging all the touch operations on Android. In addition to the logging, our system can analyze and visualize several popular touch operations.. |
| 45. |
Integration of Place API
According to the recent spread of location-based services, the information about our real world associated with the coordinates, called POI(Point Of Interest), becomes much important. Major companies such as Google, Facebook have already started providing their POI data through API(Application Program Interface) which is generally called Place API for users. However, they manages POI by different ID and different accompanying information. Additionally, access ways such as an authentication are different with each other. In this paper, we investigate the difference of specification between Place APIs, and design and implement a proxy access interface which enables the developer to access 4 major Place APIs with the same query. Finally, we study how to integrate their different responses against the same coordinates.. |
| 46. |
Development and Evaluation of Hybrid Energy Harvesting Sensor Node trying Data MULE for Agricultural Sparse Wireless Sensor Network
Such as minimization, cost reduction, and higher functionalization of sensors, the evolving wireless sensor network technologies are influencing more strongly especially to precision agriculture. In precision agriculture, environmental sensing is very important element. Now, in order to construct environmental sensing in a tea garden, we considered to introduce a sensor network. However, because it becomes an agricultural sparse wireless sensor network(ASWSN), it causes the problem that some sensor node cannot transmit with another node by ad-hoc transmission because of their farther distance. Additionally, it also causes necessity to ensure the enough power supply. In this paper, we develop the low-cost sensor node prototype using Arduino. It realizes power supply from solar and wind, and realized low-power Data MULE using either an ultrasonic distance sensor or a 315 MHz transceiver on sensor node's wakeup. Finally, we evaluate about the driving time by simulation, and report the result on installing in real-world outdoor experiment.. |
| 47. |
Integration of Place API
According to the recent spread of location-based services, the information about our real world associated with the coordinates, called POI(Point Of Interest), becomes much important. Major companies such as Google, Facebook have already started providing their POI data through API(Application Program Interface) which is generally called Place API for users. However, they manages POI by different ID and different accompanying information. Additionally, access ways such as an authentication are different with each other. In this paper, we investigate the difference of specification between Place APIs, and design and implement a proxy access interface which enables the developer to access 4 major Place APIs with the same query. Finally, we study how to integrate their different responses against the same coordinates.. |
| 48. |
Development and Evaluation of Hybrid Energy Harvesting Sensor Node trying Data MULE for Agricultural Sparse Wireless Sensor Network
Such as minimization, cost reduction, and higher functionalization of sensors, the evolving wireless sensor network technologies are influencing more strongly especially to precision agriculture. In precision agriculture, environmental sensing is very important element. Now, in order to construct environmental sensing in a tea garden, we considered to introduce a sensor network. However, because it becomes an agricultural sparse wireless sensor network(ASWSN), it causes the problem that some sensor node cannot transmit with another node by ad-hoc transmission because of their farther distance. Additionally, it also causes necessity to ensure the enough power supply. In this paper, we develop the low-cost sensor node prototype using Arduino. It realizes power supply from solar and wind, and realized low-power Data MULE using either an ultrasonic distance sensor or a 315 MHz transceiver on sensor node's wakeup. Finally, we evaluate about the driving time by simulation, and report the result on installing in real-world outdoor experiment.. |
| 49. |
Sensor virtualization on Android
In this paper, we propose the method to virtualize smartphone sensors on Android so that other devices can use it over Bluetooth. We also propose traffic control method according to the amount of change in the measured data in order to reduce power consumption when using another device's sensor. We prototype the application using virtualized accelerometer. And we report the results of evaluating the power consumption of the device and the accuracy of the sensor value.. |
| 50. |
A Broadcast-based Efficient Extraction Scheme of Updated Content in Road Map Data. |
| 51. |
A Balancing Method of Power Consumption by Functional Distribution between Portable Devices
Recently, a user often carries several smartphones and/or tablets with multiple overlapped sensor functions. In addition, short operating time in such portable devices becomes a serious problem, as compared with the previous generations. Thus, we propose a method to extend total operating time by distributing and sharing such overlapped functions between multiple portable devices. For example, one portable device operates with a GPS device which consumes large power and sends the acquired position to another device through a Bluetooth communication. The proposed method makes it possible to balance the power consumption between the portable devices. In this paper, we measure the power required for operating sensor functions and for communications between terminals. Moreover, we consider the decision algorithm for sharing and distributing functions between portable devices based on the results.. |
| 52. |
Sensor virtualization on Android
In this paper, we propose the method to virtualize smartphone sensors on Android so that other devices can use it over Bluetooth. We also propose traffic control method according to the amount of change in the measured data in order to reduce power consumption when using another device's sensor. We prototype the application using virtualized accelerometer. And we report the results of evaluating the power consumption of the device and the accuracy of the sensor value.. |
| 53. |
A Broadcast-based Efficient Extraction Scheme of Updated Content in Road Map Data. |
| 54. |
A Balancing Method of Power Consumption by Functional Distribution between Portable Devices
Recently, a user often carries several smartphones and/or tablets with multiple overlapped sensor functions. In addition, short operating time in such portable devices becomes a serious problem, as compared with the previous generations. Thus, we propose a method to extend total operating time by distributing and sharing such overlapped functions between multiple portable devices. For example, one portable device operates with a GPS device which consumes large power and sends the acquired position to another device through a Bluetooth communication. The proposed method makes it possible to balance the power consumption between the portable devices. In this paper, we measure the power required for operating sensor functions and for communications between terminals. Moreover, we consider the decision algorithm for sharing and distributing functions between portable devices based on the results.. |
| 55. |
A Balancing Method of Power Consumption by Functional Distribution between Portable Devices
Recently, a user often carries several smartphones and/or tablets with multiple overlapped sensor functions. In addition, short operating time in such portable devices becomes a serious problem, as compared with the previous generations. Thus, we propose a method to extend total operating time by distributing and sharing such overlapped functions between multiple portable devices. For example, one portable device operates with a GPS device which consumes large power and sends the acquired position to another device through a Bluetooth communication. The proposed method makes it possible to balance the power consumption between the portable devices. In this paper, we measure the power required for operating sensor functions and for communications between terminals. Moreover, we consider the decision algorithm for sharing and distributing functions between portable devices based on the results.. |
| 56. |
On Improvement of Positioning Accuracy in Network-side Localization with Terminal-originated RSSI Variation
We have developed an adhoc wireless positioning network (AWPN) that can temporarily and easily provide a positioning area, even in indoor environments. An AWPN provides a network-side positioning capability on a wireless mesh network, i.e., the network is constructed by deploying wireless LAN access points (APs) in the positioning area. However, the positioning performance is not enough due to the fact that an AWPN is mainly intended to make its deployment and configuration easier. In this paper, we propose a multilateration-based lo-calization scheme which can improve the positioning accuracy in network-side localization with terminal-originated RSSI variations. Moreover, we evaluate the effectiveness of the proposed scheme in an actual environment. As a result, the proposed scheme improves the accuracy for estimating the position of a fixed terminal over 13.4% as compared with an existing method, and reduces terminal-originated RSSI variations .In addition, we confirm that it can stably estimate the trajectory of a moving terminal.. |
| 57. |
On Improvement of Positioning Accuracy in Network-side Localization with Terminal-originated RSSI Variation
We have developed an adhoc wireless positioning network (AWPN) that can temporarily and easily provide a positioning area, even in indoor environments. An AWPN provides a network-side positioning capability on a wireless mesh network, i.e., the network is constructed by deploying wireless LAN access points (APs) in the positioning area. However, the positioning performance is not enough due to the fact that an AWPN is mainly intended to make its deployment and configuration easier. In this paper, we propose a multilateration-based lo-calization scheme which can improve the positioning accuracy in network-side localization with terminal-originated RSSI variations. Moreover, we evaluate the effectiveness of the proposed scheme in an actual environment. As a result, the proposed scheme improves the accuracy for estimating the position of a fixed terminal over 13.4% as compared with an existing method, and reduces terminal-originated RSSI variations .In addition, we confirm that it can stably estimate the trajectory of a moving terminal.. |
| 58. |
Yutaka Arakawa, Yuki Sonoda, Shigeaki Tagashira, Akira Fukuda, WiFiTag
Direct link from the real world to online digital contents, 2012 7th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing, 3PGCIC 2012, 2012.12, WiFiTag is a simple and low cost solution for associating the real world to the online media such as web sites and YouTube. Our idea is to redirect a user's access based on the information of surrounding WiFi access points. Compared with WiFi-based indoor positioning system, our system requires no calculation and no much access points. This is because our system associates the digital content not with the location but with the AP itself. as the information of AP, we use ESSID, BSSID, and RSSI. by uploading a scanned WiFi information to the WiFiTag server, a terminal can get the proper URL as a response. Relationship between the WiFiTag and the URL have been defined ahead. WiFiTag realize "real to virtual" connection easily. for example, by associating lab's SSID to lab's HP, a visitor can access a lab's HP easily and directly, when the visitor comes to our lab. a camera required for QR code don't need for our system. in addition, a special card reader and touch action required for NFC are also unnecessary. If WiFi has already exist, no additional cost is necessary for our system. in this paper, we describe a overall concept of WiFiTag and show the availability and feasibility of our proposed system through some experimental evaluation results.. |
| 59. |
B-15-7 Basic Behavior of Network Switching on Android OS for realizing a Context-Aware Network Selection. |
| 60. |
B-15-7 Basic Behavior of Network Switching on Android OS for realizing a Context-Aware Network Selection. |
| 61. |
WiFi Tag：Direct Link from Analog Contents to Online Digital Contents. |
| 62. |
An Improved Determination Method with Multiple Access Points for Relative Position Estimation Using Wireless LAN. |
| 63. |
A Generation Technique of Common Information Exploiting Characteristics of Multipath Fading Channel for Handheld Devices
An explosive spread of handheld devices with wireless communication capability, such as cellular phone and smart phone, rapidly increases an opportunity for data communication through temporarily constructed short-range wireless networks. An easy realization of the secure data communication in such networks is indispensable to user-friendly networking environment towards the popularization of short-range wireless networks. In this paper, we propose a common key sharing technique which generates the encryption key on a communication pair rather than distributes a prepared key from one to the other. The main idea of the proposed technique is to generate a common key based on the variation of multipath fading channel caused by shaking the sender device. Furthermore, we implement a prototype system realizing the proposed method and evaluate the effectiveness of the proposed method. The results indicate that the proposed method can generate the same key of 128-bit length for about 3 seconds on each device.. |
| 64. |
An Accurate Localization Scheme in Adhoc Wireless Positioning System for Information-oriented Construction
For actual scenes of information-oriented construction, it is required to develop easy and adhoc localization technology in indoor environments, since one of the goals is to realize location management of construction workers, e.g., it is used to avoid entering dangerous areas and taking dangerous behaviors. For that purpose, we aim to create an IT-colorcone with wireless communication capability and realize the adhoc positioning environment by deploying multiple IT-colorcones to a positioning area. In this paper, we propose an accurate localization method that provide an appropriate modeling of radio wave propagation of each IT-colorcone through an analysis of the characteristic of RSSIs from other IT-colorcones. Moreover, we evaluate the effectiveness of the proposed method. From the result, we confirm that the average error was improved by 30%.. |
| 65. |
An Accurate Localization Scheme in Adhoc Wireless Positioning System for Information-oriented Construction
For actual scenes of information-oriented construction, it is required to develop easy and adhoc localization technology in indoor environments, since one of the goals is to realize location management of construction workers, e.g., it is used to avoid entering dangerous areas and taking dangerous behaviors. For that purpose, we aim to create an IT-colorcone with wireless communication capability and realize the adhoc positioning environment by deploying multiple IT-colorcones to a positioning area. In this paper, we propose an accurate localization method that provide an appropriate modeling of radio wave propagation of each IT-colorcone through an analysis of the characteristic of RSSIs from other IT-colorcones. Moreover, we evaluate the effectiveness of the proposed method. From the result, we confirm that the average error was improved by 30%.. |
| 66. |
An Accurate Localization Scheme in Adhoc Wireless Positioning System for Information-oriented Construction. |
| 67. |
An Accurate Localization Scheme in Adhoc Wireless Positioning System for Information-oriented Construction. |
| 68. |
ICT to Vitalize Japan : 10. Information and Communication Technology for Love. |
| 69. |
B-15-13 On Improvment of Estimation Accuracy for Network-Based WLAN Positioning Systems. |
| 70. |
B-15-14 An Estimation Method for Positional Relationship Using Multiple RSSIs from Access Points. |
| 71. |
B-15-9 Evaluation of Vehicular Opportunistic Communications Using Ultrasonic Sensors in Energy-Efficient WSNs. |
| 72. |
A Fast Algorithm and Its Performance Evaluation for the Deployment Problem of Base Stations with DOP in the Indoor Positioning. |
| 73. |
B-15-13 On Improvment of Estimation Accuracy for Network-Based WLAN Positioning Systems. |
| 74. |
B-15-14 An Estimation Method for Positional Relationship Using Multiple RSSIs from Access Points. |
| 75. |
B-15-9 Evaluation of Vehicular Opportunistic Communications Using Ultrasonic Sensors in Energy-Efficient WSNs. |
| 76. |
Tatsuya Abe, Yutaka Arakawa, Shigeaki Tagashira, and Akira Fukuda, A Mobilesink-initiated Proactive Routing Protocol for Deadline-Aware Data Aggregation Method in Energy-Efficient Wireless Sensor Networks, ARCS Workshop on Architectures for Self-Organizing PRivate IT-Spheres 2012 (ASPRIT 2012), 2012.02. |
| 77. |
Tomohiro Iwamoto, Shigeaki Tagashira, Yutaka Arakawa, and Akira Fukuda, A Robust Generation Technique of Common Information Based on Characteristic of Multipath Fading Channel by Shaking Handheld Devices, ARCS Workshop on Architectures for Self-Organizing PRivate IT-Spheres 2012 (ASPRIT 2012), 2012.02. |
| 78. |
Shota Ishikawa, Yutaka Arakawa, Shigeaki Tagashira and Akira Fukuda, Hot-Topics Detection in Local Areas Using Twitter and Wikipedia, International Workshop on Complex Sciences in the Engineering of Computing Systems (CSECS 2012), 2012.02. |
| 79. |
Ming Li, Shigeaki Tagashira,Yutaka Arakawa and Akira Fukuda, A Channel Assignment Method for Positioning Systems in Wireless Mesh Network, 2012 International Conference on Embedded Systems and Intelligent Technology (ICESIT 2012), 2012.01. |
| 80. |
Routing Protocol for Deadline-Aware Data Aggregation Method in Energy-Efficient Wireless Sensor Networks. |
| 81. |
Development of a Software Framework for Adaptive Wireless Network Selection Based on User's Context Information. |
| 82. |
Development of a Software Framework for Adaptive Wireless Network Selection Based on User's Context Information
It is required to realize wireless network selections which automatically select an appropriate network from all available ones according to user's context information. The goal of our project is to extract common functions in a variety of wireless network selections for use in the development and to provide these functions as a software framework. By using the proposed software framework, it is easy to develop wireless network selections according to individual user's situations. In this technology exhibit, we present an application for wireless network selections using the proposed software framework.. |
| 83. |
Development of a Software Framework for Adaptive Wireless Network Selection Based on User's Context Information. |
| 84. |
Routing Protocol for Deadline-Aware Data Aggregation Method in Energy-Efficient Wireless Sensor Networks
In this paper, we focus on monitoring environments with wireless sensor networks wherein mobile sink nodes exist to traverse a sensing field in a spatial-temporal specific manner and aggregate some types of environment data with different deadline constraints. For such environments, we propose an energy-efficient data aggregation method which reduces intermediate transmissions in multi-hop communications while guaranteeing the deadlines. The basic approach of the proposed method is to temporarily gather (or buffer) the observed data into several sensor nodes existing around the moving path of the mobile sink that would meet their deadline at the next visit and then, to transfer the buffered data to the mobile sink node when it visits the sensor nodes. In addition, we also propose a mobilesink-initiated proactive routing protocol (MIPR-LC) which efficiently constructs routes to buffering nodes on each sensor node. Moreover, we evaluate the proposed aggregation method and routing protocol by simulation to show their effectiveness. As a result, we confirm that the MIPR-LC method can reduce less than 23 % in energy consumption as compared with a simple routing protocol and also the mobile sink nodes can gather almost all the observation data within the deadline.. |
| 85. |
Improvement in packet import method of Hadoop-based Packet Analyzer for High Volume Packet Data
Traffic analysis based on packet capturing become hard to analyze quickly, because captured packet data has become too huge according to the speed-up of the network itself. We propose and implement hadoop-based packet analyzer to deal with huge captured packet data in a previous study. In this paper, we bring out bottlenecks in our previous system, and propose corrective strategy for bottlenecks. In addition, we indicate to reduce processing time by up to 50% of the conventional process on hadoop cluster which consist of 13 IA servers.. |
| 86. |
Improvement in packet import method of Hadoop-based Packet Analyzer for High Volume Packet Data
Traffic analysis based on packet capturing become hard to analyze quickly, because captured packet data has become too huge according to the speed-up of the network itself. We propose and implement hadoop-based packet analyzer to deal with huge captured packet data in a previous study. In this paper, we bring out bottlenecks in our previous system, and propose corrective strategy for bottlenecks. In addition, we indicate to reduce processing time by up to 50% of the conventional process on hadoop cluster which consist of 13 IA servers.. |
| 87. |
Yutaka Arakawa, Shigeaki Tagashira, and Akira Fukuda, Spatial Statistics with Three-tier Breadth First Search for Analyzing Social Geocontents, 15th International Conference on Knowledge-Based and Intelligent Information & Engineering Systems (KES2011), 2011.09. |
| 88. |
A Detection Method for Hot-Topics in Local Areas Using Microblog. |
| 89. |
B-15-13 A Calibration Scheme for Evaluating Eco-driving Skill Using a Mobile Device. |
| 90. |
B-15-14 A Study on Pass-by Connection in Mobile Wireless Sensor Networks. |
| 91. |
B-15-13 A Calibration Scheme for Evaluating Eco-driving Skill Using a Mobile Device. |
| 92. |
B-15-14 A Study on Pass-by Connection in Mobile Wireless Sensor Networks. |
| 93. |
Relationship Analysis between User Contexts and Input Word with Twitter
The objective of this study is to specify the relationship between user's context and really-used words for realizing the context-aware Japanese text input method editor. We propose two analytical methods for finding location-dependent words from a half million tweets including Japanese and geographical location, which have been collected since Dec. 2009. First method is to analyze the standard deviation of both latitude and longitude of all the tweets including a certain word. It is very simple way, but it cannot find out the keywords that depend on multiple locations. For example, tweets including famous department store's name has a large standard deviation, but they may depend on each location. Therefore, we propose three-tier breadth first search, where the searching area is divided into some square mesh, and we extract the area which includes tweets more than average of upper area. In addition, we re-divide the extracted areas into smaller areas. Our method can extract some locations for one keyword.. |
| 94. |
Deadline-Aware Data Aggregation Method for Energy-Efficient Wireless Sensor Networks. |
| 95. |
Deadline-Aware Data Aggregation Method for Energy-Efficient Wireless Sensor Networks
In this study, we propose a deadline-aware aggregation method for energy-efficient wireless sensor networks. Data aggregation method using a mobile sink, while increasing the delay the data is collected, there is a feature that can reduce power consumption in applications where the delay is acceptable is a method useful. However, its performance is highly dependent on behavior of a mobile sink, there is a problem that can not meet the application request power and delay. The simulation revealed the problem. And, as a way to solve this problem, we propose to switch the aggregation method according to the allowable delay time. The proposed scheme is expected that a sensor predict the time to contact a mobile sink and change the aggregation method using a mobile sink and the aggregation method for multi-hop network by comparing the allowable delay time.. |
| 96. |
Deadline-Aware Data Aggregation Method for Energy-Efficient Wireless Sensor Networks. |
| 97. |
On Improvement of Positioning Accuracy for WLAN Positioning System at Tunnel Construction Site. |
| 98. |
Robustness Evaluation of Common Information Exploiting Characteristics of Multipath Fading Channel For Handheld Devices. |
| 99. |
An Interpolation Method of Training Data for Indoor WLAN Positioning System
The development of wireless LAN-based positioning technologies has been proceeding to realize indoor location-depended services that require high positioning accuracy. In this paper, we propose an interpolation method of training data for location fingerprinting to reduce the cost required for building the training data. More specifically, a critical problem with location fingerprinting is considerable cost for measuring received signal strengths at every location where the positioning is possible. In the proposed method, a part of the training data is interpolated from data actually observed at several locations using a path loss model considering wall attenuation. Furthermore, to confirm the effectiveness of the proposed method, we examine the performance of location estimation and verify the interpolated data. As compared with a conventional method, the proposed method can improve the positioning accuracy by 15%.. |
| 100. |
A Study on Automatic Setting Switching Technique by Cooperation of Multiple Terminals
With the spread of mobile phones, society has become sensitive about the use of manners. For example, we have been encouraged to turn off our cell phone while riding the train. In addition, you should make silent mode during a movie theater and a meeting. On the other hand, we want to prevent it from missing the notice from a cell-phone while we are in the house or we walk or we put a cell-phone in a bag. Therefore, the technique for switching the setting of the terminal automatically and appropriately is requested. In this study, we propose a method for automatic mode change by performing the coordination around the terminal. In our system,the mode is judged by recognizing surrounding terminals using the location of the terminal, and sharing mode information between those, and calculating the ratio of the manner mode. In this paper, we designed our system and created a simple prototype of the proposed system, conducted experiments and discussion.. |
| 101. |
On Improvement of Positioning Accuracy for WLAN Positioning System at Tunnel Construction Site
In this paper, we present a serious degradation problem with positioning accuracy that occurs when applying wireless LAN-based positioning systems to a tunnel construction site and propose a correction method to solve the problem. The degradation is due to considerable time variation in the received signal strength. In order to mitigate the impact of the time variation, the proposed method corrects the measured signal strength. It is designed for two localization methods: i.e., location fingerprinting and multi-lateration. Furthermore, we evaluate the effectiveness of the proposed method by experiments at an actual tunnel construction site. From the results, we confirm that location fingerprinting with the proposed correction can improve the successful ratio by 5.4% and the average error by 28%, as compared to that without the correction. Moreover, as for multi-lateration with the correction, the average error is reduced by 37%.. |
| 102. |
On Improvement of Positioning Accuracy for WLAN Positioning System at Tunnel Construction Site. |
| 103. |
Robustness Evaluation of Common Information Exploiting Characteristics of Multipath Fading Channel For Handheld Devices
An explosive spread of handheld devices with wireless communication capability, such as cellular phone and PDA, rapidly increases opportunity for data communication through temporarily constructed short-range wireless network. An easy realization of secure communication in such network is indispensable to user-friendly networking environment towards popularization of short-range wireless networks. Resently a common key sharing technique which generates the encryption key on a communication pair rather than distributes a prepared key from one to the other are proposed. The main idea of the proposed technique is to generate a common key based on the variation of multipath fading channel caused by shaking the sender device. In this paper, we implement a prototype system realizing the proposed method and evaluate the robustness of the proposed method.. |
| 104. |
Robustness Evaluation of Common Information Exploiting Characteristics of Multipath Fading Channel For Handheld Devices. |
| 105. |
An Interpolation Method of Training Data for Indoor WLAN Positioning System
The development of wireless LAN-based positioning technologies has been proceeding to realize indoor location-depended services that require high positioning accuracy. In this paper, we propose an interpolation method of training data for location fingerprinting to reduce the cost required for building the training data. More specifically, a critical problem with location fingerprinting is considerable cost for measuring received signal strengths at every location where the positioning is possible. In the proposed method, a part of the training data is interpolated from data actually observed at several locations using a path loss model considering wall attenuation. Furthermore, to confirm the effectiveness of the proposed method, we examine the performance of location estimation and verify the interpolated data. As compared with a conventional method, the proposed method can improve the positioning accuracy by 15%.. |
| 106. |
An Interpolation Method of Training Data for Indoor WLAN Positioning System
The development of wireless LAN-based positioning technologies has been proceeding to realize indoor location-depended services that require high positioning accuracy. In this paper, we propose an interpolation method of training data for location fingerprinting to reduce the cost required for building the training data. More specifically, a critical problem with location fingerprinting is considerable cost for measuring received signal strengths at every location where the positioning is possible. In the proposed method, a part of the training data is interpolated from data actually observed at several locations using a path loss model considering wall attenuation. Furthermore, to confirm the effectiveness of the proposed method, we examine the performance of location estimation and verify the interpolated data. As compared with a conventional method, the proposed method can improve the positioning accuracy by 15%.. |
| 107. |
A Study on Automatic Setting Switching Technique by Cooperation of Multiple Terminals
With the spread of mobile phones, society has become sensitive about the use of manners. For example, we have been encouraged to turn off our cell phone while riding the train. In addition, you should make silent mode during a movie theater and a meeting. On the other hand, we want to prevent it from missing the notice from a cell-phone while we are in the house or we walk or we put a cell-phone in a bag. Therefore, the technique for switching the setting of the terminal automatically and appropriately is requested. In this study, we propose a method for automatic mode change by performing the coordination around the terminal. In our system, the mode is judged by recognizing surrounding terminals using the location of the terminal, and sharing mode information between those, and calculating the ratio of the manner mode. In this paper, we designed our system and created a simple prototype of the proposed system, conducted experiments and discussion.. |
| 108. |
A Study on Automatic Setting Switching Technique by Cooperation of Multiple Terminals
With the spread of mobile phones, society has become sensitive about the use of manners. For example, we have been encouraged to turn off our cell phone while riding the train. In addition, you should make silent mode during a movie theater and a meeting. On the other hand, we want to prevent it from missing the notice from a cell-phone while we are in the house or we walk or we put a cell-phone in a bag. Therefore, the technique for switching the setting of the terminal automatically and appropriately is requested. In this study, we propose a method for automatic mode change by performing the coordination around the terminal. In our system,the mode is judged by recognizing surrounding terminals using the location of the terminal, and sharing mode information between those, and calculating the ratio of the manner mode. In this paper, we designed our system and created a simple prototype of the proposed system, conducted experiments and discussion.. |
| 109. |
Implementation and Estimation of UDP Broadcast based Reliable Data Transfer Protocol. |
| 110. |
Design and Implementation of Hadoop-based Packet Analyzer for High Volume Packet Data
Traffic analysis based on packet capturing is often used for monitoring and checking network failure. However, it become hard to analyze quickly, because captured packet data has become too huge according to the speed-up of the network itself. In this paper, we propose and implement hadoop-based packet analyzer to deal with huge captured packet data. Proposed system can quickly squeeze a small data set satisfying the condition. In addition, several analysis such as jitter measurement, bit error detection, are realized.. |
| 111. |
Implementation and Estimation of UDP Broadcast based Reliable Data Transfer Protocol. |
| 112. |
Adaptive wireless network selection method based on user's context. |
| 113. |
Dynamic Dictionary Generation Method for Context-aware Input Method Editor
In this paper, we propose a concept of context-aware IME (Input Method Editor) for improving the input of Japanese on mobile devices. In our concept, according to the user's current location, a personal context-aware dictionary is dynamically generated from the keywords gotten via some APIs in the Internet. We propose dynamic dictionary generation method, system architecture, sorting algorithm based on a result of web search. The result of response time of our proto type systems show its effectiveness.. |
| 114. |
Adaptive wireless network selection method based on user's context. |
| 115. |
B-15-13 An Interpolation Method of Training Data for Indoor WLAN Positioning System. |
| 116. |
B-15-14 A Proposal of Observation Data Correction Method for WLAN Positioning System. |
| 117. |
B-15-19 A Distinguishment Scheme for Face-to-Content Situation Using Multiple RSSIs from Access Points. |
| 118. |
B-6-146 A Platform for Sharing Device Information. |
| 119. |
B-6-147 Automatic Manner Mode Switching Technique by Cooperation of Multiple Terminals. |
| 120. |
B-6-57 Deadline-aware data aggregation method for Wireless Sensor Networks with Mobile Sinks. |
| 121. |
B-15-13 An Interpolation Method of Training Data for Indoor WLAN Positioning System. |
| 122. |
B-15-14 A Proposal of Observation Data Correction Method for WLAN Positioning System. |
| 123. |
B-15-19 A Distinguishment Scheme for Face-to-Content Situation Using Multiple RSSIs from Access Points. |
| 124. |
B-6-146 A Platform for Sharing Device Information. |
| 125. |
B-6-147 Automatic Manner Mode Switching Technique by Cooperation of Multiple Terminals. |
| 126. |
B-6-57 Deadline-aware data aggregation method for Wireless Sensor Networks with Mobile Sinks. |
| 127. |
ICT : Producing the Future Society : 12. Intuitive Short-Range Wireless Communication - Toward Communication Technologies Integrated with the Real World -. |
| 128. |
Local Cloud Storage for Short-range Communication in Wireless Environment
In this paper, we propose a local cloud storage which is extemporarily constructed through short-range wireless devices. The proposed storage enables neighbor users to share their own files without the steps of network configuration and setup, and the aid of any backbone network, i.e., the file sharing is realized by only mounting our designed small devices onto users' nodes. We have designed a file sharing protocol for such short-range wireless communication and realized its prototype system.. |
| 129. |
Local Cloud Storage for Short-range Communication in Wireless Environment
In this paper, we propose a local cloud storage which is extemporarily constructed through short-range wireless devices. The proposed storage enables neighbor users to share their own files without the steps of network configuration and setup, and the aid of any backbone network, i.e., the file sharing is realized by only mounting our designed small devices onto users' nodes. We have designed a file sharing protocol for such short-range wireless communication and realized its prototype system.. |
| 130. |
Hybrid Localization Scheme Using Principle Component Analysis in Wireless LAN Environment. |
| 131. |
A common key generation technique based on similarity of received signal strength for secure wireless face-to-face communication
A spread of short-range and infrastructure-less wireless communication devices increases opportunities for temporarily exchanging information in a face-to-face style, called wireless face-to-face communication. In such wireless communication, a critical issue with secure information exchange is encryption key sharing without the aid of any centralized administration. In this paper, we propose a novel key sharing technique for wireless face-to-face communications. The main idea is to generate the same encryption key on a communication pair using received signal strength indicators (RSSI) from observable wireless LAN appliances, rather than distribute a prepared key between the pair. The generation for the same key is realized by utilizing the similarity of RSSI observed within a small area. Furthermore, we examine the successful ratio for generating the same key and consider the security level for the proposed method.. |
| 132. |
Symbolic device for short-range wireless pairwise communication
Laptop computers and cellular phones often have the capability for short-range wireless communication such as adhoc mode in wireless LAN and Bluetooth. However, the use of the capability is limited due to the lack of consideration for short- range communications in conventional communication protocols; i.e., an unnatural and troublesome procedure is required to specify targets especially within a nearby area. In this paper, we propose a symbolic device to support short-range wireless communications that provides the ability to specify a target on the real-world environment. More specifically, a short-range communication device is logically concerned with its corresponding symbolic device and the short-range communication with a target is established by linking the symbol device with the target directly or indirectly. Furthermore, we designed and implemented a prototype system for the proposed device using wired and wireless LAN.. |
| 133. |
A common key generation technique based on similarity of received signal strength for secure wireless face-to-face communication
A spread of short-range and infrastructure-less wireless communication devices increases opportunities for temporarily exchanging information in a face-to-face style, called wireless face-to-face communication. In such wireless communication, a critical issue with secure information exchange is encryption key sharing without the aid of any centralized administration. In this paper, we propose a novel key sharing technique for wireless face-to-face communications. The main idea is to generate the same encryption key on a communication pair using received signal strength indicators (RSSI) from observable wireless LAN appliances, rather than distribute a prepared key between the pair. The generation for the same key is realized by utilizing the similarity of RSSI observed within a small area. Furthermore, we examine the successful ratio for generating the same key and consider the security level for the proposed method.. |
| 134. |
Symbolic device for short-range wireless pairwise communication
Laptop computers and cellular phones often have the capability for short-range wireless communication such as adhoc mode in wireless LAN and Bluetooth. However, the use of the capability is limited due to the lack of consideration for short- range communications in conventional communication protocols; i.e., an unnatural and troublesome procedure is required to specify targets especially within a nearby area. In this paper, we propose a symbolic device to support short-range wireless communications that provides the ability to specify a target on the real-world environment. More specifically, a short-range communication device is logically concerned with its corresponding symbolic device and the short-range communication with a target is established by linking the symbol device with the target directly or indirectly. Furthermore, we designed and implemented a prototype system for the proposed device using wired and wireless LAN.. |
| 135. |
Extraction of Location Dependent Words from Twitter Logs. |
| 136. |
Extraction of Location Dependent Words from Twitter Logs. |
| 137. |
Dynamic Packet (Frame) Based Ranging Method for Active Optical Access Network. |
| 138. |
Authentication Technique Using Generation Method of Secret Information Based on Characteristics of Multipath Fading Channel. |
| 139. |
Channel Assignment for Positioning System in Wireless Mesh Networks. |
| 140. |
Authentication Technique Using Generation Method of Secret Information Based on Characteristics of Multipath Fading Channel
In this paper, we propose an authentication technique which is based on the generation technique of common information exploiting characteristics of multipath fading channel for handheld devices. The main idea of the proposed technique is to extract the underlying wireless channel characteristics from the multipath fading of broadcast communication, and authenticate the communication pair whether the information extracted on the sender is the same as that on the receiver or not; the agreement would be achieved between only a regular communication pair by using the generation technique of common information. Moreover, the proposed method can prevent spoofing attack and man-in-the-middle attack by employing a broadcast-based authentication protocol. Finally, we evaluate the effectiveness of the proposed method by checking a safety against various attacks.. |
| 141. |
Channel Assignment for Positioning System in Wireless Mesh Networks
In this paper, we propose a novel channel assignment for positioning system in wireless mesh networks. In wireless mesh networks, for avoiding radio wave interference from other access points, different access points, that are within transmission range of each other, are required to operate on different channels. On the other hand, as for realizing highly accurate position estimation, the different access points need to use a single channel, since as many access points as possible can measure wireless transmissions on the same channel from a mobile device. We aim to achieve a network system that can realize both broadband communication and accurate localization in wireless mesh networks. The proposed method strikes a balance between the two conflicting objectives on the channel assignment.. |
| 142. |
Authentication Technique Using Generation Method of Secret Information Based on Characteristics of Multipath Fading Channel
In this paper, we propose an authentication technique which is based on the generation technique of common information exploiting characteristics of multipath fading channel for handheld devices. The main idea of the proposed technique is to extract the underlying wireless channel characteristics from the multipath fading of broadcast communication, and authenticate the communication pair whether the information extracted on the sender is the same as that on the receiver or not; the agreement would be achieved between only a regular communication pair by using the generation technique of common information. Moreover, the proposed method can prevent spoofing attack and man-in-the-middle attack by employing a broadcast-based authentication protocol. Finally, we evaluate the effectiveness of the proposed method by checking a safety against various attacks.. |
| 143. |
Channel Assignment for Positioning System in Wireless Mesh Networks
In this paper, we propose a novel channel assignment for positioning system in wireless mesh networks. In wireless mesh networks, for avoiding radio wave interference from other access points, different access points, that are within transmission range of each other, are required to operate on different channels. On the other hand, as for realizing highly accurate position estimation, the different access points need to use a single channel, since as many access points as possible can measure wireless transmissions on the same channel from a mobile device. We aim to achieve a network system that can realize both broadband communication and accurate localization in wireless mesh networks. The proposed method strikes a balance between the two conflicting objectives on the channel assignment.. |
| 144. |
Traffic Reduction Using Data Aggregation for Positioning System on Wireless Mesh Network. |
| 145. |
Generation Technique of Secret Information for Handheld Devices Exploiting Characteristics of Multipath Fading Channel. |
| 146. |
Traffic Reduction Using Data Aggregation for Positioning System on Wireless Mesh Network. |
| 147. |
Generation Technique of Secret Information for Handheld Devices Exploiting Characteristics of Multipath Fading Channel. |
| 148. |
Direction Estimation Method for a Photographic Subject by Using Directivity Wireless LAN Antenna. |
| 149. |
Traffic Reduction Using Data Aggregation for Positioning System on Wireless Mesh Network
In this paper, we propose a reduction technique for traffic overhead occured in location estimation for wireless mesh networks. For realizing the localization, a server has to collect the data for received signal strength observed in all access points through the mesh network. The communication overhead for the collection can stress the network, which leads to the interference with data communication mainly intended by the network. The main idea of the proposed method is to decentralize the calculation required for the localization. The communication can be reduced by aggregating and relaying partial calculated results rather than raw observation data. Furthermore, we evaluate the effectiveness of the proposed method by simulation.. |
| 150. |
Direction estimation method for a photographic subject by using directivity wireless LAN antenna. |
| 151. |
Direction Estimation Method for a Photographic Subject by Using Directivity Wireless LAN Antenna. |
| 152. |
Traffic Reduction Using Data Aggregation for Positioning System on Wireless Mesh Network
In this paper, we propose a reduction technique for traffic overhead occured in location estimation for wireless mesh networks. For realizing the localization, a server has to collect the data for received signal strength observed in all access points through the mesh network. The communication overhead for the collection can stress the network, which leads to the interference with data communication mainly intended by the network. The main idea of the proposed method is to decentralize the calculation required for the localization. The communication can be reduced by aggregating and relaying partial calculated results rather than raw observation data. Furthermore, we evaluate the effectiveness of the proposed method by simulation.. |
| 153. |
Generation Technique of Secret Information for Handheld Devices Exploiting Characteristics of Multipath Fading Channel
An explosive spread of handheld devices with wireless communication capability, such as smart phone and cellular phone, rapidly increases opportunity for data communication using ad-hoc short-range wireless network. An easy realization of secure communication in such network is indispensable to user-friendly networking environment towards next generation ubiquitous computing. In this paper, we propose an encryption key sharing technique which generates the same encryption key on a communication pair rather than distribute a prepared key from one to the other. The main idea of the proposed technique is to generate the key based on the variation of multipath fading channel caused by shaking a sender-receiver pair. Furthermore, we construct a prototype system realizing the proposed technique and evaluate the effectiveness of it in an actual environment.. |
| 154. |
B-15-18 On Improvement of Response Time for Network-Based Context-Aware Japanese Input Method Editor. |
| 155. |
B-15-25 Traffic Reduction for Location Estimation in Wireless Mesh Network. |
| 156. |
B-15-8 Infrared Remote Control Assist for Intuitive Device Selection. |
| 157. |
B-15-9 Object Direction Estimation by Detecting Signal Peak Using Directivity Wireless LAN Antenna. |
| 158. |
Relational Analysis between User Context and Input Word on Twitter. |
| 159. |
Relational analysis between user context and input word on Twitter. |
| 160. |
B-15-18 On Improvement of Response Time for Network-Based Context-Aware Japanese Input Method Editor. |
| 161. |
B-15-25 Traffic Reduction for Location Estimation in Wireless Mesh Network. |
| 162. |
B-15-8 Infrared Remote Control Assist for Intuitive Device Selection. |
| 163. |
B-15-9 Object Direction Estimation by Detecting Signal Peak Using Directivity Wireless LAN Antenna. |
| 164. |
Relational Analysis between User Context and Input Word on Twitter. |
| 165. |
Relational analysis between user context and input word on Twitter. |
| 166. |
Implementation of Network-based Context-aware Japanese Input Method Editor
We have proposed a network-based context-aware Japanese input method editor to enhance user's comfortability at text inputting on mobile devices. In this paper, we describe the detail of our implementations, including the prototype with a location information, and the preliminary experiment for verifying a relationship between a location and an input sentence.. |
| 167. |
Implementation of Network-based Context-aware Japanese Input Method Editor
We have proposed a network-based context-aware Japanese input method editor to enhance user's comfortability at text inputting on mobile devices. In this paper, we describe the detail of our implementations, including the prototype with a location information, and the preliminary experiment for verifying a relationship between a location and an input sentence.. |
| 168. |
Network-based Context-Aware Japanese Input Method Editor
In this paper, we propose a context-aware IME (Input Method Editor) for improving the input of Japanese on mobile devices. In our proposed IME, it estimates the context of users according to a position information from GPS (Global Positioning System) sensor or a presence information from the Internet. Simultaneously, it generates a personal context-aware dictionary dynamically from the keywords gotten via some APIs in the Internet. Currently, the information of user's context is also provided by NGN. In this paper, we explain the overview of our proposal and our prototype implementation.. |
| 169. |
Network-based Context-Aware Japanese Input Method Editor
In this paper, we propose a context-aware IME (Input Method Editor) for improving the input of Japanese on mobile devices. In our proposed IME, it estimates the context of users according to a position information from GPS (Global Positioning System) sensor or a presence information from the Internet. Simultaneously, it generates a personal context-aware dictionary dynamically from the keywords gotten via some APIs in the Internet. Currently, the information of user's context is also provided by NGN. In this paper, we explain the overview of our proposal and our prototype implementation.. |
| 170. |
B-15-11 A Filtering Method for Probe Requests in WLAN-based Localization System. |
| 171. |
B-15-18 A Study on Estimation Method Based on Structural Feature for Indoor WLAN Positioning System. |
| 172. |
B-15-11 A Filtering Method for Probe Requests in WLAN-based Localization System. |
| 173. |
B-15-18 A Study on Estimation Method Based on Structural Feature for Indoor WLAN Positioning System. |
| 174. |
A Study on Error Correction Technique for Wireless LAN Based Location Estimation
In this paper, we report experimental results for the impact of environmental dynamics to variations of received signal strength for network-based location estimation. In network-based location estimation, the position of a client can be determined by using signal strength of the client's frame transmissions sniffed at several access points. The client does not require dedicated equipments and software to realize the network-based location estimation. In this experiment, we examine the variations of received signal strength affected by differences among wireless LAN devices, radio interference, movements of people, and temporal environmental variations. Additionally, we consider an error correction technique in network-based location estimation to deal with the unpredictable variations.. |
| 175. |
A Study on Error Correction Technique for Wireless LAN Based Location Estimation
In this paper, we report experimental results for the impact of environmental dynamics to variations of received signal strength for network-based location estimation. In network-based location estimation, the position of a client can be determined by using signal strength of the client's frame transmissions sniffed at several access points. The client does not require dedicated equipments and software to realize the network-based location estimation. In this experiment, we examine the variations of received signal strength affected by differences among wireless LAN devices, radio interference, movements of people, and temporal environmental variations. Additionally, we consider an error correction technique in network-based location estimation to deal with the unpredictable variations.. |
| 176. |
Proposal and Implementation of Feature Model Drawing Algorithm
The feature model can contain hundreds of features, that makes it impossible to be manually organized in an easy-to understand mannar. And a lot of tree-drawing algorithms have been proposed so far, but they can not be used to draw feature model directly. This is because these algorithms draw a tree based on general graph topologies, not on feature meanings. In this paper, we propose a drawing algorithm designed for feature model. The propose algorithm can draw the formatted hierarchical graph based on the relationship between features for a given feature model. We have implemented it and confirmed that the graph generated by the algorithm is clearly organized while keeping the feature meanings.. |
| 177. |
Proposal and Implementation of Feature Model Drawing Algorithm
The feature model can contain hundreds of features, that makes it impossible to be manually organized in an easy-to understand mannar. And a lot of tree-drawing algorithms have been proposed so far, but they can not be used to draw feature model directly. This is because these algorithms draw a tree based on general graph topologies, not on feature meanings. In this paper, we propose a drawing algorithm designed for feature model. The propose algorithm can draw the formatted hierarchical graph based on the relationship between features for a given feature model. We have implemented it and confirmed that the graph generated by the algorithm is clearly organized while keeping the feature meanings.. |
| 178. |
B-8-31 An Evaluation on Optical Switch Element in Active Optical Access System. |
| 179. |
A Proposal of A uGrid Multi-Service Video Delivery Network Considers Security
With the advance of ubiquitous society including IPv6, we assume the world that everything has an IP address and connect to the networks. In recent years, based on the above assumptions, a concept of the ubiquitous grid network environment (uGrid) has been generated. In uGrid, we define everything all over the world given IP address as a service parts. Users will freely search for service parts that they want to use from all over the world through the networks, and then, they combine each parts so that they can construct a desired distributed system, service, and working environment. So, in this study, we propose the Multi-Service Video Delivery Network for the uGrid service, which is different from the unidirectional video delivery system like a existing TV reception and enable to response to various QoS (Quality of Service) watching demands. Moreover, we attempt to construct a video filtering transmission system using PLAYSTATION 3 (PS3) as a part of the delivery service, in which we consider the needs of the individual privacy protection and the increase of the home-use game consoles or Cell Broadband Engine (Cell) in uGrid. As a result of that, we confirmed that the PS3 functioned as a service parts of the video delivery system in uGrid.. |
| 180. |
Service Parts Connection based on Dynamic Lightpath Establishment in uGrid
With the advance of ubiquitous society, it is expected that everything will be connected to the network. Then, a ubiquitous grid networking environment (uGrid) has been proposed. In this environment, everything is defined as service parts and some service parts will be combined to provide new service for users. On the other hand, TV broadcast is one of the typical image distribution system that broadcasts contents to users. Thus, there are limitations by one-way system. In this paper, we propose next generation image distribution system in uGrid as a replacement of TV broadcast. In proposal, service parts are connected by lightpath which set up with GMPLS so that fixed bandwidth can be kept. As an emulation of proposal system, we implement the experimental environment which composed by Layer 2 switch and we demonstrate potential of service parts connection in proposal.. |
| 181. |
Parameter Design and Dynamic Slot Assignment considering TCP Throughput on Active Optical Access Network
We study a novel optical access network with active optical switches as next generation access network, called Active Optical Network (ActiON). In ActiON, a data is transmitted by fixed-length time, called "slot". So, in this paper, we focus on the parameter design of number of slots and transmission cycle considering TCP throughput, and dynamic slot assignment by periodically changing the number of allocation slots.. |
| 182. |
Distributed Wavelength Allocation Scheme Considering Four Wave Mixing in All Optical Networks
In this paper a novel distributed wavelength allocation scheme considering the four wave mixing (FWM) in all optical network is proposed. A main feature of the proposed scheme is that wavelengths are allocated by the wide interval as much as possible with considering wavelength usage condition of each link. Allocated wavelengths are calculated by a proposed expression wavelength intervals. Because of keeping the wide wavelength interval, the propose scheme can avoid using adjacent wavelengths and, can restrain generation of FWM. Evaluation results of the blocking probability are presented. It is indicated that the proposed scheme can improve the blocking probability values.. |
| 183. |
B-8-31 An Evaluation on Optical Switch Element in Active Optical Access System. |
| 184. |
A Proposal of A uGrid Multi-Service Video Delivery Network Considers Security
With the advance of ubiquitous society including IPv6, we assume the world that everything has an IP address and connect to the networks. In recent years, based on the above assumptions, a concept of the ubiquitous grid network environment (uGrid) has been generated. In uGrid, we define everything all over the world given IP address as a service parts. Users will freely search for service parts that they want to use from all over the world through the networks, and then, they combine each parts so that they can construct a desired distributed system, service, and working environment. So, in this study, we propose the Multi-Service Video Delivery Network for the uGrid service, which is different from the unidirectional video delivery system like a existing TV reception and enable to response to various QoS (Quality of Service) watching demands. Moreover, we attempt to construct a video filtering transmission system using PLAYSTATION 3 (PS3) as a part of the delivery service, in which we consider the needs of the individual privacy protection and the increase of the home-use game consoles or Cell Broadband Engine (Cell) in uGrid. As a result of that, we confirmed that the PS3 functioned as a service parts of the video delivery system in uGrid.. |
| 185. |
Service Parts Connection based on Dynamic Lightpath Establishment in uGrid
With the advance of ubiquitous society, it is expected that everything will be connected to the network. Then, a ubiquitous grid networking environment (uGrid) has been proposed. In this environment, everything is defined as service parts and some service parts will be combined to provide new service for users. On the other hand, TV broadcast is one of the typical image distribution system that broadcasts contents to users. Thus, there are limitations by one-way system. In this paper, we propose next generation image distribution system in uGrid as a replacement of TV broadcast. In proposal, service parts are connected by lightpath which set up with GMPLS so that fixed bandwidth can be kept. As an emulation of proposal system, we implement the experimental environment which composed by Layer 2 switch and we demonstrate potential of service parts connection in proposal.. |
| 186. |
Parameter Design and Dynamic Slot Assignment considering TCP Throughput on Active Optical Access Network
We study a novel optical access network with active optical switches as next generation access network, called Active Optical Network (ActiON). In ActiON, a data is transmitted by fixed-length time, called "slot". So, in this paper, we focus on the parameter design of number of slots and transmission cycle considering TCP throughput, and dynamic slot assignment by periodically changing the number of allocation slots.. |
| 187. |
Distributed Wavelength Allocation Scheme Considering Four Wave Mixing in All Optical Networks
In this paper a novel distributed wavelength allocation scheme considering the four wave mixing (FWM) in all optical network is proposed. A main feature of the proposed scheme is that wavelengths are allocated by the wide interval as much as possible with considering wavelength usage condition of each link. Allocated wavelengths are calculated by a proposed expression wavelength intervals. Because of keeping the wide wavelength interval, the propose scheme can avoid using adjacent wavelengths and, can restrain generation of FWM. Evaluation results of the blocking probability are presented. It is indicated that the proposed scheme can improve the blocking probability values.. |
| 188. |
Queuing Method for Guaranteed Delay Jitter in Wide Area Ethernet
In recent years, Wide Area Ethernet has become widespread. Wide Area Ethernet is a technique which was expanded from the Ethernet to connect two separated bases using Ethernet. Because Ethernet is a technique for Local Area Networks (LANs), we need a queuing method which controls bandwidth, delay, and delay jitter to use real-time applications in Wide Area Ethernet. The conventional method named Deficit Round Robin (DRR) can control bandwidth and delay. In DRR, a Deficit Counter (DC) is set at each queue to control the frame size which the queue is able to send. However, it is difficult to control the delay jitter which greatly affects strictly real-time applications like haptic technology. Accordingly, we propose a method named Loan-Deficit Round Robin (L-DRR). L-DRR controls bandwidth, delay, and delay jitter using not only DC but also a Loan Counter (LC) to control the maximum delay. Finally, we show how our method affects delay jitter using a computation simulation.. |
| 189. |
Queuing Method for Guaranteed Delay Jitter in Wide Area Ethernet
In recent years, Wide Area Ethernet has become widespread. Wide Area Ethernet is a technique which was expanded from the Ethernet to connect two separated bases using Ethernet. Because Ethernet is a technique for Local Area Networks (LANs), we need a queuing method which controls bandwidth, delay, and delay jitter to use real-time applications in Wide Area Ethernet. The conventional method named Deficit Round Robin (DRR) can control bandwidth and delay. In DRR, a Deficit Counter (DC) is set at each queue to control the frame size which the queue is able to send. However, it is difficult to control the delay jitter which greatly affects strictly real-time applications like haptic technology. Accordingly, we propose a method named Loan-Deficit Round Robin (L-DRR). L-DRR controls bandwidth, delay, and delay jitter using not only DC but also a Loan Counter (LC) to control the maximum delay. Finally, we show how our method affects delay jitter using a computation simulation.. |
| 190. |
Fast Solution of Link Disjoint Path Algorithm on Parallel Reconfigurable Processor DAPDNA-2
In next generation network, a high level reliabilty is strong required. In a protection, which is the one of network survivable technology, it is important to use a link-disjoint paths pair of lowest total cost in a view of network resource efficiency. However, the link-disjoint paths pair calculation is NP Complete and it takes great investment of time. In order to solve this problem, we propose a high-speed method of link-disjoint paths pair calculation based on parallel reconfigurable processor. Our proposed method calculates and finds all paths in network from all network link patterns, and then calculates all link-disjoint paths pairs and selects optimal solution. A parallel execution and data flow execution enable our propose to high-speed calculations. A two performance evaluation results show that our proposed method improves calculation time more than 20 times compared to conventional optimal link-disjoint paths pair calculation algorithm.. |
| 191. |
Fast Solution of Link Disjoint Path Algorithm on Parallel Reconfigurable Processor DAPDNA-2
In next generation network, a high level reliabilty is strong required. In a protection, which is the one of network survivable technology, it is important to use a link-disjoint paths pair of lowest total cost in a view of network resource efficiency. However, the link-disjoint paths pair calculation is NP Complete and it takes great investment of time. In order to solve this problem, we propose a high-speed method of link-disjoint paths pair calculation based on parallel reconfigurable processor. Our proposed method calculates and finds all paths in network from all network link patterns, and then calculates all link-disjoint paths pairs and selects optimal solution. A parallel execution and data flow execution enable our propose to high-speed calculations. A two performance evaluation results show that our proposed method improves calculation time more than 20 times compared to conventional optimal link-disjoint paths pair calculation algorithm.. |
| 192. |
Experiments of transport and control protocols for next generation wide area Layer2 networks
As increasing Ethernet service users and enhancing service functions, a next generation wide area layer2 network beyond the state-of-the-art carrier grade Ethernet is expected. For realizing the next generation layer2 network (NGL2), we have proposed new layer2 protocol technologies based on Ethernet technologies and have developed elemental functional systems. In this article, a newly developed NGL2 prototype system is reported. The prototype system provides an in-band message communication channel (IMCC) function, Mac-in-Mac frame transport mechanism, and GMPLS based layer2 path control functions.. |
| 193. |
Fast Solution of Link Disjoint Path Algorithm on Parallel Reconfigurable Processor DAPDNA-2
In next generation network, a high level reliabilty is strong required. In a protection, which is the one of network survivable technology, it is important to use a link-disjoint paths pair of lowest total cost in a view of network resource efficiency. However, the link-disjoint paths pair calculation is NP Complete and it takes great investment of time. In order to solve this problem, we propose a high-speed method of link-disjoint paths pair calculation based on parallel reconfigurable processor. Our proposed method calculates and finds all paths in network from all network link patterns, and then calculates all link-disjoint paths pairs and selects optimal solution. A parallel execution and data flow execution enable our propose to high-speed calculations. A two performance evaluation results show that our proposed method improves calculation time more than 20 times compared to conventional optimal link-disjoint paths pair calculation algorithm.. |
| 194. |
Fast Solution of Link Disjoint Path Algorithm on Parallel Reconfigurable Processor DAPDNA-2
In next generation network, a high level reliabilty is strong required. In a protection, which is the one of network survivable technology, it is important to use a link-disjoint paths pair of lowest total cost in a view of network resource efficiency. However, the link-disjoint paths pair calculation is NP Complete and it takes great investment of time. In order to solve this problem, we propose a high-speed method of link-disjoint paths pair calculation based on parallel reconfigurable processor. Our proposed method calculates and finds all paths in network from all network link patterns, and then calculates all link-disjoint paths pairs and selects optimal solution. A parallel execution and data flow execution enable our propose to high-speed calculations. A two performance evaluation results show that our proposed method improves calculation time more than 20 times compared to conventional optimal link-disjoint paths pair calculation algorithm.. |
| 195. |
Experiments of transport and control protocols for next generation wide area Layer2 networks
As increasing Ethernet service users and enhancing service functions, a next generation wide area layer2 network beyond the state-of-the-art carrier grade Ethernet is expected. For realizing the next generation layer2 network (NGL2), we have proposed new layer2 protocol technologies based on Ethernet technologies and have developed elemental functional systems. In this article, a newly developed NGL2 prototype system is reported. The prototype system provides an in-band message communication channel (IMCC) function, Mac-in-Mac frame transport mechanism, and GMPLS based layer2 path control functions.. |
| 196. |
Satoru Okamoto, Sho Shimizu, Yutaka Arakawa, Naoaki Yamanaka, Experiment of the In-band Message Communication Channel for GMPLS controlled Ethernet, 2008 34th European Conference on Optical Communication, ECOC 2008, 2008.12, In-band Message Communication Channel, which can transport IP packets, for GMPLS protocols is implemented. The prototype system with Mac-in-Mac Ethernet transport mechanism and GMPLS Ethernet control is successfully demonstrated.. |
| 197. |
Shimizu Sho, Kihara Taku, Yutaka Arakawa, Yamanaka Naoaki, Shiba Kosuke, Hardware based scalable path computation engine for multilayer traffic engineering in GMPLS networks, 2008 34th European Conference on Optical Communication, ECOC 2008, 2008.12, A parallel data-flow hardware based path computation engine that makes multilayer traffic engineering more scalable is proposed. The engine achieves 100 times faster than conventional path computation scheme.. |
| 198. |
New Generation P2P Networks based on Dynamic Path Establishment with GMPLS
Today, advanced network architectures like NGN are growing rapidly. These network architectures realize active bandwidth control from network application. Bandwidth control scheme makes broadband network architecture more beneficial. In this paper, we design and implement New Generation P2P Networks based on Dynamic Path Establishment with GMPLS. We show the effectiveness of our designed advanced P2P network architecture by computation simulation. We also show that our P2P network architecture is suitable for rich contents delivery by implementation.. |
| 199. |
Network Reconfigure Algorithm With Least Resource For Energy Efficient Optical Network
The Internet has been popular recently, and network traffic of the Inter net is growing. The power consumpution is an issue. The large part of power consumption in network equipments is consumed in idle time, so Ehternet interface rate changes on needs. However, optical interface rate can't change because of technical reason. The approach to sleep port itself is needed. We proposed a network reconfiguration algorithm for reducing power consumption. Network is used minimum set of link which can transfer all communication traffic load. Our proposal is not heuristic, but can obtains optimized solution.. |
| 200. |
New Generation P2P Networks based on Dynamic Path Establishment with GMPLS
Today, advanced network architectures like NGN are growing rapidly. These network architectures realize active bandwidth control from network application. Bandwidth control scheme makes broadband network architecture more beneficial. In this paper, we design and implement New Generation P2P Networks based on Dynamic Path Establishment with GMPLS. We show the effectiveness of our designed advanced P2P network architecture by computation simulation. We also show that our P2P network architecture is suitable for rich contents delivery by implementation.. |
| 201. |
Network Reconfigure Algorithm With Least Resource For Energy Efficient Optical Network
The Internet has been popular recently, and network traffic of the Inter net is growing. The power consumpution is an issue. The large part of power consumption in network equipments is consumed in idle time, so Ehternet interface rate changes on needs. However, optical interface rate can't change because of technical reason. The approach to sleep port itself is needed. We proposed a network reconfiguration algorithm for reducing power consumption. Network is used minimum set of link which can transfer all communication traffic load. Our proposal is not heuristic, but can obtains optimized solution.. |
| 202. |
高 山, 木原 拓, 清水 翔, 荒川 豊, 山中 直明, 山中 直明, 斯波 康祐, ダイナミックリコンフィギュラブルプロセッサDAPDNA-2上のオンチップ仮想ネットワークによる新しいネットワーク最適化手法, 電子情報通信学会技術研究報告. RECONF, リコンフィギャラブルシステム : IEICE technical report, 2008.11, 本論文ではリコンフィギュラブルプロセッサ上に構築したオンチップ仮想ネットワークによる新しいトラヒックエンジニアリング手法を提案する。次世代ネットワークでは、ネットワーク最適手法としてリンクコストだけではなく、複数のメトリックを考慮したトラヒックエンジニアリングがより重要となる。複数のメトリックを考慮する場合、最適な経路を求めるときの計算量が増えるため、より高速なトラヒックエンジニアリング手法が必要となる。我々は従来の数学的な手法と違い、DAPDNA-2上の複数のPEを利用して、仮想リンクと仮想ノードからなる仮想ネットワークを構築し、パケットの動きによって現実のトラフィック変動を求めるという実験な手法により高速化を狙う。第一段階として、チップ上への仮想ネットワークの実装と、仮想ネットワークを用いた最短経路探索とディスジョイント経路探索を行い、動作を確認した。. |
| 203. |
高 山, 木原 拓, 清水 翔, 荒川 豊, 山中 直明, 山中 直明, 斯波 康祐, ダイナミックリコンフィギュラブルプロセッサDAPDNA-2上のオンチップ仮想ネットワークによる新しいネットワーク最適化手法, 電子情報通信学会技術研究報告. RECONF, リコンフィギャラブルシステム : IEICE technical report, 2008.11, 本論文ではリコンフィギュラブルプロセッサ上に構築したオンチップ仮想ネットワークによる新しいトラヒックエンジニアリング手法を提案する。次世代ネットワークでは、ネットワーク最適手法としてリンクコストだけではなく、複数のメトリックを考慮したトラヒックエンジニアリングがより重要となる。複数のメトリックを考慮する場合、最適な経路を求めるときの計算量が増えるため、より高速なトラヒックエンジニアリング手法が必要となる。我々は従来の数学的な手法と違い、DAPDNA-2上の複数のPEを利用して、仮想リンクと仮想ノードからなる仮想ネットワークを構築し、パケットの動きによって現実のトラフィック変動を求めるという実験な手法により高速化を狙う。第一段階として、チップ上への仮想ネットワークの実装と、仮想ネットワークを用いた最短経路探索とディスジョイント経路探索を行い、動作を確認した。. |
| 204. |
Hierarchical and Cooperative Download Method with File Partitioning for Mitigating Contents Server Load in Contents Delivery Network
We propose a two step delivery method to reduce contents server load for large size content delivery. In our proposed method, a receiver receives a part of desired content from already content downloaded nodes (collaboration nodes). Furthermore, they transfer the received content to other receivers each other coordinately to gather the rest of the content. By applying our proposed method, contents server load can be reduced and download speed can be improved with using the upload bandwidth of some collaboration node and receivers effectively. Also we evaluate the performance by computer simulation. The results shows that the download time is reduced.. |
| 205. |
Delay-Aware Scale-Free Display System under Widely Distributed Computing Network
New Scalable diplay system using distributed conputing power and broad band netowark is proposed. Tiled display system which can visualize large high-resolution images has been becoming famous. However, the more display size grow large, the more hard to establish the system. Also, a study of widely distributed computing or Grid computing has been growing. In this paper, we propose scale-free display system under distributed computing network and optical broad band network. In proposed system, computing resources are widely distributed in the network, so distances from each computing resource to the tiled display are different. Thus, to synchronize all frames of image, computing resources which have almost same delay to the tiled display have to be selected in case that the system starts. For this reason, we consider the method to select the computing resources. Also we examine the characteristic of delay in power-law network under the assumption that the porposed system will be applied to power-law network.. |
| 206. |
Hierarchical and Cooperative Download Method with File Partitioning for Mitigating Contents Server Load in Contents Delivery Network
We propose a two step delivery method to reduce contents server load for large size content delivery. In our proposed method, a receiver receives a part of desired content from already content downloaded nodes (collaboration nodes). Furthermore, they transfer the received content to other receivers each other coordinately to gather the rest of the content. By applying our proposed method, contents server load can be reduced and download speed can be improved with using the upload bandwidth of some collaboration node and receivers effectively. Also we evaluate the performance by computer simulation. The results shows that the download time is reduced.. |
| 207. |
Delay-Aware Scale-Free Display System under Widely Distributed Computing Network
New Scalable diplay system using distributed conputing power and broad band netowark is proposed. Tiled display system which can visualize large high-resolution images has been becoming famous. However, the more display size grow large, the more hard to establish the system. Also, a study of widely distributed computing or Grid computing has been growing. In this paper, we propose scale-free display system under distributed computing network and optical broad band network. In proposed system, computing resources are widely distributed in the network, so distances from each computing resource to the tiled display are different. Thus, to synchronize all frames of image, computing resources which have almost same delay to the tiled display have to be selected in case that the system starts. For this reason, we consider the method to select the computing resources. Also we examine the characteristic of delay in power-law network under the assumption that the porposed system will be applied to power-law network.. |
| 208. |
Experiment of the in-band GMPLS message Channel for GELS network
For realizing the carrier grade GMPLS controlled Ethernet, a data communication network (DCN) based on the in-fiber in-band communication channel technique should be realized. In this article, a GMPLS controlled Ethernet switch prototype system which supports in-fiber in-band DCN is reported. The prototype system provides an in-band message communication channel (IMCC) function, Mac-in-Mac frame transport mechanism, and VLAN path control function.. |
| 209. |
A study on optical access network with active optical switches
We study a novel optical access network architecture with active optical switches that is not the enhancement of Passive Optical Network (PON). Our proposed architecture can increase the number of subscribers per Optical Line Terminal (OLT) as well as stretch the distance between OLT and Optical Network Units (ONUs). In this paper, we focus on the discovery process of Multi-Point Control Protocol (MPCP) defined in IEEE 802.3av.. |
| 210. |
Network Reconfigure Algorithm for Low Power Consumption
New network reconfigure algorithm for low power consumption is proposed. Network is used minimum set of node and link which can transfer all communication traffic. Set-covered problem is applied to this algorithm and all links are modeled as "1"/on and "0/off". New parallel data flow type reconfigurable processer, DAPDNA is applied to solve this problem efficiently. The evaluation results show the 2 decade faster calculation than conventional method.. |
| 211. |
A Study on High Speed Method of Link-Disjoint Path Calculation : A Parallel Multi-layer Path Calculation on DAPDNA-2
K Disjoint-Paths Pairs (KDPPs) is widely used as a link-disjoint path search algorithm to keep survivability. It is known that KDPPs often fails to obtain optimal solution. However, there is few resarches which discuss that issue. Therefore, the accuracy of KDPPs on various topology is investigated in this paper. We propose a parallel link-disjoint path search algorithm for multi-layer networks. Simulation results show that the calculation time of the proposed algorithm decreases by 99.6% compared to KDPPs.. |
| 212. |
Experiment of the in-band GMPLS message Channel for GELS network
For realizing the carrier grade GMPLS controlled Ethernet, a data communication network (DCN) based on the in-fiber in-band communication channel technique should be realized. In this article, a GMPLS controlled Ethernet switch prototype system which supports in-fiber in-band DCN is reported. The prototype system provides an in-band message communication channel (IMCC) function, Mac-in-Mac frame transport mechanism, and VLAN path control function.. |
| 213. |
A study on optical access network with active optical switches
We study a novel optical access network architecture with active optical switches that is not the enhancement of Passive Optical Network (PON). Our proposed architecture can increase the number of subscribers per Optical Line Terminal (OLT) as well as stretch the distance between OLT and Optical Network Units (ONUs). In this paper, we focus on the discovery process of Multi-Point Control Protocol (MPCP) defined in IEEE 802.3av.. |
| 214. |
Network Reconfigure Algorithm for Low Power Consumption
New network reconfigure algorithm for low power consumption is proposed. Network is used minimum set of node and link which can transfer all communication traffic. Set-covered problem is applied to this algorithm and all links are modeled as "1"/on and "0/off". New parallel data flow type reconfigurable processer, DAPDNA is applied to solve this problem efficiently. The evaluation results show the 2 decade faster calculation than conventional method.. |
| 215. |
A Study on High Speed Method of Link-Disjoint Path Calculation : A Parallel Multi-layer Path Calculation on DAPDNA-2
K Disjoint-Paths Pairs (KDPPs) is widely used as a link-disjoint path search algorithm to keep survivability. It is known that KDPPs often fails to obtain optimal solution. However, there is few resarches which discuss that issue. Therefore, the accuracy of KDPPs on various topology is investigated in this paper. We propose a parallel link-disjoint path search algorithm for multi-layer networks. Simulation results show that the calculation time of the proposed algorithm decreases by 99.6% compared to KDPPs.. |
| 216. |
Approach of flexible-switch for next-generation layer-2 networks
This paper proposes a flexible switch for constructing of next-generation layer-2 networks. The proposed switch can dynamically implement a new service and a new protocol. A wide-area layer-2 network will provide many kinds of services including end-to-end QoS guarantees, protection mechanisms, and performance monitoring. When new protocols are developed, it is necessary to compatible them with existing networks. Thus, a complicated network structure and complicated protocol processing are introduced into the network. By using the flexible switch, protocol developers can design it freely, and propose the best protocol. Moreover, the next generation layer-2 networks will be controlled by GMPLS (Generalized Multi-Protocol Label Switching). Then, by using the flexible switch, we implemented that the switch loads a necessary function to provide the requested services when a LSP (Label Switched Path) is established by RSVP-TE. In this implementation, we realized the dynamic construction of the switch processing and the establishment of the LSP that adapted the services.. |
| 217. |
Approach of flexible-switch for next-generation layer-2 networks
This paper proposes a flexible switch for constructing of next-generation layer-2 networks. The proposed switch can dynamically implement a new service and a new protocol. A wide-area layer-2 network will provide many kinds of services including end-to-end QoS guarantees, protection mechanisms, and performance monitoring. When new protocols are developed, it is necessary to compatible them with existing networks. Thus, a complicated network structure and complicated protocol processing are introduced into the network. By using the flexible switch, protocol developers can design it freely, and propose the best protocol. Moreover, the next generation layer-2 networks will be controlled by GMPLS (Generalized Multi-Protocol Label Switching). Then, by using the flexible switch, we implemented that the switch loads a necessary function to provide the requested services when a LSP (Label Switched Path) is established by RSVP-TE. In this implementation, we realized the dynamic construction of the switch processing and the establishment of the LSP that adapted the services.. |
| 218. |
Study and Implementation on P2P based Contents Delivery Network System using Cooperation of Server and Clients
Although CDN (Contents Delivery Network) is the remarkable network to transmit multimedia contents fast, it could not reduce the download time for rich contents such as HDTV (High Definition Television). So, we implemented the P2P based Contents Delivery Network System that download contents from not only the Contents Server but also Clients who finished downloading the contents. To select the download site, we send Pings to the list of download site, and then select the download site which has the shortest RTT. But, in this implementation requests from Clients flock to the download site which has the shortest RTT, because the download site has been selected only by Client side. As a result, there are possibility that download time deteriorates. In this paper, we propose a "P2P based Contents Delivery Network System using Cooperation of Server and Clients" which is aiming for load-balancing by adjusting the candidates of download sites given to the client at the server side, and by restricting the number of maximum connections of each candidate. The performance of our proposed methods and the prototype system are evaluated by computer simulations. As a result, we showed that the contents delivery time of our proposals are reduced up to 40% compared to the prototype system.. |
| 219. |
Performance Evaluation of Grid Computing Using Parallel Data Link
In a grid computing environment, a task is divided into multiple processes and the processes are distributed to multiple processing nodes via networks. The network characteristics such as bandwidth and latency affect the task performance. In recent years, with the growth of wide area network technologies, various grid applications are developed and the requirement for bandwidth of wide area networks becomes large and it reaches more than 100Gbps. In this paper, we focus on parallel data links, such as link aggregation, to make bandwidth higher. By experiments, the performance of grid computing using parallel data links is evaluated.. |
| 220. |
The Experiment of Inter Service Parts Connection Techniques for Ubiquitous Grid Networking Environment (uGrid)
With the advance of ubiquitous society, we asuumes that an environment in which everything is connetted to networks will come. We define a ubiquitous grid networking environment (uGrid) as follows: uGrid is an environment that everything all over the world can be defined as a service parts, it is possible to search for the service parts of the desire from all service parts in the world, those searched service parts are combined through the network and users can enjoy their desired service. In the uGrid, user uses other user's device when user connect to service parts. Therefore, it is necessary to control with the device on the connected user side concerning the communication from others. In this paper, to realize the ubiquitous grid networking environment (uGrid), we implement the experiment of inter service parts connection techniques that USB over IP device is controlled by Proxy.. |
| 221. |
Study and Implementation on P2P based Contents Delivery Network System using Cooperation of Server and Clients
Although CDN (Contents Delivery Network) is the remarkable network to transmit multimedia contents fast, it could not reduce the download time for rich contents such as HDTV (High Definition Television). So, we implemented the P2P based Contents Delivery Network System that download contents from not only the Contents Server but also Clients who finished downloading the contents. To select the download site, we send Pings to the list of download site, and then select the download site which has the shortest RTT. But, in this implementation requests from Clients flock to the download site which has the shortest RTT, because the download site has been selected only by Client side. As a result, there are possibility that download time deteriorates. In this paper, we propose a "P2P based Contents Delivery Network System using Cooperation of Server and Clients" which is aiming for load-balancing by adjusting the candidates of download sites given to the client at the server side, and by restricting the number of maximum connections of each candidate. The performance of our proposed methods and the prototype system are evaluated by computer simulations. As a result, we showed that the contents delivery time of our proposals are reduced up to 40% compared to the prototype system.. |
| 222. |
Performance Evaluation of Grid Computing Using Parallel Data Link
In a grid computing environment, a task is divided into multiple processes and the processes are distributed to multiple processing nodes via networks. The network characteristics such as bandwidth and latency affect the task performance. In recent years, with the growth of wide area network technologies, various grid applications are developed and the requirement for bandwidth of wide area networks becomes large and it reaches more than 100Gbps. In this paper, we focus on parallel data links, such as link aggregation, to make bandwidth higher. By experiments, the performance of grid computing using parallel data links is evaluated.. |
| 223. |
The Experiment of Inter Service Parts Connection Techniques for Ubiquitous Grid Networking Environment (uGrid)
With the advance of ubiquitous society, we asuumes that an environment in which everything is connetted to networks will come. We define a ubiquitous grid networking environment (uGrid) as follows: uGrid is an environment that everything all over the world can be defined as a service parts, it is possible to search for the service parts of the desire from all service parts in the world, those searched service parts are combined through the network and users can enjoy their desired service. In the uGrid, user uses other user's device when user connect to service parts. Therefore, it is necessary to control with the device on the connected user side concerning the communication from others. In this paper, to realize the ubiquitous grid networking environment (uGrid), we implement the experiment of inter service parts connection techniques that USB over IP device is controlled by Proxy.. |
| 224. |
A Study on Scheduling and Multicast for Contents Delivery
With the growth of high speed networks based on FTTH, the amount of large-size files, such as movies and music files, transmitted over the Internet has been increasing. However, as the number of the users who download large-size files is increasing, the network bandwidth and the processing capabilities of contents servers are inadequate. So there is a possibility that transmitting of high popularity contents will be heavily-loaded and network congestion will occur. We propose a scheduling and multicast method for contents delivery service to reduce the load of contents server and network congestion. In our proposed method, the timing of transmitting contents is force to delay when many users access the large-size contents at the same time. Furthermore, the method of transmitting contents is switched from unicast to multicast and multicast delivery interval is scheduled. Also we evaluate the multicast delivery interval based on the contents size and the number of access by computer simulation and the result shows that the download time is reduced.. |
| 225. |
A Study on Scheduling and Multicast for Contents Delivery
With the growth of high speed networks based on FTTH, the amount of large-size files, such as movies and music files, transmitted over the Internet has been increasing. However, as the number of the users who download large-size files is increasing, the network bandwidth and the processing capabilities of contents servers are inadequate. So there is a possibility that transmitting of high popularity contents will be heavily-loaded and network congestion will occur. We propose a scheduling and multicast method for contents delivery service to reduce the load of contents server and network congestion. In our proposed method, the timing of transmitting contents is force to delay when many users access the large-size contents at the same time. Furthermore, the method of transmitting contents is switched from unicast to multicast and multicast delivery interval is scheduled. Also we evaluate the multicast delivery interval based on the contents size and the number of access by computer simulation and the result shows that the download time is reduced.. |
| 226. |
Fast calculation method of Set Cover Problem on parallel reconfigurable processor DAPDNA-2
This paper proposes a fast calculation method of the set cover problem, which is implemented on reconfigurable processor DAPDNA-2 of IPFlex Inc. Content replication is a widely employed technique to improve the performance of large-scale content distribution systems. Replica placement method is derived from the set cover problem which is known to be NP-hard. It is difficult to caluculate the large-scale set cover problem on a program counter-based processor. Our proposed algorithm divides the combination optimally and performs pipeline operation. Experimental results show that the proposed algorithm reduces the execution time by 40 times compared to Intel Pentium 42.8GHz.. |
| 227. |
Fast calculation method of Set Cover Problem on parallel reconfigurable processor DAPDNA-2
This paper proposes a fast calculation method of the set cover problem, which is implemented on reconfigurable processor DAPDNA-2 of IPFlex Inc. Content replication is a widely employed technique to improve the performance of large-scale content distribution systems. Replica placement method is derived from the set cover problem which is known to be NP-hard. It is difficult to caluculate the large-scale set cover problem on a program counter-based processor. Our proposed algorithm divides the combination optimally and performs pipeline operation. Experimental results show that the proposed algorithm reduces the execution time by 40 times compared to Intel Pentium 42.8GHz.. |
| 228. |
Fast calculation method of Set Cover Problem on parallel reconfigurable processor DAPDNA-2
This paper proposes a fast calculation method of the set cover problem, which is implemented on reconfigurable processor DAPDNA-2 of IPFlex Inc. Content replication is a widely employed technique to improve the performance of large-scale content distribution systems. Replica placement method is derived from the set cover problem which is known to be NP-hard. It is difficult to caluculate the large-scale set cover problem on a program counter-based processor. Our proposed algorithm divides the combination optimally and performs pipeline operation. Experimental results show that the proposed algorithm reduces the execution time by 40 times compared to Intel Pentium 42.8GHz.. |
| 229. |
Fast calculation method of Set Cover Problem on parallel reconfigurable processor DAPDNA-2
This paper proposes a fast calculation method of the set cover problem, which is implemented on reconfigurable processor DAPDNA-2 of IPFlex Inc. Content replication is a widely employed technique to improve the performance of large-scale content distribution systems. Replica placement method is derived from the set cover problem which is known to be NP-hard. It is difficult to caluculate the large-scale set cover problem on a program counter-based processor. Our proposed algorithm divides the combination optimally and performs pipeline operation. Experimental results show that the proposed algorithm reduces the execution time by 40 times compared to Intel Pentium 42.8GHz.. |
| 230. |
Research on the Ubiquitous Grid Networking Environment (uGrid)
As the ubiquitous society will come, it is possible to assume that an environment which everything are connected to the network can be realized. A ubiquitous grid networking environment (uGrid) is defined as follows : it is an environment that everything all over the world can be defined as a service parts, it is possible to search for the service parts of the desire from all service parts in the world, those searched service parts are combined through the network and users can enjoy their desired service. In this paper, the research topic needed to achieve uGrid is proposed and discussed.. |
| 231. |
Research on the Ubiquitous Grid Networking Environment (uGrid)
As the ubiquitous society will come, it is possible to assume that an environment which everything are connected to the network can be realized. A ubiquitous grid networking environment (uGrid) is defined as follows : it is an environment that everything all over the world can be defined as a service parts, it is possible to search for the service parts of the desire from all service parts in the world, those searched service parts are combined through the network and users can enjoy their desired service. In this paper, the research topic needed to achieve uGrid is proposed and discussed.. |
| 232. |
High-speed Resource Information Advertising Method in GMPLS
As a broadband communication service extends rapidly, it is very difficult to estimate the increase and fluctuation of the traffic in network accurately. The research and development of the traffic engineering (TE) is advanced. The aim of TE is calculating the route in order to use network resources effectively. In GMPLS (Generalized Multi-Protocol Label Switching) network, the source node decides route from collected network resource informations. Resource informations are spread by OSPF-TE. However, in order to support to all of a frequent update, the transmission of quite a lot of update packets is needed. It causes an increase of the load of each router. In our proposed method, only one packet informs all routers about update information of each links along the route when the route is established or released in RSVP-TE. Our proposed method can support to a more frequent update by decreasing the amount of the packet. The simulation result shows the improvement of the amount of the packet and the blocking probability.. |
| 233. |
High-speed Resource Information Advertising Method in GMPLS
As a broadband communication service extends rapidly, it is very difficult to estimate the increase and fluctuation of the traffic in network accurately. The research and development of the traffic engineering (TE) is advanced. The aim of TE is calculating the route in order to use network resources effectively. In GMPLS (Generalized Multi-Protocol Label Switching) network, the source node decides route from collected network resource informations. Resource informations are spread by OSPF-TE. However, in order to support to all of a frequent update, the transmission of quite a lot of update packets is needed. It causes an increase of the load of each router. In our proposed method, only one packet informs all routers about update information of each links along the route when the route is established or released in RSVP-TE. Our proposed method can support to a more frequent update by decreasing the amount of the packet. The simulation result shows the improvement of the amount of the packet and the blocking probability.. |
| 234. |
The Distributed Data Access Schemes in λ Grid Networks
Since the development of optical network technology, a lambda grid system sharing computing resouce by wide area optical network has been proposed as grid systems. In the grid system, data stored as the file format. To reduce the influence of file damage and to distribute the load, replica files are stored many servers. Parallel downloading is promising to decrease downloading time, improve transfer rate, and distribute load to many servers. However, parallel downloading triggers many bottleneck links in the network, since many links are used in simultaneity. Therefore the blocking probability of new lightpath set up becomes high. In this paper, we propose a server selection method for parallel downloading in WDM network which considers the wavelength availabilities of each links to decrease bottoleneck links and to enhance the network efficiency. The proposed scheme can optimaly select servers and reduce the blocking probability by considering both wavelength availability for each link and original costs.. |
| 235. |
The Distributed Data Access Schemes in λ Grid Networks
Since the development of optical network technology, a lambda grid system sharing computing resouce by wide area optical network has been proposed as grid systems. In the grid system, data stored as the file format. To reduce the influence of file damage and to distribute the load, replica files are stored many servers. Parallel downloading is promising to decrease downloading time, improve transfer rate, and distribute load to many servers. However, parallel downloading triggers many bottleneck links in the network, since many links are used in simultaneity. Therefore the blocking probability of new lightpath set up becomes high. In this paper, we propose a server selection method for parallel downloading in WDM network which considers the wavelength availabilities of each links to decrease bottoleneck links and to enhance the network efficiency. The proposed scheme can optimaly select servers and reduce the blocking probability by considering both wavelength availability for each link and original costs.. |
| 236. |
BCS-1-4 High Speed Optical Switches for Future Networking Technologies. |
| 237. |
本間 潤一郎, 辻 智博, 荒川 豊, 岡本 聡, 山中 直明, ロングテール化するユーザリクエストを効率的に処理するコンテンツ配信ネットワークシステム, 電子情報通信学会技術研究報告. NS, ネットワークシステム, 2007.03, 従来のCDN(Contents Delivery Network)システムでは,SS(Surrogate Server)は高人気コンテンツのみを配信し,それ以外のコンテンツはOriginal Serverにおいて処理をする方式が主流であった.しかしながら,近年のロングテール現象の顕在化により,低需要と考えられてきた大多数のコンテンツの配信が増加し,Original Serverへの負荷増大が予想される.そこで,本研究ではコンテンツを需要数に応じてClassに分類し,Class毎に配信方法を変更するCDNシステムを提案する.提案方式では,SSのクラスタ化,コンテンツの段階的ダウンロードを行うことによりユーザのアクセス時間短縮オリジナルサーバ処理率低下を実現する.計算機シミュレーションにより提案方式の有効性を示す.. |
| 238. |
BCS-1-4 High Speed Optical Switches for Future Networking Technologies. |
| 239. |
本間 潤一郎, 辻 智博, 荒川 豊, 岡本 聡, 山中 直明, ロングテール化するユーザリクエストを効率的に処理するコンテンツ配信ネットワークシステム, 電子情報通信学会技術研究報告. NS, ネットワークシステム, 2007.03, 従来のCDN(Contents Delivery Network)システムでは,SS(Surrogate Server)は高人気コンテンツのみを配信し,それ以外のコンテンツはOriginal Serverにおいて処理をする方式が主流であった.しかしながら,近年のロングテール現象の顕在化により,低需要と考えられてきた大多数のコンテンツの配信が増加し,Original Serverへの負荷増大が予想される.そこで,本研究ではコンテンツを需要数に応じてClassに分類し,Class毎に配信方法を変更するCDNシステムを提案する.提案方式では,SSのクラスタ化,コンテンツの段階的ダウンロードを行うことによりユーザのアクセス時間短縮オリジナルサーバ処理率低下を実現する.計算機シミュレーションにより提案方式の有効性を示す.. |
| 240. |
Overlay reconfiguration scheme for P2P based HD-CDN (High-Definition Contents Delivery Network)
In this paper, we propose overlay reconfiguration scheme based on not only delay but also bandwidth in order to shorten file transmition time. In proposed algorithm, by calcuating reconfiguration cost adding delay and bandwidth with arbitrary weight α, we realize effective overlay reconfiguration. By computing simuration, we evaluate time of file transmition and consumption rate of bandwith. As a result, compared with conventional scheme, we show proposed scheme can shorten a file transmition time without wasting bandwidth.. |
| 241. |
The Proposal of Job Scheduling Algorithm Based on Priority and Job End Time in Optical Grid Networks
With the growth of optical network technologies, research on an optical grid becomes very popular. In an optical grid system, users can reserve computer resources and network resorces in advance specifying job execution time by using GMPLS technology. In conventional job scheduling, when the scheduler cannot reserve resources for a new job, it compares a priority of new job and that of already assigned job (existing job). If a priority of the existing job is low, the scheduler interrupts execution of the existing job immediately. The overheads increase with job interruptions. Therefore, we propose a novel job scheduling algorithm that considers job end time of existing jobs as well as priorities of jobs. Computer simulations show that our proposed scheme can reduce the average delay time from 15 % to 20% compared with the conventional job scheduling.. |
| 242. |
Overlay reconfiguration scheme for P2P based HD-CDN (High-Definition Contents Delivery Network)
In this paper, we propose overlay reconfiguration scheme based on not only delay but also bandwidth in order to shorten file transmition time. In proposed algorithm, by calcuating reconfiguration cost adding delay and bandwidth with arbitrary weight α, we realize effective overlay reconfiguration. By computing simuration, we evaluate time of file transmition and consumption rate of bandwith. As a result, compared with conventional scheme, we show proposed scheme can shorten a file transmition time without wasting bandwidth.. |
| 243. |
The Proposal of Job Scheduling Algorithm Based on Priority and Job End Time in Optical Grid Networks
With the growth of optical network technologies, research on an optical grid becomes very popular. In an optical grid system, users can reserve computer resources and network resorces in advance specifying job execution time by using GMPLS technology. In conventional job scheduling, when the scheduler cannot reserve resources for a new job, it compares a priority of new job and that of already assigned job (existing job). If a priority of the existing job is low, the scheduler interrupts execution of the existing job immediately. The overheads increase with job interruptions. Therefore, we propose a novel job scheduling algorithm that considers job end time of existing jobs as well as priorities of jobs. Computer simulations show that our proposed scheme can reduce the average delay time from 15 % to 20% compared with the conventional job scheduling.. |
| 244. |
Design and Implement of GMPLS-based Optical Slot Switching Network Using PLZT Ultra-high Speed Optical Switch
In this paper, we design and implement GMPLS-based optical slot switching network using PLZT ultra-high speed optical switch. We consider that optical slot switching network is suitable for bulk contents transfer because the network user can use large bandwidth by slot in a moment. However, the switching time of conventional optical switch is msec order and causes large overhead between slots. Therefore the network using the conventional switch cannot transfer contents efficiently. PLZT ultra-high speed optical switch can improve the bandwidth utilization by reducing the guard time between slots as compared with the conventional optical switch. By experiment, we examine that our designed optical slot switcing is suitable for bulk contents transfer.. |
| 245. |
Design and Implement of GMPLS-based Optical Slot Switching Network Using PLZT Ultra-high Speed Optical Switch
In this paper, we design and implement GMPLS-based optical slot switching network using PLZT ultra-high speed optical switch. We consider that optical slot switching network is suitable for bulk contents transfer because the network user can use large bandwidth by slot in a moment. However, the switching time of conventional optical switch is msec order and causes large overhead between slots. Therefore the network using the conventional switch cannot transfer contents efficiently. PLZT ultra-high speed optical switch can improve the bandwidth utilization by reducing the guard time between slots as compared with the conventional optical switch. By experiment, we examine that our designed optical slot switcing is suitable for bulk contents transfer.. |
| 246. |
Optical Slot Switching Architecture based on dynamic path setup using ultra-high speed PLZT optical switch
In this research, we propose the Optical Slot Switching (OSS), that dynamically establishes the path by using ultra-high speed optical switch. In our proposed scheme, all node divide time into slots with same timing. In an conventional Optical Burst Switched (OBS) network, since variable length data are transmitted at the source node asynchronously by one-way reservation scheme, the collision of data occurs. Various solutions to avoid the collision have been proposed. However, in terms of the optical device technology, it is difficult to implement the collision resolution schemes. In our scheme, a source node which has a connection request sends the PATH signal to destination node to reserve wavelength in the next slot by two-way reservation scheme. And, a node can establish the path without considering the current condition of the wavelength. Changing time of sending PATH message with considering hops between source node and destination node improves fairness of blocking probability about hops. Computer simulation results show that our proposed scheme can improve the link utilization efficiency and the fairness of the blocking probability about hops compared with conventional method.. |
| 247. |
A Deadline-Scheduling Scheme for Wavelength Assignment in λ Grid Networks
A lambda grid system has been proposed as a huge computer grid system, based on an advanced photonic network technology. It is important to assign wavelengths for jobs in a lambda grid network. Considering with services and various services request such as the different end time of jobs. Thus, job deadline for wavelength assignment is very essential. The conventional job scheduling assigns a lot of time slots to a call in a short term in order to finish a job fast, so there is the problem that the blocking probability of short deadline calls is degraded. Therefore, we propose a deadline-scheduling scheme for a wavelength assignment in a lambda grid network to guarantee calls Qos. Our proposed scheme assigns time slots to a call in a long term according to its deadline. Thus, it can reduce the blocking probability of short deadline calls. Computer simulations show that our proposed scheme can reduce from one order to two the blocking probability compared with the conventional one under low load.. |
| 248. |
Prefetching Protocol Proxy with Optimal Mirror Selection and Burst Transmission
Prefetching is one of the most effective ways to reduce a Web access delay. In this paper, we shorten a download time by applying prefetching to transmission of the rich-contents. And, we propose a optimal mirror selection scheme for the purpose of cuting down a real download time of rich-contents. Moreover, we aim to improve a real download time by optimal network resource selection and protocol conversion. Implementation result shows the proposed scheme can reduce the mirror selection time and download time by about seventy percent as compared with the usual human operation.. |
| 249. |
Shortest Path Algorithm on Parallel Reconfigurable Processor DAPDNA-2
This paper proposes a parallel shortest path algorithm and implement the proposed algorithm on DAPDNA-2 of IPFlex Inc. Conventional Dijkstra's shortest path algorithm finds shortest paths from the start node in OSPF. When the network scale is large, calculation time of Dijkstra's shortest path algorithm increases rapidly. To meet those shortcoming, proposed scheme can decrease calculation time from O(N^2) to O(N). As a result of simulations, we show that calculation time of the proposed algorithm decreases by 99.6% compared to Dijkstra's algorithm on DAPDNA-2.. |
| 250. |
Construction of Overlay Network Considering User Preference in Peer-to-Peer Systems
In this paper, we propose overlay network architecture and the contents search method considering with user preference. The conventional scheme selects neighbor peers randomly. Since the probability that neighbor peers have a requested content is low, many search requests are needed. The conventional scheme has low scalability. On the other hand, in our proposed scheme, an overlay network is performed based on peer's preference. In addition, search request is forwarded according to the peer's correlation of preference. Our proposed search method has high contents' discovery rate even though the number of request is low. Simulation results show that our proposed scheme increases the contents' discovery rate and reduces the number of search requests.. |
| 251. |
Optical Slot Switching Architecture based on dynamic path setup using ultra-high speed PLZT optical switch
In this research, we propose the Optical Slot Switching (OSS), that dynamically establishes the path by using ultra-high speed optical switch. In our proposed scheme, all node divide time into slots with same timing. In an conventional Optical Burst Switched (OBS) network, since variable length data are transmitted at the source node asynchronously by one-way reservation scheme, the collision of data occurs. Various solutions to avoid the collision have been proposed. However, in terms of the optical device technology, it is difficult to implement the collision resolution schemes. In our scheme, a source node which has a connection request sends the PATH signal to destination node to reserve wavelength in the next slot by two-way reservation scheme. And, a node can establish the path without considering the current condition of the wavelength. Changing time of sending PATH message with considering hops between source node and destination node improves fairness of blocking probability about hops. Computer simulation results show that our proposed scheme can improve the link utilization efficiency and the fairness of the blocking probability about hops compared with conventional method.. |
| 252. |
A Deadline-Scheduling Scheme for Wavelength Assignment in λ Grid Networks
A lambda grid system has been proposed as a huge computer grid system, based on an advanced photonic network technology. It is important to assign wavelengths for jobs in a lambda grid network. Considering with services and various services request such as the different end time of jobs. Thus, job deadline for wavelength assignment is very essential. The conventional job scheduling assigns a lot of time slots to a call in a short term in order to finish a job fast, so there is the problem that the blocking probability of short deadline calls is degraded. Therefore, we propose a deadline-scheduling scheme for a wavelength assignment in a lambda grid network to guarantee calls Qos. Our proposed scheme assigns time slots to a call in a long term according to its deadline. Thus, it can reduce the blocking probability of short deadline calls. Computer simulations show that our proposed scheme can reduce from one order to two the blocking probability compared with the conventional one under low load.. |
| 253. |
Prefetching Protocol Proxy with Optimal Mirror Selection and Burst Transmission
Prefetching is one of the most effective ways to reduce a Web access delay. In this paper, we shorten a download time by applying prefetching to transmission of the rich-contents. And, we propose a optimal mirror selection scheme for the purpose of cuting down a real download time of rich-contents. Moreover, we aim to improve a real download time by optimal network resource selection and protocol conversion. Implementation result shows the proposed scheme can reduce the mirror selection time and download time by about seventy percent as compared with the usual human operation.. |
| 254. |
Shortest Path Algorithm on Parallel Reconfigurable Processor DAPDNA-2
This paper proposes a parallel shortest path algorithm and implement the proposed algorithm on DAPDNA-2 of IPFlex Inc. Conventional Dijkstra's shortest path algorithm finds shortest paths from the start node in OSPF. When the network scale is large, calculation time of Dijkstra's shortest path algorithm increases rapidly. To meet those shortcoming, proposed scheme can decrease calculation time from O(N^2) to O(N). As a result of simulations, we show that calculation time of the proposed algorithm decreases by 99.6% compared to Dijkstra's algorithm on DAPDNA-2.. |
| 255. |
Construction of Overlay Network Considering User Preference in Peer-to-Peer Systems
In this paper, we propose overlay network architecture and the contents search method considering with user preference. The conventional scheme selects neighbor peers randomly. Since the probability that neighbor peers have a requested content is low, many search requests are needed. The conventional scheme has low scalability. On the other hand, in our proposed scheme, an overlay network is performed based on peer's preference. In addition, search request is forwarded according to the peer's correlation of preference. Our proposed search method has high contents' discovery rate even though the number of request is low. Simulation results show that our proposed scheme increases the contents' discovery rate and reduces the number of search requests.. |
| 256. |
Optical Burst Switched Ring Network with Upstream Prioritized Switching and Distributed Fairness Control. |
| 257. |
荒川 豊, 山中 直明, OBSネットワークにおける On-the-fly パス構築を用いたQoS差別化方式, 電子情報通信学会技術研究報告. PN, フォトニックネットワーク, 2005.12, OBSネットワークを用いてデータグリッドやCD/DVD配信を行うことが検討されている. このようなアプリケーションでは, データ長が非常に大きいため, 複数のバースト信号にまたがってデータが送信される可能性があり, 複数バースト信号の確実な転送が必要となる. そこで本論文では, 光バースト交換において, On-the-flyパス構築を用いたQoS差別化方式を提案する. 提案方式は, 棄却率に対して高い優先度を要求するバースト信号群に対して, 一時的にパスを構築することにより, より確実なデータ転送を実現する. パスの構築方式として, 複数の高優先クラスを要求するバースト信号群に対して, 先頭バースト信号がパスの予約を行い, 最後尾のバースト信号がパスの開放を行うOn-the-flyパス構築方式を用いる. 計算機シミュレーションにより, フロー棄却率及びバースト棄却率に関するQoS差別化を実現できることを示す.. |
| 258. |
A Study on Shortest Path Routing Algorithm on Data-flow Parallel Reconfigurable Processor DAPDNA2
In IP networks, we ordinally use OSPF(Open Shortest Path First) as a routing protocol. OSPF find the shortest path using Dijkstra's Shortest Path Algorithm. Dijkstra's Algorithm is suitable for program counter based CPU, however it is not scalable for the number of nodes in the networks since its computational complexity is O(n^2). In this paper, We propose a parallel shortest path algorithm MPSA(Multi-route Parallel Search Algorithm) and implement the proposed algorithm on DAPDNA2 which is based on data-flow parallel reconfigurable processor architecture. Our proposed algorithm is expressed as matrix operations, so it become high parallelism. As a result, its computational complexity is O(√), and scalable for the number of nodes.. |
| 259. |
荒川 豊, 山中 直明, OBSネットワークにおける On-the-fly パス構築を用いたQoS差別化方式, 電子情報通信学会技術研究報告. PN, フォトニックネットワーク, 2005.12, OBSネットワークを用いてデータグリッドやCD/DVD配信を行うことが検討されている. このようなアプリケーションでは, データ長が非常に大きいため, 複数のバースト信号にまたがってデータが送信される可能性があり, 複数バースト信号の確実な転送が必要となる. そこで本論文では, 光バースト交換において, On-the-flyパス構築を用いたQoS差別化方式を提案する. 提案方式は, 棄却率に対して高い優先度を要求するバースト信号群に対して, 一時的にパスを構築することにより, より確実なデータ転送を実現する. パスの構築方式として, 複数の高優先クラスを要求するバースト信号群に対して, 先頭バースト信号がパスの予約を行い, 最後尾のバースト信号がパスの開放を行うOn-the-flyパス構築方式を用いる. 計算機シミュレーションにより, フロー棄却率及びバースト棄却率に関するQoS差別化を実現できることを示す.. |
| 260. |
A Study on Shortest Path Routing Algorithm on Data-flow Parallel Reconfigurable Processor DAPDNA2
In IP networks, we ordinally use OSPF(Open Shortest Path First) as a routing protocol. OSPF find the shortest path using Dijkstra's Shortest Path Algorithm. Dijkstra's Algorithm is suitable for program counter based CPU, however it is not scalable for the number of nodes in the networks since its computational complexity is O(n^2). In this paper, We propose a parallel shortest path algorithm MPSA(Multi-route Parallel Search Algorithm) and implement the proposed algorithm on DAPDNA2 which is based on data-flow parallel reconfigurable processor architecture. Our proposed algorithm is expressed as matrix operations, so it become high parallelism. As a result, its computational complexity is O(√), and scalable for the number of nodes.. |
| 261. |
Forecast of Increasing or Decreasing Intrusion Event Counts Using Bayesian Inference
An intrusion detection system (IDS) is an important tool to detect and to analyze network attacks. The analysis techniques of IDS events are actively researched, since it is important to make use of results of analysis in understanding attack trends. To aim at a quick response in security operation, it is important to find the attacks that gets larger in the future. However, conventional approaches cannot indicate future fluctuation of attacks. In this paper, we propose forecast algorithms for increasing or decreasing the event counts. We consider two algorithms by focusing on an attack cycle and a fluctuation range of the event counts. Our algorithms use Bayesian Inference for calculating the conditional probability based on pastobserved event counts to forecast increasing or decreasing the event counts. We implement the forecasting system and evaluate it with real IDS events. Experimental evaluations show that each attack has discrete characteristic of fluctuation and our proposed algorithms can forecast increasing or decreasing the event counts by selecting most appropriate algorithm for each attack.. |
| 262. |
荒川 豊, 山中 直明, 光バースト交換に基づくバースト・サーキット融合型ネットワーク(IPバックボーンネットワーク, フォトニックネットワークの構成/管理/制御プロトコル技術及び一般), 電子情報通信学会技術研究報告. PN, フォトニックネットワーク, 2005.10, OBSネットワークにおける大容量データの効率的な転送を目的とし, On-the-flyパス構築によるバースト・サーキット融合型ネットワークアーキテクチャを提案する.近年, ファイルサイズ等は増加の一途をたどっており, DVDデータなどの転送をOBSで行う場合, 複数バースト信号にまたがって転送が行われる可能性がある.このような場合, OBSではなく, パスを構築してからデータ伝送を行うサーキットスイッチの方が適していると一般的にいわれている.しかしながら, サーキットスイッチイングは, パス構築に時間を要するため波長利用効率が悪くなるという問題点がある.そこで, 複数のバースト信号から構成されるフローにおいて, 先頭バースト信号がパスの予約を行い, 最後尾のバースト信号がパスの開放を行うOn-the-flyパス構築方式を提案する.さらに提案方式では, 先頭バースト信号を高優先度とすることにより, パス構築成功率を向上させる.パス構築のトリガーとしては, フローサイズ, あて先までのホップ数, 優先クラスなどを考慮する.計算機シミュレーションにより, フロー棄却率及びバースト棄却率が大幅に改善することを示す.. |
| 263. |
On Demand Distributed Public Key Management Using Routing Information for Wireless Ad Hoc Networks. |
| 264. |
荒川 豊, 山中 直明, 光バースト交換に基づくバースト・サーキット融合型ネットワーク(IPバックボーンネットワーク, フォトニックネットワークの構成/管理/制御プロトコル技術及び一般), 電子情報通信学会技術研究報告. PN, フォトニックネットワーク, 2005.10, OBSネットワークにおける大容量データの効率的な転送を目的とし, On-the-flyパス構築によるバースト・サーキット融合型ネットワークアーキテクチャを提案する.近年, ファイルサイズ等は増加の一途をたどっており, DVDデータなどの転送をOBSで行う場合, 複数バースト信号にまたがって転送が行われる可能性がある.このような場合, OBSではなく, パスを構築してからデータ伝送を行うサーキットスイッチの方が適していると一般的にいわれている.しかしながら, サーキットスイッチイングは, パス構築に時間を要するため波長利用効率が悪くなるという問題点がある.そこで, 複数のバースト信号から構成されるフローにおいて, 先頭バースト信号がパスの予約を行い, 最後尾のバースト信号がパスの開放を行うOn-the-flyパス構築方式を提案する.さらに提案方式では, 先頭バースト信号を高優先度とすることにより, パス構築成功率を向上させる.パス構築のトリガーとしては, フローサイズ, あて先までのホップ数, 優先クラスなどを考慮する.計算機シミュレーションにより, フロー棄却率及びバースト棄却率が大幅に改善することを示す.. |
| 265. |
A Wavelength Assignment Scheme for WDM Network with Limited Range Wavelength Converters
In the wavelength-routed network, the blocking probability can be improved by using wavelength converters because they eliminate the wavelength continuity constraint. Particularly, the network with cost-effective limited-range wavelength converters is a hot topic. In such networks, it is important to consider the range of a wavelength converter in assigning a wavelength. In this paper, we propose a wavelength assignment scheme to consider the number of hops of a connection request to reduce the blocking probability. Simulation results show that the proposed scheme can reduce the wavelength converters by about twenty percent.. |
| 266. |
A Wavelength Assignment Scheme for WDM Network with Limited Range Wavelength Converters
In the wavelength-routed network, the blocking probability can be improved by using wavelength converters because they eliminate the wavelength continuity constraint. Particularly, the network with cost-effective limited-range wavelength converters is a hot topic. In such networks, it is important to consider the range of a wavelength converter in assigning a wavelength. In this paper, we propose a wavelength assignment scheme to consider the number of hops of a connection request to reduce the blocking probability. Simulation results show that the proposed scheme can reduce the wavelength converters by about twenty percent.. |
| 267. |
QoS Differentiation Combined with Burst Length Control, Offset Time Control and Burst Dropping Technique in Optical Burst Switched Network. |
| 268. |
Fair Burst Dropping Technique for Optical Composite Burst Switched Multi-Hop Network. |
| 269. |
荒川 豊, 山中 直明, 笹瀬 巌, TTFR型光バースト交換リングネットワークにおけるメディアアクセス制御方式, 電子情報通信学会技術研究報告. PN, フォトニックネットワーク, 2004.05, 本論文では,光バーストスイッチング(OBS : Optical Burst Switching)を用いたメトロポリタンエリアネットワーク(MAN : Metropolitan Area Ntwork)を提案する.提案方式において,各ノートは可変波長送信器と固定波長受信器(TTFR : Tunable Transmitters and Fixed receivers)を備えるものとし,各ノードは宛先ごとに割り当てられた波長を用いてバースド信号を送信する.TTFR型のネットワークは,送信側で競合を検知することができ,受信側で競合が発生しないため,帯域を予約しないOBSに適した構成であると考えられる.また,提案方式では, JET (Just Enough Time)シグナリングを用いることにより,各ノートにおける送信競合の事前検知が可能となる.計算機シミュレーションによりスループット特性および遅延特性の評価を行い,提案OBS-MANの有効性を示す.. |
| 270. |
QoS Scheme with Composite Burst Assembly in Optical Burst Switched Network with Burst Dropping. |
| 271. |
荒川 豊, 山中 直明, 笹瀬 巌, TTFR型光バースト交換リングネットワークにおけるメディアアクセス制御方式, 電子情報通信学会技術研究報告. PN, フォトニックネットワーク, 2004.05, 本論文では,光バーストスイッチング(OBS : Optical Burst Switching)を用いたメトロポリタンエリアネットワーク(MAN : Metropolitan Area Ntwork)を提案する.提案方式において,各ノートは可変波長送信器と固定波長受信器(TTFR : Tunable Transmitters and Fixed receivers)を備えるものとし,各ノードは宛先ごとに割り当てられた波長を用いてバースド信号を送信する.TTFR型のネットワークは,送信側で競合を検知することができ,受信側で競合が発生しないため,帯域を予約しないOBSに適した構成であると考えられる.また,提案方式では, JET (Just Enough Time)シグナリングを用いることにより,各ノートにおける送信競合の事前検知が可能となる.計算機シミュレーションによりスループット特性および遅延特性の評価を行い,提案OBS-MANの有効性を示す.. |
| 272. |
QoS Scheme with Composite Burst Assembly in Optical Burst Switched Network with Burst Dropping. |
| 273. |
B-7-11 A Study of appling Bayesian Method for Forecast of Increase or Decrease of Intrusion Events. |
| 274. |
B-7-18 A Proposal Method of Analyzing Anomalous IDS Log Focusing on Directions of Detected Events. |
| 275. |
B-7-21 On Demand Distributed Public Key Management for Mobile Ad Hoc Networks. |
| 276. |
B-7-11 A Study of appling Bayesian Method for Forecast of Increase or Decrease of Intrusion Events. |
| 277. |
B-7-18 A Proposal Method of Analyzing Anomalous IDS Log Focusing on Directions of Detected Events. |
| 278. |
B-7-21 On Demand Distributed Public Key Management for Mobile Ad Hoc Networks. |
| 279. |
Fluctuation Forecast of Intrusion Events by Using Bayesian Method
In this paper, we propose an algorithm for fluctuation forecast of intrusion events by using bayesian method, which calculates the conditional probability based on past data, to forecast future transition of attacks on intrusion detection system(IDS). We forecast the probability of increase of intrusion events by selecting two type algorisms focused on cycle and degree of increase or decrease. We show that our proposed algorithms can improve the precision of forecast fluctuation of intrusion events by using actual IDS log.. |
| 280. |
On Demand Distributed Public Key Management for Wireless Ad Hoc Networks
In this paper, we propose an on-demand distributed public-key management to construct public-key infrastructure for wireless ad hoc networks which are not connected with the Internet. In our proposed system, each node accumulates only issued public-key certificates in their certificate repository. Also our proposed system constructs trusted paths of certificates to a node only when node wants to authenticate. Our proposed system gets certificates for certificate path by using broadcast. Our proposed system can reduce memory, traffic, time and update Certificate Revocation List for authentication. By computer simulation, we show that our proposed system basic characteristic of probability of success path and average shortest path length.. |
| 281. |
Fluctuation Forecast of Intrusion Events by Using Bayesian Method
In this paper, we propose an algorithm for fluctuation forecast of intrusion events by using bayesian method, which calculates the conditional probability based on past data, to forecast future transition of attacks on intrusion detection system(IDS). We forecast the probability of increase of intrusion events by selecting two type algorisms focused on cycle and degree of increase or decrease. We show that our proposed algorithms can improve the precision of forecast fluctuation of intrusion events by using actual IDS log.. |
| 282. |
On Demand Distributed Public Key Management for Wireless Ad Hoc Networks
In this paper, we propose an on-demand distributed public-key management to construct public-key infrastructure for wireless ad hoc networks which are not connected with the Internet. In our proposed system, each node accumulates only issued public-key certificates in their certificate repository. Also our proposed system constructs trusted paths of certificates to a node only when node wants to authenticate. Our proposed system gets certificates for certificate path by using broadcast. Our proposed system can reduce memory, traffic, time and update Certificate Revocation List for authentication. By computer simulation, we show that our proposed system basic characteristic of probability of success path and average shortest path length.. |
| 283. |
Daisuke Ishii, Takahito Fujii, Yutaka Arakawa, Iwao Sasase, Fair Burst Dropping Technique for Optical Composite Burst Switched Multi-Hop Network, 2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003), 2003.11, Optical Composite Burst Switching(OCBS) that can improve the performance of the packet loss probability without Fiber Delay Lines(FDLs), has the problem that it is unfair about the number of hops to the destination edge router for the packet loss probability. In this paper, in order to achieve the fair packet loss probability regardless of the number of hops to the destination edge router, we propose the burst dropping technique that configures the threshold for determining whether the head-dropping(HD) technique is applied or not The HD technique is the burst dropping technique which reduces packet loss due to burst contention in OCBS. We compare the packet loss probability and throughput performance of our proposed scheme with those of the conventional one by computer simulations. As a result, we show that our proposed scheme can achieve the fair packet loss probability regardless of the number of hops to the destination edge router compared with a conventional one.. |
| 284. |
Yutaka Arakawa, Makoto Sakuta, Iwao Sasase, QoS Scheme with Burst Dropping in Optical Burst Switching, 2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003), 2003.11, We propose a new QoS control scheme by using burst dropping in optical burst switched network. Our proposed scheme consists of Burst Dropping (BD) technique at core nodes and packet arrangement technique at edge nodes. BD technique has been proposed as the effective solution that can improve packet loss at intermediate nodes. By using BD technique, the head of the latter arriving burst are dropped at a burst contention. Our proposed scheme mixes packets of different priorities into a single burst, and arranges them in ascending order of priority at burst assembly. At contention, lower priority packets that are located in former part of a burst are often discarded and higher ones are not often discarded. By computer simulations, we evaluate the QoS performance in terms of packet loss probability and the end-to-end delay performance. As a result, we show that our proposed scheme can provide a basic QoS in terms of packet loss without causing a degradation of end-to-end delay of higher priority packets.. |
| 285. |
QoS Differentiation Considering both Packet Loss Probability and Packet Delay in Optical Burst Switched Network
Several Quality of Service (QoS) schemes have been proposed in Optical Burst Switched (OBS) network. However, no scheme considers QoS requirement for both packet loss probability and packet delay. In this paper, we propose the QoS scheme that takes the QoS requirement for both packet loss probability and packet delay into account. Our proposed scheme divides traffic into four classes, low loss and low delay, low loss and high delay, high loss and low delay, high loss and high delay, respectively. Our proposed scheme combines three control techniques, burst length control, offset time control and Burst Dropping (BD) technique according to classes adaptively. By computer simulations, we evaluate packet loss probability and packet delay of our proposed scheme and we show that our proposed scheme can provide QoS differentiation between four classes.. |
| 286. |
QoS Differentiation Considering both Packet Loss Probability and Packet Delay in Optical Burst Switched Network
Several Quality of Service (QoS) schemes have been proposed in Optical Burst Switched (OBS) network. However, no scheme considers QoS requirement for both packet loss probability and packet delay. In this paper, we propose the QoS scheme that takes the QoS requirement for both packet loss probability and packet delay into account. Our proposed scheme divides traffic into four classes, low loss and low delay, low loss and high delay, high loss and low delay, high loss and high delay, respectively. Our proposed scheme combines three control techniques, burst length control, offset time control and Burst Dropping (BD) technique according to classes adaptively. By computer simulations, we evaluate packet loss probability and packet delay of our proposed scheme and we show that our proposed scheme can provide QoS differentiation between four classes.. |
| 287. |
Individual Authentication by Input Location Information
We summarize dangers on authentication system used at a bank or credit card, and introduce several measures against them. We implement and evaluate one of these measures, authentication system using input location information, in consideration of the balance between security intensity and usability. Consequently, some problems became clear. In this paper, we propose the authentication system that can improve these problem. By using our authentication system, it is possible to improve security intensity without spoiling usability.. |
| 288. |
Individual Authentication by Input Location Information
We summarize dangers on authentication system used at a bank or credit card, and introduce several measures against them. We implement and evaluate one of these measures, authentication system using input location information, in consideration of the balance between security intensity and usability. Consequently, some problems became clear. In this paper, we propose the authentication system that can improve these problem. By using our authentication system, it is possible to improve security intensity without spoiling usability.. |
| 289. |
Burst Dropping Technique for Multi-Hop Networks in Optical Composite Burst Switching
In OCBS (Optical Composite Burst Switching) that can improve the performance of the packet loss probability without FDL (Fiber Delay Line), there is the problem that it is unfair about the number of hops to the destination router and burst length about the packet loss probability. In this paper, for achieving the fairness about the number of hops to the destination router, we propose the burst dropping technique that determines the threshold for head-dropping with the number of hops to the destination router. And we also propose, for achieving the fairness about the burst length, the scheme that processes preferentially the control packet whose number of hops to the core router is large when some control packets arrive in a core router. We compare the performance of our proposed scheme with the conventional one with respect to packet loss probability by the number of hops and burst length by computer simulations. As a result, we show that our proposed burst scheme can improve the fairness of the number of hops to the destination router and burst length about the packet loss probability to a conventional one.. |
| 290. |
Burst Dropping Technique for Multi-Hop Networks in Optical Composite Burst Switching
In OCBS (Optical Composite Burst Switching) that can improve the performance of the packet loss probability without FDL (Fiber Delay Line), there is the problem that it is unfair about the number of hops to the destination router and burst length about the packet loss probability. In this paper, for achieving the fairness about the number of hops to the destination router, we propose the burst dropping technique that determines the threshold for head-dropping with the number of hops to the destination router. And we also propose, for achieving the fairness about the burst length, the scheme that processes preferentially the control packet whose number of hops to the core router is large when some control packets arrive in a core router. We compare the performance of our proposed scheme with the conventional one with respect to packet loss probability by the number of hops and burst length by computer simulations. As a result, we show that our proposed burst scheme can improve the fairness of the number of hops to the destination router and burst length about the packet loss probability to a conventional one.. |
| 291. |
荒川 豊, 佐久田 誠, 笹瀬 巌, OCBSネットワークにおいてIPパケット長を考慮したバースト生成方式, 電子情報通信学会技術研究報告. IN, 情報ネットワーク, 2002.09, コアノードにおける出力競合(ブロッキング)の際にバーストの前方が棄却されるOCBS(Optical Composite Burst Switching)において,バースト生成時にバーストの前方に大きなパケットを配置することによって,ブロッキングによるIPパケットの損失を最小にできるIPパケット長を考慮したバースト生成方式を提案する.さらに提案方式では,パケットの並び順に優先度をマッピングすることでQos制御も可能となる.計算機シミュレーションにより評価し,従来方式と比較してIPパケット棄却率特性が改善するとともに,QoS制御が可能となることを示す.. |
| 292. |
荒川 豊, 佐久田 誠, 笹瀬 巌, OCBSネットワークにおいてIPパケット長を考慮したバースト生成方式, 電子情報通信学会技術研究報告. IN, 情報ネットワーク, 2002.09, コアノードにおける出力競合(ブロッキング)の際にバーストの前方が棄却されるOCBS(Optical Composite Burst Switching)において,バースト生成時にバーストの前方に大きなパケットを配置することによって,ブロッキングによるIPパケットの損失を最小にできるIPパケット長を考慮したバースト生成方式を提案する.さらに提案方式では,パケットの並び順に優先度をマッピングすることでQos制御も可能となる.計算機シミュレーションにより評価し,従来方式と比較してIPパケット棄却率特性が改善するとともに,QoS制御が可能となることを示す.. |
| 293. |
Port Selected Packet Discarding scheme in ATM Networks
Early Packet Discard (EPD), one of the congestion control schemes at ATM switch in IP over ATM network, enables us to use the link bandwidth and buffer space efficiently. However there is a problem that buffer overflowed, when many links are connected to the ATM switch and packets arrive at the ATM switch form most of them. In this paper, we propose a new packet discarding scheme to improve the badput performance by employing two thresholds corresponding to the number of packets accepted at the same time. By computer simulations, we evaluate a badput and a throughput of the proposed model and the conventional model. As a result, we show our proposed model is drastically improved badput performance without causing the degradation of the throughput.. |
| 294. |
Port Selected Packet Discarding scheme in ATM Networks
Early Packet Discard (EPD), one of the congestion control schemes at ATM switch in IP over ATM network, enables us to use the link bandwidth and buffer space efficiently. However there is a problem that buffer overflowed, when many links are connected to the ATM switch and packets arrive at the ATM switch form most of them. In this paper, we propose a new packet discarding scheme to improve the badput performance by employing two thresholds corresponding to the number of packets accepted at the same time. By computer simulations, we evaluate a badput and a throughput of the proposed model and the conventional model. As a result, we show our proposed model is drastically improved badput performance without causing the degradation of the throughput.. |
| 295. |
Yutaka Arakawa, Y. Akiyama, K. Sakamoto, Y. Nishino, I. Sasase, Port selected packet discarding scheme in ATM networks, 2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 2001), 2001.01, Early Packet Discard (EPD), one of the congestion control schemes at ATM switch in IP over ATM networks, enables us to use efficiently the link bandwidth and buffer space. However there is a problem that buffer overflow occurs, when many links are connected to the ATM switch and packets arrive at the ATM switch from most of them. In this paper, we propose a new packet discarding scheme in which the number of ports accepted at the same time is taken into account. In the proposed scheme, by using two thresholds, packets are discarded according to the number of ports accepted at the same time. By computer simulations, we evaluate a badput and a throughput of the proposed scheme and compare them with those of the conventional scheme. As a result, we show our proposed scheme can improve badput performance without causing the degradation of the throughput.. |
