This paper presents a strategy together with tool support for the translation of state machines from equational theories into rewrite theories, aiming at automatically generating rewrite theory specifications. Duplicate effort can be saved on specifying state machines both in equational theories and rewrite theories, when we incorporate the theorem proving facilities of CafeOBJ with the model checking facilities of Maude. Experimental results show that efficiencies of the generated specifications by the proposed strategy are significantly improved, compared with those that are generated by three other existing translation strategies.

Navigation systems providing route-guidance and traffic information are one of the most widely used driver-support systems these days. Most navigation systems are based on the map paradigm which plots the driving route in an abstracted version of a two-dimensional electronic map. Recently, a new navigation paradigm was introduced that is based on the augmented reality (AR) paradigm which displays the driving route by superimposing virtual objects on the real scene. These two paradigms have their own innate characteristics from the point of human cognition, and so complement each other rather than compete with each other. Regardless of the paradigm, the role of any navigation system is to support the driver in achieving his driving goals. The objective of this work is to investigate how these map and AR navigation paradigms impact the achievement of the driving goals: productivity and safety. We performed comparative experiments using a driving simulator and computers with 38 subjects. For the effects on productivity, driver's performance on three levels (control level, tactical level, and strategic level) of driving tasks was measured for each map and AR navigation condition. For the effects on safety, driver's situation awareness of safety-related events on the road was measured. To find how these navigation paradigms impose visual cognitive workload on driver, we tracked driver's eye movements. As a special factor of driving performance, route decision making at the complex decision points such as junction, overpass, and underpass was investigated additionally. Participant's subjective workload was assessed using the Driving Activity Load Index (DALI). Results indicated that there was little difference between the two navigation paradigms on driving performance. AR navigation attracted driver's visual attention more frequently than map navigation and then reduces awareness of and proper action for the safety-related events. AR navigation was faster and better to support route decision making at the complex decision points. According to the subjective workload assessment, AR navigation was visually and temporally more demanding.

A Modified Hierarchical 3D-Torus (MH3DT) network is a 3D-torus network consisting of multiple basic modules, in which each basic module itself is a 3D-torus network. Inter-node communication performance has been evaluated using dimension-order routing and 2 virtual channels (VCs) under uniform traffic patterns but not under non-uniform traffic patterns. In this paper, we evaluate the inter-node communication performance of MH3DT under five non-uniform traffic patterns and compare it with other networks. We found that under non-uniform traffic patterns, the MH3DT yields high throughput and low latency, providing better inter-node communication performance compared to H3DT, TESH, mesh, and torus networks. Also, we found that non-uniform traffic patterns have higher throughput than uniform traffic in the MH3DT network.

For realistic scale-free networks, we investigate the traffic properties of stochastic routing inspired by a zero-range process known in statistical physics. By parameters α and δ, this model controls degree-dependent hopping of packets and forwarding of packets with higher performance at more busy nodes. Through a theoretical analysis and numerical simulations, we derive the condition for the concentration of packets at a few hubs. In particular, we show that the optimal α and δ are involved in the trade-off between a detour path for α < 0 and long wait at hubs for α > 0; In the low-performance regime at a small δ, the wandering path for α < 0 better reduces the mean travel time of a packet with high reachability. Although, in the high-performance regime at a large δ, the difference between α > 0 and α < 0 is small, neither the wandering long path with short wait trapped at nodes (α = -1), nor the short hopping path with long wait trapped at hubs (α = 1) is advisable. A uniformly random walk (α = 0) yields slightly better performance. We also discuss the congestion phenomena in a more complicated situation with packet generation at each time step.

To provide convenient wireless access, wireless mesh networks (WMNs) can be rapidly deployed and connected for mobile clients. Although route redirection traffic control schemes and dynamic routing metrics can be used to improve the performance of WMNs, more of the available network bandwidth will be consumed by control message exchange. This paper proposes a capacity-aware and multipath supported traffic control framework in WMNs. The proposed framework can be used to dispatch data traffic in a multipath manner to improve the utilization of wireless links and forwarding latency. A hierarchical queue architecture is proposed to monitor and classify network traffic without the effort of control message exchange. Our traffic control strategy, which is based on local minimization of the forwarding latency, consists of two phases to automatically adapt to the utilization rate of the network links. In the first phase, the incoming packets are dispatched to the lower level queues according to the Internet gateway capacity. In the second phase, the packets are dispatched to the related network links according to the link load. The current study implements the proposed traffic control system on NS2 for simulation and on Linux 2.6 for real traffic analysis. Experimental results show that the proposed framework improves the throughput and reduces forwarding delay with an approximate minimum delay time. The results also show that the behavior of the long-term delay model can be applied to short-term traffic control methods in WMNs.

Simple half-duplex repetition-based relaying protocols can achieve spatial diversity at the expense of additional relaying signals in the time domain. In this paper, a linear unitary precoder based on a singular vector for cooperative systems with the amplify-and-forward (AF) relaying protocol is proposed in order to improve spectral efficiency. An exact expression of the precoder design is first derived for the case of equal power allocation. Then, water-filling power allocation is used in conjunction with the precoder to further increase the system capacity, where the precoder matrix is generated with an iterative process. From the implementation point of view, the channel state information (CSI) has to be estimated and quantized in systems, the detail of which is described in the sequel. The adaptive modulation and coding (AMC) technique with the proposed precoder is also discussed to achieve high throughput performance. Finally, numerical and simulation results are presented to demonstrate the effectiveness of the proposed technique in improving capacity and throughput.

A new network measurement primitive was recently proposed, known as long duration flows (LDF). LDF deserves special attention for network management and security monitoring. This kind of traffic appears periodically and persistently through a long period, but its total amount of traffic is not necessarily large. This feature makes detection difficult especially when the resources of detection system are limited or the detection should cover high-speed networks. In this paper, we propose a new lightweight data structure and streaming algorithm to detect such traffic.

We investigate the problem of switch port allocation in WDM networks that use the hybrid optical-electronic switching node architecture. The objective is to support given traffic demands while minimizing the number of electronic switch ports used, or equivalently minimizing the number of established lightpaths. We first formulate the problem as a mixed integer linear programming (MILP) problem. However, due to the high computational complexity of exact optimization, we develop a simulated annealing (SA) algorithm to get an approximate solution. Results from the SA algorithm demonstrate that, compared to the optical-electrical-optical (O-E-O) node architecture, a WDM network that employs the hybrid switching node architecture requires many fewer lightpaths. We also develop a lightpath assignment heuristic which requires much less computation time than the SA algorithm while maintaining close objective values. The lightpath assignment heuristic is used to investigate the switch port allocation behaviors. Simulation results show that nodes with high degrees or with small average node distances require large numbers of optical switch ports. Moreover, nodes with large amounts of terminate (originated/destined) traffic require large numbers of electronic switch ports. Since the lightpath assignment heuristic requires small computation time, it can be used in the network design process in which a large number of network scenarios must be considered.

Efficient resource allocation for delay-sensitive traffic, such as telephony and video streaming, in Orthogonal Frequency Division Multiple Access (OFDMA) networks is needed to increase system performance. In our system, users try to achieve a low queuing delay and buffer space usage by competing for transmission over the subchannels. We formulate this problem as a bargaining game and use the Nash Bargaining Solution (NBS) to realize a fair and efficient subchannel allocation for the users. Simulation results show performance improvements, with regard to packet dropping and delay distribution, over other algorithms.

In this paper, we establish our child safety system model related to the addressing contradictory issue of wireless sensor networks caused by the mutual authentication and privacy protection of an end-user. Based on the system model, we propose the novel location-aware and privacy-preserving approach for providing child safety over wireless sensor networks. Although we illustrate our protocol over the sensor networks, the proposed protocol can be operated by various wireless networks (e.g., WiFi and UWB) which can support RSSI (Received Signal Strength Indication). Compared to a few previous works, the proposed approach can show the potential of enhancing accuracy with location information, preserve the privacy of an end-user, and provide the capability of controlling the child safety service to an end-user.

We examined the characteristics of fiber fuse propagation in hole-assisted fibers (HAF). The fiber fuse propagated in the same way as in conventional single-mode fiber (SMF) when the diameter of an inscribed circle linking the air holes (c) was much larger than the diameter of the melted area (Dmelted). The melted area is caused by fiber fuse propagation and Dmelted is assumed to be almost the same size as the plasma. However, when c was much smaller than Dmelted, the fiber fuse did not propagate in HAF with input powers above 15 W at 1480 and 1550 nm. This result indicates that the threshold power of fiber fuse propagation in HAF can be at least 10 times larger than that in conventional SMF in the optical communication band. We also observed the dynamics of fiber fuse termination at a splice point between HAF and a conventional fiber by using a high-speed camera, when c was much smaller than Dmelted. We consider that the reduction in gas density caused by the air holes results in fiber fuse termination. When c was almost the same as Dmelted, we observed a new propagation mode and its dynamics for a fiber fuse with a damage track whose period was approximately 30 times longer than that in conventional SMF. We also made the first observation of a new threshold power (upper threshold) for a fiber fuse.

This letter proposes a simple k-hop flooding scheme for the temporarily lost child node of a multicast tree in a mobile ad hoc network where a group of nodes move together within a bound. Through simulation, we show that our scheme improves the packet delivery ratio of MAODV to be comparable to the epidemic routing with only small additional duplicate packets.

This paper describes a novel channel allocation and DBA (Dynamic Bandwidth Allocation) mechanism for ECDM-PON (Electric Code Division Multiplex -- Passive Optical Network) systems. In the current ECDM-PON systems, each ONU (Optical Network Unit) is limited to 2 or 3 CDM channels. This is because (fixed channel) CDM transmitters are expensive, and tunable CDM transmitters even more expensive. With a small number of CDM channels, the bandwidth utilization ratio is restricted by channel blocking. Our proposed mechanisms can reduce the channel blocking ratio without increasing the number of CDM transmitters or using tunable CDM transmitters. To clarify the advantages of the proposed system performance, we have evaluated the channel non-blocking ratio (Rn) and wasted resource ratio (Rw) when some users request bandwidth more than 100%. Evaluation of the non-blocking ratio, Rn shows that the proposed mechanisms approach the performance of a system with tunable CDM transmitters when the number of ONUs with over 100% traffic load is small. We have also simulated throughput for uniform traffic. In addition to these evaluations, we implemented our proposed mechanism on an FPGA (Field Programming Gate Array) and evaluated the calculation speed to allocate timeslots on CDM channels and a timeline.

Various recent intelligent transport system projects are promoting vehicle safety and efficient vehicular traffic control all over the world. One of ITS applications is a system that solves road traffic problems by using vehicular communications technology. Inter-vehicle communication (IVC) is the communications technology for vehicles to exchange moving vehicle information by wireless networks without any base stations. The Vehicular Ad-hoc Network (VANET) is expected to provide new applications for passengers of vehicles by enabling vehicles to communicate with each other via IVC as well as with roadside base stations via roadside-to-vehicle communications. However, when each vehicle transmits its own information to neighboring vehicles, the amount of information being transmitted increases significantly. To solve this problem, we present a novel real-time recognition method for vehicular traffic congestion via VANET with IVC. Vehicles collect the original GPS information of other vehicles by communicating with each other, and they create content that may be useful for drivers by analyzing that original information. The proposed method can reduce the information amount and deliver the analyzed contents to other vehicles efficiently. Computer simulation results show that the proposed method provides real-time information of vehicular accidents and traffic congestion to distant vehicles accurately.

This letter presents integrating algorithms for affine constraints defined on a manifold. We first explain definition and geometric representation of affine constraints. Next, we derive integrating algorithms to calculate independent first integrals of affine constraints for the two cases where the they are completely integrable and partially nonintegrable. Moreover, we prove the existence of inverse functions in the algorithms. Some examples are also shown to verify our results.

Dedicated Short Range Communication (DSRC) employs one control channel for safety-oriented applications and six service channels for non-safety commercial applications. However, most existing multi-channel schemes require all neighboring vehicles periodically (e.g. every 100 milliseconds) tune to the control channel for a full update of safety-oriented data before they can switch to the service channels for non-safety services. The safety exchange interval increases with the increase of traffic density. Consequently, under high traffic densities, the service channels are often completely idle while the control channel is congested. We propose a RSU Assisted Multi-channel Coordination MAC (RAMC) protocol that fully utilizes all channels to provide simultaneous safety and non-safety communications. Within the radio range of a roadside unit (RSU), vehicles are free to tune to any service channel. The RSU monitors all the safety messages being transmitted in both the control and service channels. Periodically, the RSU broadcasts a consolidated traffic view report to all neighboring vehicles in all channels. Therefore, a vehicle can operate in a service channel as long as it needs to achieve high throughput for non-safety applications, while maintaining adequate and timely safety awareness. Our simulation results show that the proposed RAMC protocol consistently achieves very high percentage of non-safety usage, while maintaining high safety message delivery ratios in various traffic density conditions.

One of the most important duties of government is to maintain safety. In 2007, the Ministry of Internal Affairs and Communications of Japan tested 16 different models of a safety support system for children on school routes. One of the models was constructed and tested at a school in an area of the city of Hiroshima from September to December of 2007. A consortium was established by the city of Hiroshima; Hiroshima City University; Chugoku Electric Power Co., Inc.; and KDDI Corporation to conduct this project. For the model project, we developed a new safety support system for children on school routes by using a mobile ad hoc network constructed from mobile phones with the Bluetooth function. About 500 students and 50 volunteers used this system for four months. The support system provided good performance and accuracy in maintaining the safety of students on the way to school [7]. The basic idea of the safety support system is the grouping of children and volunteers using a mobile ad hoc network. In this paper, we present an outline of this system and evaluate the performance of grouping and the effectiveness of our approach.

This paper proposes a new kind of communication system for air traffic control over the oceans; it is particularly effective at handling high air traffic loads due to many oceanic flights. In this system, each aircraft position report is sent to its relevant ground station by forwardly relaying them via a multi hop ad-hoc network that is formed by the aircraft between this aircraft and the ground station. In addition, an effective multiple access scheme with optimal values is also proposed. This scheme enables the various aircraft involved in relaying the signal to operate autonomously in a flight-route airspace. Furthermore, two useful schemes are proposed for efficient timeslot reuse and timeslot assignment in cases of low aircraft densities: the position aided timeslot reuse (PATR) and distance based timeslot assignment (DBTA), respectively. Finally, another scheme is proposed to improve the achievable relayed packet rate under low aircraft densities, which is called interference-based node selection (IB-NS). In all, the proposed system combined with those three schemes show the availability to utilize this system for air traffic control communications, specifically on high traffic ocean routes.

Spectrum sensing is a fundamental function for cognitive radio network to protect transmission of primary system. Cooperative spectrum sensing, which can help increasing sensing performance, is regarded as one of the most promising methods in realizing a reliable cognitive network. In such cooperation system, however the communication resources such as sensing time delay, control channel bandwidth and consumption energy for reporting the cognitive radio node's sensing results to the fusion center may become extremely huge when the number of cognitive users is large. In this paper, we propose an ordered sequential cooperative spectrum sensing scheme in which the local sensing data will be sent according to its reliability order to the fusion center. In proposed scheme, the sequential fusion process is sequentially conducted based on Dempster Shafer theory of evidence's combination of the reported sensing results. Above all, the proposed scheme is highly feasible due to the proposed two ordered sequential reporting methods. From simulation results, it is shown that the proposed technique not only keeps the same sensing performance of non-sequential fusion scheme but also extremely reduces the reporting resource requirements.

This paper describes an affine motion estimation processor for real-time video segmentation. The processor estimates the dominant motion of a target region with affine parameters. The processor is based on the Pseudo-M-estimator algorithm. Introduction of an image division method and a binary weight method to the original algorithm reduces data traffic and hardware costs. A pixel sampling method is proposed that reduces the clock frequency by 50%. The pixel pipeline architecture and a frame overlap method double throughput. The processor was prototyped on an FPGA; its function and performance were subsequently verified. It was also implemented as an ASIC. The core size is 5.05.0 mm2 in 0.18 µm process, standard cell technology. The ASIC can accommodate a VGA 30 fps video with 120 MHz clock frequency.