The document proposes a secure payment scheme for multihop wireless networks using a trusted node identification method. It improves an existing report-based payment scheme by assigning trust values to nodes based on their past performance. The proposed scheme has 5 phases: 1) communication through high trust nodes, 2) report classification, 3) cheater identification, 4) credit account updates, 5) trust value updates. It aims to increase performance by reducing dropped packets through trusted nodes and minimizing overhead in the report-based scheme through limited cryptographic operations. The experimental results suggest it improves throughput and delivery ratio compared to other schemes.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Improving Security Features In MANET Authentication Through Scrutiny Of The C...Editor IJMTER
With changing times, the researchers fine MANET Security, a daunting task.
Authentication problems are crapping up frequently, in the Absence of well laid out of infrastructure
.The adaptability of TTP’s and non TTP’s in MANET’s becoming more difficult and impractical.
With the help of pre assigned logins on offline basis and issuance of certificates more effectively
can address with the help of Hybrid Key management Scheme on strength and use of 4G services.
The proper account of CRL status of servers was not taken into by the scheme. if it is embedded
the nodes need to check frequently the server’s CRL status for authenticating any node and place
external messages outside MANET which leads to overheads. To reduce them , we tried by going for
online MANET authority ,responsible for issuing certificates ,duly considering the CRL Status of
servers ,their renewable and key verification within the MANET, which had sufficiently reduced the
external messages.
A Secure Payment Scheme with Low Communication and Processing Overhead for Mu...Editor IJMTER
In this proposed work a trust-based routing protocol is developed to route messages through the
highly trusted nodes to minimize the probability of dropping the messages. Thus improve the network
performance in terms of throughput and packet delivery ratio. The proposed design contains a novel secure
reactive routing protocol for Mobile ad hoc networks (MANETs), called TRIUMF (Trust-Based Routing
Protocol with controlled degree of Selfishness for Securing MANET against Packet Dropping Attack). In the
proposed protocol trust among nodes is represented by trust value, which consists of cooperation score, direct
trust and indirect trust. The proposed trust routing allows controlled degree of selfishness to give an incentive to
the selfish nodes to declare its selfishness behavior to its neighbor nodes, which reduce the searching time of
misbehaving nodes to search for the malicious nodes only. In the proposed routing protocol two node-disjoint
routes between the source and destination nodes are selected based on their path trust values, one marked as
primary and the other as secondary. In this work both DLL-ACK and end- to-end TCP-ACK as monitoring
tools to monitor the behavior of routing path nodes: if the data packet successfully transmitted, then the path
nodes trust value are updated positively; otherwise, if a malicious behavior is detected then the path searching
tool starts to identify the malicious nodes and isolate them from the routing path and the network. Finally this
scheme reduces the searching time of malicious nodes, and the routing protocol avoids the isolated misbehaving
node from sharing in all future routes, which improves the overall network throughput.
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
Vehicular Ad Hoc Network (VANET) is a more influential network in which vehicles depend on each other to communicate and for the secure exchange of the messages. With the improvement in the technology, mainly the vehicles are equipped with Wi-Fi and GPS devices to improve the traffic handling and road safety. But many vehicles may broadcast the bogus messages for their own purpose, so it needs a trustful environment and an effective trust management schemes to prevent the network from the various malicious attacks. Trust establishment is very challenging as the network is highly mobile and vehicles may come in or depart at any time. In this paper, we first discuss the VANET model to describe the environment, and then the trust management schemes to secure the network and lastly the various cryptography fundamentals for the fast and safe message transfer.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Improving Security Features In MANET Authentication Through Scrutiny Of The C...Editor IJMTER
With changing times, the researchers fine MANET Security, a daunting task.
Authentication problems are crapping up frequently, in the Absence of well laid out of infrastructure
.The adaptability of TTP’s and non TTP’s in MANET’s becoming more difficult and impractical.
With the help of pre assigned logins on offline basis and issuance of certificates more effectively
can address with the help of Hybrid Key management Scheme on strength and use of 4G services.
The proper account of CRL status of servers was not taken into by the scheme. if it is embedded
the nodes need to check frequently the server’s CRL status for authenticating any node and place
external messages outside MANET which leads to overheads. To reduce them , we tried by going for
online MANET authority ,responsible for issuing certificates ,duly considering the CRL Status of
servers ,their renewable and key verification within the MANET, which had sufficiently reduced the
external messages.
A Secure Payment Scheme with Low Communication and Processing Overhead for Mu...Editor IJMTER
In this proposed work a trust-based routing protocol is developed to route messages through the
highly trusted nodes to minimize the probability of dropping the messages. Thus improve the network
performance in terms of throughput and packet delivery ratio. The proposed design contains a novel secure
reactive routing protocol for Mobile ad hoc networks (MANETs), called TRIUMF (Trust-Based Routing
Protocol with controlled degree of Selfishness for Securing MANET against Packet Dropping Attack). In the
proposed protocol trust among nodes is represented by trust value, which consists of cooperation score, direct
trust and indirect trust. The proposed trust routing allows controlled degree of selfishness to give an incentive to
the selfish nodes to declare its selfishness behavior to its neighbor nodes, which reduce the searching time of
misbehaving nodes to search for the malicious nodes only. In the proposed routing protocol two node-disjoint
routes between the source and destination nodes are selected based on their path trust values, one marked as
primary and the other as secondary. In this work both DLL-ACK and end- to-end TCP-ACK as monitoring
tools to monitor the behavior of routing path nodes: if the data packet successfully transmitted, then the path
nodes trust value are updated positively; otherwise, if a malicious behavior is detected then the path searching
tool starts to identify the malicious nodes and isolate them from the routing path and the network. Finally this
scheme reduces the searching time of malicious nodes, and the routing protocol avoids the isolated misbehaving
node from sharing in all future routes, which improves the overall network throughput.
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
Vehicular Ad Hoc Network (VANET) is a more influential network in which vehicles depend on each other to communicate and for the secure exchange of the messages. With the improvement in the technology, mainly the vehicles are equipped with Wi-Fi and GPS devices to improve the traffic handling and road safety. But many vehicles may broadcast the bogus messages for their own purpose, so it needs a trustful environment and an effective trust management schemes to prevent the network from the various malicious attacks. Trust establishment is very challenging as the network is highly mobile and vehicles may come in or depart at any time. In this paper, we first discuss the VANET model to describe the environment, and then the trust management schemes to secure the network and lastly the various cryptography fundamentals for the fast and safe message transfer.
ELLIPTIC CURVE CRYPTOGRAPHY IN SECURING NETWORKS BY MOBILE AUTHENTICATIONijcisjournal
This paper proposes an enhanced authentication model, which is suitable for low-power mobile devices. It
uses an Extended Password Key Exchange Protocols [2] and elliptic-curve-cryptosystem based trust
delegation mechanism to generate a delegation pass code for mobile station authentication, and it can
effectively defend all known attacks to mobile networks including the denial-of-service attack. Moreover,
the mobile station only needs to receive one message and send one message to authenticate itself to a
visitor’s location register, and the model only requires a single elliptic-curve scalar point multiplication on
a mobile device. Therefore, this model enjoys both computation efficiency and communication efficiency as
compared to known mobile authentication models.
A NOVEL CHARGING AND ACCOUNTING SCHEME IN MOBILE AD-HOC NETWORKSIJNSA Journal
Because of the lack of infrastructure in mobile ad hoc networks (MANETs), their proper functioning must
rely on co-operations among mobile nodes. However, mobile nodes tend to save their own resources and
may be reluctant to forward packets for other nodes. One approach to encourage co-operations among
nodes is to reward nodes that forward data for others. Such an incentive-based scheme requires a charging
and accounting framework to control and manage rewards and fines (collected from users committing
infractions). In this paper, we propose a novel charging and accounting scheme for MANETs. We present a
detailed description of the proposed scheme and demonstrate its effectiveness via formal proofs and
simulation results [15]. We develop a theoretical game model that offers advice to network administrators
about the allocation of resources for monitoring mobile nodes. The solution provides the optimal
monitoring probability, which discourages nodes from cheating because the gain would be compensated by
the penalty.
FAULT TOLERANT LEADER ELECTION IN DISTRIBUTED SYSTEMSijcseit
There are many distributed systems which use a leader in their logic. When such systems need to be fault
tolerant and the current leader suffers a technical problem, it is necesary to apply a special algorithm in
order to choose a new leader. In this paper I present a new fault tolerant algorithm which elects a new
leader based on a random roulette wheel selection.
Covid19 ContactTracing - Privacy Preserving Proximity ProtocolsGokul Alex
Presentation Session by Gokul Alex for Tamil Nadu Science Foundation on the Collection of Cryptographic Techniques for COVID-19 Contact Tracing in the framework of Privacy Preserving Proximity Protocols. This is a research report compiled in collaboration with EPIC Knowledge Society, RedTeam Hacker Academy, Beyond Identity, Semiot Protocols, Cyanaura Maps.
INFRINGEMENT PRECLUSION SYSTEM VIA SADEC: STEALTHY ATTACK DETECTION AND COUNT...ijp2p
In this paper we are providing a implementation details about simulated solution of stealthy packet drop
attack. Stealthy packet drop attack is a suite of four attack types, includes colluding collision, packet
misrouting, identity delegation and power control. Stealthy packet drop attacks disrupts the packet from
reaching to it’s destination through malicious behaviour. These attacks can be easily breakdown the
multi-hop wireless ad-hoc networks. Most widely preferred method for detecting attacks in wireless
network is behaviour based detection method. In this method a normal network overhears
communication from its neighbourhood. Here we are implementing a SADEC protocol which is
proposed solution of stealthy packet drop attacks. SADEC overlaid the base line local monitoring. In
base line local monitoring each neighbour maintains additional information about routing path also it
adds some checking responsibility to all its neighbours. SADEC proves more efficient than baseline local
monitoring to mitigate successfully all the stealthy attack types.
DDoS Attack and Defense Scheme in Wireless Ad hoc NetworksIJNSA Journal
The wireless ad hoc networks are highly vulnerable to distributed denial of service(DDoS) attacks because of its unique characteristics such as open network architecture, shared wireless medium and stringent resource constraints. These attacks throttle the tcp throughput heavily and reduce the quality of service(QoS) to end systems gradually rather than refusing the clients from the services completely. In this paper, we discussed the DDoS attacks and proposed a defense scheme to improve the performance of the ad hoc networks. Our proposed defense mechanism uses the medium access control (MAC) layer information to detect the attackers. The status values from MAC layer that can be used for detection are Frequency of receiving RTS/CTS packets, Frequency of sensing a busy channel and the number of RTS/DATA retransmissions. Once the attackers are identified, all the packets from those nodes will be blocked. The network resources are made available to the legitimate users. We perform the simulation with Network Simulator NS2 and we proved that our proposed system improves the network performance.
Report based payment scheme for multihop wireless networkseSAT Journals
Abstract We propose RACE, a report-based payment scheme for multihop wireless networks to stimulate node cooperation, regulate packet transmission, and enforce fairness. The nodes submit lightweight payment reports (instead of receipts) to the accounting center (AC) and temporarily store undeniable security tokens called Evidences. The reports contain the alleged charges and rewards without security proofs, e.g., signatures. The AC can verify the payment by investigating the consistency of the reports, and clear the payment of the fair reports with almost no processing overhead or cryptographic operations. For cheating re-ports, the Evidences are requested to identify and evict the cheating nodes that submit incorrect reports. Instead of requesting the Evidences from all the nodes participating in the cheating reports, RACE can identify the cheating nodes with requesting few Evidences. Moreover, Evidence aggregation technique is used to re-duce the Evidences’ storage area. Our analytical and simulation results demonstrate that RACE requires much less communication and processing overhead than the existing receipt-based schemes with acceptable payment clearance delay and storage area. This is essential for the effective implementation of a payment scheme because it uses micropayment and the overhead cost should be much less than the payment value. Moreover, RACE can secure the payment and precisely identify the cheating nodes without false accusations. Index Terms: Cooperation incentive schemes; network-level security and protection; payment schemes; and selfishness attacks.
Eport based payment scheme for multihop wireless networkseSAT Journals
Abstract We propose RACE, a report-based payment scheme for multihop wireless networks to stimulate node cooperation, regulate packet transmission, and enforce fairness. The nodes submit lightweight payment reports (instead of receipts) to the accounting center (AC) and temporarily store undeniable security tokens called Evidences. The reports contain the alleged charges and rewards without security proofs, e.g., signatures. The AC can verify the payment by investigating the consistency of the reports, and clear the payment of the fair reports with almost no processing overhead or cryptographic operations. For cheating re-ports, the Evidences are requested to identify and evict the cheating nodes that submit incorrect reports. Instead of requesting the Evidences from all the nodes participating in the cheating reports, RACE can identify the cheating nodes with requesting few Evidences. Moreover, Evidence aggregation technique is used to re-duce the Evidences’ storage area. Our analytical and simulation results demonstrate that RACE requires much less communication and processing overhead than the existing receipt-based schemes with acceptable payment clearance delay and storage area. This is essential for the effective implementation of a payment scheme because it uses micropayment and the overhead cost should be much less than the payment value. Moreover, RACE can secure the payment and precisely identify the cheating nodes without false accusations. Index Terms: Cooperation incentive schemes; network-level security and protection; payment schemes; and selfishness attacks.
ELLIPTIC CURVE CRYPTOGRAPHY IN SECURING NETWORKS BY MOBILE AUTHENTICATIONijcisjournal
This paper proposes an enhanced authentication model, which is suitable for low-power mobile devices. It
uses an Extended Password Key Exchange Protocols [2] and elliptic-curve-cryptosystem based trust
delegation mechanism to generate a delegation pass code for mobile station authentication, and it can
effectively defend all known attacks to mobile networks including the denial-of-service attack. Moreover,
the mobile station only needs to receive one message and send one message to authenticate itself to a
visitor’s location register, and the model only requires a single elliptic-curve scalar point multiplication on
a mobile device. Therefore, this model enjoys both computation efficiency and communication efficiency as
compared to known mobile authentication models.
A NOVEL CHARGING AND ACCOUNTING SCHEME IN MOBILE AD-HOC NETWORKSIJNSA Journal
Because of the lack of infrastructure in mobile ad hoc networks (MANETs), their proper functioning must
rely on co-operations among mobile nodes. However, mobile nodes tend to save their own resources and
may be reluctant to forward packets for other nodes. One approach to encourage co-operations among
nodes is to reward nodes that forward data for others. Such an incentive-based scheme requires a charging
and accounting framework to control and manage rewards and fines (collected from users committing
infractions). In this paper, we propose a novel charging and accounting scheme for MANETs. We present a
detailed description of the proposed scheme and demonstrate its effectiveness via formal proofs and
simulation results [15]. We develop a theoretical game model that offers advice to network administrators
about the allocation of resources for monitoring mobile nodes. The solution provides the optimal
monitoring probability, which discourages nodes from cheating because the gain would be compensated by
the penalty.
FAULT TOLERANT LEADER ELECTION IN DISTRIBUTED SYSTEMSijcseit
There are many distributed systems which use a leader in their logic. When such systems need to be fault
tolerant and the current leader suffers a technical problem, it is necesary to apply a special algorithm in
order to choose a new leader. In this paper I present a new fault tolerant algorithm which elects a new
leader based on a random roulette wheel selection.
Covid19 ContactTracing - Privacy Preserving Proximity ProtocolsGokul Alex
Presentation Session by Gokul Alex for Tamil Nadu Science Foundation on the Collection of Cryptographic Techniques for COVID-19 Contact Tracing in the framework of Privacy Preserving Proximity Protocols. This is a research report compiled in collaboration with EPIC Knowledge Society, RedTeam Hacker Academy, Beyond Identity, Semiot Protocols, Cyanaura Maps.
INFRINGEMENT PRECLUSION SYSTEM VIA SADEC: STEALTHY ATTACK DETECTION AND COUNT...ijp2p
In this paper we are providing a implementation details about simulated solution of stealthy packet drop
attack. Stealthy packet drop attack is a suite of four attack types, includes colluding collision, packet
misrouting, identity delegation and power control. Stealthy packet drop attacks disrupts the packet from
reaching to it’s destination through malicious behaviour. These attacks can be easily breakdown the
multi-hop wireless ad-hoc networks. Most widely preferred method for detecting attacks in wireless
network is behaviour based detection method. In this method a normal network overhears
communication from its neighbourhood. Here we are implementing a SADEC protocol which is
proposed solution of stealthy packet drop attacks. SADEC overlaid the base line local monitoring. In
base line local monitoring each neighbour maintains additional information about routing path also it
adds some checking responsibility to all its neighbours. SADEC proves more efficient than baseline local
monitoring to mitigate successfully all the stealthy attack types.
DDoS Attack and Defense Scheme in Wireless Ad hoc NetworksIJNSA Journal
The wireless ad hoc networks are highly vulnerable to distributed denial of service(DDoS) attacks because of its unique characteristics such as open network architecture, shared wireless medium and stringent resource constraints. These attacks throttle the tcp throughput heavily and reduce the quality of service(QoS) to end systems gradually rather than refusing the clients from the services completely. In this paper, we discussed the DDoS attacks and proposed a defense scheme to improve the performance of the ad hoc networks. Our proposed defense mechanism uses the medium access control (MAC) layer information to detect the attackers. The status values from MAC layer that can be used for detection are Frequency of receiving RTS/CTS packets, Frequency of sensing a busy channel and the number of RTS/DATA retransmissions. Once the attackers are identified, all the packets from those nodes will be blocked. The network resources are made available to the legitimate users. We perform the simulation with Network Simulator NS2 and we proved that our proposed system improves the network performance.
Report based payment scheme for multihop wireless networkseSAT Journals
Abstract We propose RACE, a report-based payment scheme for multihop wireless networks to stimulate node cooperation, regulate packet transmission, and enforce fairness. The nodes submit lightweight payment reports (instead of receipts) to the accounting center (AC) and temporarily store undeniable security tokens called Evidences. The reports contain the alleged charges and rewards without security proofs, e.g., signatures. The AC can verify the payment by investigating the consistency of the reports, and clear the payment of the fair reports with almost no processing overhead or cryptographic operations. For cheating re-ports, the Evidences are requested to identify and evict the cheating nodes that submit incorrect reports. Instead of requesting the Evidences from all the nodes participating in the cheating reports, RACE can identify the cheating nodes with requesting few Evidences. Moreover, Evidence aggregation technique is used to re-duce the Evidences’ storage area. Our analytical and simulation results demonstrate that RACE requires much less communication and processing overhead than the existing receipt-based schemes with acceptable payment clearance delay and storage area. This is essential for the effective implementation of a payment scheme because it uses micropayment and the overhead cost should be much less than the payment value. Moreover, RACE can secure the payment and precisely identify the cheating nodes without false accusations. Index Terms: Cooperation incentive schemes; network-level security and protection; payment schemes; and selfishness attacks.
Eport based payment scheme for multihop wireless networkseSAT Journals
Abstract We propose RACE, a report-based payment scheme for multihop wireless networks to stimulate node cooperation, regulate packet transmission, and enforce fairness. The nodes submit lightweight payment reports (instead of receipts) to the accounting center (AC) and temporarily store undeniable security tokens called Evidences. The reports contain the alleged charges and rewards without security proofs, e.g., signatures. The AC can verify the payment by investigating the consistency of the reports, and clear the payment of the fair reports with almost no processing overhead or cryptographic operations. For cheating re-ports, the Evidences are requested to identify and evict the cheating nodes that submit incorrect reports. Instead of requesting the Evidences from all the nodes participating in the cheating reports, RACE can identify the cheating nodes with requesting few Evidences. Moreover, Evidence aggregation technique is used to re-duce the Evidences’ storage area. Our analytical and simulation results demonstrate that RACE requires much less communication and processing overhead than the existing receipt-based schemes with acceptable payment clearance delay and storage area. This is essential for the effective implementation of a payment scheme because it uses micropayment and the overhead cost should be much less than the payment value. Moreover, RACE can secure the payment and precisely identify the cheating nodes without false accusations. Index Terms: Cooperation incentive schemes; network-level security and protection; payment schemes; and selfishness attacks.
A Survey on Credit Based Scheme for Multihop Wireless Networkijsrd.com
Wireless Network (WSN) is an evolving technology that has various applications both for mass public and military. The performance of wireless networks depends on the cooperation of all active nodes. However, supporting a wireless network is a cost-intensive activity for a mobile node. For a single mobile node perspective, the detection of routes as well as forwarding packets consumes local CPU time, memory and bandwidth. Sometimes the mobile nodes denying the packet of other nodes, while at the same time use their services to deliver its own data. This behaviour of an independent mobile node is commonly known as misbehaving or selfishness. There are different schemes used for minimizing malicious behaviour of mobile nodes. Here provide different payment based schemes that provide co-operation among nodes in the network.
A SECURE CLUSTER BASED COMMUNICATION IN WIRELESS NETWORK USING CRYPTOGRAPHIC ...IJNSA Journal
Mobile Adhoc Networks are becoming very popular in current Wireless Technology, which is been associated to business, socially and in some critical applications like Military etc, The network which is formed by self configuring wireless links which are connected to each other. These applications are categorized by hostile environment that they serve while communicating between nodes. However in such Wireless Network will be more exposed to different types of security attacks. The challenge is to meet secure network communication. In this paper we focus on cluster based secure communication to improve the reliability between clusters. In this scheme the Cluster Members (CM) submits a report to the Cluster Head (CH) and temporarily stores Evidences as a security tokens. The reports contain digital signatures. The CH will verify the consistency of the CM report and updates to Accounting Centre (AC). AC will verify the uniformity of reports and clears the cryptographic operations. For attacker nodes, the security tokens are requested to classify and expel the attacker nodes which submit wrong reports.
A NOVEL CHARGING AND ACCOUNTING SCHEME IN MOBILE AD-HOC NETWORKSIJNSA Journal
Because of the lack of infrastructure in mobile ad hoc networks (MANETs), their proper functioning must rely on co-operations among mobile nodes. However, mobile nodes tend to save their own resources and may be reluctant to forward packets for other nodes. One approach to encourage co-operations among
nodes is to reward nodes that forward data for others. Such an incentive-based scheme requires a charging and accounting framework to control and manage rewards and fines (collected from users committing infractions). In this paper, we propose a novel charging and accounting scheme for MANETs. We present a detailed description of the proposed scheme and demonstrate its effectiveness via formal proofs and simulation results [15]. We develop a theoretical game model that offers advice to network administrators about the allocation of resources for monitoring mobile nodes. The solution provides the optimal monitoring probability, which discourages nodes from cheating because the gain would be compensated by
the penalty.
A NOVEL CHARGING AND ACCOUNTING SCHEME IN MOBILE AD-HOC NETWORKSIJNSA Journal
Because of the lack of infrastructure in mobile ad hoc networks (MANETs), their proper functioning must rely on co-operations among mobile nodes. However, mobile nodes tend to save their own resources and may be reluctant to forward packets for other nodes. One approach to encourage co-operations among nodes is to reward nodes that forward data for others. Such an incentive-based scheme requires a charging and accounting framework to control and manage rewards and fines (collected from users committing infractions). In this paper, we propose a novel charging and accounting scheme for MANETs. We present a detailed description of the proposed scheme and demonstrate its effectiveness via formal proofs and simulation results [15]. We develop a theoretical game model that offers advice to network administrators about the allocation of resources for monitoring mobile nodes. The solution provides the optimal monitoring probability, which discourages nodes from cheating because the gain would be compensated by the penalty.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Irrational node detection in multihop cellular networks using accounting centereSAT Journals
Abstract In multihop cellular networks mobile nodes typically transmit packets during intermediate mobile nodes for enhancing recital. Stingy nodes typically don't collaborate that incorporates a negative result on the network fairness and recital. A fair, inexpensive and best incentive mechanism by Selfish Node Detection (FESCIMbySND) has been projected to stimulate the mobile node’s cooperation. Hashing operations area unit employed in order to extend the safety. Trivial Hash perform has been wont to improve end-to-end delay and outturn. Additionally Cyclic Redundancy Check Mechanism has been used to spot the ridiculous nodes that involve themselves in sessions with the intention of dropping the in sequence packets. Moreover, to cut back the impact at the Accounting Center a Border node has been commend the task of propose the checks employing a digital signature. Keywords: Border Node Mechanism, Cyclic Redundancy Check, Selfish nodes, Trivial Hash Function
A SECURE CLUSTER BASED COMMUNICATION IN WIRELESS NETWORK USING CRYPTOGRAPHIC ...IJNSA Journal
Mobile Adhoc Networks are becoming very popular in current Wireless Technology, which is been
associated to business, socially and in some critical applications like Military etc, The network which is
formed by self configuring wireless links which are connected to each other. These applications are
categorized by hostile environment that they serve while communicating between nodes. However in such
Wireless Network will be more exposed to different types of security attacks. The challenge is to meet
secure network communication. In this paper we focus on cluster based secure communication to improve
the reliability between clusters. In this scheme the Cluster Members (CM) submits a report to the Cluster
Head (CH) and temporarily stores Evidences as a security tokens. The reports contain digital signatures.
The CH will verify the consistency of the CM report and updates to Accounting Centre (AC). AC will verify
the uniformity of reports and clears the cryptographic operations. For attacker nodes, the security tokens
are requested to classify and expel the attacker nodes which submit wrong reports.
Cluster Based Misbehaviour Detection and Authentication Using Threshold Crypt...CSCJournals
In mobile ad hoc networks, the misbehaving nodes can cause dysfunction in the network resulting in damage of other nodes. In order to establish secure communication with the group members of a network, use of a shared group key for confidentiality and authentication is required. Distributing the shares of secret group key to the group members securely is another challenging task in MANET. In this paper, we propose a Cluster Based Misbehavior Detection and Authentication scheme using threshold cryptography in MANET. For secure data transmission, when any node requests a certificate from a cluster head (CH), it utilizes a threshold cryptographic technique to issue the certificate to the requested node for authentication. The certificate of a node is renewed or rejected by CH, based on its trust counter value. An acknowledgement scheme is also included to detect and isolate the misbehaving nodes. By simulation results, we show that the proposed approach reduces the overhead.
Trust Management for Secure Routing Forwarding Data Using Delay Tolerant Netw...rahulmonikasharma
Delay Tolerant Networks (DTNs) have established the connection to source and destination. For example this often faces disconnection and unreliable wireless connections. A delay tolerant network (DTNs) provides a network imposes disruption or delay. The delay tolerant networks operate in limited resources such as memory size, central processing unit. Trust management protocol uses a dynamic threshold updating which overcomes the problems .The dynamic threshold update reduces the false detection probability of the malicious nodes. The system proposes a secure routing management schemes to adopt information security principles successfully. It analyzes the basic security principles and operations for trust authentication which is applicable in delay tolerant networks (DTNs).For security the proposed system identifies the store and forward approach in network communications and analyzes the routing in cases like selfish contact and collaboration contact methods. The proposed method identifies ZRP protocol scheme and it enhances the scheme using methods namely distributed operation, mobility, delay analysis, security association and trust modules. This security scheme analyzes the performance analysis and proposed algorithm based on parameter time, authentication, security, and secure routing. From this analysis, this research work identifies the issues in DTNs secure routing and enhances ZRP (Zone Routing Protocol) by suggesting an authentication principle as a noted security principle for extremely information security concepts.
Dynamic Routing to Alleviate Congestion with Authentication for Mobile Wirele...ijbuiiir1
Communication over mobile Wireless Sensor Networks is becoming extremely popular. Handover over multiple access points is highly desirable to mobile nodes, but ensuring security and efficiency of this process is challenging. A novel handover authentication protocol named Pair-Hand is implemented in the present work. Pair-Hand uses pairing-based cryptography to secure handover process and to achieve high efficiency. An efficient batch signature verification scheme is incorporated into PairHand. The congestion problem in Wireless Sensor Networks (WSNs) during handover process is quite different from that in traditional networks. A traffic-aware dynamic routing (TADR) algorithm is proposed to route packets around the congestion areas and scatter the excessive packets along multiple paths consisting of idle or underloaded nodes. TADR improves overall throughput in WSNs. Experiments using our implementation on laptop PCs show that Pair-Hand is feasible in real applications
International Journal of Engineering Research and DevelopmentIJERD Editor
Electrical, Electronics and Computer Engineering,
Information Engineering and Technology,
Mechanical, Industrial and Manufacturing Engineering,
Automation and Mechatronics Engineering,
Material and Chemical Engineering,
Civil and Architecture Engineering,
Biotechnology and Bio Engineering,
Environmental Engineering,
Petroleum and Mining Engineering,
Marine and Agriculture engineering,
Aerospace Engineering.
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
Communications Mining Series - Zero to Hero - Session 1DianaGray10
This session provides introduction to UiPath Communication Mining, importance and platform overview. You will acquire a good understand of the phases in Communication Mining as we go over the platform with you. Topics covered:
• Communication Mining Overview
• Why is it important?
• How can it help today’s business and the benefits
• Phases in Communication Mining
• Demo on Platform overview
• Q/A
Pushing the limits of ePRTC: 100ns holdover for 100 daysAdtran
At WSTS 2024, Alon Stern explored the topic of parametric holdover and explained how recent research findings can be implemented in real-world PNT networks to achieve 100 nanoseconds of accuracy for up to 100 days.
Why You Should Replace Windows 11 with Nitrux Linux 3.5.0 for enhanced perfor...SOFTTECHHUB
The choice of an operating system plays a pivotal role in shaping our computing experience. For decades, Microsoft's Windows has dominated the market, offering a familiar and widely adopted platform for personal and professional use. However, as technological advancements continue to push the boundaries of innovation, alternative operating systems have emerged, challenging the status quo and offering users a fresh perspective on computing.
One such alternative that has garnered significant attention and acclaim is Nitrux Linux 3.5.0, a sleek, powerful, and user-friendly Linux distribution that promises to redefine the way we interact with our devices. With its focus on performance, security, and customization, Nitrux Linux presents a compelling case for those seeking to break free from the constraints of proprietary software and embrace the freedom and flexibility of open-source computing.
GridMate - End to end testing is a critical piece to ensure quality and avoid...ThomasParaiso2
End to end testing is a critical piece to ensure quality and avoid regressions. In this session, we share our journey building an E2E testing pipeline for GridMate components (LWC and Aura) using Cypress, JSForce, FakerJS…
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
A tale of scale & speed: How the US Navy is enabling software delivery from l...sonjaschweigert1
Rapid and secure feature delivery is a goal across every application team and every branch of the DoD. The Navy’s DevSecOps platform, Party Barge, has achieved:
- Reduction in onboarding time from 5 weeks to 1 day
- Improved developer experience and productivity through actionable findings and reduction of false positives
- Maintenance of superior security standards and inherent policy enforcement with Authorization to Operate (ATO)
Development teams can ship efficiently and ensure applications are cyber ready for Navy Authorizing Officials (AOs). In this webinar, Sigma Defense and Anchore will give attendees a look behind the scenes and demo secure pipeline automation and security artifacts that speed up application ATO and time to production.
We will cover:
- How to remove silos in DevSecOps
- How to build efficient development pipeline roles and component templates
- How to deliver security artifacts that matter for ATO’s (SBOMs, vulnerability reports, and policy evidence)
- How to streamline operations with automated policy checks on container images
Alt. GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using ...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
UiPath Test Automation using UiPath Test Suite series, part 4DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 4. In this session, we will cover Test Manager overview along with SAP heatmap.
The UiPath Test Manager overview with SAP heatmap webinar offers a concise yet comprehensive exploration of the role of a Test Manager within SAP environments, coupled with the utilization of heatmaps for effective testing strategies.
Participants will gain insights into the responsibilities, challenges, and best practices associated with test management in SAP projects. Additionally, the webinar delves into the significance of heatmaps as a visual aid for identifying testing priorities, areas of risk, and resource allocation within SAP landscapes. Through this session, attendees can expect to enhance their understanding of test management principles while learning practical approaches to optimize testing processes in SAP environments using heatmap visualization techniques
What will you get from this session?
1. Insights into SAP testing best practices
2. Heatmap utilization for testing
3. Optimization of testing processes
4. Demo
Topics covered:
Execution from the test manager
Orchestrator execution result
Defect reporting
SAP heatmap example with demo
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Transcript: Selling digital books in 2024: Insights from industry leaders - T...BookNet Canada
The publishing industry has been selling digital audiobooks and ebooks for over a decade and has found its groove. What’s changed? What has stayed the same? Where do we go from here? Join a group of leading sales peers from across the industry for a conversation about the lessons learned since the popularization of digital books, best practices, digital book supply chain management, and more.
Link to video recording: https://bnctechforum.ca/sessions/selling-digital-books-in-2024-insights-from-industry-leaders/
Presented by BookNet Canada on May 28, 2024, with support from the Department of Canadian Heritage.
Removing Uninteresting Bytes in Software FuzzingAftab Hussain
Imagine a world where software fuzzing, the process of mutating bytes in test seeds to uncover hidden and erroneous program behaviors, becomes faster and more effective. A lot depends on the initial seeds, which can significantly dictate the trajectory of a fuzzing campaign, particularly in terms of how long it takes to uncover interesting behaviour in your code. We introduce DIAR, a technique designed to speedup fuzzing campaigns by pinpointing and eliminating those uninteresting bytes in the seeds. Picture this: instead of wasting valuable resources on meaningless mutations in large, bloated seeds, DIAR removes the unnecessary bytes, streamlining the entire process.
In this work, we equipped AFL, a popular fuzzer, with DIAR and examined two critical Linux libraries -- Libxml's xmllint, a tool for parsing xml documents, and Binutil's readelf, an essential debugging and security analysis command-line tool used to display detailed information about ELF (Executable and Linkable Format). Our preliminary results show that AFL+DIAR does not only discover new paths more quickly but also achieves higher coverage overall. This work thus showcases how starting with lean and optimized seeds can lead to faster, more comprehensive fuzzing campaigns -- and DIAR helps you find such seeds.
- These are slides of the talk given at IEEE International Conference on Software Testing Verification and Validation Workshop, ICSTW 2022.
2. International Journal of Computer science and Engineering Research and Development (IJCSERD),
ISSN 2248- 9363 (Print), ISSN- 2248-9371 (Online) Volume 4, Number 2, April-June (2014)
35
A high-quality payment scheme should be secure and need less communication and
processing overhead. MWNs can’t be implemented without a secured payment scheme because
the nodes are autonomous and aim to maximize their welfare. Since a trusted party may not be
involved in communication session, the nodes create proofs of other’s packets of the
transmitting called receipts, and for getting the payment they will submit receipts to the
Accounting Centre (AC).Here the receipt carries security proof so they are large in size. The
AC must carry out large number of cryptographic operations to certify the receipts which leads
to communication and processing overhead. In report based schemes the nodes submit light
payment reports to the trusted third party to update the credits. The reports contain the alleged
charges and the rewards of different sessions without security proofs. The trusted third party
verifies the consistency of the report and categorizes them into fair or cheating report. Without
any cryptographic operations trusted party will clear the payment for fair report. If it is a
cheating report then evidences is requested to discover and evict the cheater node.
To increase the performance of report based payment scheme the trust centre will give a
trust value for the nodes in the network. Trust values are assigned based on the past
performance of the nodes. Thus communication is always routed through the nodes
with higher trust values which will reduce the probability of message failure and enhance the
delivery ratio and throughput.
The rest of the paper is structured as follows. Section 2 describes related works of this
area .Section 3 presents the proposed system. Section 4 discusses the experimental work .Then
description of the performance discussion in section 5 and conclusion in section 6.
II. RELATED WORKS
In these days several researches have come up with several payment schemes including
tamper-proof-device (TPD)-based [4] and receipt-based schemes. In TPD-based payment
schemes, a TPD is installed in each node to store and manage its credit account and secure its
operation. In tamper proof-device (TPD) is any payment-based approach require some kind of
tamper proofness essential for guaranteeing the security process of the payment.
In Nuglets [4], the forwarded packets by a node are passed to the TPD to decrease and
increase the node’s credit account. In SIP [5] after getting data packets, the destination node
sends a RECEIPT packet to the source to issue a REWARD packet to increment credit count of
intermediate node.
In CASHnet [6], the credit account of the source node is charged and a signature is
attached to each packet. When the packet is received, the credit account of the destination
node is charged, and a digitally signed acknowledgement (ACK) packet is send back to the
source.TPD based schemes have lot of limitations. First the assumption that TPD can’t be
tampered with. But if the attacker can compromise with the TPD then he can communicate with
the TPD in an unnoticeable way.
To eliminate the use of TPDs, an offline central bank called the Accounting Center is
used to store and administer the nodes credit accounts. Different receipt based schemes [12] are
SPRITE, PIS, CDS, FESCIM, ESIP.
3. International Journal of Computer science and Engineering Research and Development (IJCSERD),
ISSN 2248- 9363 (Print), ISSN- 2248-9371 (Online) Volume 4, Number 2, April-June (2014)
36
In sprite [7] the source node signs the identities of the nodes in the route and the
message, and sends the signature as a proof for sending a message. The intermediate nodes
verify the signature, create receipts which contain the identities of the nodes in the path and the
source’s signature, and submit the receipts to the AC to get the payment. After verification AC
give the payments. The problem is the communication overhead
In FESCIM [8] the source and destination is charged, if they are interested in
communication. In PIS [9], the source adds a signature to each message and the destination
node acknowledges with a signed packet.
CDS [10] uses statistical methods to find the cheater nodes. Due to the nature of
statistical method some sincere node may incorrectly accused as cheater. Some cheaters may
not be recognized.
ESIP [11] suggests communication protocol that can be used for a payment scheme.
ESIP transmits messages from the source to destination node with limited number of public key
cryptography operation by integrating public key cryptography, identity based cryptography
and hash function. Comparing to PIS, ESIP needs less public key cryptography operations but
larger receipt size.
In proposed paper to avoid the communication and processing overhead of the existing
schemes introducing report based payment scheme and using a trust system to improve the
performance.
III. PROPOSED SYSTEM
In the proposed system the considered Multihop Wireless Network has an offline
Trusted party(TP), responsible for maintaining the nodes credit account.TP is also responsible
for cancel and update the certificate for nodes.ie, TP has Accounting Centre, Certificate
Authority and Trust centre. Trust centre is responsible for maintaining the trust value of the
node according to the no of relayed and dropped messages. Each node has to register with TP to
get symmetric key, public key/private key and certificate. Only registered nodes can
communicate each other. After the communication session the TP will verify the payment
report submitted by the nodes and clear the payments if the report is consistent. This scheme
can be used with any dynamic source routing protocol which set up end to end route before
sending the data.
As shown in fig.1 the payment scheme has 5 main phases. The first phase is
communication phase. In this Route is established through highly trusted nodes and data is
transmitted. Second is classifier which classifies the report into fair or cheating. From the
cheating report the trusted party will discover the cheaters by asking evidences from the
suspicious nodes. .This is fourth phase called Identifying cheaters. Then the trusted party evicts
the cheaters from the network. The next is credit account update .In this phase the correct credit
is assigned to all the nodes by trusted party. After the packet transmission the trust centre
assigns the trust value for the nodes, participated in the packet transmission.
4. International Journal of Computer science and Engineering Research and Development (IJCSERD),
ISSN 2248- 9363 (Print), ISSN- 2248-9371 (Online) Volume 4, Number 2, April-June (2014)
37
Fig.1 Architecture of proposed scheme
A. Communication
The communication phase includes 4 processes: Route establishment, Data
transmission, Evidence composition, payment composition/submission. The source node
broadcasts the route request which contains the source identity, Destination identity, Time
stamp and Time To live. Time To live means maximum number of intermediate nodes. The
route is established by considering the nodes that have high trust values. The node that relay
more messages in the past have high trust values. So during route establishment instead of
considering shortest path they will consider the route with nodes having high trust values as in
figure.2. So that chance of message dropping is less. The nodes that relay more messages have
high trust value. After route establishment data is transmitted and destination node replies with
acknowledgement. Then the intermediate node composes the evidences for data transmission.
All the nodes participated in data transmission compose payment report and submitted to the
trusted party.
Figure 2. Data transmission through high trusted nodes
5. International Journal of Computer science and Engineering Research and Development (IJCSERD),
ISSN 2248- 9363 (Print), ISSN- 2248-9371 (Online) Volume 4, Number 2, April-June (2014)
38
B. Classifier
When Accounting Centre obtains the session’s payment report it verifies them by
checking the consistency of the report and categorize them into fair or cheating. In the case of
fair report all the nodes will be submitting the correct payment report so all will be asking for
equal credits but for cheating report at least one node will submit incorrect payment report. Fair
report can be for complete and broken sessions. For fair report the trusted party will do payment
clearance immediately. The evidence is legal if the calculated proof is similar to the evidences.
C. Identifying Cheaters
The Trusted party processes the cheating report to identify the cheaters. The objective is
to avoid the attackers from stealing credits. The Trusted party asks evidence from the node
which requests more payment. In this way, the AC can precisely identify the cheating nodes
with requesting few Evidences .To verify the evidences the Trusted party creates the proof by
generating the nodes signature and hashing them. After identifying the cheaters the cheater
node is evicted from the network.
D. Credit Account Update
The Credit-Account Update phase obtains fair and corrected payment reports to update
the credit of the nodes.The payment clearance is done by charging and rewarding policy. For
the payment clearance the trusted party needs reports from all the nodes in the communication
session. When registration the trusted party will give a Public and 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.
E. Trust Value Update
The Trust centre assigns the trust value to the nodes that relayed the packets success fully in
the communication session. This trust value of the node is considered during the next route
establishment phase. Stationary nodes and nodes with large resources to spare will have higher
trust value .Nodes at the boundary are more likely to have lower trust value.
IV. EXPERIMENTAL WORK
All the nodes must be registered with the trusted third party, in order to issue
certificate for the nodes. In order to transmit the packets from source to destination the source
node produces route request which contains source node identity, destination identity, Time
stamp and TTL. Then the source node broadcast the request to all the intermediate nodes. The
intermediate node forwards this route request to the next intermediate node until it reaches the
destination. The destination node send route selection request to the trusted party to get a path
which has a high trust value. Once the path is established by the destination node the source
node transmit the packets to the destination node through the established route.
After transmitting the packets the nodes can request for the payment .So all the nodes
submit the payment report together to the trusted third party. The trusted third party verifies it.
If it is consistent means the report will be fair. But the attacker or cheater they will always
request for more payment without relaying the packet .So the trusted party can easily find out
the cheater by checking the consistency. The trusted party can ask for the evidence and if it is
6. International Journal of Computer science and Engineering Research and Development (IJCSERD),
ISSN 2248- 9363 (Print), ISSN- 2248-9371 (Online) Volume 4, Number 2, April-June (2014)
39
not valid then trusted party can assign a cheating count to the node. So during the next route
establishment the nodes having high cheating count is rarely considered.
V. PERFORMANCE DISCUSSION
The performance of proposed scheme is more in terms of throughput and packet
delivery ratio. Since this method assigns a trust value for the nodes according to the number of
messages relayed in the past and the packet transmission is through the high trust valued nodes,
the probability of dropping of messages will reduce. Since the payment clearance in report
based scheme is with almost no cryptographic operations, the processing overhead is less and
less payment delay is less. Since all the nodes submit the report together the report based
payment scheme reduces the communication overhead.
VI. CONCLUSION
The proposed system improves the performance of the network and provides a secure
payment scheme. In this there is a trust system which will assign trust value to each node that
relayed the packets more successfully in the past. The report based payment scheme eliminates
the communication and processing overhead of other payment schemes and the inclusion of
trust centre significantly improves the performance of the network since the data transmission
is routed through highly trusted nodes whenever possible.
REFERENCES
[1] 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
[2] 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.
[3] 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.
[4] 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.
[5] 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.
[6] A. Weyland, “Cooperation and Accounting in Multi-Hop Cellular etworks,” PhD
thesis, Univ. of Bern, Nov. 2005.
[7] S. Zhong, J. Chen, and R. Yang, “Sprite: A Simple, Cheat-Proof, Credit based System
for Mobile Ad-Hoc Networks,” Proc. IEEE INFOCOM ’03, vol. 3, pp. 1987-1997,
Mar./Apr. 2003.
[8] M. Mahmoud and X. Shen, “FESCIM: Fair, Efficient, and Secure ooperation Incentive
Mechanism for Hybrid Ad Hoc Networks,”IEEE Trans. Mobile Computing, vol. 11,
no. 5, pp. 753-766, May 2012.
7. International Journal of Computer science and Engineering Research and Development (IJCSERD),
ISSN 2248- 9363 (Print), ISSN- 2248-9371 (Online) Volume 4, Number 2, April-June (2014)
40
[9] M. Mahmoud and X. Shen, “PIS: A Practical Incentive System for Multi-Hop Wireless
Networks,” IEEE Trans. Vehicular Technology,vol. 59, no. 8, pp. 4012-4025, Oct.
2010.
[10] M. Mahmoud and X. Shen, “Stimulating Cooperation in Multihop Wireless Networks
Using Cheating Detection System,” Proc.IEEE INFOCOM ’10, Mar. 2010.
[11] Networks,” IEEE Trans. Mobile Computing, vol. 10, no. 7, pp. 997-1010, July 2011
[12] N. Salem, L. Buttyan, J. Hubaux, and M. Jakobsson, “Node Cooperation in Hybrid Ad
Hoc Networks,” IEEE Trans. Mobile Computing, vol. 5, no. 4, pp. 365-376, Apr.
2006.
[13] J. Pan, L. Cai, X. Shen, and J. Mark, “Identity-Based Secure Collaboration in Wireless
Ad Hoc Networks,” Computer Networks, vol. 51, no. 3, pp. 853-865, 2007