• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.2
• /
• pp.355-370
• /
• 2014

Cooperative spectrum sensing has been considered as a promising approach to improve the sensing performance in distributed cognitive radio networks. However, there may exist some selfish secondary users (SUs) who are unwilling to cooperate. The presence of selfish SUs could cause catastrophic damage to the performance of cooperative spectrum sensing. Following the social perspective, we propose a Social Tie-based Incentive Scheme (STIS) to deal with the selfish problem for cooperative spectrum sensing in distributed cognitive radio networks. This scheme inspires SUs to contribute sensing information for the SUs who have social tie but not others, and such willingness varies with the strength of social tie value. The evaluation of each SU's social tie derives from its contribution for others. Finally, simulation results validate the effectiveness of the proposed scheme.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.2 no.3
• /
• pp.185-190
• /
• 2002

In distributed autonomous robotic systems (DARS), each robot must behave by itself according to its states ad environments, and if necessary, must cooperate with other robots in order to carry out their given tasks. Its most significant merit is that they determine their behavior independently, and cooperate with other robots in order to perform the given tasks. Especially, in DARS, it is essential for each robot to have evolution ability in order to increase the performance of system. In this paper, a schema co-evolutionary algorithm is proposed for the evolution of collective autonomous mobile robots. Each robot exchanges the information, chromosome used in this algorithm, through communication with other robots. Each robot diffuses its chromosome to two or more robots, receives other robot's chromosome and creates new species. Therefore if one robot receives another robot's chromosome, the robot creates new chromosome. We verify the effectiveness of the proposed algorithm by applying it to cooperative search problem.

• International Journal of Internet, Broadcasting and Communication
• /
• v.15 no.3
• /
• pp.14-23
• /
• 2023

The cooperative communication systems using MIMO(multiple input multiple-output) relay are known as one of the most promising techniques to improve the performance and coverage of wireless communication systems. In this paper, we propose the cooperative communication systems using the relay with multi-antennas and DSTC(distributed space time coding) for decode-and-forward protocol. As using DSTC for DF(decode-and-forward), we can minimize the risk of error propagation at the wireless system using relay system. Also, the MIMO channel cab be formed by multi-antenna and DSTC at the MS(mobile station)-RS(relay station) and at the RS-BS(base station).Therefore, obtaining truly constructive the MIMO diversity and cooperative diversity gain from the proposed approach, the performance of system can be more improved than one of conventional system (relay with single antenna, no relay). The improvement in bit error rate is investigated through numerical analysis of the cooperative communication system with the proposed approach.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.8 no.4
• /
• pp.8-17
• /
• 1998

Autonomous mobile robot agents(AMRAs) are robots which perform a given task by the same distributed self-organizing rules. In this paper, we let them form an equi-distance circle for the task of cooperative behaviors. Here, we suggest an algorithm to perform the taqk and then utilize a fuzzy system to improve the algorithm. It is shown that various cooperative activities appear in the simulation and particularly chaotic behaviors also appear by increasing the robot speed. Moreover, we prove the characteristics of this chaotic behaviors by calculating Lyapunov exponent.

• Journal of Korea Multimedia Society
• /
• v.15 no.3
• /
• pp.345-355
• /
• 2012

The WiMedia Alliance has specified a Distributed Medium Access Control (D-MAC)/WUSB protocol based on UWB for high speed wireless home networks and WPANs. In this paper, we propose a novel SoQ-based cooperative communication protocol adaptive to current UWB link transmission rate and QoS measure. The proposed SoQ-based cooperative communication protocol has compatibility with current WiMedia D-MAC/Wireless USB standard and is executed at each device according to a SoQ-based Relay Node Selection (RNS) criterion.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.7
• /
• pp.591-597
• /
• 2001

In this paper, we propose a method of cooperative control (T-cell modeling) and selection of group behavior strategy (B-cell modeling) based on immune system in distributed autonomous robotic system (DARS). Immune system is living body's self-protection and self-maintenance system. These features can be applied to decision making of optimal swarm behavior in dynamically changing environment. For applying immune system to DARS, a robot is regarded as a B-cell, each environmental condition as an antigen, a behavior strategy as an antibody and control parameter as a T-cell respectively. The executing process of proposed method is as follows. When the environmental condition changes, a robot selects an appropriate behavior strategy. And its behavior strategy is stimulated and suppressed by other robot using communication. Finally much stimulated strategy is adopted as a swarm behavior strategy. This control school is based on clonal selection and idiotopic network hypothesis. And it is used for decision making of optimal swarm strategy. By T-cell modeling, adaptation ability of robot is enhanced in dynamic environments.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.87-90
• /
• 2007

In cooperative communication systems, the source terminal transmits signal to the destination terminal with the aid of partner terminals. Therefore, the source terminal obtains extra spatial diversity gain. As a result, its performance is enhanced in term of higher achievable transmission rate, the larger coverage range, and the lower bit-error-rate (BER). Space-time codes (STCs) have been applied to cooperative communication systems in distributed fashion, in which the signal is spatially time exploited to obtain gains analogous to those provided by STCs. In this work, we consider the application of orthogonal Space-time Block Codes (OSTBCs) to the cooperative communication systems to further achieve higher diversity gain. The advances of the proposed approach are verified via computer simulations.

• Proceedings of the Korea Contents Association Conference
• /
• 2003.11a
• /
• pp.234-244
• /
• 2003

In distributed file-systems, cooperative caching algorithm which owns the data cached at each node jointly is used to reduce an expense of disk access. Cooperative caching algorithm is the method that increases a cache hit-ratio and decrease a disk access as it holds the cache information of distributed systems in common and makes cache larger virtually. Recently, several cooperative caching algorithms decrease the message costs by using approximate information of the cache and increase the cache hit-ratio by using local and global cache fields dynamically. And they have an advantage that increases the whole field hit-ratio by sending a replaced block to the idel node on cache replacement in order to maintain the replaced block in the cache field. However the wrong approximate information deteriorates the performance, the concistency maintenance goes to great expense to exchange messeges and the cost that manages Age-information of each node to choose the idle node increases. In this thesis, we propose a cooperative cache algorithm that maintains correct cache information, minimizes the maintance cost for consistency and the management cost for cache Age-information. Also, we show the superiority of our algorithm through the performance evaluation.

• The Journal of the Korea Contents Association
• /
• v.4 no.3
• /
• pp.71-80
• /
• 2004

In distributed file-systems, cooperative caching algorithm which owns the data cached at each node jointly is used to reduce an expense of disk access. Cooperative caching algorithm is the method that increases a cache hit-ratio and decrease a disk access as it holds the cache information of distributed systems in common and makes cache larger virtually. Recently, several cooperative caching algorithms decrease the message costs by using approximate information of the cache and increase the cache hit-ratio by using local and global cache fields dynamically. And they have an advantage that increases the whole field hit-ratio by sending a replaced buffer to the idle node on buffers replacement in order to maintain the replaced cache in the cache field. However the wrong approximate information deteriorates the performance, the consistency maintenance goes to great expense to exchange messages and the cost that manages Age-information of each node to choose the idle node increases. In this thesis, we propose a cooperative cache algorithm that maintains correct cache information, minimizes the maintenance cost for consistency and the management cost for buffer Age-information. Also, we show the superiority of our algorithm through the performance evaluation.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.1
• /
• pp.73-85
• /
• 1998

Today's Software Systems are becoming bigger, larger and more complex than ever before. To develop largerscale projects, it is required that many experts of different fields participate and cooperate in the same project. So, it is an applied area of CSCW(Computer Supported Cooperative Works} that centers around methodologies and tools that enable cooperative works by geographically distributed people engaged in all aspects of product development. In this paper, we designed a multi-user cooperative works platform, SPACE(Software Platform for distributed Application sharing under Cooperative Environment} as a infrastructure that support to CSCW based system development for telecommunication and information system. SPACE has a fully distributed architecture under Windows 95 environment, has an application sharing mechanism enabling collaborative use of mteractive application adapt to a mixed GUI sharing technology which capture GUI and screen information, and also, an event sharing technology that has a replicated architecture.