Method of providing routing protocol in sensor network

• US 7,460,532 B2
• Filed: 09/27/2004
• Issued: 12/02/2008
• Est. Priority Date: 12/19/2003
• Status: Expired due to Fees

• Current Assignee: Electronics and Telecommunications Research Institute
• Original Assignee: Electronics and Telecommunications Research Institute
• Inventors: Kim, Dae Young, Park, Seung Min, Lim, Yong Jin, Shin, Changmin, Ryu, Jae Hyuk
• Primary Examiner(s): Nguyen; Steven H
• Assistant Examiner(s): Hailu; Kibrom T
• Application Number:
  US10/951,987
• Publication Number:
  US 20050135360A1
• Time in Patent Office: 1,527 Days
• Field of Search: 370/389, 370/238, 370/338, 370/392, 370354-356, 370400-401, 370/252
• US Class Current: 370/389
• CPC Class Codes: H04L 45/00 Routing or path finding of packets in data switching networks routing or path finding in wireless networks H04W40/00
• CPC Class Codes: H04L 45/26 Route discovery packet
• CPC Class Codes: H04W 40/08 based on transmission power
• CPC Class Codes: Y02D 30/70 in wireless communication networks

Abstract

A method of providing a routing protocol in a sensor network includes the steps of: initializing a routing table and searching a network device of a node to initialize a host; opening a socket when there is a request for forwarding of an IP (Internet Protocol) packet from an upper layer or when there is a request through the network device; determining whether there is the IP packet forwarding request of the upper layer node or whether the packet is received from the network device; if there is the IP packet forwarding request of the upper layer, searching the routing table, and determining whether or not there is a destination node which intends to transmit the packet, and returning to a main loop if there is the destination node; and if the packet is received through the network device, determining types of the received packets and performing RREQ (route request) process, IDLE process, RREP (route reply) process, RERR (route error) process, and RREP_ACK (route reply acknowledgement) process.

Claims

1. A method of providing a routing protocol in a sensor network, the method comprising the steps of:

(a1) initializing a routing table;

(a2) searching a network device of a node to initialize a host;

(b) opening a packet socket when there is a request for forwarding of an IP (Internet Protocol) packet from an upper layer node or when there is a request from the network device;

(c) determining whether the request is received from the upper layer node or the IP packet is received from the network device;

(d) if the request is received from the upper layer node, searching the routing table to determine whether or not there is a destination node which intends to transmit the IP packet, and returning to the step (c) if there is the destination node; and

(e) if the IP packet is received from the network device, determining a type of the received IP packet and performing an RREQ (route request) process, an IDLE process, an RREP (route reply) process, an RERR (route error) process, and an RREP_ACK (route reply acknowledgement) process, wherein the step (e) includes steps of;

(f) if the received IP packet is RREQ, extracting an energy field value of an RREQ message and determining whether the energy field value is ‘

0’

or not;

(g) if the energy field value is ‘

0’

, setting the RREO packet to ‘

10’

in an amount of energy, and if the energy field value is not ‘

0’

, checking whether a current node has processed the RREO;

(h) if the current node has never processed the RREQ, measuring an amount of energy at the current node and comparing the measured amount of energy with a first threshold value;

(i) if the amount of energy at the current node is smaller than the first threshold value, determining whether or not a difference between the energy of the current node and the energy field value of the received RREQ packet is larger than a second threshold value, and if smaller, setting the energy field value of the RREQ packet to ‘

10’

, and if larger, setting the energy field to an IDLE message; and

(j) if the amount of energy at the node is larger than the second threshold value, forwarding the RREQ packet to next node in the same manner as a general RREQ packet forwarding.

2. The method of claim 1, wherein in the step (d), if the routing table does not indicate the destination node, an RREQ packet is forwarded after setting a corresponding energy field.

3. The method of claim 1, wherein the step (j) includes the steps of:

storing a reverse path for forwarding the RREQ packet and determining whether information about a destination node of the packet is present at a current node; and

if there is the information about the destination node, updating the routing table and forwarding the RREP message using the reverse path.

4. The method of claim 1, wherein the step (e) further includes the steps of:

if the received packet is an IDLE, determining whether or not an original address of the received message is equal to an address of a local node receiving the IDLE packet;

if the original address is not equal to the local node, determining whether or not the number of nodes whose hop count of the routing table is ‘

1’

is equal to two;

if not equal, increasing an IDLE count value by one;

comparing the number of nodes having hop count ‘

1’

with the IDLE count value; and

if the number of the nodes having the hop count of ‘

1’

is equal to the IDLE count value, setting an energy to ‘

0’

; and

setting a field value of the RREQ message.

5. The method of claim 1, wherein the step (e) further includes the steps of:

if the received packet is RREP, determining whether information about the destination is present at the routing table;

if the information is present, updating information of the routing table, and if the information is not present, adding the information to the routing table;

checking whether an original address of the RRFP packet is equal to that of a current node; and

if the original address of the RREP packet is equal to that of the current node, ending the RREP forwarding process, and if not, forwarding the RREP packet through a reverse path.

6. The method of claim 1, wherein the step (e) further includes the steps of:

if the received packet is RERR, searching a routing table and clearing an entry corresponding to the RERR;

checking whether or not there is other entry affected by the RERR;

if there are other entries affected by the RERR, making a list of items and clearing the entries; and

checking whether or not there are items affecting neighboring nodes;

if there are the items affecting the neighboring nodes, forwarding the RERR to all neighbors included in the list over unicast or broadcast.

7. The method of claim 1, wherein the step (e) includes the step of:

if the received packet is RREP_ACK, stopping a timer driven by forwarding through a specific option of the RREP and returning to the step (c).