Qihui WU Yuhua XU Zhiyong DU Jinlong WANG Alagan ANPALAGAN
This letter proposes a novel connected dominanting set based decentralized cooperative spectrum sensing algorithm for cognitive radio networks. It is analytically shown that the proposed algorithm distributively converges to the average consensus as that of traditional distributed consensus algorithm, while reducing both the convergence time and message complexity significantly.
Masashi NOMURA Shigemasa TAKAI
In the framework of supervisory control of timed discrete event systems (TDESs), a supervisor decides the set of events to be enabled to occur and the set of events to be forced to occur in order for a given specification to be satisfied. In this paper, we consider decentralized supervisory control of TDESs where enforcement decisions of local supervisors are fused by the AND rule or the OR rule. We derive existence conditions of a decentralized supervisor under these decision fusion rules.
Carlos PEREZ-LEGUIZAMO Kinji MORI
The turn of the century is witnessing radical changes in the way information services are spreading due to the progress of IT and the constantly increase in the number of users of the WWW. Therefore, the business market is changing its strategy for a modern online business environment. Autonomous Decentralized Database System (ADDS), based on autonomous coordinating subsystems, has been proposed as a system architecture in order to meet the innovative e-business requirements for consistency and high response among distributed database systems. Autonomy and decentralization of subsystems help achieving high response time in highly competitive situation and autonomous Mobile Agent based coordination has been proposed to achieve flexibility in a highly dynamic environment. In this paper, it is analyzed the case in which the system size increases; and a multi agent coordination, the same number of mobile agents and sites coexist in the system, is proposed for achieving the timeliness property. The response time in the system is conformed by those transactions that require coordination and those that can be satisfied immediately. In accordance, the distribution of the data in the system for coordination is a medullar issue for the improvement of the response time. A trade-off exits between these two kind of transactions depending on the coordination of the Mobile Agents, the capacity of allocating data among the sites, and as well as the distribution of the data and user requests in the system. In this sense, since the system requires high response time, a data allocation technology in which each mobile agent autonomously determine its own capacity for adjusting data among the sites is proposed. Thus, the system will adapt itself to the dynamic environment. The effectiveness of the proposed architecture and technologies are evaluated by simulation.
Xiaodong LU Yefeng LIU Tatsuya TSUDA Kinji MORI
In Video-on-Demand (VoD) services, the playback continuity is one of the most crucial factors for end-user to judge service quality. It is even more significant than the actual video image quality since new generation VoD users commonly have heterogeneous requirements on service according to their context. Moreover, managing dynamic situations in VoD service is always a challenge, especially in the unpredictable user preferences and network conditions. In this paper, i) Autonomous Decentralized VoD System (ADVODS) has been proposed to satisfy different service quality demands of users and, ii) the Autonomous Node Allocation Technology (ANAT) is proposed for assuring service continuity. With the help of autonomous nodes and mobile agents, ANAT can applies different backup policies to users with different Service Level Agreements (SLA), and dynamically update the backup schema to adapt the changing situations such as various service time or congestion events. Drawing on the evaluation results this paper shows that proposed system architecture has a better performance on streaming service provision and continuity.
Titichaya THANAMITSOMBOON Kotaro HAMA Riyako SAKAMOTO Xiaodong LU Kinji MORI
The challenge in resource utilization under dynamic environment is how to utilize appropriate resources to the right users at the right time and the right location. In conventional system, centralized management system is applied but it tends to congest when user requests increase or resources rapidly move. Therefore, this paper proposes Autonomous Coordination Technology (ACT) through community organization for resource utilization. In ACT, a node which has surplus resources autonomously constructs community with a surplus-level based size and distributes resources to members which are deficient in resources. ACT consists of autonomous coordination within community and among communities. According to community organization, online property and flexibility can be satisfied. However, it is difficult to achieve service provision timeliness and resource allocation operatability in the mean time. Thus, ACT includes successive transportation method, and autonomous resource allocation which dynamic decision is made by a tradeoff between timeliness and operatability. As a result, the service assurance in terms of timeliness and operatability can be assured. The effectiveness of proposed technology is affirmed through the simulation of taxi dispatching application in terms of response time and standard deviation versus user rates.
Md. Emdadul HAQUE Shoichi MURAKAMI Xiaodong LU Kinji MORI
Wireless sensor networks represent a new data collection paradigm in which expandability plays an important role. In a practical monitoring environment, for example, food factory monitoring system, sensor relocations and reorganizations are necessary with reorganization of production lines and starting of new production lines. These relocations sometime make congestion in some area of the network. In this dynamic changing environment online expansion is a challenging problem for resource constraint network. This paper proposes a two-tier autonomous decentralized community architecture for wireless sensor network to solve the problem. The first layer consists of sensors and second layer consists of routers. In the architecture routers make community (a group of nodes mutually cooperate for a common goal is a community). The goal of this paper is to introduce the concept of sharing information among routers of the community to decrease sensor connection time for the network especially for the dynamic changing environment. Results show that our proposed technologies can reduce sensor connection time to achieve online expansion.
Sheng ZHOU Jie GONG Yunjian JIA Zhisheng NIU
Base station (BS) cooperation is a promising technique to suppress co-channel interference for cellular networks. However, practical limitations constrain the scale of cooperation, thus the network is divided into small disjoint BS cooperation groups, namely clusters. A decentralized scheme for BS cluster formation is proposed based on efficient BS negotiations, of which the feedback overhead per user is nearly irrelevant to the network size, and the number of iteration rounds scales very slowly with the network size. Simulations show that our decentralized scheme provides significant sum-rate gain over static clustering and performs almost the same as the existing centralized approach. The proposed scheme is well suited for large-scale cellular networks due to its low overhead and complexity.
Van-Duc NGUYEN Harald HAAS Kyandoghere KYAMAKYA Jean-Chamerlain CHEDJOU Tien-Hoa NGUYEN Seokho YOON Hyunseung CHOO
In this paper, a novel decentralised dynamic sub-carrier assignment (DSA) algorithm for orthogonal frequency division multiple access (OFDMA)-based adhoc and cellular networks operating in time division duplexing (TDD) mode is proposed to solve the hidden and exposed node problem in media access control (MAC). This method reduces the co-channel interference (CCI), and thus increases the overall throughput of the network. Reduced CCI and increased throughput can be achieved, if time and frequency selectivity of the multi-path fading channel and the channel reciprocity offered by the TDD are fully exploited. The time and frequency selectivity of the channel are usually the main problem in mobile communication. However, in the context of channel assignment for OFDMA-based networks in TDD mode, the time and frequency selectivity of the channel are the key to reduce the interference. In the proposed channel assignment mechanism, several clusters of sub-carriers are assigned for data transmission between a transmitter and a receiver only if the corresponding channels of those sub-carriers linking this transmitter to potential victim receivers are deeply faded. In addition, the proposed algorithm works in a fully decentralised fashion and, therefore, it is able to effectively support ad hoc and multihop communication as well as network self-organisation. Numerical results show that the throughput obtained by the proposed approach for a given quality of service is higher than those of the conventional methods in any precondition of adhoc geographic scenario.
Khalid MAHMOOD Xiaodong LU Yuji HORIKOSHI Kinji MORI
Location Based Services (LBS) are expected to become one of the major drivers of ubiquitous services due to recent inception of GPS-enabled mobile devices, the development of Web2.0 paradigm, and emergence of 3G broadband networks. Having this vision in mind, Community Context-attribute-oriented Collaborative Information Environment (CCCIE) based Autonomous Decentralized Community System (ADCS) is proposed to enable provision of services to specific users in specific place at specific time considering various context-attributes. This paper presents autonomous community construction technology that share service discovered by one member among others in flexible way to improve timeliness and reduce network cost. In order to meet crucial goal of real-time and context-aware community construction (provision of service/ service information to users with common interests), and defining flexible service area in highly dynamic operating environment of ADCS, proposed progressive ripple based service discovery technique introduces novel idea of snail's pace and steady advancing search followed by swift boundary confining mechanism; while service area construction shares the discovered service among members in defined area to further improve timeliness and reduce network cost. Analysis and empirical results verify the effectiveness of the proposed technique.
The advancement of technology is ensured by step-by-step innovation and its implementation into society. Autonomous Decentralized Systems (ADSs) have been growing since first proposed in 1977. Since then, the ADS technologies and their implementations have interacted with the evolving markets, sciences, and technologies. The ADS concept is proposed on biological analogy, and its technologies have been advanced according to changing and expanding requirements. These technologies are now categorized into six generations on the basis of requirements and system structures, but the ADS concept and its system architecture have not changed. The requirements for the system can be divided in operation-oriented, mass service-oriented, and personal service-oriented categories. Moreover, these technologies have been realized in homogeneous system structure and, as the next step, in heterogeneous system structure. These technologies have been widely applied in manufacturing, telecommunications, information provision/utilization, data centers, transportation, and so on. They have been operating successfully throughout the world. In particular, ADS technologies have been applied in Suica, the IC card ticket system (ICCTS) for fare collection and e-commerce. This system is not only expanding in size and functionality but also its components are being modified almost every day without stopping its operation. This system and its technologies are shown here. Finally, the future direction of ADS is discussed, and one of its technologies is presented.
Scalability is one of the most important requirements for secure multicast in a multi-group environment. In this study, we propose a decentralized multi-group key management scheme that allows each multicast group sender to control the access to its group communication independently. Scalability is enhanced by local rekeying and inter-working among different subgroups. The group key secrecy and backward/forward secrecy are also guaranteed.
Kazuki CHIBA Masanori HAMAMURA
We propose multitone-hopping code-division multiple access (MH-CDMA) using a feedback-controlled hopping pattern (FCHP) (FCHP/MH-CDMA). In the FCHP/MH-CDMA, part of the filter coefficients of an adaptive finite-duration impulse response (FIR) filter receiver are fed back to a transmitter, in which they are used as an updated hopping pattern. Each chip of the updated hopping pattern consists of plural tones. As a result, it is shown that the FCHP/MH-CDMA provides us with an excellent asynchronous, decentralized multiple-access performance over time-invariant multipath channels.
This paper presents a distributed approach for adaptive flocking of swarms of mobile robots that enables to navigate autonomously in complex environments populated with obstacles. Based on the observation of the swimming behavior of a school of fish, we propose an integrated algorithm that allows a swarm of robots to navigate in a coordinated manner, split into multiple swarms, or merge with other swarms according to the environment conditions. We prove the convergence of the proposed algorithm using Lyapunov stability theory. We also verify the effectiveness of the algorithm through extensive simulations, where a swarm of robots repeats the process of splitting and merging while passing around multiple stationary and moving obstacles. The simulation results show that the proposed algorithm is scalable, and robust to variations in the sensing capability of individual robots.
Khalid MAHMOOD Xiaodong LU Kinji MORI
Autonomous Decentralized Community System (ADCS) makes its basis on offering customized and dynamic services to group of end-users having common preferences at specified time and location. Owing to extreme dynamism in the system caused by rapidly varying user's demands, and severe mobility of users, it is quite difficult to assure timely service provision to all community members. This paper presents autonomous decentralized community system construction by autonomous division and integration technologies to procure service assurance under dynamic situations, without involving significant communication overhead. By adopting the concept of size threshold, the proposed technique continuously maintains the appropriate size of community in constantly and rapidly changing operating environment, to deliver optimal quality of service in terms of response time. The effectiveness of proposed technology has been shown through simulation, which reveals remarkable improvement (up to 29%) in response time.
Akitoshi SHIMURA Takeiki AIZONO Masashi HIRAIWA Shigeki SUGANO
A QoS management technique based on an autonomous decentralized mobility system, which is an autonomous decentralized system enhanced to provide mobile stations with information about urgent roadway situations, is proposed in this paper. This technique enables urgent messages to be flexibly and quickly transmitted to mobile stations by multiple decentralized base stations using dedicated short range communication. It also supports the easy addition of additional base stations. Each station autonomously creates information-delivery communities based on the urgency of the messages it receives through the roadside network and the distances between the senders and receivers. Each station dynamically determines the urgency of messages according to the message content and the speed of the mobile stations. Evaluation of this technique applied to the Smart Gateway system, which provides driving-assistance services to mobile stations through dedicated short-range communication, demonstrated its effectiveness and that it is suitable for actual systems.
Chisa TAKANO Keita SUGIYAMA Masaki AIDA
We have previously proposed a diffusion-type flow control mechanism as a solution for severely time-sensitive flow control required for high-speed networks. In this mechanism, each node in a network manages its local traffic flow using the basis of only the local information directly available to it, by using predetermined rules. In addition, the implementation of decision-making at each node can lead to optimal performance for the whole network. Our previous studies show that our flow control mechanism with certain parameter settings works well in high-speed networks. However, to apply this mechanism to actual networks, it is necessary to clarify how to design a parameter in our control mechanism. In this paper, we investigate the range of the parameter and derive its optimal value enabling the diffusion-type flow control to work effectively.
Autonomous Decentralized System (ADS) has been making progress in these 31 years since it was proposed in 1977. During these long years in the rapidly advancing computer and communication technologies, the ADS concept has not been changed but its technologies have been growing in accordance with the change and diversity of the social, economical and personal requirements and through the globalization of the market and the restructuring organizations. The ADS technologies are systematized to cover all processes of system design, operation, maintenance and modification. This paper reviews the work done in fields of ADS in past 31 years from not only technological perspectives, but it also encompasses users requirements and value, system design, industrial activity, academic activity and standardization [1]-[26]. Moreover the new directions of the ADS are suggested.
Dmitry KRAMAREV Insoo KOO Kiseon KIM
In this paper, we propose a sequential type-based detection scheme for wireless sensor networks in the case of spatially and temporally identically and independently distributed observations. First, we investigate the optimal sequential detection rule of the proposed scheme, and then with the motivation of reducing the computational complexity of the optimal detection rule, we consider an approximation scheme and derive a suboptimal detection rule. We also compare the performances of the type-based sequential detection scheme with those of the non-sequential type-based detection scheme in terms of both average number of observations and total energy consumption, and determine the region of individual node power where the proposed scheme outperforms the non-sequential scheme. In addition, we show that the approximated detection rule provides the similar results as the optimal detection rule with a significant reduction of the computational complexity, which makes the approximated detection rule useful for real-time applications.
Bahram KARIMI Mohammad Bagher MENHAJ Iman SABOORI
In this paper, a novel decentralized adaptive neural network controller is proposed for a class of large-scale nonlinear systems with unknown nonlinear, nonaffine subsystems and unknown nonlinear interconnections. The stability of the closed loop system is guaranteed by introducing a robust adaptive bound based on Lyapunov stability analysis. A radial-basis function type neural network is used in the paper. To show the effectiveness of the proposed method, we performed some simulation studies. The results of simulation become very promising.
We have proposed a diffusion-type flow control mechanism to achieve the extremely time-sensitive flow control required for high-speed networks. In this mechanism, each node in a network manages its local traffic flow only on the basis of the local information directly available to it, by using predetermined rules. In this way, the implementation of decision-making at each node can lead to optimal performance for the whole network. Our previous studies concentrated on the flow control for a single flow. In this paper, we propose a diffusion-type flow control mechanism for multiple flows. The proposed scheme enables a network to quickly recover from a state of congestion and to achieve fairness among flows.