Optimization process and system for a heterogeneous ad hoc network
First Claim
Patent Images
1. A system for finding an optimum network for a requester of bandwidth, comprising:
- a computing device that operates to;
identify available bandwidth lenders and existing networks within a vicinity of the requester;
select an optimization technique for completing a task of the requester;
calculate values comprising a respective calculated value for each of a plurality of network options for completing the requester'"'"'s task according to the optimization technique; and
select the optimum network from the calculated values,wherein the plurality of network options include a heterogeneous ad hoc network composed of a peer-to-peer ad hoc network and a multiplexed ad hoc network in which the requester communicates directly with the bandwidth lenders via a local wireless communication protocol; and
wherein the optimization technique comprises fastest time for completion of task determined according to one of;
TeMUXAHN=WeMUX+TeMUX+TeMUXnlenders;
TnMUXAHN=TnMUX+TnMUXnlenders;
TeP2PAHN=WeP2Pnlenders+TeP2Pnlenders;
TnP2PAHN=TnP2Pnlenders; and
THetAHN=(TnMUX+TnMUXklenders)=TnP2P(n−
k)lenders.
7 Assignments
0 Petitions
Accused Products
Abstract
Method and system for optimizing selection of a network. The method includes identifying available lenders and existing networks within a vicinity of a borrower, selecting an optimization technique for completing a task of the borrower, calculating, for a plurality of network options, a value for completing the borrower'"'"'s task according to the optimization technique, and selecting an optimum network option to complete the borrower'"'"'s task. The plurality of network options includes forming a heterogeneous network composed of both a peer-to-peer network and a multiplexed network.
-
Citations
19 Claims
-
1. A system for finding an optimum network for a requester of bandwidth, comprising:
-
a computing device that operates to; identify available bandwidth lenders and existing networks within a vicinity of the requester; select an optimization technique for completing a task of the requester; calculate values comprising a respective calculated value for each of a plurality of network options for completing the requester'"'"'s task according to the optimization technique; and select the optimum network from the calculated values, wherein the plurality of network options include a heterogeneous ad hoc network composed of a peer-to-peer ad hoc network and a multiplexed ad hoc network in which the requester communicates directly with the bandwidth lenders via a local wireless communication protocol; and wherein the optimization technique comprises fastest time for completion of task determined according to one of; TeMUXAHN=WeMUX+TeMUX+TeMUXnlenders; TnMUXAHN=TnMUX+TnMUXnlenders; TeP2PAHN=WeP2Pnlenders+TeP2Pnlenders; TnP2PAHN=TnP2Pnlenders; and THetAHN=(TnMUX+TnMUXklenders)=TnP2P(n−
k)lenders. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14)
-
-
15. A method for optimizing selection of a network in an ad hoc network architecture, comprising:
-
providing a computer infrastructure operable to; select an optimization technique for completing a task of a bandwidth borrower; calculate, for a plurality of network options, a value for completing the task according to the optimization technique, wherein the plurality of network options includes forming a heterogeneous network composed of both a peer-to-peer network and a multiplexed network; select an optimum network to complete the task; and join or form the optimum network, wherein the optimum network is an ad hoc network that is configured such that the bandwidth borrower and at least one bandwidth lender are in communication with a central location via wireless telephony communication protocol, the at least one bandwidth lender is in communication with the bandwidth borrower via local wireless communication protocol, and the at least one bandwidth lender selectively lends bandwidth to the bandwidth borrower for downloading data from or uploading data to the central location; and wherein the optimization technique comprises least expensive completion of task determined according to one of; CeMUXAHN=(TeMUX+TeMUXnlenders)(Σ
Cj);CnMUXAHN=(TnMUX+TnMUXnlenders)(Σ
Cj);CP2PAHN=TP2P(Σ
Cj); andCHetAHN=THetAHN(Σ
Cj). - View Dependent Claims (16)
-
-
17. A computer program product comprising a non-transitory computer usable medium having readable program code embodied in the medium, the program code including at least one component to:
-
identify available lenders and existing networks within a vicinity of a borrower, wherein the borrower is a bandwidth borrower and the lenders are bandwidth lenders; select an optimization technique for completing a task of the borrower; calculate, for a plurality of network options, a value for completing the borrower'"'"'s task according to the optimization technique; and select an optimum network option to complete the borrower'"'"'s task, wherein the plurality of network options includes forming a heterogeneous ad hoc network composed of both a peer-to-peer ad hoc network and a multiplexed ad hoc network in which the borrower communicates with the lenders via local wireless communication protocol and the lenders communicate with a remote location on behalf of the borrower to create a virtual fat pipe for the borrower, and wherein the optimization technique comprises one of; (a) fastest time for completion of task determined according to one of; TeMUXAHN=WeMUX+TeMUX+TeMUXnlenders; TnMUXAHN=TnMUX+TnMUXnlenders; TeP2PAHN=WeP2Pnlenders+TeP2Pnlenders; TnP2PAHN=TnP2Pnlenders; and THetAHN=(TnMUX+TnMUXklenders)=TnP2P(n−
k)lenders;
and(b) least expensive completion of task determined according to one of; CeMUXAHN=(TeMUX+TeMUXnlenders)(Σ
Cj);CnMUXAHN=(TnMUX+TnMUXnlenders)(Σ
Cj);CP2PAHN=TP2P(Σ
Cj); andCHetAHN=THetAHN(Σ
Cj). - View Dependent Claims (18, 19)
-
Specification