Browsing Department of Electronics, Computing & Maths by Authors
Channel and timeslot co-scheduling with minimal channel switching for data aggregation in MWSNs.Yeoum, Sanggil; Kang, Byungseok; Lee, Jinkyu; Choo, Hyunseung; Sungkyunkwan University (MDPI, 2017-05-04)Collision-free transmission and efficient data transfer between nodes can be achieved through a set of channels in multichannel wireless sensor networks (MWSNs). While using multiple channels, we have to carefully consider channel interference, channel and time slot (resources) optimization, channel switching delay, and energy consumption. Since sensor nodes operate on low battery power, the energy consumed in channel switching becomes an important challenge. In this paper, we propose channel and time slot scheduling for minimal channel switching in MWSNs, while achieving efficient and collision-free transmission between nodes. The proposed scheme constructs a duty-cycled tree while reducing the amount of channel switching. As a next step, collision-free time slots are assigned to every node based on the minimal data collection delay. The experimental results demonstrate that the validity of our scheme reduces the amount of channel switching by 17.5%, reduces energy consumption for channel switching by 28%, and reduces the schedule length by 46%, as compared to the existing schemes.
Trail-using ant behavior based energy-efficient routing protocol in wireless sensor networks.Jung, Soon-gyo; Kang, Byungseok; Yeoum, Sanggil; Choo, Hyunseung; Sungkyunkwan University (SAGE Publications, 2016-04-06)Swarm Intelligence (SI) observes the collective behavior of social insects and other animal societies. Ant Colony Optimization (ACO) algorithm is one of the popular algorithms in SI. In the last decade, several routing protocols based on ACO algorithm have been developed for Wireless Sensor Networks (WSNs). Such routing protocols are very flexible in distributed system but generate a lot of additional traffic and thus increase communication overhead. This paper proposes a new routing protocol reducing the overhead to provide energy efficiency. The proposed protocol adopts not only the foraging behavior of ant colony but also the trail-using behavior which has never been adopted in routing. By employing the behaviors, the protocol establishes and manages the routing trails energy efficiently in the whole network. Simulation results show that the proposed protocol has low communication overhead and reduces up to 55% energy consumption compared to the existing ACO algorithm.