The use of peer-to-peer (P2P) file sharing networks such as Gnutella is proliferating on the Internet, but due to the broadcast nature of the protocols, the use of such applications are bandwidth consuming. This characteristic makes P2P file sharing unsuitable for mobile devices because they have severe bandwidth and power constraints. This paper proposes the MAP2P architecture that uses mobile agents to participate in the Gnutella network on behalf of mobile devices. The aim is to reduce the amount of traffic, and hence the power consumption, for the mobile devices. Moreover, our architecture provides support for device mobility at the application layer. The viability of our architecture is illustrated through our traffic and energy analyses with experiments using our demonstration implementation.

Under dynamic and heterogenous environment, the need for adaptability and rapid response time to information service systems has become increasingly important. To cope with the continuously changing conditions of service provision and utilization, Faded Information Field (FIF) has been proposed, which is an agent-based distributed information service system architecture. In the case of a mono-service request, the system is designed to improve users' access time and preserve load balancing through the information structure. However, with interdependent requests of multi-service increasing, adaptability, reliability and timeliness have to be assured by the system. In this paper, the relationship between the timeliness and the reliability of correlated services allocation and access is clarified. Based on these factors, the autonomous network-based heterogeneous information services integration technology to provide one-stop service for users' multi-service requests is proposed. We proved the effectiveness of the proposed technology through the simulation and the results show that the integrated service can reduce the total users access time compared with the conventional systems.

In this paper we present a network layer based admission control and simple class based service differentiation model to support QoS in mobile ad hoc network. Our distributed admission control procedure works along with the route finding phase of reactive routing protocols for mobile ad hoc network (AODV, DSR etc). We also propose a simple class based distributed service differentiation system to support QoS once a traffic is admitted by our admission control mechanism. The proposed service differentiation is based on DiffServ model and includes modifications like configuration of each node with edge and core functionality, dynamic selection of edge/core functionality, use of minimal and simple classes. Simulation results show that our system allows seven times more real time traffic in the network than the proposed QoS for AODV model while satisfying the demanded end-to-end delay and providing low jitter.

Estimation of unknown signal parameters with sensor array measurements has been investigated quite extensively. Also, there has been in recent years an explosive increase in the number of mobile users in wireless cellular systems, thus contributing to growing levels of multi-user interference. To overcome this problem, application of adaptive antenna array techniques to further increase the channel capacity has been discussed. In this paper, a new model of locally scattered signals in the vicinity of mobiles is proposed by defining the mean steering vector and manipulate it mathematically for several distributions. Under this model an estimation method of the direction of arrival is investigated based on a weighted subspace fitting technique. Statistical analysis and simulations are also considered.

Genetic Algorithms (GA) provide an attractive approach to solving the challenging problem of dynamic routing and wavelength assignment (RWA) in optical Wavelength Division Multiplexing (WDM) networks, because they usually achieve a significantly low blocking probability. Available GA-based dynamic RWA algorithms were designed mainly for WDM networks with a wavelength continuity constraint, and they cannot be applied directly to WDM networks with wavelength conversion capability. Furthermore, the available GA-based dynamic RWA algorithms suffer from the problem of requiring a very time consuming process to generate the first population of routes for a request, which may results in a significantly large delay in path setup. In this paper, we study the dynamic RWA problem in WDM networks with sparse wavelength conversion and propose a novel hybrid algorithm for it based on the combination of mobile agents technique and GA. By keeping a suitable number of mobile agents in the network to cooperatively explore the network states and continuously update the routing tables, the new hybrid algorithm can promptly determine the first population of routes for a new request based on the routing table of its source node, without requiring the time consuming process associated with current GA-based dynamic RWA algorithms. To achieve a good load balance in WDM networks with sparse wavelength conversion, we adopt in our hybrid algorithm a new reproduction scheme and a new fitness function that simultaneously takes into account the path length, number of free wavelengths, and wavelength conversion capability in route selection. Our new hybrid algorithm achieves a better load balance and results in a significantly lower blocking probability than does the Fixed-Alternate routing algorithm, both for optical networks with sparse and full-range wavelength converters and for optical networks with sparse and limited-range wavelength converters. This was verified by an extensive simulation study on the ns-2 network simulator and two typical network topologies. The ability to guarantee both a low blocking probability and a small setup delay makes the new hybrid dynamic RWA algorithm very attractive for current optical circuit switching networks and also for the next generation optical burst switching networks.

The mobile agent paradigm is a promising technology to structure distributed applications. Since mobile agents physically move to a remote host that is under the control of a different principal, they need to be protected from this environment which is responsible for execution. In this paper, we provide a new cryptographic methodology of protecting mobile agents from unauthorized modification for the program code by malicious hosts.

Wireless Internet technologies have been developing and users are now able to access more information anywhere through small screen mobile devices. However, due to the limits of cost, bandwidth and screen size in a wireless environment, it is important to minimize interactions between a mobile user and his handheld device, as well as the amount of data transmitted. In this paper we present an interactive evolutionary approach for user-oriented Web search by using mobile devices. To verify this approach, a series of experiments has been conducted. The results show that our approach can allocate the information a user needs within only a few user-system interactions. It substantially reduces the number of retrieved pages a user has to visit. This is especially an important benefit to mobile users.

When a mobile node that subscribes to one or more multicast groups moves to another subnet, it is essential to provide a network level multicast handoff mechanism. Previous multicast handoff schemes are based on Mobile IP. However it is known that the Mobile IP is not adequate to interactive multimedia applications such as voice over IP or video conferencing due to its large handoff delay. Additionally, few researches have paid attentions on multicast handoff in infrastructure-mode WLAN environment. This paper proposes a fast inter-subnet multicast handoff method in Mobile IP based infrastructure-mode IEEE 802.11 WLAN environment. We introduce a dedicated Multicast Access Point (MAP) that works with an access points specified in standard IEEE 802.11 WLAN in order to alleviate disruption of receiving multicast datagram. Unlike previous research, our scheme does not modify Mobile IP specifications. MAP detects the completion of link-layer handoff, sends unsolicited IGMP Membership report to its local router on behalf of the mobile station and performs unicast tunneling. We evaluate the proposed method using ns-2 simulation. The simulation result shows that the proposed method can reduce the disruption period due to inter-subnet multicast handoff to about 1/12 and the packet loss rate can be reduced to about 1/4 over 20-size multicast group compared with the standard Mobile IP based IEEE 802.11 WLAN.

In recent years, the Internet has come to be able to be used at higher speed and more cheaply everywhere as the broadband service and the wireless LAN service have been provided by various ISPs. In such a ubiquitous environment, a demand for mobile computing environments in the intranet and easy access from remote sites has been increasing greatly as well as the Internet. To meet this requirement, we have proposed a Logical Office service, which is a kind of the mobile VLAN, and enables terminal plug and play, layer two tunneling, and ubiquitous communication. This paper newly proposes that the offer of the IP mobility to not only the movement of the terminal but also existing network services be possible the Logical Office service which we developed. As a result, it was verified to operate existing network services such as wirelesses LAN on the Logical Office service, and for newly existing network services to able to have the IP mobility.

In future, mobile terminals may be linked in various types of local network where the whole network is moving. Mobile networks will need to provide global connectivity to such moving networks and manage their mobility. A moving network consists of mobile terminals and a mobile router, which acts as the gateway to the mobile network. To manage the mobility of the moving network, it is important to minimize the packet overhead, to optimize routing, and to reduce the volume of handoff signals over the mobile network and air interface. This paper proposes a new routing mechanism using hierarchical mobile network prefix assignment, home agent concatenation, hierarchical address management, and hierarchical re-routing. In hierarchical mobile network prefix assignment, a mobile router is assigned a mobile network prefix, which is used as a prefix when allocating the location addresses of mobile terminals in the moving network, so allowing them to be managed in a hierarchical manner. Home agent concatenation limits the number of home agents which need to be updated during handoff by enabling one home agent hold information relating to others, while hierarchical address management minimizes the volume of handoff signals by managing the location addresses of all mobile terminals in a hierarchical manner. Hierarchical re-routing introduces a local anchor router in order to localize handoff and to optimize routing. Simulation results show that our proposed routing method is better than the conventional solutions in terms of efficiency of data transmission including data transmission delay, and handoff performance.

Future broadband mobile communication systems are necessary to achieve the bit rates of 100 Mbit/s. Orthogonal Frequency Division Multiplexing (OFDM) transmission is an attractive technology because it can remove the influence of frequency selective fading in broadband transmission by adding a suitable guard interval to each OFDM symbol. However, peak-to-average power ratio (PAPR) is very large in OFDM transmission. In this paper, we propose a new PAPR reduction method which can be applied even when unusable bands are inside the system band. In the proposed method, peak reduction signals are generated by iterative signal processing only in the usable frequency band, and filtering to remove out-of-band components of the peak reduction signals is incorporated into the iterative signal processing. The results of computer simulation show that the proposed method can effectively reduce peak power without expanding the spectrum both outside the system band and into unusable bands inside the system band. By using the proposed method, the broadband mobile communication system with low peak power and high flexibility of frequency band use can be realized.

To offer location based services, service providers need to have access to Location Information (LI) regarding the users which they wish to serve; this is a potential privacy threat. We propose the use of constraints, i.e. statements limiting the use and distribution of LI, that are securely bound to the LI, as a means to reduce this threat. Constraints may themselves reveal information to any potential LI user--that is, the constraints themselves may also be a privacy threat. To address this problem we introduce the notion of a LI Preference Authority (LIPA). A LIPA is a trusted party which can examine LI constraints and make decisions about LI distribution without revealing the constraints to the entity requesting the LI. This is achieved by encrypting both the LI and the constraints with a LIPA encryption key, ensuring that the LI is only revealed at the discretion of the LIPA.

One of the main issues of Mobile IPv6 is handover latency that causes service disruption time. Although plenty of proposals significantly reduce the service disruption time, they suffer from redundant routing that causes packet misordering and bandwidth consumption during the process of inter-domain handover. In this paper, we propose a new scheme that minimizes the redundant routing during the process of inter-domain handover by utilizing forwarding routers for each correspondent node. Our proposed scheme consists of forwarding router discovery and proactive handover. We evaluate our proposed scheme in the view of packet misordering and bandwidth consumption, and clarify the efficiency of our proposed scheme. We also evaluate the impact of the forwarding routers' capacity since routers have limited resources. By strategically locating forwarding routers, e.g. next to the router that has peering to another domain, the redundant routing caused by inter-domain handover will be efficiently suppressed.

While mobile networks have been enhanced to support a variety of mobile multimedia services such as video telephony and rich data content delivery, a new challenge is being created by the remarkable development of micro-device technologies such as micro processor-chips, sensors, and RF tags. These developments suggest the rapid emergence of the ubiquitous computing environment; computers supporting human life without imposing any stress on the users. The combination of broadband global networks and ubiquitous computing environment will lead to an entirely new class of services, which we call ubiquitous networking services. This paper discusses how to create ubiquitous service environments comparing global networking approaches which are based on fixed and mobile networks. It is shown that the mobile approach is better from service applicability and reliability viewpoints. Networking architecture is proposed which expand 4G mobile cellular networks to real space via gateways on the edges of the mobile network (i.e. mobile terminals). A new set of technical requirements will emerge via this approach, which may accelerate the paradigm shift from the current mobile network architecture and even from the Internet of today.

This paper compared the approaches concerning the pinball routing problem that occurs in the nested network in network mobility environment and developed the analytic framework to model. Each model was evaluated of transmission latency, memory usage, and BU's occurrence number at routing optimization process. The estimation result showed that the optimization mechanism achievement overhead existed in each model, and the full optimization of the specific model was not attained because of it. Therefore, the most appropriate approach for routing optimization in nested NEMO can be determined only after a careful evaluation, and the proposals must consider using it in combination with other approaches. The modeling framework presented in this paper is intended to quantity the relative merits and demerits of the various approaches.

IP multicasting has naturally been considered the ideal technique to be used with multimedia communications but is difficult to mobile hosts due to the addition of mobility in the host group. In this paper, we propose a novel multicast algorithm, namely time and distance-based multicast algorithm (TDBMA), for IPv6-based mobile networks. TDBMA intends to trade off between the shortest delivery path and the frequency of the multicast tree reconfiguration. When a mobile host (MH) moves into a new foreign network which is managed by a foreign network router and re-subscribes to an existing multicast tree, the foreign network router uses the TDBMA to determine whether the MH joins the multicast tree directly or receives the tunneled multicast packets from its home agent (HA). The TDBMA is subject to two key factors, called time and distance. The visited foreign network router can join the multicast tree directly only when the value of both time and distance is true. The simulation results have shown that TDBMA has better performance than other algorithms, especially in the case where the number of MHs is large.

Digital Terrestrial Television (DTV) services began in Japan in December 2003. This paper proposes a novel on-glass antenna for mobile reception of terrestrial television. The gain of the proposed antenna is 4.7 dB higher than commercial monopole antennas when installed on a vehicle. Other merits of this antenna are a broad input impedance bandwidth across the UHF band (470-710 MHz), and the fact that it does not spoil vehicle appearance. Field experiments have confirmed that a diversity system using four of the proposed antennas is capable of mobile DTV reception.

Today, pedestrian navigation systems for mobile phones use 2-dimensional maps as a navigation media in general. But 3-dimensional maps or scenery images are easier to understand for users than 2-dimensional maps. To use 3-dimensional maps or scenery guidance, the measuring accuracy of user position is essential to understand guidance images. In this paper, we will present a pedestrian navigation system using real scenery photographs as a navigation media, and based on experiments we will report the evaluation result of influence of positioning accuracy on the understandability of navigation. It is shown that 3 meters or less error of positioning is tolerable for pedestrian navigation systems using scenery images.

The reduction of the signaling load associated with IP mobility management is one of the significant challenges to IP mobility support protocols. Hierarchical Mobile IPv6 (HMIPv6) aims to reduce the number of the signaling messages in the backbone networks, and improve handoff performance by reducing handoff latency. However, this does not imply any change to the periodic binding update (BU) to the home agent (HA) and the correspondent node (CN), and now a mobile node (MN) additionally should send it to the mobility anchor point (MAP). Moreover, the MAP should tunnel the received packets to be routed to the MN. These facts mean that the reduction of the BU messages in the backbone networks can be achieved at the expense of the increase in the signaling bandwidth consumption within a MAP domain. On the other hand, it is observed that an MN may habitually stay for a relatively long time or spend on using much Internet in a specific cell (hereafter, home cell) covering its home, office or laboratory, etc. Thus, considering the preceding facts and observation, HMIPv6 may not be favorable especially during a home cell residence time in terms of signaling bandwidth consumption. To overcome these drawbacks of HMIPv6, we propose a history-based auxiliary mobility management strategy (H-HMIPv6) to enable an MN to selectively switch its mobility management protocols according to whether it is currently in its home cell or not in HMIPv6 networks. The operation of H-HMIPv6 is almost the same as that of HMIPv6 except either when an MN enters/leaves its home cell or while it stays in its home cell. Once an MN knows using its history that it enters its home cell, it behaves as if it operates in Mobile IPv6 (MIPv6), not in HMIPv6, until it leaves its home cell; No periodic BU messages to the MAP and no packet tunneling occur during the MN's home cell residence time. The numerical results indicate that compared with HMIPv6, H-HMIPv6 has apparent potential to reduce the signaling bandwidth consumption and the MAP blocking probability.

In advanced ITS, on-board intelligent systems by the Inter-Vehicle Communications (IVC) is essential technology to achieve a safe automotive society. We aim to avoid the vehicular collisions under almost all situations such as intersections, highways, and blind corners by using IVC technology through wireless ad hoc networks. The objectives of this paper are to develop Vehicular Collision Avoidance Support System (VCASS), and to show its performance by various experiments with two real vehicles. We have installed personal computers, telecommunication equipments, and GPS in two vehicles. In this system, the vehicles exchange the location information and the velocity vectors by the UDP broadcast with each other, and calculate the relative position/speed. The vehicles make the warning for drivers with the possibility of the collision. We verify the validity and the effectiveness of VCASS by the experiments.