• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.1
• /
• pp.187-192
• /
• 2017

In dense deployments of sensor nodes in Wireless Sensor Networks, the MAC protocol has challenges to solve problems such as reducing delivery delay and reducing energy consumption. To solve these problems lots of protocols are suggested. This paper proposed a sensor nodes' residual energy based wake-up control mechanism, in which each node decides whether it wakes up or stays in sleep mode to save energy consumption by reducing unnecessary idle listening. The main idea of the wake-up control mechanism is to save node's energy consumption. The proposed wake-up control mechanism is based on the RI-MAC protocol, which is one of the receiver-initiated MAC protocols. A receiver node in the proposed mechanism periodically wakes up and broadcasts a beacon signal based on the energy status of the node. A receiver node also adjusts wake-up period based on the traffics. Results have shown that the proposed MAC protocol outperformed RI-MAC protocol in the terms of energy consumption.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.9 no.12
• /
• pp.1353-1358
• /
• 2014

Tremendous amount of dummy packets are generally generated for faking over a wireless sensor network so as to keep the location privacy of nodes on the communication paths against the global eavesdropping. In this paper, a scoped-flooding protocol is designed for transferring data between each source and mobile sink(aka, basestation) where, the only nodes within the scope are allowed to issue dummy packets at every idle time so that the location privacy of the nodes on the paths is kept and the amount of dummy packets is reduced to the extend of the flooding scope. The size of the flooding diameter can be taken into consideration of the privacy level and the communication cost. We design a detailed specification of the protocol and verify several properties.

• Journal of Information Processing Systems
• /
• v.6 no.3
• /
• pp.413-434
• /
• 2010

Wireless sensor networks are usually characterized by dense deployment of energy constrained nodes. Due to the usage of a large number of sensor nodes in uncontrolled hostile or harsh environments, node failure is a common event in these systems. Another common reason for node failure is the exhaustion of their energy resources and node inactivation. Such failures can have adverse effects on the quality of the real-time services in Wireless Sensor Networks (WSNs). To avoid such degradations, it is necessary that the failures be recovered in a proper manner to sustain network operation. In this paper we present a dynamic Energy efficient Real-Time Job Allocation (ERTJA) algorithm for handling node failures in a cluster of sensor nodes with the consideration of communication energy and time overheads besides the nodes' characteristics. ERTJA relies on the computation power of cluster members for handling a node failure. It also tries to minimize the energy consumption of the cluster by minimum activation of the sleeping nodes. The resulting system can then guarantee the Quality of Service (QoS) of the cluster application. Further, when the number of sleeping nodes is limited, the proposed algorithm uses the idle times of the active nodes to engage a graceful QoS degradation in the cluster. Simulation results show significant performance improvements of ERTJA in terms of the energy conservation and the probability of meeting deadlines compared with the other studied algorithms.

• Journal of Information Technology Services
• /
• v.7 no.4
• /
• pp.209-219
• /
• 2008

Recently the number of Internet firms providing useful information like weather forecast data is growing. However most of such information is not prepared in accordance with customers' demand, resulting in relatively low customer satisfaction. To upgrade the service quality, it is recommended to devise a system for customers to get involved in the process of service production, which normally requires a huge investment on supporting computer systems like clusters. In this paper, as a way to cut down the budget for computer systems but to improve the performance, we extend the HPC cluster system to include other Internet servers working independently on the same LAN, to make use of their idle times. We also deal with some issues resulting from the extension, like the security problem and a possible deadlock caused by overload on some non-dedicated nodes. At the end, we apply the technique in the solution of some 2D grid problem.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.6 s.324
• /
• pp.33-39
• /
• 2004

Design of efficient Medium Access Control (MAC) protocols with both high throughput performances is a major focus in distributed contention based MAC protocol research. In this paper, we propose an efficient contention based MAC protocol for wireless Local Area Networks, namely, the Developed Collision Resolution (DCR) algorithm. This algorithm is developed based on the following innovative ideas: to speed up the collision resolution, we actively redistribute the backoff timers for all active nodes; to reduce the average number of idle slots, we use smaller contention window sizes for nodes with successful packet transmissions and reduce the backoff timers exponentially fast when a fixed number of consecutive idle slots are detected. We show that the proposed DCR algorithm provides high throughput performance and low latency in wireless LANs.

• Journal of Information Processing Systems
• /
• v.2 no.1
• /
• pp.39-43
• /
• 2006

In this paper, we proposed TASL-MAC, a medium-access control (MAC) protocol for wireless sensor networks. In wireless sensor networks, sensor nodes are usually deployed in a special environment, are assigned with long-term work, and are supported by a limited battery. As such, reducing the energy consumption becomes the primary concern with regard to wireless sensor networks. At the same time, reducing the latency in multi-hop data transmission is also very important. In the existing research, sensor nodes are expected to be switched to the sleep mode in order to reduce energy consumption. However, the existing proposals tended to assign the sensors with a fixed Sleep/Listening schedule, which causes unnecessary idle listening problems and conspicuous transmission latency due to the diversity of the traffic-load in the network. TASL-MAC is designed to dynamically adjust the duty listening time based on traffic load. This protocol enables the node with a proper data transfer rate to satisfy the application's requirements. Meanwhile, it can lead to much greater power efficiency by prolonging the nodes' sleeping time when the traffic. We evaluate our implementation of TASL-MAC in NS-2. The evaluation result indicates that our proposal could explicitly reduce packet delivery latency, and that it could also significantly prolong the lifetime of the entire network when traffic is low.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.11
• /
• pp.5238-5244
• /
• 2011

Recently, wireless sensor networks have become increasingly interesting areas over extensive application fields such as military, ecological, and health-related areas. Almost sensor networks have mission-critical tasks that requires very high security. Therefore, extensive work has been done for securing sensor networks from outside attackers, efficient cryptographic systems, secure key management and authorization, but little work has yet been done to protect these networks from inside threats. This paper proposed an method to select which nodes should activate their idle nodes as detectors to be able to watch all packets in the sensor network. Suggested method is modeled as optimization equation, and heuristic Greedy algorithm based simulation results are presented to verify my approach.

• Journal of the Korean Society for Precision Engineering
• /
• v.15 no.3
• /
• pp.24-30
• /
• 1998

Strength and displacement of jig body in index machine utilized for multiprocess machining such as drilling, boring and tapping, etc, at the same time were analyzed by the use of finite element analysis soft ware ANSYS 5.2A. The whole geometry was constructed by 4048 elements and 7016 nodes employing 8 node brick element. The analyses were carried out on five loading cases combining vertical and horizontal machining to simulate the case occurring large displacement and the one occurring small displacement one and provided following conclusions. (1) Jig body had sufficient strength because its safety factor was 6.95 even in the most severe loading case. (2) The largest displacement in Z direction was 549 m and that in radial direction was 43.7 m. (3) In order to reduce the displacement, vertical machining rather than horizontal or two or three processes should be adopted in the same station. (4) Alternate change of horizontal machining direction at consecutive stations can reduce the displace ment. (5) The dimension of the slider should be increased to reduce the displacement by the tolerance in the sliding part. (6) A bypass idle piston head needs to be installed to give a counterpart supporting load from opposite direction for a single horizontal machining case.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.469-472
• /
• 2014

S-MAC is hybrids of CSMA and TDMA approaches that use local sleep-wake schedules to coordinate packet exchanges and reduce idle listening. In this method, all the nodes are considered with equal priority which may lead to increased delay during heavy traffic. The method introduced in this paper provides high throughput and small end-to-end delay suitable for applications such as real-time voice streaming and its functionality is independent of underlying synchronization protocol. The novel idea behind our scheme is that it uses the priority concept with (m,k)-firm scheduling in order to achieve its objectives. The performance of our scheme is obtained through simulations for various packet sizes, traffic loads which show significant improvements in packet delivery ratio, and delay compared to existing protocols.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.3
• /
• pp.113-119
• /
• 2009

In this paper, we proposed an efficient TDMA scheduling algorithm for a clustered Wireless Sensor Network. Since some previous algorithms used unnecessary idle period and schedule period in each frame. It became an overhead that might consume unexpected energy and delay data transmission. To solve this problem, a dynamic scheduling algorithm according to the number of member nodes and node traffic load within a cluster was suggested. Our proposed DS-MAC(Dynamic Scheduling MAC) could save energy and reduce transmission delay Then DS-MAC was analyzed mathematically to compare with the previous algorithms.