• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.9
• /
• pp.3056-3074
• /
• 2014

Convergecast is probably the most common communication style in wireless sensor networks (WSNs). And linear network coding (LNC) is a promising concept to improve throughput or reliability of convergecast. Most of the existing works have mainly focused on exploiting these benefits without considering its potential adverse effect. In this paper, we argue that LNC may not always benefit convergecast. This viewpoint is discussed within four basic scenarios: LNC-aided and none-LNC convergecast schemes with and without automatic repeat request (ARQ) mechanisms. The most concerned performance metrics, including packet collection rate, energy consumption, energy consumption balance and end-to-end delay, are investigated. Theoretical analyses and simulation results show that the way LNC operates, i.e., conscious overhearing and the prerequisite of successfully decoding, could naturally diminish its advantages in convergecast. And LNC-aided convergecast schemes may even be inferior to none-LNC ones when the wireless link delivery ratio is high enough. The conclusion drawn in this paper casts a new light on how to effectively apply LNC to practical WSNs.

• The KIPS Transactions:PartC
• /
• v.15C no.4
• /
• pp.273-280
• /
• 2008

In WSN(Wireless Sensor Network) many routing algorithms such as LEACH, PEGASIS and PEDEP consisting of sensor nodes with limited energy have been proposed to extend WSN lifetime. Under the assumption of perfect fusion, these algorithms used convergecast that periodically collects sensed data from all sensor nodes to a base station. But because these schemes studied less energy consumption for a convergecast as well as fairly energy consumption altogether, the minimum energy consumption for a convergecast was not focused enough nor how topology influences to energy consumption. This paper deals with routing topology and energy consumption for a single convergecast in the following ways. We chose major WSN topology as MSC(Minimum Spanning Chain)s, MSTs, PEGASIS chains and proposed LECSEN chains. We solved the MSC length by Linear Programming(LP) and propose the LECSEN chain to compete with MST and MSC. As a result of simulation by Monte Carlo method for calculation of the topology length and standard deviation of link length, we learned that LECSEN is competitive with MST in terms of total energy consumption and shows the best with the view of even energy consumption at the sensor nodes. Thus, we concluded LECSEN is a very useful routing topology in WSN.

• Journal of Information Processing Systems
• /
• v.20 no.2
• /
• pp.252-262
• /
• 2024

The multi-hop wireless sensor network (WSN) suffers from energy limitation and eavesdropping attacks. We propose a simple and energy-efficient convergecast mechanism using inter-flow random linear network coding that can provide confidentiality to the multi-hop WSN. Our scheme consists of two steps, constructing a logical tree of sensor nodes rooted at the sink node, with using the Bloom filter, and transmitting sensory data encoded by sensor nodes along the logical tree upward to the sink where the encoded data are decoded according to our proposed multi-hop network coding (MHNC) mechanism. We conducted simulations using OMNET++ CASTALIA-3.3 framework and validated that MHNC outperforms the conventional mechanism in terms of packet delivery ratio, data delivery time and energy efficiency.

• The KIPS Transactions:PartC
• /
• v.16C no.1
• /
• pp.83-90
• /
• 2009

Wireless Sensor Network (WSN) is a wireless network that gathers information from remote area with autonomously configured routing path. We propose a fusion based routing for a 'convergecast' in which all sensors periodically forward collected data to a base station. Previous researches dealt with only full-fusion or no-fusion case. Our Fusion rate based Spanning Tree (FST) can provide effective routing topology in terms of total cost according to all ranges of fusion rate f ($0{\leq}f{\leq}1$). FST is optimum for convergecast in case of no-fusion (f = 0) and full-fusion (f = 1) and outperforms the Shortest Path spanning Tree (SPT) or Minimum Spanning Tree (MST) for any range of f (0 < f < 1). Simulation of 100-node WSN shows that the total length of FST is shorter than MST and SPT nearby 31% and 8% respectively in terms of topology lengths for all range of f. As a result, we confirmed that FST is a very useful WSN topology.

• Journal of Communications and Networks
• /
• v.13 no.1
• /
• pp.17-25
• /
• 2011

A convergecast is a popular routing scheme in wireless sensor networks (WSNs) in which every sensor node periodically forwards measured data along configured routing paths to a base station (BS). Prolonging lifetimes in energy-limited WSNs is an important issue because the lifetime of a WSN influences on its quality and price. Low-energy adaptive clustering hierarchy (LEACH) was the first attempt at solving this lifetime problem in convergecast WSNs, and it was followed by other solutions including power efficient gathering in sensor information systems (PEGASIS) and power efficient data gathering and aggregation protocol (PEDAP). Our solution-chain routing with even energy consumption (CREEC)-solves this problem by achieving longer average lifetimes using two strategies: i) Maximizing the fairness of energy distribution at every sensor node and ii) running a feedback mechanism that utilizes a preliminary simulation of energy consumption to save energy for depleted Sensor nodes. Simulation results confirm that CREEC outperforms all previous solutions such as LEACH, PEGASIS, PEDAP, and PEDAP-power aware (PA) with respect to the first node death and the average lifetime. CREEC performs very well at all WSN sizes, BS distances and battery capacities with an increased convergecast delay.

• Annual Conference of KIPS
• /
• 2017.04a
• /
• pp.677-679
• /
• 2017

Data convergecast is an indispensable task for any WSN applications. Typically, scheduling in the WSN consists of two phases: tree construction and scheduling. The optimal tree structure and scheduling for the network is proven NP-hard. This paper focuses on the delay optimality while constructing the data convergecast tree. The algorithm can take any tree as the input, and by performing the switches (i.e. a node changes its parent), the expected aggregation delay is potentially reduced. Note that while constructing the tree, only the in-tree collisions between the child nodes sending data to their common parent is considered.

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