Abstract
Interference imposes a major challenge for efficient data communication in wireless networks. Increased level of interference may increase number of collisions, energy consumption and latency due to retransmissions of the interfered data. Interference of a link is the number of nodes interfered while a pair of nodes are communicating over a bi-directional link. Approaches have been proposed to reduce interference by dropping links that create high interference. However, dropping links make a network more susceptible to node failure/departure–a frequent phenomenon in ad hoc networks. Thus dropping high interference links while keeping the network significantly connected is an important goal to achieve. In this paper, we formulate the problem of constructing minimum interference path preserving and fault tolerant wireless ad hoc networks and then provide algorithms, both centralized and distributed with local information, to solve the problem. Moreover, for the first time in literature, we conceive the concept of fault tolerant interference spanner and provide a local algorithm to construct such spanner of a communication graph.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bahramgiri, M., Hajiaghayi, M., Mirrokni, V.S.: Fault-tolerant and 3-dimensional distributed topology control algorithms in wireless multi-hop networks. Wireless Networks 12(2), 179–188 (2006)
Bollo‘as, B.: Random Graphs. Cambridge University Press, Cambridge (2001)
Bose, P., Morin, P., Stojmenovic, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. Wireless Networks 7(6), 609–616 (2001)
Buchin, K.: Minimizing the maximum interference is hard. CoRR, abs/0802.2134 (2008)
Burkhart, M., von Rickenbach, P., Wattenhofer, R., Zollinger, A.: Does topology control reduce interference? In: Proc. of MobiHoc (2004)
Chew, L.P.: There is a planar graph almost as good as the complete graph. In: Proc. of the 2nd Annual Symp. on Comp. Geometry (1986)
Czumaj, A., Zhao, H.: Fault-tolerant geometric spanners. In: Proc. of the 19th Annual Symp. on Comp. Geometry (SCG), pp. 1–10 (2003)
Gao, J., Guibas, L.J., Hershberger, J., Zhang, L., Zhu, A.: Geometric spanner for routing in mobile networks. In: Proc. of MobiHoc (2001)
Karp, B., Kung, H.T.: GPSR: greedy perimeter stateless routing for wireless networks. In: Proc. of MobiCom, pp. 243–254 (2000)
Li, N., Hou, J.C.: Localized fault-tolerant topology control in wireless ad hoc networks. IEEE Trans. Parallel Dist. Syst. 17(4), 307–320 (2006)
Li, X., Calinescu, G., Wan, P., Wang, Y.: Localized delaunay triangulation with application in ad hoc wireless networks. IEEE Trans. Parallel Distrib. Syst. 14(10), 1035–1047 (2003)
Li, X., Moaveninejad, K., Song, W., Wang, W.: Interference-aware topology control for wireless sensor networks. In: Proc. SECON (2005)
Li, X., Wan, P.: Constructing minimum energy mobile wireless networks. In: Proc. of ACM MobiHoc, pp. 55–67 (2001)
Li, X., Wan, P., Wang, Y.: Power efficient and sparse spanner for wireless ad hoc networks. In: Proc. of ICCCN (October 2001)
Li, X., Wan, P., Wang, Y., Yi, C.: Fault tolerant deployment and topology control in wireless ad hoc networks. Wireless Communications and Mobile Computing 4(1), 109–125 (2004)
Moaveninejad, K., Li, X.: Low-interference topology control for wireless ad hoc networks. AHSN 1(1-2) (2005)
Penrose, M.D.: On k-connectivity for a geometric random graph. Random Struct. Algorithms 15(2), 145–164 (1999)
Rodoplu, V., Meng, T.H.: Minimum energy mobile wireless networks. IEEE J. Selected Areas of Communication 17(8), 1333–1344 (1999)
Wattenhofer, R., Li, E.L., Bahl, P., Wang, Y.: Distributed topology control for wireless multihop ad-hoc networks. In: INFOCOM (2001)
Xu, H., Huang, L., Liu, W., Xu, B., Xiao, M.: Topology control for minimal path interference in wireless sensor networks. In: Proc. of the IEEE Symposium on Computers and Communications, ISCC (2008)
Yao, A.C.: On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM J. Comput. 11(4), 721–736 (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Haque, M.E., Rahman, A. (2011). Fault Tolerant Interference-Aware Topology Control for Ad Hoc Wireless Networks. In: Frey, H., Li, X., Ruehrup, S. (eds) Ad-hoc, Mobile, and Wireless Networks. ADHOC-NOW 2011. Lecture Notes in Computer Science, vol 6811. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22450-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-22450-8_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22449-2
Online ISBN: 978-3-642-22450-8
eBook Packages: Computer ScienceComputer Science (R0)