MOBILITY TRACKING BASED ON AUTOREGRESSIVE MODEL

PROJECT GUIDE MR. M.SIVA KUMAR

Assistant Professor- Dept Of IT

GROUP MEMBERS R.PRAVEEN KUMAR V.V.NAVEEN KUMAAR M.PRAVIN KUMAR Final Year IT SNS COLLEGE OF ENGINEERING

The current Mobility tracking system propose an integrated scheme for tracking the mobility of a user based on autoregressive models that accurately capture the characteristics of realistic user movements in wireless networks

Our results validate the accuracy of the proposed tracking scheme even when only a small number of data samples is available for initial training.

Mobility management in sensor networks is different from that in mobile hoc networks because the movement of sensor nodes here is not random; rather, the movement of sensor nodes is purposeful.

It is important to have an efficient mobility management scheme to ensure that sensor node mobility is exploited in the best possible way, e.g., to improve the quality of tracking. The existing system couldnt find the node if the behavior of the nodes are same.

 In existing system locomotion energy

ie the node movement should be more.

There was no periodic history available. Node analysis with same behavior is not possible.

Lack of continuous movement analysis.

PROPOSED SYSTEM
The first is a sampled version, first-order AR model. The AR-1 model is a variant of the linear system model with the key feature that it is to Minimum Mean Squared Error estimation of the model parameters.

The second AR-based model, which we call the Position- AR model, is a discrete-time model in which the mobility state consists of the mobiles position at consecutive time points.
In the Position-AR model, velocity and acceleration are represented as finite differences of position coordinates..

The mobility state consists of position, velocity, and acceleration so

the continuous movement can be identified.

Locomotion energy is very low

We can get the particular user movements in large scale networks

We can get periodic wise transaction reports Avoid node collision We can get Angle of Area(AOA) exact processing reports

MODULES
Node creation

Protocol implementation

Simulation results

1. NODE CREATION
Node creation contains managing user details Profiles, PTN (Personal telecommunication number) and Registration details,
1.Profile 2.Indexing

2. PROTOCOL IMPLEMENTATION
Protocol implementation contains Distributed server details, the distributed database management contains multiple architectures, DB0, DB1, DB2

PROTOCOL IMPLEMENTATION (Contd..)

Observation Data in Wireless Networks

To perform mobility state estimation, we assume that either received signal strength indicators (RSSI) or time of arrival (TOA) measurements from at least three base stations are available We remark that the angle of arrival (AOA) of the mobiles signal at multiple base stations is often used for location tracking. AOA information is not suitable for use in conjunction with an extended Kalman filter, since the AOA measurements are noncontinuous functions of mobility state that are generally not differentiable

3. SIMULATION RESULTS

Managing the mobile node address and movement of the mobile node based on the loss of energy. And when the user will move, join or leave the information will exchange the server moving in x and y axis.

PATH DETAILS (LOCATIONS)

The path details contain store the detail about tower reaching areas and directions, location details.

It is used to very easily find out the particular user locations.

Through the Dijikstras Algorithm we can get the number of

shortest

path

TRACKING

Here we are using Autoregressive model, through this we can analyzing the nodes density, velocity, periodicity based analyze the node movements, each and every nodes are having the individual behaviors, applying the pattern clustering scheme we can form the efficient knowledge based clusters

Application of Kalman filter

Based on the AR-1 and Position-AR mobility models,

we develop a mobility tracking scheme that integrates MMSE estimation for the unknown model parameters with mobility state estimation using Kalman filtering. To apply the extended Kalman filter for state estimation, the observation equation given in (16) and (19) can linearized as follows h(sn) + Hnsn + n,

To apply the extended Kalman filter for state estimation, the observation equation given in (16) and (19) can linearized as follows h(sn) + Hnsn + n,

IMPLEMENTATION OF MOBILITY TRACKING

We used the ns2 software to implement the Mobility Tracking

system, and to also simulate mechanism.

Since, ns2 has more analyzing facility and plenty of libraries

and algorithms, it is chosen for simulation.

The performance of Mobility Tracking is evaluated by

changing the number of nodes, varying the Query request rate and mobility of nodes in the network.

CONCLUSION

We proposed a mobility tracking scheme based on two autoregressive models of mobility, which we refer to as the AR-1 and Position-AR models. The proposed mobility tracking scheme consists of an integrated scheme of MMSE (Minimum Mean Squared Error) parameter estimation and mobility state estimation based on Kalman filtering. We have also analyzed the effects of different operational settings on the performance of mobility estimation scheme using both models and both observations.

SCREEN SHOTS

Further requirements and improvements can easily be done since

the coding is mainly structured or modular in nature.

Changing the existing modules or adding new modules can

append improvements.
Further enhancements can be made to the application, so that the

web site functions very attractive and useful manner than the present one.

REFERENCES
[1] C. Bettstetter, Smooth is better than sharp: A random mobil- ity model for simulation of wireless networks, in Proc. ACM MSWiM, pp. 1927, July 2001. [2] T. Camp, J. Boleng, and V. Davies, Survey of mobility models for ad hoc network research, Wireless Communication and Mobile Computing, vol. 2, no. 5, pp. 483502, 2002. [3] I. F. Akyildiz, Y. B. Lin, W. R. Lai, and R. J. Chen, A new random walk model for PCS networks, IEEE J. Select. Areas Commun., vol. 18, no. 7, pp. 12541260, 2000. [4] D. Johnson and D. Maltz, Dynamic source routing in ad hoc wireless networks, Mobile Computing, vol. 353, pp. 153181, 1996. [5] H. Stark and J. W. Woods, Probability and Random Processes with Applications to Signal Processing. Prentice Hall, 3rd ed., 2001.

QUERIES???

T H A N K YO U