BAYESIAN ESTIMATION FOR TARGET TRACKING
IN MOBILE SENSOR NETWORK
Abstract
This mobile network will
support terminal mobility, personal mobility, and service provider portability,
making global roaming seamless. A location-independent Personal Telecommunication
Number (PTN) scheme is conducive to implementing such a global mobile system.
However, the non geographic PTNs coupled with the anticipated large number of
mobile user’s in future mobile networks may introduce very large centralized
databases. This necessitates research into the design and performance of
high-throughput database technologies used in mobile systems to ensure that
future systems will be able to carry efficiently the anticipated loads. This is
scalable, robust, efficient location database architecture based on the
location- independent PTNs.
The proposed multi tree
database architecture consists of a number of database subsystems, each of
which is a three-level tree structure and is connected to the others only
through its root. By exploiting the localized nature of calling and mobility
patterns, the proposed architecture effectively reduces the database loads as
well as the signaling traffic incurred by the location registration and call
delivery procedures. In addition, two Memory-resident database indices,
memory-resident direct file and T-tree are proposed for the location
databases to further improve their throughput. Analysis model and numerical
results are presented to evaluate the efficiency of the proposed database
architecture. Results have revealed that the proposed database architecture for
location management can effectively support the anticipated high user density
in the future mobile networks.
Existing System:
The previous mobile network was
use different server and each has decentralized databases. A local server is
stored only its area user’s information, but not stored the other area user’s
information. For example Chennai mobile user call to the Srilanka user means,
First it search in the local mobile user and after finished search in India and
then find it in the Srilanka server. It takes more time to find the user
location because of decentralized databases. The communication traffic also
occur when search client side.
Proposed System:
In proposed system, the mobile
network search only in server but not in client mobile. Because all user’s
information maintained in centralized database server. It is avoid the
communication traffic, because this is only search in server part and easily
find the user.
This is a scalable, robust,
efficient location database architecture based on the location-independent
PTNs. The proposed multi tree database architecture consists of a number of
database subsystems, each of which is a three-level tree structure and is
connected to the others only through its root. By exploiting the localized
nature of calling and mobility patterns, the proposed architecture effectively
reduces the database loads as well as the signaling traffic incurred by the
location registration and call delivery procedures.
In addition, two
memory-resident database indices, memory-resident direct file and T-tree
are proposed for the location databases to further improve their throughput.
Analysis model and numerical results are presented to evaluate the efficiency
of the proposed database architecture. Results have revealed that the proposed
database architecture for location management can effectively support the
anticipated high user density in the future mobile networks.
System Requirement:
SOFTWARE
REQUIREMENTS
n VS .NET 2003
n SQL SERVER 2000
n Windows XP.
HARDWARE REQUIREMENTS
n 000Hard disk : 40 GB
n RAM : 512mb
n
Processor : Pentium IV
n
Monitor : 17” Color monitor
No comments:
Post a Comment