You are on page 1of 24

NAME : J.

SARANYA
REGISTER No :075002620056
COURSE :V- M.sc -IT
DEPARTMENT: Applied Science
GUIDE NAME :Mrs.M.ANITHA

COMPANY NAME:

HCL Career Development
As the training arm of HCL career development center (HCLCDC) carries
forth a legacy excellence spanning across more than three decades. HCL is
a $5 billion leading global Technology and IT Enterprise that comprises
two companies listed in India - HCL Technologies & HCL Info systems

Its range of offerings spans Product Engineering, Custom & Package
Applications, BPO, IT Infrastructure Services, IT Hardware, Systems
Integration, and distribution of ICT products.
Design and development of world-class

Dedicated to the planning

Customer relationship management

Product Engineering & Technology Development

We study routing overhead due to location information
collection and retrieval in mobile ad-hoc networks employing
geographic routing with no hierarchy. We first provide a new
framework for quantifying overhead due to control messages
generated to exchange location information. Second, we
compute the minimum number of bits required on average to
describe the locations of a node, borrowing tools from
information theory.
where n is the number of nodes, under both proactive and
reactive geographic routing, with the assumptions that 1)
nodes mobility is independent, and 2) nodes adjust their
transmission range to maintain network connectivity. Finally,
we prove that the minimum expected overhead under the same
assumptions is _on logonPP
HARDWARE CONFIGURATION


Hard disk : 40 GB
RAM : 512mb
Processor : Pentium IV
Monitor : 17Color Monitor



Front-End : VS .NET 2005
Coding Language : C#
Operating System : Windows XP.
Back End : SQLSERVER 2005



Routing overhead due to location information collection and
retrieval in mobile ad-hoc networks employing geographic
routing with no hierarchy.

In the existing system, the problem of characterizing the
minimum routing overhead as a rate-distortion problem.

Mobile users are provided with access to real-time information
even when they are away from their home or office

Wireless networks offer more flexibility and adapt easily to
changes in the configuration.

Expensive to maintain the network due to many cables between computer systems
and even if a failure in the cables occur then it will be very hard to replace that
particular cable as it involved more and more costs.

When using a laptop which is required to be connected to the network, a wired.

Network will limit the logical reason of purchasing a laptop in the first place.
Interference due to weather, other radio frequency devices, or obstructions like
walls.

In the proposed system, we create a new framework for quantifying
overhead due to control messages generated to exchange location
information.

We compute the minimum number of bits required on average to describe
the locations of a node, borrowing tools from information theory.

The main source of in efficiency of proactive and reactive geographic
routing as well as the major contributors to routing overhead in MANETs.

Network can be extended to places which cannot be wired.

1. Login
2. Network Formation
3. Send data using geographic routing
4. Receiving data
5. Expected overhead


Login

This is the module to Expected Routing Overhead for
Location Service in MANETs under Flat Geographic Routing

Network Formation

A mobile ad hoc network (MANET) is a collection of
mobile nodes that construct and maintain a network without a
centralized authority. Un like in a more traditional wired
network (e.g., the Internet), there are no dedicated routers or
switches responsible for forwarding packets instead, every
node participates in relaying packets.

Send data using geographic routing

Proactive and reactive routing, and suggested that control overhead is
proportional to the square of the number of nodes in the network. We
assume that nodes employ flat geographic position-based routing without
designated location servers that maintain the location information of
mobile nodes.

Receiving data

Receive the data by the destination node there has been much
research on understanding the network transport throughput, or simply
transport throughput, of multi hop wireless networks: In their seminal
paper Gupta and Kumar investigated the transport throughput of static
multi hop wireless networks and showed that the transport throughput
increases, at best, as p with an increasing number of nodes n.


Expected overhead

This result is then used to demonstrate that the expected
overhead is where n is the number of nodes, under both proactive
and reactive geographic routing, with the assumptions that nodes
mobility is independent, and nodes adjust their transmission range
to maintain network connectivity. Finally, we prove that the
minimum expected overhead under the same assumptions is _on
logon pp

Register form

Login form

It is concluded that the application works well and satisfy the end users.
The application is tested very well and errors are properly debugged. The
application is simultaneously accessed from more than one system.
Simultaneous login from more than one place is tested.

Further enhancements can be made to the application, so that the
application functions very attractive and useful manner than the present
one. The speed of the transactions become more enough now.
The project has covered almost all the requirements.
Further requirements and improvements can easily be done since the
coding is mainly structured or modular in nature. Improvements can
be appended by changing the existing modules or adding new
modules. One important development that can be added to the
project in future is file level backup, which is presently done for
folder level.

You might also like