DocumentCode :
1948187
Title :
Protecting network coded packets in coalition networks
Author :
Oh, Soon Y. ; Gerla, Mario
Author_Institution :
Comput. Sci. Dept., Univ. of California, Los Angeles, CA, USA
fYear :
2010
fDate :
3-5 Feb. 2010
Firstpage :
168
Lastpage :
175
Abstract :
Network coding was found to be useful for ad hoc wireless multicast in disruptive channel and connectivity conditions. In heterogeneous networks, comprising teams with different technical preparedness, it is possible that only the radios of the most advanced teams have sufficient resources to network encode/decode. In this case, an interesting solution is partial (hybrid) network coding - only a fraction of the nodes encodes, the balance simply forwarding the packets. Partial coding poses interesting problems and opportunities that require novel solutions. The first contribution of this paper is the control of redundant transmissions. Network coding detects duplicates using the ?innovative packet? check; it drops non-innovative packets. Likewise, we require a new duplicate detection scheme for non-network coding (non-NC) nodes using encoding vectors since packet ID may be obliterated during packet mixing. The second contribution is the study of performance loss caused by partial coding. Through the analysis of representative topologies and scenarios, we identify densities and distributions (of non-coding nodes) that render network coding inefficient. The results are of practical importance because they help determine when one should switch from network coding to other forms of protection (e.g., erasure codes or fountain codes). The third contribution is in the protection from malicious packet corruption, i.e., pollution. There is the risk that nodes belonging to an untrusted team (a likely situation in tactical coalitions) can inject polluted packets into the network. Pollution is critical in network coding. If it goes unchecked, pollution makes it easy for an attacker to spoil an entire generation. An opportunity offered by hybrid network coding is to force the untrusted nodes to perform simple forwarding, without coding. We show that their behavior can be more easily and efficiently checked (with hash signatures instead of homomorphic hashes) while still profiting- from their forwarding.
Keywords :
ad hoc networks; channel capacity; channel coding; multicast communication; telecommunication security; ad hoc wireless multicast; coalition networks; disruptive channel; duplicate detection scheme; heterogeneous networks; innovative packet check; network coded packet protection; nonnetwork coding nodes; packet mixing; Computer science; Decoding; Encoding; Network coding; Performance loss; Pollution; Protection; Streaming media; Switches; Vectors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Wireless On-demand Network Systems and Services (WONS), 2010 Seventh International Conference on
Conference_Location :
Kranjska Gora
Print_ISBN :
978-1-4244-6059-5
Type :
conf
DOI :
10.1109/WONS.2010.5437114
Filename :
5437114
Link To Document :
بازگشت