• International Journal of Computer Science & Network Security
• /
• v.21 no.1
• /
• pp.6-11
• /
• 2021

Routing protocols play a pivotal role in the energy management and lifespan of any Wireless Sensor Network. Lower network lifetime has been one of the biggest concerns in LEACH protocol due to dead nodes. The LEACH protocol suffers from uneven energy distribution problem due to random selection of a cluster head. The cluster head has much greater responsibility compared to other non- cluster head nodes and consumes greater energy for its roles. This results in early dead nodes due to energy lost for the role of cluster- head. This study proposes an approach to balance the energy consumption of the LEACH protocol by using a semi-deterministic opportunity coefficient to select the cluster head. This is calculated in each node with the battery energy level and node ID. Ultimately, based on the opportunity cost, cluster head will be selected and broadcasted for which other nodes with higher opportunity cost will agree. It minimizes the chances of nodes with lower battery level being elected as cluster head. Our simulation experiments demonstrate that cluster heads chosen using our proposed algorithm perform better than those using the legacy LEACH protocol.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.10B
• /
• pp.876-890
• /
• 2003

This paper proposes a protocol for the reliableand QoS-aware multicast transport, which is called the Enhanced Communications Transport Protocol (ECTP). The ECTP has so far been developed and standardized in ITU-T SG17 and ISO/IEC JTC 1/SC 6. Differently from the conventional reliable multicast, as shownin the IETF RMT WG, the ECTP additionally provides several distinct features such as tight control of multicast session, tree-based error control, and QoS management. For the tight control of multicast connections, the sender is at the heart of one-to-many group communications, and it is responsible for overall connection management such as connection creation/termination, pause/resumption, and the join and leave operations. for tree-based reliability control, ECTP configures a hierarchical tree during connection creation. Error control is performed within each local group defined by a control tree, which was partly designed like the IETF TRACK approach. Each parent retransmits lost data in response to retransmission requests from its children. For QoS management, ECTP supports QoS negotiation for resource reservation, and it also provides QoS monitoring and maintenance operations. ECTP has been implemented and tested on Linux machine, along with Application Programming Interfaces based on Berkeley sockets. For basic testing of the ECTP functionality, we give some preliminary experimental results for performance comparison of ECTP and TCP unicast transports. In conclusion, we describe the status of ECTP experimentations over APAN/KOREN testbed networks

• Journal of Information Processing Systems
• /
• v.3 no.1
• /
• pp.1-7
• /
• 2007

In mobile ad hoc networks, an application scenario requires mostly collaborative mobility behavior. The key problem of those applications is scalability with regard to the number of multicast members as well as the number of the multicast group. To enhance scalability with group mobility, we have proposed a multicast protocol based on a new framework for hierarchical multicasting that is suitable for the group mobility model in MANET. The key design goal of this protocol is to solve the problem of reflecting the node's mobility in the overlay multicast tree, the efficient data delivery within the sub-group with group mobility support, and the scalability problem for the large multicast group size. The results obtained through simulations show that our approach supports scalability and efficient data transmission utilizing the characteristic of group mobility.

• Proceedings of the IEEK Conference
• /
• 2003.07b
• /
• pp.927-930
• /
• 2003

In this paper, a design of processor IP for TCP/IP protocol stack is described. The processor consists of input and output buffer memory with dual bank structure, 32-bit RISC microprocessor core, DMA unit with on-the-fly checksum capability. To handle the various modes of TCP/IP protocol, hardware and software co-design approach is used rather than the conventional state machine based design. To eliminate delay time due to the data transfer and checksum operation, DAM module which can execute the checksum operation on-the-fly along with data transfer operation is adopted. By programming the on-chip code ROM of RISC processor differently. the designed stack processor can support the packet format conversion operations required in the various TCP/IP protocols.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.5
• /
• pp.1604-1617
• /
• 2014

This paper proposes RIX-MAC (Receiver-Initiated X-MAC), a new energy-efficient MAC protocol based on an asynchronous duty cycling. RIX-MAC improves energy efficiency through utilizing short preambles and adopting the receiver-initiated approach, where RIX-MAC minimizes sender nodes' energy consumption by enabling transmitters to predict receiver nodes' wake-up times. It also reduces receiver nodes' energy consumption by decreasing the number of control frames. We use the network simulator to evaluate RIX-MAC's performance. Compared to the prior asynchronous duty cycling approaches of X-MAC and PW-MAC, the proposed protocol shows a remarkable improvement in energy-efficiency and end-to-end delay.

• Journal of the Korean Association of Oral and Maxillofacial Surgeons
• /
• v.46 no.5
• /
• pp.358-360
• /
• 2020

The management of odontogenic keratocysts (OKC) remains a hotly debated topic in oral and maxillofacial surgery. Despite numerous studies and systematic reviews on treatment options, there is a lack of consensus and no accepted protocol on the management of OKC. Hence, the aim of this study was to briefly summarize all large systematic reviews in the literature on the management of OKC and formulate an evidence-based management protocol. Data from five large systematic reviews were combined to calculate the mean recurrence rate for each technique. Decompression followed by enucleation along with adjuvant methods such as application of Carnoy's solution and peripheral ostectomy can result in very low recurrence and is an acceptable first line treatment. The surgical approach should be determined by lesion size, patient age, proximity to vital structures, accessibility, soft tissue/cortical perforation, and if the lesion is recurrent.

• 한국HCI학회:학술대회논문집
• /
• 2008.02a
• /
• pp.669-673
• /
• 2008

The service discovery method is an important technology finding and offering users' desirable services in smart meeting spaces. Extensive researches of the service discovery methods are achieved: SSDP(simple service discovery protocol) of UPnP(universal plug & play) and so on. However, there are several limitations to satisfy the requirements of service discovery in smart meeting spaces. In this paper, the requirements of service discovery in smart meeting spaces are investigated and the service discovery method based on multi-agent system is proposed in the practical aspect. Additionally, we explore the possibilities of the proposed approach by implementing a couple of services belonging to the smart meeting spaces.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.6
• /
• pp.29-36
• /
• 2005

RFID(Radio Frequency Identification) will be used for recognizing things and offering distinctive information in Ubiquitous environment. But we are not ready to provide security service to RFID. Therefore we propose the approach of safe RFID system which provides the solution for eavesdrop, forgery, and modification based on Pre-Distribution protocol and RC5 security algorithm. First We distributes the secret key to the Tag with the Reader that is major subject on RFID system using Pre-Distribution protocol. Then we will provide to various security services and privacy protection using RC5 security algorithm. The proposed safe RFID system simulated on ATmega128 evaluate environment.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1685-1688
• /
• 2002

Application Routing Load Balancing (ARLB) is a novel load balancing mode that combines QoS routing and load balancing in per application to support QoS far real-time application based on wired network. Zone Routing Protocol (ZRP) is a recent hybrid proactive/reactive routing approach in an attempt to achieve scalability of ad-hoc network. This routing approach has the potential to be efficient in the generation of control traffic than traditional routing schemes. Up to now, without proper load balancing tools, the ZRP can actually guarantee QoS for delay-sensitive applications when congestion occurred in ad-hoc network. In this paper, we propose the ARLB to improve QoS fur delay-sensitive applications based on ZRP in ad-hoc network when congestion occurred and to be forwarding mechanism fur route coupling to support QoS for real-time applications. The critical point is that the routing metric of ARLB is originally designed for wired network environment. Therefore, we study and present an appropriate metric or cost computation routing of ARLB for recently proposed ZRP over ad-hoc network environment.

• Journal of Communications and Networks
• /
• v.8 no.3
• /
• pp.330-338
• /
• 2006

Many web cache systems and policies concerning them have been proposed. These studies, however, consider large objects less useful than small objects in terms of performance, and evict them as soon as possible. Even if this approach increases the hit rate, the byte hit rate decreases and the connections occurring over congested links to outside networks waste more bandwidth in obtaining large objects. This paper puts forth a client-cluster approach for improving the web cache system. The client-cluster is composed of the residual resources of clients and utilizes them as exclusive storage for large objects. This proposed system achieves not only a high hit rate but also a high byte hit rate, while reducing outgoing traffic. The distributed hash table (DHT) based peer-to-peer lookup protocol is utilized to manage the client-cluster. With the natural characteristics of this protocol, the proposed system with the client-cluster is self-organizing, fault-tolerant, well-balanced, and scalable. Additionally, the large objects are managed with an index based allocation method, which balances the loads of all clients well. The performance of the cache system is examined via a trace driven simulation and an effective enhancement of the proxy cache performance is demonstrated.