The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - October-December (2009 vol.6)
pp: 295-308
Bogdan Carbunar , Purdue University
Cristina Nita-Rotaru , Purdue University
ABSTRACT
Hybrid networks consisting of cellular and Wi-Fi networks were proposed as a high-throughput architecture for cellular services. In such networks, devices equipped with cellular and Wi-Fi network cards access Internet services through the cellular base station. The Wi-Fi interface is used to provide a better service to clients that are far away from the base station, via multihop ad hoc paths. The modified trust model of hybrid networks generates a set of new security challenges as clients rely on intermediate nodes to participate effectively in the resource reservation process and data forwarding. In this paper, we introduce JANUS, a framework for scalable, secure, and efficient routing for hybrid cellular and Wi-Fi networks. JANUS uses a scalable routing algorithm with multiple channel access, for improved network throughput. In addition, it provides protection against selfish nodes through a secure crediting protocol and protection against malicious nodes through secure route establishment and data forwarding mechanisms. We evaluate JANUS experimentally and show that its performance is 85 percent of the optimum algorithm, improving with a factor greater than 50 percent over previous work. We evaluate the security overhead of JANUS against two types of attacks: less aggressive, but sufficient for some applications, selfish attacks and purely malicious attacks.
INDEX TERMS
Security and protection, wireless communication, routing protocols.
CITATION
Bogdan Carbunar, Ioannis Ioannidis, Cristina Nita-Rotaru, "JANUS: A Framework for Scalable and Secure Routing in Hybrid Wireless Networks", IEEE Transactions on Dependable and Secure Computing, vol.6, no. 4, pp. 295-308, October-December 2009, doi:10.1109/TDSC.2008.14
REFERENCES
[1] H. Luo, R. Ramjee, P. Sinha, L.E. Li, and S. Lu, “UCAN: A Unified Cellular and Ad-Hoc Network Architecture,” Proc. ACM MobiCom '03, pp. 353-367, 2003.
[2] IEEE Std 802.11a-1999, http:/standards.ieee.org/, 2008.
[3] IEEE Std 802.11b-1999, http:/standards.ieee.org/, 2008.
[4] IEEE Std 802.11g-2003, http:/standards.ieee.org/, 2003.
[5] C. Perkins and E. Royer, “Ad-Hoc On-Demand Distance Vector Routing,” Proc. Second IEEE Workshop Mobile Computing Systems and Applications, 1997.
[6] C.E. Perkins and P. Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers,” Proc. ACM SIGCOMM '94, pp. 234-244, 1994.
[7] B.R. Bellur and R.G. Ogier, “A Reliable, Efficient Topology Broadcast Protocol for Dynamic Networks,” Proc. IEEE INFOCOM '99, pp. 178-186, 1999.
[8] P. Jacquet, P. Mhlethaler, T. Clausen, A. Laouiti, A. Qayyum, and L. Viennot, “Optimized Link State Routing Protocol,” Proc. IEEE Int'l Multitopic Conf. (INMIC '01), pp. 62-68, Dec. 2001.
[9] J. So and N. Vaidya, “Multi-Channel MAC for Ad Hoc Networks: Handling Multi-Channel Hidden Terminals Using a Single Transceiver,” Proc. ACM MobiHoc, 2004.
[10] M. Burkhart, P. von Rickenbach, R. Wattenhofer, and A. Zollinger, “Does Topology Control Reduce Interference?” Proc. ACM MobiHoc '04, pp. 9-19, 2004.
[11] M. Raya and J.-P. Hubaux, “The Security of Vehicular Ad Hoc Networks,” Proc. Third ACM Workshop Security of Ad Hoc and Sensor Networks (SASN), 2005.
[12] D.L. Chaum, “Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms,” Commun. ACM, vol. 24, no. 2, pp. 84-90, 1981.
[13] G.N. Frederickson, “Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and $k$ Smallest Spanning Trees,” SIAM J. Computing, vol. 26, no. 2, pp. 484-538, 1997.
[14] Advanced Encryption Standard (AES). Nat'l Inst. for Standards and Technology (NIST), No. FIPS 197, http://csrc.nist.gov/encryptionaes/, 2001.
[15] Y.-C. Hu, A. Perrig, and D.B. Johnson, “Packet Leashes: A Defense Against Wormhole Attacks in Wireless Ad Hoc Networks,” Proc. IEEE INFOCOM '03, Apr. 2003.
[16] H.E. Bal, R. Bhoedjang, R. Hofman, C. Jacobs, K. Langendoen, T. Ruhl, and M.F. Kaashoek, “Performance Evaluation of the Orca Shared-Object System,” ACM Trans. Computer Systems, vol. 16, no. 1, pp. 1-40, 1998.
[17] N.B. Salem, L. Buttyan, J.-P. Hubaux, and M. Jakobsson, “Node Cooperation in Hybrid Ad Hoc Networks,” IEEE Trans. Mobile Computing, vol. 5, no. 4, pp. 365-376, 2006.
[18] B. Awerbuch, D. Holmer, C. Nita-Rotaru, and H. Rubens, “An On-Demand Secure Routing Protocol Resilient to Byzantine Failures,” Proc. ACM Workshop Wireless Security (WiSe '02), Sept. 2002.
[19] D.S.J. De Couto, D. Aguayo, J. Bicket, and R. Morris, “A High-Throughput Path Metric for Multi-Hop Wireless Routing,” Proc. ACM MobiCom '03, pp. 134-146, 2003.
[20] L. Lamport, R. Shostak, and M. Pease, “The Byzantine Generals Problem,” ACM Trans. Programming Languages and Systems, vol. 4, no. 3, 1982.
[21] A. Kamerman and L. Monteban, “Wavelan-II: A High Performance Wireless LAN for the Unlicensed Band,” Bell Labs Technical J., 1997.
[22] D.B. Johnson and D.A. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks,” Mobile Computing, vol. 353, 1996.
[23] J. Yoon, M. Liu, and B.D. Noble, “Random Waypoint Considered Harmful,” Proc. IEEE INFOCOM '03, Apr. 2003.
[24] OpenSSL: The Open Source Toolkit for SSL/TLS, http:/www.openssl.org/, 2008.
[25] J. Broch, D.A. Maltz, D.B. Johnson, Y.-C. Hu, and J. Jetcheva, “A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols,” Proc. ACM MobiCom '98, pp. 85-97, 1998.
[26] C.E. Perkins and E.M. Royer, “Ad Hoc On-Demand Distance Vector Routing,” Ad Hoc Networking, Addison-Wesley, 2000.
[27] G. Aggelou and R. Tafazolli, “On the Relaying Capability of Next-Generation GSM Cellular Networks,” IEEE Personal Comm., vol. 8, no. 1, pp. 40-47, Feb. 2001.
[28] T. Rouse, I. Band, and S. McLaughlin, “Capacity and Power Investigation of Opportunity Driven Multiple Access (ODMA) Networks in TDD-CDMA Based Systems,” IEEE Int'l Conf. Comm. (ICC '02), vol. 5, pp. 3202-3206, 2002.
[29] X. Wu, S.-H. Chan, and B. Mukherjee, “MADF: A Novel Approach to Add an Ad-Hoc Overlay on a Fixed Cellular Infrastructure,” Proc. IEEE Wireless Comm. and Networking Conf. (WCNC), 2000.
[30] I. Akyildiz and W. Yen, “A New Hierarchical Routing Protocol for Dynamic Multihop Wireless Networks,” Proc. IEEE INFOCOM, 1997.
[31] H.-Y. Hsieh and R. Sivakumar, “On Using the Ad-Hoc Network Model in Wireless Packet Data Networks,” Proc. ACM MobiHoc, 2002.
[32] Y.-D. Lin and Y.-C. Hsu, “Multihop Cellular: A New Architecture for Wireless Communications,” Proc. IEEE INFOCOM, 2000.
[33] S. De, O. Tonguz, H. Wu, and C. Qiao, “Integrated Cellular and Ad Hoc Relay (ICAR) Systems: Pushing the Performance Limits of Conventional Wireless Networks,” Proc. Hawaii Int'l Conf. System Sciences (HICSS-37), 2002.
[34] S. Lee, S. Banerjee, and B. Bhattacharjee, “The Case for a Multi-Hop Wireless Local Area Network,” Proc. IEEE INFOCOM, 2004.
[35] M. Miller, W. List, and N. Vaidya, “A Hybrid Network Implementation to Extend Infrastructure Reach,” technical report, Univ. of Illinois, Urbana-Champaign, Jan. 2003.
[36] T. Fujiwara, N. Iida, and T. Watanabe, “An Ad Hoc Routing Protocol in Hybrid Wireless Networks for Emergency Communications,” Proc. IEEE Int'l Conf. Distributed Computing Systems (ICDCS '04), Int'l Workshop Wireless Ad Hoc Networking (WWAN'04), pp. 748-754, Mar. 2004.
[37] N.B. Salem, L. Buttyan, J.-P. Hubaux, and M. Jakobsson, “A Charging and Rewarding Scheme for Packet Forwarding in Multi-Hop Cellular Networks,” Proc. ACM MobiHoc, 2003.
[38] S. Capkun, J.P. Hubaux, and M. Jakobsson, “Secure and Privacy-Preserving Communication in Hybrid Ad Hoc Networks,” Technical Report IC/2004/10, EPFL-IC, Jan. 2004.
[39] P. Kyasanur and N. Vaidya, “Detection and Handling of MAC Layer Misbehavior in Wireless Networks,” Proc. Int'l Conf. Dependable Systems and Networks (DSN), 2003.
[40] P. Papadimitratos and Z. Haas, “Secure Routing for Mobile Ad Hoc Networks,” Proc. SCS Comm. Networks and Distributed Systems Modeling and Simulation Conf. (CNDS '02), pp. 27-31, Jan. 2002.
[41] Y.-C. Hu, D.B. Johnson, and A. Perrig, “SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Networks,” Proc. Fourth IEEE Workshop Mobile Computing Systems and Applications (WMCSA '02), June 2002.
[42] Y.-C. Hu, A. Perrig, and D.B. Johnson, “Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks,” Proc. ACM MobiCom '02, Sept. 2002.
[43] K. Sanzgiri, B. Dahill, B.N. Levine, C. Shields, and E. Belding-Royer, “A Secure Routing Protocol for Ad Hoc Networks,” Proc. 10th IEEE Int'l Conf. Network Protocols (ICNP'02), Nov. 2002.
[44] L. Hu and D. Evans, “Using Directional Antennas to Prevent Wormhole Attacks,” Proc. Network and Distributed System Security Symp. (NDSS), 2004.
[45] Y.-C. Hu, A. Perrig, and D.B. Johnson, “Rushing Attacks and Defense in Wireless Ad Hoc Network Routing Protocols,” Proc. ACM Workshop Wireless Security (WiSe), 2003.
[46] S. Marti, T. Giuli, K. Lai, and M. Baker, “Mitigating Routing Misbehavior in Mobile Ad Hoc Networks,” Proc. ACM MobiCom '00, Aug. 2000.
[47] P. Papadimitratos and Z. Haas, “Secure Data Transmission in Mobile Ad Hoc Networks,” Proc. Second ACM Workshop Wireless Security (WiSe), 2003.
[48] C.E. Perkins and P. Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers,” Proc. ACM SIGCOMM, 1994.
[49] D.B. Johnson, D.A. Maltz, and J. Broch, “DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks,” Ad Hoc Networking, pp. 139-172, Addison-Wesley, 2001.
[50] M. Jakobsson, S. Wetzel, and B. Yener, “Stealth Attacks on Ad Hoc Wireless Networks,” Proc. Vehicular Technology Conf. (VTC), 2003.
[51] E. Barkan, E. Biham, and N. Keller, “Instant Ciphertext-Only Cryptanalysis of GSM Encrypted Communication,” Proc. 23rd Ann. Int'l Cryptology Conf. (CRYPTO '03), pp. 600-616, 2003.
[52] GPRS Security Threats and Solutions, white paper, NetScreen Tech nologies, Mar. 2002.
[53] V. Niemi and K. Nyberg, UMTS Security. Wiley, Dec. 2003.
5 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool