Mitigating Routing Misbehavior in Disruption Tolerant Networks

Li, Qinghua; Cao, Guohong

doi:10.1109/tifs.2011.2173195

Cited by 73 publications

(52 citation statements)

References 30 publications

(45 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Security and privacy in mobile sensing systems have been addressed by many works (e.g., [13][14][15][16]), but they do not consider aggregation of data. There are many existing works (e.g., [17]) on privacy-preserving data aggregation, but most of them assume a trusted aggregator.…”

Section: Related Workmentioning

confidence: 99%

Efficient Privacy-Preserving Stream Aggregation in Mobile Sensing with Low Aggregation Error

Cao

2013

Privacy Enhancing Technologies

Self Cite

View full text Add to dashboard Cite

Abstract. Aggregate statistics computed from time-series data contributed by individual mobile nodes can be very useful for many mobile sensing applications. Since the data from individual node may be privacy-sensitive, the aggregator should only learn the desired statistics without compromising the privacy of each node. To provide strong privacy guarantee, existing approaches add noise to each node's data and allow the aggregator to get a noisy sum aggregate. However, these approaches either have high computation cost, high communication overhead when nodes join and leave, or accumulate a large noise in the sum aggregate which means high aggregation error. In this paper, we propose a scheme for privacy-preserving aggregation of time-series data in presence of untrusted aggregator, which provides differential privacy for the sum aggregate. It leverages a novel ring-based interleaved grouping technique to efficiently deal with dynamic joins and leaves and achieve low aggregation error. Specifically, when a node joins or leaves, only a small number of nodes need to update their cryptographic keys. Also, the nodes only collectively add a small noise to the sum to ensure differential privacy, which is O(1) with respect to the number of nodes. Based on symmetric-key cryptography, our scheme is very efficient in computation.

show abstract

Section: Related Workmentioning

confidence: 99%

Efficient Privacy-Preserving Stream Aggregation in Mobile Sensing with Low Aggregation Error

Cao

2013

Privacy Enhancing Technologies

Self Cite

View full text Add to dashboard Cite

show abstract

“…System Model. In this paper, we adopt the system model similar to the literature [13,14]. We consider DTN with no trusted authorization center, which is different from [7] in that it exists with a periodically available TA (trusted authority).…”

Section: System Model and Design Goalsmentioning

confidence: 99%

“…Therefore, we adopt vector and node meet, they exchange the trusted routing tables TRT , TRT with each other. After the update operation, as shown in Table 3, the trusted routing tables TRT , TRT of node and node contain five row vectors send trusted routing table TRT to node ; (8) receive trusted routing table TRT from node ; (9) end (10) while ∀ ∈ TRT ∩ TRT do (11) if TRT ⋅ ⋅ TwID > TRT ⋅ ⋅ TwID then (12) verify the validity of the signature Sig ; (13) if Sig is valid then (14) update row vector in trusted routing table TRT ; (15) TRT ⋅ = TRT ⋅ ; (16) TRT ⋅ ⋅ TwID = TRT ⋅ ⋅ TwID; (17) TRT ⋅ Sig = TRT ⋅ Sig ; (18) end ( Robustness Analysis. In the building and updating process of the trusted routing table, the malicious node may modify the trusted routing table to forge high trust value and message forwarding ratio.…”

Section: Building and Updating Trusted Routingmentioning

confidence: 99%

A Security and Efficient Routing Scheme with Misbehavior Detection in Delay-Tolerant Networks

Feng

Lü

et al. 2017

Security and Communication Networks

View full text Add to dashboard Cite

Due to the unique network characteristics, the security and efficient routing in DTNs are considered as two great challenges. In this paper, we design a security and efficient routing scheme, called SER, which integrates the routing decision and the attacks detection mechanisms. In SER scheme, each DTNs node locally maintains a one-dimensional vector table to record the summary information about the contact with other nodes and the trust degree of other nodes. To obtain the global status and the contact relationship among all nodes, the trusted routing table consisting of vectors of all nodes is built in each DTNs node. The method for detecting malicious nodes and selfish nodes is proposed, which exploits the global summary information to analyze the history forwarding behavior of node and judge whether it is a malicious node or selfish node. The routing decision method is proposed based on trust degree of forwarding messages between nodes, which adopts trust degree as relay node selection strategy. Simulation results show that compared with existing schemes SER scheme could detect the attacks behavior of malicious nodes and selfish nodes, at the same time, with higher delivery rate and lower average delivery delay.

show abstract

“…This node can detect whether the node has dropped packets based on the reported records. To detect consistency, a small part of each contact record is disseminated to selected nodes, collect appropriate contact records and detect misbehaving nodes with certain probability [5].…”

Section: Related Workmentioning

confidence: 99%

Performance Evaluation of Attack Detection Algorithms in Delay Tolerant Networks

Rajashri¹,

Manesh²

2017

IJCA

View full text Add to dashboard Cite

So that it uses store, carry and forward mechanism to transfer the data from one node to other node. Delay tolerant networks (DTNs) are characterized by delay and intermittent connectivity, due to this, malicious nodes drops all or a part of the received messages. This dropping behavior is known as blackhole and greyhole attacks respectively. Existing research scheme can detect individual attackers well but they cannot handle the case where attackers cooperate to avoid the detection. So that SDBG scheme implements an algorithm to detect individual attacks with collusion attack. The simulation result shows the protocol reduces the delivery delay using RAPID protocol by detecting collusion attacks that is simulated using the ONE simulator. General TermsDelay Tolerant Network, Blackhole attack, Greyhole attack, DTN routing.

show abstract

Mitigating Routing Misbehavior in Disruption Tolerant Networks

Cited by 73 publications

References 30 publications

Efficient Privacy-Preserving Stream Aggregation in Mobile Sensing with Low Aggregation Error

Efficient Privacy-Preserving Stream Aggregation in Mobile Sensing with Low Aggregation Error

A Security and Efficient Routing Scheme with Misbehavior Detection in Delay-Tolerant Networks

Performance Evaluation of Attack Detection Algorithms in Delay Tolerant Networks

Contact Info

Product

Resources

About