8,716 research outputs found
A New Approach to Coding in Content Based MANETs
In content-based mobile ad hoc networks (CB-MANETs), random linear network
coding (NC) can be used to reliably disseminate large files under intermittent
connectivity. Conventional NC involves random unrestricted coding at
intermediate nodes. This however is vulnerable to pollution attacks. To avoid
attacks, a brute force approach is to restrict the mixing at the source.
However, source restricted NC generally reduces the robustness of the code in
the face of errors, losses and mobility induced intermittence. CB-MANETs
introduce a new option. Caching is common in CB MANETs and a fully reassembled
cached file can be viewed as a new source. Thus, NC packets can be mixed at all
sources (including the originator and the intermediate caches) yet still
providing protection from pollution. The hypothesis we wish to test in this
paper is whether in CB-MANETs with sufficient caches of a file, the performance
(in terms of robustness) of the restricted coding equals that of unrestricted
coding.
In this paper, we examine and compare unrestricted coding to full cache
coding, source only coding, and no coding. As expected, we find that full cache
coding remains competitive with unrestricted coding while maintaining full
protection against pollution attacks
Recommended from our members
IDLP: an efficient intrusion detection and location-aware prevention mechanism for network coding-enabled mobile small cells
Mobile small cell technology is considered as a 5G enabling technology for delivering ubiquitous 5G services in a cost-effective and energy efficient manner. Moreover, Network Coding (NC) technology can be foreseen as a promising solution for the wireless network of mobile small cells to increase its throughput and improve its performance. However, NC-enabled mobile small cells are vulnerable to pollution attacks due to the inherent vulnerabilities of NC. Although there are several works on pollution attack detection, the attackers may continue to pollute packets in the next transmission of coded packets of the same generation from the source node to the destination nodes. Therefore, in this paper, we present an intrusion detection and location-aware prevention (IDLP) mechanism which does not only detect the polluted packets and drop them but also identify the attacker's exact location so as to block them and prevent packet pollution in the next transmissions. In the proposed IDLP mechanism, the detection and locating schemes are based on a null space-based homomorphic MAC scheme. However, the proposed IDLP mechanism is efficient because, in its initial phase (i.e., Phase 1), it is not needed to be applied to all mobile devices in order to protect the NC-enabled mobile small cells from the depletion of their resources. The proposed efficient IDLP mechanism has been implemented in Kodo, and its performance has been evaluated and compared with our previous IDPS scheme proposed in [1], in terms of computational complexity, communicational overhead, and successfully decoding probability as well
NB-JNCD Coding and Iterative Joint Decoding Scheme for a Reliable communication in Wireless sensor Networks with results
Privacy threat is a very serious issue in multi-hop wireless networks (MWNs) since open wireless channels are vulnerable to malicious attacks. A distributed random linear network coding approach for transmission and compression of information in general multisource multicast networks. Network nodes independently and randomly select linear mappings from inputs onto output links over some field. Network coding has the potential to thwart traffic analysis attacks since the coding/mixing operation is encouraged at intermediate nodes. However, the simple deployment of network coding cannot achieve the goal once enough packets are collected by the adversaries. This paper proposes non-binary joint network-channel coding for reliable communication in wireless networks. NB-JNCC seamlessly combines non-binary channel coding and random linear network coding, and uses an iterative two-tier coding scheme that weproposed to jointly exploit redundancy inside packets and across packets for error recovery
- …