شبیه سازی Data Security در Ns2

بدون ديدگاه
 
RSA algorithm is described as follows [Sarode, Rashmi P., Piyush Gupta, and Neeraj Manglani,2014]:
1) Choose two large prime numbers A and B
2) Choose N in such a way that it is the product of A and B.
N = A * B
3) Select encryption key, E so that is not a factor of (A-1) and (B-1)
4) Select decryption key D, so that the following equation is satisfied:
(D*E) mod (A-1) (B-1) = 1
5) Let the plain text be denoted as PT and cipher text be denoted as CT
6) For encryption, CT=PTE mod N
7) For decryption, PT=CTD mod N

 

شبیه سازی Data Security in Mobile Cloud Computing در محیط ابر

در این روش الگوریتم RSA با مکانیزم AES پیاده سازی شده است. (پیاده سازی در محیط شبیه سازی Ns2) انجام می شود.

 

Algorithm 1 For solving the cost optimization problems
Inputs: (1) nin ll , nin lh, nin lc , nin pl , nin ph and nin pc: Initial assumption for the number of PMs in the cloudlet and public
cloud for all types of the requests, respectively. (2) D: Operational period. (3) Tl: The lowest value for temperature
(control parameter). (4) φs: The scale factor of temperature. (5) nT : The maximum number of iterations for each
temperature.
Outputs: The optimal number of PMs in the cloudlet and public cloud.
1: declare nll, nlh, nlc, npl, nph, npc, n0 ll, n0 lh, n0 lc, n0 pl, n0 ph and n0 pc : number of PMs;
2: declare T : temperature;
3: declare i: number of iterations;
4: declare C,C0: cost;
5: declare Cv: vector of cost;
6: declare r: random number;
7: declare j: number of past solutions that need to be checked;
8: nll ← nin ll ; nlh ← nin lh; nlc ← nin lc ; npl ← nin pl ; nph ← nin ph; npc ← nin pc
9: C ← computeCostSEC(nll, nlh, nlc, npl, nph, npc);
10: T ← C;
11: while T < Tl do:
12: i = 1;
13: while i < nT do:
14: (n0 ll, n0 lh, n0 lc, n0 pl, n0 ph, n0 pc) ← generateNeighborhood(nll, nlh, nlc, npl, nph, npc);
15: C0 ← computeCostSEC(n0 ll, n0 lh, n0 lc, n0 pl, n0 ph, n0 pc);
16: r ← Random();
17: if C0 < C or eC
0
-C
T > r
then
18: nll ← n
0
ll
; nlh ← n
0
lh
; nlc ← n
0
lc
; npl ← n
0
pl
; nph ← n
0
ph
; npc ← n
0
pc
19: C ← C0;
20: i ← i + 1;
21: Cv ← storeCost(C);
22: if controlStop(Cv, j) then
23: break;
24: T ← φs.T
25: output nopt ll , nopt lh , nopt lc , nopt pl , nopt ph , nopt pc and C ;
پیاده سازی در A Security and Cost-Aware Resource Allocation Method for

Mobile Cloudlet

 

در این روش الگوریتم For solving the cost optimization با مکانیزم PM پیاده سازی شده است. (پیاده سازی در محیط شبیه سازی Ns2) انجام می شود.

 

The access control steps are shown below:
Step 1: The user initiates a request for a ticket, which includes user identity and environment attributes. The request is encrypted
by ksession. Then the result A UID N SysInfo ClientVer Network = { , , , , } a ksessionis sent to the authentication server.
Step 2: The authentication server generates the ticketTgs M MA = { }kserv C, then send{{ , , } UID N N Tgs a b ksession, } back to the user; M
contains ksession, the user’s attributes and the user’s environment attributes.
Step 3: User gets the ticket. Then suppose the user applies for a video with the message{{ , , , } , UID N vid S Tgs aksession }.
Step 4: ABAC agent can get the ksession, user attributes and environmental attributes by decryption. Then ABAC agent plays the part
of ABAC PEP (policy enforcement point). It converts the user’s request to the access control language identified by the PDP (policy
decision point), such as XACML (eXtensible Access Control Markup Language).
Step 5: The ABAC agent sends user attributes and environment attributes together with the request to the ABAC Center (playing
the role of PDP). Then the ABAC center obtains the video object attributes from the index management server, and makes decision
according to the authorization strategy.
Step 6: The ABAC agent receives the decision made by the ABAC center. If the decision made is for refusal, then the ABAC agent
returns the decision directly to the user. Otherwise, the ABAC agent applies to the index management server to generate an index
T, and send { } T kserv back to the user.
The UML diagram of the protocol is shown below (Fig. 4).
 

A novel security media cloud framework

 

در این روش الگوریتم ABAC agent  optimization با مکانیزم PDP پیاده سازی شده است. (پیاده سازی در محیط شبیه سازی Ns2) انجام می شود.

 

 

A Self-Protecting Agents Based Model for High-Performance
Mobile-Cloud

در این روش الگوریتم AS-GH agent  optimization با مکانیزم TAMPER پیاده سازی شده است. (پیاده سازی در محیط شبیه سازی Ns2) انجام

Algorithm 1 Data caching
Require: Query for data
Ensure: Cached data or retrieves data from the storage server and cache it for future purpose
1: if data is already available in the cache then
2: return cached data.
3: else
4: search the requested data in the database.
5: store data in the cache with cache validation.
6: return data.
7: end if
Algorithm 2 Data compression
Require: Requested data
Ensure: Compressed data
1: Fetch data from the cache or database.
2: Compress the data in zip format using java.util.zip package.
3: Encode compressed data.
4: Return compres  sed data

 

A trustworthy agent-based encrypted access control method

for mobile cloud computing environment

در این روش الگوریتم 2 Data compression optimization با مکانیزم TAMPER پیاده سازی شده است. (پیاده سازی در محیط شبیه سازی Ns2) انجام

 

نوشتن دیدگاه

نشانی ایمیل شما منتشر نخواهد شد.

دو × پنج =