Browse > Article
http://dx.doi.org/10.3837/tiis.2013.11.002

Energy-Aware Self-Stabilizing Distributed Clustering Protocol for Ad Hoc Networks: the case of WSNs  

Ba, Mandicou (CReSTIC - SysCom EA 3804, Universite de Reims Champage-Ardenne)
Flauzac, Olivier (CReSTIC - SysCom EA 3804, Universite de Reims Champage-Ardenne)
Haggar, Bachar Salim (CReSTIC - SysCom EA 3804, Universite de Reims Champage-Ardenne)
Makhloufi, Rafik (CReSTIC - SysCom EA 3804, Universite de Reims Champage-Ardenne)
Nolot, Florent (CReSTIC - SysCom EA 3804, Universite de Reims Champage-Ardenne)
Niang, Ibrahima (Laboratoire d'Informatique de Dakar, Universite Cheikh Anta Diop)
Publication Information
KSII Transactions on Internet and Information Systems (TIIS) / v.7, no.11, 2013 , pp. 2577-2596 More about this Journal
Abstract
In this paper, we present an Energy-Aware Self-Stabilizing Distributed Clustering protocol based on message-passing model for Ad Hoc networks. The latter does not require any initialization. Starting from an arbitrary configuration, the network converges to a stable state in a finite time. Our contribution is twofold. We firstly give the formal proof that the stabilization is reached after at most n+2 transitions and requires at most $n{\times}log(2n+{\kappa}+3)$ memory space, where n is the number of network nodes and ${\kappa}$ represents the maximum hops number in the clusters. Furthermore, using the OMNeT++ simulator, we perform an evaluation of our approach. Secondly, we propose an adaptation of our solution in the context of Wireless Sensor Networks (WSNs) with energy constraint. We notably show that our protocol can be easily used for constructing clusters according to multiple criteria in the election of cluster-heads, such as nodes' identity, residual energy or degree. We give a comparison under the different election metrics by evaluating their communication cost and energy consumption. Simulation results show that in terms of number of exchanged messages and energy consumption, it is better to use the Highest-ID metric for electing CHs.
Keywords
Ad Hoc and WSNs; Clustering; Energy-Aware; Self-stabilizing; OMNeT++;
Citations & Related Records
연도 인용수 순위
  • Reference
1 I. Akyildiz, W. Su, Y. Sankarasubramaniam, E. Cayirci, "Wireless sensor networks: a survey," Computer Networks, 38 (4), pp. 393 - 422, 2002,   DOI   ScienceOn
2 G. J. Pottie, W. J. Kaiser, "Wireless integrated network sensors," Communications of the ACM, 43 (5), pp. 51-58, 2000.   DOI   ScienceOn
3 I. Lavallee, "Self-stabilizing distributed spanning tree and leader election algorithm," International Journal of Computer and Information Science, pp.119-125, 2000.
4 H. Baala, O. Flauzac, J. Gaber, M. Bui, T. El-Ghazawi, "A self-stabilizing distributed algorithm for spanning tree construction in wireless ad hoc networks," Journal of Parallel and Distributed Computing, pp. 97 - 104, 2003.
5 L. Blin, M. G. Potop-Butucaru, S. Rovedakis, "Self-stabilizing minimum degree spanning tree within one from the optimal degree," Journal of Parallel and Distributed Computing, pp. 438 - 449, 2011.
6 C. Johnen, L. Nguyen, "Self-stabilizing weight-based clustering algorithm for ad hoc sensor networks," Algorithmic Aspects of Wireless Sensor Networks, pp. 83-94, 2006.
7 A. Datta, L. Larmore, P. Vemula, "Self-stabilizing leader election in optimal space," Stabilization, Safety, and Security of Distributed Systems, pp. 109-123, 2008.
8 O. Dagdeviren, K. Erciyes, "A hierarchical leader election protocol for mobile ad hoc networks," in Proc. of the 8th international conference on Computational Science, pp. 509-518, 2008.
9 N. Mitton, A. Busson, E. Fleury, "Self-organization in large scale ad hoc networks," in Proc. of the Mediterranean ad hoc Networking Workshop, 2004.
10 J. Yu, Y. Qi, G. Wang, X. Gu, "A cluster-based routing protocol for wireless sensor networks with nonuniform node distribution," AEU - International Journal of Electronics and Communications, pp. 54 - 61, 2012.
11 O. Younis, S. Fahmy, "Heed: a Hybrid, Energy-Efficient, Distributed clustering approach for ad hoc sensor networks," IEEE Transactions on Mobile Computing, pp. 366 - 379, 2004.
12 C. Johnen, L. Nguyen, Self-stabilizing weight-based clustering algorithm for ad hoc sensor networks, in: Algorithmic Aspects of Wireless Sensor Networks, 2006, pp. 83-94.
13 O. Flauzac, B. S. Haggar, F. Nolot, "Self-stabilizing clustering algorithm for ad hoc networks," in Proc. of the International Conference on Wireless and Mobile Communications, pp. 24-29, 2009.
14 E. Caron, A. K. Datta, B. Depardon, L. L. Larmore, "A self-stabilizing k-clustering algorithm for weighted graphs," Journal of Parallel and Distributed Computing, 1159-1173, 2010.
15 C. Johnen, L. Nguyen, "Self-stabilizing construction of bounded size clusters," in Proc. of the International Symposium on Parallel and Distributed Processing with Applications, pp. 43-50, 2008.
16 C. Johnen, L. H. Nguyen, "Robust self-stabilizing weight-based clustering algorithm," Theoretical Computer Science, pp. 581 - 594, 2009.
17 N. Mitton, E. Fleury, I. Guerin Lassous, S. Tixeuil, "Self-stabilization in self-organized multihop wireless networks," in Proc. of the 2nd International Workshop on Wireless Ad Hoc Networking, pp. 909-915, 2005.
18 A. K. Datta, S. Devismes, L. L. Larmore, "A self-stabilizing O(n)-round k-clustering algorithm," in Proc. of the 28th IEEE International Symposium on Reliable Distributed Systems, pp. 147-155, 2009.
19 E. W. Dijkstra, "Self-stabilizing systems in spite of distributed control," Commun. ACM, pp. 643-644, 1974.
20 A. Amis, R. Prakash, T. Vuong, D. Huynh, "Max-min d-cluster formation in wireless ad hoc networks," in Proc. of the INFOCOM, pp. 32-41, 2000.
21 M. Ba, O. Flauzac, R. Makhloufi, F. Nolot, and I. Niang, "Comparison between self-stabilizing clustering algorithms in message-passing model, " in Proc. of 9th International Conference on Autonomic and Autonomous Systems, pp. 27-32, 2013.
22 H. Attiya, J. Welch, "Distributed computing: fundamentals, simulations, and advanced topics," Wiley series on Parallel and Distributed Computing, 2004.
23 G. Tel, Introduction to Distributed Algorithms, Cambridge University Press, 2000.
24 M. Ba, O. Flauzac, B. S. Haggar, F. Nolot, I. Niang, "Self-stabilizing k-hops clustering algorithm for wireless ad hoc networks, " in Proc. of 7th ACM ICUIMC (IMCOM), pp. 38:1-38:10 2013.
25 A. Varga, R. Hornig, "An overview of the OMNeT++ simulation environment," in Proc. of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshop, pp. 60:1-60:10, 2008.
26 J. Wang, J.-U. Kim, L. Shu, Y. Niu, S. Lee, "A distance-based energy aware routing algorithm for wireless sensor networks," Sensors, pp. 9493-9511, 2010.
27 SNAP: Stanford Network Analysis Platform, http://snap.stanford.edu, 2013.
28 F. Cappello et al., "Grid'5000: A large scale and highly reconfigurable experimental grid testbed," International Journal of High Performance Computing Applications, pp. 481-494, 2006.
29 W. R. Heinzelman, A. Chandrakasan, H. Balakrishnan, "Energy-efficient communication protocol for wireless microsensor networks," in Proc. of the 33rd Annual Hawaii International Conference on System Sciences, pp. 8020 - 8030, 2000.
30 P. Erdos, A. Renyi, "On the evolution of random graphs," Publ. Math. Inst. Hung. Acad. Sci, pp. 17-61, 1960.