A Metric for Adaptive Routing on Trustworthy Paths

详细信息    查看全文

• 关键词：Adaptive routing ; Attacker model ; Trustworthiness ; Local trust rating
• 刊名：Lecture Notes in Computer Science
• 出版年：2016
• 出版时间：2016
• 年：2016
• 卷：9591
• 期：1
• 页码：11-25
• 全文大小：592 KB
• 参考文献：1.Baumann, R., Heimlicher, S., Strasser, M., Weibel, A.: A Survey on Routing Metrics. TIK report 262 (2007)
  2.Buchegger, S., Le Boudec, J.-Y.: Performance analysis of the CONFIDANT protocol. In: Proceedings of the 3rd ACM International Symposium on Mobile A Hoc Networking & Computing, pp. 226–236. ACM (2002)
  3.Chiu, G.-M.: The odd-even turn model for adaptive routing. IEEE Trans. Parallel Distrib. Syst. 11(7), 729–738 (2000)CrossRef
  4.Dally, W.J., Towles, B.P.: Principles and Practices of Interconnection Networks. Elsevier, San Mateo (2004)
  5.De Couto, D.S., Aguayo, D., Bicket, J., Morris, R.: A high-throughput path metric for multi-hop wireless routing. Wireless Netw. 11(4), 419–434 (2005)CrossRef
  6.Dong, J., Curtmola, R., Nita-Rotaru, C.: On the pitfalls of high-throughput multicast metrics in adversarial wireless mesh networks. In: Proceedings of the IEEE SECON, pp. 224–232 (2008)
  7.Duquennoy, S., Landsiedel, O., Voigt, T.: Let the tree bloom: scalable opportunistic routing with ORPL. In: Proceedings of the 11th ACM Conference on Embedded Networked Sensor Systems (SenSys) (2013)
  8.Fettweis, G., Nagel, W.E., Lehner, W.: Pathways to servers of the future. In: Proceedings of the DATE (2012)
  9.Galuba, W., Papadimitratos, P., Poturalski, M., Aberer, K., Despotovic, Z., Kellerer, W.: Castor: scalable secure routing for ad hoc networks. In: Proceedings of the IEEE INFOCOMM 2010 (2010)
  10.Gnawali, O., Fonseca, R., Jamieson, K., Moss, D., Levis, P.: Collection tree protocol. In: Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems (SenSys) (2009)
  11.Karlof, C., Wagner, D.: Secure routing in wireless sensor networks: attacks and countermeasures. Ad hoc Netw. 1(2), 293–315 (2003)CrossRef
  12.Landsiedel, O., Ghadimi, E., Duquennoy, S., Johansson, M., Power, L., Delay, L.: Opportunistic routing meets duty cycling. In: Proceedings of the Conference on Information Processing in Sensor Networks (ACM/IEEE IPSN) (2012)
  13.Marti, S., Giuli, T.J., Lai, K., Baker, M.: Mitigating routing misbehavior in mobile ad hoc networks. In: Proceedings of the 6th Annual International Conference on Mobile Computing and Networking, pp. 255–265. ACM (2000)
  14.Michiardi, P., Molva, R.: CORE: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks. In: Jerman-Blažič, B., Klobučar, T. (eds.) Advanced Communications and Multimedia Security. IFIP, vol. 100, pp. 107–121. Springer, Heidelberg (2002)CrossRef
  15.Papadimitratos, P., Haas, Z.J.: Secure data communication in mobile ad hoc networks. IEEE JSAG 24(2), 343–356 (2006)
  16.Rezgui, A., Eltoweissy, M.: TARP: a trust-aware routing protocol for sensor-actuator networks. In: Proceedings of the IEEE International Conference on Mobile Adhoc and Sensor Systems, pp. 1–9. IEEE (2007)
  17.SimPy. simpy.​readthedocs.​org
  
• 作者单位：Christoph Hofmann (15)
  Elke Franz (15)
  Silvia Santini (16)
  
  15. Chair of Privacy and Data Security, Technische Universität Dresden, 01062, Dresden, Germany
  16. Chair of Embedded Systems, Technische Universität Dresden, 01062, Dresden, Germany
  
• 丛书名：Open Problems in Network Security
• ISBN：978-3-319-39028-4
• 刊物类别：Computer Science
• 刊物主题：Artificial Intelligence and Robotics
  Computer Communication Networks
  Software Engineering
  Data Encryption
  Database Management
  Computation by Abstract Devices
  Algorithm Analysis and Problem Complexity
  
• 出版者：Springer Berlin / Heidelberg
• ISSN：1611-3349
• 卷排序：9591

文摘

Any data transmission over multiple hops requires the use of routing algorithms to find a path from the sender to the receiver(s). Supporting secure data transmissions further requires the selected path to be trustworthy, i.e., not under the control of an attacker. Since attacks can occur at any time during data transmission, the current state of the network must be considered when selecting trustworthy paths. In this paper, we introduce a novel metric – called Locally Evaluated Trust (LET) – for local trust evaluation. The LET metric can be used by adaptive routing algorithms to select a trustworthy path. To evaluate our approach, we simulate different routing algorithms and compare their performance in the presence of one or more malicious nodes in a two-dimensional torus mesh. Our results show that the LET metric allows adaptive routing algorithms to effectively identify and circumvent malicious nodes.