Sign In to Follow Application
View All Documents & Correspondence

Method Of Transmitting Information From A Mote To A Base Station

Abstract: METHOD OF TRANSMITTING INFORMATION FROM A MOTE TO A BASE STATION Abstract of the Invention A method for reliably transmitting a plurality of information from one or more motes to a base station is disclosed. The method comprises establishing a first optimal path from the respective mote to the base station for transmitting the information. The method further includes forming a plurality of data packets by embedding the information gathered from the respective mote and assigning a pre-defined importance level to each of the formed data packets. Further, the method comprises assigning one or more degree of reliabilities to the respective mote for delivery of each data packet based on the corresponding assigned importance level of the respective data packet. Finally, the method includes transmitting the respective data packet to the base station through the optimal path with the corresponding degree of reliabilities. The method also includes steps for reducing the battery consumption or memory utilization by the mote for transmitting the information to the base station.

Get Free WhatsApp Updates!
Notices, Deadlines & Correspondence

Patent Information

Application #
Filing Date
12 June 2008
Publication Number
51/2009
Publication Type
INA
Invention Field
COMMUNICATION
Status
Email
Parent Application
Patent Number
Legal Status
Grant Date
2017-03-21
Renewal Date

Applicants

INFOSYS TECHNOLOGIES LIMITED
PLOT NO. 44 & 97A, ELECTRONICS CITY, HOSUR ROAD, BANGALORE - 560 100.

Inventors

1. KUMAR, PADMANABH
S/O- SHRI MOHAN MISHRA, HOUSE NO. 638, KRISHNA NAGAR PVT. COLONY, PO-BASARATPUR, GORAKHPUR PIN-273004
2. CHOWDHURY, ATANU ROY
S/O DR. ATINDRA ROY CHOWDHURY, HA 130, SALT LAKE CITY, KOLKATA-700097.
3. BANSAL, TARUN
HOUSE# 242 WARD#12, NEAR OLD POLICE STATION, LADWA KURUKSHETRA PIN-136132,
4. GUPTA, PUNEET
248, LAKESHORE HOMES, KASAVANAHALLI, CARMELARAM PO, OFF SARJAPUR ROAD, BANGALORE 560035

Specification

TECHNICAL FIELD
The present invention relates to a mote, and more particularly, to a reliable method of transmitting information from the mote to a base station, with minimal battery consmumption and/or memory utilization, in wireless sensor network.
BACKGROUND
A sensor is a device which generally reads information from the surrounding enviroimient and converts the information into electrical signal which in turns may be converted into the data packet(s). The data packets may then be transmitted to a central processing unit using a wired network for further processing. The method of transmitting the data packets to the central processing unit, using the wired network may have few limitations, which includes high cost incurred for laying the wired network, difficult in maintenance of wired network, and wiring these device for giving power to them. All these issue restrict them for not to be so scalable.
Few of the problem faced in using the wired network to transmit the data packets are addressed by using a wireless sensor network (herein also referred as "WSN"). A "mote" in WSN is an electronic device packaged with the sensors, a very small computer, a wireless interface and battery. The sensor in WSN may transmit the data packets to the base station by routing the data packet using muhi-hop technique. The computer available on board in the motes enable them to work as a router and make decision when required. Thus ftmdamentally, the WSN are characterized by four key features for transmitting data packets which includes self-organization, local decision making, wireless communications and well oriented traffic from source (mote) to destination (base station). Moreover the motes in the in WSN are equipped with battery and therefore they are mostly self-powered.
Generally there are two methods of routing. A routing protocols used by the motes to transmit the data packets may use an extensive route tables or embed the

route in the data packet for transmission of data packets. In this method of transmission of data packets, reliable transmission of data packets may be achieved by receiving an end-to-end acknowledgement between the source and destination pair. The reliability between two intermediate motes, in the route may be achieved by receiving a link level acknowledgment. The loss of the acknowledgment, no acknowledgement or a negative acknowledgment may allow the source mote to retransmit the data packet. The alternative to transmission may be to use forward destination to reconstruct a deprecated message.
However, there are two fundamental limitations in this method of transmitting the data packets. Firstly, motes are battery powered and secondly memory space in motes is very less. Thus motes may not be able to afford receiving end-to-end acknowledgement for each transmitted data packets. If a compromise is sought with receiving link level acknowledgement 100% reliabilities may never be achieved. Moreover, retransmission will be resulted in more consumption of battery power.
Finally, the existing routing protocol either maintains a routing table while transmission or the route information is embedded in the data packet. Both mechanisms may introduce heavy payload to make these routing unsuitable for resource constrained motes.
Thus, there is a need for a reliable method of transmitting data packets in the WSN from the source to the destination, with minimal battery consmuption and/or memory utilization of motes and gurunteed delivery of sensor data packets.
SUMMARY OF THE INVENTION
A method for reliably transmitting information from a mote to a base station is disclosed. Such method may help in reducing the battery consimiption and/or memory utilization by the mote for transmitting the information to the base station but assuring the guaranteed delivery of data packets.

In one embodiment of the present technique, a method of transmitting a plurality of information by one or more mote(s) in a wireless sensor network is detailed. The method essentially comprises the step of establishing an optimal path from the respective mote to a base station by automatically minimizing the intermediate motes required to transmit the plurality of information to the base station in the wireless sensor network. The respective motes may then form a plurality of data packets by embedding the information gathered either by a sensor reading or by a request message. Each of the formed data packets may be assigned a pre-defined importance level and an associated degree of reliabilities for delivery of respective data packets. The method further comprises the step of transmitting the respective data packets through the established optimal path with the corresponding degree of reliabilities assigned to it.
In one embodiment of the present technique, the pre-defined importance level is assigned based on requirement of an application loaded in the respective mote. The pre-defined importance level may include at least one of a high importance level or a low importance level or both.
In one embodiment of the present technique, the degree of reliabilities with which the data packets is delivery is based on the corresponding importance level of the respective data packet. In one embodiment of the present technique, there is more than one degree of reliabilities for delivery of data packets depending upon the importance level of the packet. This may include at least one of a best effort mode, or a low power mode or a high reliability mode or a panic mode of_degree of reliabilities or combinations thereof
In another embodiment of the present technique, the method also includes transmitting the plurality of data packets formed firom the request message generated by the base station to the respective mote in the wireless sensor network.

BRIEF DESCRIPTION OF THE DRAWINGS
The above mentioned features as well other features, aspects, and advantages of the present invention will become better understood when the following detailed description is read with reference to the accompanying drawings in which like characters represent like parts throughout the drawings, wherein:
FIG. 1 is a flow diagram depicting a method of reliably transmitting a plurality of information by one or more motes in a wireless sensor network, according to one embodiment of the present technique;
FIG. 2 is a flow diagram illustrating a method of reducing at least one of battery consumption or memory utilization or both by one or more motes for transmitting a plurality of information in a wireless sensor network, according to one embodiment of the present technique;
FIG. 3 is a block diagram illustrating a mote assigned with one or more degree of reliabilities for delivery of plurality of data packet based on the corresponding assigned importance level of the respective data, according to one embodiment of the present technique; and
FIG. 4 is a system illustrating a generalized computer network arrangement, in one embodiment of the present technique.
DETAILED DESCRIPTION
The following description is full and informative description of the best method and system presently contemplated for carrying out the present invention, which is known to the inventors at the time of filing the patent application. Of course, many modifications and adaptations will be apparent to those skilled in the relevant arts in view of the following description, in view of the accompanying drawings and the appended claims. While the system and method described herein are provided with a certain degree of specificity, the present technique may be implemented with either greater or lesser specificity, depending on the needs of the user. Further, some

of the features of the present technique may be used to advantage without the corresponding use of other features described in the following paragraphs. As such, the present description should be considered as merely illustrative of the principles of the present technique and not in limitation thereof, since the present technique is defined solely by the claims.
The present invention relates to a method of reliably transmitting a plurality of information by one or more motes in a wireless sensor network. The method also details an approach for reducing at least one of battery consumption or memory utilization or both by one or more motes for transmitting the plurality of information in the wireless sensor network. The inventive technique to be detailed in the subsequent sections to follow also explains various degrees of reliabilities employed in the motes for delivery of information to the base station along with the reduced utilization of battery and/ or memory for transmission.
The following description is presented to enable a person of ordinary skill in the art to make and use the invention and is provided in the context of the requirement for obtaining a patent. The present description is the best presently contemplated method for carrying out the present invention. Various modifications to the preferred embodiment will be readily apparent to those skilled in the art and the generic principles of the present invention may be applied to other embodiments, and some features of the present invention may be used without the corresponding use of other features. Accordingly, the present invention is not intended to be limited to the embodiment shown but is to be accorded the widest scope consistent with the principles and features described herein.
Referring to the figures, Fig 1 is a flow diagram depicting a method of reliably transmitting a plurality of information by one or more motes in a wireless sensor network, according to one embodiment of the present technique. In one embodiment of the present technique, the mote is a node in a wireless sensor network (herein also referred as "WSN") capable of gathering sensory information, processing the sensed information, and communicating with other cormected motes/nodes or a

base station in the WSN. Essentially, the sensor, processor, communication module and power supply are integrated into a single unit, known as the mote.
In one embodiment of the present technique, the method comprising: 1) beginning the process of transmitting a plurality of information by implanting one or more motes in a wireless sensor network (block 105), 2) establishing a first optimal path from the respective mote to a base station (block 110), 3) gathering information from at least one of a sensor reading or a request message from the surrounding environment (block 115), 4) forming a plurality of data packets by embedding the plurality of information gathered (block 120), 5) assigning a pre-defined importance level to each of the formed data packet (block 125), 6) assigning one or more degree of reliabilities for delivery of each data packet (block 130), and 7) transmitting the respective data packet to the base station with the corresponding degree of reliabilities (block 135). Each of the steps will be explained in greater extent in the subsequent sections to follow.
The method of transmitting the plurality of information in the WSN network may begin by placing or implanting one or more motes in an ambiance environment, where the information needs to be continuously gathered or monitored, as represented in step 105. One or more motes implanted in the WSN may be in an idle mode on switched ON state. The respective mote needs to establish a first optimal path before transmitting gathered information fi-om the surrounding environment. In an illustrative embodiment of the present technique, the ambiance environment may include a bridge. During construction of the bridge, the concrete is poured on reinforced steel to build a rigid structure. A powerfiil magnetic field induced into the bridge may allow the motes, which are buried within the concrete of the bridge, to switch on. Then, the mote placed in such enviroimient may sense the salt concentration information within the concrete and transmit the information. Thus, helping the maintenance engineer to gauge the damage caused by the salt in the reinforcement. In one embodiment of the present technique, motes are generally placed in the environment where the reach to access or gain information is not easy or cumbersome. The example illustrated should not limit the scope of application of the present technique.

In step 110, the base station may advertise its presence by broadcasting an introduction message to one or more motes in the WSN. Each mote placed or implanted in WSN communicates among other intermediate motes in a process of reaching the base station upon receipt of the introduction message advertised from the base station. In this process each motes in the WSN may establish a first optimal path from the respective mote to reach the base station. The method of establishing the first optimal path from the respective mote to reach the base station may be an automatic process. In one embodiment of the present technique, the automatic process includes a two step mechanism to establish the first optimal path. The process includes at least one of an identifying the intermediate mote step or recording the first optimal path in a table or both.
In one embodiment of the present technique, in the process of identifying the intermediate mote step, each respective mote (herein also referred as "source mote") communicates with one or more intermediate motes with a reply message to the introduction message to seek the first optimal path to reach the base station. Each of the intermediate motes may then forward the received reply message to the introduction message to their adjacent motes and may send an advertisement acknowledgement about the same to the respective source mote. Similarly, the process may repeat until the reply message to the introduction message transmitted from the source mote is commimicated to the base station.
In one embodiment of the present technique, in the step of recording the first optimal path in the table, based on the advertisement acknowledgement received by each source mote from the intermediate mote in the WSN. The source mote may then record the first optimal path information to reach the base station in the table. The table may contain one or more first optimal path information. Each of the first optimal path information may further include at least one of a hop count or a best parent mote detail or both. The hop count may be the number of intermediate mote required to reach the base station. In one embodiment of the present technique, the source mote may gauge whether the received first optimal path is best among the all ready existing first optimal path by calculating the number of hop count required to reach the base station. If the detail of the received first optimal path is best in

comparison with the already existing first optimal path recorded in the table, it may be replaced by the received first optimal path. Each source mote may store one or more first optimal path with same or different hop count to reach the base station. In one embodiment of the present technique, the first optimal path contains at least one of a primary first optimal path or a secondary first optimal path or both.
In another embodiment of the present technique, the first optimal path information stored in the table of the source mote may also include the best intermediate mote detail to establish the connection to the base station.
The information sensed by the source mote may be transmitted to the base station by routing the information through the recorded primary first optimal path. In case, if the parent mote as per primary first optimal information is not functioning, the source mote may transmit the information through the parent mote of the secondary first optimal path, as stored in the table.
In one embodiment of the present technique, the first optimal path for the source mote to reach the base station may include one or more intermediate motes or may be a direct communication to the base station. If the base station is near to the base station, and the source mote does not require any intermediate mote to transmit the information to the base station, then the source mote may directly transmit the information to the base station.
In one embodiment of the present technique, the introduction message broadcasted fi-om the base station to one or more motes in the WSN may be "hello message" comprising the details of the base station and information about other intermediate node this "hello message" passing through them. The introduction message may be broadcasted from the base station periodically. A program loaded in the base station may set the time gap for periodically broadcasting the introduction message to one or more motes in the WSN.
In one embodiment of the present technique, the first optimal path for transmitting the plurality of data packets from the respective mote may also get

refreshed or amended based on the establishment of a new first optimal path upon receiving the introduction message periodically from the base station.
In step 115, each mote placed or implanted in the ambiance environment gather information from at least one of a sensor reading or a request message read from the surroimding environment.
The sensor reading read from the surrounding environment by the mote may include at least one of a regular message or a special message or the plurality of acknowledgment or combinations thereof The regular message may be general information, which the motes may gather periodically. The special message may be anomalous information, which is uncharacteristic in comparison with the general information, or the application software running into the mote decides a normal information as a special information which the motes may gather upon change in the environment.
The request message gathered from the surrounding environment by the mote may include a control instruction or a data sent from the base station. The control message may include instruction information for the source mote to perform on receipt of the same. While the data may include the general information which the base station may want the respective source mote to sense in future. The request message may be transmitted from the base station to respective motes through a second optimal path. The method of establishing the second optimal path from the base station to reach the respective may be an automatic reversing process. In one embodiment of the present technique, the automatic reversing process includes the step of extracting the information of the first optimal path from the plurality of data packets received by the base station and reversing the path to reach back the respective mote from the base station. A program running in the base station may provide the steps for automatic reversing the first optimal path and establish the second optimal path to reach the respective mote.
In one embodiment of the present technique, the second optimal path for transmitting the plurality of data packets from the base station to the respective mote

may also get refreshed or amended based on the new first optimal path established by the respective mote to reach the base station.
In step 120, the respective source mote after gathering the information from at least one of a sensor reading or the request message form a plurality of data packets by embedding the plurality of gathered information. The data packets formed for each of this information may include at least one of a header section or a body section.
In one embodiment of the present technique, the header section of the data packet may include at least one of a source identity or a destination identity or an importance level or a group identity or a parent mote identity or a last forwarded mote identity or the hop count number or a sequence number of the information' data packet or combinations thereof The source identity may include the identity of the source mote, which is generating the data packet. The destination identity may include the identity details of the intermediate mote, to which the data packet is intended to. The importance level of the data packet may also be incorporated in each data packets. The importance level to each data packets is assigned from the list of pre-defined importance level and is based on requirement of an application loaded in the respective mote, as shown in step 125 (will in explained in subsequent section to follow). The group identity may include the identity of one or more motes in the WSN meant for gathering particular ambiance information among the other motes in the network. In that case, if suppose source mote of particular group sends the data packets which is not intended for the group, the intermediate mote will discard such data packets. The parent identify may include the identity of the parent mote to which the source mote or the intermediate mote may transmit the information, on the first optimal path to reach the base station. The parent mote details may be obtained from the table containing the first optimal path. The last forwarded mote identity may include the identity of the source mote or the intermediate mote from the mote may have received the transmitted information. The hop count information may include details of the numbers of nodes or the motes required for the information fi-om the source mote to reach the base station. The hop count details may be obtained from the table containing the first optimal path. The sequence number of the information'

data packets may include at least one of an unique identity for the information or the sequence number of the data packets generated for the information or the total number of the data packets formed for the information by the source mote or combinations thereof
In one embodiment of the present technique, the body section of the data packet may include the information gathered from the sensor reading or the reply message to the request message or reply for the plurality of acknowledgement or combinations thereof In one embodiment of the present technique, the data packets comprising the header and body section is embedded by the source mote and is kept ready for transmitting to the base station. The information gathered by the mote may include forming one or more data packets out of it.
In step 125, the importance level to each of the data packets is assigned based on requirement of the application loaded in the respective mote. The importance level is assigned from the list of pre-defined importance level by the application using a set of business rules defined in it. In one embodiment of the present technique, the pre-defined importance level includes at least one of a low importance level or a high importance level or both. The application using the business rule for assigning the importance level to the data packets may comprise identifying the type of information from which the data packets are formed.
In one illustrative embodiment of the present technique, for the X type of application loaded in the mote the request message from the base station or the special message sensed from the sensor of the mote may be of high relevance and may assign high importance to one or more data packets formed out of such messages. Similarly, for the same X type of application, the regular message or the introduction message may be of low relevance and may assign low importance to one or more data packets formed out of such messages.
In step 130, each mote is assigned with one or more degree of reliabilities for delivery of each formed data packet. The motes may behave in assigned degree of reliabilities mode for transmitting one or more data packets. In one embodiment of

the present technique, the degree of reliabilites for delivery of data packets may include at least one of a best effort mode degree of reliabilities or a low power mode degree of reliabilities or a high reliability mode degree of reliabilities or a panic mode degree of reliabilities or combinations thereof.
In one embodiment of the present technique, one or more motes may be in the idle mode till the respective motes receive the introduction message from the base station. In one embodiment of the present technique, upon receiving the introduction message the respective mote may come out of the idle mode for transmitting the reply message to the introduction message to establish the first optimal path for transmitting the data packets to the base station. In another embodiment of the present technique, the motes may get back to idle mode, if the respective mote does not receive the advertisement from the base station for the defined time gap.
In one embodiment of the present technique, the best effort mode degree of reliabilities for delivery of plurality of data packets includes transmitting the plurality of data packets to the intermediate mote and wait for a receipt of first set of acknowledgment from the corresponding intermediate mote. In one embodiment of the present technique, the messages to be transmitted are determined based on the corresponding importance level assigned to it. The best effort mode of reliabilities for delivery of plurality of data packets may be based on the low importance level assigned to the data packets.
In one embodiment of the present technique, the best effort mode may include transmitting of the regular message. In the best effort mode the transmission of the regular messages may happen till the source mote receives the first set of acknowledgment from the corresponding intermediate mote. The first set of acknowledgment to be received may be defined once again by the application loaded in the respective mote.
In one embodiment of the present technique, the low power mode degree of reliabilities for delivery of plurality of data packets includes transmitting the plurality of data packets from the respective mote to the intermediate mote without waiting for

the receipt of a first set of acknowledgment for a defined first time interval. In one embodiment of the present technique, the messages to be transmitted are determined based on the corresponding importance level assigned to it. The low power mode degree of reliabilities for delivery of plurality of data packets may be based the low importance level assigned to the data packets.
In one embodiment pf the present technique, the low power mode may include transmitting of the regular message. In the low power mode the transmission of the regular messages may happen continuously with out waiting for the first set of acknowledgment fi-om the corresponding intermediate mote for the defined first time interval. The first time interval may be defined once again by the application loaded in the respective mote.
In one embodiment of the present technique, the high reliable mode degree of reliabilities for delivery of plurality of data packets includes transmitting the plurality of data packets from the respective mote to the intermediate mote and waiting for the receipt of a second set of acknowledgment for successful delivery of plurality of data packets from the base station for a defined second time interval. In one embodiment of the present technique, the messages to be transmitted are determined based on the corresponding importance level assigned to it. The high reliable mode degree of reliabilities for delivery of plurality of data packets is based the high importance level assigned to the data packets.
In one embodiment of the present technique, the high reliable mode may include transmitting of the special message or a reply to the control message. In the high reliable mode the transmission of the special message may happen and the respective mote may wait for the receipt of second set of acknowledgment for successfiil delivery of plurality of data packets of special message fi*om the base station for the defined second time interval. The second time interval may be defined once again by the application loaded in the respective mote.
In another embodiment of the present technique, after waiting for the defined second interval, the respective mote may once again transmit the special

message and may wait for the receipt of second set of acknowledgment for successful delivery of plurality of data packets of special message from the base station for a defined third time interval. The third time interval may be defined once again by the application loaded in the respective mote.
In one embodiment of the present technique, the panic mode degree of reliabilities for delivery of plurality of data packets includes broadcasting the plurality of data packets from the respective mote to one or more intermediate mote or to the base station after at least one of the defined second time interval or the defined third time interval. In one embodiment of the present technique, the messages to be transmitted are determined based on the corresponding importance level assigned to it. The panic mode degree of reliabilities for delivery of plurality of data packets may be based the high importance level assigned to the data packets and non receipt of the acknowledgement packet from the base station.
In one embodiment of the present technique, the panic mode may include transmitting of the special message or the reply to the control message. In the high reliable mode the respective mote may broadcast the special message or the reply to the control message to the base station after the defined second time interval or the defined third time interval. The application loaded in the respective mote may defined the whether the mote should be broadcasting the data packets in panic mode after the second time interval or the third time interval.
In another embodiment of the present technique, the routing protocol used to transmit the plurality of data packets from one node or mote to the intermediate mote determines the degree of reliabilities for delivery of data packets using the corresponding importance level of the respective data packet.
In step 135, each mote will transmit the plurality of data packets with the corresponding degree of reliabilities for delivery of data packets to the base station through the optimal path. Thus, the present technique ensures motes to behave in different modes for delivery of the plurality of data packets formed for the different type of messages from the respective mote.

Referring to the figures, Fig 2 is a flow diagram illustrating a method of reducing at least one of battery consumption or memory utilization or both by one or more motes for transmitting a plurality of information in a wireless sensor network, according to one embodiment of the present technique. The method illustrates the method of transmitting the plurality of data packets with minimal battery consumption and memory utilization.
The method comprising: 1) beginning the process of transmitting a plurality of information by implanting one or more motes in a wireless sensor network (block 205), 2) embedding the information gathered from at least one of a sensor reading or a request message in a plurality of data packets (block 210), 3) assigning an importance level for the pliirality of data packets (block 215), 4) transmitting the plurality of data packets through an first optimal path from the respective mote to a base station (block 220), 5) receiving a receipt of a first set of acknowledgment for delivery of plurality of data packets (block 225), 6) continuously transmitting the plurality of data packets with out waiting for the first set of acknowledgement for a defined first time interval (block 230), and 7) transmitting the plurality of data packets and waiting for a second set of acknowledgement for a defined second time interval (block 235). Each of the steps will be explained in greater extent in the subsequent sections to follow.
The method of transmitting the plurality of information in the WSN network may begin by placing or implanting one or more motes in an ambiance environment, where the information needs to be continuously gathered or monitored, as represented in step 205. One or more motes implanted in the WSN may be in an idle mode on switched ON state. The respective mote needs to establish a first optimal path before transmitting gathered information fi-om the surrounding environment.
In step 210, the respective mote embeds the information gathered from at least one of a sensor reading or a request message in a pliirality of data packets. The plurality of data packets formed for each of the gathered information may include at least one of a header section or a body section. In one embodiment of the present technique, the header section of the data packet may include at least one of a source

identity or a destination identity or an importance level or a group identity or a parent mote identity or a last forwarded mote identity or the hop count number or a sequence number of the information' data packet or combinations thereof In one embodiment of the present technique, the body section of the data packet may include the information gathered from the sensor reading or the reply message to the request message or reply for the advertisement acknowledgement received or combinations thereof The header section and the body section of the plurality of data packets are detailed in the above section (with respect to figure 1).
In step 215, the plurality of data packets formed for the information may be assigned at least one of high importance level or a low importance level or both. The importance level for the plurality of data packets may be determined based on requirement of an application loaded in the respective mote. The application may use a set of business rules defined in it for assigning the importance level to the plurality of data packets. In one embodiment of the present technique, a regular message or an advertisement or an acknowledgment packet may be assigned low importance level. The special message or the reply to the request message or acknowledgement to the special message may be assigned the high importance level.
The plurality of data packets after being assigned one or more importance level is transmitted to the base station through a first optimal path (establishment of the first optimal path is detailed in the above section with respect to figure 1), as represented in step 220. In one embodiment of the present technique, the method of transmitting the plurality of data packets may include routing the respective data packet to the intermediate mote as determined in a table of the first optimal path (information of the table for the first optimal path is detailed in the above section with respect to figure 1). In another embodiment of the present technique, the method of transmitting the plurality of data packets may include broadcasting the respective data packet to the base station.
In step 225, the respective mote waits for a receipt of first set of acknowledgment for delivery of plurality of data packets transmitted to the intermediate mote. The first set of acknowledgement to be received by the respective

mote may be defined once again by the application loaded in the respective mote. The receipt of first set of acknowledgment ensures that a parent mote to which the respective mote have transmitted to plurality of data packet is functioning. The plurality of data packets may be assigned with the low importance level for transmitting from the respective mote.
In step 230, the respective mote after receiving the first set of acknowledgement starts to continuously transmit the plurality of data packets with out waiting for the first set of acknowledgement for a defined first time interval. Since, the first set of acknowledgement is received in the previous step; the respective mote may not seek for any more first set of acknowledgment for the defined first time interval. The first time interval may be defined once again by the application loaded in the respective mote. The plurality of data packets may once again be assigned with the low importance level for transmitting from the respective mote. Thus with no acknowledgement for a fixed interval of time leads to saving of power consumption fi-om the battery.
Since, the respective mote may not wait for the first set of acknowledgement for the plurality of data packets for transmitted to the parent mote, the battery consumption is reduced as well the parent mote may just forward the received data packets to their parent mote and may not send back the first set of acknowledgement, which once again may result in reduced battery consumption. Similarly, since the respective mote does not receive first set of acknowledgements for the defined first time interval, the memory of the respective mote may be used effectively. Thus, preventing the utilization or consumption of the maximum memory by the acknowledgments.
In step 235, the respective mote transmits the plurality of data packets to the intermediate mote and waiting for a second set of acknowledgement for a defined second time interval from the base station. The second time interval may be defined once again by the application loaded in the respective mote.

Since, the respective mote does not seek for the second set of acknowledgment from the intermediate mote and waits only for the second set of acknowledgment from the base station, the memory utilization of the respective mote as well the battery consumption is minimal.
Referring to the figures. Fig. 3 is a block diagram illustrating a mote assigned with one or more degree of reliabilities for delivery of plurality of data packet based on the corresponding assigned importance level of the respective data, according to one embodiment of the present technique.
In the exemplary example one or more motes may be placed or implanted in a conference room for gathering the temperature details within the room. The sensor may be assumed as electrical sensor. The mote is configured to monitor the temperature information with in a range varying from 20 degree centigrade to 40 degree centigrade with in the room and update the information periodically to a base station. If the temperature varies out of the range the mote may alert the base station about the variation. The details provided are just for illustration purpose, the same should not be limiting the scope of principle of the present technique.
In the illustrative example, the respective mote before being assigned with one or more degree of reliabilities for delivery of the plurality of data packets, there are few steps which are detailed in the subsequent section, for maintaining the flow of transmitting the data packets from the respective mote and the same is not illustrated in figure 3. In step one; one or more motes may be implanted in the room, and each mote may be in an idle mode 305. In step two; the respective mode may then establish a first optimal path based on the advertisement received from the base station for transmitting the information gathered by the sensor reading or the request message. In step 3; the respective mote gather the temperature details from the room and forms a plurality of data packets. The respective mote may also form the plurality of reply data packets for the request message from the base station. Step 4; the plurality of data packets are assigned with a pre-defined importance level based on an application loaded in the respective mote. The respective mote then starts to transmit the plurality of data packets to the base station.

The respective mote may be assigned with a best effort degree of reliabilities 315 from the idle mode 305 for the delivery of the plurality of data packets, as represented by arrow 310. In the best effort mode 315, the respective mote transmits one or more data packets with low importance level to the intermediate mote in the first optimal path and waits for a first set of acknowledgment from the intermediate mote. In the exemplary embodiment, the respective mote may transmit the temperature information with in a range to the base station. On receipt of the first set of acknowledgement the respective mote may be assigned with a low power mode degree of reliabilities 330, as represented by the arrow 320 for continuously transmitting the plurality of data packets. In the low power mode, the respective mote may transmit the plurality of data packets to the intermediate mote for a defined first time interval and may not wait for the receipt of the first set of acknowledgment.
On completion of the defined first time interval, the respective mote may be assigned once again with the best effort mode 315 as represented by arrow 335. Also, if the respective mote generates the data packets with high importance level, the respective mote even though in the low power mote 330 may be interrupted and may be assigned with the best effort mode 315, as represented by arrow 335 to transmit to the base station. In the exemplary embodiment, the respective mote may transmit the abnormal temperature information which is out of the range to the base station. The plurality of data packets may be formed for the abnormal temperature information and the high relevancy may be assigned to it, for transmitting to the base station.
Once again in the best effort mode 315, the respective mote may transmit one or more data packets with high importance level to the intermediate mote in the first optimal path and may wait for a first set of acknowledgment fi-om the intermediate mote. On receipt of the first set of acknowledgement the respective mote may be assigned with a high reliability mode degree of reliabilities 340, as represented by the arrow 325 for transmitting the plurality of data packets to the base station and wait for a second set of acknowledgment from the base station for a defined second time interval. The respective mote may remain in the high reliability mode 340 for a defined second time interval and wait for the second set of

acknowledgement. On receipt of the second set of acknowledgement the mote may be assigned back to best effort mode 315, as represented by arrow 345. The mote may later resume the task of transmitting the plurality of data packets with low importance level by sequentially first transmitting the data packets in best effort mode 315 and switch to the low power mode 330, as represented by arrow 320, as detailed in above.
If the mote in the high reliable mode 340 does not receive the second set of acknowledgement for the defined second time interval, then the mote may be assigned with a panic mode 355, as represented in the arrow 350. In the panic mode the respective mote may broadcast the plurality of data packets to the base station or to the intermediate mote. The mote may either be assigned to the low power mote 330, as represented by arrow 360 or to the best effort mode 315, as represented by arrow 365. The mote in the best effort may get back to idle mode 305, if the respective mote does not receive the advertisement from the base station for a define time gap. The mote may also go back to idle mode 305, if there are no data packets to be transmitted by the respective mote, while in the best effort mode 315 for a define time gap.
In one embodiment of the present technique, the main advantages include reducing at least one of battery consumption or memory utilization or both by one or more motes for transmitting a plurality of information in a wireless sensor network. Also, the mote may ensure one or more degree of reliabilities for delivery of data packets formed by the respective mote from the information either gathered from the sensor reading or the request message or both.
Exemplary Computing Environment
One or more of the above-described techniques can be implemented in or involve one or more computer systems. Figure 4 illustrates a generalized example of a computing environment 400. The computing environment 400 is not intended to suggest any limitation as to scope of use or functionality of described embodiments.
With reference to Figure 4, the computing environment 400 includes at least one processing unit 410 and memory 420. In Figure 4, this most basic

configuration 430 is included within a dashed line. The processing unit 410 executes computer-executable instructions and may be a real or a virtual processor. In a multi¬processing system, multiple processing units execute computer-executable instructions to increase processing power. The memory 420 may be volatile memory (e.g., registers, cache, RAM), non-volatile memory (e.g., ROM, EEPROM, flash memory, etc.), or some combination of the two. In some embodiments, the memory 420 stores software 480 implementing described techniques.
A computing envirorment may have additional features. For example, the computing environment 400 includes storage 440, one or more input devices 450, one or more output devices 460, and one or more communication connections 470. An interconnection mechanism (not shown) such as a bus, controller, or network interconnects the components of the computing enviroment 400. Typically, operating system software (not shown) provides an operating envirormient for other software executing in the computing environment 400, and coordinates activities of the components of the computing envirormient 400.
The storage 440 may be removable or non-removable, and includes magnetic disks, magnetic tapes or cassettes, CD-ROMs, CD-RWs, DVDs, or any other medium which can be used to store information and which can be accessed within the computing environment 400. In some embodiments, the storage 440 stores instructions for the software 480.
The input device(s) 450 may be a touch input device such as a keyboard, mouse, pen, trackball, touch screen, or game controller, a voice input device, a scanning device, a digital camera, or another device that provides input to the computing environment 400. The output device(s) 460 may be a display, printer, speaker, or another device that provides output from the computing environment 400.
The communication cormection(s) 470 enable commimication over a communication medium to another computing entity. The communication medium conveys information such as computer-executable instructions, audio or video information, or other data in a modulated data signal. A modulated data signal is a

signal that has one or more of its characteristics set or changed in such a manner as to encode information in the signal. By way of example, and not limitation, communication media include wired or wireless techniques implemented with an electrical, optical, RP, infrared, acoustic, or other carrier.
Implementations can be described in the general context of computer-readable media. Computer-readable media are any available media that can be accessed within a computing environment. By way of example, and not limitation, within the computing environment 400, computer-readable media include memory 420, storage 440, communication media, and combinations of any of the above.
Having described and illustrated the principles of our invention with reference to described embodiments, it will be recognized that the described embodiments can be modified in arrangement and detail without departing from such principles. It should be understood that the programs, processes, or methods described herein are not related or limited to any particular type of computing environment, unless indicated otherwise. Various types of general purpose or specialized computing environments may be used with or perform operations in accordance with the teachings described herein. Elements of the described embodiments shown in software may be implemented in hardware and vice versa.
In view of the many possible embodiments to which the principles of our invention may be applied, we claim as our invention all such embodiments as may come within the scope and spirit of the following claims and equivalents thereto.

1We Claim:
1. A method of transmitting a plurality of information by one or more
motes in a wireless sensor network, the method comprising:
establishing a first optimal path from the respective mote to a base station by automatically minimizing the intermediate motes required to transmit the plurality of information to the base station in the wireless sensor network;
forming a plurality of data packets by embedding the information gathered from at least one of a sensor reading or a request message or both from the surrounding envirorment;
assigning a pre-defined importance level to each of the formed data packet based on requirement of an application loaded in the respective mote;
assigning one or more degree of reliabilities to the respective mote for delivery of each data packet based on the corresponding assigned importance level of the respective data packet; and
transmitting the respective data packet to the base station through the optimal path with the corresponding degree of reliabilities for delivery assigned for the respective data packet.
2. The method as recited in claim 1, wherein the first optimal path for transmitting each of the formed data packets includes at least one of the intermediate mote or a direct communication to the base station or both.
3. The method as recited in claim 1, further comprising transmitting a plurality of data packets formed for the request message in a second optimal path, by the base station to the respective mote in the wireless sensor network.

4. The method of claim 3, wherein the second optimal path is established by the base station to transmit the plurality of formed data packets to the respective mote by automatically reversing the first optimal path information obtained from the data packets of the respective motes received by the base station.
5. The method as recited in claim 1, further comprising broadcasting a plurality of data packets formed for an advertisement of the base station to one or more motes in the wireless sensor network.
6. The method as recited in claim 1, wherein the information gathered from the sensor reading from the surrounding environment includes at least one of a regular message or a special message or a pluraity of acknowledgement or combinations thereof
7. The method as recited in claim 1, wherein the information gathered from the request message from the surrounding environment includes a control instruction or a data sent from the base station.
8. The method as recited in claim 1, wherein the pre-defined importance level for each data packet is assigned based on requirement of the application using a set of business rules defined in it.

9. The method of claim 8, wherein the pre-defined importance level for each data packet includes at least one of a high importance level or a low importance level or both.
10. The method of claim 9, wherein the low importance level for the respective data packet includes assigning at least one of a best effort mode degree of reliabilities for delivery of data packets or a low power mode degree of reliabilities for delivery of data packets or both.
11. The method of claim 9, wherein the high importance level for the respective data packet includes assigning at least one of a high reliability mode degree of reliabilities for delivery of data packets or a panic mode degree of reliabilities for delivery of data packets or both.
12. The method of claim 10, wherein the best effort mode degree of reliabilities for delivery of data packets includes transmitting the plurality of data packets from the respective mote with low importance level and waiting for a receipt of first set of acknowledgment for successful delivery of the plurality of data packets from the intermediate mote.
13. The method of claim 10, wherein the low power mode degree of reliabilities for delivery of data packets includes transmitting the plurality of data packets from the respective mote with low importance level for a defined first time interval without waiting for the receipt of first set of acknowledgment for successful delivery of plurality of data packets from the intermediate mote.

14. The method of claim 11, wherein the high reliability mode degree of reliabilities for delivery of data packets includes transmitting the plurality of data packets from the respective mote with high importance level and waiting for the receipt of a second set of acknowledgments for successful delivery of plurality of data packets from the base station for a defined second time interval.
15. The method of claim 14, further comprises transmitting the plurality of data packets from the respective mote with high importance level after the second time interval and waiting for the receipt of a third set of acknowledgement for successful delivery of plurality of data packets from the base station for a defined third time interval.
16. The method of claim 11, wherein the panic mode degree of reliabilities for delivery of data packets includes broadcasting the plurality of data packets fi-om the respective mote with high importance level to at least one or more motes or to the base station or both after at least one of the defined second time interval or the defined third time interval.
17. A method of reducing at least one of battery consmuption or memory utilization or both by one or more motes for transmitting a plurality of information in a wireless sensor network, the method comprising:
assigning at least one of a high importance level or a low importance level or both for a plurality of data packets formed by embedding the information gathered from at least one of a sensor reading or a request message or both from the surrounding environment;

transmitting the plurality of data packets with different pre-defined importance level through a first optimal path from the respective mote to a base station, wherein transmitting one or more data packets comprising:
receiving a first set of acknowledgement of successful delivery of a low importance data packets from the intermediate mote in the optimal path to the base station;
continuously transmitting the plurality of data packets with the low importance level to the base station with out waiting for a second set of acknowledgement of successful delivery from the intermediate mote for a defined first time interval; and
transmitting the plurality of data packets with a high importance level to the base station and waiting for a third set of acknowledgement of successfiil delivery from the base station for a defined second time interval.
18. The method as recited in claim 17, wherein assigning the plurality of data packets with the low importance level includes a regular message sensed from the sensor from the surrounding environment.
19. The method as recited in claim 17, wherein assigning the plurality of data packets with the high importance level includes a special message sensed from the sensor from the surrounding environment.
20. The method as recited in claim 17, wherein assigning the plurality of data packets with the high importance level includes a control message sensed from the sensor sent from the base station.

20. A computer program product comprising a computer usable medium having a computer readable program code embodied therein for transmitting a plurality of information by one or more motes in a wireless sensor network, the method comprising:
program code adapted for establishing a first optimal path from the respective mote to a base station by automatically minimizing the intermediate motes required to transmit the plurality of information to the base station in the wireless sensor network;
program code adapted for forming a plurality of data packets by embedding the information gathered from at least one of a sensor reading or a request message or both from the surrounding envirorunent;
program code adapted for assigning a pre-defined importance level to each of the formed data packet based on requirement of an application loaded in the respective mote;
program code adapted for assigning one or more degree of reliabilities to the respective mote for delivery of each data packet based on the corresponding assigned importance level of the respective data packet; and
program code adapted for transmitting the respective data packet to the base station through the optimal path with the corresponding degree of reliabilities for delivery assigned for the respective data packet.
22. The product as recited in claim 21, further comprising program code adapted for transmitting a plurality of formed data packets in a second optimal path for the request message generated by the base station to the respective mote in the wireless sensor network.
23. The product as recited in claim 21, further comprising program code adapted for established the second optimal path by the base station to transmit the

plurality of fonned data packets to the respective mote by reversing information obtained from the first optimal path used by the respective mote to reach the base station.
24. The product as recited in claim 21, further comprising program code
adapted for is assigning the pre-defined importance level for each data packet based
on requirement of the application using a set of business rules defined in it.
25. The product as recited in claim 21, wherein the pre-defined importance
level for each data packet includes at least one of a high importance level or a low
importance level or both.
26. The product of claim 25, further comprising program code adapted for
assigning the low importance level for the respective data packet with at least one of a
best effort mode degree of reliabilities for delivery of data packets or a low power
mode degree of reliabilities for delivery of data packets or combinations thereof.
27. The product of claim 25, further comprising program code adapted for
assigning the high importance level for the respective data packet with at least one of
a high reliability mode degree of reliabilities for delivery of data packets or a panic
mode degree of reliabilities for delivery of data packets or both.

Documents

Orders

Section Controller Decision Date

Application Documents

# Name Date
1 1432-CHE-2008 FORM-18 06-10-2009.pdf 2009-10-06
1 1432-CHE-2008-RELEVANT DOCUMENTS [26-09-2022(online)].pdf 2022-09-26
2 1432-CHE-2008 FORM-13 28-10-2009.pdf 2009-10-28
2 1432-CHE-2008-RELEVANT DOCUMENTS [25-11-2021(online)].pdf 2021-11-25
3 1432-CHE-2008-PROOF OF ALTERATION [06-10-2020(online)].pdf 2020-10-06
3 1432-che-2008 form-5.pdf 2011-09-03
4 1432-CHE-2008-FORM-26 [02-10-2020(online)].pdf 2020-10-02
4 1432-che-2008 form-3.pdf 2011-09-03
5 AdditionalFeeRestoration.pdf_1.pdf 2017-07-14
5 1432-che-2008 form-1.pdf 2011-09-03
6 AdditionalFeeRestoration.pdf 2017-07-07
6 1432-che-2008 drawings.pdf 2011-09-03
7 Other Document [22-06-2017(online)].pdf 2017-06-22
7 1432-che-2008 description(complete).pdf 2011-09-03
8 Abstract_Granted 281553_21-03-2017.pdf 2017-03-21
8 1432-che-2008 correspondence-others.pdf 2011-09-03
9 1432-che-2008 claims.pdf 2011-09-03
9 Claims_Granted 281553_21-03-2017.pdf 2017-03-21
10 1432-che-2008 abstract.pdf 2011-09-03
10 Description_Granted 281553_21-03-2017.pdf 2017-03-21
11 1432-CHE-2008 CORRESPONDENCE OTHERS 05-03-2015.pdf 2015-03-05
11 Drawings_Granted 281553_21-03-2017.pdf 2017-03-21
12 1432-CHE-2008 FORM-13 03-06-2015.pdf 2015-06-03
12 Other Patent Document [17-03-2017(online)].pdf 2017-03-17
13 1432-CHE-2008 FORM-1 03-06-2015.pdf 2015-06-03
13 1432-CHE-2008_EXAMREPORT.pdf 2016-07-02
14 1432-CHE-2008 CORRESPONDENCE OTHERS 03-06-2015.pdf 2015-06-03
14 1432-CHE-2008-Examination Report Reply Recieved-190116.pdf 2016-02-09
15 1432-CHE-2008 AMENDED PAGES OF SPECIFICATION 03-06-2015.pdf 2015-06-03
15 1432-CHE-2008-Other Patent Document-190116.pdf 2016-02-09
16 1432-CHE-2008-Correspondence-180116.pdf 2016-02-08
16 1432-CHE-2008-Form 1-151215.pdf 2016-01-07
17 1432-CHE-2008-Form 1-180116.pdf 2016-02-08
17 1432-CHE-2008-Examination Report Reply Recieved-151215.pdf 2016-01-07
18 1432-CHE-2008-Abstract-151215.pdf 2016-01-07
18 1432-CHE-2008-Claims-151215.pdf 2016-01-07
19 1432-CHE-2008-Abstract-151215.pdf 2016-01-07
19 1432-CHE-2008-Claims-151215.pdf 2016-01-07
20 1432-CHE-2008-Examination Report Reply Recieved-151215.pdf 2016-01-07
20 1432-CHE-2008-Form 1-180116.pdf 2016-02-08
21 1432-CHE-2008-Correspondence-180116.pdf 2016-02-08
21 1432-CHE-2008-Form 1-151215.pdf 2016-01-07
22 1432-CHE-2008 AMENDED PAGES OF SPECIFICATION 03-06-2015.pdf 2015-06-03
22 1432-CHE-2008-Other Patent Document-190116.pdf 2016-02-09
23 1432-CHE-2008-Examination Report Reply Recieved-190116.pdf 2016-02-09
23 1432-CHE-2008 CORRESPONDENCE OTHERS 03-06-2015.pdf 2015-06-03
24 1432-CHE-2008 FORM-1 03-06-2015.pdf 2015-06-03
24 1432-CHE-2008_EXAMREPORT.pdf 2016-07-02
25 1432-CHE-2008 FORM-13 03-06-2015.pdf 2015-06-03
25 Other Patent Document [17-03-2017(online)].pdf 2017-03-17
26 1432-CHE-2008 CORRESPONDENCE OTHERS 05-03-2015.pdf 2015-03-05
26 Drawings_Granted 281553_21-03-2017.pdf 2017-03-21
27 1432-che-2008 abstract.pdf 2011-09-03
27 Description_Granted 281553_21-03-2017.pdf 2017-03-21
28 1432-che-2008 claims.pdf 2011-09-03
28 Claims_Granted 281553_21-03-2017.pdf 2017-03-21
29 1432-che-2008 correspondence-others.pdf 2011-09-03
29 Abstract_Granted 281553_21-03-2017.pdf 2017-03-21
30 Other Document [22-06-2017(online)].pdf 2017-06-22
30 1432-che-2008 description(complete).pdf 2011-09-03
31 AdditionalFeeRestoration.pdf 2017-07-07
31 1432-che-2008 drawings.pdf 2011-09-03
32 AdditionalFeeRestoration.pdf_1.pdf 2017-07-14
32 1432-che-2008 form-1.pdf 2011-09-03
33 1432-CHE-2008-FORM-26 [02-10-2020(online)].pdf 2020-10-02
33 1432-che-2008 form-3.pdf 2011-09-03
34 1432-CHE-2008-PROOF OF ALTERATION [06-10-2020(online)].pdf 2020-10-06
34 1432-che-2008 form-5.pdf 2011-09-03
35 1432-CHE-2008-RELEVANT DOCUMENTS [25-11-2021(online)].pdf 2021-11-25
35 1432-CHE-2008 FORM-13 28-10-2009.pdf 2009-10-28
36 1432-CHE-2008 FORM-18 06-10-2009.pdf 2009-10-06
36 1432-CHE-2008-RELEVANT DOCUMENTS [26-09-2022(online)].pdf 2022-09-26

ERegister / Renewals

3rd: 22 Jun 2017

From 12/06/2010 - To 12/06/2011

4th: 22 Jun 2017

From 12/06/2011 - To 12/06/2012

5th: 22 Jun 2017

From 12/06/2012 - To 12/06/2013

6th: 22 Jun 2017

From 12/06/2013 - To 12/06/2014

7th: 22 Jun 2017

From 12/06/2014 - To 12/06/2015

8th: 22 Jun 2017

From 12/06/2015 - To 12/06/2016

9th: 22 Jun 2017

From 12/06/2016 - To 12/06/2017

10th: 22 Jun 2017

From 12/06/2017 - To 12/06/2018

11th: 05 Jun 2018

From 12/06/2018 - To 12/06/2019

12th: 05 Jun 2018

From 12/06/2019 - To 12/06/2020

13th: 05 Jun 2018

From 12/06/2020 - To 12/06/2021

14th: 05 Jun 2018

From 12/06/2021 - To 12/06/2022

15th: 05 Jun 2018

From 12/06/2022 - To 12/06/2023

16th: 05 Jun 2018

From 12/06/2023 - To 12/06/2024

17th: 05 Jun 2018

From 12/06/2024 - To 12/06/2025