Document 14671448

International Journal of Advancements in Research & Technology, Volume 3, Issue 1, January-2014

ISSN 2278-7763

AN EFFICIENT TRUST-BASED ROUTING PROTOCOL AND PACKET DELIVERY RATIO WITH COMMUNICATION

INTERNATIONAL JOURNAL OF GNANAMANI COLLEGE OF TECHNOLOGY (GCT)

AN EFFICIENT TRUST-BASED ROUTING PROTOCOL AND

PACKET DELIVERY RATIO WITH COMMUNICATION

P.DINESHBABU

1

M.E,AP/CSE, AND S.ARUL MURUGAN

2

,

GNANAMANI COLLEGE OF TECHNOLOGY,

ME DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING. NAMAKKAL,

ANNA UNIVERSITY CHENNAI.

ABSTRACT : We propose to develop a trust system based on processing the payment reports to maintain a trust value for each node. The nodes that relay message more successfully will have higher trust values, such as the low-mobility and the large-hardware-resources nodes. Based on these trust value, we will propose a trust-based routing protocol to route message through the highly trusted node

(which performance packet relay more successfully in the past) to minimize the probability of dropping the messages, and thus improve the network performance in terms of throughput and packet delivery ratio. The nodes submit lightweight payment report to the AC to update their credit accounts, and temporarily store undeniable security token called Evidences. The reports contain the alleged charges and rewards of different sessions with security proofs. The AC verifies the payment by investigating the consistency of the reports, and clears the payment of the fair reports with almost

IJOART cryptographic operations to verify them only in case of cheating, but the nodes always submit security tokens. However, the trust system should be secure against singular and collusive attacks, and the routing protocol should make smart decisions regarding node selection with low overhead.

Keywords: TP (Trusted Party) , AC (Accounting Center) , payment schemes, RREQ (Route REQuest) ,

RREP (Route REPly)

I.INTRODUCTION

In multihop wireless networks (MWNs), the traffic originated from a node is usually relayed through the other nodes to the destination for enabling new applications and enhancing the network performance and deployment . MWNs can be deployed readily at low cost in developing and rural areas. Multihop packet relay can extend the network coverage using limited transmit power, improve area spectral efficiency, and enhance the network throughput and capacity. MWNs can also implement many useful applications such as data sharing and multimedia data transmission. For example, users in one area (residential neighborhood, university campus, etc.) having different


Copyright © 2014 SciResPub. IJOART

63


ISSN 2278-7763

AN EFFICIENT TRUST-BASED ROUTING PROTOCOL AND PACKET DELIVERY RATIO WITH COMMUNICATION wireless- enabled devices, e.g., PDAs, laptops, tablets, cell phones, etc., can establish a network to communicate, distribute files, and share information. In multihop networks such as mobile ad hoc networks selfish or misbehaving nodes can disrupt the whole network and severely degrade network performance. Reputation, or trust based models are one of the most promising approaches to enforce cooperation and discourage node misbehavior. Reputation is calculated through direct interactions with the nodes and/or indirect information collected from neighbors. Reputation is evolved on each node through monitoring or observing its direct interactions and a node can trust its direct information more than the indirect information.

1.1 MULTIHOP WIRELESS NETWORKS

My first research direction aims to develop a suite of efficient security mechanisms and protocols for mobile ad-hoc and multihop cellular networks. Specifically, we focus on thwarting packetdropping and selfishness attacks, preserving user privacy, and establishing stable communication routes to minimize the probability of breaking the route, thus boosting the network performance in terms of end to- end packet delay, packet delivery ratio, throughput, etc.

1.2 EFFICIENT AND SECURE CREDIT-BASED INCENTIVE MECHANISM

In mobile ad hoc and multihop cellular networks, the mobile nodes should relay others' packets

IJOART fairness and may cause multihop communications to fail. We develop a secure and efficient creditbased incentive mechanism that uses credits (or micropayment) to charge the nodes that send packets, and to reward those relaying packets. This mechanism can stimulate the selfish nodes to relay packets to earn credits, enforce fairness by rewarding credits to the nodes that relay more packets, and discourage packet-flooding attacks by charging the nodes that send packets. Since a trusted party may not be involved in the communication sessions, the nodes compose digital payment receipts, or undeniable proofs of relaying packets, and submit them to a trusted party to update their credit accounts. However, in order to make practical implementation possible, the payment should be secured with low overhead because the nodes have limited resources.

II. SYSTEM DESIGN

In multihop networks such as mobile ad hoc networks selfish or misbehaving nodes can disrupt the whole network and severely degrade network performance. Reputation, or trust based models are one of the most promising approaches to enforce cooperation and discourage node misbehaviour.

Reputation is calculated through direct interactions with the nodes and/or indirect information



64


ISSN 2278-7763

AN EFFICIENT TRUST-BASED ROUTING PROTOCOL AND PACKET DELIVERY RATIO WITH COMMUNICATION collected from neighbors. Reputation is evolved on each node through monitoring or observing its direct interactions and a node can trust its direct information more than the indirect information.

65

Figure 1 A logical Multihop wireless network architecture

2.1 MULTI-HOP NETWORK ESTABLISHMENT

In this first module, we have to establish the multi-hop wireless network. These nodes are used to communicate with each other directly or through the neighbor nodes. If one node send the message „Hello ‟ means, first of all this message is received by the neighboring node. Thereafter it will check whether the destination is neighbor or not. If destination is found the message is send or

IJOART

In this module every node that is created has to be registered with a Trusted Party in order to communicate effectively and to Evidence is valid if the computed PROOF is similar to the Evidence’s

PROOF. The Credit-Account Update phase receives fair and corrected payment reports to update the nodes ‟ credit accounts. The payment reports are cleared using the charging and rewarding policy and get the payment correctly. Upon registration the trusted party will give A Public & Private key pair, a symmetric key and a certificate. The public and private key pair is used in communication are required to act as source or destination node. The symmetric key is used to submit the payment reports. The Trusted Party will keep Account details of every node. After that for the communication process the source will send a Route request to the destination. Packet containing the identities of the source (IDS) and the destination (IDD) nodes, time stamp (Ts), and Time-To-Live(TTL) or the maximum number of intermediate nodes.




ISSN 2278-7763


66

Figure 2 Ticket issuing and Authentication

2.3 Trust System Mechanism

In the data communication process every node will temporarily store the reports and evidences. After a session every node will submits the reports to the trusted party. Reports include the session IDs,A flag bit representing the last packet sent is whether Data or Acknowledgment and X

(the number of packets that is transmitted).Report=R,F,X. The Classifier part in the trusted party will IJOART

Evidence that it is temporarily stored. The Identifying cheaters part of the trusted party will then verify the Evidence and if the node found to be culprit then that node will be evicted from the network by the trusted party. And according to the payment scheme the nodes will get the payment for the data they are passed. The amount is deducted from the source nodes account and credited in intermediate nodes that are in the path. Evidences are undeniable, unforgettable and un- modifiable. The source node cannot deny initiating a session and the amount of payment because its signature is included in the Evidence. Moreover, it is also impossible to modify the source nodes ‟ signatures, compute the private keys from the public ones, and compute the hash value of the signatures without computing the signatures. Instead of Tokens, here we using the Evidence mechanism and also the storage area of the evidences is low and without false accusations. Hence we can reduce the communication and processing overhead.




ISSN 2278-7763


III. IMPLEMENTATION

Multihop wireless networks (MWNs), or the next-generation wireless networks, can significantly improve network performance and deployment and help implement many novel applications and services. However, when compared to wired and single-hop wireless networks,

MWNs are highly vulnerable to serious security threats because packets may be relayed through integrated networks and autonomous devices. My research has been focusing on developing security protocols for securing MWNs. Specifically, we are interested in securing route establishment and data transmission processes, establishing stable routes, and preserving users ‟ anonymity and location privacy.

3.1 USER SECURITY

One task that every systems administrator has to go through at some point is the creation of new user accounts. Power shell makes this process simple and adds additional functionality, such as the ability to set defaults and import users from network .To develop a trust system based on processing the payment reports to maintain a trust value for each node. The nodes that relay message more successfully

Use the CREATE USER statement to create and configure a database user, which is an account through which you can log in to the database, and to establish the means by which sql server

Database permits

IJOART

67

3.2.SERVER




ISSN 2278-7763


The nodes submit lightweight payment report to the AC to update their credit accounts, and temporarily store undeniable security token called Evidences. The reports contain the alleged charges and rewards of different sessions with security proofs. The AC verifies the payment by investigating the consistency of the reports, and clears the payment of the fair reports with almost number of cryptographic operation. For cheating reports, the evidences are requested to identify and evict the cheating nodes, that submit correct reports. Evidence aggregation technique is used to increase the storage area of the Evidences. Evidences are submitted and the AC applies cryptographic operations to verify them only in case of cheating, but the nodes always submit security tokens

3.3 SERVER SEND TO CLIENT USING DB

SQL replication

This was the original replication architecture. SQL Capture uses staging tables, called

Changed Data (CD) table, to store the captured changes it reads from the log. SQL Apply would issue

SQL to read the CD tables, and then issue SQL to write the changes to the target tables. While it is slower in performance, SQL Replication works very well in some scenarios, such as distribution of source data to large number of targets. IJOART

Q replication

This is the newer architecture, where instead of Q Capture writing the captured data into CD tables, it writes the captured data into WebSphere MQ queues. The MQ queue then becomes the transport mechanism, where Q Apply, running at the target machine and reading from the receive end of the queue, would replay the transaction and write the changes to the targets. Q Replication is therefore real-time data replication, with much higher performance, sub-second latency, and extremely high throughput.

68




ISSN 2278-7763


Figure 2. InfoSphere Q Replication architecture

69

Event publishing

Event publishing is essentially running Q Capture without Q Apply. In other words, instead of running Q Apply to read the receive queue for changes, the captured changes are written by Q

Capture in a documented format (either XML or CSV, comma-separated values) so you can write your own program to read the output directly from the receive queue. This article later discusses how this is a viable option for integration with InfoSphere Data Stage, as InfoSphere Data Stage can directly consume the changes from the MQ receive queue and bypass the Q Apply overhead.

Figure 3. InfoSphere event publishing architecture IJOART

InfoSphere Data Stage

InfoSphere Data Stage is a powerful ETL tool that allows you to graphically construct a job to perform ETL functions without writing any codes. The product is packaged as part of the

InfoSphere Information Server product. InfoSphere Data Stage comes with dozens of built-in transformation functions called stages. For example, there is a stage to read from a database table, a stage to join data, a stage to transform input data, a stage to clean data, and more. You can graphically drag stages from the palette to the designer canvas, and then connect the output from one stage to become input of another stage. Each stage provides customizable properties (for example, input table name, column definition, transformation formula, and so on).

A job is then compiled, which generates an executable job in the InfoSphere Data Stage proprietary language. When the job is executed, data is extracted, transformed, and loaded per the definitions of the stages. One of the most significant features of InfoSphere Data Stage is that it is




ISSN 2278-7763

AN EFFICIENT TRUST-BASED ROUTING PROTOCOL AND PACKET DELIVERY RATIO WITH COMMUNICATION built on a highly configurable parallel engine, together with a proprietary parallel file structure. These parallel features enable Data Stage to achieve very high performance.

Figure 4 shows an example InfoSphere Data Stage job on the InfoSphere Data Stage Designer client

3.4 DATA SECURITY

Data security on the all record data login page is aimed at ensuring unique customer identification, on one hand, and the encryption of identifying information and banking data transmitted during online activities on the other hand. In order to maintain the confidentiality of the information in your account, access to the account will be blocked following five failed sign-in attempts. Should this occur, please contact your Account Manager to regain access. As an additional security measure, the connection to the all record data will be terminated after several minutes of inactivity in order to prevent access by unauthorized users.

3.5 SECUREDATA CLIENT AND SERVER

Communication between your our emp data server is encrypted and secured using advanced, stringent encryption methods based on technologies that are the highest standard for information encryption on the network. The secured connection prevents any information transmitted from being exposed to other users.

IJOART record more than secure provider to user.

70

Trust System A r c h i i t t e c t t u r e




ISSN 2278-7763


3.6 IDENTIFYING CHEATERS

The Identifying Cheaters’ phase, the TP processes the cheating reports to identify the cheating nodes and correct the financial data. Our objective of securing the payment is preventing the attackers (singular of collusive) from stealing credits or paying less, i.e., the attackers should not benefit from their misbehaviors. We should also guarantee that each node will earn the correct payment even if the other nodes in the route collude to steal credits. The AC requests the Evidence only from the node that submits report with more payment instead of all the nodes in the route because it should have the necessary and undeniable proofs (signatures and hash chain elements) for identifying the cheating node(s). In this way, the AC can precisely identify the cheating nodes with requesting few Evidences. Numerical examples will be given in

Section 5 to clarify how cheating nodes can be identified without false accusations.

To verify an Evidence, the TP composes the PROOF by generating the nodes’ signatures and hashing them. The Evidence is valid if the computed PROOF is similar to the

Evidence’s PROOF.

3.7 CREDIT-ACCOUNT UPDATE

The Credit-Account Update phase receives fair and corrected payment reports to update the

IJOART receiving the reports of all nodes in a route to verify the payment. The maximum payment clearance delay (or the worst case timing) occurs for the sessions that are held shortly after at least one node contacts the AC and the node submits the report after the certificate lifetime (TCert), i.e., at least one report is submitted after TCert of the session occurrence. It is worth to note that the maximum time duration for a node’s two consecutive contacts with the TP is TCert to renew its certificate to be able to use the network. shows the worst case timing of the submission and clearance of the reports with considering that the reports are submitted every TCert, where SUB_R, SUB_E, CLR_FR, and

CLR_CR refer to the events of submitting reports, submitting Evidences, clearing fair reports, and clearing cheating reports. At t1, the nodes submit the payment reports of the sessions held in [t0; t1) and the fair reports of these sessions are cleared. Thus, the maximum payment clearance delay of fair reports is TCERT for the sessions held shortly after t0, but the average payment clearance delay is

TCert=2 for the sessions held in [t0; t1) assuming that the sessions are held according to uniform random distribution. At t2, the TP requests the Evidences of the cheating reports of the sessions held in [t0; t1). Thus, the maximum payment clearance delay for cheating reports is 2 _ TCert for the sessions held shortly after t0, but the average payment clearance delay is 1.5 TCert for the cheating



71


ISSN 2278-7763

AN EFFICIENT TRUST-BASED ROUTING PROTOCOL AND PACKET DELIVERY RATIO WITH COMMUNICATION reports of the sessions held in [t0; t1). The figure also shows that the maximum time for storing an

Evidence is 2 _ TCert, e.g., for the reports of sessions held shortly after t0. At t2, the nodes delete the

Evidences of the sessions held in [t0; t1) because the AC must have cleared their reports. However, the nodes submit the reports at different times because the connection to the TP may not be available on a regular basis, and thus the duration between each two submissions may not be the same and may be less than or equal to TCert.

IV. CONCLUSION

In this paper, to develop a trust system based on processing the payment reports to maintain a trust value for each node. The nodes that relay message more successfully will have higher trust values, such as the low-mobility and the large-hardware-resources nodes. Based on these trust value, we will propose a trust-based routing protocol to route message through the highly trusted node

(which performance packet relay more successfully in the past) to minimize the probability of dropping the messages, and thus improve the network performance in terms of throughput and packet delivery ratio. The nodes submit lightweight payment report to the AC to update their credit accounts, and temporarily store undeniable security token called Evidences. The reports contain the alleged charges and rewards of different sessions with The AC verifies the payment by investigating the consistency of the reports, and clears the payment of the fair reports with almost number of IJOART more successfully in the past) to minimize the probability of dropping the messages, and thus improve the network performance in terms of throughput and packet delivery ratio. Evidences are submitted and the AC applies cryptographic operations to verify them only in case of cheating, but the nodes always submit security tokens.

REFERENCES

[1] Mahmoud And Shen: A Secure Payment Scheme With Low Communication And

Processing, Overhead For Multihop wireless networks., IEEE Transactions On Parallel

And Distributed Systems, Vol. 24,No. 2, pp. 209-224, February 2013.

[2] G. Shen, J. Liu, D. Wang, J. Wang, and S. Jin, “Multi-Hop Relay for Next-Generation

Wireless Access Networks,” Bell Labs Technical J., vol. 13, no. 4, pp. 175-193, 2009.

[3] C. Chou, D. Wei, C. Kuo, and K. Naik, “An Efficient Anonymous Communication Protocol for

Peer-to-Peer Applications Over Mobile Ad-Hoc Networks,” IEEE J. Selected Areas in Comm.,

vol. 25, no. 1, pp. 192-203, Jan. 2007.

[4] H. Gharavi, “Multichannel Mobile Ad Hoc Links for Multimedia Communications,” Proc.

IEEE, vol. 96, no. 1, pp. 77-96, Jan. 2008.



72


ISSN 2278-7763


[5] S. Marti, T. Giuli, K. Lai, and M. Baker, “Mitigating Routing Misbehavior in Mobile Ad

Hoc Networks,” Proc. MobiCom ‟ 00, pp. 255-265, Aug. 2000.

[6] G. Marias, P. Georgiadis, D. Flitzanis, and K. Mandalas, “Cooperation Enforcement

Schemes for MANETs: A Survey,” Wiley ‟ s J. Wireless Comm. and Mobile Computing,

vol. 6, no. 3, pp. 319-332, 2006.

[7] Y. Zhang and Y. Fang, “A Secure Authentication and Billing Architecture for Wireless

Mesh Networks,” ACM Wireless Networks, vol. 13, no. 5, pp. 663-678, Oct. 2007.

[8] L. Buttyan and J. Hubaux, “Stimulating Cooperation in Self-Organizing Mobile Ad Hoc

Networks,” Mobile Networks and Applications, vol. 8, no. 5, pp. 579-592, Oct. 2004.

[9] Y. Zhang, W. Lou, and Y. Fang, “A Secure Incentive Protocol for Mobile Ad Hoc

Networks,” ACM Wireless Networks, vol. 13, no. 5, pp. 569-582, Oct. 2007.

[10] A. Weyland, “Cooperation and Accounting in Multi-Hop Cellular Networks,” PhD thesis,

Univ. of Bern, Nov. 2005.

73

IJOART



Document 14671448

AN EFFICIENT TRUST-BASED ROUTING PROTOCOL AND

PACKET DELIVERY RATIO WITH COMMUNICATION

Related documents

Products

Support

Document 14671448

AN EFFICIENT TRUST-BASED ROUTING PROTOCOL AND

PACKET DELIVERY RATIO WITH COMMUNICATION

Related documents

Add this document to collection(s)

Add this document to saved

Suggest us how to improve StudyLib