B4 SDC

Department of CSE A Blockchain system for secure data collection in MANETs
St. Ann’s College of Engineering & Technology Page 1


A Blockchain system for secure data collection in MANETs

A MAIN PROJECT
Submitted in Partial fulfillment of the
Requirements for the award of the Degree of
BACHELOR OF TECHNOLOGY
In
COMPUTER SCIENCE & ENGINEERING
By
Udatha Sri Lahari Shaik Shafeen
(19F01A05I1) (19F01A05G6)
Shaik Mohammad Johny Pattipati Harisha
(19F01A05G3) (19F01A05D6)
Under the esteemed guidance
of
N. Lakshmi Narayana
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
ST.ANN’S COLLEGE OF ENGINEERING & TECHNOLOGY
CHIRALA
2019-23

ST.ANN’S COLLEGE OF ENGINEERING & TECHNOLOGY

CHIRALA
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
CERTIFICATE
This is to certify that the mini project entitled, “A Blockchain System For Secure Data
Collection in MANETs” is being submitted by U. Sri Lahari, Sk. Shafeen, Sk. Mohammad
Johny, P. Harisha bearing Regd. No. 19F01A05I1,19F01A05G6,19F01A05G3,19F01A05D6
in partial fulfillment of the requirement for the award of the degree of B.Tech. in Computer
Science & Engineering, Jawaharlal Nehru Technological University Kakinada is a record of
bonafide work carried out by him under my guidance and supervision. The results presented in
this project have been verified and are found to be satisfactory.
Guide Head of the Department
N. Lakshmi Narayana Dr. P. Harini
External Examiner
ACKNOWLEDGEMENT
The successful completion of any task is not possible without proper suggestion, guidance and
environment. Combination of these three factors acts like backbone to my project titled
“B4SDC: A Blockchain System for Secure Data Collection in Manets”
We express my sincere thanks to my guide “N.Lakshmi Narayana” and to the HOD of the
Department of Computer Science and Engineering, Dr. P. Harini for her valuable suggestions during
our course period, timely help, guidance and providing us with the most essential materials required
for the completion of this work.
We are thankful to all teaching and non-teaching staff of the Department of Computer Science &
Engineering for the cooperation given for the successful completion of our project.
We would like to thank our principal, Dr. M. Venu Gopala Rao for providing support and
simulating environment. We would like to express our gratitude to the Management of St. Ann’s
College of Engineering & Technology for providing me a pleasant environment and excellent
laboratory facilities.
ABSTRACT

Security-related data collection is an essential part for attack detection and security measurement
in Mobile Ad Hoc Networks (MANETs). A detection node (i.e., collector) should discover
available routes to a collection node for data collection and collect security-related data during
route discovery for determining reliable routes. However, few studies provide incentives for
security-related data collection in MANETs. In this article, we propose a blockchain system for
security-related data collection in MANETs. Through controlling the scale of Route REQuest
(REQ) forwarding in route discovery, the collector can constrain its payment and simultaneously
make each forwarder of control information obtain rewards as much as possible to ensure
fairness. At the same time, this system avoids collusion attacks with cooperative receipt
reporting, and spoofing attacks by adopting a secure digital signature. Based on a novel Proof-of-
Stake consensus mechanism by accumulating stakes through message forwarding, this system
not only provides incentives for all participating nodes, but also avoids forking and ensures high
efficiency and real decentralisation.

LIST OF FIGURES
FIGURE No. NAME OF THE FIGURE PAGE No.
1.1 System Models 12
LIST OF ABBREVIATIONS

MANET’S -- Mobile Adhoc Netwroks
DAG’s -- Directed Acyclic Graphs
PoUW -- Proof of Useful Work
SHA -- Secure Hash Algorithm
TABLE OF CONTENTS
Contents Page No.

CERTIFICATE
ACKNOWLEDGEMENT
ABSTRACT
LIST OF FIGURES
LIST OF TABLES
LIST OF ABBREVIATIONS
Chapter 1 : INTRODUCTION…………………………………………………......11
1.1 Introduction ……………………………………………………….…………11
1.2 Objective of the Thesis ……………………………………………………….13
1.3 Scope of the Project …………………………………………………………..13
Chapter 2: LITERATURE SURVEY………………………………………..….……14
2.1 Basic concepts ……………………………………………………….……..….15

2.1.1 SHA ………………………………..………………………………..15
2.1.2 Time Stamp ………………………………..….……………………..15
2.1.3 Decentralization ……………………………………………………..15
2.1.4 A Digital Signature ………………………………………………….15
2.1.5 Immutality …………………………………………………………..15
2.1.6 HASH ………………………………………………………………15
2.2 Related work (Literature Survey) ………………………………………..…16
2.2.1 Secure Data Creation…………………………………………….…16
2.2.2 Secure Data Sharing………………………………….…………….17
2.2.2 Secure Data Deletion……………………………………….…….…18
2.2.2 Data Security in the Creation Phase……………………….……….18
2.3. Drawbacks of the existing systems……………………………………………19

Chapter 3: PROPOSED WORK & REQUIREMENT ANALYSIS ……………..20

3.1 Proposed Work & Analysis…………………………………………………20
3.2 Software Requirements …………………………………………………….23
3.3 Hardware Requirements ……………………………………………..........23
Chapter 4: REFERENCES ………………………………………………………..24
CHAPTER-1
INTRODUCTION

1.1 Introduction
MANET suffers from different attacks due to selforganization
1. In order to provide a secure and high-quality networking service, security-related data collection
becomes essential for network attack detection and security measurement. Security-related data, in short
security data, are the data that can be used to discover network threats and measure its security. In data
collection, after receiving the request of a collector or detection node, collection nodes send it sensed
security data
2. Due to no fixed infrastructure in MANETs, nodes cooperate to forward the request and security data.
In order to ensure efficient collection, a collector should discover available routes to collection nodes
through route discovery, so that the request and security data can be transmitted via these routes.
However, the route discovery suffers from various attacks, e.g., wormhole and rushing attacks.
3. Existing detection mechanisms can help a collector to detect these attacks and select reliable routes, but
the collector should analyze security data provided by the forwarders of control information for making
decisions, e.g., the timestamps of receiving and sending a message, the location of forwarders.
Unfortunately, few studies provide incentives for security data collection in MANETs. Forwarders might
not be willing to sense and provide security data due to extra overload, selfishness, etc., so that the
collector could not collect sufficient security data for detection. As a result, the accuracy of threat
detection and security measurement cannot be ensured. Current incentive mechanisms mainly make use
of reputation and micropayment systems .
4. However, the present studies in this field are still facing a number of issues to be applied into security
data collection in MANETs. First, these mechanisms do not consider spoofing attacks that an attacker
launches for maximizing its profits. Second, reputation systems might not resist collusion attacks raised
by the selfish nodes with a high reputation and do not specify the type of incentive (e.g., what profit can
be brought by a high reputation.) Third, micropayment systems allow a collector to pay to collection
nodes and forwarders for their cooperation and contributions, but most of them require a trusted third
party to manage debiting and crediting accounts. This kind of design is obviously infeasible for MANETs
since such a trusted third party is hard to be deployed. Fourth, in some micropayment systems for route
discovery, a source node pays control information forwarders, but cannot constrain its payment, which is
caused by an uncontrolled RREQ forwarding scale.
5. In addition, some existing systems allow the source node to only pay the forwarders in discovered
routes, which is unfair to the nodes that have participated in route discovery but are not in the routes.

6. In order to solve above issues, a distributed incentive system for security data collection is highly
expected, which should resist spoofing, collusion and excessive forwarding, and feature fairness, and
should not rely on a trusted third party. We found that blockchain is a candidate technology to help
achieving the above goals due to its advantages, e.g., transparency, immutability, and self-organization. In
a blockchain system, a miner collects transactions, generates a block and provides it to other miners with
a proof of work (e.g., the proof of computing and storage) to gain the majority of acceptance, which is
called consensus. In general, the incentive for miners is provided in a form of digital tokens, e.g., bitcoin
At the same time, the transaction can help incenting security data collection.
Fig1.1:- System models
However, the blockchain itself is still facing many technical challenges, namely forking, low efficiency
and a trend of centralization. Based on the current literature review [6], consensus mechanisms mainly
include Proof of Work (PoW), Byzantine Faulty Tolerant (BFT), Proof of Sake (PoS), Proof of Useful
Work (PoUW) and Trees and Directed Acyclic Graphs (DAGs). PoW and PoUW take the risk of
temporary forking due to network latency. PoW wastes a lot of resources since it is a meaningless task. Its
transaction confirmation time is long, thus negatively impacting its throughput. PoW and PoUW take the
risk of centralization due to the outsourceability of tasks. Because PoS consumes almost no resources, a
miner might create two blocks to cause forking. Many BFT based consensus mechanisms focus on
scalability, but they provide no incentives for miners. Trees and DAGs can replace the chain structure of
blockchain for ensuring a high throughput and avoiding double spending, but some trees and DAGs based

consensus mechanisms also employ PoW, thus suffering from the same problems of PoW, namely
forking, low efficiency and the risk of centralization. In this paper, we propose B4SDC, a blockchain
system that provides incentives for security data collection in a distributed way in MANETs. Through
controlling the scale of RREQ forwarding in route discovery, a collector can constrain its payment and
simultaneously make each forwarder of control information obtain rewards as much as possible to ensure
fairness. At the same time, B4SDC avoids collusion attacks with cooperative receipt reporting, and
spoofing attacks by adopting a secure digital signature. Based on a novel Proof-ofStake consensus
mechanism by accumulating stakes through message forwarding, B4SDC not only provides incentives for
all participating nodes, but also avoids forking and ensures high efficiency and real decentralization at the
same time. With above ways, B4SDC successfully avoids collusion and spoofing attacks, allows
collectors to control their maximum payments, and ensures fairness for collection participants as much as
possible. It also solves current blockchain systems’ main problems, namely forking, low efficiency and
centralization. Specifically, the contributions of this paper can be summarized as follows. B4SDC
provides incentives for collection participants. It encourages nodes to forward control information that
includes security data in route discovery. After routes are discovered, the nodes in selected routes are
incented to forward the request of a collector and the security data of collection nodes. B4SDC removes
the need for a trusted third party in many micropayment systems by adopting blockchain.
It adopts a secure digital signature for signing sent messages, thus avoiding spoofing attacks. At the same
time, B4SDC allows collection participants to cooperatively report their received receipts to miners for
gaining rewards, thus resisting against collusion attacks and ensuring fairness for all collection
participants as much as possible. In addition, a collector can constrain the scale of RREQ forwarding in
the route discovery, thus it can balance its budget.
B4SDC provides a novel consensus mechanism. Block creation is proposed to ensure the distribution and
efficiency of blockchain by avoiding the simultaneous generation of many valid blocks and reducing
communication burdens. Single block winner selection is performed to make B4SDC free from forking
when multiple valid blocks are created at the same time.
1.2 Objective of thesis

The goal of the project is to allow digital information to be recorded and distributed, but not edited.

In this way, a blockchain is the foundation for immutable ledgers, or records of transactions that cannot
be altered, deleted, or destroyed.
This is why blockchains are also known as a distributed ledger technology
1.3 Scope of the project
Based on a novel Proof-of-Stake consensus mechanism by accumulating stakes through message

forwarding, B4SDC not only provides incentives for all participating nodes, but also avoids forking and
ensures high efficiency and real decentralization.
One of the significant issues discussed in this paper is the authenticity of the data exchanged between two
mobile nodes.
This is of considerable concern when MANET applications supporting streaming applications are
integrated with an IoT.
CHAPTER-2
LITERATURE SURVEY
2.1 Basic Concepts

 The SHA (Secure Hash Algorithm) Family designates a family of six different hash
functions: SHA-0, SHA-1, SHA-224, SHA-256, SHA-384, and SHA-512 [7, 8]. They
take variable length input messages and hash them to fixed-length outputs.
 Timestamp timestamp is a small data stored in each block as a unique serial and whose
main function is to determine the exact moment in which the block has been mined and
validated by the network. blockchain.
 Smart contracts work by following simple “if/when…then…” statements that are

written into code on a blockchain. A network of computers executes the actions when
predetermined conditions have been met and verified. These actions could include
releasing funds to the appropriate parties, registering a vehicle, sending notifications, or
issuing a ticket. The blockchain is then updated when the transaction is completed. That
means the transaction cannot be changed, and only parties who have been granted
permission can see the results.
 Decentralization Blockchain does not rely on any third-party management institution or

hardware facilities. Each node realizes the self verification, transmission and
management of information through distributed accounting and storage.
 A digital signature is an electronic, encrypted, stamp of authentication on digital

information such as email messages, macros, or electronic documents. A signature
confirms that the information originated from the signer and has not been altered
 Immutability is defined as the ability of a blockchain ledger to remain unchanged,

unaltered, and indelible. Each of the blocks of information like facts or transaction details
is carried out with the help of a cryptographic principle or a hash value.
 Hash is a function that meets the encrypted demands needed to solve for a blockchain
computation. Hashes are of a fixed length since it makes it nearly impossible to guess the
length of the hash if someone was trying to crack the blockchain. The same data will
always produce the same hashed value

2.2 Related Work
The data must be secure throughout the life cycle of the data here are the existing works that are
proposed in some phases oh the data life cycle :
2.2.1 Secure Data Creation
A safe, flexible and efficient data storage and retrieval system based on both fog computing and
cloud computing techniques is designed in Liu et al. (2020). In terms of data refinement, data
organization, searchable encryption and dynamic data collection, the main challenges are
summarized, and appropriate solutions are also offered. A tree of retrieval functions is designed
to support effective and efficient privacy preserving data search, precise data retrieval and an
Data labeling for data security in data lifecycle .
index encryption scheme based on the secure kNN algorithm are suggested. From a broader
view, a flowchart including data mining and remote control is also presented.
According toLiu et al. (2020), the authors proposed a blockchain framework in MANETs for
security-related data collection. The collector can restrict its payment by controlling the scale of
Route REQuest (RREQ) forwarding in route discovery and at the same time make every
forwarder of control information (namely RREQs and Route REPlies, short RREPs) receive
rewards as much as possible to ensure fairness. In parallel, the system avoids collision threats by
implementing a secure digital signature with cooperative receipt reporting and spoofing attacks.
The system not only offers rewards for all participating nodes but also prevents forking and
ensures high efficiency and true decentralization, based on a novel Proof-of-Stake consensus
mechanism by accumulating stakes by message forwarding.
A new data collection scheme called Secure Data was proposed in Tao et al. (2018) to provide
data protection and to protect the rights of the personal data of patients. The authors presented
the KATAN secret cipher algorithm to secure communication and implement it on the FPGA
hardware platform. Authors apply secret cipher sharing and share repairing for the privacy of the

KATAN cipher. The evaluation shows that the Secure Data scheme when applied to attacks, can
be effective in terms of frequency, energy cost, and overall computational cost.
In Zhang et al. (2018), A secure data collection system based on compressive sensing (SeDC)
was proposed , to improve data privacy through the asymmetric semi homomorphic encryption
system and reduces the cost of computation through a sparse compressive matrix. The
asymmetric mechanism reduces the complexity of distribution and control the secret key.
Homomorphic encryption allows cipher domain in-network aggregation while improving
security and achieving network load balancing. The sparse measuring matrix reduces both the
computation cost and communication cost, which compensates for the increasing cost caused by
homomorphic encryption.
2.2.2 Secure Data Sharing
IN Michelin et al. (2018) ,The authors proposed an advanced secure and privacy-preserving data
sharing system for smart cities based on blockchain. The proposed system ensures that personal
user data is protected, safely stored, and accessible to stakeholders on the need to know the
basis of smart contracts embedded in user- defined ACL laws.Besides, they developed a system
called ”PrivyCoin” in the form of a digital token for users to share their data with
stakeholders/third parties,Also a ”PrivySharing” was presented to satisfies some criteria of the
EU GDPR, such as data asset sharing, usability, and data owner consent purge. The experimental
results in the paper confirmed that a solution for multi-Ch blockchain scales better than a single-
Ch blockchain system .
In a similar endeavor Eltayieb et al. (2020), A blockchain-based data usage auditing architecture
that provides the data controllers with unforgeable evidence of users’ consent was presented .
The researchers claim to provide user anonymity by allowing data owners (delegated to PKG) to
create a distinctive public-private key pair for each smart contract they enter into with a service
provider or data processor to share data.In addition, hierarchical ID-based encryption was used to
avoid unauthorized disclosure. The data stored on off-blockchain storage, while blockchain
smart contracts are used to store the hash of data and data usage policy.There is also a particular
smart contract between the data holder and Any other provider of services or processor of data.

2.2.3 Secure data deletion
Authors proposed in Xue et al. (2019) an effective attribute revocation scheme based on Merkle
Hash Tree for assured data deletion. When the cloud server receives the deletion request from a
user,the associated files will be re-encrypted using the re-encryption key created by the trust
authority. In parallel, a new root of the Merkle Hash Tree will be sent to the data owner
according to attribute revocation, so that he can check that the data has been successfully
deleted. In addition,for Data Deletion Validation,cloud data can also be accessed by other users.
A fine grained data deletion system was built by Yang et al. (2019) to prevent fraudulent
tampering with data from cloud servers and hackers as well as incomplete data deletion of cloud
service providers. Also,the rank-based Merkle Hash Tree chain is added to verify if the data
block is altered or removed on behalf of the user.
In Yang et al. (2020) ,They proposed a fine-grained outsourced data deletion scheme based on
invertible Bloom filter, which can achieve both public and private verifiability of the storage and
deletion results. Users can easily recognize the malicious activities of the cloud server with an
overwhelming probability if the cloud server does not honestly maintain/delete the data and
produce corresponding evidence. Meanwhile, the computational complexity is independent of
the number of outsourced data blocks in data deletion and deletion outcome verification
procedures, which makes the proposed scheme ideal for the large-scale data deletion scenario.
2.2.4 Data security in the creation phase
Here is a table that summarizes all the security issues found in the collection phase. What we can
summarize is that, in the stage of collection, the data must be protected. If data is collected
indiscriminately, then the source of the data is unclear and noisy data is collected. As a result,
these datasets affect the data exploitation and analysis phases and can have serious consequences
in terms of reliability and the results obtained.
Also, as a lot of unstructured data is collected, there is a need to classify it properly, as

mentioned in the articles Rahul et Banyal (2020)Binjubeir et al. (2019). Therefore, at the
collection stage, one of the main challenges is to properly filter and classify the data so as not to

compromise its reliability . Also, when the data provider provides the data, control of the data
moves away from the provider. Therefore, it is necessary to guarantee data protection .
Tabrizchi et Kuchaki Rafsanjani (2020) by ensuring that users know whether they are correctly
used. What attracted us to this literature is the problems related to CID (confidentiality,
availability, and integrity Rahul et Banyal (2020)Dissanayake (2021) Kumar et al. (2018)Yadav
et Behera (2020) and a new problem of traceability mentioned in the article Binjubeir et al.
(2019) which has a strong relationship with our research. The latter plays a major role in data
protection. Data traceability is the process of tracking data access, values, and changes as it
moves through its life cycle.without it we cannot ensure that the security criteria are respected or
the data is not altered during its life cycle. Indeed, this literature pushed us to do research in this
direction and especially to see how we can trace to secure the data and process the traceability of
the data in our future solution.
2.3 Drawbacks of the existing system
 Centralized servers are constrained to a single location and can easily fail. Because
blockchains are distributed across many computers, however, they can almost never go
down. Thanks to the blockchain, it's extremely unlikely that cryptocurrencies like Bitcoin
will ever stop working.
 Highly dependent on the network connectivity – The system can fail if the nodes lose
connectivity as there is only one central node.
 No graceful degradation of the system – abrupt failure of the entire system.
 Less possibility of data backup.
CHAPTER-3
PROPOSED WORK & REQUIREMENT ANALYSIS

3.1 Proposed work and analysis

In our proposed protocol the identifier ID of a node is generated from its public key using a
secure one-way hash function. In addition, the public keys and ID of the nodes are distributed
before the deployment of the MANET. As a result, a node cannot change its ID within the
lifetime of a MANET. Therefore, impersonation attacks or unauthorized participation is not
International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.1, January
2014 124 possible. In our proposed secure routing protocol, as the source/destination node signs
the RREQ/ RREP packet using the private key of the source/ destination node, a malicious node
will not be

able to modify the route sequence number. As RREQ/ RREP packets are signed by the each
intermediate node, a malicious node cannot change the value of the hop count field. Due to
similar reason, a malicious node cannot change the source/ destination address of a packet. In the
first scenario, node IDs are cached and the routing messages are signed by them. The source/
destination node verifies the authenticity of each node on the route. In the second scenario,
authentication is done in hop-by-hop and end-to-end manner. Therefore, two or more malicious
nodes cannot collaborate to make the tunnel. In the proposed scheme, messages are signed by the
nodes on the route at the time of route maintenance. Therefore, a malicious node cannot falsely
inject route error message to the source. In our proposed secure transmission control protocol, all
the segments are sent along the message authentication code (MAC) [ tags. A MAC tag is a short
piece of information used to authenticate a message and to provide integrity and authenticity
assurances on the message. Integrity assurances detect accidental and intentional message
changes, while authenticity International Journal of Computer Networks & Communications
(IJCNC) Vol.6, No.1, January 2014 125 assurances affirm origin of the message. Here, the MAC
tag is generated using a hash function, a session secret key and an arbitrary-length message.
Further, a node cannot hide and change its ID

or the ID cannot be spoofed by any other nodes in the network. This makes the SYN flooding
attack difficult for an attacker. Initial sequence number (ISN) is generated by the source and the
destination nodes from a monotonically increasing random number (R) and a hash function of
source port, destination port, node identifiers of the source and destination nodes, and a session
secret key KSD. Therefore, a malicious node may not be able to guess the initial sequence
number (ISN) and therefore cannot hijack the session or launch ACK storm in the MANET. As
the scheme uses either signature (in case of secure routing protocol) or MAC (in case of secure
transmission control protocol) for authentication, message forging is not possible. Therefore, the
attacks associated with AODV and TCP are not possible. An attack may be possible if an
attacker is somehow able to generate a public/ private key pair that is exactly similar to an
authorized node in the network. This probability is 1=2k , where k is the size of the public key.
For k = 1024 bits, it can be seen that the probability is extremely low and is almost impossible
within a small life time of MANET. As our proposed protocol uses identity-based cryptography,
it does not need certificate for authentication. Further, public keys along with IDs of the nodes
are distributed before the deployment of the MANET. Thus it eliminates the need of sending the
public key with the packet. Since the SAS-based scheme is based on plain RSA, its per-signer
signature generation cost is equivalent to that of a plain RSA signature. However, following are
the overheads of our proposed protocols:

• Each node has to maintain the list of public keys along with IDs of other nodes in the network.
• In Case 1, IDs and signatures of all the nodes in the route are required to be cached. However,
the signature expands by one bit per signers that is if the number of signers is t, then the
signature expands by t-bit here.
• Each node has to verify its predecessor and sign the messages. Source/destination node has to
verify all the nodes on the route in Case 1.
• To generate the session key for a session, each time encryption and decryption has to be done
by the source node and the destination node respectively.
It may be noted here that our proposed protocol may not detect attacks from internal or
compromised malicious nodes. It requires trust based protocol as a second wall of defence to
detect attacks by internal malicious nodes.
3.2 SOFTWARE REQUIREMENTS

 1. VS Code
 2. Python
 3. Ganache
 4. Truffle Suite
 5. Solidity
 6. Web3
 7. Visual Studio with C++ Toolchain
3.3 MINIMUM HARDWARE REQUIREMENTS

 1. Laptop with Windows 11
 2. RAM: 16GB
 3. ROM: Min. 50GB
 4. Internet Adapter: 100Mbps

CHAPTER-4
REFERENCES
[1] C. Perkins, E. Belding-Royer, and S. Das, “Ad hoc on-demand distance vector (aodv)
routing,” draftietf-manet-aodv-11.txt, June 2002 (work in progress).
[2] J. Kim and G. Tsudik, “Srdp: securing route discovery in dsr,” in Mobile and Ubiquitous
Systems: Networking and Services, pp. 247–258, July 2005.
[3] K. Sanzgiri, B. Dahill, B. Levine, C. Shields, and E. Belding-Royer, “A secure routing

protocol for ad hoc networks,” in Proceedings of 10th IEEE International Conference on
Network Protocols and ICNP’02, pp. 78–87, IEEE Computer Society, 2002.
[4] Y.-C. Hu, A. Perrig, and D. B. Johnson, “Ariadne: A secure on-demand routing protocol for
ad hoc networks,” in Proceedings of the 8th Annual ACM International Conference on Mobile
Computing and Networking (MobiCom ’02), September 2002.
[5] P. Papadimitratos and Z. J. Haas, “Secure routing for mobile ad hoc networks,” in
Proceedings of SCS Communication Networks and Distributed Systems Modeling and
Simulation Conference (CNDS 2002), January 27-31 2002.
[6] M. Zapata and N. Asokan, “Securing ad hoc routing protocols,” in Proceedings of the ACM
Workshop on Wireless Security (WiSe), September 2002.
[7] U. Ghosh and R. Datta, “Sdrp: Secure and dynamic routing protocol for mobile ad hoc
networks,” IET Networks, 2013 (Accepted).
[8] B. Wu, J. Chen, J. Wu, and M. Cardei, “A survey of attacks and countermeasures in mobile
ad hoc networks,” in Wireless Network Security, Springer US, 2007.
[9] W. Diffie and M. E. Hellman, “New directions in cryptography,” in IEEE Trans. Inf. Theory,
vol. IT22, pp. 644–654, November 2006.
[10] A. Perrig, R. Canetti, D. Song, and J. Tygar, “Efficient and secure source authentication for
multicast,” in Proceedings of Network and Distributed System Security Symposium and
NDSS’01, pp. 35–46, February 2001.

[11] P. P. Papadimitratos and Z. J. Haas, “Secure Data Communication in Mobile Ad Hoc

Networks,” IEEE Journal on Selected Areas in Communications, vol. 24, no. 2, pp. 343–356,
2006.
[12] H. Hsieh and R. Sivakumar, “Transport overwireless networks,” in Handbook of Wireless

Networks and Mobile Computing, Edited by Ivan Stojmenovic. John Wiley and Sons, 2002.
[13] Q. Zheng, X. Hong, J. Liu, and L. Tang, “A secure data transmission scheme for mobile ad
hoc networks,” in Proceedings of the IEEE Global Telecommunications Conference
(GLOBECOM), pp. 1006 –1010, November 2007.
[14] “Ip security protocol (ipsec).” http://www.ietf.org/html.charters/ipsp-charter.html.
[15] K. K. Ramakrishnan, S. Floyd, D. Black, and G. K. Ramakrishnan, “The addition of explicit

congestion notification (ecn) to ip,” 2001.
[16] R. de Oliveira and T. Braun, “Tcp in wireless mobile ad hoc networks,” tech. rep., 2002.
[17] R. P. C. Kaufman and M. Speciner, “Network security private communication in a public

world,” in Handbook of Wireless Networks and Mobile Computing, Prentice Hall PTR, A
division of Pearson Education, 2002.
International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.1, January
2014 127 [18] U. Ghosh and R. Datta, “A secure dynamic ip configuration scheme for mobile ad
hoc networks,” Ad Hoc Networks, vol. 9, no. 7, pp. 1327 – 1342, 2011.
[19] U. Ghosh and R. Datta, “Idsddip: a secure distributed dynamic ip configuration scheme for
mobile ad hoc networks,” International Journal of Network Management, vol. 23, no. 6, pp. 424–
446, 2013.
[20] U. Ghosh and R. Datta, “Adip: an improved authenticated dynamic ip configuration scheme
for mobile ad hoc networks,” International Journal of Ultra Wideband Communications and
Systems, vol. 1, no. 2, pp. 102–117, 2009. [
21] H. Shacham, “Sequential aggregate signatures from trapdoor homomorphic permutations,”

2003.

[22] A. Lysyanskaya, S. Micali, L. Reyzin, and H. Shacham, “Sequential aggregate signatures

from trapdoor permutations,” in Advances in Cryptology EUROCRYPT 2004, pp. 74–90,
Springer-Verlag, 2004.
[23] R. C. M. Bellare and H. Krawczyk, “Keying hash functions for message authentication,”
Advances in Cryptology Crypto 96 Proceedings, vol. Springer- Verlag, pp. 1–15, 1996. [24] P.
Chatterjee, “Trust based clustering and secure routing scheme for mobile ad hoc networks,”
IJCNC Journal, vol. 1, no. 2, pp. 84–97, 2009.

B4 SDC

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

B4 SDC

Uploaded by

Copyright:

Available Formats

Department of CSE A Blockchain system for secure data collection in MANETs

St. Ann’s College of Engineering & Technology Page 1

St. Ann’s College of Engineering & Technology Page 2

A Blockchain system for secure data collection in MANETs

Submitted in Partial fulfillment of the

Requirements for the award of the Degree of

COMPUTER SCIENCE & ENGINEERING

Udatha Sri Lahari Shaik Shafeen

Shaik Mohammad Johny Pattipati Harisha

Under the esteemed guidance

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

ST.ANN’S COLLEGE OF ENGINEERING & TECHNOLOGY

St. Ann’s College of Engineering & Technology Page 3

ST.ANN’S COLLEGE OF ENGINEERING & TECHNOLOGY

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Johny, P. Harisha bearing Regd. No. 19F01A05I1,19F01A05G6,19F01A05G3,19F01A05D6

Science & Engineering, Jawaharlal Nehru Technological University Kakinada is a record of

this project have been verified and are found to be satisfactory.

Guide Head of the Department

N. Lakshmi Narayana Dr. P. Harini

“B4SDC: A Blockchain System for Secure Data Collection in Manets”

for the completion of this work.

St. Ann’s College of Engineering & Technology Page 5

efficiency and real decentralisation.

St. Ann’s College of Engineering & Technology Page 6

FIGURE No. NAME OF THE FIGURE PAGE No.

1.1 System Models 12

St. Ann’s College of Engineering & Technology Page 7

MANET’S -- Mobile Adhoc Netwroks

DAG’s -- Directed Acyclic Graphs

PoUW -- Proof of Useful Work

SHA -- Secure Hash Algorithm

Contents Page No.

St. Ann’s College of Engineering & Technology Page 8

2.1 Basic concepts ……………………………………………………….……..….15

St. Ann’s College of Engineering & Technology Page 9

Chapter 3: PROPOSED WORK & REQUIREMENT ANALYSIS ……………..20

Chapter 4: REFERENCES ………………………………………………………..24

St. Ann’s College of Engineering & Technology Page 10

St. Ann’s College of Engineering & Technology Page 11

Fig1.1:- System models

St. Ann’s College of Engineering & Technology Page 12

1.2 Objective of thesis

St. Ann’s College of Engineering & Technology Page 13

This is why blockchains are also known as a distributed ledger technology

1.3 Scope of the project

Based on a novel Proof-of-Stake consensus mechanism by accumulating stakes through message

2.1 Basic Concepts

 Smart contracts work by following simple “if/when…then…” statements that are

 Decentralization Blockchain does not rely on any third-party management institution or

 A digital signature is an electronic, encrypted, stamp of authentication on digital

 Immutability is defined as the ability of a blockchain ledger to remain unchanged,

St. Ann’s College of Engineering & Technology Page 15

2.2 Related Work

2.2.1 Secure Data Creation

St. Ann’s College of Engineering & Technology Page 16

2.2.2 Secure Data Sharing

St. Ann’s College of Engineering & Technology Page 17

2.2.3 Secure data deletion

2.2.4 Data security in the creation phase

Also, as a lot of unstructured data is collected, there is a need to classify it properly, as

St. Ann’s College of Engineering & Technology Page 18