• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.12
• /
• pp.873-875
• /
• 2014

In this paper we describe an asynchronous MAC protocol with receiver-initiated duty cycling for energy-efficiency in wireless sensor networks(WSN). Legacy asynchronous MAC protocols, X-MAC and PW-MAC, has weaknesses which generates too many control packets and has data collision problem between multiple transmitters, respectively. Therefore, we propose a receiver-initiated asynchronous MAC protocol which generates control packets from transmitter to complement these disadvantages. Compared to the prior asynchronous duty cycling approaches of X-MAC and PW-MAC, the proposed protocol shows a improvement in energy-efficiency, throughput and latency from simulation results.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.11
• /
• pp.1423-1430
• /
• 2016

The MAC protocols, which are classified into synchronous and asynchronous MAC protocol in the wireless sensor network, have actively studied. Especially, the asynchronous MAC protocol needs to research on the algorithm synchronizing between nodes, since each node independently operates in its own duty cycle. Typically, Receiver-Initiated MAC protocol is the algorithm synchronizing particular nodes by using beacon immediately transmitted by each node when it wakes up. However, the sender consumes unnecessary energy because it blankly waits until receiving the receiver's beacon, even if it does not know when the receiver's beacon is transmitted. In this paper, we propose the MAC protocol which can improve the performance by selecting an optimal node between a sender and a receiver to overcome the disadvantages. The simulation results show that the proposed algorithm improves energy efficiency and decreases average delay time than the conventional algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.2
• /
• pp.764-784
• /
• 2017

Energy efficiency is an essential requirement in designing a MAC protocol for wireless sensor networks (WSNs) using battery-operated sensor nodes. We proposed a new receiver-initiated MAC protocol, RIX-MAC, based on the X-MAX protocol with asynchronous duty cycles. In this paper, we analyzed the performance of RIX-MAC protocol in terms of throughput, delay, and energy consumption using the model. For modeling the protocol, we used the Markov chain model, derived the transmission and state probabilities, and obtained the equations to solve the performance of throughput, delay, and energy consumption. Our proposed model and analysis are validated by comparing numerical results obtained from the model, with simulation results using NS-2.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.2
• /
• pp.396-407
• /
• 1999

A Multicast transfer is a critical delivery method to provide a transport service to multipeer applications, the various problems on the multicast transfer environments have been occurred from the results of current research. One of these problems is the multicast transport service issue to guarantee reliability and scalability. First, this paper presents the related research of the reliable multicast transport methods, and then proposes a new transfer architecture using the Agent Sender and Receiver Concept(ASRC) to solve a reliable multicast transfer issue. we also propose a method to apply the proposed architecture(ASRC) to the well-known sender-initiated and receiver-initiated transport protocol. In order 새 validate the proposed ASRC architecture, t도 applied sender and receiver system si compared and analyzed over the processing requirement and maximum throughput.

• Journal of Internet Computing and Services
• /
• v.3 no.4
• /
• pp.11-18
• /
• 2002

The IP multicasting service system based on IGMP(Internet Group Management Protocol) is the receiver initiated multicasting system that all receivers must join to and leave from the server of multicasting service. The IGMP is less effective and reliable to apply the education system that all computers of students ore synchronized a teacher's computer. A proposed middle-ware in this paper provides the reliable data transferring and the server initiated multicasting system that client as student's PC is controled by a multicasting server as teacher's PC, This middle-ware is consisted with two major component, The one is the group manager that handle the status informations of members in each group. Another is the reliable sender/receiver that has The transmission protocol based on NAK message and flow control. As the results of the test that 22khz digital voice data and 1024$\times$768 24bit color image data were tested for 30 PCs connected with 100baseT, the voice data was completely without error transferred and the image data was successfully transferred with 0.004% retransmit rate under 2 frames/sec load.

• 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.

• Journal of Internet Computing and Services
• /
• v.4 no.3
• /
• pp.47-55
• /
• 2003

Multicast protocols ore developed in order to support group communications efficiently, However. there still exist some issues to be solved for deploy multicast protocol in the public internet. This paper refers problem of existing Reliable Multicast Protocols and redesigns component function, and proposes enhanced reliable multicast transport protocol, This paper proposed a improved multicast transport scheme in NACK based reliable multicast. This scheme is much faster than by sender-initiated or receiver-initiated recovery and latency is smaller. Designed components are implemented in UNIX environment using C programming longuage. Then the protocol was evaluated performance through simulation. As the result, proposed protocol is better than existing protocols in both of transmission delay and packet loss. Especially, proposed protocol in this paper con be used in multicast services needed high reliability.

• Journal of KIISE:Information Networking
• /
• v.28 no.4
• /
• pp.578-585
• /
• 2001

IP Multicast that provides best-efforts service does not guarantee reliable delivery of multicast packets. In recent years, there are many approaches to support reliable multicast, but those are insufficient for implementing scalable and reliable multicast over Internet. We propose a Reliable Multicast Architecture(RMA) for scalable and reliable multicast. The RMA model guarantees reliability using a receiver initiated retransmission mechanism, and scalability using a feedback suppression mechanism by Multicast Router(MR). Furthermore, it utilizes underlying multicast routing information to minimize the cost of protocol modification and overheads. Our performance analyses show that RMA is much superior to previous works in the point of scalability and compatibility.

• The KIPS Transactions:PartA
• /
• v.8A no.2
• /
• pp.133-146
• /
• 2001

In a dynamic load distribution policies, each node gathers the current system sates information before making a decision on load balancing. Load balancing policies based on this strategy can suffer from processor thrashing. In this paper, we propose a new algorithm which attempts to decrease the frequency of the processor thrashing, the algorithm is based on the integration of three components. The first, the algorithm of which determine the size of jobs be transferred. The second, negotiation protocol with obtains a mutual agreement between a sender and a receiver on the transferring job size. And the third, a symmetrically-initiated location policy. The algorithm proposed in this paper used Siman IV as simulation tool to prove the improvement of performance. I analyzed the result of simulation, and compared with related works. The mean response time shows that there are no difference with existing policy, but appear a outstanding improvement in high load. The thrashing coefficient that shows the average response time, CPU overhead and the thrashing ratio at both the receiving and sending node has been used in the analysis. A significant improvement in the average response time and the CPU overhead ratio was detected using our algorithm when an overhead occurred in the system over other algorithm. The thrashing coefficient differed in the sending node and the receiving node of the system. Using our algorithm, the thrashing coefficient at the sending node showed more improvement when there was an overhead in the system, proving to be more useful. Therefore, it can be concluded that the thrashing ratio can be reduce by properly setting the maximum and minimum value of the system’s threshold queue.