Beruflich Dokumente
Kultur Dokumente
I.
I NTRODUCTION
Mobile Ad-hoc Networks (MANETs) are wireless networks consisting of mobile nodes that communicate on-themove without base stations [1]. Nodes in these networks
generate both user and application trafc and carry out network
control and routing protocols. Rapidly changing connectivity,
network partitions, higher error rates, collision, interference,
bandwidth and power constraints together pose new problems
in network control, particularly in the design of higher level
protocols such as routing and in implementing applications
with Quality of Service requirements [2]. The simulation
tool, Decentralized Hop Propagation Coordinator Independent
Algorithm provides node movement in a decentralized manner.
There is no need of any coordinator to call the nodes which are
going out of range. This paper is started with the description of
brief background of an ad hoc network and the motivation for
using decentralized approach. After that, the whole algorithm
is described, which involves calling of nodes without coordinator. Finally, the stimulation results conrm the validity and
proof of the algorithm in the network.
II.
P ROBLEM D EFINITION
BACKGROUND
Fig. 1.
Fig. 2.
IV.
(1)
(2)
Fig. 3.
Fig. 5.
Fig. 6.
V.
Fig. 4.
The four different plots obtained as a result of the simulation are shown in Fig. 4,Fig. 5, Fig. 6 and Fig. 7 where
each graph is plotted as a distance of other nodes from
itself. For example in the rst plot, Fig. 4, distance of other
nodes from node A as measured during the simulation are
plotted. In the gure, the Dark Blue line represents the distance
between node A and node D. Node D initially starts much
closer to node A at time=0 second, but at time=500 seconds
(approximately), it crosses the critical distance (marked by a
Sky Blue line) which is considered as the maximum limit
to maintain the networks connectivity. So, it gets a call
from Node B as shown in the calling result on Table 1, to
come within the neighbourhood following which the distance
between node A and D decreases as evident from the Fig.
4. Similarly, Fig. 5 is for Node B. Here too, when the node
D, represented by Dark Blue, crosses the critical distance at
time=400 seconds(approximately), node A calls it and node D
immediately comes within the neighbourhood. It is followed
Fig. 7.
A calls D
C calls A
D calls B
C calls B
B calls A
C calls D
D calls A
C calls B
C calls B
A calls D
B calls A
B calls D
A calls D
B calls A
B calls D
A calls B
C calls D
D calls A
C calls B
A calls D
A calls D
B calls A
B calls A
A calls B
D calls A
C calls B
C calls B
C ONCLUSION
Going through other decentralized network approach algorithms, it is found that the calling mechanism is not appropriate
if the front node which goes out of the network is allowed to
stop and wait for other nodes to approach there. This problem
is totally eliminated in the proposed algorithm. Also, when the
number of nodes increases, the complexity depends only on the