Edge betweenness centrality: A novel algorithm for QoS-based topology control over wireless sensor networks

In this paper we propose a novel topology-control algorithm, called edge betweenness centrality (EBC). EBC is based on the concept of betweenness centrality, which has been first introduced in the context of social network analysis (SNA), and measures the ''importance'' of each node in the network. This information allows us to achieve high quality of service (QoS) in wireless sensor networks by evaluating relationships between entities of the network (i.e., edges), and hence identifying different roles among them (e.g., brokers, outliers), thus controlling information flow, message delivery, latency and energy dissipation among nodes. The experimental evaluation and analysis of EBC in comparison to other state-of-the-art topology control algorithms shows that our algorithm outperforms the competitor ones in all observed cases.

[1]  Li Li,et al.  Distributed topology control for power efficient operation in multihop wireless ad hoc networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[2]  Mark D. Corner,et al.  Proceedings of the 9th Workshop on Mobile Computing Systems and Applications, HotMobile 2008, Napa Valley, California, USA, February 25-26, 2008 , 2008, HotMobile.

[3]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[4]  P. Bonacich.  Factoring and weighting approaches to status scores and clique identification , 1972 .

[5]  Sotiris E. Nikoletseas,et al.  Accelerated sensory data collection by greedy or aggregate mobility-based topology ranks , 2009, PE-WASUN '09.

[6]  Ram Ramanathan,et al.  Topology control of multihop wireless networks using transmit power adjustment , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[7]  Chenyang Lu,et al.  Robust topology control for indoor wireless sensor networks , 2008, SenSys '08.

[8]  Deepak Ganesan,et al.  Ultra-low power data storage for sensor networks , 2006, 2006 5th International Conference on Information Processing in Sensor Networks.

[9]  Kyongbum Lee,et al.  An algorithm for modularity analysis of directed and weighted biological networks based on edge-betweenness centrality , 2006, Bioinform..

[10]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[11]  Peter Desnoyers,et al.  Ultra-low power data storage for sensor networks , 2006, 2006 5th International Conference on Information Processing in Sensor Networks.

[12]  Rudra Dutta,et al.  Using Centrality-Based Power Control for Hot-Spot Mitigation in Wireless Networks , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[13]  Deying Li,et al.  QoS topology control in ad hoc wireless networks , 2004, IEEE INFOCOM 2004.

[14]  Alfredo Cuzzocrea,et al.  Intelligent Techniques for Warehousing and Mining Sensor Network Data , 2009 .

[15]  Alexis Papadimitriou,et al.  Topology control algorithms for wireless sensor networks: a critical survey , 2010, CompSysTech '10.

[16]  Margaret Martonosi,et al.  Proceedings of the 6th ACM conference on Embedded network sensor systems , 2008 .

[17]  Wei Liu,et al.  EasiTPQ: QoS-Based Topology Control in Wireless Sensor Network , 2008, J. Signal Process. Syst..

[18]  Baochun Li,et al.  Distributed topology control in wireless sensor networks with asymmetric links , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[19]  Chien-Chung Shen,et al.  Topology control for ad hoc networks with directional antennas , 2002, Proceedings. Eleventh International Conference on Computer Communications and Networks.

[20]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[21]  Donald F. Towsley,et al.  Mobility improves coverage of sensor networks , 2005, MobiHoc '05.

[22]  Deborah Estrin,et al.  Directed diffusion for wireless sensor networking , 2003, TNET.

[23]  Wendi Heinzelman,et al.  Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

[24]  Hyuk Lim,et al.  J-Sim: a simulation and emulation environment for wireless sensor networks , 2006, IEEE Wireless Communications.

[25]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[26]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

[27]  Kuei-Ping Shih,et al.  On target coverage in wireless heterogeneous sensor networks with multiple sensing units , 2009, J. Netw. Comput. Appl..

[28]  Xiaoming Xu,et al.  A shortest-path-based topology control algorithm in wireless multihop networks , 2007, CCRV.

[29]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

[30]  Sotiris E. Nikoletseas,et al.  Fast Sensory Data Collection by Mobility-Based Topology Exploration , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.

[31]  R. Sokal,et al.  A New Statistical Approach to Geographic Variation Analysis , 1969 .

[32]  Yu-Chee Tseng,et al.  Energy-Efficient Topology Control for Wireless Ad Hoc Sensor Networks , 2004, J. Inf. Sci. Eng..

[33]  Bo Sheng,et al.  Data storage placement in sensor networks , 2006, MobiHoc '06.

[34]  Jianping Pan,et al.  Topology control for wireless sensor networks , 2003, MobiCom '03.

[35]  Xue Zhang,et al.  Topology Control for Wireless Sensor Networks , 2007 .

[36]  U. Brandes.  A faster algorithm for betweenness centrality , 2001 .

[37]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[38]  Xiaohua Jia,et al.  Coverage problems in wireless sensor networks: designs and analysis , 2008, Int. J. Sens. Networks.

[39]  Ulrik Brandes,et al.  On variants of shortest-path betweenness centrality and their generic computation , 2008, Soc. Networks.

[40]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[41]  Godfried T. Toussaint,et al.  The relative neighbourhood graph of a finite planar set , 1980, Pattern Recognit..

[42]  Lui Sha,et al.  Design and analysis of an MST-based topology control algorithm , 2003, IEEE Transactions on Wireless Communications.