Académique Documents
Professionnel Documents
Culture Documents
472
978-1-4799-3448-5/13/$31.00 © 2013 IEEE
2013 Fifth International Conference on Advanced Computing (ICoAC)
473
2013 Fifth International Conference on Advanced Computing (ICoAC)
(LJIiIude.LongitudtHN,E)
DAMGPSR Neighbor Table Formation
Input-none
Output- Each node knows its neighbors and maintains a (12,18)
Neighbour_Table
begin procedure
for all node; in the node[] do
each node; broadcast HELLO packet
all nodej that hears the broadcast message updates the node; Oeslinllion
value in its Neighbour_Table
nodej that is neighbor of node; sends HELLO packet to node; (07)3)
end for
end procedure
(04,21)
(01,04) (01,13)
DAMGPSR Routing
(12,18)
E. Illustration of The Routing Procedure
The routing procedure of DAMGPS is illustrated in Fig.2 for
stage-I, in Fig.3 for stage-2 and in Fig.4 for stage-3. Each
node broadcasts HELLO messages to every other node and
Latitude Longitude
(04)1)
06 05
(01,04) (01,13)
11 04
01 04
Fig 3: Illustration of DAMGPS routing stage:2
474
2013 Fifth International Conference on Advanced Computing (ICoAC)
Table.4: Neighbor Table and Forwarding table of(06,05) control packet are and respectively 64 bits each. The packet
Latitude Longitude generation rate is 5 packets/sec and radio range is as far as 30
metres.
05 09 Table 5:Parameter list of simulation
10 lO Parameter Value
Average node degree 4.59 5.16 8.02 9.65 11.91
If there occurs some error and if node (08,02) did not receive 15.82 20.48
any acknowledgement after certain timeout, the algorithm will Network size 150
go along the next chosen node in the Following-Table, Data packet size 64 bit
(11,04). Network topology Random
This process continues until the destination is reached. Mobility Static
When node (08,20) is reached, the Neighbor_Table is checked
and the algorithm finds that the destination is the next best The end-to-end delay performance of DAMGPSR is shown
node to route the data. Hence the procedure terminates after in Fig.5. The proposed protocol offers a significantly better
the DATA packet is sent. performance in delay efficiency, especially in presence of
Thus at each stage, the packet gets geographically closer to voids and node failures. This is because unlike GPSR, the
the destination and from the closest path the quickest one is proposed protocol stores some path information before packet
chosen. Hence the data is routed along the quickest path and forwarding.
always the data moves one step closer to the destination. The
multipath helps in recovering from failure in case of void or
mobility.
gpsr
damgpsr -+-
0.09
(12.18)
0.08
0.07
0.06
(07�) 0.05
0.04
(04)1)
475
2013 Fifth International Conference on Advanced Computing (ICoAC)
Table.6 : Packet format used in simulation memory requirements which is desirable for Wireless Sensor
Type Networks in general. The protocol also minimizes flooding of
Field
packets and ensures that the number of copies of the packet
Double held by the sensor networks is minimum. This is highly
RSSI
desirable for the energy constrained Wireless Sensor
Double Networks. The simulation results show the lower delay
LQI
required by DAMGPSR over a standard geographic protocol
Int like GPSR.
nextHop
Int REFERENCES
lastHop
[1] C. Perkins and P. Bhagwat. "Highly dynamic destination
String
Source sequenced distance vector routing (dsdv) for mobile computers."
ACM SIGCOMM: Computer Communications Review, pp:234-244,
String October 1994.
Destination
Int [2] S. Murthy and 1. Garcia-Luna-Aceves, "An efficient routing
Sequence No.
protocol for wireless networks. ACM Mobile Networks and App. 1.,
Int Special Issue on Routing in MobileCommunication Networks, pp
Kind
183-197, October 1996.
time_delivery field is used to record the time at which the [3] T.-W. Chen and M. Gerla, "Global state routing: A new routing
packet originated so that the delay experienced by the packet scheme for ad-hoc wireless networks." In Proceedings of IEEE
can be easily calculated. ICC'98 on pp 171-175 Vol-I, 1998.
DAMGPSR, a new routing protocol that reduces delay, has [12] Xin Ming Zhang, En Bo Wang, Jing Jing Xia, and Dan Keun
been proposed in this paper. The protocol has very low Sung, "An Estimated Distance-Based Routing Protocol for Mobile
Ad hoc Networks" IEEE TRANSACTIONS ON VEHICULAR
476
2013 Fifth International Conference on Advanced Computing (ICoAC)
TECHNOLOGY, VOL. 60, NO. 7, pp 3473 - 3484 SEPTEMBER [16] Rong Ding, Lei Yang, "A Reactive Geographic Routing
2011. Protocol for Wireless Sensor Networks" Intelligent Sensors, Sensor
Networks and Information Processing (ISSNIP), pp: 31 - 36 Dec
[13] Kunagorn Kunavut* and Teerapat Sanguankotchakorn , "QoS 2010.
aware Routing for Mobile Ad hoc Networks Based on Multiple
Metrics:Connectivity Index (CI) and Delay" Electrical [17] Alok Kumar and Shirshu Varma, "Geographic Node-Disjoint
Engineering/Electronics Computer Telecommunications and Path Routing for Wireless Sensor Networks" IEEE SENSORS
Information Technology (ECTI-CON), pp: 46 - 50 May 2010. JOURNAL, VOL. 10, NO. 6, pp 1138-1139 JUNE 2010.
[14] Shun Liu Jian Liu,"Delay-aware Multipath Source Routing [18] DGRAM: A Delay Guaranteed Routing and MAC Protocol for
Protocol to Providing QoS Support for Wireless Ad Hoc Networks" Wireless Sensor Networks, IEEE Transactions On Mobile
Communication Technology (ICCT), 2010 12th IEEE International Computing, VOL. 9, NO. 10, pp 1407-1423 OCTOBER 2010.
Conference pp 1340 - 1343 2010 IEEE.
477