Topology aware MANET for mobile networks

• US 7,936,697 B2
• Filed: 08/30/2007
• Issued: 05/03/2011
• Est. Priority Date: 08/30/2007
• Status: Active Grant

• Current Assignee: BAE Systems Information and Electronic Systems Integration Incorporated (BAE Systems Plc)
• Original Assignee: BAE Systems Information and Electronic Systems Integration Incorporated (BAE Systems Plc)
• Inventors: Reza, Ghanadan, Gu, John A., Hsu, Jessica Y., SADOSUK, Gregory S., KHUU, Phong C.
• Primary Examiner(s): Vu, Huy D
• Assistant Examiner(s): Hailu, Kibrom T
• Application Number:
  US11/897,474
• Publication Number:
  US 20090059816A1
• Time in Patent Office: 1,342 Days
• Field of Search: 370/328, 370/310, 370/256, 370/252
• US Class Current: 370/252
• CPC Class Codes: H04L 41/0816 the condition being an adaptation, e.g. in response to network events
• CPC Class Codes: H04L 41/082 the condition being updates or upgrades of network functionality
• CPC Class Codes: H04L 41/12 Discovery or management of network topologies
• CPC Class Codes: H04L 43/16 Threshold monitoring
• CPC Class Codes: H04L 45/02 Topology update or discovery
• CPC Class Codes: H04L 45/04 Interdomain routing, e.g. hierarchical routing
• CPC Class Codes: H04L 47/11 Identifying congestion
• CPC Class Codes: H04L 47/122 by diverting traffic away from congested entities
• CPC Class Codes: H04L 47/22 Traffic shaping
• CPC Class Codes: H04L 47/2483 involving identification of individual flows
• CPC Class Codes: H04W 24/08 Testing, supervising or monitoring using real traffic
• CPC Class Codes: H04W 28/021 in wireless networks with changing topologies, e.g. ad-hoc networks self-organizing networks H04W84/18
• CPC Class Codes: H04W 40/12 based on transmission quality or channel quality
• CPC Class Codes: H04W 40/14 based on stability
• CPC Class Codes: H04W 40/248 Connectivity information update
• CPC Class Codes: H04W 40/26 for hybrid routing by combining proactive and reactive routing
• CPC Class Codes: H04W 40/32 for defining a routing cluster membership
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks
• CPC Class Codes: H04W 84/20 Master-slave selection or change arrangements

Abstract

Systems and methods provide adaptability in a mobile ad hoc network (MANET), based on an existing protocol, such as adaptive hybrid domain routing (AHDR). The systems and methods are especially suited for fast changing topologies that may change after a reactive route discovery has been completed.

Claims

1. A method for adaptively selecting a domain lead node from among a set of nodes in a mobile ad hoc network, the method comprising:

(a) establishing a link change threshold percentage;

(b) establishing a threshold delta link state level (LSL) increment value;

(c) calculating, by each node in the network, for each node in the network what percentage of links have changed by more than the threshold delta link state level (LSL) increment value;

(d) determining, by each node in the network, if the calculated percentage of changed links for the given node exceeds the link change percentage threshold;

(e) adaptively computing, by each node in the network, a node coverage value (NC) for each node from among the set of nodes in the network by adaptively adjusting a state value, s₀, for each node, downward, in response to satisfying said determining step (d); and

(f) selecting, by the set of nodes in the network, said domain lead node from among said set of nodes in said network based on a highest computed node coverage value (NC).

2. A method according to claim 1, wherein said determining step (d) is performed at successive update increments.

3. A method according to claim 1, wherein the link change threshold percentage is adjusted in accordance with a type of network.

4. A method for adaptively selecting a domain lead node from among a set of nodes in a mobile ad hoc network, the method comprising:

for a given node from among said set of nodes, computing, by the given node, a node coverage (NC) value by;

(a) adaptively adjusting a plurality of weight values for neighbor nodes seen by said given node, wherein said adaptive adjustment is based upon at least one of a current state of said neighbor nodes and a current link state level (LSL) of said neighbor nodes; and

(b) selecting, b set of nodes in the network, said domain lead node from among said set of nodes based on a given node having a highest computed node coverage value (NC),

wherein said node coverage value for node A is adaptively computed as;

NC(A)=s₀*[w₀*n+(w₁*s₁+w₂*s₂+w₃*s₃+ . . . +w_n*s_n)]

where

s₀=a state of node A,

s₁ . . . s_n=a state of each neighbor node,

n=a total number of nodes within 1 hop around node A,

w₀=an adaptive weight put on a number of nodes, and

w₁ . . . w_n=weights of each neighbor node depending on the state and the LSL.

5. A method according to claim 4, wherein said weight values w_n are computed as:

w_n=(LSL_n*min(1,max(0,LSL_n−

a)))+(z*max(0,(LSL_n−

(15−

b))))

where

a=sets how many of the bottom LSLs get zeroed,

b=sets how many of the top LSLs get scaled up,

n is a positive integer, and

z=weight of higher LSL.

6. A method for adaptively selecting a domain lead node from among a set of nodes in a mobile ad hoc network, the method comprising:

for a given node from among said set of nodes, computing, by the given node, a node coverage (NC) value by;

(a) adaptively adjusting an adaptive weight w0 parameter in accordance with the number of neighbor nodes N seen by said given node; and

(b) selecting, by the set of nodes in the network, said domain lead node from among said set of nodes based on a given node having a highest computed node coverage value (NC),

wherein said node coverage value for a node A is adaptively computed as;

NC(A)=s₀*[w₀*n+(w₁*s₁+w₂*s₂+w₃*s₃+ . . . +w_n*s_n)]

where

s₀=a state of node A,

s₁ . . . s_n=a state of each neighbor node,

n=a total number of nodes within 1 hop around node A,

w₀=an adaptive weight put on a number of nodes, and

w₁ . . . w_n=weights of each neighbor node depending on the state and the LSL.

7. A method for adaptively selecting a domain lead node from among a set of nodes in a mobile ad hoc network, the method comprising:

for a given node from among said set of nodes, computing, by the given node, a node coverage (NC) value by;

(a) adaptively adjusting a plurality of weight values for neighbor nodes seen by said given node, wherein said adaptive adjustment is based upon at least one of a current state of said neighbor nodes and a current link state level (LSL) of said neighbor nodes; and

(b) selecting, by the set of nodes in the network, said domain lead node from among said set of nodes based on a given node having a highest computed node coverage value (NC),

wherein said weight values w_n are computed as;

w_n=(LSL_n*min(1,max(0,LSL_n−

a)))+(z*max(0,(LSL_n−

(15−

b))))

where

a=sets how many of the bottom LSLs get zeroed,

b=sets how many of the top LSLs get scaled up,

n is a positive integer, and

z=weight of higher LSL.