SlideShare uma empresa Scribd logo
1 de 4
Baixar para ler offline
Regular Paper
Proc. of Int. Conf. on Advances in Recent Technologies in Communication and Computing

Graphical Visualization of MAC Traces for Wireless
Ad-hoc Networks Simulated in ns2
1

Manan Thakar, 2Yogendra Raulji, 3Jayrajsinh Gohil, 4Hardik Mistry,
5

Mayur M Vegad and 6Dr. Narendra M Patel
Gujarat Technological University, Ahmedabad, Gujarat, India
1
manan_thakar@yahoo.co.in, 2raulji.yogendra@gmail.com, 3jaygohil1710@gmail.com, 4hardikmistry.1992@gmail.com
mayurmvegad, nmpatel@bvmengineering.ac.in
Abstract - Many network simulators (e.g., ns2) are already
being used for performing wired and wireless network
simulations. But, with the current graphical visualization
support in-built in ns2, it is difficult to understand the node
status, packet status and the MAC level events particularly
for Ad-hoc networks. In this paper, we extend the visualization
support in ns-2 that should help research community in the
area of wireless networks to analyze different MAC level
events in an efficient manner. In particular, we have developed
two types of visualizations namely, temporal and spatial.
Temporal visualization helps to analyze success or failure of
a packet with respect to time while spatial visualization helps
to understand the effects due to proximity of nodes. The trace
is made highly configurable in terms of different attributes
like specific nodes and time duration.

A. Input from users
Usually, there would be many nodes and many activities
and events in the network at runtime. But, we will have to
know the particular nodes for which the user wants to see
the visualization.
So, the inputs required from the user are:
1) Number of nodes for which the visualization is
needed.
2) Particular node numbers for which the visualization
is needed.
3) The time period for which the visualization is
needed.
Thus, the nodes for which the visualization is needed
and for which time period is needed, is acquired by the dialogbox

Index terms- Network event tracing, wireless networks, network
simulator, MAC layer, graphical visualization, ns2, collision,
packet, topography

B. Trace File
All the details about the packet and the events will be
acquired from the trace file of ns2. Here, trace file is a file
containing the traces of various events at different layers,
generated by the simulator ns2. When the TCL script describing the network scenario is run on ns2, the trace file is
created having the information about the events in network.
From this trace file, we can get the following information:
Event type (sent, received, dropped, forward), time instant,
node number (node-id), trace name (at which layer the event
occurred), reason (collision, retry-limit-reached, etc), event
identification number (event-id), packet type (RTS, CTS, tcp,
etc), size of the packet, duration field of MAC frame, (MAC
level) destination , (MAC level) source, type (ARP – 0x0860
/ IP – 0x0800).
This file is read by our program and the useful attributes
to build the visualization are stored in the data structure.
Here, to store such attribute=s, we have used appropriate
java-classes. Such classes are described in the next section.

I. INTRODUCTION
A network simulator is a tool for implementing the network on the computer. With the help of a simulator, the
behaviour of the network is calculated either by network entities interconnection using mathematical formulas, or by
capturing and playing back observations from the simulated
network. Network simulators like ns2, ns3, OPNET, NetSim,
OMNeT++, REAL, J-Sim and QualNet are already being used
for performing wired and wireless network simulations. But it
is difficult to understand the status of the nodes & packets
and the MAC level events particularly for Ad-hoc networks.
The resulting product of this work is useful to visualize and
analyze the different MAC level events for ad hoc wireless
networks when simulated in ns2. In this paper, we emphasize
on the main features of events and packets and provide a
comprehensible visualization for them. It is hoped that, this
work will prove to be a good reference source for those people
who feel difficult to analyze the MAC level events for wireless Ad-hoc networks.

C. Node-position-scenario File
This is (usually, a separate) text file in TCL, specifying
the positions (in Cartesian coordinates) of the participating
nodes. This information is used to determine the network
topology and is read by the main TCL script as an input.
Moreover, if the nodes are moving from one place to other
place, than such movements are also specified in this file.
Thus, the scenario file specifies:
1)
The co-ordinates of nodes
2)
Movements of nodes

II. SYSTEM INPUTS
For creating visualization, information about the nodes,
events and packets of the network is required. For that, we
take some inputs from various sources.

© 2013 ACEEE
DOI: 03.LSCS.2013.5. 548

53
Regular Paper
Proc. of Int. Conf. on Advances in Recent Technologies in Communication and Computing
packet is also calculated using the received power. The width
will be proportional to the size of the packet. Then, the packet
is drawn at the particular time on the graph Then, the packet
is drawn with green color if distance is within the transmission range. If distance is greater than transmission range but
within the threshold range, then fill it with yellow packet.
For detecting the collision, for each packet, the
interference range of the receiver is found. For finding
interference range, the below formula is considered
Interference range =(δ1/α ) *distance, Where δ = Capture
Threshold (minimum signal-to-interference ratio for
successful reception) with default value of 10, α = path-loss
factor (with default value of 4) distance = distance between
sender and receiver. Now, for this receiver, check whether
any other node within the interference range is trying to send
a packet during same time or not. If such packet is found,
then it will be dropped. So, draw it with RED color. Define the
mouse clicking event. Here, on clicking any packet, the packet
details should be displayed. For the collided packet, it is
collided with which packet is also specified.
It is worth noted here that, for detecting a collision, we
have calculated the interference range and based on that, the
collision is detected. Though, such information about a
collision event is already available in the trace file in ns2, in
the following we explain why it was required to calculate the
interference range.

III. IMPLEMENTATION
We have used java programming for the implementation.
Particularly, the java-graphics objects are used for graphical
presentation and swing properties of java are also used along
with them.
Now the implementation for temporal and spatial visualization is explained.
A. Implementation of Temporal Visualization
After achieving the input information, that information is
plotted on the graph to make visualization. This algorithm is
for visualization-1.
The algorithm to plot the visualization graph is as below:
The axis for the graph is drawn for each node. (X-axis specifies the time and y-axis specifies the power of transmission
or reception.)Set start-time specified by user as the starting
time in the graph.
For sending packet, the rectangle is drawn on the appropriate sender node graph. The height of this rectangle is the
maximum unit strength) as the power of sending packet is the
maximum and the width will be proportional to the size of the
packet. Fill it with BLUE color for the send packet.
For each node other than sender node for a particular
event, the distance of the node from the sender node is calculated. If this distance is in the threshold range, then the
power of the received packet is calculated. The height of the

Fig. 1 Graphical Visualization

B. Implementation of Spatial Visualization
If the visualization2 (spatial visualization) is selected
after taking input, the following steps are carried out:
1) The nodes are drawn at their position specified in the
scenario file with their threshold range and transmission range.
Here, threshold range is specified in the blue color and the
transmission range is drawn in black color.

In the trace file, the ending time of the collided packet is
specified and not the beginning time of collision. Moreover,
we cannot determine with which packet a particular packet is
collided. For solving these problems, we have used the
interference range and based on that, the collision event is
traced and the packet causing the collision is determined
easily.
© 2013 ACEEE
DOI: 03.LSCS.2013.5. 548

54
Regular Paper
Proc. of Int. Conf. on Advances in Recent Technologies in Communication and Computing

Fig. 2 Graphical Visualization showing details of packet

Fig. 3 Spatial Visualization

2)The time-bar is drawn at bottom of the nodal
representation. One marker is shown moving with the time to
reflect the current time.
3) With the time, interference range is drawn at the
reception node of the packet. Interference range is drawn
with red color.
4) With the progression in transmission time of a given
packet, the packet is shown moving from source to destination
© 2013 ACEEE
DOI: 03.LSCS.2013.5. 548

. A successfully received packet is drawn with blue color,
whereas a collided packet is drawn with red color.
By implementing this algorithm, the spatial visualization
is generated.
IV. VISUALIZATION
A. Temporal Visualization
This figure shows details of 4 nodes as sender and
55
Regular Paper
Proc. of Int. Conf. on Advances in Recent Technologies in Communication and Computing
receiver side on time scale.
Here, the following points are to be noted:
A blue colored packet is a sent packet and a green packet
is a received packet.
Width of packet in graph is proportional to the actual size
of the packet. For example, the width of a data packet is
(usually) larger than the width of RTS/CTS packet as
observed in Fig. 1.
 A yellow packet shows that the corresponding receiving
node is in the carrier sensing range of the corresponding source node. This indicates that this particular packet
is a ‘sensed only’ (i.e., non-decodable) kind of packet.
In other words, such a transmission is sensed but the
packet cannot be interpreted.
The height of the packet in graph is proportional to the
transmitted or received power of the packet. Here, it can
be observed that the height of green packet (receiving)
is less than that of blue (sending) packet as obvious.
 A red packet shows the dropped packets. One of the
reasons for dropping could be a collision with some
other packet.
As the wireless link is of broadcast nature, a packet is
received by all the nodes within the transmission range of the
sender
When a particular packet, (sent or received) is clicked
with a mouse, its details are displayed as shown in Fig. 2.
Here, all the details of the clicked packet are shown as the
message. A click on OK button gets dialog-box disappeared.
In Fig. 2, the details of a collided packet are shown. Here, it
can be observed that the details of both the packets which
are collided are displayed.
For this scenario, the data-packet sent by node 0 destined
to node 1 is sensed by node 2. Now during that time, node 3
(a hidden terminal) also starts to send a packet to node 2. This
results into a collision at node 2. This is clearly depicted in
Fig. 2.

The description of each of the range is as follows:
1. Carrier sense range: in which, the packet is sensed.
2. Transmission range: in which, the packet is
successfully received (decodable).
3. Interference range: within which, if some other node
transmits concurrently then collision happens.
Thus, in spatial visualization, topography of each node
is displayed. In the specific example depicted in Fig. 3, it can
be observed that, node 0 is transmitting a packet to node 1.
Now at the same time, node 3 also tries to send packet to
node 2. As seen, node 2 is also in the interference range of
node 1. Consequently, the packets are collided.
V. CONCLUSION
Current graphical visualization support in ns2 lacks the
details of MAC level event traces like collisions. In this work,
we have attempted to mitigate this limitation. Two types of
graphical visualization are offered: temporal and spatial.
The temporal view of packets incorporates the details of
collision and overlapping of packets with respect to the
progression of simulation time. The spatial view incorporates
the physical activities happening at the nodes emphasizing
the effects of proximity of the participating nodes in space. It
is hoped that, this work would be extremely helpful to research
community in the area of wireless networks. It can be extended
also for further versions of ns2 and ns3.
REFERENCES
[1] Manual of ns2,available at http://www.sop.inria.fr/maestro/
personnel/Giovanni.Neglia/nscourse/ns course.htm.
[2] AT&T reference manual, Wireless personal communication,
1990.
[3] A. Tanenbaum, Computer Networks,4th edition, ch-4;.
[4] Introduction to Glomosim, available at http://
www.slideshare.net/ayyakathir/glomosim-introduction6476014.
[5] Introduction to Omnetpp, available at http://www.omnetpp.org/
pmwiki/ index.php?n=Main.OmnetppInNutshell.
[6] András Varga, Rudolf Hornig, An Overview of the OMNet++
Simulation Environment, SIMUTools, March03-07,2008,
Marseille, France.
[7] Dennis McGrath, Doug Hill, Amy Hunt, Mark Ryan, and
TimothySmith, NETSIM:A Distributed Network Simulation
to Support Cyber Exercises, Award No. 2000-DT-CX-K001
from the Office for Domestic Preparedness, U.S. Department
of Homeland Security
[8] Introduction to netsim, available at http://www.boson.com/
files/support/NetSim8LabCompiler.pdf.
[9] Marc Greis’ Tutorial for the UCB/LBNL/VINT Network
Simulator “ns”, available at http://www.isi.edu//tutorial

B. Spatial Visualization
One another type of visualization is – spatial visualization,
which shows the relative position of the nodes as per their
physical coordinates. This visualization also depicts different
nodal ranges around each of the selected nodes. A typical
sample output for spatial visualization is shown in Fig. 3.
It can be observed that, there are 4 nodes in this scenario.
The nodes are drawn on their coordinate positions as per
their relative positions. For this particular scenario, the nodes
are on a common horizontal line. The colored circles around a
particular node represent the ranges of that node. Particularly, the black circle around node shows its transmission
range, the blue circle shows its threshold range, and the red
circle shows its interference range (applicable to a receiver
node). At the bottom of Fig. 3, time-scale is displayed. As time
progresses, a vertical pointer moves towards right along with
x-axis. A particular instant of time is displayed above this time
scale. Numbers 0,1,2,3, etc show node positions according to
their coordinates.
© 2013 ACEEE
DOI: 03.LSCS.2013.5. 548

56

Mais conteúdo relacionado

Mais procurados

Deep Learning
Deep LearningDeep Learning
Deep Learning
Pierre de Lacaze
 
IJCER (www.ijceronline.com) International Journal of computational Engineerin...
IJCER (www.ijceronline.com) International Journal of computational Engineerin...IJCER (www.ijceronline.com) International Journal of computational Engineerin...
IJCER (www.ijceronline.com) International Journal of computational Engineerin...
ijceronline
 

Mais procurados (18)

Ijebea14 272
Ijebea14 272Ijebea14 272
Ijebea14 272
 
Image encryption technique incorporating wavelet transform and hash integrity
Image encryption technique incorporating wavelet transform and hash integrityImage encryption technique incorporating wavelet transform and hash integrity
Image encryption technique incorporating wavelet transform and hash integrity
 
Modern Convolutional Neural Network techniques for image segmentation
Modern Convolutional Neural Network techniques for image segmentationModern Convolutional Neural Network techniques for image segmentation
Modern Convolutional Neural Network techniques for image segmentation
 
Deep Learning
Deep LearningDeep Learning
Deep Learning
 
Time of arrival based localization in wireless sensor networks a non linear ...
Time of arrival based localization in wireless sensor networks  a non linear ...Time of arrival based localization in wireless sensor networks  a non linear ...
Time of arrival based localization in wireless sensor networks a non linear ...
 
IJCER (www.ijceronline.com) International Journal of computational Engineerin...
IJCER (www.ijceronline.com) International Journal of computational Engineerin...IJCER (www.ijceronline.com) International Journal of computational Engineerin...
IJCER (www.ijceronline.com) International Journal of computational Engineerin...
 
IMPROVING SCHEDULING OF DATA TRANSMISSION IN TDMA SYSTEMS
IMPROVING SCHEDULING OF DATA TRANSMISSION IN TDMA SYSTEMSIMPROVING SCHEDULING OF DATA TRANSMISSION IN TDMA SYSTEMS
IMPROVING SCHEDULING OF DATA TRANSMISSION IN TDMA SYSTEMS
 
A NOVEL CHAOS BASED MODULATION SCHEME (CS-QCSK) WITH IMPROVED BER PERFORMANCE
A NOVEL CHAOS BASED MODULATION SCHEME (CS-QCSK) WITH IMPROVED BER PERFORMANCEA NOVEL CHAOS BASED MODULATION SCHEME (CS-QCSK) WITH IMPROVED BER PERFORMANCE
A NOVEL CHAOS BASED MODULATION SCHEME (CS-QCSK) WITH IMPROVED BER PERFORMANCE
 
Fixed Point Realization of Iterative LR-Aided Soft MIMO Decoding Algorithm
Fixed Point Realization of Iterative LR-Aided Soft MIMO Decoding AlgorithmFixed Point Realization of Iterative LR-Aided Soft MIMO Decoding Algorithm
Fixed Point Realization of Iterative LR-Aided Soft MIMO Decoding Algorithm
 
AGPM: An Authenticated Secure Group Communication Protocol for MANETs
AGPM: An Authenticated Secure Group Communication Protocol for MANETsAGPM: An Authenticated Secure Group Communication Protocol for MANETs
AGPM: An Authenticated Secure Group Communication Protocol for MANETs
 
End sem
End semEnd sem
End sem
 
Image Segmentation (D3L1 2017 UPC Deep Learning for Computer Vision)
Image Segmentation (D3L1 2017 UPC Deep Learning for Computer Vision)Image Segmentation (D3L1 2017 UPC Deep Learning for Computer Vision)
Image Segmentation (D3L1 2017 UPC Deep Learning for Computer Vision)
 
Big data 2.0, deep learning and financial Usecases
Big data 2.0, deep learning and financial UsecasesBig data 2.0, deep learning and financial Usecases
Big data 2.0, deep learning and financial Usecases
 
Chapter - 04 Basic Communication Operation
Chapter - 04 Basic Communication OperationChapter - 04 Basic Communication Operation
Chapter - 04 Basic Communication Operation
 
SIMULATION PROCESS FOR MOBILE NODES INFORMATION USING LOCATION-AIDED ROUTING ...
SIMULATION PROCESS FOR MOBILE NODES INFORMATION USING LOCATION-AIDED ROUTING ...SIMULATION PROCESS FOR MOBILE NODES INFORMATION USING LOCATION-AIDED ROUTING ...
SIMULATION PROCESS FOR MOBILE NODES INFORMATION USING LOCATION-AIDED ROUTING ...
 
A QUANTITATIVE ANALYSIS OF HANDOVER TIME AT MAC LAYER FOR WIRELESS MOBILE NET...
A QUANTITATIVE ANALYSIS OF HANDOVER TIME AT MAC LAYER FOR WIRELESS MOBILE NET...A QUANTITATIVE ANALYSIS OF HANDOVER TIME AT MAC LAYER FOR WIRELESS MOBILE NET...
A QUANTITATIVE ANALYSIS OF HANDOVER TIME AT MAC LAYER FOR WIRELESS MOBILE NET...
 
Multiuser detection new
Multiuser detection newMultiuser detection new
Multiuser detection new
 
A SIMULATION-BASED PERFORMANCE COMPARISON OF MANETS CDS CREATION ALGORITHMS U...
A SIMULATION-BASED PERFORMANCE COMPARISON OF MANETS CDS CREATION ALGORITHMS U...A SIMULATION-BASED PERFORMANCE COMPARISON OF MANETS CDS CREATION ALGORITHMS U...
A SIMULATION-BASED PERFORMANCE COMPARISON OF MANETS CDS CREATION ALGORITHMS U...
 

Semelhante a Graphical Visualization of MAC Traces for Wireless Ad-hoc Networks Simulated in ns2

Iaetsd a novel scheduling algorithms for mimo based wireless networks
Iaetsd a novel scheduling algorithms for mimo based wireless networksIaetsd a novel scheduling algorithms for mimo based wireless networks
Iaetsd a novel scheduling algorithms for mimo based wireless networks
Iaetsd Iaetsd
 
11.design and implementation of distributed space frequency to achieve cooper...
11.design and implementation of distributed space frequency to achieve cooper...11.design and implementation of distributed space frequency to achieve cooper...
11.design and implementation of distributed space frequency to achieve cooper...
Alexander Decker
 
Performance evaluation of rapid and spray and-wait dtn routing protocols unde...
Performance evaluation of rapid and spray and-wait dtn routing protocols unde...Performance evaluation of rapid and spray and-wait dtn routing protocols unde...
Performance evaluation of rapid and spray and-wait dtn routing protocols unde...
eSAT Journals
 
Multi-slot Coded ALOHA with Irregular Degree.pdf
Multi-slot Coded ALOHA with Irregular Degree.pdfMulti-slot Coded ALOHA with Irregular Degree.pdf
Multi-slot Coded ALOHA with Irregular Degree.pdf
YAAKOVSOLOMON1
 

Semelhante a Graphical Visualization of MAC Traces for Wireless Ad-hoc Networks Simulated in ns2 (20)

Distributed Spatial Modulation based Cooperative Diversity Scheme
Distributed Spatial Modulation based Cooperative Diversity SchemeDistributed Spatial Modulation based Cooperative Diversity Scheme
Distributed Spatial Modulation based Cooperative Diversity Scheme
 
Iaetsd a novel scheduling algorithms for mimo based wireless networks
Iaetsd a novel scheduling algorithms for mimo based wireless networksIaetsd a novel scheduling algorithms for mimo based wireless networks
Iaetsd a novel scheduling algorithms for mimo based wireless networks
 
A novel technique for speech encryption based on k-means clustering and quant...
A novel technique for speech encryption based on k-means clustering and quant...A novel technique for speech encryption based on k-means clustering and quant...
A novel technique for speech encryption based on k-means clustering and quant...
 
CHANNEL ESTIMATION AND MULTIUSER DETECTION IN ASYNCHRONOUS SATELLITE COMMUNIC...
CHANNEL ESTIMATION AND MULTIUSER DETECTION IN ASYNCHRONOUS SATELLITE COMMUNIC...CHANNEL ESTIMATION AND MULTIUSER DETECTION IN ASYNCHRONOUS SATELLITE COMMUNIC...
CHANNEL ESTIMATION AND MULTIUSER DETECTION IN ASYNCHRONOUS SATELLITE COMMUNIC...
 
11.design and implementation of distributed space frequency to achieve cooper...
11.design and implementation of distributed space frequency to achieve cooper...11.design and implementation of distributed space frequency to achieve cooper...
11.design and implementation of distributed space frequency to achieve cooper...
 
Improving QoS of VANET using Network Coding
Improving QoS of VANET using Network CodingImproving QoS of VANET using Network Coding
Improving QoS of VANET using Network Coding
 
An Analytical Analysis Of Neighbour And Isolatednodefor Geocast Routing In Va...
An Analytical Analysis Of Neighbour And Isolatednodefor Geocast Routing In Va...An Analytical Analysis Of Neighbour And Isolatednodefor Geocast Routing In Va...
An Analytical Analysis Of Neighbour And Isolatednodefor Geocast Routing In Va...
 
Enhancement of Routing Performance for Energy Efficiency and Critical Event M...
Enhancement of Routing Performance for Energy Efficiency and Critical Event M...Enhancement of Routing Performance for Energy Efficiency and Critical Event M...
Enhancement of Routing Performance for Energy Efficiency and Critical Event M...
 
M017358794
M017358794M017358794
M017358794
 
Performance evaluation of rapid and spray and-wait dtn routing protocols unde...
Performance evaluation of rapid and spray and-wait dtn routing protocols unde...Performance evaluation of rapid and spray and-wait dtn routing protocols unde...
Performance evaluation of rapid and spray and-wait dtn routing protocols unde...
 
A low complexity distributed differential scheme based on orthogonal space t...
A low complexity distributed differential scheme based on  orthogonal space t...A low complexity distributed differential scheme based on  orthogonal space t...
A low complexity distributed differential scheme based on orthogonal space t...
 
Multi-slot Coded ALOHA with Irregular Degree.pdf
Multi-slot Coded ALOHA with Irregular Degree.pdfMulti-slot Coded ALOHA with Irregular Degree.pdf
Multi-slot Coded ALOHA with Irregular Degree.pdf
 
Fault tolerant wireless sensor mac protocol for efficient collision avoidance
Fault tolerant wireless sensor mac protocol for efficient collision avoidanceFault tolerant wireless sensor mac protocol for efficient collision avoidance
Fault tolerant wireless sensor mac protocol for efficient collision avoidance
 
ASSURED NEIGHBOR BASED COUNTER PROTOCOL ON MAC-LAYER PROVIDING SECURITY IN MO...
ASSURED NEIGHBOR BASED COUNTER PROTOCOL ON MAC-LAYER PROVIDING SECURITY IN MO...ASSURED NEIGHBOR BASED COUNTER PROTOCOL ON MAC-LAYER PROVIDING SECURITY IN MO...
ASSURED NEIGHBOR BASED COUNTER PROTOCOL ON MAC-LAYER PROVIDING SECURITY IN MO...
 
Performance evaluation of rapid and spray and-wait dtn routing protocols unde...
Performance evaluation of rapid and spray and-wait dtn routing protocols unde...Performance evaluation of rapid and spray and-wait dtn routing protocols unde...
Performance evaluation of rapid and spray and-wait dtn routing protocols unde...
 
An efficient ant optimized multipath routing in wireless sensor network
An efficient ant optimized multipath routing in wireless sensor networkAn efficient ant optimized multipath routing in wireless sensor network
An efficient ant optimized multipath routing in wireless sensor network
 
Network Coding in Disruption Tolerant Network (DTN)
Network Coding in Disruption Tolerant Network (DTN)Network Coding in Disruption Tolerant Network (DTN)
Network Coding in Disruption Tolerant Network (DTN)
 
International Journal of Computational Engineering Research(IJCER)
 International Journal of Computational Engineering Research(IJCER)  International Journal of Computational Engineering Research(IJCER)
International Journal of Computational Engineering Research(IJCER)
 
Derivative threshold actuation for single phase wormhole detection with reduc...
Derivative threshold actuation for single phase wormhole detection with reduc...Derivative threshold actuation for single phase wormhole detection with reduc...
Derivative threshold actuation for single phase wormhole detection with reduc...
 
4..[26 36]signal strength based congestion control in manet
4..[26 36]signal strength based congestion control in manet4..[26 36]signal strength based congestion control in manet
4..[26 36]signal strength based congestion control in manet
 

Mais de idescitation

65 113-121
65 113-12165 113-121
65 113-121
idescitation
 
74 136-143
74 136-14374 136-143
74 136-143
idescitation
 
84 11-21
84 11-2184 11-21
84 11-21
idescitation
 
29 88-96
29 88-9629 88-96
29 88-96
idescitation
 

Mais de idescitation (20)

65 113-121
65 113-12165 113-121
65 113-121
 
69 122-128
69 122-12869 122-128
69 122-128
 
71 338-347
71 338-34771 338-347
71 338-347
 
72 129-135
72 129-13572 129-135
72 129-135
 
74 136-143
74 136-14374 136-143
74 136-143
 
80 152-157
80 152-15780 152-157
80 152-157
 
82 348-355
82 348-35582 348-355
82 348-355
 
84 11-21
84 11-2184 11-21
84 11-21
 
62 328-337
62 328-33762 328-337
62 328-337
 
46 102-112
46 102-11246 102-112
46 102-112
 
47 292-298
47 292-29847 292-298
47 292-298
 
49 299-305
49 299-30549 299-305
49 299-305
 
57 306-311
57 306-31157 306-311
57 306-311
 
60 312-318
60 312-31860 312-318
60 312-318
 
5 1-10
5 1-105 1-10
5 1-10
 
11 69-81
11 69-8111 69-81
11 69-81
 
14 284-291
14 284-29114 284-291
14 284-291
 
15 82-87
15 82-8715 82-87
15 82-87
 
29 88-96
29 88-9629 88-96
29 88-96
 
43 97-101
43 97-10143 97-101
43 97-101
 

Último

1029 - Danh muc Sach Giao Khoa 10 . pdf
1029 -  Danh muc Sach Giao Khoa 10 . pdf1029 -  Danh muc Sach Giao Khoa 10 . pdf
1029 - Danh muc Sach Giao Khoa 10 . pdf
QucHHunhnh
 
Ecosystem Interactions Class Discussion Presentation in Blue Green Lined Styl...
Ecosystem Interactions Class Discussion Presentation in Blue Green Lined Styl...Ecosystem Interactions Class Discussion Presentation in Blue Green Lined Styl...
Ecosystem Interactions Class Discussion Presentation in Blue Green Lined Styl...
fonyou31
 
Beyond the EU: DORA and NIS 2 Directive's Global Impact
Beyond the EU: DORA and NIS 2 Directive's Global ImpactBeyond the EU: DORA and NIS 2 Directive's Global Impact
Beyond the EU: DORA and NIS 2 Directive's Global Impact
PECB
 
Russian Escort Service in Delhi 11k Hotel Foreigner Russian Call Girls in Delhi
Russian Escort Service in Delhi 11k Hotel Foreigner Russian Call Girls in DelhiRussian Escort Service in Delhi 11k Hotel Foreigner Russian Call Girls in Delhi
Russian Escort Service in Delhi 11k Hotel Foreigner Russian Call Girls in Delhi
kauryashika82
 

Último (20)

Advanced Views - Calendar View in Odoo 17
Advanced Views - Calendar View in Odoo 17Advanced Views - Calendar View in Odoo 17
Advanced Views - Calendar View in Odoo 17
 
The Most Excellent Way | 1 Corinthians 13
The Most Excellent Way | 1 Corinthians 13The Most Excellent Way | 1 Corinthians 13
The Most Excellent Way | 1 Corinthians 13
 
9548086042 for call girls in Indira Nagar with room service
9548086042  for call girls in Indira Nagar  with room service9548086042  for call girls in Indira Nagar  with room service
9548086042 for call girls in Indira Nagar with room service
 
1029 - Danh muc Sach Giao Khoa 10 . pdf
1029 -  Danh muc Sach Giao Khoa 10 . pdf1029 -  Danh muc Sach Giao Khoa 10 . pdf
1029 - Danh muc Sach Giao Khoa 10 . pdf
 
Mattingly "AI & Prompt Design: The Basics of Prompt Design"
Mattingly "AI & Prompt Design: The Basics of Prompt Design"Mattingly "AI & Prompt Design: The Basics of Prompt Design"
Mattingly "AI & Prompt Design: The Basics of Prompt Design"
 
Accessible design: Minimum effort, maximum impact
Accessible design: Minimum effort, maximum impactAccessible design: Minimum effort, maximum impact
Accessible design: Minimum effort, maximum impact
 
INDIA QUIZ 2024 RLAC DELHI UNIVERSITY.pptx
INDIA QUIZ 2024 RLAC DELHI UNIVERSITY.pptxINDIA QUIZ 2024 RLAC DELHI UNIVERSITY.pptx
INDIA QUIZ 2024 RLAC DELHI UNIVERSITY.pptx
 
Ecosystem Interactions Class Discussion Presentation in Blue Green Lined Styl...
Ecosystem Interactions Class Discussion Presentation in Blue Green Lined Styl...Ecosystem Interactions Class Discussion Presentation in Blue Green Lined Styl...
Ecosystem Interactions Class Discussion Presentation in Blue Green Lined Styl...
 
Student login on Anyboli platform.helpin
Student login on Anyboli platform.helpinStudent login on Anyboli platform.helpin
Student login on Anyboli platform.helpin
 
Explore beautiful and ugly buildings. Mathematics helps us create beautiful d...
Explore beautiful and ugly buildings. Mathematics helps us create beautiful d...Explore beautiful and ugly buildings. Mathematics helps us create beautiful d...
Explore beautiful and ugly buildings. Mathematics helps us create beautiful d...
 
social pharmacy d-pharm 1st year by Pragati K. Mahajan
social pharmacy d-pharm 1st year by Pragati K. Mahajansocial pharmacy d-pharm 1st year by Pragati K. Mahajan
social pharmacy d-pharm 1st year by Pragati K. Mahajan
 
A Critique of the Proposed National Education Policy Reform
A Critique of the Proposed National Education Policy ReformA Critique of the Proposed National Education Policy Reform
A Critique of the Proposed National Education Policy Reform
 
Beyond the EU: DORA and NIS 2 Directive's Global Impact
Beyond the EU: DORA and NIS 2 Directive's Global ImpactBeyond the EU: DORA and NIS 2 Directive's Global Impact
Beyond the EU: DORA and NIS 2 Directive's Global Impact
 
Introduction to Nonprofit Accounting: The Basics
Introduction to Nonprofit Accounting: The BasicsIntroduction to Nonprofit Accounting: The Basics
Introduction to Nonprofit Accounting: The Basics
 
Sanyam Choudhary Chemistry practical.pdf
Sanyam Choudhary Chemistry practical.pdfSanyam Choudhary Chemistry practical.pdf
Sanyam Choudhary Chemistry practical.pdf
 
Nutritional Needs Presentation - HLTH 104
Nutritional Needs Presentation - HLTH 104Nutritional Needs Presentation - HLTH 104
Nutritional Needs Presentation - HLTH 104
 
Russian Escort Service in Delhi 11k Hotel Foreigner Russian Call Girls in Delhi
Russian Escort Service in Delhi 11k Hotel Foreigner Russian Call Girls in DelhiRussian Escort Service in Delhi 11k Hotel Foreigner Russian Call Girls in Delhi
Russian Escort Service in Delhi 11k Hotel Foreigner Russian Call Girls in Delhi
 
Mattingly "AI & Prompt Design: Structured Data, Assistants, & RAG"
Mattingly "AI & Prompt Design: Structured Data, Assistants, & RAG"Mattingly "AI & Prompt Design: Structured Data, Assistants, & RAG"
Mattingly "AI & Prompt Design: Structured Data, Assistants, & RAG"
 
Código Creativo y Arte de Software | Unidad 1
Código Creativo y Arte de Software | Unidad 1Código Creativo y Arte de Software | Unidad 1
Código Creativo y Arte de Software | Unidad 1
 
fourth grading exam for kindergarten in writing
fourth grading exam for kindergarten in writingfourth grading exam for kindergarten in writing
fourth grading exam for kindergarten in writing
 

Graphical Visualization of MAC Traces for Wireless Ad-hoc Networks Simulated in ns2

  • 1. Regular Paper Proc. of Int. Conf. on Advances in Recent Technologies in Communication and Computing Graphical Visualization of MAC Traces for Wireless Ad-hoc Networks Simulated in ns2 1 Manan Thakar, 2Yogendra Raulji, 3Jayrajsinh Gohil, 4Hardik Mistry, 5 Mayur M Vegad and 6Dr. Narendra M Patel Gujarat Technological University, Ahmedabad, Gujarat, India 1 manan_thakar@yahoo.co.in, 2raulji.yogendra@gmail.com, 3jaygohil1710@gmail.com, 4hardikmistry.1992@gmail.com mayurmvegad, nmpatel@bvmengineering.ac.in Abstract - Many network simulators (e.g., ns2) are already being used for performing wired and wireless network simulations. But, with the current graphical visualization support in-built in ns2, it is difficult to understand the node status, packet status and the MAC level events particularly for Ad-hoc networks. In this paper, we extend the visualization support in ns-2 that should help research community in the area of wireless networks to analyze different MAC level events in an efficient manner. In particular, we have developed two types of visualizations namely, temporal and spatial. Temporal visualization helps to analyze success or failure of a packet with respect to time while spatial visualization helps to understand the effects due to proximity of nodes. The trace is made highly configurable in terms of different attributes like specific nodes and time duration. A. Input from users Usually, there would be many nodes and many activities and events in the network at runtime. But, we will have to know the particular nodes for which the user wants to see the visualization. So, the inputs required from the user are: 1) Number of nodes for which the visualization is needed. 2) Particular node numbers for which the visualization is needed. 3) The time period for which the visualization is needed. Thus, the nodes for which the visualization is needed and for which time period is needed, is acquired by the dialogbox Index terms- Network event tracing, wireless networks, network simulator, MAC layer, graphical visualization, ns2, collision, packet, topography B. Trace File All the details about the packet and the events will be acquired from the trace file of ns2. Here, trace file is a file containing the traces of various events at different layers, generated by the simulator ns2. When the TCL script describing the network scenario is run on ns2, the trace file is created having the information about the events in network. From this trace file, we can get the following information: Event type (sent, received, dropped, forward), time instant, node number (node-id), trace name (at which layer the event occurred), reason (collision, retry-limit-reached, etc), event identification number (event-id), packet type (RTS, CTS, tcp, etc), size of the packet, duration field of MAC frame, (MAC level) destination , (MAC level) source, type (ARP – 0x0860 / IP – 0x0800). This file is read by our program and the useful attributes to build the visualization are stored in the data structure. Here, to store such attribute=s, we have used appropriate java-classes. Such classes are described in the next section. I. INTRODUCTION A network simulator is a tool for implementing the network on the computer. With the help of a simulator, the behaviour of the network is calculated either by network entities interconnection using mathematical formulas, or by capturing and playing back observations from the simulated network. Network simulators like ns2, ns3, OPNET, NetSim, OMNeT++, REAL, J-Sim and QualNet are already being used for performing wired and wireless network simulations. But it is difficult to understand the status of the nodes & packets and the MAC level events particularly for Ad-hoc networks. The resulting product of this work is useful to visualize and analyze the different MAC level events for ad hoc wireless networks when simulated in ns2. In this paper, we emphasize on the main features of events and packets and provide a comprehensible visualization for them. It is hoped that, this work will prove to be a good reference source for those people who feel difficult to analyze the MAC level events for wireless Ad-hoc networks. C. Node-position-scenario File This is (usually, a separate) text file in TCL, specifying the positions (in Cartesian coordinates) of the participating nodes. This information is used to determine the network topology and is read by the main TCL script as an input. Moreover, if the nodes are moving from one place to other place, than such movements are also specified in this file. Thus, the scenario file specifies: 1) The co-ordinates of nodes 2) Movements of nodes II. SYSTEM INPUTS For creating visualization, information about the nodes, events and packets of the network is required. For that, we take some inputs from various sources. © 2013 ACEEE DOI: 03.LSCS.2013.5. 548 53
  • 2. Regular Paper Proc. of Int. Conf. on Advances in Recent Technologies in Communication and Computing packet is also calculated using the received power. The width will be proportional to the size of the packet. Then, the packet is drawn at the particular time on the graph Then, the packet is drawn with green color if distance is within the transmission range. If distance is greater than transmission range but within the threshold range, then fill it with yellow packet. For detecting the collision, for each packet, the interference range of the receiver is found. For finding interference range, the below formula is considered Interference range =(δ1/α ) *distance, Where δ = Capture Threshold (minimum signal-to-interference ratio for successful reception) with default value of 10, α = path-loss factor (with default value of 4) distance = distance between sender and receiver. Now, for this receiver, check whether any other node within the interference range is trying to send a packet during same time or not. If such packet is found, then it will be dropped. So, draw it with RED color. Define the mouse clicking event. Here, on clicking any packet, the packet details should be displayed. For the collided packet, it is collided with which packet is also specified. It is worth noted here that, for detecting a collision, we have calculated the interference range and based on that, the collision is detected. Though, such information about a collision event is already available in the trace file in ns2, in the following we explain why it was required to calculate the interference range. III. IMPLEMENTATION We have used java programming for the implementation. Particularly, the java-graphics objects are used for graphical presentation and swing properties of java are also used along with them. Now the implementation for temporal and spatial visualization is explained. A. Implementation of Temporal Visualization After achieving the input information, that information is plotted on the graph to make visualization. This algorithm is for visualization-1. The algorithm to plot the visualization graph is as below: The axis for the graph is drawn for each node. (X-axis specifies the time and y-axis specifies the power of transmission or reception.)Set start-time specified by user as the starting time in the graph. For sending packet, the rectangle is drawn on the appropriate sender node graph. The height of this rectangle is the maximum unit strength) as the power of sending packet is the maximum and the width will be proportional to the size of the packet. Fill it with BLUE color for the send packet. For each node other than sender node for a particular event, the distance of the node from the sender node is calculated. If this distance is in the threshold range, then the power of the received packet is calculated. The height of the Fig. 1 Graphical Visualization B. Implementation of Spatial Visualization If the visualization2 (spatial visualization) is selected after taking input, the following steps are carried out: 1) The nodes are drawn at their position specified in the scenario file with their threshold range and transmission range. Here, threshold range is specified in the blue color and the transmission range is drawn in black color. In the trace file, the ending time of the collided packet is specified and not the beginning time of collision. Moreover, we cannot determine with which packet a particular packet is collided. For solving these problems, we have used the interference range and based on that, the collision event is traced and the packet causing the collision is determined easily. © 2013 ACEEE DOI: 03.LSCS.2013.5. 548 54
  • 3. Regular Paper Proc. of Int. Conf. on Advances in Recent Technologies in Communication and Computing Fig. 2 Graphical Visualization showing details of packet Fig. 3 Spatial Visualization 2)The time-bar is drawn at bottom of the nodal representation. One marker is shown moving with the time to reflect the current time. 3) With the time, interference range is drawn at the reception node of the packet. Interference range is drawn with red color. 4) With the progression in transmission time of a given packet, the packet is shown moving from source to destination © 2013 ACEEE DOI: 03.LSCS.2013.5. 548 . A successfully received packet is drawn with blue color, whereas a collided packet is drawn with red color. By implementing this algorithm, the spatial visualization is generated. IV. VISUALIZATION A. Temporal Visualization This figure shows details of 4 nodes as sender and 55
  • 4. Regular Paper Proc. of Int. Conf. on Advances in Recent Technologies in Communication and Computing receiver side on time scale. Here, the following points are to be noted: A blue colored packet is a sent packet and a green packet is a received packet. Width of packet in graph is proportional to the actual size of the packet. For example, the width of a data packet is (usually) larger than the width of RTS/CTS packet as observed in Fig. 1.  A yellow packet shows that the corresponding receiving node is in the carrier sensing range of the corresponding source node. This indicates that this particular packet is a ‘sensed only’ (i.e., non-decodable) kind of packet. In other words, such a transmission is sensed but the packet cannot be interpreted. The height of the packet in graph is proportional to the transmitted or received power of the packet. Here, it can be observed that the height of green packet (receiving) is less than that of blue (sending) packet as obvious.  A red packet shows the dropped packets. One of the reasons for dropping could be a collision with some other packet. As the wireless link is of broadcast nature, a packet is received by all the nodes within the transmission range of the sender When a particular packet, (sent or received) is clicked with a mouse, its details are displayed as shown in Fig. 2. Here, all the details of the clicked packet are shown as the message. A click on OK button gets dialog-box disappeared. In Fig. 2, the details of a collided packet are shown. Here, it can be observed that the details of both the packets which are collided are displayed. For this scenario, the data-packet sent by node 0 destined to node 1 is sensed by node 2. Now during that time, node 3 (a hidden terminal) also starts to send a packet to node 2. This results into a collision at node 2. This is clearly depicted in Fig. 2. The description of each of the range is as follows: 1. Carrier sense range: in which, the packet is sensed. 2. Transmission range: in which, the packet is successfully received (decodable). 3. Interference range: within which, if some other node transmits concurrently then collision happens. Thus, in spatial visualization, topography of each node is displayed. In the specific example depicted in Fig. 3, it can be observed that, node 0 is transmitting a packet to node 1. Now at the same time, node 3 also tries to send packet to node 2. As seen, node 2 is also in the interference range of node 1. Consequently, the packets are collided. V. CONCLUSION Current graphical visualization support in ns2 lacks the details of MAC level event traces like collisions. In this work, we have attempted to mitigate this limitation. Two types of graphical visualization are offered: temporal and spatial. The temporal view of packets incorporates the details of collision and overlapping of packets with respect to the progression of simulation time. The spatial view incorporates the physical activities happening at the nodes emphasizing the effects of proximity of the participating nodes in space. It is hoped that, this work would be extremely helpful to research community in the area of wireless networks. It can be extended also for further versions of ns2 and ns3. REFERENCES [1] Manual of ns2,available at http://www.sop.inria.fr/maestro/ personnel/Giovanni.Neglia/nscourse/ns course.htm. [2] AT&T reference manual, Wireless personal communication, 1990. [3] A. Tanenbaum, Computer Networks,4th edition, ch-4;. [4] Introduction to Glomosim, available at http:// www.slideshare.net/ayyakathir/glomosim-introduction6476014. [5] Introduction to Omnetpp, available at http://www.omnetpp.org/ pmwiki/ index.php?n=Main.OmnetppInNutshell. [6] András Varga, Rudolf Hornig, An Overview of the OMNet++ Simulation Environment, SIMUTools, March03-07,2008, Marseille, France. [7] Dennis McGrath, Doug Hill, Amy Hunt, Mark Ryan, and TimothySmith, NETSIM:A Distributed Network Simulation to Support Cyber Exercises, Award No. 2000-DT-CX-K001 from the Office for Domestic Preparedness, U.S. Department of Homeland Security [8] Introduction to netsim, available at http://www.boson.com/ files/support/NetSim8LabCompiler.pdf. [9] Marc Greis’ Tutorial for the UCB/LBNL/VINT Network Simulator “ns”, available at http://www.isi.edu//tutorial B. Spatial Visualization One another type of visualization is – spatial visualization, which shows the relative position of the nodes as per their physical coordinates. This visualization also depicts different nodal ranges around each of the selected nodes. A typical sample output for spatial visualization is shown in Fig. 3. It can be observed that, there are 4 nodes in this scenario. The nodes are drawn on their coordinate positions as per their relative positions. For this particular scenario, the nodes are on a common horizontal line. The colored circles around a particular node represent the ranges of that node. Particularly, the black circle around node shows its transmission range, the blue circle shows its threshold range, and the red circle shows its interference range (applicable to a receiver node). At the bottom of Fig. 3, time-scale is displayed. As time progresses, a vertical pointer moves towards right along with x-axis. A particular instant of time is displayed above this time scale. Numbers 0,1,2,3, etc show node positions according to their coordinates. © 2013 ACEEE DOI: 03.LSCS.2013.5. 548 56