I.INTRODUCTION
The frequent occurrence of disasters has raised peoples
consciousness and increased their efforts to prevent, manage,
and resolve the resulting issues. Many disasters derived from
one cause or another has been witnessed. Therefore, it is
important to develop a 3D virtual environment for emergency
scenarios in order to apply a pre-rescue plan in graphical
14
www.ijrdt.org
ISSN(O):- 2349-3585
15
www.ijrdt.org
16
ISSN(O):- 2349-3585
www.ijrdt.org
17
ISSN(O):- 2349-3585
III.PROPOSED SYSTEM
In order for nodes to maintain data persistency in mobile
collaborative virtual over MANETs, they need to retrieve
critical data from departed nodes. However, with the fact that
Ad-hoc networks are error-prone and nodes may disconnect
suddenly, it can be clearly seen the great feasibility to
incorporate agent services for them that enables nodes to
autonomously make intelligent decision about the node state in
the network and user interest in the virtual environment. Nodes
with worst states are expected to transmit their critical to a
neighbor node, and then former node must inform all neighbors
about the node states. In this paper we propose the detail of
the system with the following:
Provide agent data persistency service among mobile user
participating in the virtual environment without a fixed
network infrastructure.
Choose an assurance node list for every coordinator node in
the network to take over the role when necessary.
Mobile agents are special software resides in a node and have
the ability of moving through the network while they take
decision about transferring critical data. It can halt themselves,
migrate to another node, and execute services without being
affected by the status of origin node.
One agent should have three dimensions from representation
and mobility to intelligence:
Representation: one agent represents one node to other
node or agents
Mobility: one agent can move through the network and
deliver its node critical information while they travel from
one node to another
www.ijrdt.org
3.
4.
Agent Evaluation
4.1. IF Node status worsens node may leave the
network
i.
ii.
iii.
18
ISSN(O):- 2349-3585
4.2. ELSE
i.
5.
Go back to step 1
stop
B. Agent Evaluation
The agents signal strength evaluation in our approach uses the
method deployed in Multi Agent based Adaptive DSR
(MADSR) [28]. MADSR is an extended version of the
dynamic source routing protocol DSR [27]. It uses signal
strength as routing metric to predict link break before they
actually occurs. It measures the strength at which it received
the packet and energy level of the node. If the received signal
strength is greater than a certain threshold, the link is
considered to be stable. Thus, agent decision - no need for data
transfer.
The value of the network latency evaluation should be less than
400ms as described in [26] to provide a sense of immersion for
participating users. Such requirement was initially stated for
CVE in wired network. We believe this requirement can be
relaxed to cover CVE in mobile environment.
The user interest evaluation in the VE is defined as the
combination of number of users participating in the same
session, and the total number of processed objects per second.
A connection between agents in the same session requires a
network path between hosts on which agents reside.
IV.SIMULATION RESULTS
We evaluate our system over ad-hoc networks. We create
randomly various scenario files that describe the mobility
pattern for each node using the setdest command provided by
(NS2 v.2.35) [29]. We run the scenarios for about 7200
www.ijrdt.org
ISSN(O):- 2349-3585
References
3
Our Proposed
Mobile
Agent
100
90
80
70
60
50
40
30
20
10
0
Network Size
Figure 2: Average number of systems failure using
both approaches.
V.CONCLUSIONS
This paper provides a mobile agent based approach to design a
persistent world for emergency preparedness scenario over adhoc network. Persistency is guaranteed through the agent
evolution of the node state in the network and the user behavior
during the run scenario. The approach was designed s to
ensure reduced traffic between the coordinator node and its
networks neighbors. Unlike other approaches, the algorithm is
not directly affected when many nodes leave suddenly the
19
www.ijrdt.org
20
ISSN(O):- 2349-3585
www.ijrdt.org