This paper proposes a MAC protocol for efficient broadcasting in wireless ad hoc networks. Pure flooding leads to serious redundant broadcasts, packet contention and packet collisions, known as the broadcast storm problem. This paper focuses on how to reduce the redundant broadcasts. Several protocols to achieve efficient broadcasting have been proposed. However a trade-off exists between the reachability and the broadcasting ratio, which is the ratio of the number of the broadcasting nodes to the number of received nodes. This paper proposes a new MAC protocol for on-demand broadcasting, which is referred to as dialogue-based protocol in order to resolve the trade-off. The dialogue-based protocol employs additional massages which are called as request packets and reply signals. They are exchanged in an on-demand manner, in order that relay candidate nodes recognize its neighbor nodes status whether they have already received the broadcast packets. Finally, by computer simulations, this paper presents that the dialogue-based scheme combines high reachability with low broadcasting ratio by using the low additional massages.

In this letter, we propose a new energy efficient online routing algorithm for QoS-sensitive sensor networks. An important design principle underlying our algorithm is online decision making based on real time network estimation. This on-line approach gives adaptability and flexibility to solve a wide range of control tasks for efficient network performance. In addition, our distributed control paradigm is practical for real sensor network management. Simulation results indicate the superior performance of our algorithm between energy efficiency and QoS provisioning.

The IEEE 1500 standard wrapper requires that its inputs and outputs be interfaced directly to the chip's primary inputs and outputs for controllability and observability. This is typically achieved by providing a dedicated Test Access Mechanism (TAM) between the wrapper and the primary inputs and outputs. However, when reusing the embedded Network-on-Chip (NoC) interconnect instead of the dedicated TAM, the standard wrapper cannot be used as is because of the packet-based transfer mechanism and other functional requirements by the NoC. In this paper, we describe two NoC-compatible wrappers, which overcome these limitations of the 1500 wrapper. The wrappers (Type 1 and Type 2) complement each other to optimize NoC bandwidth utilization while minimizing the area overhead. The Type 2 wrapper uses larger area overhead to increase bandwidth efficiency, while Type 1 takes advantage of some special configurations which may not require a complex and high-cost wrapper. Two wrapper optimization algorithms are applied to both wrapper designs under channel-bandwidth and test-time constraints, resulting in very little or no increase in the test application time compared to conventional dedicated TAM approaches.

Routing in Ad-hoc networks is unreliable due to the mobility of the nodes. Location-based routing protocols, unlike other protocols which rely on flooding, excel in network scalability. Furthermore, new location-based routing protocols, like, e.g. BLR [1] , IGF [2], & CBF [3] have been proposed, with the feature of not requiring beacons in MAC-layer, which improve more in terms of scalability. Such beaconless routing protocols can work efficiently in dense network areas. However, these protocols' algorithms have no ability to avoid from routing into sparse areas. In this article, historical signal strength has been added as a factor into the BLR algorithm, which avoids routing into sparse area, and consequently improves the global routing efficiency.

In Mobile Ad-hoc Networks (MANET), transportation capability of wireless links' varies according to the size of the packets they transport. This instability, which is more acute in long links, has received little attention in the stabilizing schemes proposed so far for MANET. A lot of research has been carried out to utilize more reliable links in making end-to-end routes to avoid frequent route failures and realize higher packet delivery ratio. However, these approaches mainly consider the availability of a link over time and depend on link history which is difficult to acquire in highly dynamic systems. In this paper, we present an easy-to-implement but efficient method to find suitable end-to-end routes that are capable of transporting different sizes of the application data packets. Our scheme is stateless and does not rely on the underlying data link and physical layers. An extensive simulation shows the validity of our concept and highlights the improvement achieved by our proposal.

"Dive into the Movie (DIM)" is a name of project to aim to realize a world innovative entertainment system which can provide an immersion experience into the story by giving a chance to audience to share an impression with his family or friends by watching a movie in which all audience can participate in the story as movie casts. To realize this system, several techniques to model and capture the personal characteristics instantly in face, body, gesture, hair and voice by combining computer graphics, computer vision and speech signal processing technique. Anyway, all of the modeling, casting, character synthesis, rendering and compositing processes have to be performed on real-time without any operator. In this paper, first a novel entertainment system, Future Cast System (FCS), is introduced which can create DIM movie with audience's participation by replacing the original roles' face in a pre-created CG movie with audiences' own highly realistic 3D CG faces. Then the effects of DIM movie on audience experience are evaluated subjectively. The result suggests that most of the participants are seeking for higher realism, impression and satisfaction by replacing not only face part but also body, hair and voice. The first experimental trial demonstration of FCS was performed at the Mitsui-Toshiba pavilion of the 2005 World Exposition in Aichi Japan. Then, 1,640,000 people have experienced this event during 6 months of exhibition and FCS became one of the most popular events at Expo.2005.

Multicast is an efficient transport mechanism for group-based community communications and mobile ad-hoc networks (MANET) is recently regarded as a promising solution for supporting ubiquitous computing as an underlying network technology. However, it is challenging to deploy the multicast mechanism used in a wired network directly into MANET owing to scarce resources in wireless networks and unpredictable changes in network topology. Several multicast mechanisms have been proposed in the literature to overcome these limitations. In MANET, especially, overlay multicasting schemes present several advantages over network-based multicasting schemes. However we have observed a common limitation of previously proposed overlay multicasting schemes. They introduce redundant data transmissions that waste network bandwidth and the battery of relay nodes. The observation motivated us to propose an efficient way to create and maintain a "semi-overlay structure" that utilizes a few nonmember nodes selected as branch nodes. The proposed scheme, called "SOMRP (Semi-overlay multicast routing protocol)," has been evaluated by using extensive network simulation in two different scenarios, comparing the performance of SOMRP with two previously proposed schemes. Simulation results show that SOMRP outperforms the two schemes in terms of the packet delivery ratio, transmission cost and end-to-end delay.

In mobile multi-hop networks, a source node S and a destination node D sometimes encounter a situation where there is no multi-hop path between them when a message M, destined for D, arrives at S. In this situation, we cannot send M from S to D immediately; however, we can deliver M to D after waiting some time with the help of two capabilities of mobility. One of the capabilities is to construct a connected multi-hop path by changing the topology of the network during the waiting time (Capability 1), and the other is to move M closer to D during the waiting time (Capability 2). In this paper, we consider three methods to deliver M from S to D by using these capabilities in different ways. Method 1 uses Capability 1 and sends M from S to D after waiting until a connected multi-hop path appears between S and D. Method 2 uses Capability 2 and delivers M to D by allowing a mobile node to carry M from S to D. Method 3 is a combination of Methods 1 and 2 and minimizes the waiting time. We evaluate and compare these three methods in terms of the mean waiting time, from the time when M arrives at S to the time when D starts receiving M, as a new approach to connectivity evaluation. We consider a one-dimensional mobile multi-hop network consisting of mobile nodes flowing in opposite directions along a street. First, we derive some approximate equations and propose an estimation method to compute the mean waiting time of Method 1. Second, we theoretically analyze the mean waiting time of Method 2, and compute a lower bound of that of Method 3. By comparing the three methods under the same assumptions using results of the analyses and some simulation results, we show relations between the mean waiting times of these methods and show how Capabilities 1 and 2 differently affect the mean waiting time.

Satellite broadcasting in the 21-GHz band is expected to transmit large-capacity signals such as ultrahigh-definition TV. However, this band suffers from large amounts of rain attenuation. In this regard, we have been studying rain fading mitigation techniques, in which the radiation power is increased locally in the area of heavy rainfall. To design such a satellite broadcasting system, it is necessary to evaluate service availability when using the locally increased beam technique. The rain attenuation data should be derived from the rainfall rate data. We developed a method to transform rainfall rate into rain attenuation in the 21 GHz band. Then, we performed a simulation that applied the method to the analysis of the service availability for an example phased array antenna configuration. The results confirmed the service availability increased with the locally increased beam technique.

Auditory artifacts due to switching head-related transfer functions (HRTFs) are investigated, using a software-implemented dynamic virtual auditory display (DVAD) developed by the authors. The DVAD responds to a listener's head rotation using a head-tracking device and switching HRTFs to present a highly realistic 3D virtual auditory space to the listener. The DVAD operates on Windows XP and does not require high-performance computers. A total system latency (TSL), which is the delay between head motion and the corresponding change of the ear input signal, is a significant factor of DVADs. The measured TSL of our DVAD is about 50 ms, which is sufficient for practical applications and localization experiments. Another matter of concern is the auditory artifact in DVADs caused by switching HRTFs. Switching HRTFs gives rise to wave discontinuity of synthesized binaural signals, which can be perceived as click noises that degrade the quality of presented sound image. A subjective test and excitation patterns (EPNs) analysis using an auditory filter are performed with various source signals and HRTF spatial resolutions. The results of the subjective test reveal that click noise perception depends on the source signal and the HRTF spatial resolution. Furthermore, EPN analysis reveals that switching HRTFs significantly distorts the EPNs at the off signal frequencies. Such distortions, however, are masked perceptually by broad-bandwidth source signals, whereas they are not masked by narrow-bandwidth source signals, thereby making the click noise more detectable. A higher HRTF spatial resolution leads to smaller distortions. But, depending on the source signal, perceivable click noises still remain even with 0.5-degree spatial resolution, which is less than minimum audible angle (1 degree in front).

The center-feed in a single-layer slotted waveguide array[1]-[3] is one of the key components in polarization division duplex (PDD) wireless systems. Two center-feed arrays with orthogonal polarization and boresight beams are orthogonally arranged side-by-side for transmission and reception, simultaneously. Each antenna has extremely high XPD (almost 50 dB in measurement) and a very high isolation (over 80 dB in measurement) between two arrays is observed provided the symmetry of slot arrangement is preserved [4]. Unfortunately, the area blocked by the center feed causes high sidelobe levels. This paper proposes the ridged cross-junction multiple-way power divider for realizing blockage reduction and symmetrical slot arrangement at the same time.

In this paper, we investigated the effect of chromaticity and luminance of surround to decide subject neutral white, and conducted a mathematical model of adapting degree for environment. Factors for adapting degree consist of two parts, adapting degree of ambient chromaticity and color saturation. These can be applied to color appearance models (CAM), actually improve the performance of color matching of CAM, hence would produce the method of image reproduction to general display systems.

PIN diodes for digital X-ray detection as a single photon counting sensor were fabricated on a floating-zone (FZ) n-type (111), high resistivity (5-10 kΩcm) silicon substrates (500 µm thickness). Its electrical properties such as the leakage current and the breakdown voltage were characterized. The size of pixels was 100 µm100 µm. The p+ guard-ring was formed around the active area to reduce the leakage current. After the p+ active area and guard-ring were fabricated by the ion-implantation, the extrinsic-gettering on the wafer backside was performed to reduce the leakage current by n+ ion-implantation. PECVD oxide was deposited as an IMD layer on front side and then, metal lines were formed on both sides of wafers. The leakage current of detectors was significantly reduced with a guard-ring when compared with that without a guard ring. The leakage current showed the strong dependency on the gap distance between the active area and the guard ring. It was possible to achieve the leakage current lower than 0.2 nA/cm2.

We consider a class of nonlinear time delay systems with time-varying delays, and achieve a time delay independent sufficient condition for the global asymptotic stability. The sufficient condition is proved by constructing a continued fraction that represents the lower and upper bound variations of the system trajectory along the current of time, and showing that the continued fraction converges to the equilibrium point of the system. The simulation results show the validity of the sufficient condition, and illustrate that the sufficient condition is a close approximation to the unknown necessary and sufficient condition for the global asymptotic stability.

A stacked square microstrip antenna with shorting plates is proposed for wide band operation. The vswr 2 with gain at θ=0 0 dBi is achieved in the frequency range between the first and second resonant frequencies by loading the two shorting plates. The proposed antenna has bandwidth of approximately 60%.

The Bloom Filter (BF), a space-and-time-efficient hash-coding method, is used as one of the fundamental modules in several network processing algorithms and applications such as route lookups, cache hits, packet classification, per-flow state management or network monitoring. BF is a simple space-efficient randomized data structure used to represent a data set in order to support membership queries. However, BF generates false positives, and cannot count the number of distinct elements. A counting Bloom Filter (CBF) can count the number of distinct elements, but CBF needs more space than BF. We propose an alternative data structure of CBF, and we called this structure an Adaptive Bloom Filter (ABF). Although ABF uses the same-sized bit-vector used in BF, the number of hash functions employed by ABF is dynamically changed to record the number of appearances of a each key element. Considering the hash collisions, the multiplicity of a each key element on ABF can be estimated from the number of hash functions used to decode the membership of the each key element. Although ABF can realize the same functionality as CBF, ABF requires the same memory size as BF. We describe the construction of ABF and IABF (Improved ABF), and provide a mathematical analysis and simulation using Zipf's distribution. Finally, we show that ABF can be used for an unpredictable data set such as real network traffic.

Recently, cyber attacks have become a serious hindrance to the stability of Internet. These attacks exploit interconnectivity of networks, propagate in an instant, and have become more sophisticated and evolutionary. Traditional Internet security systems such as firewalls, IDS and IPS are limited in terms of detecting recent cyber attacks in advance as these systems respond to Internet attacks only after the attacks inflict serious damage. In this paper, we propose a hybrid intrusion forecasting system framework for an early warning system. The proposed system utilizes three types of forecasting methods: time-series analysis, probabilistic modeling, and data mining method. By combining these methods, it is possible to take advantage of the forecasting technique of each while overcoming their drawbacks. Experimental results show that the hybrid intrusion forecasting method outperforms each of three forecasting methods.

It is important to monitor routing protocols to ensure IP networks and their operations can maintain sufficient level of stability and reliability because IP routing is an essential part of such networks. In this paper, we focus on Open Shortest Path First (OSPF), a widely deployed intra-domain routing protocol. Routers running OSPF advertise their link states on Link State Advertisements (LSAs) as soon as they detect changes in their link states. In IP network operations, it is important for operators to ascertain the location and type of a failure in order to deal with failures adequately. We therefore studied IP network failure identification based on the monitoring of OSPF LSAs. There are three issues to consider in regard to identifying network failures by monitoring LSAs. The first is that multiple LSAs are flooded by a single failure. The second is the LSA delay, and the third is that multiple failures may occur simultaneously. In this paper, we propose a method of network failure identification based on a detailed analysis of OSPF LSA flooding that takes into account the above three issues.

Failure avoidance capability is a desired feature for telecommunication networks, such as the Internet. However, not all failures can be promptly bypassed on the Internet because routing systems that are responsible for detecting and avoiding failures cannot detect all failures. Consequently, failures can interrupt internet communications for a long time, such as a few hours. This paper proposes a novel routing architecture called Drouting that enables flexible failure avoidance. In Drouting, routers calculate multipaths from a source to a destination by constructing Directed Acyclic Graphs (DAGs) that include all links in the intra-domain network graph. IP packets carry packet tags that are set by the end host. The packet tags are used to select a network path from the multipath routes. In this paper, the failure avoidance property of Drouting architecture is evaluated through comparison with another proposal, Deflection, using simulations. Simulations were performed on inferred and synthetic topologies. Drouting exhibits similar performance with Deflection in terms of the number of nexthops, the number of paths and the length of paths, while Drouting outperforms Deflection in the probability of success of failure avoidance.

This paper presents an asynchronous design technique, an enabler for the emerging technology of flexible microelectronics that feature low-temperature processed polysilicon (LTPS) thin-film transistors (TFT) and surface-free technology by laser annealing/ablation (SUFTLA®). The first design instance chosen is an 8-bit microprocessor. LTPS TFTs are good for realizing displays having integrated VLSI circuit at lower costs. However, LTPS TFTs have drawbacks, including substantial deviations in characteristics and the self-heating phenomenon. To solve these problems, the authors adopted the asynchronous circuit design technique and developed an asynchronous design language called Verilog+, which is based on a subset of Verilog HDL® and includes minimal primitives used for describing the communications between modules, and the dedicated tools including a translator called xlator and a synthesizer called ctrlsyn. The flexible 8-bit microprocessor stably operates at 500 kHz, drawing 180 µA from a 5 V power source. The microprocessor's electromagnetic emissions are 21 dB less than those of the synchronous counterpart.