Abstract:
The project Distributed Mobility Management for target tracking in mobile sensor Network proposes scalable, robust, efficient location database architecture based on the location- independent PTN. For mobile sensor networks that are deployed for surveillance applications, it is important to use a mobility management scheme that can empower nodes to make better decisions regarding their positions such that strategic tasks such as target tracking can benefit from node movement. In this paper, we describe a distributed mobility management scheme for mobile sensor networks. 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. Location management procedures involve numerous operations in various databases. These databases record the relevant information of a mobile user, trace the userâ„¢s location by updating the relevant database entries, and map the userâ„¢s PTN to its current location.

Distributed Mobility Management for Target Tracking in Mobile Sensor Networks

Mobility management is a major challenge in mobile ad hoc networks (MANETs) due in part to the dynamically changing network topologies. a mobility management scheme that can empower nodes to make better decisions regarding their positions must be used so that strategic tasks such as target tracking can benefit from node movement. This scheme considers node movement decisions as part of a distributed optimization problem which integrates mobility-enhanced improvement in the quality of target tracking data
General MANET Characteristics:
-Members joining and leaving the network
-No base station
-No dedicated routers
-Difficult to create scheme for handover

Purpose:
Creation of an algorithm that
-estimates the consequences of node movement.
-as result: Autonomous decision of a node if it should move
that suits well to the general MANET.

Algorithm:
-It aims at S/N improvement at minimal costs.
-The Prerequisite is that Data about one-hop neighborhood present in all nodes.

Algorithm (simplified):
Step1)
Predict possible sensor results for
all possible new sensor positions (also
from one-hop network).

step2)Treat them as true results
step3)Calculate which movement of
which node gives best results.
step4)If processing node is the best
node to move, move to computed
position.

for details refer this pdf:

[attachment=3173]

please send how to do in vb.net anyone pls.

(30-01-2010, 07:21 AM)computer science technology Wrote: Abstract:
The project Distributed Mobility Management for target tracking in mobile sensor Network proposes scalable, robust, efficient location database architecture based on the location- independent PTN. For mobile sensor networks that are deployed for surveillance applications, it is important to use a mobility management scheme that can empower nodes to make better decisions regarding their positions such that strategic tasks such as target tracking can benefit from node movement. In this paper, we describe a distributed mobility management scheme for mobile sensor networks. 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. Location management procedures involve numerous operations in various databases. These databases record the relevant information of a mobile user, trace the userâ„¢s location by updating the relevant database entries, and map the userâ„¢s PTN to its current location.

to get information about the topic"DISTRIBUTED MOBILITY MANAGEMENT FOR TARGET TACKING IN MOBILE SENSOR NETWORKS" full report ppt and ralated topic refer the page link bellow


http://studentbank.in/report-distributed...e=threaded