Project Login
Registration No:
Password:
MAIL ALERTS SMS ALERTS
 
     
   
     

Greedy Geographic Routing in Large-Scale Sensor Networks: A Minimum Network Decomposition Approach

Platform : java

IEEE Projects Years : 2012 - 13

Greedy Geographic Routing in Large-Scale Sensor Networks: A Minimum Network Decomposition Approach

 

Aim

 

 

 

          The main aim of the project is to design a low-stretch routing protocol that uses a minimum number of network components.

 

 

 

Abstract

 

 

 

          In geographic routing, messages are by default routed in a greedy manner. The current node always forwards a message to its neighbor node that is closest to the destination. Despite its simplicity and general efficiency, this strategy alone does not guarantee delivery due to the existence of local minima or dead ends. Overcoming dead ends requires nodes to maintain extra no local state or to use auxiliary mechanisms. Hence we are proposing     greedily routable components (GRCs), where greedy routing is guaranteed to work. We approach it by considering an approximate version of the problem in a continuous domain, with a central concept called the greedily routable region (GRR). A full characterization of GRR is given concerning its geometric properties and routing capability.

 

 

 

Existing System

 

 

 

          Greedy routing alone does not guarantee successful delivery of messages in a practical network due to the existence of dead ends, where a node does not have a neighbor closer than itself to the destination. To address these issues, researchers have proposed to exploit nonsocial topological information, using some global data structures such as landmark Voronoi complex, medial axis graph, and visibility graph, to find low stretch routes. But these proposed methods are not efficient to solve the problem due to high process time, high cost.

 

 

 

 

 

 

 

Proposed System

 

 

 

Our goal is to design a low-stretch routing protocol that uses a minimum number of network components. The network is decomposed into components. Our strategy is to focus on the major performance factors by considering an approximate version of the problem in a continuous domain.

 

The proposed system will guarantee to delivery of messages.

 

 

 

 

 

Modules

 

 

 

  1. 1.   Sender.
  2. 2.   Analyzing Local Minima.
  3. 3.   Check Available Path
  4. 4.   Avoid Local Minima.
  5. 5.   Receiver

 

 

 

SENDER:

 

 

 

            Sender module will enable us to choose and send the files. The files are transferred by using IP addresses and port numbers.

 

 

 

ANALYSING LOCAL MINIMA:

 

 

 

          Local minima module, allow to check occurring of local minima’s in the network. It will check for the dead ends in the network and if there is any dead ends it will choose the root to send the files in efficient way.

 

 

 

CHECK AVAILABLE PATH:

 

 

 

          This will enable to check the overall available paths to transfer the files and it will check for the dead ends in the network and if there is any dead ends it will choose the root to send the files in efficient way.

 

 

 

 

 

 

 

 

 

 

 

AVOID LOCAL MINIMA

 

 

 

 Check for the dead ends in the network and avoid the local minima’s then choose a path to send files from server to receiver without any data missing.

 

 

 

RECEIVER

 

 

 

          Receiver, receive the files from sender without any data missing by the dead ends.

 

 

 

 

 

System Requirements

 

 

 

Hardware

 

 

 

  • System                           :        Pentium IV 2.4 GHz.
  • Hard Disk                      :         40GB.
  • Monitor                         :         15” VGA Colour.
  • Mouse                            :         Logitech mouse
  • Ram                               :         512 MB.

 

 

 

Software

 

 

 

  • Operating System          :        Windows XP.
  • Environment                  :        NetbeansIDE 6.8
  • Language                       :         Java
  • Database                        :         DBMS

 

 

 

 

 

 

 

 



NOW GET PROJECTS ! GET TRAINED ! GET PLACED !

IEEE, NON-IEEE, REAL TIME LIVE ACADEMIC PROJECTS,

PROJECTS WITH COMPLETE COURSES,SOFT SKILLS & PLACEMENTS

ALLOVER INDIA & WORLD WIDE,

HOSTEL FACILITY AVAILABLE FOR GIRLS & BOYS SEPARATELY,

CALL: 08985129129 ,  E-Mail Id: support@ascentit.in

REGISTER FOR PROJECTS NOW ! GET DISCOUNT
   
1