Efficient and Reliable Transmission Mechanism for Wireless Nodes
Journal Title: International Journal of Research in Computer and Communication Technology - Year 2014, Vol 3, Issue 4
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
- EP ID EP27895
- DOI -
- Views 267
- Downloads 0
Protected And Valuable Cutting For Packet Classification
Hardware implementations of Internet procedure (IP) organization algorithms have been proposed by the research community over the years to realize high speed routers and Internet backbone. Firewalls use packet filter...
A Formal Study of Cryptanalysis on Ciphers
Cryptanalysis is co-study of cryptography. A cipher is said to be successful cipher if it design resists all cipher attacks. Cryptanalyis are two-fold. One way is a benign activity where cryptanalysis is performed to...
Design and Implementation of FPGA Radix-4 Booth Multiplication Algorithm
Fast multipliers are essential parts of digital signal processing systems.The system performance is based on the performance of multiplier used in the system, because it is the slowest component among all components...
Analysis of the data with multiple features in retail domain
In enterprise data mining applications it is crucial to develop effective techniques for mining rules combining necessary information from multiple relevant business areas,catering for real business settings and deci...
Self-assured Data Arrangement within Information Exhaustive Wireless Sensor Correlation
In the corpulent number of outgrowing viable environment each and everything depends on the other sources to transmit the data securely and maintain the data as well in the familiar medium. Transferable nodes in mili...