Abstract
Empirical studies on link blacklisting show that the delivery rate is sensitive to the calibration of the blacklisting threshold. If the calibration is too restrictive (the threshold is too high), all neighbors get blacklisted. On the other hand, if the calibration is too loose (the threshold is too low), unreliable links get selected. This paper investigates blacklisting analytically. We derive a model that accounts for the joint effect of the wireless channel (signal strength variance and coherence time) and the network (node density). The model, validated empirically with mote-class hardware, shows that blacklisting does not help if the wireless channel is stable or if the network is relatively sparse. In fact, blacklisting is most beneficial when the network is relatively dense and the channel is unstable with long coherence times.
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.
References
Karp, B., Kung, H.: Gpsr: greedy perimeter stateless routing for wireless networks. In: ACM Mobicom (2000)
Couto, D.D., Aguayo, D., Bicket, J., Morris, R.: A high-throughput path metric for multi-hop wireless routing. In: ACM Mobicom (2003)
Haenggi, M., Puccinelli, D.: Routing in ad hoc networks: a case for long hops. IEEE Communications Magazine 43(10), 93–101 (2005)
Nardelli, P.H.J., de Abreu, G.T.F.: On Hopping Strategies for Autonomous Wireless Networks. In: IEEE GLOBECOM (2009)
Weber, S., Jindal, N., Ganti, R.K., Haenggi, M.: Longest edge routing on the spatial Aloha graph. In: IEEE Global Telecommunications Conference, pp. 1–5 (2008)
Woo, A., Tong, T., Culler, D.: Taming the underlying challenges of reliable multihop routing in sensor networks. In: ACM SenSys (2003)
Gnawali, O., Yarvis, M., Heidemann, J., Govindan, R.: Interaction of retransmission, blacklisting, and routing metrics for reliability in sensor network routing. In: IEEE SECON (2004)
Liu, T., Kamthe, A., Jiang, L., Cerpa, A.: Performance Evaluation of Link Quality Estimation Metrics for Static Multihop Wireless Sensor Networks. In: IEEE SECON (2009)
Zuniga, M., Seada, K., Krishnamachari, B., Helmy, A.: Efficient geographic routing over lossy links in wireless sensor networks. ACM TOSN, 12:1–12:33 (June 2008)
Srinivasan, K., Levis, P.: Rssi is under appreciated. In: Proceedings of the Third Workshop on Embedded Networked Sensors, EmNets (2006)
Hackmann, G., Chipara, O., Lu, C.: Robust topology control for indoor wireless sensor networks. In: Proceedings of the 6th ACM Conference on Embedded Network Sensor Systems, SenSys 2008 (2008)
Bettstetter, C., Hartmann, C.: Connectivity of wireless multihop networks in a shadow fading environment. Wirel. Netw. 11, 571–579 (2005)
Zuniga, M., Irzynska, I., Hauer, J., Voigt, T., Boano, C., Roemer, K.: Link quality ranking: Getting the best out of unreliable links. In: IEEE DCOSS (2011)
Sikora, M., Laneman, J., Haenggi, M., Costello, D., Fuja, T.: Bandwidth- and power-efficient routing in linear wireless networks. IEEE Transactions on Information Theory 52(6), 2624–2633 (2006)
Stamatiou, K., Rossetto, F., Haenggi, M., Javidi, T., Zeidler, J., Zorzi, M.: A delay-minimizing routing strategy for wireless multi-hop networks. In: WiOpt (2009)
Weber, S., Yang, X., Andrews, J.G., de Veciana, G.: Transmission capacity of wireless ad hoc networks with outage constraints. IEEE Transactions on Information Theory 51(12), 4091–4102 (2005)
Gnawali, O., Fonseca, R., Jamieson, K., Moss, D., Levis, P.: Collection Tree Protocol. In: ACM SenSys (2009)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fabbri, F., Zuniga, M., Puccinelli, D., Marrón, P. (2012). On the Optimal Blacklisting Threshold for Link Selection in Wireless Sensor Networks. In: Picco, G.P., Heinzelman, W. (eds) Wireless Sensor Networks. EWSN 2012. Lecture Notes in Computer Science, vol 7158. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28169-3_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-28169-3_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28168-6
Online ISBN: 978-3-642-28169-3
eBook Packages: Computer ScienceComputer Science (R0)