# US 10,320,901 B2 · Contextual information for a peer-to-peer network

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 10,320,901 B2
- Document ID: US10320901B2
- Status: Granted
- Kind: B2
- Application number: 14/948,862
- Filed: 2015-11-23
- Published: 2017-05-25
- Granted: 2019-06-11
- Earliest claimed: 2015-11-23
- Assignees: The United States of America as represented by the Secretary of the Army
- Applicants: The United States of America, as represented by the Secretary of the Army
- Inventors: Radhika Roy
- Web page: https://patentgrep.com/patent/US10320901B2

## CPC

- H04L 67/1065: {Discovery involving distributed pre-established resource-based relationships among peers, e.g. based on distributed hash tables [DHT] (pre-configuration of logical or physical connections H04L67/1053)}
- H04L 45/02: Topology update or discovery
- H04L 45/7453: using hashing
- H04W 84/18: Self-organising networks, e.g. ad-hoc networks or sensor networks
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)

## Abstract

Various embodiments are described that relate to network communication. In a mobile peer-to-peer ad hoc network, nodes can use a context-aware key-based distribution hash table routing algorithm to create the route scheme. This can be done among nodes that are cluster-heads while nodes that are within a cluster can use a non-context based algorithm.

## Claims

### Claim 1

A non-transitory computer-readable medium, communicatively coupled to a processor, configured to store a command set executable by the processor to facilitate operation of a component set, the component set comprising:
a context component configured to gather a contextual information set for a peer-to-peer ad hoc network; and
a route component configured to create a route scheme for information communication in the peer-to-peer ad hoc network, where the creation of the route scheme is based, at least in part, on the contextual information set.

### Claim 2 (depends on 1)

The non-transitory computer-readable medium of claim 1, where the route component uses a context-aware key-based distribution hash table routing algorithm to create the route scheme.

### Claim 3 (depends on 2)

The non-transitory computer-readable medium of claim 2,
where the peer-to-peer ad hoc network comprises node clusters,
where the individual node clusters comprise a cluster head and at least one ordinary node,
where the route scheme is a first route scheme for information communicated from one cluster head to another, and
where the route component is configured to create a second route scheme for information communicated from one ordinary node to another ordinary node within an individual node cluster through use of a non-context-aware key-based distribution hash table routing algorithm.

### Claim 4 (depends on 1)

The non-transitory computer-readable medium of claim 1,
where the peer-to-peer ad hoc network is a mobile peer-to-peer ad hoc network and
where the contextual information set is, at least in part, information of a mobile ad hoc layer of the peer-to-peer ad hoc network.

### Claim 5 (depends on 4)

The non-transitory computer-readable medium of claim 4,
where the peer-to-peer ad hoc network is a decentralized peer-to-peer ad hoc network and
where the peer-to-peer ad hoc network is a mobile Voice-over-Internet Protocol peer-to-peer ad hoc network.

### Claim 6 (depends on 1)

The non-transitory computer-readable medium of claim 1, where the contextual information set, at least in part, is information of a peer-to-peer session initial protocol layer of the peer-to-peer ad hoc network.

### Claim 7 (depends on 1)

The non-transitory computer-readable medium of claim 1, the component set comprising:
an identification component configured to identify a transmission node of the peer-to-peer ad hoc network and a destination node of the peer-to-peer ad hoc network;
an evaluation component configured to evaluate a first node of the peer-to-peer ad hoc network and evaluate a second node of the peer-to-peer ad hoc network to produce an evaluation result; and
a selection component configured to make a selection of the first node, the second node, or a combination thereof,
where the selection is based, at least in part, on the evaluation result,
where the evaluation component is configured to evaluate the first node and the second node with regard to the contextual information set, and
where the route scheme indicates a path from the transmission node to the destination node by way of the node indicated in the selection.

### Claim 8 (depends on 1)

The non-transitory computer-readable medium of claim 1, where the contextual information set is, at least in part, quantitative information of the peer-to-peer ad hoc network, qualitative information of the peer-to-peer ad hoc network, or a combination thereof.

### Claim 9

A method, comprising:
obtaining a data set about a peer-to-peer network; and
developing, by way of a development processor, a context-based integrated peer-to-peer algorithm for the peer-to-peer network through use of the data set;
where the context-based integrated peer-to-peer algorithm forwards route traffic management in the peer-to-peer network.

### Claim 10 (depends on 9)

The method of claim 9, where developing the context-based integrated peer-to-peer algorithm comprises developing a peer-to-peer distributed hash table-based query algorithm.

### Claim 11 (depends on 9)

The method of claim 9, where developing the context-based integrated peer-to-peer algorithm comprises developing a peer-to-peer key-based routing protocol.

### Claim 12 (depends on 9)

The method of claim 9, where developing the context-based integrated peer-to-peer algorithm comprises developing a hierarchical cluster-based design algorithm.

### Claim 13 (depends on 9)

The method of claim 9, where developing the context-based integrated peer-to-peer algorithm comprises developing a peer-to-peer distributed hash table-based logical routing algorithm.

### Claim 14 (depends on 9)

The method of claim 9, where developing the context-based integrated peer-to-peer algorithm comprises developing a physical routing algorithm.

### Claim 15 (depends on 9)

The method of claim 9,
where developing the context-based integrated peer-to-peer algorithm comprises developing a peer-to-peer distributed hash table-based query algorithm,
where developing the context-based integrated peer-to-peer algorithm comprises developing a peer-to-peer key-based routing protocol,
where developing the context-based integrated peer-to-peer algorithm comprises developing a hierarchical cluster-based design algorithm,
where developing the context-based integrated peer-to-peer algorithm comprises developing peer-to-peer distributed hash table-based logical routing algorithm, and
where developing the context-based integrated peer-to-peer algorithm comprises developing a physical routing algorithm.

### Claim 16 (depends on 9)

The method of claim 9, comprising:
using the context-based integrated peer-to-peer algorithm to route traffic in the peer-to-peer network,
where the context-based integrated peer-to-peer algorithm considers quantitative information about the peer-to-peer network.

### Claim 17 (depends on 9)

The method of claim 9, comprising:
using the context-based integrated peer-to-peer algorithm to route traffic in the peer-to-peer network,
where the context-based integrated peer-to-peer algorithm considers qualitative information about the peer-to-peer network.

### Claim 18

A system, comprising:
a non-transitory computer-readable medium configured to retain a context-aware key-based distribution hash table routing algorithm; and
a processor configured to use the context-aware key-based distribution hash table routing algorithm to create an initiation protocol for a mobile peer-to-peer ad hoc network.

### Claim 19 (depends on 18)

The system of claim 18,
where the peer-to-peer ad hoc network comprises node clusters,
where the individual node clusters comprise a cluster head and at least one ordinary node,
where the processor uses the context-aware key-based distribution hash table routing algorithm to create an initiation protocol for communication between cluster heads, and
where information communication between ordinary nodes within an individual node cluster is accomplished by way of a non-context-aware key-based distribution hash table routing algorithm employed to create a within-cluster initiation protocol.

### Claim 20 (depends on 18)

The system of claim 18,
where the processor is configured to output the initiation protocol such that the mobile peer-to-peer ad hoc network employs the initiation protocol.