Professional Documents
Culture Documents
Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 5, Issue 6, June 2015)
Communication System Laboratory Sys'Com, National Engineering School of Tunis, University Tunis El Manar
I. INTRODUCTION
A. Motivation
Mesh network for smart metering application can be
considered as trees of nodes rooted to different
concentrators creating a neighbor area networks.
37
B. LOADng Specification
LOADng describes four types of packets:
Route Request (RREQ): The RREQ is generated by a
router the <originator>, when a data packet in
available to a destination, RREQ packet is with no
valid route and with a specific destination address.
Route Reply (RREP): The RREP is generated by a
router, upon a RREQ reception and processing with
destination address in its routing set.
Route Reply Acknowledgement (RREP-ACK): The
RREP-ACK is generated by a LOADng router after a
reception of RREP, as an indication to the neighbor
source of the RREP that the RREP was successfully
received.
Route Error (RERR): the RERR is generated by a
router when the router detects a broken route to the
destination.
LOADng inherited basic operations of AODV, including
generation and forwarding of Route Request RREQs to
discover a route to a specific destination as shown in Fig 1.
38
D. Information Base
In order to maintain the protocol state, the following
information base sets are required:
The Routing Set: The Routing Set stores tuples for
each reachable node.
39
Value
Communication range
150m
Distance
to
Concentrator
the
B. Simulations Results
Grid Size
1000*1000 m2
Number of routers
Variable [25/50/75/100/125/150]
Mote type
Tmote Sky
Network layer
MAC layer
Radio interface
Simulation time
IPv6 + 6LoWPAN
CSMA + ContikiMAC
CC2420 2.4 GHz IEEE 802.15.4
8h
P2MP PDR
0.7
0.5
0.4
0.2
Traffic Pattern
MP2P traffic flow by periodic reporting with 5s
interval and acknowledgment of each received
frame in upward direction.
P2MP traffic with two messages types :
Acknowledgment of data frames in downward
direction every data arrival.
Configuration data sent with Poisson process with
average of a single arrival per interval of 10
minutes in downward direction.
50
100
150
Distance(m)
200
250
1.8
1.6
1.4
P2MP PDR
Sink
AODV
LOADng
RPL
0.3
TABLE 2
TRAFFIC PATTERN OF NODES
Node Type
Client
0.6
1.2
1
0.8
0.6
0.4
0.2
0
50
100
Number of Nodes
40
150
0.9
AODV
LOADng
RPL
1600
0.85
MP2P PDR
1400
1200
0.8
0.75
0.7
1000
0.65
800
0.6
600
AODV
LOADng
RPL
0.55
400
0.5
50
100
150
Distance(m)
200
0
250
50
100
150
Distance(m)
200
250
2500
200
2000
1500
1000
500
MP2P PDR vs Number of Nodes
1
50
100
150
Number of Nodes
0.9
MP2P PDR
0.7
0.6
0.5
0.4
AODV
LOADng
RPL
0
50
100
Number of Nodes
41
150
Overhead
80
70
2500
AODV
LOADng
RPL
60
50
40
30
20
10
0
50
60
70
80
90
100
110
Number of Nodes
120
130
140
150
140
150
2000
1000
2000
50
100
150
Distance(m)
200
Overhead(Bytes/Sec)
500
250
1500
1000
3500
500
3000
0
50
60
70
80
90
100
110
Number of Nodes
120
130
2500
1500
1000
500
0
50
100
150
Number of Nodes
42
IV. CONCLUSION
The results in simulations reveal that the LOADng
protocol is better than AODV routing protocol in all cases.
In AMI scenario, LOADng showed better memory
management and power consumption. Also, it still has less
implementation complexity compared to RPL which is a
crucial point.
To sum up, many aspects remain interesting perspectives
and future challenges: Evaluating LOADng performance in
real experiment, testing its performance in other application
domains in order to find how we can optimize flooding and
route storage to maximize its performance.
REFERENCES
[1]
[2]
[3]
[4]
[1]
[2]
[3]
AUTHORS
S. Elyengui: is a PhD student in the
department of communication systems at
Tunisian National School of Engineering,
University of Tunis El Manar Tunisia. She is a
researcher in the area of smart grid
communication and networking, SG networks
security, AMI applications and M2M
communications. She received her Computer
Networks Engineer Diploma and a Master degree in new
Technologies of Communication and Networking in 2007 and
2011 respectively.
programming
Technologies I
43