A Survey: Topology Control For Wireless Sensor Networks

Wireless sensor network is a densely deployed resource stress network where each small chunk of resource adds the high value to over all network functionality. Topology control is a technique through which network controls it's dense deployment for efficient resource utilization. This article examines the classification of topology control of emerging wireless sensor network field, based on different Network models, graph models and node groupings. Further article covers the effect of mobility on topology control and various topology control measurement parameters. This article will aid in defining appropriate topology control mechanism, allowing network designers to choose the protocol architecture that best matches the goals of their application. In addition, this article will enable new sensor network topology control method to be defined for use in further research in this area.

[1]  H. Kawahigashi,et al.  Modeling ad hoc sensor networks using random graph theory , 2005, Second IEEE Consumer Communications and Networking Conference, 2005. CCNC. 2005.

[2]  Xiang-Yang Li,et al.  Constructing minimum energy mobile wireless networks , 2001, MOCO.

[3]  He Yanxiang,et al.  Interference-Aware Topology Control Problem in Wireless Sensor Networks , 2006, 2006 6th International Conference on ITS Telecommunications.

[4]  Massimo Franceschetti,et al.  On the throughput scaling of wireless relay networks , 2006, IEEE Transactions on Information Theory.

[5]  Andreas Willig,et al.  Protocols and Architectures for Wireless Sensor Networks , 2005 .

[6]  Deborah Estrin,et al.  Distributed techniques for area computation in sensor networks [wireless networks] , 2004, 29th Annual IEEE International Conference on Local Computer Networks.

[7]  Paolo Santi.  Topology control in wireless ad hoc and sensor networks , 2005 .

[8]  Samir Khuller,et al.  A clustering scheme for hierarchical control in multi-hop wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

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

[10]  Kenneth J. Supowit,et al.  The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees , 1983, JACM.

[11]  Weili Wu,et al.  Minimum connected dominating sets and maximal independent sets in unit disk graphs , 2006, Theor. Comput. Sci..

[12]  Lui Sha,et al.  Dynamic Clustering for Acoustic Target Tracking in Wireless Sensor Networks , 2004, IEEE Trans. Mob. Comput..

[13]  David G. Kirkpatrick,et al.  Unit disk graph recognition is NP-hard , 1998, Comput. Geom..

[14]  Charles J. Colbourn,et al.  Unit disk graphs , 1991, Discret. Math..

[15]  Yeh-Ching Chung,et al.  A Delaunay Triangulation based method for wireless sensor network deployment , 2007, Comput. Commun..

[16]  Fred S. Annexstein,et al.  Dominating connectivity and reliability of heterogeneous sensor networks , 2006, Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06).

[17]  D. Matula,et al.  Properties of Gabriel Graphs Relevant to Geographic Variation Research and the Clustering of Points in the Plane , 2010 .

[18]  Xiaohua Jia,et al.  Energy efficient distributed connected dominating sets construction in wireless sensor networks , 2006, IWCMC '06.

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

[20]  Gene Tsudik,et al.  Exploring mesh and tree-based multicast. Routing protocols for MANETs , 2006, IEEE Transactions on Mobile Computing.

[21]  Peng-Jun Wan,et al.  Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks , 2004, Mob. Networks Appl..

[22]  Massimo Franceschetti,et al.  Critical node lifetimes in random networks via the chen-stein method , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[23]  Teresa H. Meng,et al.  Minimum energy mobile wireless networks , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[24]  P.M. Ameer,et al.  Analysis of Network Architectures for Zigbee Sensor Clusters , 2006, Networks 2006. 12th International Telecommunications Network Strategy and Planning Symposium.

[25]  Deborah Estrin,et al.  Geography-informed energy conservation for Ad Hoc routing , 2001, MobiCom '01.

[26]  Qian Zhang,et al.  Localized Low-Power Topology Control Algorithms in IEEE 802.15.4-Based Sensor Networks , 2005, 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05).

[27]  Andrew Chi-Chih Yao,et al.  On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems , 1977, SIAM J. Comput..

[28]  Ossama Younis,et al.  HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks , 2004, IEEE Transactions on Mobile Computing.

[29]  Roger Wattenhofer,et al.  Unit disk graph approximation , 2004, DIALM-POMC '04.

[30]  Antonio Alfredo Ferreira Loureiro,et al.  Scheduling nodes in wireless sensor networks: a Voronoi approach , 2003, 28th Annual IEEE International Conference on Local Computer Networks, 2003. LCN '03. Proceedings..

[31]  Yuguang Fang,et al.  Detecting Coverage Boundary Nodes in Wireless Sensor Networks , 2006, 2006 IEEE International Conference on Networking, Sensing and Control.

[32]  Robert Tappan Morris,et al.  Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks , 2002, Wirel. Networks.

[33]  Stefan Schmid,et al.  Algorithmic models for sensor networks , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.