• Journal of KIISE:Information Networking
• /
• v.34 no.6
• /
• pp.514-524
• /
• 2007

Recent advances in the speed of multi-rate wireless local area networks (WLANs) and the proliferation of WLAN devices have made rate adaptive, opportunistic scheduling critical for throughput optimization. As WLAN traffic evolves to be more symmetric due to the emerging new applications such as VoWLAN, collaborative download, and peer-to-peer file sharing, opportunistic scheduling at the downlink becomes insufficient for optimized utilization of the single shared wireless channel. However, opportunistic scheduling on the uplink of a WLAN is challenging because wireless channel condition is dynamic and asymmetric. Each transmitting client has to probe the access point to maintain the updated channel conditions at the access point. Moreover, the scheduling decisions must be coordinated at all clients for consistency. This paper presents JUDS, a joint uplink/downlink opportunistic scheduling for WLANs. Through synergistic integration of both the uplink and the downlink scheduling, JUDS maximizes channel diversity at significantly reduced scheduling overhead. It also enforces fair channel sharing between the downlink and uplink traffic. Through extensive QualNet simulations, we show that JUDS improves the overall throughput by up to 127% and achieves close-to-perfect fairness between uplink and downlink traffic.

• The Journal of the Korea Contents Association
• /
• v.22 no.5
• /
• pp.404-415
• /
• 2022

The purpose of this study is to propose considerations to help actual application based on the characteristics of the online art-based peer supervision execution process. Colleagues in the clinical art therapy doctoral program, including the researcher, attempted to repeatedly identify problems and apply improvements in the implementation process as research participants, and qualitatively analyzed the various data collected in the process. Looking at the characteristics of the analysis results, extensibility of materials and space was confirmed in terms of 'art-based' and initiative, convenience, and speed in terms of 'online'. The considerations identified through this are as follows. First, 'pre-structuring' should be based on clear boundaries and setting, prior consultation of the group, and self-directed preparation and attitude. Second, for the 'structural aspect of art', space and media to help immersion through creation, and stable implementation structure should be established. Third, in the 'technical aspect', it is necessary to apply a method that can deliver a work of art and a method that can communicate the creator's clear intention. Lastly, for the 'ethical aspect', it is necessary to use online software in accordance with the minimum security standards and to make efforts to repeatedly maintain confidentiality. This study is meaningful in that it suggested a practical method for maintaining the professional competence of art therapists and expanding networks among art therapists in various situations including pandemics.

• Electronics and Telecommunications Trends
• /
• v.34 no.2
• /
• pp.110-120
• /
• 2019

Blockchain enables encrypted, definitive, and immutable records of transactions to be shared and maintained across distributed nodes in peerto-peer networks. Since the establishment of the ISO/TC 307 (Blockchain and distributed ledger technologies (DLT)), Blockchain and DLT have been actively standardized. In this paper, we introduce the international standardization activities and deliverables carried out by ISO, ITU-T, and W3C.

• Annual Conference of KIPS
• /
• 2009.04a
• /
• pp.750-753
• /
• 2009

최근 유비쿼터스 및 모바일 환경에서 Peer-to-Peer(P2P)시스템에 대한 연구들이 활발히 진행되고 있다. 모바일 환경에서는 모바일 환경의 제약사항과 함께 이동성이라는 특징이 중요하게 고려된다. 노드의 이동에 의해서 네트워크의 주소가 변경되어 P2P 네트워크 망에서 유효하지 않은 접속 정보들이 생기고 이러한 정보들이 검색 및 P2P 시스템의 전체적인 성능을 떨어뜨리게 된다. 이 논문은 이러한 접속 정보들의 불일치를 해결하여 접속 정보를 유지하기 위한 효과적인 방법론인 이동전파 알고리즘을 제안한다. 이 알고리즘은 접속 정보의 불일치를 해결하기 위해 정보를 빠르게 처리해서 P2P 시스템의 성능을 향상하는 것을 목표로 한다. DHT 기반 P2P 시스템을 기반으로 하여 제안하는 알고리즘을 적용하여 실험을 하였으며, 그 결과로 처음 신규 발견된 정보를 재 발견하는 경우에 성능이 기존의 DHT 기반의 P2P 시스템보다 80% 향상되었음을 알 수 있다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.5
• /
• pp.139-145
• /
• 2009

Recently P2P (Peer-to-Peer) networks and applications have been expanded to various field. However, because the construction of P2P network did not influence a underlying network topology or property, it may be inefficient. Especially, this inefficiency is more serious in MANET because MANET has narrow bandwidth and energy constraint. When we use a proactive routing protocol in MANET, we can know hop counts between two nodes. And, we can construct a P2P overlay network using this hop count information. However, In case of using hop count only, we can avoid a interference path selection problem and a zig-zag problem. We propose a method of improving P2P contents distribution using virtual positions. We calculate virtual positions from hop counts using the trigonometry. This method solves a interference path selection problem and a zig-zag problem. This method also allows a P2P network to influence underlying network topology. We adopt this method to a network which uses a virtual geographic routing, a proactive routing protocol, or a reactive routing protocol. We show that our proposed methods improve P2P contents distribution performance over MANET through a simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.6B
• /
• pp.977-983
• /
• 2010

In mobile and secure military networks, full-meshed IPSec tunnels, which do correspond to not physical links but logical links between each IPSec device and its peer, are required to provide multicast communications. All IPSec devices need support in changing IPSec tunnels by a way of using a multicast group key which is updated dynamically. Tactical terminals, which often constitute a group, need also secure multicast communications in the same group members. Then, the multicast group key is required to be updated dynamically in order to support group members' mobility. This paper presents challenging issues of designing a secure and dynamic group key management of which concept is based on the Diffie-Hellman (DH) key exchange algorithm and key trees. The advantage of our dynamic tree based key management is that it enables the dynamic group members to periodically receive status information from every peer members and effectively update a group key based on dynamically changing environments.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.10
• /
• pp.138-149
• /
• 2003

As the Internet is quickly evolving from best-effort networks to business quality networks, billing based on the precise traffic measurement becomes an important issue for Internet Service Providers (ISPs). Billing settlement is necessary not only between ISP and customers but also between ISPs. Currently, most ISPs use a flat rate charging policy. Besides the degree of difficulty in deriving appropriate charging policies agreeable by a concerned party, there are substantial technical challenges to come up with a good usage-based accounting system. Usage-based accounting depending on IP packet header information only is not sufficient anymore due to highly dynamic nature of the development and the use of the Internet applications such as peer-to-peer and network games. They are using port numbers dynamically and even several applications can use the same port number. Thus, more precise means of classifying them and accounting their traffic usages are required. In this paper, we propose a high performance, adaptable, configurable, and scalable content-aware application traffic measurement and analysis system which can achieve very accurate usage-based accounting.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.7
• /
• pp.3386-3411
• /
• 2019

Secured and reliable routing is a crucial factor for improving the performance of Wireless Mesh Networks (WMN) since these networks are susceptible to many types of attacks. The existing assumption about the internal nodes in wireless mesh networks is that they cooperate well during the forwarding of packets all the time. However, it is not always true due to the presence of malicious and mistrustful nodes. Hence, it is essential to establish a secure, reliable and stable route between a source node and a destination node in WMN. In this paper, a trust based secure routing algorithm is proposed for enhancing security and reliability of WMN, which contains cross layer and subject logic based reliable reputation scheme with security tag model for providing effective secured routing. This model uses only the trusted nodes with the forwarding reliability of data transmission and it isolates the malicious nodes from the providing path. Moreover, every node in this model is assigned with a security tag that is used for efficient authentication. Thus, by combining authentication, trust and subject logic, the proposed approach is capable of choosing the trusted nodes effectively to participate in forwarding the packets of trustful peer nodes successfully. The simulation results obtained from this work show that the proposed routing protocol provides optimal network performance in terms of security and packet delivery ratio.

• The KIPS Transactions:PartA
• /
• v.17A no.5
• /
• pp.237-248
• /
• 2010

UPnP(Universal Plug and Play) is a middleware of DLNA (Digital Living Network Alliance) services a home network. UPnP supports the connections between each other devices in networks and also provides service discovery and advertisement with SSDP(Simple Service Discovery Protocol), which is generally designed for wired networks. SSDP operates on multicasting discovery request and advertisement and unicasting a reply in networks. It is a challenge issue for service discovery protocol such as SSDP to provide a stable and effective service in wireless ad-hoc networks. Wired based service discovery protocol does not consider the dynamics of wireless ad-hoc network. In that case, the nodes are freely in or out. Therefore, this paper proposes a flexible SSDP(fSSDP) which is a peer-to-peer(P2P) discovery protocol adopted for wireless ad-hoc Networks. It is implemented on the extension of SSDP. fSSDP supports a functionality that the broadcast area of service discovery dynamically changes with the periodically updated area of advertisement. It is good for reducing messaging overhead caused from the broadcast flooding of service discovery in wireless ad-hoc network.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.4
• /
• pp.29-39
• /
• 2009

The need for radio spectrum is recently considered as a huge hurdle towards the rapid development of wireless networks. Large parts of the spectrum are allocated to licensed radio services in proprietary way. However, enormous success of the wireless services and technologies in the unlicensed bands has brought new ideas and innovations. In recent years cognitive radio has gained much attention for solving the spectrum scarcity problem. It changes the way spectrum is regulated so that more efficient spectrum utilization is possible. Multi-hop relay technology on the other hand has intensively been studied in the area of ad hoc and peer-to-peer networks. But in cellular network, only recently the integration of multi-hop capability is considered to enhance the performance significantly. Multi-hop relaying can extend the coverage of the cell to provide high data rate service to a greater distance and in the shadowed regions. Very few papers still exist that combine these methods to maximize the spectrum utilization. Thus we propose a network architecture combining these two technologies in a way to maximize the system throughput. We present the throughput capacity equations for the proposed system model considering various system parameters like utilization factor by the primary users and primary users' transmission radius and through extensive numerical simulations we analyze the significance of work.