Abstract: A method and a system are provided for facilitating secure routing of data packets in a wireless sensor network. In an embodiment, the method facilitates assigning a first trust value to each of a plurality of sensor nodes in the wireless sensor network based on a threshold value. A second trust value of each of the plurality of sensor nodes is determined. The second trust value is indicative of a power requirement for maintaining a transmission rate of the data packets. The assigned first trust value of each of the plurality of sensor nodes is compared to each of the determined second trust values of the corresponding plurality of sensor nodes. Further, in response to determination of a negative deviation of the comparison of at least one of a sensor node, declaring the at least one of the sensor node as a malicious sensor node.
[0001] The present invention relates generally to a method for communication between nodes in a wireless sensor network and, more particularly, to a method for determining a secure wireless transmission amongst the nodes.
BACKGROUND
[0002] Features of Wireless Sensor Networks (WSNs) such as open and harsh environment, open medium, various important applications, and other factors make WSNs susceptible to different attacks. Routing is one of the most important operations in wireless sensor networks (WSNs) as it deals with data delivery to base stations. Routing attacks can cripple the network easily and degrade the operation of WSNs significantly.
[0003] Although traditional security mechanisms such as cryptography and authentication can provide protection at some level, they alone cannot cope with compromised node attacks. Once a node is compromised, it can launch attacks according to orders from the outside, which might cripple or control the whole WSNs. For example, a malicious node can attract the data from other nodes to it through different means and once it started to receive the data, it can drop all or randomly received data, which significantly degrade performance of the routing protocol. To cope with such kind of nodes is to monitor and detect them. Since there is no central authority in WSNs, nodes should monitor and detect malicious nodes in a distributed manner.
[0004] There is therefore a need to provide a mechanism to establish secure routing, especially against compromised nodes through trust establishment. The mechanism of trust establishment detects trustworthy and untrustworthy nodes by evaluating them on the basis of their past behavior/performance, and avoids untrustworthy nodes and selects only trustworthy in a routing operation.
OBJECTS OF THE PRESENT DISCLOSURE
[0005] Some of the objects of the present disclosure aimed to ameliorate one or more problems of the prior art or to at least provide a useful alternative are listed herein below.
[0006] An object of the present disclosure is to provide a method that facilitates to identify and remove routing attacks from a wireless sensor network using an intrusion detection mechanism.
[0007] An object of the present disclosure is to provide a method that facilitates to maintain a record of parameters that are used to determine trust values of a routing path.
[0008] An object of the present disclosure is to provide a method that facilitates in providing a reliable and optimal routing path leading to increase throughput, decrease in packet delays and reduced packet drop in a wireless sensor network.
[0009] Another object of the present disclosure is to provide a method that facilitates in increasing quality of service (QoS) in terms of reliability and security of a wireless sensor network.
SUMMARY OF THE INVENTION
[00010] The present invention relates generally to a method for communication between nodes in a wireless sensor network and, more particularly, to a method for determining a secure wireless transmission amongst the nodes.
[00011] According to an aspect of the present disclosure is provided a method for facilitating secure routing of data packets in a wireless sensor network, said method comprising: assigning, at a processor of a computing device associated with the wireless sensor network, a first trust value to each of a plurality of sensor nodes in the wireless sensor network based on a threshold value, the threshold value being indicative of a predefined power requirement for maintaining a transmission rate of the data packets; determining, at the processor, a second trust value of each of the plurality of sensor nodes, the second trust value being indicative of a power requirement for maintaining a transmission rate of the data packets; comparing, at the processor, the assigned first trust value of each of the plurality of sensor nodes to each of the determined second trust values of the corresponding plurality of sensor nodes; and in response to determination of a negative deviation of the comparison of at least one of a sensor node, declaring, at the processor, the at least one of the sensor node of the plurality of sensor nodes as a malicious sensor node and facilitating secure routing of the data packets in the wireless sensor network.
[00012] According to an embodiment, a cluster head is determined from the plurality of sensor nodes based on the threshold value.
[00013] According to an embodiment, the threshold value comprises information related to a shortest distance between the determined cluster head and a sink node of the plurality of sensor nodes, a degree of mobility of a sensor node of the plurality of sensor nodes, a residual energy of the sensor node of the plurality of sensor nodes, and count of the plurality of sensor nodes.
[00014] According to an embodiment, in response to the determination of the negative deviation taking the malicious node out of the wireless sensor network.
[00015] According to an embodiment, upon the declaration of the sensor node of the plurality of sensor nodes as the malicious node, disassociating, at the processor, the connection of the malicious sensor node with associated one or more sensor nodes of the plurality of sensor nodes.
[00016] According to an embodiment, upon the disassociation of connection of the malicious sensor node with associated one or more sensor nodes, the one or more sensor nodes are connected to each other such that the data packets are transmitted in the wireless sensor network.
[00017] According to an embodiment, upon the declaration of the sensor node of the plurality of sensor nodes as the malicious node, declaring, at the processor, occurrence of a routing attack at the wireless sensor network.
[00018] According to an embodiment, the malicious node is any of a sensor node of the plurality of the sensor nodes and a cluster head of the plurality of the sensor nodes.
[00019] According to an embodiment, the first trust value and the second trust value is analyzed and trained using a set of pre-defined set of instructions.
[00020] According to an aspect of the present disclosure is provided a system for facilitating secure routing of data packets in a wireless sensor network, said system comprising: a processor operatively coupled to a memory, the memory storing a set of instructions executed by the processor to: assign a first trust value to each of a plurality of sensor nodes in the wireless sensor network based on a threshold value, the threshold value being indicative of a predefined power requirement for maintaining a transmission rate of the data packets; determine a second trust value of each of the plurality of sensor nodes, the second trust value being indicative of a power requirement for maintaining a transmission rate of the data packets; compare the assigned first trust value of each of the plurality of sensor nodes to each of the determined second trust values of the corresponding plurality of sensor nodes; and in response to determination of a negative deviation of the comparison of at least one of a sensor node, declare, at the processor, the at least one of the sensor node of the plurality of sensor nodes as a malicious sensor node and facilitating secure routing of the data packets in the wireless sensor network.
[00021] Various objects, features, aspects and advantages of the present disclosure will become more apparent from the following detailed description of preferred embodiments, along with the accompanying drawing figures in which like numerals represent like features.
BRIEF DESCRIPTION OF THE ACCOMPANYING DRAWINGS
[00022] In the figures, similar components and/or features may have the same reference label. Further, various components of the same type may be distinguished by following the reference label with a second label that distinguishes among the similar components. If only the first reference label is used in the specification, the description is applicable to any one of the similar components having the same first reference label irrespective of the second reference label.
[00023] FIG. 1 illustrates exemplary dual functional phases for secure routing of data packets in accordance with an embodiment of the present disclosure.
[00024] FIG. 2 illustrates exemplary flow of data packets in a wireless sensor network in accordance with an embodiment of the present disclosure.
[00025] FIG. 3 illustrates exemplary implementation of flow of data packets in a wireless sensor network in accordance with an embodiment of the present disclosure.
DETAILED DESCRIPTION
[00026] In the following description, numerous specific details are set forth in order to provide a thorough understanding of embodiments of the present invention. It will be apparent to one skilled in the art that embodiments of the present invention may be practiced without some of these specific details.
[00027] Embodiments of the present invention may be provided as a computer program product, which may include a machine-readable storage medium tangibly embodying thereon instructions, which may be used to program a computer (or other electronic devices) to perform a process. The machine-readable medium may include, but is not limited to, fixed (hard) drives, magnetic tape, floppy diskettes, optical disks, compact disc read-only memories (CD-ROMs), and magneto-optical disks, semiconductor memories, such as ROMs, PROMs, random access memories (RAMs), programmable read-only memories (PROMs), erasable PROMs (EPROMs), electrically erasable PROMs (EEPROMs), flash memory, magnetic or optical cards, or other type of media/machine-readable medium suitable for storing electronic instructions (e.g., computer programming code, such as software or firmware).
[00028] While embodiments of the present invention have been illustrated and described, it will be clear that the invention is not limited to these embodiments only. Numerous modifications, changes, variations, substitutions, and equivalents will be apparent to those skilled in the art, without departing from the spirit and scope of the invention, as described in the claim.
[00029] The present invention relates generally to a method for communication between nodes in a wireless sensor network and, more particularly, to a method for determining a secure wireless transmission amongst the nodes.
[00030] According to an aspect of the present disclosure is provided a method for facilitating secure routing of data packets in a wireless sensor network, said method comprising: assigning, at a processor of a computing device associated with the wireless sensor network, a first trust value to each of a plurality of sensor nodes in the wireless sensor network based on a threshold value, the threshold value being indicative of a predefined power requirement for maintaining a transmission rate of the data packets; determining, at the processor, a second trust value of each of the plurality of sensor nodes, the second trust value being indicative of a power requirement for maintaining a transmission rate of the data packets; comparing, at the processor, the assigned first trust value of each of the plurality of sensor nodes to each of the determined second trust values of the corresponding plurality of sensor nodes; and in response to determination of a negative deviation of the comparison of at least one of a sensor node, declaring, at the processor, the at least one of the sensor node of the plurality of sensor nodes as a malicious sensor node and facilitating secure routing of the data packets in the wireless sensor network.
[00031] According to an embodiment, a cluster head is determined from the plurality of sensor nodes based on the threshold value.
[00032] According to an embodiment, the threshold value comprises information related to a shortest distance between the determined cluster head and a sink node of the plurality of sensor nodes, a degree of mobility of a sensor node of the plurality of sensor nodes, a residual energy of the sensor node of the plurality of sensor nodes, and count of the plurality of sensor nodes.
[00033] According to an embodiment, in response to the determination of the negative deviation taking the malicious node out of the wireless sensor network.
[00034] According to an embodiment, upon the declaration of the sensor node of the plurality of sensor nodes as the malicious node, disassociating, at the processor, the connection of the malicious sensor node with associated one or more sensor nodes of the plurality of sensor nodes.
[00035] According to an embodiment, upon the disassociation of connection of the malicious sensor node with associated one or more sensor nodes, the one or more sensor nodes are connected to each other such that the data packets are transmitted in the wireless sensor network.
[00036] According to an embodiment, upon the declaration of the sensor node of the plurality of sensor nodes as the malicious node, declaring, at the processor, occurrence of a routing attack at the wireless sensor network.
[00037] According to an embodiment, the malicious node is any of a sensor node of the plurality of the sensor nodes and a cluster head of the plurality of the sensor nodes.
[00038] According to an embodiment, the first trust value and the second trust value is analyzed and trained using a set of pre-defined set of instructions.
[00039] According to an aspect of the present disclosure is provided a system for facilitating secure routing of data packets in a wireless sensor network, said system comprising: a processor operatively coupled to a memory, the memory storing a set of instructions executed by the processor to: assign a first trust value to each of a plurality of sensor nodes in the wireless sensor network based on a threshold value, the threshold value being indicative of a predefined power requirement for maintaining a transmission rate of the data packets; determine a second trust value of each of the plurality of sensor nodes, the second trust value being indicative of a power requirement for maintaining a transmission rate of the data packets; compare the assigned first trust value of each of the plurality of sensor nodes to each of the determined second trust values of the corresponding plurality of sensor nodes; and in response to determination of a negative deviation of the comparison of at least one of a sensor node, declare, at the processor, the at least one of the sensor node of the plurality of sensor nodes as a malicious sensor node and facilitating secure routing of the data packets in the wireless sensor network.
[00040] Referring to the drawings, the invention will now be described in more detail.
[00041] FIG. 1 illustrates exemplary dual functional phases at 100 for secure routing of data packets in accordance with an embodiment of the present disclosure.
[00042] In an embodiment, secure routing of data packets in a wireless sensor network is disclosed. The disclosure provides a secure path for routing of data packet from source to destination in the wireless sensor network. This disclosure facilitates identification of routing attack as well as removal of attack from the wireless sensor network. A database is maintained to keep record of important information or parameters used to determine trust values of a routing path. The information can be stored on cloud or may be stored at a local server. Further, actual value and threshold value of the sensor nodes is maintained. The actual value of the sensor node is generated at time of simulation. A threshold value is used to determine a minimum power that is required by a sensor node to transmit different data rate of packets to its destination. The intrusion detection and removal module may efficiently detect the routing attack. The routing attacks reduce the throughput and increase the packet delay and packet drop in entire network.
[00043] As is illustrated at 102 is Phase I that facilitates to determine shortest routing path based on trust values. In an embodiment, one or more sensor nodes are deployed at 104 in the wireless sensor network using a distributed manner. The transmission scenario of data packet from source to destination in wireless sensor network is discussed in succeeding figures. At block 106, the network is simulated and one or more parameters stored in the database are used to determine the trust value of the routing path. The parameters are such as distance between cluster head and sink node, degree of mobility of sensor node, residual energy of the node, number of nodes present in the cluster. By using these parameters supervised machine learning approach is applied to the network to find the energy efficient cluster head at block 108 which reduces the congestion present entire the network. Further, all possible paths are determined from source to destination by using machine learning module at block 110.
[00044] In an embodiment, the trust values may be maintained at a database 114, and trust values at block 112 may be learned by the machine learning module 110 as and when there is a change in the wireless sensor network. Shortest routing path is discovered with the help of trust-based values. The trust value may be based on a node, a link and a network. Node trust values depend upon a distance between cluster head and sink node, degree of mobility of sensor node, residual energy of the node. The link trust value depends on receiving node acknowledgement at specific time, successful sending of packet rate, number of data transmission packets. Network trust values depend on number of sensor nodes present in the cluster.
[00045] Further, at block 116 the cluster head may be used to determine a shortest path for transmission of data packets from a source node to a destination. The source node and the destination node may be one of plurality of nodes of the wireless sensor network.
[00046] In an embodiment, at block 118, is the phase 2 that facilitates to determine intrusion detection and removal of malicious node. At block 120, actual value and threshold value of the sensor node stored in the database are compared. Comparison between actual value and threshold value is monitored in the wireless sensor network which identifies the activity of malicious node at block 122. Due to this intrusion, the performance metrics such as throughput is degraded, packet delay and packet drop are increased. These metrics are determined via simulation of sensor nodes. To maintain the Quality of Service in terms of reliability and security in routing intrusion removal mechanism is used. At block 124, the malicious sensor node is removed from the entire network via mobility model at block 126. Secure routing is performed via determining the shortest path, detection and removal of Black-hole attack from the entire network.
[00047] FIG. 2 illustrates exemplary flow of data packets at 200 in a wireless sensor network in accordance with an embodiment of the present disclosure.
[00048] In an embodiment, in a normal flow of data packets, one or more sensor nodes may be deployed in a particular area of interest. As is illustrated at 210, a cluster head can gather data from the one or more sensor nodes present in a sensing region and transmit this data to the base station. The flow in case of a routing attack is depicted at 220, and at 240 is shown that the malicious node can be any of a sensor node of the plurality of sensor nodes or a cluster node.
[00049] In an embodiment, one of the core advantages of proposed disclosure is that the solution is hybrid and addresses two problems: Firstly, to determine the shortest and optimal path via selection of node cluster approach. Secondly, to identify the routing attack and provide a preventive mechanism. This solution provides an energy-efficient clustering approach which reduces the collision problem that occurs during transmission of data packets from multiple sources to multiple destination. The solution facilitates to increase the throughput and reduce the packet drop. Intrusion detection mechanism may increase the quality of service in terms of reliability and security.
[00050] FIG. 3 illustrates exemplary implementation of flow of data packets in a wireless sensor network in accordance with an embodiment of the present disclosure.
[00051] In an embodiment, in Phase I for determination of a routing path, one or more wireless sensor nodes are deployed at block 302 in a hostile environment of the wireless sensor network. In an example, a network scenario of sensor nodes is created via a network simulator such as NS-2.35 tool at block 304. A shortest routing path is determined via selection of energy efficient cluster head node. A cluster head may be determined with the help of trust values of the network at block 306. Trust values of the entire network are calculated via the combination of direct trust and indirect trust. In an embodiment, are discussed Direct Trust: Direct trust is based on node’s self-observation, on the other hand indirect observation is based on the recommendation of the neighbor node. It is calculated in a particular time period. It is explained with the help of an example given as below:
[00052] In an embodiment, received packet rate ratio is determined as for example, if node n observes neighbor node n+1(neighbor node), then ratio of received packets is the confirmed amount of acknowledgments (ACK) sent by node n+1. This ratio will never be greater than node n+1 ratio. If there is a change in the ratio, node n can know whether node n+1 has response forging behavior. If the received packets ratio changes in the consecutive time interval (????, ????-1) and does not have big difference, then node n+1 works normally.
(t)=
[00053] In an embodiment, this factor prevents the node from routing attack with the help of receiver acknowledgement observation. In the similar way we calculate all parameters which are depend on trust value of network at block 310.
[00054] In an embodiment, are discussed Indirect Trust. The indirect trust value is determined via recommendation of a third node which is a common neighboring node m of node n and node n+1, symbolized as . Trust consists transitivity property. The indirect trust value of from node n to node n+1 is evaluated by the recommendation ( ) and is noted as
=
where is the trust value of node n to node u to node n+1.
[00055] In an implementation, is the direct trust value of node n to the common neighbor node , is the direct trust value of the common neighbor node to n+1. But still, all recommendations are not reliable. To calculate indirect trust more precisely, there is a need to find dishonest recommendation and exclude that recommendation from total aggregated recommendation. Recommendation is selected via threshold value. If the trustworthy recommendation is greater than threshold value then it will be considered as reliable recommendation.
[00056] In an embodiment, a different weight is assigned to distinct selected recommendation by direct trust. High weight is assigned to the selected recommendation from recommenders having high reputation. Weights are allocated on the basis of trust degree of the recommender to avoid individual recommendation. Weight is calculated as:
= , v
where is the direct trust value of node n to the common neighbour node , and ?? is the number of the selected recommendations.
The indirect trust is denoted as ITrust(t) is calculated as:
ITrust(t)= , v
where is the weight of represents the trust value from node n to node n+1 calculated by the recommendation node
[00057] In an embodiment, selection of cluster head node is implemented via decision tree machine learning approach at block 308. The trust values are maintained at a database at block 312.
[00058] In an embodiment, at phase II a routing attack detection and removal mechanism is determined at block 316. After the selection of shortest and optimal path at block 314. Reliability is further checked via intrusion detection mechanism at block 316. Further, actual value (AV) of the deployed sensor node is compared with the threshold value (TV). At block 318, if AV>TV then intrusion is detected. To make the path reliable, intrusion removal mechanism is provided. In addition, mobility models at block 320 are used for node movement of malicious node from the network at block 322.
[00059] Thus, it will be appreciated by those of ordinary skill in the art that the diagrams, schematics, illustrations, and the like represent conceptual views or processes illustrating systems and methods embodying this invention. The functions of the various elements shown in the figures may be provided through the use of dedicated hardware as well as hardware capable of executing associated software. Similarly, any switches shown in the figures are conceptual only. Their function may be carried out through the operation of program logic, through dedicated logic, through the interaction of program control and dedicated logic, or even manually, the particular technique being selectable by the entity implementing this invention. Those of ordinary skill in the art further understand that the exemplary hardware, software, processes, methods, and/or operating systems described herein are for illustrative purposes and, thus, are not intended to be limited to any particular named.
[00060] It should be apparent to those skilled in the art that many more modifications besides those already described are possible without departing from the inventive concepts herein. The inventive subject matter, therefore, is not to be restricted except in the spirit of the appended claims. Moreover, in interpreting both the specification and the claims, all terms should be interpreted in the broadest possible manner consistent with the context. In particular, the terms “comprises” and “comprising” should be interpreted as referring to elements, components, or steps in a non-exclusive manner, indicating that the referenced elements, components, or steps may be present, or utilized, or combined with other elements, components, or steps that are not expressly referenced. Where the specification claims refers to at least one of something selected from the group consisting of A, B, C …. and N, the text should be interpreted as requiring only one element from the group, not A plus N, or B plus N, etc.
[00061] While the foregoing describes various embodiments of the invention, other and further embodiments of the invention may be devised without departing from the basic scope thereof. The scope of the invention is determined by the claims that follow. The invention is not limited to the described embodiments, versions or examples, which are included to enable a person having ordinary skill in the art to make and use the invention when combined with information and knowledge available to the person having ordinary skill in the art.
ADVANTAGES OF THE PRESENT DISCLOSURE
[00062] The present disclosure provides a method that facilitates to identify and remove routing attacks from a wireless sensor network using an intrusion detection mechanism.
[00063] The present disclosure provides a method that facilitates to maintain a record of parameters that are used to determine trust values of a routing path.
[00064] The present disclosure provides a method that facilitates in providing a reliable and optimal routing path leading to increase throughput, decrease in packet delays and reduced packet drop in a wireless sensor network.
[00065] The present disclosure provides a method that facilitates in increasing quality of service (QoS) in terms of reliability and security of a wireless sensor network.
Claims:1. A method for facilitating secure routing of data packets in a wireless sensor network, said method comprising:
assigning, at a processor of a computing device associated with the wireless sensor network, a first trust value to each of a plurality of sensor nodes in the wireless sensor network based on a threshold value, the threshold value being indicative of a predefined power requirement for maintaining a transmission rate of the data packets;
determining, at the processor, a second trust value of each of the plurality of sensor nodes, the second trust value being indicative of a power requirement for maintaining a transmission rate of the data packets;
comparing, at the processor, the assigned first trust value of each of the plurality of sensor nodes to each of the determined second trust values of the corresponding plurality of sensor nodes; and
in response to determination of a negative deviation of the comparison of at least one of a sensor node, declaring, at the processor, the at least one of the sensor node of the plurality of sensor nodes as a malicious sensor node and facilitating secure routing of the data packets in the wireless sensor network.
2. The method as claimed in claim 1, wherein a cluster head is determined from the plurality of sensor nodes based on the threshold value.
3. The method as claimed in claim 1, wherein the threshold value comprises information related to a shortest distance between the determined cluster head and a sink node of the plurality of sensor nodes, a degree of mobility of a sensor node of the plurality of sensor nodes, a residual energy of the sensor node of the plurality of sensor nodes, and count of the plurality of sensor nodes.
4. The method as claimed in claim 1, wherein in response to the determination of the negative deviation taking the malicious node out of the wireless sensor network.
5. The method as claimed in claim 1, wherein upon the declaration of the sensor node of the plurality of sensor nodes as the malicious node, disassociating, at the processor, the connection of the malicious sensor node with associated one or more sensor nodes of the plurality of sensor nodes.
6. The method as claimed in claim 1, wherein upon the disassociation of connection of the malicious sensor node with associated one or more sensor nodes, the one or more sensor nodes are connected to each other such that the data packets are transmitted in the wireless sensor network.
7. The method as claimed in claim 1, wherein upon the declaration of the sensor node of the plurality of sensor nodes as the malicious node, declaring, at the processor, occurrence of a routing attack at the wireless sensor network.
8. The method as claimed in claim 1, wherein the malicious node is any of a sensor node of the plurality of the sensor nodes and a cluster head of the plurality of the sensor nodes.
9. The method as claimed in claim 1, wherein the first trust value and the second trust value is analysed and trained using a set of pre-defined set of instructions.
10. A system for facilitating secure routing of data packets in a wireless sensor network, said system comprising:
a processor operatively coupled to a memory, the memory storing a set of instructions executed by the processor to:
assign a first trust value to each of a plurality of sensor nodes in the wireless sensor network based on a threshold value, the threshold value being indicative of a predefined power requirement for maintaining a transmission rate of the data packets;
determine a second trust value of each of the plurality of sensor nodes, the second trust value being indicative of a power requirement for maintaining a transmission rate of the data packets;
compare the assigned first trust value of each of the plurality of sensor nodes to each of the determined second trust values of the corresponding plurality of sensor nodes; and
in response to determination of a negative deviation of the comparison of at least one of a sensor node, declare, at the processor, the at least one of the sensor node of the plurality of sensor nodes as a malicious sensor node and facilitating secure routing of the data packets in the wireless sensor network.
| Section | Controller | Decision Date |
|---|---|---|
| # | Name | Date |
|---|---|---|
| 1 | 202011033543-Annexure [30-07-2024(online)].pdf | 2024-07-30 |
| 1 | 202011033543-IntimationOfGrant10-01-2025.pdf | 2025-01-10 |
| 1 | 202011033543-STATEMENT OF UNDERTAKING (FORM 3) [05-08-2020(online)].pdf | 2020-08-05 |
| 2 | 202011033543-FORM FOR STARTUP [05-08-2020(online)].pdf | 2020-08-05 |
| 2 | 202011033543-FORM-26 [30-07-2024(online)].pdf | 2024-07-30 |
| 2 | 202011033543-PatentCertificate10-01-2025.pdf | 2025-01-10 |
| 3 | 202011033543-Annexure [30-07-2024(online)].pdf | 2024-07-30 |
| 3 | 202011033543-FORM FOR SMALL ENTITY(FORM-28) [05-08-2020(online)].pdf | 2020-08-05 |
| 3 | 202011033543-Written submissions and relevant documents [30-07-2024(online)].pdf | 2024-07-30 |
| 4 | 202011033543-FORM-26 [30-07-2024(online)].pdf | 2024-07-30 |
| 4 | 202011033543-FORM-26 [15-07-2024(online)].pdf | 2024-07-15 |
| 4 | 202011033543-FORM 1 [05-08-2020(online)].pdf | 2020-08-05 |
| 5 | 202011033543-Written submissions and relevant documents [30-07-2024(online)].pdf | 2024-07-30 |
| 5 | 202011033543-EVIDENCE FOR REGISTRATION UNDER SSI(FORM-28) [05-08-2020(online)].pdf | 2020-08-05 |
| 5 | 202011033543-Correspondence to notify the Controller [13-07-2024(online)].pdf | 2024-07-13 |
| 6 | 202011033543-US(14)-HearingNotice-(HearingDate-16-07-2024).pdf | 2024-06-13 |
| 6 | 202011033543-FORM-26 [15-07-2024(online)].pdf | 2024-07-15 |
| 6 | 202011033543-EVIDENCE FOR REGISTRATION UNDER SSI [05-08-2020(online)].pdf | 2020-08-05 |
| 7 | 202011033543-DRAWINGS [05-08-2020(online)].pdf | 2020-08-05 |
| 7 | 202011033543-Correspondence-270123.pdf | 2023-01-31 |
| 7 | 202011033543-Correspondence to notify the Controller [13-07-2024(online)].pdf | 2024-07-13 |
| 8 | 202011033543-DECLARATION OF INVENTORSHIP (FORM 5) [05-08-2020(online)].pdf | 2020-08-05 |
| 8 | 202011033543-GPA-270123.pdf | 2023-01-31 |
| 8 | 202011033543-US(14)-HearingNotice-(HearingDate-16-07-2024).pdf | 2024-06-13 |
| 9 | 202011033543-COMPLETE SPECIFICATION [05-08-2020(online)].pdf | 2020-08-05 |
| 9 | 202011033543-Correspondence-270123.pdf | 2023-01-31 |
| 9 | 202011033543-Others-270123.pdf | 2023-01-31 |
| 10 | 202011033543-CLAIMS [20-01-2023(online)].pdf | 2023-01-20 |
| 10 | 202011033543-FORM-26 [21-10-2020(online)].pdf | 2020-10-21 |
| 10 | 202011033543-GPA-270123.pdf | 2023-01-31 |
| 11 | 202011033543-CORRESPONDENCE [20-01-2023(online)].pdf | 2023-01-20 |
| 11 | 202011033543-Others-270123.pdf | 2023-01-31 |
| 11 | 202011033543-Proof of Right [18-12-2020(online)].pdf | 2020-12-18 |
| 12 | 202011033543-CLAIMS [20-01-2023(online)].pdf | 2023-01-20 |
| 12 | 202011033543-DRAWING [20-01-2023(online)].pdf | 2023-01-20 |
| 12 | 202011033543-FORM 18 [15-03-2022(online)].pdf | 2022-03-15 |
| 13 | 202011033543-FER_SER_REPLY [20-01-2023(online)].pdf | 2023-01-20 |
| 13 | 202011033543-FER.pdf | 2022-07-22 |
| 13 | 202011033543-CORRESPONDENCE [20-01-2023(online)].pdf | 2023-01-20 |
| 14 | 202011033543-DRAWING [20-01-2023(online)].pdf | 2023-01-20 |
| 14 | 202011033543-FORM-26 [20-01-2023(online)].pdf | 2023-01-20 |
| 15 | 202011033543-FER.pdf | 2022-07-22 |
| 15 | 202011033543-FER_SER_REPLY [20-01-2023(online)].pdf | 2023-01-20 |
| 16 | 202011033543-DRAWING [20-01-2023(online)].pdf | 2023-01-20 |
| 16 | 202011033543-FORM 18 [15-03-2022(online)].pdf | 2022-03-15 |
| 16 | 202011033543-FORM-26 [20-01-2023(online)].pdf | 2023-01-20 |
| 17 | 202011033543-Proof of Right [18-12-2020(online)].pdf | 2020-12-18 |
| 17 | 202011033543-CORRESPONDENCE [20-01-2023(online)].pdf | 2023-01-20 |
| 17 | 202011033543-FER.pdf | 2022-07-22 |
| 18 | 202011033543-FORM-26 [21-10-2020(online)].pdf | 2020-10-21 |
| 18 | 202011033543-FORM 18 [15-03-2022(online)].pdf | 2022-03-15 |
| 18 | 202011033543-CLAIMS [20-01-2023(online)].pdf | 2023-01-20 |
| 19 | 202011033543-COMPLETE SPECIFICATION [05-08-2020(online)].pdf | 2020-08-05 |
| 19 | 202011033543-Others-270123.pdf | 2023-01-31 |
| 19 | 202011033543-Proof of Right [18-12-2020(online)].pdf | 2020-12-18 |
| 20 | 202011033543-GPA-270123.pdf | 2023-01-31 |
| 20 | 202011033543-FORM-26 [21-10-2020(online)].pdf | 2020-10-21 |
| 20 | 202011033543-DECLARATION OF INVENTORSHIP (FORM 5) [05-08-2020(online)].pdf | 2020-08-05 |
| 21 | 202011033543-COMPLETE SPECIFICATION [05-08-2020(online)].pdf | 2020-08-05 |
| 21 | 202011033543-Correspondence-270123.pdf | 2023-01-31 |
| 21 | 202011033543-DRAWINGS [05-08-2020(online)].pdf | 2020-08-05 |
| 22 | 202011033543-DECLARATION OF INVENTORSHIP (FORM 5) [05-08-2020(online)].pdf | 2020-08-05 |
| 22 | 202011033543-EVIDENCE FOR REGISTRATION UNDER SSI [05-08-2020(online)].pdf | 2020-08-05 |
| 22 | 202011033543-US(14)-HearingNotice-(HearingDate-16-07-2024).pdf | 2024-06-13 |
| 23 | 202011033543-Correspondence to notify the Controller [13-07-2024(online)].pdf | 2024-07-13 |
| 23 | 202011033543-DRAWINGS [05-08-2020(online)].pdf | 2020-08-05 |
| 23 | 202011033543-EVIDENCE FOR REGISTRATION UNDER SSI(FORM-28) [05-08-2020(online)].pdf | 2020-08-05 |
| 24 | 202011033543-EVIDENCE FOR REGISTRATION UNDER SSI [05-08-2020(online)].pdf | 2020-08-05 |
| 24 | 202011033543-FORM 1 [05-08-2020(online)].pdf | 2020-08-05 |
| 24 | 202011033543-FORM-26 [15-07-2024(online)].pdf | 2024-07-15 |
| 25 | 202011033543-EVIDENCE FOR REGISTRATION UNDER SSI(FORM-28) [05-08-2020(online)].pdf | 2020-08-05 |
| 25 | 202011033543-FORM FOR SMALL ENTITY(FORM-28) [05-08-2020(online)].pdf | 2020-08-05 |
| 25 | 202011033543-Written submissions and relevant documents [30-07-2024(online)].pdf | 2024-07-30 |
| 26 | 202011033543-FORM-26 [30-07-2024(online)].pdf | 2024-07-30 |
| 26 | 202011033543-FORM FOR STARTUP [05-08-2020(online)].pdf | 2020-08-05 |
| 26 | 202011033543-FORM 1 [05-08-2020(online)].pdf | 2020-08-05 |
| 27 | 202011033543-STATEMENT OF UNDERTAKING (FORM 3) [05-08-2020(online)].pdf | 2020-08-05 |
| 27 | 202011033543-FORM FOR SMALL ENTITY(FORM-28) [05-08-2020(online)].pdf | 2020-08-05 |
| 27 | 202011033543-Annexure [30-07-2024(online)].pdf | 2024-07-30 |
| 28 | 202011033543-FORM FOR STARTUP [05-08-2020(online)].pdf | 2020-08-05 |
| 28 | 202011033543-PatentCertificate10-01-2025.pdf | 2025-01-10 |
| 29 | 202011033543-IntimationOfGrant10-01-2025.pdf | 2025-01-10 |
| 29 | 202011033543-STATEMENT OF UNDERTAKING (FORM 3) [05-08-2020(online)].pdf | 2020-08-05 |
| 1 | searchstrategyE_21-07-2022.pdf |