SELF-POSITION UPDATE FOR GEOGRAPHIC ROUTING IN MOBILE AD-HOC NETWORKS

PHASE I REPORT Submitted by

B.SAKTHISHREE Register No: 611311405008

in partial fulfillment for the award of the degree of

MASTER OF ENGINEERING
IN COMPUTER SCIENCE AND ENGINEERING

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING MAHENDRA ENGINEERING COLLEGE, NAMAKKAL-637503

ANNA UNIVERSITY CHENNAI

DECEMBER 2012

ANNA UNIVERSITY CHENNAI

MAHENDRA ENGINEERING COLLEGE, NAMAKKAL-637503 Department of Computer Science and Engineering PROJECT WORK PHASE I DECEMBER 2012 This is to certify that the project entitled

SELF-POSITION UPDATE FOR GEOGRAPHIC ROUTING IN MOBILE AD-HOC NETWORKS

is the bonafide record of project work done by

B.SAKTHISHREE Register No: 611311405008

Of M.E (Computer Science and Engineering) during the year (2011 -2012)

-------------------------------------------

---------

---------------------------

Prof. R.G.SAKTHIVELAN M.E, (Ph.D)

Head of the Department, Dept. of CSE, Mahendra Engg. College.

Mr. A.SURESHKUMAR M.E, (Ph.D)

Assistant Professor, Dept. of CSE, Mahendra Engg. College.

Submitted for the Project Viva-Voce examination held on____________

----------------------------Examiner 1
II

---------------------Examiner 2

DECLARATION

I affirm that the thesis titled SELF-POSITION UPDATE FOR GEOGRAPHIC ROUTING IN MOBILE AD-HOC NETWORKS being submitted in partial fulfillment for the award of M.E degree is the original work carried out by me. It has not formed the part of any other thesis submitted forward of any degree or diploma, either in this or any other University.

(Signature of the Candidate)

Name of the Candidate: B.SAKTHISHREE

Register Number: 611311405008

I certify that the declaration made above by the candidate is true.

Signature of the Guide,

III

TABLE OF CONTENTS CHAPTER NO. 1 2 AREA OF INTEREST LITERATURE REVIEW 2.1 POWER EFFICIENT ORGANISATION OF WIRELESS SENSOR NETWORKS 2.1.1 Controlled Vs Random Node Placement 2.1.2 Motivational Example 2.2 SET K COVER ALGORITHM FOR ENERGY EFFICIENT MONITORING IN WIRELESS SENSOR NETWORKS 2.2.1 Energy Conservation 2.2.2 Analysis of Algorithms 2.2.3 Distributed greedy algorithm 2.3 WIRELESS SENSOR NETWORKS:APPLICATIONS CHALLENGES OF UBIQUITOUS SENSING 2.3.1 Life time 2.3.2 Flexibility 2.3.3 Maintenance 2.3.4 Data Collection 2.3.5 Communication 2.4 IMPROVING ENERGY EFFICIENCY OF CENTRALLY CONTROLLED WIRELESS DATA NETWORKS 2.4.1 Centrally Controlled Data Transmission 2.4.2 Traffic Models 2.4.3 Physical Layer 2.4.4 Error Recovery 2.5 RANDOM COVERAGE WITH GUARANTED CONNECTIVITY: JOINT SCHEDULING FOR WIRELESS SENSOR NETWORKS 2.5.1 Extra on rule IV 15 16 12 12 13 14 14 07 07 08 09 10 10 05 05 06 06 03 03 04 01 03 TITLE PAGE NO.

2.5.2 Advantages of the joint scheduling algorithm 2.6 GPSR:GREEDY PERIMETER STATELESS ROUTING FOR WIRELESS NETWORKS 2.6.1 Protocol Implementation 2.6.1.1 Support for MAC layer failure feedback 2.6.1.2 Interface queue traversal 2.6.1.3 Promiscuous use of the network interface 2.6.1.4 Planarization of the graph 2.7 LOCATION SYSTEMS FOR UBIQUITOUS COMPUTING 2.7.1 Location sensing techniques 2.7.2 Location system properties 2.8 GEOGRAPHIC ROUTING WITHOUT LOCATION INFORMATION 2.8.1 Routing algorithm 2.8.2 Ad-hoc networks 2.8.3 Sensornets 2.9 EVALUATING THE LIMITATIONS AND ALTERNATIVES IN BEACONING 2.9.1 Link incidents in topology based protocols 2.9.2 Updating location databases 2.9.3 Beaconless position based routing protocols 2.10 PERFORMANCE COMPARISON OF TWO LOCATION BASE ROUTING PROTOCOLS FOR ADHOC NETWORKS 2.10.1 Dynamic source routing 2.10.2 Location aided routing protocol overview 2.11 GEOGRAPHIC ROUTING MADE PRACTICAL 2.11.1 Asymmetric links 2.11.2 Crossing links 2.12 LOCATION AIDED ROUTING IN MOBILE AD-HOC NETWORKS 2.12.1 Alternative definition of request zone 2.12.2 Adaptation of request zone V

17 18 18 18 18 19 19 19 19 20 20 20 21 21 22 23 24 25

26 26 27 29 29 29 30 30 31

2.12.3 Another adaptation of request zone 2.12.4 Propagation of location and speed information 2.12.5 Local search 2.12.6 Combining with time to live 3 EXISTING SYSTEM 3.1 MAINTAINANCE 3.2 PROPOSED SYSTEM 3.2.1 Adaptive position update 3.2.2 Advantages 3.2.3 Performance 3.2.4 Enhancement 4 5 6 CHOICE OF TITLE ABSTRACT EXECUTION OF PHASE 2 6.1 BEACON UPDATION 6.2 MOBILITY PREDICTION 6.3 ON DEMAND LEARNING 6.4 MODIFIED APU 6.5 FLOWCHART 6.6 SYSTEM REQUIREMENT 6.6.1 Hardware used 6.6.2 Software used 7 REFERENCES

31 33 33 33 35 37 37 37 37 37 38 39 40 41 41 41 42 42 43 44 44 44 45

VI

LIST OF FIGURES 2.1 Sensor nodes 04 08 10 13 16 21 32

2.3.1 External infrastructure 2.3.2 Critical nodes 2.4 2.5 2.8 Data transmission bit Sensing coverage Perimeter nodes

2.12 Request zone

VII