Efficient and Reliable Transmission Mechanism for Wireless Nodes

Abstract

In wireless networks the traffic from the source to the destination which is often routed through a number of nodes are often subject to a number of attacks ,where intermediate nodes claim to transmit packets which were no transmitted .These nodes gain higher perferences or priorities the next time they act as the source. In order to tackle such threats a TP is assigned the task of gathering reports and evaluating whether they are genuine or not. This is accomplished in this paper by certain security techniques (hashing, signatures). The reports size are negligible thus large storage spaces are not required. Cheating nodes once detected are barred from the process of transmission. Reports are collected on a periodic basis A good transmission scheme should be secure, and requirelow overhead. However, the existing receipt-based schemes impose significant processing and communication overhead and implementation complexity. Since a trusted party may not be involved in communication sessions, the nodes compose proofs of relaying others’packets, called receipts, and submit them to an offline accounting centre (AC) to clear the payment. The receipts’size is large because they carry security proofs, e.g.,signatures, to secure the payment, which significantly consumes the nodes’ resources and the available bandwidth in submitting them. The AC has to apply a large number of cryptographic operations to verify the receipts, which mayrequire impractical computational power and make the practical implementation of these schemes complex or inefficient. Moreover, since a transaction (relaying packets)value may be very low, the scheme uses micropayment, and thus a transaction’s overhead in terms of submitting and clearing the receipts should be much less than its value.Therefore, reducing the communication and the payment processing overhead is essential for the effective implementation of the payment scheme and to avoid creating a bottleneck at the AC and exhausting the nodes’ resources.

Authors and Affiliations

Feba Grace George , Jaya Varughese , Nithya Mol Antony

Keywords

Related Articles

Multimodal Biometric Face and Fingerprint Recognition Using Adaptive principal Component Analysis and Multilayer Perception

A multimodal biometric face and fingerprint recognition using neural network system based on adaptive principal component analysis and multilayer perception.To improve accuracy and performance, Reliable method for se...

Random Key Generation For Advanced Encryption System (Aes) Using Rm-Prng Algotihm

The advent of electronics have played a vital role in the development of communication system. One of the major issues in the field of communications is maintaining security and privacy of the data transmitted and rec...

Preventing Information Lose and Membership Disclosure on Highdimensional Data

The existing methods generalization and bucketization could not give a satisfactory result for privacy preserving on microdata. It results loss of information and some does not prevent the membership disclosure. In t...

Effective Sharing Of Unstructured Information With Tagging And Reducing Query Workload

Annotation schemes which use attribute-value pairs are usually more expressive because they can hold more information than untyped approaches. A recent work on using more mobile queries that influence such annotation...

Improved Fused Floating Point Add-Subtract Unit

This paper presents improved architectures for a fused floating -point add–subtract unit. The fused floating -point add–subtract unit is useful for digital signal processing (DSP) applications such as fast Fourier tr...

Download PDF file
  • EP ID EP27895
  • DOI -
  • Views 255
  • Downloads 0

How To Cite

Feba Grace George, Jaya Varughese, Nithya Mol Antony (2014). Efficient and Reliable Transmission Mechanism for Wireless Nodes. International Journal of Research in Computer and Communication Technology, 3(4), -. https://europub.co.uk/articles/-A-27895