Covert channels in ad-hoc wireless networks

A covert channel is a concealed communication path embedded in an overt one. Existence of covert channels violates both secrecy and integrity properties of trusted systems. While past covert analysis has been mainly focused on wired networks, the wireless communication environment involves fundamentally different properties that make it vulnerable to covert attacks. In particular, nodes in ad-hoc wireless networks have to cooperate with each other in order to accomplish many networking functions as routing and channel access. We observe that covert information can be conveyed during the cooperation procedure. This paper investigates ad-hoc wireless networks' susceptibility to covert channels that can be formed through manipulating the network protocols. It is very difficult to eliminate or even detect these covert channels. Simulation results show that performance of these covert channels depends on various network characteristics. Countermeasures against the covert channel are needed and also should adapt to the network changes to take full effect.

[1]  C. Gray Girling,et al.  Covert Channels in LAN's , 1987, IEEE Transactions on Software Engineering.

[2]  Norman M. Abramson,et al.  Packet switching with satellites , 1973, AFIPS National Computer Conference.

[3]  Anthony Ephremides,et al.  Energy-efficient collision resolution in wireless ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[4]  Rachel Greenstadt,et al.  Covert Messaging through TCP Timestamps , 2002, Privacy Enhancing Technologies.

[5]  Xiaoyan Hong,et al.  ANODR: anonymous on demand routing with untraceable routes for mobile ad-hoc networks , 2003, MobiHoc '03.

[6]  Arnie Kwong,et al.  Fall Joint Computer Conference , 1987, Data Base.

[7]  P. Karn,et al.  MACA-a New Channel Access Method for Packet Radio , 1990 .

[8]  Charles E. Perkins,et al.  Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers , 1994, SIGCOMM.

[9]  Augustus J. E. M. Janssen,et al.  Analysis of contention tree algorithms , 2000, IEEE Trans. Inf. Theory.

[10]  Yih-Chun Hu,et al.  Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks , 2002, MobiCom '02.

[11]  Martin Vetterli,et al.  Communication using phantoms: covert channels in the Internet , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[12]  Norman M. Abramson,et al.  THE ALOHA SYSTEM: another alternative for computer communications , 1899, AFIPS '70 (Fall).

[13]  M. S. Corson,et al.  A highly adaptive distributed routing algorithm for mobile wireless networks , 1997, Proceedings of INFOCOM '97.

[14]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[15]  J.-P. Hubaux,et al.  Enforcing service availability in mobile ad-hoc WANs , 2000, 2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing. MobiHOC (Cat. No.00EX444).

[16]  Craig H. Rowland,et al.  Covert Channels in the TCP/IP Protocol Suite , 1997, First Monday.

[17]  Deepa Kundur,et al.  Practical Data Hiding in TCP/IP , 2002 .

[18]  Manel Guerrero Zapata.  Secure Ad hoc On-Demand Distance Vector (SAODV) Routing , 2006 .

[19]  Charles E. Perkins,et al.  Performance comparison of two on-demand routing protocols for ad hoc networks , 2001, IEEE Wirel. Commun..

[20]  L. Kleinrock,et al.  Packet Switching in Radio Channels: Part I - Carrier Sense Multiple-Access Modes and Their Throughput-Delay Characteristics , 1975, IEEE Transactions on Communications.

[21]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[22]  Theodore G. Handel,et al.  Hiding Data in the OSI Network Model , 1996, Information Hiding.

[23]  Anthony Ephremides,et al.  Covert Information Transmission through the Use of Standard Collision Resolution Algorithms , 1999, Information Hiding.

[24]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[25]  Anthony Ephremides,et al.  A distributed routing algorithm for mobile wireless networks , 1995, Wirel. Networks.

[26]  John Ippocratis Capetanakis.  The multiple access broadcast channel : protocol and capacity considerations. , 1977 .

[27]  Virgil D. Gligor,et al.  A guide to understanding covert channel analysis of trusted systems , 1993 .

[28]  Panagiotis Papadimitratos,et al.  Secure Routing for Mobile Ad Hoc Networks , 2002 .

[29]  Butler W. Lampson,et al.  A note on the confinement problem , 1973, CACM.

[30]  Anthony Ephremides,et al.  A distributed routing algorithm for mobile radio networks , 1989, IEEE Military Communications Conference, 'Bridging the Gap. Interoperability, Survivability, Security'.