Presents a listing of the Symposium organizing committee.

Timing synchronization is essential in cases where multiple sensor nodes with ultrasonic sensors are deployed in the same place. This is because ultrasonic sensors should be powered at a precise timing so as to prevent ultrasonic interference. A harmful-birds scaring system utilizing a new timing-synchronization method for a Zig Bee sensor network is proposed. In this method, the processing load for synchronizing the timing of ultrasonic sensors is concentrated at the server. Accordingly, the amount of calculation on each node can be minimized and is unaffected by increasing the number of nodes. Experimental evaluation of the proposed method, applied in an ecology observation by a sensor array, was shown that it sufficiently fulfills the timing requirement for the proposed harmful-birds scaring system.

In this paper, we propose a new real-time guidance system which is equipped with an indoor positioning technology for visitors in hospitals. In order to estimate a user's position without affecting operation of medical equipment, our proposed system utilizes a combination of RSSI of Personal Handy-phone System (PHS) and Dead-Reckoning based on sensors of an Android device. As a first step of the study, feasibility of indoor RSSI of PHS and sensors of the Android device for the position estimating is evaluated. Through the evaluation, we have clarified that the position estimation of the user is possible by confirming the RSSI of signals transmitted from multiple PHS base stations, and a gyroscope of the Android device can be utilized to detect moving direction of the user.

In the environmental and ecology observation, the sensor network has been commonly used, but it is difficult to deploy it in a vast field or some special environments such as a forest or a mountainous area. To solve this problem, we propose a new sensor network system based on a DTN technology to collect environmental observation data automatically using an autonomous air vehicle. In particular, an autonomous flight algorithm for the air vehicle using GPS sensor is developed. We have also performed some experiments to evaluate practicality of the proposed system.

In this paper, we propose a new browser synchronization system, which supports elderly people and IT shortfalls to learn how to use on-line shopping services from a support person on a remote site. A key feature of the proposed system is to synchronize browsers without a centralized server, and it works even if user terminals are placed behind a NAT device. In order to traverse the NAT, the proposed system uses a Simple Traversal of UDP through NATs (STUN) server and a mail server. In addition, a packet loss compensation method is implemented in order for the proposed system to avoid a mis-synchronization due to UDP packet losses. We have implemented the proposed system to Linux/Windows and Android tablets. From an evaluation of the proposed methods, it has been concluded that contents on browsers can be synchronized within a sufficiently short time.

Timing synchronization is essential in case where multiple sensor nodes with ultrasonic sensors are deployed on the same place. This is because the ultrasonic sensors should be powered at an appropriate timing so as to prevent ultrasonic interference. In this paper, we propose a new timing synchronization method for ZigBee sensor network for ecology observation. In this method, a sensor node has been configured as a ZigBee router in order to exchange time information among nodes in real-time. Moreover, by concentrating the processing load to the server, the amount of calculation at each node can be minimized and is unaffected by the increase in nodes. By using the proposal method, it is concluded that the time synchronization should be executed per every few minutes in order to detect moving objects by the ultrasonic sensors.

With a wide spread of smartphones and tablets, a mobile network becomes frequently congested when many users concentrate to the same place. Especially when a large-scale event is held, a heavy network congestion interferes with the communication of the participants and local residents. In order to detect the network congestion, a large amount of traffic log should be analyzed in real time. In this paper, the proposed system attempts to detect a sign of the congestion by using a Complex Event Processing (CEP). We analyze network status when the large-scale event, Nagaoka Fireworks festival, is held. As a result, it is concluded that a sign of the network congestion can be detected by combination of the RTT and the abnormal termination of TCP sessions.

By utilizing a new network protocol, Locator/Identifier Separation Protocol (LISP), a global IP multicasting system can be achieved without modifying protocol stacks of routers on the Internet. A mapping system which manages relationship between each multicast group and the group members is a core component of the system, but the centralized system requires costly resources for handling a large-scale network. In this study, a new decentralized mapping system for LISP- based information multicasting system is proposed. The proposed system utilizes a structured P2P network consisting of LISP routers to manage the membership information of multicast groups, and collaborates with two proximity-aware methods in order to shorten the start-up time needed for newly-arrived multicast members to start communicating with other members. The first method enables LISP routers to connect to lower- latency neighbors, and the second one replicates the membership information on a router which is close to all group members. This paper considers the performance of the proposed system by using a large-scale computer simulation and clarifies that the proposed mapping system with both methods can halve the start- up time compared with the simple P2P-based system.

With the wide-spread use of high-speed network connections and high performance computing resources available over the Internet, live video broadcasting services have become available on the Internet. In this service, anyone who has a laptop, desktop, or mobile terminal with a camera can broadcast his own video to any user who is interested in watching it in real time. Such a system must be able to accommodate a large number of simultaneous video broadcasts and allow the user to locate the desired content quickly. Furthermore, it should minimize the end-to-end streaming delay between the video broadcaster and the viewer to support the real-time video broadcasting. In order to satisfy these requirements, the advantages of peer-to-peer network technology must be leveraged to build a completely distributed live video broadcasting system. Peer-to-peer technology makes it possible for the system to efficiently match video broadcasting to the interested viewers, and to select the appropriate resources that can distribute the streamed content to all viewers in real time. This paper considers the performance of the proposed system using a realistic computer simulation to show that the system has scalability for a large-scale distributed system that attracts a very large number of users.

The Border Gateway Protocol (BGP) is one of the key components of today's Internet infrastructure. Many ISPs rely on BGP for convergence of inter-domain routes upon BGP link failures. However, the convergence of BGP requires several seconds of downtime, which may cause critical performance degradation of applications. In this paper, we propose the use of an intra-domain routing protocol to provide IP fast reroute for BGP link failures. The proposed scheme extends OSPF to restore the nexthop IP address associated with the BGP link failure. Since the reachability of the nexthop is restored at the IGP layer, no convergence is required at the BGP layer. We also introduce a recursive lookup mechanism for forwarding of packets to achieve fast update of the forwarding table. Evaluation using a prototype and real BGP prefixes observed in the Internet showed that the proposed scheme is capable of reducing the current recovery time by 13.40 seconds. The proposed scheme performs recovery with limited routers and is effective where Route Reflectors are in place.

The volume of mass unsolicited electronic mail, often known as spam, has recently increased enormously and has become a serious threat to not only the Internet but also to society. This paper proposes a new spam detection method which uses document space density information. Although it requires extensive e-mail traffic to acquire the necessary information, an unsupervised learning engine with a short white list can achieve a 98% recall rate and 100% precision. A direct-mapped cache method contributes handling of over 13,000 e-mails per second. Experimental results, which were conducted using over 50 million actual e-mails of traffic, are also reported in this paper.

Integration of video services are addressed. The view that various types of end-to-end quality of service (QOS) for video communications, ranging from videophone to high-definition television (HDTV), should be supported to utilize broadband integrated services digital network (B-ISDN) services and video data is expressed. End-to-end QOS is recognized as a function of terminal capability and network performance. The key feature of B-ISDN is that both terminal capability and network performance are selectable and controllable. In order to capture the basic characteristics of end-to-end QOS, it is necessary to conduct experiments using a prototype system. A prototype system comprising an asynchronous transfer mode (ATM) switch and video codecs is presented. The ATM switch is based on distributed-memory-switch architecture and it will provide for nonblocking cell-switching capability with a very low cell-transfer delay. Developed codecs conform to H.261 with an additional function of controlling average coding bit rate. The coding bit rate is chosen as a parameter of terminal capability and the cell-loss ratio is chosen as a parameter of network performance. From experiments using a prototype system, a relationship between coding bit rate and cell-loss ratio is obtained.>

The authors describe the structure of the worldwide intelligent network (WIN), describe methods for its design and planning, investigate the adequacy of decentralized control for problem-free worldwide call completion, explore the feasibility of adaptive routing and control concepts, discuss network robustness/reliability objectives, and describe a strategy for achieving these objectives for all cooperating international carriers. Several decentralized adaptive routing policies that are particularly attractive in the WIN environment and network performance improvements that can be achieved with the introduction of flexible routing capabilities are characterized. It is shown by example that network integration coupled with flexible routing and bandwidth allocation for preferential treatment of new services provides an effective approach for robust and economical new service provisioning.>