Data-Aggregation and Dual-Sinks Based Routing Algorithm in Event-Driven Wireless Sensor Networks

In order to optimize the total energy consumption, this paper proposes a routing algorithm based on data-aggregation and dual-sinks. The algorithm can cluster nodes within event areas in a distributed manner and build a data aggregation tree with good aggregation ratio rooted at the primary sink in the help of a routing aggregation center with low control overhead. The aided sink moves to the proximity of nodes with heavier load to intercept aggregated data, balancing and decreasing network load further. Algorithm analysis and experiments show that the algorithm leads to less control overhead associated with routing construction and maintenance, better data aggregation and more balanced load, promoting network performance. Copyright © 2014 IFSA Publishing, S. L.

[1]  Charalampos Konstantopoulos,et al.  A Rendezvous-Based Approach Enabling Energy-Efficient Sensory Data Collection with Mobile Sinks , 2012, IEEE Transactions on Parallel and Distributed Systems.

[2]  Azzedine Boukerche,et al.  DRINA: A Lightweight and Reliable Routing Approach for In-Network Aggregation in Wireless Sensor Networks , 2013, IEEE Transactions on Computers.

[3]  Subir Biswas,et al.  Analyzing multi-hop routing feasibility for sensor data harvesting using mobile sinks , 2012, J. Parallel Distributed Comput..

[4]  Emanuel Melachrinoudis,et al.  Exploiting Sink Mobility for Maximizing Sensor Networks Lifetime , 2005, Proceedings of the 38th Annual Hawaii International Conference on System Sciences.

[5]  Yiwei Thomas Hou,et al.  Theoretical Results on Base Station Movement Problem for Sensor Network , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[6]  Young-Bae Ko,et al.  Efficient clustering-based data aggregation techniques for wireless sensor networks , 2011, Wirel. Networks.

[7]  Eduardo Freire Nakamura,et al.  A reactive role assignment for data routing in event-based wireless sensor networks , 2009, Comput. Networks.

[8]  Azzedine Boukerche,et al.  A scalable and dynamic data aggregation aware routing protocol for wireless sensor networks , 2010, MSWIM '10.

[9]  Ioannis Chatzigiannakis,et al.  Efficient data propagation strategies in wireless sensor networks using a single mobile sink , 2008, Comput. Commun..

[10]  Liao Minghong,et al.  Movement-Assisted Data Gathering Scheme with Load-Balancing for Sensor Networks , 2007 .

[11]  Waylon Brunette,et al.  Data MULEs: modeling and analysis of a three-tier architecture for sparse sensor networks , 2003, Ad Hoc Networks.

[12]  Mani B. Srivastava,et al.  Multiple Controlled Mobile Elements (Data Mules) for Data Collection in Sensor Networks , 2005, DCOSS.

[13]  Yun Zou,et al.  A Data Aggregation Transfer Protocol Based on Clustering and Data Prediction in Wireless Sensor Networks , 2011, 2011 7th International Conference on Wireless Communications, Networking and Mobile Computing.

[14]  Mohamed F. Younis,et al.  Sink repositioning for enhanced performance in wireless sensor networks , 2005, Comput. Networks.

[15]  Hans Jürgen Prömel,et al.  A 1.598 approximation algorithm for the Steiner problem in graphs , 1999, SODA '99.

[16]  Anantha P. Chandrakasan,et al.  An application-specific protocol architecture for wireless microsensor networks , 2002, IEEE Trans. Wirel. Commun..

[17]  Deborah Estrin,et al.  The impact of data aggregation in wireless sensor networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems Workshops.