• Journal of Information Processing Systems
• /
• v.13 no.5
• /
• pp.1320-1330
• /
• 2017

Wireless sensor networks for forest monitoring are typically deployed in fields in which manual intervention cannot be easily accessed. An interesting approach to extending the lifetime of sensor nodes is the use of energy harvested from the environment. Design constraints are application-dependent and based on the monitored environment in which the energy harvesting takes place. To reduce energy consumption, we designed a power management scheme that combines dynamic duty cycle scheduling at the network layer to plan node duty time. The dynamic duty cycle scheduling is realized based on a tier structure in which the network is concentrically organized around the sink node. In addition, the multi-paths preserved in the tier structure can be used to deliver residual packets when a path failure occurs. Experimental results show that the proposed method has a better performance.

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

In this paper we propose a traffic aware Demand Wakeup MAC(TADW-MAC) protocol, in which low data delay and high throughput can be achieved, for wireless sensor networks. With the TADW-MAC protocol, the problem of the DW-MAC protocol, which schedules only one packet to deliver during the Sleep period in a multi-hop transmission is resolved. DW-MAC is not adequate for the applications such as object tracking and fire detection, in which busty data should be transmitted in a limited time when an event occurs [6-8]. When an event occurs, duty cycle can be adjusted in the TADW-MAC protocol to get less energy consumption and low latency. The duty cycle mechanism has been widely used to save energy consumption of sensor node due to idle listening in wireless sensor networks. But additional delay in packet transmission may be increased in the mechanism. Our simulation results show that TADW-MAC outperforms RMAC and DW-MAC in terms of energy efficiency while achieving low latency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.6A
• /
• pp.506-514
• /
• 2009

To minimize energy consumption, most of MAC Protocols in WSNs exploit low duty cycling. Among those, RMAC [4] allows a node to transmit a data packet for multiple hops in a single duty cycle, which is made possible by exploiting a control frame named Pioneer (PION) in setting up the path. In this paper, we present a MAC Protocol called Hop Extended MAC (HE-MAC) that transmits the data packet for more multiple hops in a single duty cycle. It employs an EXP (Explorer) frame to set up the multiple hop transmission, which contains the information of the maximum hop that a packet can be transmitted. With the use of the information in EXP and an internal state of Ready to Receive (RTR), HEMAC extends the relay of the packet beyond the termination of the data period by two more hops compared to RMAC. Along with our proposed adaptive sleeping method, it also reduces power consumption and handles heavy traffic efficiently without experiencing packet inversion observed in RMAC. We analytically obtain the packet delivery latency in HE-MAC and evaluate the performance through ns-2 simulations. Compared to RMAC, HE-MAC achieves 14% less power consumption and 20% less packet delay on average for a random topology of 300 nodes.

• 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.6 no.12
• /
• pp.3046-3060
• /
• 2012

Low power listening (LPL) MAC protocols based on duty-cycling mechanism have been studied extensively to achieve ultra low energy consumption in wireless sensor networks (WSNs). Especially, recent ACK-based LPL schemes such as X-MAC employ strobe preambles and an early ACK, and show fair performances in communications and energy efficiencies. However, the state-of-the-art ACK-based LPL scheme still suffers from collision problems due to the protocol incompleteness. These collision effects are not trivial and make WSNs unstable, aggravate energy consumptions. In this paper, we propose two novel schemes; (i) ${\tau}$-duration CCA to mitigate the collision problem in ACK-based LPL MAC protocols. (ii) Short Preamble Counter (SPC) to conserve more energy by reducing unnecessary overhearing. We demonstrate the performance improvement of our scheme via a mathematical analysis and real-time experiments. Both analysis and experimental results confirm that our proposed scheme saves energy by up to 36% compared to the naive ACK-based LPL MAC protocol thanks to ${\tau}$-duration CCA and SPC.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.593-594
• /
• 2015

In wireless sensor networks (WSNs), due to the very low data rate, the sleeping schedule is usually used to save consumed energy and prolong the lifetime of nodes. However, duty-cycled approach can cause a high end-to-end (E2E) delay. In this paper, we study a node scheduling algorithm in WSNs such that E2E delay meets bounded delay with a given probability. We have applied the probability theory to spot the relationship between E2E delay and node interval. Simulation result illustrates that we can create the network to achieve given delay with prior probability and high energy use efficient as well.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.11
• /
• pp.11-18
• /
• 2014

Most of the energy efficient MAC protocols for wireless sensor networks (WSNs) are based on duty cycling in a single channel and show competitive performances in a small number of traffic flows; however, under concurrent multiple flows, they result in significant performance degradation due to contention and collision. We propose a multi-channel pipelining (MCP) method for convergecast WSN in order to address these problems. In MCP, a staggered dynamic phase shift (SDPS) algorithms devised to minimize end-to-end latency by dynamically staggering wake-up schedule of nodes on a multi-hop path. Also, a phase-locking identification (PLI) algorithm is proposed to optimize energy efficiency. Based on these algorithms, multiple flows can be dynamically pipelined in one of multiple channels and successively handled by sink switched to each channel. We present an analytical model to compute the duty cycle and the latency of MCP and validate the model by simulation. Simulation evaluation shows that our proposal is superior to existing protocols: X-MAC and DPS-MAC in terms of duty cycle, end-to-end latency, delivery ratio, and aggregate throughput.

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

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.12
• /
• pp.98-106
• /
• 2013

The duty-cycle synchronization among mobile sensor nodes with energy-harvesting is very important. The nodes should keep their duty-cycle same to others as much as possible because they have to cooperate each other and to consume energy efficiently. The distribution of node position in network affects not only node connectivity but also the active time of synchronized nodes, and it relates to network life-time finally. In this paper, we introduce a network topology change algorithm (TCA) for energy-harvesting mobile sensor networks based on self-synchronized duty-cycling. The algorithm tries to change a network topology into a balanced topology where the mobile sensor nodes are unified according to the density of the number of nodes. For TCA, both fluid flow algorithm and flock dispersion algorithm are proposed and they are evaluated through the simulation in agent based modeling language. TCA is applied to the energy-harvesting mobile sensor networks to improve the synchronization of duty-cycle and to reduce the variation of energy consumption among nodes.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.2
• /
• pp.169-176
• /
• 2018

In this paper, we consider duty-cycled wireless sensor networks (WSNs) in which sensor nodes are periodically dormant in order to reduce energy consumption. In such networks, as the duty cycle interval increases, the energy consumption decreases. However, a higher duty cycle interval leads to the increase in the end-to-end (E2E) delay. Many applications of WSNs are delay-sensitive and require packets to be delivered from the sensr nodes to the sink with delay requirements. Most of existing studies focus on only reducing the E2E delay, rather than considering the delay bound requirement, which makes hard to achieve the balanced performance between E2E delay and energy consumption. A few study that considered delay bound requirement require time synchronization between neighboring nodes or a specific distribution of deployed nodes. In order to address limitations of existing works, we propose a duty-cycle scheduling algorithm that aims to achieve low energy consumption, while satisfying the delay requirements. To that end, we first estimate the probability distribution for the E2E delay. Then, by using the obtained distribution we determine the maximal duty cycle interval that still satisfies the delay constraint. Simulation results show that the proposed design can satisfy the given delay bound requirements while achieving low energy consumption.