IJITCE Dec 2014

ISSN (ONLINE) : 2045 -8711ISSN (PRINT) : 2045 -869X

@IJITCE Publication@IJITCE Publication

INTERNATIONAL JOURNAL OF INNOVATIVE TECHNOLOGY & CREATIVE ENGINEERING

DECEMBER 2014VOL - 4 NO - 12

INTERNATIONAL JOURNAL OF INNOVATIVE TECHNOLOGY AND CREATIVE ENGINEERING (ISSN:2045-8711) VOL.4 NO.12 DECEMBER 2014

www.ijitce.co.uk

UK: Managing Editor International Journal of Innovative Technology and Creative Engineering 1a park lane, Cranford London TW59WA UK E-Mail: [email protected] Phone: +44-773-043-0249

USA: Editor International Journal of Innovative Technology and Creative Engineering Dr. Arumugam Department of Chemistry University of Georgia GA-30602, USA. Phone: 001-706-206-0812 Fax:001-706-542-2626

India: Editor International Journal of Innovative Technology & Creative Engineering Dr. Arthanariee. A. M Finance Tracking Center India 66/2 East mada st, Thiruvanmiyur, Chennai -600041 Mobile: 91-7598208700


www.ijitce.co.uk

www.ijitce.co.uk

IJITCE PUBLICATION

INTERNATIONAL JOURNAL OF INNOVATIVE INTERNATIONAL JOURNAL OF INNOVATIVE INTERNATIONAL JOURNAL OF INNOVATIVE INTERNATIONAL JOURNAL OF INNOVATIVE

TECHNOLOGY & CREATIVE ENGINEERINGTECHNOLOGY & CREATIVE ENGINEERINGTECHNOLOGY & CREATIVE ENGINEERINGTECHNOLOGY & CREATIVE ENGINEERING

Vol.4 No.12

December 2014

www.ijitce.co.uk


www.ijitce.co.uk

From Editor's Desk

Dear Researcher, Greetings! Research article in this issue discusses about motivational factor analysis. Let us review research around the world this month. Internet can be compared with a library. Like a like a library, the Internet is also a source of enjoyable, important and varied information that can be obtained and used by millions of people across the world.The Internet also, like our library contains different forms, like text sound and graphics. Super library does not allow just anybody to browse books or cassettes this facility is available only for authorized members of the library. In a similar way only authorized users of the Internet can access it to obtain information. Internet is a worldwide collection of computer networks. Internet is a cooperative effort of many people and organizations. The computers on the Internet can communicate because they are physically linked and because they share a common language called TCP-IP language that two computers use to communicate. This definition describes acceptable messages and outlines the rules that two computers must follow to exchange those messages. The major transport protocol in Internet Protocol suite. It provides reliable communication between two computers in the network. The network protocol in the internet IP provides a best effort to deliver an IP packet between two networks on the Internet.

MANETs are a kind of wireless ad hoc networks that usually has a routable networking environment on top of a Link Layer ad hoc network. The growth of laptops and 802.11/Wi-Fi wireless networking has made MANETs a popular research topic since the mid 1990s. Many academic papers evaluate protocols and their abilities, assuming varying degrees of mobility within a bounded space, usually with all nodes within a few hops of each other. It has been an absolute pleasure to present you articles that you wish to read. We look forward to many more new technologies related research articles from you and your friends. We are anxiously awaiting the rich and thorough research papers that have been prepared by our authors for the next issue. Thanks, Editorial Team IJITCE


www.ijitce.co.uk

Editorial Members

Dr. Chee Kyun Ng Ph.D

Department of Computer and Communication Systems, Faculty of Engineering,Universiti Putra Malaysia,UPMSerdang, 43400 Selangor,Malaysia. Dr. Simon SEE Ph.D Chief Technologist and Technical Director at Oracle Corporation, Associate Professor (Adjunct) at Nanyang Technological University Professor (Adjunct) at ShangaiJiaotong University, 27 West Coast Rise #08-12,Singapore 127470 Dr. sc.agr. Horst Juergen SCHWARTZ Ph.D,

Humboldt-University of Berlin,Faculty of Agriculture and Horticulture,Asternplatz 2a, D-12203 Berlin,Germany Dr. Marco L. BianchiniPh.D

Italian National Research Council; IBAF-CNR,Via Salaria km 29.300, 00015 MonterotondoScalo (RM),Italy Dr. NijadKabbaraPh.D Marine Research Centre / Remote Sensing Centre/ National Council for Scientific Research, P. O. Box: 189 Jounieh,Lebanon Dr. Aaron Solomon Ph.D Department of Computer Science, National Chi Nan University,No. 303, University Road,Puli Town, Nantou County 54561,Taiwan Dr. S.Pannirselvam M.Sc., M.Phil., Ph.D

Associate Professor & Head, Department of Computer Science, Erode Arts & Science College (Autonomous),Erode, Tamil Nadu, India. Dr. Arthanariee. A. M M.Sc.,M.Phil.,M.S.,Ph.D

Director - Bharathidasan School of Computer Applications, Ellispettai, Erode, Tamil Nadu,India Dr. Takaharu KAMEOKA, Ph.D

Professor, Laboratory of Food, Environmental & Cultural Informatics Division of Sustainable Resource Sciences, Graduate School of Bioresources,Mie University, 1577 Kurimamachiya-cho, Tsu, Mie, 514-8507, Japan Dr. M. Sivakumar M.C.A.,ITIL.,PRINCE2.,ISTQB.,OCP.,ICP. Ph.D. Project Manager - Software,Applied Materials,1a park lane,cranford,UK Dr. S.Prasath M.Sc., M.Phil., Ph.D Assistant Professor, Department of Computer Science, Erode Arts & Science College (Autonomous),Erode, Tamil Nadu, India. Dr. Bulent AcmaPh.D Anadolu University, Department of Economics,Unit of Southeastern Anatolia Project(GAP),26470 Eskisehir,TURKEY Dr. SelvanathanArumugamPh.D

Research Scientist, Department of Chemistry, University of Georgia, GA-30602,USA.

Review Board Members

Dr. Paul Koltun Senior Research ScientistLCA and Industrial Ecology Group,Metallic& Ceramic Materials,CSIRO Process Science & Engineering Private Bag 33, Clayton South MDC 3169,Gate 5 Normanby Rd., Clayton Vic. 3168, Australia Dr. Zhiming Yang MD., Ph. D. Department of Radiation Oncology and Molecular Radiation Science,1550 Orleans Street Rm 441, Baltimore MD, 21231,USA Dr. Jifeng Wang Department of Mechanical Science and Engineering, University of Illinois at Urbana-Champaign Urbana, Illinois, 61801, USA Dr. Giuseppe Baldacchini


www.ijitce.co.uk

ENEA - Frascati Research Center, Via Enrico Fermi 45 - P.O. Box 65,00044 Frascati, Roma, ITALY. Dr. MutamedTurkiNayefKhatib Assistant Professor of Telecommunication Engineering,Head of Telecommunication Engineering Department,Palestine Technical University (Kadoorie), TulKarm, PALESTINE.

Dr.P.UmaMaheswari Prof &Head,Depaartment of CSE/IT, INFO Institute of Engineering,Coimbatore.

Dr. T. Christopher, Ph.D., Assistant Professor &Head,Department of Computer Science,Government Arts College(Autonomous),Udumalpet, India. Dr. T. DEVI Ph.D. Engg. (Warwick, UK), Head,Department of Computer Applications,Bharathiar University,Coimbatore-641 046, India.

Dr. Renato J. orsato Professor at FGV-EAESP,Getulio Vargas Foundation,São Paulo Business School,RuaItapeva, 474 (8° andar),01332-000, São Paulo (SP), Brazil Visiting Scholar at INSEAD,INSEAD Social Innovation Centre,Boulevard de Constance,77305 Fontainebleau - France Y. BenalYurtlu Assist. Prof. OndokuzMayis University Dr.Sumeer Gul Assistant Professor,Department of Library and Information Science,University of Kashmir,India Dr. ChutimaBoonthum-Denecke, Ph.D Department of Computer Science,Science& Technology Bldg., Rm 120,Hampton University,Hampton, VA 23688 Dr. Renato J. Orsato Professor at FGV-EAESP,Getulio Vargas Foundation,São Paulo Business SchoolRuaItapeva, 474 (8° andar),01332-000, São Paulo (SP), Brazil Dr. Lucy M. Brown, Ph.D. Texas State University,601 University Drive,School of Journalism and Mass Communication,OM330B,San Marcos, TX 78666 JavadRobati Crop Production Departement,University of Maragheh,Golshahr,Maragheh,Iran VineshSukumar (PhD, MBA) Product Engineering Segment Manager, Imaging Products, Aptina Imaging Inc. Dr. Binod Kumar PhD(CS), M.Phil.(CS), MIAENG,MIEEE HOD & Associate Professor, IT Dept, Medi-Caps Inst. of Science & Tech.(MIST),Indore, India Dr. S. B. Warkad Associate Professor, Department of Electrical Engineering, Priyadarshini College of Engineering, Nagpur, India Dr. doc. Ing. RostislavChoteborský, Ph.D. Katedramateriálu a strojírenskétechnologieTechnickáfakulta,Ceskázemedelskáuniverzita v Praze,Kamýcká 129, Praha 6, 165 21 Dr. Paul Koltun Senior Research ScientistLCA and Industrial Ecology Group,Metallic& Ceramic Materials,CSIRO Process Science & Engineering Private Bag 33, Clayton South MDC 3169,Gate 5 Normanby Rd., Clayton Vic. 3168 DR.ChutimaBoonthum-Denecke, Ph.D Department of Computer Science,Science& Technology Bldg.,HamptonUniversity,Hampton, VA 23688 Mr. Abhishek Taneja B.sc(Electronics),M.B.E,M.C.A.,M.Phil.,


www.ijitce.co.uk

Assistant Professor in the Department of Computer Science & Applications, at Dronacharya Institute of Management and Technology, Kurukshetra. (India). Dr. Ing. RostislavChotěborský,ph.d, Katedramateriálu a strojírenskétechnologie, Technickáfakulta,Českázemědělskáuniverzita v Praze,Kamýcká 129, Praha 6, 165 21

Dr. AmalaVijayaSelvi Rajan, B.sc,Ph.d, Faculty – Information Technology Dubai Women’s College – Higher Colleges of Technology,P.O. Box – 16062, Dubai, UAE

Naik Nitin AshokraoB.sc,M.Sc Lecturer in YeshwantMahavidyalayaNanded University Dr.A.Kathirvell, B.E, M.E, Ph.D,MISTE, MIACSIT, MENGG Professor - Department of Computer Science and Engineering,Tagore Engineering College, Chennai Dr. H. S. Fadewar B.sc,M.sc,M.Phil.,ph.d,PGDBM,B.Ed. Associate Professor - Sinhgad Institute of Management & Computer Application, Mumbai-BangloreWesternly Express Way Narhe, Pune - 41 Dr. David Batten Leader, Algal Pre-Feasibility Study,Transport Technologies and Sustainable Fuels,CSIRO Energy Transformed Flagship Private Bag 1,Aspendale, Vic. 3195,AUSTRALIA Dr R C Panda (MTech& PhD(IITM);Ex-Faculty (Curtin Univ Tech, Perth, Australia))Scientist CLRI (CSIR), Adyar, Chennai - 600 020,India Miss Jing He PH.D. Candidate of Georgia State University,1450 Willow Lake Dr. NE,Atlanta, GA, 30329 Jeremiah Neubert Assistant Professor,MechanicalEngineering,University of North Dakota Hui Shen Mechanical Engineering Dept,Ohio Northern Univ. Dr. Xiangfa Wu, Ph.D. Assistant Professor / Mechanical Engineering,NORTH DAKOTA STATE UNIVERSITY SeraphinChallyAbou Professor,Mechanical& Industrial Engineering Depart,MEHS Program, 235 Voss-Kovach Hall,1305 OrdeanCourt,Duluth, Minnesota 55812-3042 Dr. Qiang Cheng, Ph.D. Assistant Professor,Computer Science Department Southern Illinois University CarbondaleFaner Hall, Room 2140-Mail Code 45111000 Faner Drive, Carbondale, IL 62901 Dr. Carlos Barrios, PhD Assistant Professor of Architecture,School of Architecture and Planning,The Catholic University of America Y. BenalYurtlu Assist. Prof. OndokuzMayis University Dr. Lucy M. Brown, Ph.D. Texas State University,601 University Drive,School of Journalism and Mass Communication,OM330B,San Marcos, TX 78666 Dr. Paul Koltun Senior Research ScientistLCA and Industrial Ecology Group,Metallic& Ceramic Materials CSIRO Process Science & Engineering Dr.Sumeer Gul Assistant Professor,Department of Library and Information Science,University of Kashmir,India Dr. ChutimaBoonthum-Denecke, Ph.D Department of Computer Science,Science& Technology Bldg., Rm 120,Hampton University,Hampton, VA 23688


www.ijitce.co.uk

Dr. Renato J. Orsato Professor at FGV-EAESP,Getulio Vargas Foundation,São Paulo Business School,RuaItapeva, 474 (8° andar)01332-000, São Paulo (SP), Brazil Dr. Wael M. G. Ibrahim Department Head-Electronics Engineering Technology Dept.School of Engineering Technology ECPI College of Technology 5501 Greenwich Road - Suite 100,Virginia Beach, VA 23462

Dr. Messaoud Jake Bahoura Associate Professor-Engineering Department and Center for Materials Research Norfolk State University,700 Park avenue,Norfolk, VA 23504 Dr. V. P. Eswaramurthy M.C.A., M.Phil., Ph.D., Assistant Professor of Computer Science, Government Arts College(Autonomous), Salem-636 007, India. Dr. P. Kamakkannan,M.C.A., Ph.D ., Assistant Professor of Computer Science, Government Arts College(Autonomous), Salem-636 007, India. Dr. V. Karthikeyani Ph.D., Assistant Professor of Computer Science, Government Arts College(Autonomous), Salem-636 008, India. Dr. K. Thangadurai Ph.D., Assistant Professor, Department of Computer Science, Government Arts College ( Autonomous ), Karur - 639 005,India. Dr. N. Maheswari Ph.D., Assistant Professor, Department of MCA, Faculty of Engineering and Technology, SRM University, Kattangulathur, Kanchipiram Dt - 603 203, India.

Mr. Md. Musfique Anwar B.Sc(Engg.) Lecturer, Computer Science & Engineering Department, Jahangirnagar University, Savar, Dhaka, Bangladesh. Mrs. Smitha Ramachandran M.Sc(CS)., SAP Analyst, Akzonobel, Slough, United Kingdom. Dr. V. Vallimayil Ph.D., Director, Department of MCA, Vivekanandha Business School For Women, Elayampalayam, Tiruchengode - 637 205, India. Mr. M. Moorthi M.C.A., M.Phil., Assistant Professor, Department of computer Applications, Kongu Arts and Science College, India PremaSelvarajBsc,M.C.A,M.Phil Assistant Professor,Department of Computer Science,KSR College of Arts and Science, Tiruchengode Mr. G. Rajendran M.C.A., M.Phil., N.E.T., PGDBM., PGDBF., Assistant Professor, Department of Computer Science, Government Arts College, Salem, India. Dr. Pradeep H Pendse B.E.,M.M.S.,Ph.d Dean - IT,Welingkar Institute of Management Development and Research, Mumbai, India Muhammad Javed Centre for Next Generation Localisation, School of Computing, Dublin City University, Dublin 9, Ireland Dr. G. GOBI Assistant Professor-Department of Physics,Government Arts College,Salem - 636 007 Dr.S.Senthilkumar Post Doctoral Research Fellow, (Mathematics and Computer Science & Applications),UniversitiSainsMalaysia,School of Mathematical Sciences, Pulau Pinang-11800,[PENANG],MALAYSIA. Manoj Sharma Associate Professor Deptt. of ECE, PrannathParnami Institute of Management & Technology, Hissar, Haryana, India RAMKUMAR JAGANATHAN Asst-Professor,Dept of Computer Science, V.L.B Janakiammal college of Arts & Science, Coimbatore,Tamilnadu, India


www.ijitce.co.uk

Dr. S. B. Warkad Assoc. Professor, Priyadarshini College of Engineering, Nagpur, Maharashtra State, India Dr. Saurabh Pal Associate Professor, UNS Institute of Engg. & Tech., VBS Purvanchal University, Jaunpur, India Manimala Assistant Professor, Department of Applied Electronics and Instrumentation, St Joseph’s College of Engineering & Technology, Choondacherry Post, Kottayam Dt. Kerala -686579 Dr. Qazi S. M. Zia-ul-Haque Control Engineer Synchrotron-light for Experimental Sciences and Applications in the Middle East (SESAME),P. O. Box 7, Allan 19252, Jordan Dr. A. Subramani, M.C.A.,M.Phil.,Ph.D. Professor,Department of Computer Applications, K.S.R. College of Engineering, Tiruchengode - 637215 Dr. SeraphinChallyAbou Professor, Mechanical & Industrial Engineering Depart. MEHS Program, 235 Voss-Kovach Hall, 1305 Ordean Court Duluth, Minnesota 55812-3042 Dr. K. Kousalya Professor, Department of CSE,Kongu Engineering College,Perundurai-638 052 Dr. (Mrs.) R. Uma Rani Asso.Prof., Department of Computer Science, Sri Sarada College For Women, Salem-16, Tamil Nadu, India. MOHAMMAD YAZDANI-ASRAMI Electrical and Computer Engineering Department, Babol"Noshirvani" University of Technology, Iran. Dr. Kulasekharan, N, Ph.D Technical Lead - CFD,GE Appliances and Lighting, GE India,John F Welch Technology Center,Plot # 122, EPIP, Phase 2,Whitefield Road,Bangalore – 560066, India. Dr. Manjeet Bansal Dean (Post Graduate),Department of Civil Engineering,Punjab Technical University,GianiZail Singh Campus,Bathinda -151001 (Punjab),INDIA Dr. Oliver Jukić Vice Dean for education,Virovitica College,MatijeGupca 78,33000 Virovitica, Croatia Dr. Lori A. Wolff, Ph.D., J.D. Professor of Leadership and Counselor Education,The University of Mississippi,Department of Leadership and Counselor Education, 139 Guyton University, MS 38677


www.ijitce.co.uk

Contents

Energy Efficient Location Privacy Preserving Based On Service Level Agreement In Mobile Ad-Hoc Network by

J.Partha sarathy FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF.FFFFFFFFF.[249]


249

Energy Efficient Location Privacy Preserving Based On Service Level

Agreement in Mobile Ad-Hoc Network J.Partha sarathy

Research Scholar, Anna University, Chennai. E-mail: [email protected]

Abstract--- To establish an Energy Efficient Location Privacy Preserving (EELPP) Protocol for MANETs the intention of network to the location. It makes important reduction in the energy consumption of the mobile nodes batteries by restrictive the area of discover a new direction to a less important zone. Thus, organize packets overhead are considerably reduced. In EELPP an orientation wireless base station is used and the network's round area centered at the base station is alienated into six equivalent sub-areas. At route discovery in its place of flooding control packets to the complete network area, they are flooded to simply the sub-area of the target mobile node. The base station stores locations of the movable nodes in a point table. Service Level Agreement (SLA) supports application server technologies with active resource management; request servers can animatedly alter the quantity of resources assign to hosted applications on-demand so as to get together application-level Quality of Service requirements. To demonstrate the efficiency of the proposed protocol we present simulation using NS-2. Simulation consequences show that EELAR protocol makes a development in control packet above your head and delivery ratio compared to AODV, LAR, and DSR protocols. To reduce the energy cost, nodes are active only during data transmission and the intersection of node creates a larger compound node, to reduce the number of fake packets and also boost solitude preservation. Simulation and analytical results demonstrate that our scheme can provide stronger privacy protection than routing-based schemes and requires much less energy than data preventing based. Keywords— SLA, EELPP, Quality of Service, MANET.

I . INTRODUCTION Mobile ad hoc networks consist of wireless mobile hosts

that exchange a few words with each other, in the absence of a

fixed transportation.1 Routes among two hosts in a Mobile Ad

hoc Network (MANET) may consist of hops from end to end

other hosts in the system. Host mobility can cause

normalchangeable topology changes. Therefore, the task of

finding and maintain routes in MANET is nontrivial. Many

protocols have been proposed for mobile ad hoc networks,

with the aim of achieving efficient routing [1]. These

algorithms differ in the approach used for searching a new

route and/or modifying a known route.

The aim of AODV route innovation is to set up a

bidirectional route from the source to the purpose. Route

discovery works by flood the network with route request

(RREQ) packets. Every node that receives the RREQ looks in

its direction-finding table to the destination or if it has a new

sufficient route to the destination. If it does, it sends a unicast

route reply (RREP) communication back to the source;

otherwise it rebroadcasts the RREQ in [3]. The RREP is

routed back on a temporary reverse route that was created by

the RREQ. Each node keeps track of its local connectivity,

this is perform either by using intermittent exchange of

messages, or by using feedback from the link layer upon

unsuccessful transmission.

In adding together to the work related to power-efficient

algorithms, Location-Aided Routing protocols such as

location were also proposed to make informed direction-

finding decisions based on in sequence about node location.

LAR is different from earlier work related to location-aided

routing in that work,when creationdirection-finding decisions

[5, 6]. To minimizing the power consumption on end-to-end

routes is the major objective. In fussy, the purpose of previous

algorithms is to find outa shortest-path route that reaches the

end with the smallest number of middle hops at minimize the

energy consumption in transmitting a packet.

The mobile node’s with the goal of diminishing routing-

related visual projection in mobile and ad hoc networks. It

uses location in order of the movable nodes to limit the search

for a new route to a smaller area of the ad hoc system which

results in a momentous reduction in the number of routing

messages and consequently the energy utilization of the

mobile nodes batteries is decreaseconsiderably. In order to

reduce the control overhead due to screen storm in the

network when manage packets are flooded into whole network

[8, 9].

II . RELATED WORK A distributed framework which predicts the dependability

of the mobile nodes, this construction is implemented with the

four different basic constrains for the subtraction of the

reliability of the mobile node. The constrains are, A mobile

node must stimulate the routing process by means of its

collaboration, The organization given by the mobile nodes

must be truthful, the direction-finding process of the MANET

must be in such a way that the packet has to be send from

beginning to end energy efficient path, the message

communication complexity regarding the intimation of

malicious nodes in the MANET must be very less. In the

authors have a second hand status mechanism which

incessantly monitors its neighbor nodes in the ad hoc

Network. In this each and every node is implemented with


250

repute evaluation machine by means of maintain the

reputation index and reputation table. For each successful

delivery of a node, the reputation index value gets

incremented and updated in the standing table. This paper

proposes three heuristic search methods for making decision

from the obtained values of packet delivery rates of each and

every node [1].

MANET in using dynamic Bayesian signaling The heuristics methods are based on number of hops away

from the source, single increase and double augmentation, the

early audition. In the authors have accessible a second hand

reputation mechanism which makes use of reputation values

compute by the neighbors of the mobile nodes. In this authors

also derives an entrance value to obtain effectual

discrimination of the non-corporation, non-trustworthy nodes

from the normal node in the MANET. This paper also comes

up with an integrated approach for detecting and extenuating

selfish nodes. This is implemented based on game theory

which investigates the network performance. In the authors

have modeled an algorithm based on dynamic Bayesian

signaling game for the improving the collaboration among the

mobile nodes in ad hoc network. This mechanism

discriminates the nodes based on the behavior of normal

nodes and a malicious node by earnings of continues

monitoring of each and every node by its neighbors. This is

implementing by means of the concepts like sequential

rationality and random property.

In the authors have addressed friendship mechanism for

the enhancement of the cooperation of the mobile nodes by

optimizing the property, the decrease of false positives i.e.

incorrect ID of the selfish nodes can be reduces significantly.

This method is implemented in two dissimilar methodologies

viz., direct and roundabout friend indirect instrument [1, 2]. In

this, author have also analyzed the various aspects of partition

in terms of six degrees and also suggested solutions to get find

of all types of separation. They also implemented a voting

strategy for selective malicious node from normal node. In the

authors have analyses different problem that arise while

achieving assistance among the mobile node in ad hoc

networks. The authors have Levesque measure based on game

theory, which derives the probability values of all the nodes

participating in the statement. In this, behavior of set of

connections is also analyses based on equilibrium function. Cornbach Alpha Coefficient Based Reputation Mechanism (Cactm)

In this formulate a Cornbach alpha Coefficient based

standing instrument (CACTM) for influential the trust of each

and every nodes current in an ad location. MAODV is the

multicast protocol used for our imitation study. We employ

the group announcement between the nodes in order to study

the impact of mean present during group announcement. The

reproduction study was accepted out to compare the present

concepts” model with the SHRCM model based on the

assessment parameter namely Throughput, packet delivery

ratio and total overhead by varying the number of mobile

nodes and number of compromised nodes deployed for group

announcement. The remaining part of the paper is organized

as follows. Enumerates a detailed review survey of the some

highly developed process works carried out with possible

statistical coefficients that could be beneficial for checking

node Consistencies are presented along with the extract of the

survey [3]. In the detailed version of the Cornbach alpha

coefficient based trust model is depicted. The detailed

algorithmic steps for the formulated trust model to be

deployed in the MAODV protocol.

Application server clustering is discussed, where the

servers are cluster like master and Slave format and perform

group announcement. The problem with the solution is the

server has to be up at all the time in all the nodes of the cluster

to meet the necessities. This makes the resource unusable and

reduces the throughput of the server which does not used at

lower load setting. So that the server has to be up and used at

dynamic environment when there is higher load arises.

Whenever the number of received http request increases the

process of load complementary is comes into play [6]. Every

server has the bound in number of request management and

could not handle request more than that, also highly loaded

server could not provide service at least response time. The

load complementary procedure has to point all these issues

before development the request to a server. The quality of

service of any server or service is depending on throughput

and timeliness, reliability. If the server response quickly then

it will be good and will increase the throughput of the server

[9].

III . PROPOSED APPROACH The mobile ad hoc network is a new model of

wireless communication and has gained growing

consideration from industry. As in all-purpose network

environment, mobile ad-hoc networks have to deal with an

assortment of security threats. Due to its nature of active

network topology, direction-finding in mobile ad-hoc system

plays a vital role for the presentation of the networks. It is

reasonable that most security threats target routing protocol

the weakest point of the mobile ad-hoc network. There are a

variety of study and much research in this field in a challenge

to propose more secure protocols. However, there is not a

complete routing protocol that can secure the process of a

complete network in every situation.

Privacy fortification in routing of MANET has

paying attention a lot of research efforts. A number of

privacy-preserving routing schemes have been brought

forward. The unidentified routing protocol mainly considers

ambiguity and partial unlink ability in MANET, most of them

exploit asymmetric feature of public key cryptosystems to

accomplish their goals. Complete unlink ability are not

definite due to incomplete content defense. This method use

Energy Efficient Location Privacy Preserving Protocol

(EELPP) that is an optimization to the Location Aided

Routing. EELPP makes significant reduction in the energy

consumption of the mobile nodes batteries through restraining

the area of discovering a new route to a smaller zone. Thus,

control packets overhead are considerably reduced and the

mobile nodes life time is increased.

3.1 Estimation of Energy Savings:

We next evaluate the energy saved by the proposed

probabilistic localization approach. Assume the sensor node

has three basic energy consumption types—sensing,

transmitting and receiving, and these power values (energy

per unit time) areE�, Et and Er, respectively. If we select all sensors that reported the target for querying, the total energy


251

consumed for the event happening at time instant t can be

evaluated using the following equation:

�� = �� + ��

�� = ��

� = � ��

��

�� = � − �∗ = � � �� !" $%$&'(��

��− ) %*+,$- $%$&'�� Where E1 is the energy required for reporting the

detection of an object the parameters T1, T2 and T3 denote the

lengths of time involved in the transmission and reception,

which are directly proportional to the sizes of data, control

messages to query sensors, and the detailed sensor data

transmitted to the cluster head. The parameter Ts is the time of

sensing activity of sensors. The parameters E denotes the total

energy in this case for target localization from tstart to tend.

Similarly, for the proposed probabilistic localization approach,

we have

Where

. = �� + �� + ��/./1 �/2� ��34

Since � (t) is always less than or equal to 5� (t),

We have

∇E ≥ 0 So we consumed energy and rectifying the damage

coil or node I during data transmission using magnetic node in

network.

To show the effectiveness of the proposed protocol

we obtainable simulations using NS-2. In addition,

reproduction results show that there is a tradeoff sandwiched

between decreasing control overhead by increasing number of

areas and growing route loss by mounting the number of

network areas due to node mobility. This suggests that most

favorable number of network area is reliant on the nodes

mobility. We have to take a different parameter like as

throughput, release ratio, packet wait on the network. In as

much as all these protocols strived to decrease power

expenditure either at node level or on the network in general,

all proposed solution have a kind of trade-off that let go to

have clear energy saving. The observed performance metrics

based on the reproduction outcome posted by the various

algorithms under review. The number of routes recognized

during route discovery, the message overheads the cost of

performing arts the data packet show and reception by

different nodes, normal energy preserved, and the network

throughput, and the end-to-end, data packet delay.

ENERGY EFFICIENT LOCATION PRIVACY

ALGORITHM

(i). Energy based Packet Transmit

Step 1: If (Any Packet sent P)

{

Forward Packet P

}

Step 2: If (received A Packet)

{

Step 3: If (Received Packet==Data_Ack)

{

Step 4: Route Location base transmission

Verify the Id

Step 5: If (Verification Successful)

Energy save mode

{

Step 6: Discard the route noted

Else

{

Step 7: Drop the packet

Energy loss

}

Step 8: Repeat the procedure for next packet

}

}

The data are sending by wireless mobile ad-hoc

network from source (S) to destination (D) on network

topology. The Packets (P) transmit the data to destination

intermediately work from beginning to end from source to

destination Energy efficient based broadcast on network.

Neighbor discovery node has to collect the data sending and

receiving process on the network. The traffic situation to be

checked on mobility node, the minimum number of connected

set to the objective on the system. It’s more to save the power

and shortest path route detection on their network. It is

plummeting the packet’s delay and the reduce energy model

on their wireless network. The associated set is more well-

organized and scalable network on that time of the network

process.

IV. PERFORMANCE ANALYSIS The goal of the reproduction is to analyze the

behavior of the AODV by deploying Networks. The

replication environment is creating in NS-2, a network

simulator that provides support for simulate mesh wireless

networks. NS-2 using C++ language and it uses the Object

Oriented Tool Command Language (OTCL). It came as from

Tool Command Language (TCL). They use a setting

consisting of 30 wireless nodes roaming over a simulation

area of 1200 meters x 1200 meters flat space in payment for

10 seconds of simulation time. The radio and IEEE 802.11

MAC layer models used. Nodes in our simulation move

according to accidental Waypoint mobility model, which is in

accidental direction with maximum speed from 0 m/s to 20

m/s. A free space proliferation channel is unspecific for the

simulation. Hence, the reproduction experiment do not

account for the overhead produced when a multicast member

leaves a group and the assessment result.

Table 1: Simulation parameters

INTERNATIONAL JOURNAL OF

V. PERFORMANCE RESULThe simulation circumstances are calculated

charge the collision of system concentration on the

arrangement of the network model. The collision of

arrangement density is deploying 0 – 100 nodes more than a

permanent open area topology of 1200m x 1200m using 5m/s

node speed and identical source-destination connections.

AODV have a quantity of metrics that can be used for their

presentation network.

Throughput Performance

This is the output of total number of customary data

packets divided by total number of sent data packets.

Fig.1. Performance of throughputThis metric gives an estimate of how efficient a

routing protocol is, since the number of routing packets sent

per data packet gives an idea of how well the protocol keeps

the routing in order updated. The higher the Normal Routing

Load metric is, the higher the overhead of routing packets and

consequently the lower the efficiency of the protocol.

Energy Level on Network The energy level on the network is must and most

significant one of the quick data communication on their

network. its calculated from their each node

is must of the network. if any node none to data transmit that

node to save the energy on the network.

Energy consumption = no of packets * initial energy level

Remained energy = energy consumption –

node

Fig.2. Energy consumption on network

The End-to-End delay They have calculate a average number of delay on

network, it includes all possible delay caused by buffering

through route detection latency, queuing at the border queue,

retransmission delay on medium access control, spread and

move time.

D = (Tr –Ts)

Where Tr is receive Time and Ts is sent Time.

0

50

100

2 4 6 8

No

.of

Pa

cke

ts

Time (min)

REPLICA, Load

Balancing

0

5

10

15

2 4 6 8 10

En

erg

y

Lev

el(

Jou

les)

Time (min)

REPLICA, Load Balancing

OURNAL OF INNOVATIVE TECHNOLOGY AND CREATIVE ENGINEERING

VOL

252

V. PERFORMANCE RESULTS calculated mainly to

concentration on the

arrangement of the network model. The collision of

100 nodes more than a

open area topology of 1200m x 1200m using 5m/s

destination connections.

a quantity of metrics that can be used for their

This is the output of total number of customary data

packets divided by total number of sent data packets.

1. Performance of throughput gives an estimate of how efficient a

routing protocol is, since the number of routing packets sent

per data packet gives an idea of how well the protocol keeps

the routing in order updated. The higher the Normal Routing

ead of routing packets and

consequently the lower the efficiency of the protocol.

The energy level on the network is must and most

significant one of the quick data communication on their

network. its calculated from their each node energy utilization

is must of the network. if any node none to data transmit that

Energy consumption = no of packets * initial energy level

– no of packets in

Energy consumption on network

They have calculate a average number of delay on

network, it includes all possible delay caused by buffering

through route detection latency, queuing at the border queue,

retransmission delay on medium access control, spread and

here Tr is receive Time and Ts is sent Time.

Fig.3. End to End Delay on network

V. CONCLUSIONIn our work we have using a neighbor u

Efficient Location Privacy Preserving Protocol (EELPP) that

is an optimization to the Location Aided Routing

location based data transmission on their network. It has

mainly focused on this technique to get better the network

performance and energy consumption model on the network.

In our future work to implement the network protocol based

energy efficient data transmission and more security based

data transmission on the network. Used Security based routing

protocols and reduces data loss on the network.

REFERENCES[1]. Mohammad A. Mikki, “Energy Efficient Location Aided

Routing Protocol for Wireless MANETs”, Vol. 4, No. 1 & 2,

2009.

[2]. P. Thamizharasi, D.Vinoth, “Unobservable Privacy

Preserving Routing in MANET”, Volume

2013.

[3]. Karim El Defrawy, Gene Tsudik, “Privacy

Location-Based On-Demand Routing in MANETs”, VOL.

Dec 2011.

[4]. Ajay Shah, Hitesh Gupta, “Energy Efficient Routing

Protocols for Mobile Ad Hoc Networks”, Vol. 1 Issue 5, July

– 2012.

[5]. Mohamed M. E. A. Mahmoud, “A Cloud

for Protecting Source-Location Privacy against Hotspot

Locating Attack in Wireless Sensor Networks”, 2011

[6]. K. Vinoth Kumar, G.Arunsathish, “Privacy

Routing Protocol for Mobile Ad Hoc Networks”, Vol.11,

No.11, March 2013.

[7]. Humaira Nishat, “Energy Efficient Routing Protocols for

Mobile Ad Hoc Networks”, Volume 26

[8]. J. Haas, “Secure Data Communication in Mobile Ad Hoc

Networks”, VOL. 24, NO. 2, FEB 2006

[9]. Young-Bae KO, “Location

mobile ad hoc networks”, science publication university

[10]. Panagiotis, Papadimitratos, “Secure Data Transmission

in Mobile Ad Hoc Networks”, 19 Sep 2010.

10

10


0

10

20

2 4 6No

.of

Pa

cke

ts

(De

lay

)

Time (min)

PARAMETERS

Version

Propagation Model

Routing Protocols

Area

Broadcast Area

Transfer Pattern

Mobility Model

Transfer per Packet

NGINEERING (ISSN:2045-8711) OL.4 NO.12 DECEMBER 2014

Fig.3. End to End Delay on network

V. CONCLUSION work we have using a neighbor using Energy

Efficient Location Privacy Preserving Protocol (EELPP) that

is an optimization to the Location Aided Routing (LAR) for

location based data transmission on their network. It has

mainly focused on this technique to get better the network

performance and energy consumption model on the network.

In our future work to implement the network protocol based

ent data transmission and more security based

data transmission on the network. Used Security based routing

protocols and reduces data loss on the network.

REFERENCES Mohammad A. Mikki, “Energy Efficient Location Aided

MANETs”, Vol. 4, No. 1 & 2,

P. Thamizharasi, D.Vinoth, “Unobservable Privacy-

Preserving Routing in MANET”, Volume-2, Issue-3, January

Karim El Defrawy, Gene Tsudik, “Privacy-Preserving

Demand Routing in MANETs”, VOL. 29,

Ajay Shah, Hitesh Gupta, “Energy Efficient Routing

Protocols for Mobile Ad Hoc Networks”, Vol. 1 Issue 5, July

Mohamed M. E. A. Mahmoud, “A Cloud-Based Scheme

Location Privacy against Hotspot-

Attack in Wireless Sensor Networks”, 2011

K. Vinoth Kumar, G.Arunsathish, “Privacy-Preserving

Routing Protocol for Mobile Ad Hoc Networks”, Vol.11,

Humaira Nishat, “Energy Efficient Routing Protocols for

Networks”, Volume 26– No.2, July 2011

J. Haas, “Secure Data Communication in Mobile Ad Hoc

Networks”, VOL. 24, NO. 2, FEB 2006

Bae KO, “Location-Aided Routing (LAR) in

mobile ad hoc networks”, science publication university

, Papadimitratos, “Secure Data Transmission

in Mobile Ad Hoc Networks”, 19 Sep 2010.

8 10Time (min)


VALUE

Ns-all-in-one 2.28

Two Ray Ground

AODV

1200m x 1200m

50-250 m

UDP,CBR

Random Mobility

512 tes

@IJITCE Publication@IJITCE Publication

IJITCE Dec 2014

Documents

Transcript of IJITCE Dec 2014