Elsevier

Applied Soft Computing

Volume 12, Issue 7, July 2012, Pages 1884-1890
Applied Soft Computing

Advertisement timeout driven bee's mating approach to maintain fair energy level in sensor networks

https://doi.org/10.1016/j.asoc.2012.04.019Get rights and content

Abstract

In wireless sensor network, dynamic cluster-based routing approach is widely used. Such practiced approach, quickly depletes the energy of cluster heads and induces the execution of frequent re-election algorithm. This repeated cluster head re-election algorithm increases the number of advertisement messages, which in turn depletes the energy of overall sensor network. Here, we proposed the Advertisement Timeout Driven Bee's Mating Approach (ATDBMA) that reduces the cluster set-up communication overhead and elects the standby node in advance for current cluster head, which has the capability to withstand for many rounds.

Our proposed ATDBMA method uses the honeybee mating behaviour in electing the standby node for current cluster head. This approach really outperforms the other methods in achieving reduced number of re-election and maintaining fair energy nodes between the rounds.

Introduction

Wireless Sensor Networks (WSNs) are formed by a set of nodes that gather information and forward it to a sink. They are formed by small, inexpensive and resource limited devices that can interact with the environment and communicate in a wireless manner with other devices [1]. WSNs present a new challenge research problem due to their high flexibility to support several real-world applications. The core operation of wireless sensor network is to collect and process data at the network nodes, and transmit the necessary data to the base station for further analysis and processing. Due to large network size, limited power supply, and inaccessible remote environment, the WSN-based protocols are different from the traditional wireless protocols [2]. Currently there are several energy efficient communication models and protocols that are designed for specific applications and topologies LEACH (Low Energy Adaptive Clustering Hierarchy) is one of the most referenced protocols in the sensor networks area [3], [4].

In LEACH and other routing protocols, when current cluster head changes due to self-destruction or energy loss, increases the overhead, in turn leading to higher energy consumption. This is one of the worrying drawbacks. A possible solution, which is proposed in this paper, is the use of the bound time to reduce set-up communication overhead. During this bound time, sensor nodes receive advertisement messages and from this, node determines multi-route for transmission and consider only the message with the minimum number of hops and standby cluster heads are elected.

The rest of the paper is organized as follows. In Section 2, we review the related work. In Section 3, describes honeybee structure and modelling. The proposed method of ATDBMA algorithm for cluster formation is described in Section 4. In Section 5, we presented the Simulation results. Finally Section 6, concludes the paper.

Section snippets

Related work

Hussian and Matin [5], [6] proposed hierarchical cluster-based routing related to scalability and efficient communication. In a hierarchical architecture, higher energy nodes can be used to process and send the information while low energy nodes can be used to perform the sensing in the proximity of the target. This means that creation of clusters and assigning special tasks to cluster heads can greatly contribute to overall system scalability, lifetime, and energy efficiency. Hierarchical

Honeybee colony structure

A honeybee colony typically consists of a single egg laying long-lived queen, anywhere from zero to several thousand drones (depending on the season) and usually 10,000–60,000 workers [13]. The colony can be founded in two different ways. In “independent founding” the colony starts with one or more reproductive females that construct the nest, lay the eggs, and feed the larvas. The first group of broods is reared alone until they take over the work of the colony. Subsequently, division of

Proposed advertisement timeout driven bee's mating approach (ATDBMA)

The main objective of our approach is to minimize the set-up communication overhead, whenever current cluster head changes. These changes are due to cluster head failures or when its energy level approaches a certain threshold value. During the valid advertisement time period, sensor node receives single multi-purpose message and from this the node starts to determine the following (1) possible routes from the cluster head to sensor node (2) learns the minimum number of hops to reach the

Simulation results

In this Section, we evaluate the performance of wireless sensor network using honeybee mating approach via simulations and compared it to popular hierarchical routing method named LEACH and PEGASIS. To accomplish these experiments, SenSor Plus simulation tool is used. This is an in- house sensor network simulator. SenSor [18] is a realistic and scalable python-based simulator that provides a workbench for prototyping algorithms for WSN. It consists of a fixed API, with customizable internals.

Conclusions

This paper provides a better solution to reduce the number of re-elections by selecting the best standby node in advance for current cluster head. Our proposed ATDBMA is equivalently mimics the honeybee mating behaviour of real honeybees. We have applied the honey mating behaviour for the first time in the standby node selection of wireless sensor network. This honeybee mating inspired approach is effectively used to choose the best standby node from multiple available solutions. Our proposed

J. Senthilkumar received his ME in applied electronics with distinction from Anna University, Chennai in 2004. He is working as Assistant Professor in IT Department of Sona College of Technology and pursuing PhD degree from Anna University, Chennai. He is active in the research area of wireless sensor networks, mobile computing and data mining.

References (19)

There are more references available in the full text version of this article.

Cited by (0)

J. Senthilkumar received his ME in applied electronics with distinction from Anna University, Chennai in 2004. He is working as Assistant Professor in IT Department of Sona College of Technology and pursuing PhD degree from Anna University, Chennai. He is active in the research area of wireless sensor networks, mobile computing and data mining.

M. Chandrasekaran obtained his BE (Hons.) degree in electronics and communication engineering from Madras University in 1983, ME degree in computer science and engineering from Bharathiar University in 1995 and PhD from Anna University, Chennai in 2008. He has 27 years of teaching experience. Currently he is working as professor in the department of ECE at GCE, Salem. He worked as Assistant Director (Planning), in the Directorate of Technical Education at Chennai. He had published more than 30 research papers in International Journals and IEEE International Conferences. Currently he is guiding 12 PhD scholars under Anna University, Coimbatore and 7 PhD scholars under Anna University, Chennai. He is currently serving as AICTE nominee for various engineering colleges and polytechnics in Tamilnadu. His name is included in the 10th anniversary edition of Marquis Who's Who in Science and Engineering. His research interest includes computer networks, wireless sensor networks, neural networks, fuzzy logic etc. He is a member of editorial board of IAENG International Journal of Computer Science. He is in the review committee for the Journals—International Journal of Computer Applications, International Journal of Communication systems, IET Journal on Wireless Sensor Systems and the International conferences sponsored by IEEE and IACSIT.

Y. Suresh received his ME applied electronics from Anna University, Chennai in 2004. He is working as Assistant Professor in IT Department of Sona College of Technology and pursuing PhD degree in Anna University, Chennai. He is active in the research area of computer networks, data mining, control system and mobile computing

S. Arumugam former additional Director of Technical Education, Chennai, Tamilnadu is now with Nandha Engineering College, Erode, Tamilnadu as Chief Executive Officer. He completed his bachelor degree in electrical engineering at P.S.G College of Technology in 1971. He completed his master's degree MSc (Eng.) at P.S.G College of technology in 1973. He finished his Doctorate at Anna University in1990. He is the member in various professional bodies and international societies such as FIE, SMLSI, FIETE, LMISTE, etc. He has published number of papers in international journals, international and national conferences. His research areas include computer networks, mobile computing and sensor networks.

V. Mohanraj received his ME computer science and engineering from Anna University, Chennai in 2004. He is currently working as Assistant Professor in IT Department of Sona College of Technology. He is pursuing PhD degree in Anna University, Chennai. His research area includes web mining, database and intelligent system.

The article is reprinted here for the reader's convenience and for the continuity of the special issue. For citation purposes, please use the original publication details; Applied Soft Computing, 11(5), pp. 4029–4035.

View full text