MULTI-SERVICE ADAPTABLE ROUTING PROTOCOL FOR WIRELESS SENSOR NETWORKS

• US 20110149844A1
• Filed: 03/18/2010
• Published: 06/23/2011
• Est. Priority Date: 12/21/2009
• Status: Active Grant

• Current Assignee: Manipal Institute of Technology
• Original Assignee: Manipal Institute of Technology
• Inventors: Pai, Manohara M.M., G., Aravind K.
• Granted Patent: US 8,295,280 B2
• Time in Patent Office: Days
• US Class Current: 370/328
• CPC Class Codes: H04L 45/122 by minimising distances, e.g. by selecting a route with minimum of number of hops
• CPC Class Codes: H04L 45/22 Alternate routing
• CPC Class Codes: H04W 40/10 based on available power or energy
• CPC Class Codes: H04W 40/12 based on transmission quality or channel quality
• CPC Class Codes: Y02D 30/00 Reducing energy consumption in communication networks
• CPC Class Codes: Y02D 30/70 in wireless communication networks

Abstract

In accordance with various aspects of the present disclosure, an apparatus is disclosed that includes a sensor node configured to operate in a wireless sensor network, wherein the sensor node is configured to receive a data packet that comprises a quality of service field, examine the quality of service field, and invoke one of a plurality of pre-stored algorithms depending on the value of the quality of service field.

Claims

1. An apparatus comprising:

a sensor node configured to operate in a wireless sensor network, wherein the sensor node is configured to receive a data packet that comprises a quality of service field, to examine the quality of service field, and to invoke one of a plurality of pre-stored algorithms depending on the value of the quality of service field.

2. The apparatus according to claim 1, wherein the quality of service field is application dependent.

3. The apparatus according to claim 2, wherein the quality of service field indicates that the application dependency relates to energy efficiencies, reliability, latency, or one or more thereof.

4. The apparatus according to claim 1, wherein one of the plurality of pre-stored algorithms is for energy-efficient packet routing within the wireless sensor network.

5. The apparatus according to claim 1, wherein one of the plurality of pre-stored algorithms is for high-reliability packet routing within the wireless sensor network.

6. The apparatus according to claim 1, wherein one of the plurality of pre-stored algorithms is for low latency packet routing within the wireless sensor network.

7. The apparatus according to claim 1, wherein one of the plurality of pre-stored algorithms is for high-reliability and low latency packet routing within the wireless sensor network.

8. A system comprising:

a plurality of sensor nodes arranged in a wireless sensor network, wherein each sensor node is configured to receive and broadcast data packets, wherein each of the plurality of sensor nodes can dispatch the data packet using one or more modes depending on a quality of service indicator that comprises the data packet.

9. The system according to claim 8, wherein the quality of service indicator is application dependent.

10. The system according to claim 9, wherein the quality of service indicator indicates that the application dependency relates to energy efficiencies, reliability, latency, or one of more thereof.

11. The system according to claim 8, wherein the one or more modes includes an energy-efficient packet routing mode for routing data packets within the wireless sensor network.

12. The system according to claim 8, wherein the one or more modes includes a high-reliability packet routing mode for routing data packets within the wireless sensor network.

13. The system according to claim 8, wherein the one or more modes includes a low latency packet routing mode for routing data packets within the wireless sensor network.

14. The system according to claim 8, wherein the one or more modes includes a high-reliability and a low latency packet routing within the wireless sensor network.

15. A method comprising:

transmitting a query packet to one or more sensor nodes within a wireless sensor network by a sink node, wherein the query packet is not constrained by a reliability requirement or latency requirement, and wherein the query packet includes a Type of Service Bit that is set to a value denoting a normal application;

updating a table stored in the one or more sensor nodes with information of an adjacent sensor node within the wireless sensor network from which it has received the query packet; and

using the table in conjunction with a routing algorithm to route a data packet.

16. The method according to claim 15, wherein the information includes node identity information, an energy-level of each adjacent sensor node, and a node identification of three adjacent nodes that have least-hop counts from the sink node.

17. The method according to claim 15, wherein the data packet includes a quality of service field.

18. The method according to claim 17, wherein the quality of service field indicates that the application dependency relates one or more of energy efficiencies, reliability or latency.

19. The method according to claim 17, wherein the one or more sensor nodes is configured to invoke the routing algorithm depending on the value of the quality of service field.

20. The method according to claim 15, wherein the table is updated with information selected from the group consisting of:

a node ID of a neighbor node from which a query packet was received, an energy level of the neighbor node, and a node ID of the neighbor node that has least-hop counts from the sink node.