Abstract
Interference is one of the main challenges in designing energy efficient protocols for wireless sensor networks. Decreasing interference can reduce energy consumptions of nodes and prolong the lifetime of the network. Combining graph matching and the protocol interference model, in this paper, we propose a Matching Based Interference-Aware Dominating Set Construction Algorithm (MBIDSC), in which we consider a connected dominating set as a virtual backbone. The upper bounds of message complexity of the algorithm is \(O(nr{\varDelta} )\) and the time complexity is \(O(r{\varDelta} )\). Where n is the total number of nodes, \({\varDelta}\) is the maximum degree of the network, r is the round of the algorithm, and d is the diameter of the network. We show the correctness of the algorithms and complexity of time and message by theoretical analysis. To the best of our knowledge, the proposed algorithm is the first results for the protocol interference model based on graph matching.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ni, S.Y., Tseng, Y.C., Chen, Y.S., Sheu, J.P.: The broadcast storm problem in a mobile ad hoc network. In: Proc. 5th ACM/IEEE International Conf. Mobile Computing Networking (MobiCom), pp. 151–162 (1999)
Cheng, X., Ding, M., Du, D.H., Jia, X.: Virtual backbone construc-tion in multihop ad hoc wireless networks: research articles. Wireless Communications and Mobile Computing 6(2), 183–190 (2006)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco (1979)
Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Mathematics 86(1-3), 165–177 (1990)
Alzoubi, K.M., Wan, P.J., Frieder, O.: Message-Optimal Connected Dominating Sets in Mobile Ad Hoc Networks. In: ACM Mobihoc, pp. 157–164 (2002)
Wan, P.J., Alzoubi, K.M., Frieder, O.: Distributed Construction of Connected Dominating Set in Wireless Networks. In: Proceedings of IEEE Conference on Computer Communications (INFOCOM), pp. 141–149 (2002)
Yu, J., Wang, N., Wang, G.: Heuristic Algorithms for Constructing Connected Dominating Sets with Minimum Size and Bounded Diameter in Wireless Networks. In: Pandurangan, G., Anil Kumar, V.S., Ming, G., Liu, Y., Li, Y. (eds.) WASA 2010. LNCS, vol. 6221, pp. 11–20. Springer, Heidelberg (2010)
Schmid, S., Wattenhofer, R.: Algorithmic models for sensor networks. In: Proc. of the 14th International Workshop on Parallel and Distributed Real-Time Systems, p. 11 (2006)
Cheng, X., Huang, X., Li, D., Wu, W., Du, D.: A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks. Networks 42(4), 202–208 (2003)
Wang, N., Yu, J., Qi, Y.: Nodes Neighborhood Relation-based Construction Algorithm for Minimum Connected Domination Set. Computer Engineering 36(13), 105–107 (2010)
Dubhashi, D., Mei, A., Panconesi, A., Radhakrishnan, J., Srinivasan, A.: Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. J. Computer System Sciences 71(4), 467–479 (2005)
Ambühl, C., Erlebach, T., Mihalák, M., Nunkesser, M.: Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs. In: DÃaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX and RANDOM 2006. LNCS, vol. 4110, pp. 3–14. Springer, Heidelberg (2006)
Huang, Y., Gao, X., Zhang, Z., Wu, W.: A better constant-factor approximation for weighted dominating set in unit disk graph. Journal of Combinatorial Optimization 18(2), 179–194 (2008)
Zou, F., Wang, Y., Xu, X., Li, X., Du, H., Wan, P., Wu, W.: New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs. Theoretical Computer Science 412(3), 198–208 (2009)
Du, H., Ye, Q., Wu, W., Lee, W., Li, D., Du, D., Howard, S.: Constant approximation for virtual backbone construction with Guaranteed Routing Cost in wireless sensor networks. In: Proc. of INFOCOM, pp. 1737–1744 (2011)
Yu, J.G., Wang, N., Wang, G.: Constructing minimum extended weakly-connected dominating sets for clustering in ad hoc networks. Journal of Parallel Distributed Computing 72(1), 35–47 (2012)
Scheideler, C., Richa, A., Santi, P.: An O(logn) Dominating Set Protocol for Wireless Ad-Hoc Networks under the Physical Interference Model. In: Proceedings of the 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 91–100 (2008)
Gupta, P., Kumar, P.R.: The Capacity of Wireless Networks. IEEE Transactions on Information Theory 42(2), 388–404 (2000)
Huang, S.C.H., Sun, M.T., Liang, Q.L., Wan, P., Jia, X.: Interference-Aware, Fully-Distributed Virtual Backbone Construction and its Application in Multi-Hop Wireless Networks. IEEE Transactions on communications 58(12), 3550–3560 (2010)
West, D.: Introduction to Graph Theory, 2nd edn., pp. 107–109. Prentice Hall (2001)
Bunke, H.: Graph Matching: Theoretical Foundations. Algorithms, and Applications. In: Proc. VI 2003, pp. 82–88 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yan, G., Yu, J., Chen, C., Jia, L. (2014). Virtual Backbone Construction Algorithms Based on Protocol Interference Model. In: Sun, L., Ma, H., Hong, F. (eds) Advances in Wireless Sensor Networks. CWSN 2013. Communications in Computer and Information Science, vol 418. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54522-1_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-54522-1_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-54521-4
Online ISBN: 978-3-642-54522-1
eBook Packages: Computer ScienceComputer Science (R0)
