FORM 2

THE PATENTS ACT, 1970

(39 of 1970)&
THE PATENTS RULES, 2003
COMPLETE SPECIFICATION
(See section 10, rule 13)

1. TITLE OF THE INVENTION:

COMPUTER-IMPLEMENTED METHOD OF

PRIVACY-PRESERVING PROBABILISTIC ROUTING

WITH ADOPTED TECHNIQUES OF

INTERMITTENTLY CONNECTED MOBILE

NETWORKS
 2. APPLICANTS

3. PREAMBLE TO THE DESCRIPTION

COMPLETE SPECIFICATION
The following specification particularly describes the invention and the
manner in which it is to be performed.
 COMPUTER-IMPLEMENTED METHOD OF PRIVACY-PRESERVING
PROBABILISTIC ROUTING WITH ADOPTED TECHNIQUES OF
INTERMITTENTLY CONNECTED MOBILE NETWORKS

5 FIELD OF INVENTION

The present invention is related to computer networks and, particularly,

network having a communication protocol and which may have privacy
preserving source attribution & related method.
10 The present invention relates to a network probability routing method,
particularly, to a privacy-preserving probabilistic routing with adopted
techniques of intermittently connected mobile networks.
More particularly, the present invention relates to computer-implemented
method of privacy-preserving probabilistic routing with adopted techniques of
15 intermittently connected mobile networks.

BACKGROUND & PRIOR ART

The Privacy Preserving Routing Protocol (PPRP) is capable of enriching

20 efficient routing with minimum delay, least overhead, greater delivery rate and
also supports secure data communication in the distorted network ICMN. The
routing protocol lay around on the basis of Search and Spray (SAS). Each node
maintains a table, collecting the history of node encounters with the data packet.
As each node maintains a table providing the detailed information on all nodes
25 encountered during the transfer, a query on privacy on the stored data remains as
a constraint. The privacy here is termed as location privacy as the locations and
the data of each node is preserved or protected from the malicious attackers. As
the possibility of intruders or malicious nodes are prevalent, the identity i.e. the
location and hence the data held by each and every node in the network may be
 tracked, the necessity of location preservation is mandatory. PPRP unravels this
issue...
The PPRP profound secure and competent data transmission enchanting
location privacy in the network. Optimal results are obtained in the intermittent
5 network.Some of the work listed in the prior art is as follows:
US20140372749A1 presents device implemented, carrier independent
packet delivery universal addressing networking protocol for communication
over a network between network nodes utilizing a packet. The protocol has an IP
stack having layers. At least some of the layers have privacy preserving source
10 node attribution and network admission control. The packet is admitted to the
network only if a source node of the network nodes admits the packet.

US7778260B2 presents systems, and enables existing network

applications to run reliably in mobile environments. A Mobility Management
Server coupled to the mobile network maintains the state of each of any number
15 of Mobile End Systems and handles the complex session management required
to maintain persistent connections to the network and to other peer processes. If
a Mobile End System becomes unreachable, suspends, or changes network
address (e.g., due to roaming from one network interconnect to another), the
Mobility Management Server maintains the connection to the associated peer
20 task—allowing the Mobile End System to maintain a continuous connection
even though it may temporarily lose contact with its network medium. An
interface-based listener uses network point of attachment information supplied
by a network interface to determine roaming conditions and to efficiently
reestablish connection upon roaming.

25 CN109743728A presents Presents kind of mobile agency meeting

network route method of secret protection, includes the following steps: that (10)
network parameter is arranged: carrying out parameter setting to the mobile
community network including trust authority, fixed network, mobile node；(20)
anonymous node meets to record and generate: the anonymous node that meets
 is generated comprising node pseudo random identity, the record that meets at
moment of meeting；(30) router efficiency value obtains: being met record
according to anonymous node, anonymous node efficiency value of respectively
meeting is calculated；(40) node anonymous message of meeting forwarding:
5 compare anonymous node efficiency value size of meeting, message is
forwarded to the big node of efficiency value by the small node of efficiency
value. The mobile agency meeting network route method of secret protection of
the invention, not only effective protection node privacy information, .

US20190034235A1 presents Presents an apparatus comprises a

10 processor to: identify a workload comprising a plurality of tasks; generate a
workload graph based on the workload, wherein the workload graph comprises
information associated with the plurality of tasks; identify a device connectivity
graph, wherein the device connectivity graph comprises device connectivity
information associated with a plurality of processing devices; identify a privacy
15 policy associated with the workload; identify privacy level information
associated with the plurality of processing devices; identify a privacy constraint
based on the privacy policy and the privacy level information; and determine a
workload schedule, wherein the workload schedule comprises a mapping of the
workload onto the plurality of processing devices,

20 IN201611019150A - Defense Deployment System: Application of the

Delay Tolerant Network presents new border defense architecture involving bio
degradable nodes has been proposed by the usage of which the data transfer
between the army units takes place. As the border regions are the most sensitive
areas from where data pilferage can take place which may consequently result in
25 compromise of the security of the nation therefore we have used the nodes that
have a peculiar property of self-decomposition once its TTL is over, thereby
protecting the integrity of the message and going the next level in terms of
security of the message.
 KR101572414B1 - A Context Information-based Routing Scheme with
Energy-based Message Prioritization for Delay Tolerant Networks presents a
context information-based priority message routing scheme and a system for
recommending a social network on the basis of essential attribute information
5 and a method thereof. More specifically, the present invention relates to the
context information-based priority message routing scheme and the system for
recommending the social network on the basis of essential attribute information
and the method thereof, which has robustness, reliability, ability for unexpected
discovery, variety, privacy preservation and expandability, and can maintain
10 stability in case of false information or attack, and can preserve privacy by
performing a recommendation process of a user as increasing variety of a
recommendation list catalog on the basis of the ability and behavior of the user.

CN101291295B - Probabilistic routing method with limited time delay

based on intermittent communicated self-organizing network presents a
15 probability routing method applied in a discontinuously connected self-
organizing network. The basic thought of the invention is as follows: judgment
is made in advance whether to generate a message copy by utilization of the
statistic distribution rules for node movement in the discontinuously connected
self-organizing network and according to the required transmission probability
20 RDP and transmission delay determined by a user message; the value of the
required transmission probability RDP of the message copy generated is
calculated; and the RDP value in the source message is updated. The method
guarantees capability of transmitting the message within the determined
forwarding time, meets the required transmission probability (RDP) value
25 anticipated by a user, can control the transmission charges of the message
according to the RDP value and the forwarding time requirement, gets rid of
unnecessary message forwarding, and then effectively reduces the message
transmission charges in the discontinuously connected self-organizing network.

US9444751B1 - Backpressure with adaptive redundancy presents

30 technology includes routing packets through a network based on backpressure
 scheduling; when a number of packets in a transmitter queue satisfies a first
threshold, retaining copies of at least a portion of the packets; and once the
number of packets in the transmitter queue satisfies a second threshold,
transmitting the retained copies of the packets to perform the routing. Retaining
5 the copies can include copying a packet from the transmitter queue into a
duplicate buffer when the number of packets in the transmitter queues.

CN103648138B - Based on node speed variable of the WSN

opportunities routing method presents a WSN opportunity routing method based
on node speed variability and belongs to the technical field of wireless sensor
10 networking. A node changes movement speed of itself dynamically based on the
received signal intensity emitted by a sink node when the mobile sink arrives;
and during message forwarding, the message is directionally forwarded based on
speed gradient and thus a forwarding task from a source node to the sink node is
completed. Only speed is utilized to serve as a utility value in the method, so that
15 complexity is lowered, and since speed differences of nodes at different
distances from the sink node are large, the problem of poor forwarding reliability
in probability forwarding strategy does not exist..

US8880880B2 - Facilitating access control in peer-to-peer overlay

networks presents a privacy-preserving method is provided for matching
20 identities between a first peer node and a second peer node in a peer-to-peer
network. Such identity matching may be used, for example, to ascertain whether
the first peer node should provide access to certain digital object stored in the
peer-to-peer overlay network. Rather than providing its identities in an
unprotected format, the second peer may provide its identities to the first peer
25 node in a concealed representation so as to prevent the first peer from learning
about non-matching identities. Such concealed representation may be a data
structure that cryptographically conceals one or more identities of the second
peer node or a user of the second peer node within a shared data space of the
data structure.
 KR101572414B1 - A Context Information-based Routing Scheme with
Energy-based Message Prioritization for Delay Tolerant Networks presents the
context information-based priority message routing scheme and the system for
recommending the social network on the basis of essential attribute information
5 and the method thereof, which has robustness, reliability, ability for unexpected
discovery, variety, privacy preservation and expandability, and can maintain
stability in case of false information or attack, and can preserve privacy by
performing a recommendation process of a user as increasing variety of a
recommendation list catalog on the basis of the ability and behavior of the user
10 under a specific situation at a given time, and can induce prediction as to
tendency of a new user in social neighborhood relation connection, and can
reduce the time for computerizing the recommendation by that a connection
network among friends can induce specific interest related with an active user,
and direct and close friends can be sufficient social graph material used in the
15 prediction, and can compare distances of source node (SN), intermediate node
(IN) and destination node (DN) in real-time on the basis of direction, speed and
current position thereof through a routing scheme through message connection

CN105282161B - IPv6 network based on random stateless address

allocation strategy of the point-to-point anonymous communication method
20 presents a point-to-point anonymous communication method based on random
stateless address distributing policies in an IPv6 network and belongs to the
Internet technical field. Based on an onion routing anonymous communication
mechanism, the IPv6 address of a node is changed periodically through an
improved IPv6 address algorithm and by means of a huge IPv6 address space,
25 and therefore, privacy leakage caused by an IPv6 address identifier can be
avoided; and cross-network segment hiding and data encryption of the IPv6
address can be ensured through the onion routing mechanism..

US20190180047A1 - Method and System of Preserving Privacy for

Usage of Lightweight Block chain Clients presents a lightweight block chain
30 client in a block chain network includes using, in a full block chain node of the
 block chain network, a secure software guard extensions (SGX) enclave. A
request is received from the lightweight block chain client for a setup of a secure
network connection. A client unique ID is received from the lightweight block
chain client, and is acknowledged following a successful attestation by the
5 lightweight block chain client. A request is received from the lightweight block
chain client for transaction(s)/address(is) of the lightweight block chain client.
The SGX enclave loads and searches unspent transaction outputs (UTXO) from
a memory of the full block chain node..

Groupings of alternative elements or embodiments of the invention

10 disclosed herein are not to be construed as limitations. Each group member can
be referred to and claimed individually or in any combination with other
members of the group or other elements found herein. One or more members of
a group can be included in, or deleted from, a group for reasons of convenience
and/or patentability. When any such inclusion or deletion occurs, the
15 specification is herein deemed to contain the group as modified thus fulfilling
the written description of all Markus groups used in the appended claims.

As used in the description herein and throughout the claims that follow,
the meaning of “a,” “an,” and “the” includes plural reference unless the context
clearly dictates otherwise. Also, as used in the description herein, the meaning of
20 “in” includes “in” and “on” unless the context clearly dictates otherwise.

The recitation of ranges of values herein is merely intended to serve as a

shorthand method of referring individually to each separate value falling within
the range. Unless otherwise indicated herein, each individual value is
incorporated into the specification as if it were individually recited herein. All
25 methods described herein can be performed in any suitable order unless
otherwise indicated herein or otherwise clearly contradicted by context.

The use of any and all examples, or exemplary language (e.g. “such as”)
provided with respect to certain embodiments herein is intended merely to better
illuminate the invention and does not pose a limitation on the scope of the
 invention otherwise claimed. No language in the specification should be
construed as indicating any non-claimed element essential to the practice of the
invention.

The above information disclosed in this Background section is only for

5 enhancement of understanding of the background of the invention and therefore
it may contain information that does not form the prior art that is already known
in this country to a person of ordinary skill in the art.

OBJECTIVE OF THE INVENTION

10 The principle objective of the present invention is to provide computer-

implemented method of privacy-preserving probabilistic routing with adopted
techniques of intermittently connected mobile networks..

SUMMARY

15 The present invention discloses a related to a computer-implemented

method of privacy-preserving probabilistic routing with adopted techniques of
intermittently connected mobile networks, wherein the intermittently connected
mobile networks comprises plurality of nodes for communication to each other ,
the computer-implemented method comprising steps of Sending an initial
20 challenge to plurality of nodes for authentication; Shifting the nodes which
completed the initial challenges to a friend list of nodes; Shifting the nodes
which not completed the initial challenges to a question mark list of nodes;
Providing rating of nodes of the friend list of nodes on the basis of the amount of
data they transfer through themselves and according to the rating of other
25 friends, which is obtained during the friend list sharing process; and Choosing a
delivery delay as an optimized metric.
.
 BRIEF DESCRIPTION OF DRAWINGS

To clarify various aspects of some example embodiments of the present

invention, a more particular description of the invention will be rendered by
5 reference to specific embodiments thereof which are illustrated in the appended
drawings. It is appreciated that these drawings depict only illustrated
embodiments of the invention and are therefore not to be considered limiting of
its scope. The invention will be described and explained with additional
specificity and detail through the use of the accompanying drawings.
10 In order that the advantages of the present invention will be easily
understood, a detailed description of the invention is discussed below in
conjunction with the appended drawings, which, however, should not be
considered to limit the scope of the invention to the accompanying drawings, in
which:
15 Figure 1 shows an exemplary representation of an example of overview of
PPRP, according to present invention.
Figure 2 shows Illustration of the challenge of computer-implemented
method of privacy-preserving probabilistic routing with adopted techniques of
intermittently connected mobile networks , according to present invention.
20
DETAIL DESCRIPTION

The present invention disclosure is related to a computer-implemented

method of privacy-preserving probabilistic routing with adopted techniques of
25 intermittently connected mobile networks.
The computer-implemented method of privacy-preserving probabilistic routing
with adopted techniques of intermittently connected mobile networks, wherein the
intermittently connected mobile networks comprise plurality of nodes for
communication to each other.
30 The computer-implemented method comprising steps of sending an initial
challenge to plurality of nodes for authentication then shifting the nodes which
 completed the initial challenges to a friend list of nodes is performed. The nodes which
not completed the initial challenges are shifted to a question mark list of nodes.
The question mark list of nodes is the list of the malicious nodes, it signifies
mistrust on the node, and it is subsequently not used in the routing process. The
5 question mark list also stores the nodes which degrade from the position of friend node
by performing malicious activities. The question mark list also stores the nodes which
degrade from the position of friend node by performing malicious activities.
The rating of nodes of the friend list of nodes on the basis of the amount of data is
provided & they transfer through themselves and according to the rating of other
10 friends, which is obtained during the friend list sharing process; and a delivery delay is
chose as an optimized metric.
The Rating of nodes of the friend list of nodes is on a scale of zero to ten. The
Data Rating is the rating given to nodes after they transmit some amount of data for the
source node.
15 A Friend Sharing Request is a control packet which is used to initiate friend
sharing. The node receiving this packet replies with the nodes in its friend list,
unauthenticated list and the question mark list.
Algorithm Description
Friend based algorithm using Challenges to Establish Security
20 accomplishes establishment of friend networks (Chlamtac et al 2003).The
algorithm is divided into the following four Stages as: Challenge your
neighbour, Rate Friends, Share Friends and Route through friends. The
routing of data in the protocol is on demand; that is whenever the need
arises. But challenges, friend sharing and rating are periodic processes.
25 This makes the protocol hybrid one.
Challenge your neighbour
Challenge is a mechanism to authenticate nodes initially when
no criterion is present. It is basic test which a node has to complete in
order to prove its honesty and integrity. Let us assume that the node
30 challenges its neighbour node.
 STEP: 1 When the network is newly initialized, each node Isa
stranger to another. Thus each node incorporates its
neighbours in the unauthenticated list.
STEP: 2 The node A picks one of the neighbours B, and performs the
5 usual Share Friends Stage.
STEP: 3 As a response the neighbour node B either sends its friend
list or the nodes from its unauthenticated list if the friend list
is empty.
STEP: 4 On receiving the list, the node a picks up a node which it can
10 reach on its own and in the most efficient way. Let us say
that this node is C.
STEP: 5 Now the node A has two ways to reach the node; one
through B and another through a route already known to it.
STEP: 6 The node A initiates a challenge and encrypts it with the
15 public key of C. It then sends it through both routes. A also
includes its own public key with the challenge.
STEP: 7 The node B sees the challenge as a normal data packet and
routes it. As C decrypts the data packet and finds that it is a
challenge it responds to the challenge. It then encrypts the
20 response with A’s public key that it obtained in STEP 6.
STEP: 8 A receives the result of the challenge from both routes and
after decrypting, it compares them. If they are same then
node A adds node B at the bottom of its friend list.
In this way, node A can authenticate node B as a node which is
25 behaving genuinely at least initially. Fig. 2 gives an illustration of how
the challenge is initiated by An on B disguised as a data packet for C. The
challenge is also routed through D to C. And the results obtained are
compared to arrive at a decision about the node B.
 Figure 2 shows Illustration of the challenge of computer-implemented
method of privacy-preserving probabilistic routing with adopted techniques of
intermittently connected mobile networks , according to present invention.
Description of the Challenge
5 Each node is initialized with a pair of large prime integers (a, b)
which is secret to that node (Wang & Zhang 2002). When a node wants to
send a challenge to a particular node it sends one of his random prime
numbers to it and expects response in return.
The challenge process takes the following four steps for node a
10 challenging node B.
STEP: 1 A is initialized with (a, b) and C is initialized with (c, d).
STEP: 2 When A challenges B, as described above. It sends a random
prime number “n” as the challenge.
STEP: 3 C computes cd mod n and sends the result to the two paths.
15 STEP: 4 A compares the result from the two paths to arrive at a
decision on B as described above.
Since n, c and d are all very large prime numbers it is
impossible to determine c and d from the result of the mod functions that
is known to be a hard problem. In this way, the nodes can authenticate
20 each other through the challenge process. As the newly initialized nodes
authenticate each other and a robust network of friends is formed, it
becomes very difficult for a new malicious node to authenticate itself.
Rate friends
Friends are rated on a scale of zero to ten. Initially each node
25 has only their friend nodes in their friend list that completed the challenge
successfully. Sharing of friend nodes is done in the Share Friends stage as
the friend relation is transitive in nature that is if A is a friend of B and B
is a friend of C; A includes C in his friend list too. Each friend in the list
 haste following three classes of ratings: Data Rating (DR), Friend Rating
(FR) and Net Rating (NR).
a. Data rating
The data rating is updated by a node for its friend on the basis
5 of amount of data it transfers for it (Zapata&Asokan 2002). Thesis a
significant metric for judging the quality of the node, as it portrays its
battery power and general capacity to forward data packets. The DR of a
friend node varies according to the number of data packets transferred
through it. The net DR is calculated as a moving average of the last five
10 data ratings. The following equation describes the moving average relation
between a data rating and the previous five data ratings:

(2.13)
The DR for a particular session is calculated as
15 (2.14)

Where x is the number of data packets transmitted and is the factor by

which the number of data packets is related to the rating. The moving
average is a significant tool to estimate the recent quality of node in terms
of data forwarding. When a node drops data packets, the negative value of
20 DR is computed as as the number of data packets dropped. The
exponential scaling on the number of data transferred is an effective tool
to scale according to the requirements of the network. We can change the
value of according to the volume of data that is transferred trough the
network. Keeping a value (of 1/100) ensures smooth scaling from 1 to 10
25 for data packets up to 200with a data rating of around 6 for 100 packets.
As we increase the value of , the curve increases DR quickly towards the
 maximum value 10. As is decreased it smoothens the DR along the range
of the data packets.

b. Friend Rating
5 During the Friend Sharing stage a node A asks for the friend
list of node B and incorporates the rating of friends in the following way.
1. If node A and node B have a common friend C, then node A
obtains the rating of the node C from node B as

10 Obtained Rating = ((Net Rating of B in list of A * Net Rating of C in list of B) /

10)
The idea behind this equation is to incorporate the trust that
node has on
Node while obtaining the rating of node from it.
15

2. After the Friend Sharing Process has finished, each node

adds up the OR from various nodes and divides them with
the sum of the rating of those nodes from which it obtained
the OR. In other words, the FR is the weighted average of
20 the Net Ratings obtained during the Friend Sharing stage,
where the weights are the Net rating of the friend responding
to a particular Friend Sharing request.

c. Net Rating
25 FR represents the opinion of the friends of particular node
towards the integrity of another node, while Represents a personal opinion
of a node derived on the basis of previous data sessions. Both these ratings
are important as certain nodes could be selectively malicious. By
 combining these two values we arrive at a more holistic metric called as
the Entreating.

The Net Rating (NR) would be a weighted mean of the two

5 ratings as given below:
NR = ((W1 * DR + W2 * FR) / (W1 + W2)) (2.15)
Where it would be the weights assigned to DR and Irrespectively. The
values of NR are network dependant and can be learnt with experience
(Johnson &Maltz1996). The Friend Rating not only helps to counter the
10 selective behaviour of malicious nodes towards different nodes but also
helps to propagate good will about certain nodes. Say a node C which is a
common friend of both node A and node B could not participate in the
data session for node A, but at the same time it did a lot of work for the
node B. Thus the Net Rating of node C for node A incorporates the work
15 that node C did for node B.
Share friends
Friend sharing is a periodic process which is chiefly
responsible for the security of the algorithm (Haniotakis et al 2004). To
accomplish friend sharing, a control packet FREQ (Friend sharing
20 Request) is used. The node receiving the FREQ replies to the nodes in its
friend list with unauthenticated list and the question mark list. The rules
for friend sharing are as follows.
1. Any node can ask for a friend sharing request.
2. After friend sharing, challenges are initiated for those nodes
25 which were not in the friend list. The challenge process has
been described above.
3. If a node is already in the friend list the node updates its friend
list.
 Let us consider that the node a shares a list with the node Bathe
the friend sharing process is carried out as follows.
STEP: 1 As the network is initialized each node starts the friend
sharing process, which leads up to a challenge to start with
5 the formation of friend list.
STEP: 2 If the node B is in the list of node A, then if a particular
friend of node B is not presents in the list of node A, then the
node A includes it in its list and initializes the Friend Rating
as the Obtained Rating from B and the Data Rating to Zero.
10 Net Rating is calculated on the basis of predetermined
weights.
STEP: 3 If the node B is in the list of node A, and if a particular
friend of node B is present in the list of node A then the
Friend Rating is calculated as described earlier.
15 After the friend sharing process is complete a node may start
data session or may sit idle.
Data rating through friends
Data routing through friends takes places as follows.

20 STEP: 1 When a node wants to transmit to a particular destination, it

initiates a Route Request message within the network. It
includes the number of data packets to be sent in the Route
Request option.
STEP: 2 When it receives the Route Reply messages from the
25 network. It evaluates the route available to the destination
node on the basis of its friend list. The Route Reply
messages contain the public key of the destination node. The
public key and private key pair is randomly generated at the
source and destination nodes.
 STEP: 3 It routes data through the best possible route and waits for a
back-off interval to obtain an acknowledgement of the
number of data packets received by the destination.
Destination uses multiple routes to transfer this information
5 to the source node, so that it is received positively.
STEP: 4 If the source finds that the number of data packets received
at the destination is equal to the amount that it sent, it
increases the Data Rating of the nodes in the path, for which
it is a friend as discussed in the Friend Rating section.
10 STEP: 5 If the source finds that some data packets were dropped or
receives no acknowledgement from the destination it
initiates a Sequential Challenge.
STEP: 6 If the results of the Sequential Challenge indicate that a
particular node was deliberately misbehaving, it terminates
15 that node from its friend list and moves it to the question
mark list.
STEP: 7 If all nodes complete the challenge successfully, the source
infers that there is some data loss due to unintended
behaviour. This happens as a packet from the destination is
20 initiated which indicates the number of data packets
received. This packet follows the original path to source and
each node attaches the number of packets it had transferred
to its neighbour node.
STEP: 8 On receiving the packet, the source can evaluate that packet
25 loss had occurred at which nodes, and it decreases the rating
of the nodes in its friend list as discussed in section
pertaining to Data Rating.
 Route Evaluation
When the source node receives various Route Reply messages
it evaluates the route on the basis of the following criteria
i. It calculates the minimum net rating value of a node in each
5 route. It selects the route having the maximum value of the
minimum net rating of a node in the route.
ii. If the value obtained in step i) is the same for two or more
routes, it calculates the mean value of the ratings of the route
and selects the route with the maximum mean.
10 iii. If the mean comes out to be the same, quality of the route is
calculated as follows.
The node calculates the mean value of the Net Ratings of the
nodes in the route. It divides this value of mean with the quality factor of
the route (Nebula et al 2008). Where, the quality factor of the route is
15 nothing but the divergence from the mean. Greater the divergence lesser is
the quality of the route. The Quality Factor can be calculated in several
ways, as follows.
i.Standard Deviation
ii.Mean Absolute Deviation (MAD)
20 Where MAD is a robust measure of scale. These scales are used to replace
the conventional estimates of scale such as the sample variance or sample
standard deviation.
Sequential Challenges

When a source discovers that the data was not transmitted

25 properly it initiates a sequential challenge (Hu et al 2005). To explain it let
us consider the path as S -> A -> B -> C -> D, where S and D are the
source and the destination nodes and A, B and C are the intermediate
 nodes. On discovering data transmission problem after waiting for a back
off interval the following process takes place.
STEP: 1 The source challenges node A. If it is not able to complete
the challenge it removes it from the friend list and places it
5 in the question mark list. It then tries to route the data
through the next best path.
STEP: 2 If A successfully completes the challenge, it challenges its
neighbour and reports the result backward to A. Node a then
takes action similar to Step 1.
10 STEP: 3 Similarly, if the node B is also authenticated, it challenges its
neighbour node C and reports backwards to node A.
STEP: 4 If every node is authenticated then node D gets to know the
result of the sequential authentication, when node C tries to
authenticate it. It responds to it and sends a backward
15 message attaching the number of data packets received by it.
Since everyone is authenticated no one lies, and attaches the
corresponding packets truthfully. The source thus comes to
know where the packet drops has taken place.
During the sequential challenge process, no node would be able
20 to detect whether it is a sequential challenge or a regular friend sharing
process till it is authenticated. And thus a malicious node would be caught
in the process and eliminated from the list of trusted nodes.

.
25 Balram Singh
Patent Agent IN/PA/2661
Agent for Applicant
Dated 18th Day of October, 2019
 CLAIMS

We claim:

5 1. A computer-implemented method of privacy-preserving probabilistic

routing with adopted techniques of intermittently connected mobile
networks, wherein the intermittently connected mobile networks
comprises plurality of nodes for communication to each other , the
computer-implemented method comprising steps of:
10 Sending an initial challenge to plurality of nodes for authentication;
Shifting the nodes which completed the initial challenges to a friend list
of nodes;
Shifting the nodes which not completed the initial challenges to a
question mark list of nodes;
15 Providing rating of nodes of the friend list of nodes on the basis of the
amount of data they transfer through themselves and according to the
rating of other friends, which is obtained during the friend list sharing
process; and
Choosing a delivery delay as an optimized metric.
20
2. The computer-implemented method of privacy-preserving probabilistic
routing with adopted techniques of intermittently connected mobile
networks as claimed in claim 1, the question mark list of nodes is the list
of the malicious nodes, it signifies mistrust on the node, and it is
25 subsequently not used in the routing process.
3. The computer-implemented method of privacy-preserving probabilistic
routing with adopted techniques of intermittently connected mobile
networks as claimed in claim 1, the question mark list also stores the
nodes which degrade from the position of friend node by performing
 malicious activities. The question mark list also stores the nodes which
degrade from the position of friend node by performing malicious
activities.
4. The computer-implemented method of privacy-preserving probabilistic
5 routing with adopted techniques of intermittently connected mobile
networks as claimed in claim 1, The Rating of nodes of the friend list of
nodes is on a scale of zero to ten.

5. The computer-implemented method of privacy-preserving probabilistic

routing with adopted techniques of intermittently connected mobile
10 networks as claimed in claim 1, A Friend Sharing Request is a control
packet which is used to initiate friend sharing. A node receiving this
packet replies with the nodes in its friend list, unauthenticated list and
the question mark list.
6. The computer-implemented method of privacy-preserving probabilistic
15 routing with adopted techniques of intermittently connected mobile
networks as claimed in claim 1, Data Rating is the rating given to nodes
after they transmit some amount of data for the source node.

20
.

Balram Singh
Patent Agent IN/PA/2661
Agent for Applicant
25 Dated 18th Day of October, 2019
 COMPUTER-IMPLEMENTED METHOD OF PRIVACY-
PRESERVING PROBABILISTIC ROUTING WITH
ADOPTED TECHNIQUES OF INTERMITTENTLY
5 CONNECTED MOBILE NETWORKS

ABSTRACT

10
The present invention disclosure is related to computer-implemented

method of privacy-preserving probabilistic routing with adopted techniques of

intermittently connected mobile networks. The objective of the present invention

to provide overcomes the inadequacies of the prior art in routing with of

15 intermittently connected mobile networks.

Balram Singh
Patent Agent IN/PA/2661
20 Agent for Applicant
Dated 18th Day of October, 2019