• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3524-3542
• /
• 2017

In a single-source and multi-relay amplify-forward (AF) cooperative network, the outage probability and the power allocation are two key factors to influence the performance of an entire system. In this paper, an optimized AF relay selection by an exclusive method and near optimal power allocation (NOPA) is proposed for both good outage probability and power efficiency. Given the same power at the source and the relay nodes, a threshold for selecting the relay nodes is deduced and employed to minimize the average outage probability. It mainly excludes the relay nodes with much higher thresholds over the aforementioned threshold and thus the remainders of the relay nodes participate in cooperative forwarding efficiently. So the proposed scheme can improve the utility of the resources in the cooperative multi-relay system, as well as reduce the computational complexity. In addition, based on the proposed scheme, a NOPA is also suggested to approach sub-optimal power efficiency with low complexity. Simulation results show that the proposed scheme obtains about 2.1dB and 5.8dB performance gain at outage probability of $10^{-4}$, when compared with the all-relay-forward (6 participated relays) and the single-relay-forward schemes. Furthermore, it obtains the minimum outage probability among all selective relay schemes with the same number of the relays. Meanwhile, it approaches closely to the optimal exhaustive scheme, thus reduce much complexity. Moreover, the proposed NOPA scheme achieves better outage probability than those of the equal power allocation schemes. Therefore, the proposed scheme can obtain good outage probability, low computational complexity and high power efficiency, which makes it pragmatic efficiently in the single-source and multi-relay AF based cooperative networks.

• KIPS Transactions on Computer and Communication Systems
• /
• v.8 no.9
• /
• pp.209-216
• /
• 2019

Publish-subscribe communication model is popular for various type of distributed applications because of its loosely coupled style connections. Among the various architecture style for publish-subscribe system, peer-to-peer architecture has been used for the mission critical application domain since it provides high scalability and real-timeness. On the other hand, to utilize the bandwidth of given networks, message filtering is frequently used to reduce the number of messages on the system. Even if P2P provides superior scalability, it is hard to apply filtering to the its messaging system because the filtering process should be done on the peer-side in P2P architecture that are usually done on the broker server in conventional pub/sub architecture. In this paper, we propose a hierarchical subscription management structure as well as message forwarding scheme for efficient data dissemination. Our proposed scheme reduces the number of received messages by filter-out un-wanted messages and offloading the message dissemination work to other subscribers to enhance the messaging throughput.

• ETRI Journal
• /
• v.34 no.6
• /
• pp.816-826
• /
• 2012

Self-healing Ethernet rings show promise for realizing the SONET/SDH-grade resilience in Carrier Ethernet infrastructures. However, when a ring is faulty, high-priority protection messages are processed in less time than low-priority data frames are processed. In this situation, any delayed data frames either being queued or traveling through long ring spans will cause the ring nodes to generate incorrect forwarding information. As a result, the data frames spread in the wrong direction, causing the ring to become unstable. To solve this problem, we propose four schemes, that is, dual flush, flush delay timer setting, purge triggering, and priority setting, and evaluate their protection performance under various traffic conditions on a ring based on the Ethernet ring protection (ERP) method. In addition, we develop an absorbing Markov chain model of the ERP protocol to observe how traffic congestion can impact the protection performance of the proposed priority setting scheme. Based on our observations, we propose a more reliable priority setting scheme, which guarantees faultless protection, even in a congested ring.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.3
• /
• pp.1357-1372
• /
• 2017

Energy harvesting techniques, particularly radio frequency energy harvesting (RF-EH) techniques, which are known to provide feasible solutions to enhance the performance of energy constrained wireless communication systems, have gained increasing attention. In this paper, we consider a wireless-powered cooperative communication network (WPCCN) for transferring energy in the downlink and forwarding signals in the uplink. The objective is to maximize the average transmission rate of the system, subject to the total network power constraint. We formulate such a problem as a form of wireless energy transmission based on resource allocation that searches for the joint subcarrier pairing and the time and power allocation, and this can be solved by using a dual approach. Simulation results show that the proposed joint optimal scheme can efficiently improve system performance with an increase in the number of subcarriers and relays.

• Journal of Communications and Networks
• /
• v.16 no.3
• /
• pp.280-292
• /
• 2014

This article presents a novel cooperative spectrum sharing (CSS) scheme. The primary transmitter transmits a complex Quadrature amplitude modulation (QAM) signal in the first phase, and CSS occurs in the second phase. The secondary transmitter with the largest forwarding channel gain among the nodes that successfully decode the primary signal in the first phase is selected for CSS. This selected node employs a pulse-amplitude modulation (PAM) signal for primary information message (IM) instead of the QAM signal, and it employs a modified PAM signal for the secondary IM. The proposed modified PAM signal depends on the amplitude of the primary PAM signal. This method results in no mutual interference and negligible primary interference constraint and allows a higher degree of exploitation of spatial diversity, thus enabling increase in secondary power to improve primary transmission. The outage performance is enhanced in both the primary and secondary systems. The critical region, in which the primary outage performance is enhanced with the proposed CSS scheme, can be adjusted and widened by varying either the modulation cooperation sharing factor or the number of secondary transmitters.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.37 no.1
• /
• pp.88-97
• /
• 2000

We have proposed and analysed a novel Lookup Algorithm which had a short switching speed and tiny memory size for IP router. This algorithm could simply be implemeted by a hardware with SRAM because of simple structure. This Lookup scheme needs 1${\sim}$3 memory access times. When we simulated with 40,000 routing record obtained from IPMA Website, the maximum memory size of this algorithm was 316KB(the offset threshold for compression algorithm was 8). When we simulated by HDL using ALTERA EPM7256 series and 100MHz clock and SRAM of 10ns access time, the total lookup time was 45ns for two memory access, 175ns for three memory access.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.12
• /
• pp.5803-5819
• /
• 2017

In this paper, we proposed a contract theory based cooperative spectrum sharing scheme with joint power and bandwidth optimization under asymmetric information, where the primary user (PU) does not know the secondary users' (SUs) private information. To improve performance, PU needs to provide incentives to stimulate nearby SUs to help forward its signal. By using contract theory, PU and SUs' negotiations are modeled as a labor market. PU and SUs act as the employer and employees, respectively. Specifically, SUs provide labor (i.e. the relay power, which can be used for forwarding PU's signal) in exchange for the reward (i.e. the spectrum access bandwidth which can be used for transmitting their own signals). PU needs to overcome a challenge how to balance the relationship between contributions and incentives for the SUs. We study the optimal contract design which consists of relay power and spectrum access bandwidth allocation. We show that the most efficient SUs will be hired by the PU to attend the cooperative communication. PU can achieve the same maximum utility as in the symmetric information scenario. Simulation results confirm that the utility of PU is significantly enhanced with our proposed cooperative spectrum sharing scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.11
• /
• pp.4701-4719
• /
• 2015

A Mobile Ad hoc Network (MANET) consists of mobile nodes which co-operate to forward each other's packets without the presence of any centralized authority. Due to this lack of centralized monitoring authority, MANETs have become vulnerable to various kinds of routing misbehaviour. Sometimes, nodes exhibit non-cooperating behaviour for conserving their own resources and exploiting others' by relaying their traffic. A node may even drop packets of other nodes in the guise of forwarding them. This paper proposes an efficient Reputation and Collaboration technique through route-request for handling such misbehaving nodes. It lays emphasis not only on direct observation but also considers the opinion of other nodes about misbehaving nodes in the network. Unlike existing schemes which generate separate messages for spreading second-hand information in the network, nodes purvey their opinion through route-request packet. Simulation studies reveal that the proposed scheme significantly improves the network performance by efficiently handling the misbehaving nodes in the network.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.9
• /
• pp.4183-4204
• /
• 2018

The existing en-route filtering schemes only consider some simple false data injection attacks, which results in lower safety performance. In this paper, we propose an efficient geographical information-based en-route filtering scheme (EGEFS), in which each forwarding node verifies not only the message authentication codes (MACs), but also the report identifier and the legitimacy and authenticity of locations carried in a data report. Thus, EGEFS can defend against not only the simple false data injection attacks and the replay attack, but also the collusion attack with forged locations proposed in this paper. In addition, we propose a new method for electing the center-of-stimulus (CoS) node, which can ensure that only one detecting node will be elected as the CoS node to generate one data report for an event. The simulation results show that, compared to the existing en-route filtering schemes, EGEFS has higher safety performance, because it can resist more types of false data injection attacks, and it also has higher filtering efficiency and lower energy expenditure.

• Journal of the Korea Society of Computer and Information
• /
• v.6 no.3
• /
• pp.44-49
• /
• 2001

In general. requirements for QoS are different according to the type of services in wireline and wireless ATM, and real-time video service is more sensitive to cell transmission delay than to cell loss. Existing handoff schemes emphasizing prevention of cell loss had limitations in cell transmission delay to satisfy QoS. In this paper, a novel scheme to transmit ATM cells with low CLP (when CLP = 0) prior to others and discarding cells with high CLP (when CLP = 1) in ATM cell header among cells to be forwarded during handoffs in real-time VBR service is proposed. The proposed scheme is proven to be suitable for the satisfaction of QoS and appropriate for fast handoffs by giving high CLP value to less meaningful MPEG frames through simulations.