MIRAI Architecture for Heterogeneous Network

One of the keywords that describe next-generation wireless communications is "seamless." As part of the e-Japan Plan promoted by the Japanese Government, the Multimedia Integrated Network by Radio Access Innovation project has as its goal the development of new technologies to enable seamless integration of various wireless access systems for practical use by 2005. This article describes a heterogeneous network architecture including a common tool, a common platform, and a common access. In particular, software-defined radio technologies are used to develop a multiservice user terminal to access different wireless networks. The common platform for various wireless networks is based on a wireless-supporting IPv6 network. A basic access network, separated from other wireless access networks, is used as a means for wireless system discovery, signaling, and paging. A proof-of-concept experimental demonstration system is available

Supporting Effective Caching in a Wide-Area Distributed Location Service.

Abstract. Globe is a wide-area distributed system that supports mobile objects. To track and locate objects, we use a worldwide distributed location service, implemented as a search tree. An object registers its current position by storing its address in a nearby leaf node of the tree. This knowledge propagates up to the top of the tree, so every object can be found from the root. Remote objects can cache the location of an object. However, if the object moves, the cache entry is no longer valid. In this paper, we show how caching can be made to work effectively even in the presence of mobile objects. vrije Universitei

On MAS Scalability

In open dynamic multi-agent environments the number of agents can vary significantly within very short periods of time. Very few (if any) current multi-agent systems have, however, been designed to cope with large-scale distributed applications. Scalability requires increasing numbers of new agents and resources to have no noticeable effect on performance nor to increase administrative complexity. In this paper a number of implications for techniques and management are discussed. Current research on agent middleware is briefly described.

Two Distributed Algorithms for E-ticket Validation Protocols for Mobile Clients

The e-ticket (electronic ticket) validation problem has relevance in mobile computing environment because of the multiple submission of a ticket that is possible due to intermittent disconnections and mobility of hosts. Here, we propose protocols that are not only sensitive to disconnection but also to location. One of the proposed protocols is the variant of the distributed protocol proposed by Pedone (2000) for Internet users. This shows that a distributed protocol for static network can be restructured for distributed computation in a mobile computing environment. We have also proposed another protocol that uses a hierarchical location database of mobile hosts (Pitoura and Samaras, 2001)

Two Energy Efficient Algorithms for Tracking Objects in a Sensor Network

We propose two energy efficient algorithms for locating a target object moving in an area covered by a wireless ad hoc network. The first algorithm developed conserve energy by efficiently identifying sensor nodes, as Home Nodes, and use only local messages between neighboring nodes to follow the trail of the object. Since we avoid the long-range transmission and maximize the localization, the algorithms reduce the communication cost. The dynamic nature of the second algorithm exploits the predefined parameters such as the object velocity. Our algorithm represents query shipping against the conventional data shipping as a means to reduce the amount of data being shipped across the network. Hence, it locates the objects over the network with minimal energy conservation using short-range message transmissions. The performance analysis (both experimental and theoretical) shows the effectiveness of the two algorithms in comparison to another tracking algorithm

Improvement of the Performance of Database Access Operations in Cellular Networks, Journal of Telecommunications and Information Technology, 2012, nr 3

Reducing the traffic volume of location updating is a critical issue for tracking mobile users in a cellular network. Besides, when user x wants to communicate with user y, the location of user y must be extracted from databases. Therefore, one or more databases must be accessed for updating, recording, deleting, and searching. Thus, the most important criterion of a location tracking algorithm is to provide a small database access time. In this paper, we propose a new location tracking scheme, called Virtual Overlap Region with Forwarding Pointer (VF), and compare the number of database accesses required for updating, deleting, and searching operations for the proposed scheme and other approaches proposed for cellular networks. Our VF scheme like Overlap Region scheme reduces the updating information when a user frequently moves in boundaries of LAs. Unlike Overlap Region, the VF can reduce number of database accesses for searching users’ information