SlideShare a Scribd company logo
1 of 5
Download to read offline
Anzar Ahmad, Prof. SC Gupta / International Journal of Engineering Research and Applications
                        (IJERA) ISSN: 2248-9622 www.ijera.com
                         Vol. 2, Issue 4, July-August 2012, pp.329-333
 A Simulation Study for Performance comparison of MAC Layer in
             flat and hierarchical network in MANET
                                 Anzar Ahmad*, Prof. SC Gupta**
                   *(Department of Electronics &Communication, Graphic University, Dehradun)
                       ** (Department of Computer science , IIT Roorkee University, India)




ABSTRACT
         Out of several issues of MANET such as             larger Internet. In general, Ad hoc wireless networks
routing,     mobility      management,      power           are     self-creating,   self-organizing,    and    self-
management, security, and quality of service (QoS)          administrating networks. Hence, they offer unique
issues, medium (or channel) access is also one of           benefits and flexibility for a variety of situations and
main issues . Many protocols are defined to                 applications. Because of these features, the Ad hoc
establish and maintain routing paths in Ad hoc              networks are used where wired network and mobile
mobile networks. Some of the MAC protocols                  access is either unproductive or not feasible.. The
defined are Carrier Sense Multiple Access                   principal use of MAC is to manage the channel access
(CSMA), Multiple Access with Collision Avoidance            among multiple nodes to achieve high channel
(MACA),Floor Acquisition Multiple Access                    utilization. In other words, the coordination of channel
(FAMA), and IEEE 802.11 MAC protocol which                  access should minimize or eliminate the incidence of
specifies a Distributed Coordination Function               collisions and maximize spatial reuse at the same time
(DCF) . In this paper by using Exata Cyber                  .The scalability issue of MANET is addressed through
Simulation tool we compare and analyzed MAC                 a hierarchical approach that divide the network into
layer performance for       flat and hierarchical           clusters. In this way the network becomes more
network . We analyzed the reduction of number               manageable.        The implementation of clustering
of packets dropped at MAC layer in flat and                 schemes allow a better performance of the protocols
hierarchical network .                                      for the Medium Access Control (MAC) layer by
                                                            improving the spatial reuse, throughput, scalability
Keywords - Cluster ,CH , MAC, Overheads,                    and power consumption.

I. INTRODUCTION                                             II. RELATED WORK
         Future information technology will be mainly                 Cluster based routing [8] is a convenient way
based on wireless technology. Infrastructure based          for routing in MANET . In MANET nodes are very
cellular and mobile networks are still limited by the       close to each other normally one hop or two hop
need of infrastructure such like base station, allocation   distance, each cluster has one or more gateway node to
of frequencies .To fulfill the demand of users various      connect to other cluster in the network. Back bone
approaches are given such as frequency reuse                base routing [9] and spine based routing [10] uses a
concepts, clustering technique, sectoring technique,        similar approach. In most clustering techniques nodes
and assignment of conflict free channels.                   are selected to play different roles according to a
This infrastructure based communication fulfills the        certain criteria. In general, three types of nodes are
desire of users, but we are still lag behind to use the     defined: Ordinary nodes are simply members of a
full advantage of wireless communication, where             cluster ,other node is are called gateways node
there is no infrastructure such as mobile ad hoc            because they are able to listen to transmissions from
network. Adhoc networks are key to the evolution of         another node which is in a different cluster[1] [22]. In
wireless networks [6]. A mobile Ad hoc network              most clustering techniques nodes are selected to play
(MANET) is an autonomous system of mobile routers           different roles according to a certain criteria. In
(and associated hosts) connected by wireless links.         general, three types of nodes are defined [23].Ordinary
The routers are free to move randomly and organize          nodes are members of a cluster which do not have
themselves arbitrarily; thus, the network’s wireless        neighbors belonging to a different cluster [1].Gateway
topology may change rapidly and unpredictably. Such         nodes are nodes in a non-cluster head state located at
a network may operate in a stand-alone fashion, or          the periphery of a cluster. These types of nodes are
may be connected to the                                     called gateways because they are able to listen to

                                                                                                     329 | P a g e
Anzar Ahmad, Prof. SC Gupta / International Journal of Engineering Research and Applications
                            (IJERA) ISSN: 2248-9622 www.ijera.com
                             Vol. 2, Issue 4, July-August 2012, pp.329-333
transmissions from .Most clustering approaches for     III. PROBLEM FORMULATION
mobile ad hoc networks select a subset of nodes in                    In our problem, we have taken two scenario
order to form a network backbone that supports              one for flat architecture of 30 nodes without any head
control functions. A set of the selected nodes are          and gateway and other we have partitioned this flat
called cluster head (CH) and each node in the network       architecture into two hierarchical network having
is associated with one. Cluster heads are connected         cluster head(CH) and gateway both scenario shown in
with one.                                                   the      figure1      and      figure2    respectively.




                              Fig1: Flat architecture without any head and gateway




                         Fig 2: Hierarchical   architecture with cluster head and gateway



                                                                                                   330 | P a g e
Anzar Ahmad, Prof. SC Gupta / International Journal of Engineering Research and Applications
                        (IJERA) ISSN: 2248-9622 www.ijera.com
                         Vol. 2, Issue 4, July-August 2012, pp.329-333
IV. SIMULATION ENVIRONMENT
         We used Exata Cyber 2.0 simulator to
simulate and compared MAC layer performance in
flat and hierarchical network           EXata is a
comprehensive suite of tools for emulating large
wired and wireless networks. It uses simulation and
emulation to predict the behavior and performance of
networks to improve their design, operation, and
management. It creates a digital network replica that
interfaces with real networks and applications.
1.1Problem Definition
We have taken 30 mobile nodes with AODV
enabled, and all nodes are randomly distributed with
the mobility of 0- 10 me / sec. Node 12 is source
node and node17 is destination node sending CBR
file. Environment size for simulation is 1500x1500
mtrs .

2.1Simulation Setup:
In Exata first we have to configure the profile for
MANET, and there were three important                   Fig3: CBR Server throughput of flat architecture
configurations for standard application.
2.3Mobility Configuration
Mobility configuration, related to description about
the mobility of mobile nodes, and for this we set the
three important parameters


                       TABLE 1

 S.          Parameter                Value
 No

 1             Speed              10 Meter / Sec

 2          Pause Time                  0 Sec

 3           Start Time              10 Sec.

               Mobility Configuration
                                                        Fig4: CBR Server throughput of hierarchical
                                                        architecture
V. VALIDATION
Analysis for Wireless LAN Throughput (Server)           Analysis for Wireless LAN number of dropped
   In the result analysis for the throughput of both    packets at MAC layer
flat and hierarchical network, we concluded that
throughput of both case is same as shown in the fig              In the result analysis for number of dropped
3 and fig 4.                                            packets at MAC layer 802.11.4 we concluded that for
                                                        the hierarchical network         number of     packets
                                                        dropped are only at three nodes while in flat
                                                        network number of packets dropped are at fourteen
                                                        nodes as shown in the fig 5 and fig 6.Hence over
                                                        performance of hierarchical network is better.




                                                                                              331 | P a g e
Anzar Ahmad, Prof. SC Gupta / International Journal of Engineering Research and Applications
                        (IJERA) ISSN: 2248-9622 www.ijera.com
                         Vol. 2, Issue 4, July-August 2012, pp.329-333
                                                                 Conference on Computer Networks and
                                                                 Security" World Academic of Science
                                                                 Engineering     and    Technology(WASET)
                                                                 Journal in Singapore December 2011 ICCNS
                                                                 2010

                                                          [2]    NFS Tethaless T3 and beyond Workshop,
                                                                 interim report November,  1998.

                                                          [3]    NFS Wireless Information Technology &
                                                                 Networks Program announcement NFS, 1999.

                                                          [4]    Report to the president, Information
                                                                 technology: Transforming our society, PITAC
                                                                 Report ,Feb 1999.

                                                          [5]    M.Q.Rafiq, M.Chauhan, S.Kumar, S.Husain
                                                                 “Mathematical simulation of Cochannel
                                                                 Interference Ratio for the Omni Directional
                                                                 Antenna in Mobile Computing” NCAICT, CSI
       Fig5: No of packets dropped in flat architecture          Allahabad chapter, India,15 -16 March,2008.

                                                          [6]    M.Q.Rafiq, S.R Chauduri, S.Kumar, S.Husain
                                                                 “Deciding the Cluster Size on Behalf of Co-
                                                                 channel Interference Ratio for the Omni
                                                                 Directional     Antenna         in   Mobile
                                                                 Computing”ISTE day conference New Delhi
                                                                 Chapter 31st May & 1st June,08.
                                                          [7]    NFS Wireless & Mobile Communications
                                                                 Workshop, Northern Virgenia,March 1997.

                                                          [8]    Dharma Prakash Agrawal and Qing- An
                                                                 Zeng,” Introduction to Wireless and Mobile
                                                                 System” University of Cincinnati.

                                                          [9]    P.Krishna, M.Chatterjee, N.H Vaidya,& D.K
                                                                 Pardhan,” A Cluster based Approach for
                                                                 routing in adhoc networks”, Proceeding of 2nd
                                                                 USENIX Symposium on Mobile and Location
                                                                 Independent Computing.P.1 1995

                                                          [10]   B.Das, E. Sivakumar,V Bhargavan,”Routing
         Fig6: No of packets dropped in hierarchical             in backbone network using a virtual
                        architecture                             backbone”, Proceeding of 6th International
IV.CONCLUSION                                                    Conference on computer communication and
        In the given approach by partitioning the                network (IC3N’97),1997
large MANET network into small clusters ,we have
                                                          [11] B.Das,V Bhargavan,”Routing in adhoc network
simulated     and compared the MAC Layer
                                                                using a spine”, IEEE           International
performance of flat and hierarchical network and
                                                                Conference on computer & communication
concluded that in hierarchical network MAC layer
                                                                network (ICC’97),1997.
performance is good because of less overheads .
                                                          [12]   David B. Johnson and David A.Maltz,
REFERENCES                                                       “Dynamic source routing in adhoc wireless
[1]-    Anzar Ahamd et al. “A Cluster Head Gateway               networks”. In MobileComputing , edited by
        Approach For Deciding The Cluster Head In                Tomasz Imielinski and Hank Korth, chapter 5,
        Mobile Adhoc Network” "International                    pages 153-181. Kluwer Academic Publishers.
                                                                                               332 | P a g e
Anzar Ahmad, Prof. SC Gupta / International Journal of Engineering Research and Applications
                        (IJERA) ISSN: 2248-9622 www.ijera.com
                         Vol. 2, Issue 4, July-August 2012, pp.329-333
[13]   David B. Johnson and David A. Maltz,                        draft,   draft-ietf-manet-aodv-01.txt,   August
       “Protocols for adap tive wireless and mobile                1998.
       computing”.         In     IEEE     Personal
       Communications , 3(1), February 1996.                [19]   Charles E. Perkins, “Ad Hoc On Demand
                                                                   Distance Vector (AODV)
[14]   Stephen Kent and Randall Atkinson, “Security         [20]   L. Wang and S. Olariu, “Cluster maintenance
       Architecture for the Internet Protocol”, Internet           in mobile ad-hoc networks,” Cluster
       draft, draft-ietf-ipsec-arch-sec-07.txt, July               Computing, vol. 8, no. 2-3, pp. 111–118, 2005.
       1998.

[15]   Mobile Ad -hoc Networks (MANET). URL:
       http://www.ietf.org/html.charters/manet-             [21]   T. C. Hou and T. J. Tsai, “An access-based
       charter.html. (1998-11-29).                                 clustering protocol for multihop wireless ad
                                                                   hoc networks,” IEEE JSAC, vol. 19, no. 7,
[16]   Vincent D. Park and M. Scott Corson,                        pp.1201–1210, 2001.
       “Temporally-Ordered Routing Algorithm
       (TORA) Version 1: Functional specification”.         [22]   I. Er and W. Seah, “Mobility-based d-hop
       Internet draft, draft-ietf-manet-tora-spec-01.txt,          clustering algorithm for mobile ad hoc
       August 1998.                                                networks,” in Wireless Communications and
                                                                   Networking Conference, 2004. WCNC. 2004
[17]   Vincent D. Park and M. Scott Corson, “A                     IEEE, vol. 4, 2004, pp. 2359–2364.
       performance comparison of the Temporally-
       Ordered Routing Algorithm and Ideal Link-            [23]   J. Wu and J. Cao, “Connected k-hop clustering
       state routing”. In  Proceedings of IEEE                     in ad hoc networks,” in ICPP ’05: Proceedings
       Symposium on Computers and Communication                    of the 2005 International Conference on
       ’98 , June 1998.                                            Parallel Processing (ICPP’05). Washington,
                                                                   DC, USA: IEEE Computer Society,2005, pp.
[18]   Charles E. Perkins, “Ad Hoc On Demand                       373–380.
       Distance Vector (AODV) Routing”. Internet




                                                                                                    333 | P a g e

More Related Content

What's hot

Survivability Issues in Optical Wavalength Division Multiplexing (WDM) Network
Survivability Issues in Optical Wavalength Division Multiplexing (WDM) NetworkSurvivability Issues in Optical Wavalength Division Multiplexing (WDM) Network
Survivability Issues in Optical Wavalength Division Multiplexing (WDM) NetworkIOSR Journals
 
Designing an opportunistic routing scheme for adaptive clustering in mobile a...
Designing an opportunistic routing scheme for adaptive clustering in mobile a...Designing an opportunistic routing scheme for adaptive clustering in mobile a...
Designing an opportunistic routing scheme for adaptive clustering in mobile a...eSAT Publishing House
 
Analysis of data transmission in wireless lan for 802.11
Analysis of data transmission in wireless lan for 802.11Analysis of data transmission in wireless lan for 802.11
Analysis of data transmission in wireless lan for 802.11eSAT Publishing House
 
Analysis of data transmission in wireless lan for 802.11 e2 et
Analysis of data transmission in wireless lan for 802.11 e2 etAnalysis of data transmission in wireless lan for 802.11 e2 et
Analysis of data transmission in wireless lan for 802.11 e2 eteSAT Journals
 
Design of an Efficient Communication Protocol for 3d Interconnection Network
Design of an Efficient Communication Protocol for 3d Interconnection NetworkDesign of an Efficient Communication Protocol for 3d Interconnection Network
Design of an Efficient Communication Protocol for 3d Interconnection NetworkIJMTST Journal
 
Multipath Routing Protocol by Breadth First Search Algorithm in Wireless Mesh...
Multipath Routing Protocol by Breadth First Search Algorithm in Wireless Mesh...Multipath Routing Protocol by Breadth First Search Algorithm in Wireless Mesh...
Multipath Routing Protocol by Breadth First Search Algorithm in Wireless Mesh...IOSR Journals
 
Performance study of adhoc routing protocols for cbr traffic
Performance study of adhoc routing protocols for cbr trafficPerformance study of adhoc routing protocols for cbr traffic
Performance study of adhoc routing protocols for cbr trafficeSAT Journals
 
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...csandit
 
A bi scheduler algorithm for frame aggregation in ieee 802.11 n
A bi scheduler algorithm for frame aggregation in ieee 802.11 nA bi scheduler algorithm for frame aggregation in ieee 802.11 n
A bi scheduler algorithm for frame aggregation in ieee 802.11 nijwmn
 
Performance evaluation of qos in
Performance evaluation of qos inPerformance evaluation of qos in
Performance evaluation of qos incaijjournal
 
Chapter 4
Chapter 4Chapter 4
Chapter 4asguna
 
1 introduction-to-computer-networking
1 introduction-to-computer-networking1 introduction-to-computer-networking
1 introduction-to-computer-networkingKhan Rahimeen
 
Mobile ad hoc networks – dangling issues of optimal path strategy
Mobile ad hoc networks – dangling issues of optimal path strategyMobile ad hoc networks – dangling issues of optimal path strategy
Mobile ad hoc networks – dangling issues of optimal path strategyAlexander Decker
 
Simulator for Energy Efficient Clustering in Mobile Ad Hoc Networks
Simulator for Energy Efficient Clustering in Mobile Ad Hoc NetworksSimulator for Energy Efficient Clustering in Mobile Ad Hoc Networks
Simulator for Energy Efficient Clustering in Mobile Ad Hoc Networkscscpconf
 

What's hot (20)

61 66
61 6661 66
61 66
 
Survivability Issues in Optical Wavalength Division Multiplexing (WDM) Network
Survivability Issues in Optical Wavalength Division Multiplexing (WDM) NetworkSurvivability Issues in Optical Wavalength Division Multiplexing (WDM) Network
Survivability Issues in Optical Wavalength Division Multiplexing (WDM) Network
 
Designing an opportunistic routing scheme for adaptive clustering in mobile a...
Designing an opportunistic routing scheme for adaptive clustering in mobile a...Designing an opportunistic routing scheme for adaptive clustering in mobile a...
Designing an opportunistic routing scheme for adaptive clustering in mobile a...
 
Analysis of data transmission in wireless lan for 802.11
Analysis of data transmission in wireless lan for 802.11Analysis of data transmission in wireless lan for 802.11
Analysis of data transmission in wireless lan for 802.11
 
Analysis of data transmission in wireless lan for 802.11 e2 et
Analysis of data transmission in wireless lan for 802.11 e2 etAnalysis of data transmission in wireless lan for 802.11 e2 et
Analysis of data transmission in wireless lan for 802.11 e2 et
 
Design of an Efficient Communication Protocol for 3d Interconnection Network
Design of an Efficient Communication Protocol for 3d Interconnection NetworkDesign of an Efficient Communication Protocol for 3d Interconnection Network
Design of an Efficient Communication Protocol for 3d Interconnection Network
 
Multipath Routing Protocol by Breadth First Search Algorithm in Wireless Mesh...
Multipath Routing Protocol by Breadth First Search Algorithm in Wireless Mesh...Multipath Routing Protocol by Breadth First Search Algorithm in Wireless Mesh...
Multipath Routing Protocol by Breadth First Search Algorithm in Wireless Mesh...
 
F0963440
F0963440F0963440
F0963440
 
Performance study of adhoc routing protocols for cbr traffic
Performance study of adhoc routing protocols for cbr trafficPerformance study of adhoc routing protocols for cbr traffic
Performance study of adhoc routing protocols for cbr traffic
 
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...
 
Ccna day1
Ccna day1Ccna day1
Ccna day1
 
Ccna day1
Ccna day1Ccna day1
Ccna day1
 
A bi scheduler algorithm for frame aggregation in ieee 802.11 n
A bi scheduler algorithm for frame aggregation in ieee 802.11 nA bi scheduler algorithm for frame aggregation in ieee 802.11 n
A bi scheduler algorithm for frame aggregation in ieee 802.11 n
 
Performance evaluation of qos in
Performance evaluation of qos inPerformance evaluation of qos in
Performance evaluation of qos in
 
Chapter 4
Chapter 4Chapter 4
Chapter 4
 
1 introduction-to-computer-networking
1 introduction-to-computer-networking1 introduction-to-computer-networking
1 introduction-to-computer-networking
 
Mobile ad hoc networks – dangling issues of optimal path strategy
Mobile ad hoc networks – dangling issues of optimal path strategyMobile ad hoc networks – dangling issues of optimal path strategy
Mobile ad hoc networks – dangling issues of optimal path strategy
 
Ccna day1
Ccna day1Ccna day1
Ccna day1
 
Ccna day1
Ccna day1Ccna day1
Ccna day1
 
Simulator for Energy Efficient Clustering in Mobile Ad Hoc Networks
Simulator for Energy Efficient Clustering in Mobile Ad Hoc NetworksSimulator for Energy Efficient Clustering in Mobile Ad Hoc Networks
Simulator for Energy Efficient Clustering in Mobile Ad Hoc Networks
 

Viewers also liked

Socialismo sumak%20 kawsay
Socialismo sumak%20 kawsaySocialismo sumak%20 kawsay
Socialismo sumak%20 kawsayRobert Gallegos
 
Chiruca workbook lato 2013
Chiruca workbook lato 2013Chiruca workbook lato 2013
Chiruca workbook lato 2013KonimpexPlus
 
Ley orgánica de los consejos nacionales para la igualdad
Ley orgánica de los consejos nacionales para la igualdadLey orgánica de los consejos nacionales para la igualdad
Ley orgánica de los consejos nacionales para la igualdadRobert Gallegos
 
Catálogo Naturaleza - www.woopadiseno.com
Catálogo Naturaleza - www.woopadiseno.comCatálogo Naturaleza - www.woopadiseno.com
Catálogo Naturaleza - www.woopadiseno.comwoopadiseno
 
Presentacion economia
Presentacion economiaPresentacion economia
Presentacion economiaMARIA
 
データベース活用による 知のめぐりのよい細胞生物学
データベース活用による 知のめぐりのよい細胞生物学データベース活用による 知のめぐりのよい細胞生物学
データベース活用による 知のめぐりのよい細胞生物学Hidemasa Bono
 
RRMP RDC - Cartes des évaluations de vulnérabilité jan-avril 13
RRMP RDC - Cartes des évaluations de vulnérabilité jan-avril 13RRMP RDC - Cartes des évaluations de vulnérabilité jan-avril 13
RRMP RDC - Cartes des évaluations de vulnérabilité jan-avril 13UNICEF
 
Autorização da Anatel Prestar Serviços - 5° Operadora do Brasil
Autorização da Anatel Prestar Serviços - 5° Operadora do BrasilAutorização da Anatel Prestar Serviços - 5° Operadora do Brasil
Autorização da Anatel Prestar Serviços - 5° Operadora do Brasiltelefoniaoficial
 

Viewers also liked (20)

Az24339344
Az24339344Az24339344
Az24339344
 
Bl24409420
Bl24409420Bl24409420
Bl24409420
 
Ad24210214
Ad24210214Ad24210214
Ad24210214
 
Ab24190203
Ab24190203Ab24190203
Ab24190203
 
Bg24375379
Bg24375379Bg24375379
Bg24375379
 
Ao24271274
Ao24271274Ao24271274
Ao24271274
 
Cd24534538
Cd24534538Cd24534538
Cd24534538
 
Bv24486493
Bv24486493Bv24486493
Bv24486493
 
Bp24447451
Bp24447451Bp24447451
Bp24447451
 
Socialismo sumak%20 kawsay
Socialismo sumak%20 kawsaySocialismo sumak%20 kawsay
Socialismo sumak%20 kawsay
 
Chiruca workbook lato 2013
Chiruca workbook lato 2013Chiruca workbook lato 2013
Chiruca workbook lato 2013
 
O sangue
O sangueO sangue
O sangue
 
Ley orgánica de los consejos nacionales para la igualdad
Ley orgánica de los consejos nacionales para la igualdadLey orgánica de los consejos nacionales para la igualdad
Ley orgánica de los consejos nacionales para la igualdad
 
Catálogo Naturaleza - www.woopadiseno.com
Catálogo Naturaleza - www.woopadiseno.comCatálogo Naturaleza - www.woopadiseno.com
Catálogo Naturaleza - www.woopadiseno.com
 
Presentacion economia
Presentacion economiaPresentacion economia
Presentacion economia
 
Uganda
UgandaUganda
Uganda
 
データベース活用による 知のめぐりのよい細胞生物学
データベース活用による 知のめぐりのよい細胞生物学データベース活用による 知のめぐりのよい細胞生物学
データベース活用による 知のめぐりのよい細胞生物学
 
RRMP RDC - Cartes des évaluations de vulnérabilité jan-avril 13
RRMP RDC - Cartes des évaluations de vulnérabilité jan-avril 13RRMP RDC - Cartes des évaluations de vulnérabilité jan-avril 13
RRMP RDC - Cartes des évaluations de vulnérabilité jan-avril 13
 
Help treinamento
Help treinamentoHelp treinamento
Help treinamento
 
Autorização da Anatel Prestar Serviços - 5° Operadora do Brasil
Autorização da Anatel Prestar Serviços - 5° Operadora do BrasilAutorização da Anatel Prestar Serviços - 5° Operadora do Brasil
Autorização da Anatel Prestar Serviços - 5° Operadora do Brasil
 

Similar to Ax24329333

International Journal of Engineering Research and Development
International Journal of Engineering Research and DevelopmentInternational Journal of Engineering Research and Development
International Journal of Engineering Research and DevelopmentIJERD Editor
 
5113jgraph01
5113jgraph015113jgraph01
5113jgraph01graphhoc
 
DYNAMIC HYBRID CHANNEL (WMN) FOR BANDWIDTH GUARANTEES IN AD_HOC NETWORKS
DYNAMIC HYBRID CHANNEL (WMN) FOR BANDWIDTH GUARANTEES IN AD_HOC NETWORKSDYNAMIC HYBRID CHANNEL (WMN) FOR BANDWIDTH GUARANTEES IN AD_HOC NETWORKS
DYNAMIC HYBRID CHANNEL (WMN) FOR BANDWIDTH GUARANTEES IN AD_HOC NETWORKSpharmaindexing
 
Active Path Updation For Layered Routing (Apular) In Wireless Mesh Networks
Active Path Updation For Layered Routing (Apular) In Wireless Mesh NetworksActive Path Updation For Layered Routing (Apular) In Wireless Mesh Networks
Active Path Updation For Layered Routing (Apular) In Wireless Mesh Networkschetan1nonly
 
Active path updation for layered routing (apular) in wireless
Active path updation for layered routing (apular) in wirelessActive path updation for layered routing (apular) in wireless
Active path updation for layered routing (apular) in wirelessAlexander Decker
 
Network on Chip Architecture and Routing Techniques: A survey
Network on Chip Architecture and Routing Techniques: A surveyNetwork on Chip Architecture and Routing Techniques: A survey
Network on Chip Architecture and Routing Techniques: A surveyIJRES Journal
 
A Professional QoS Provisioning in the Intra Cluster Packet Level Resource Al...
A Professional QoS Provisioning in the Intra Cluster Packet Level Resource Al...A Professional QoS Provisioning in the Intra Cluster Packet Level Resource Al...
A Professional QoS Provisioning in the Intra Cluster Packet Level Resource Al...GiselleginaGloria
 
Cross-layer Design of an Asymmetric Loadpower Control Protocol in Ad hoc Netw...
Cross-layer Design of an Asymmetric Loadpower Control Protocol in Ad hoc Netw...Cross-layer Design of an Asymmetric Loadpower Control Protocol in Ad hoc Netw...
Cross-layer Design of an Asymmetric Loadpower Control Protocol in Ad hoc Netw...IDES Editor
 
What Is Routing Overhead Of The Network
What Is Routing Overhead Of The NetworkWhat Is Routing Overhead Of The Network
What Is Routing Overhead Of The NetworkPatricia Viljoen
 
OPTIMIZED ROUTING AND DENIAL OF SERVICE FOR ROBUST TRANSMISSION IN WIRELESS N...
OPTIMIZED ROUTING AND DENIAL OF SERVICE FOR ROBUST TRANSMISSION IN WIRELESS N...OPTIMIZED ROUTING AND DENIAL OF SERVICE FOR ROBUST TRANSMISSION IN WIRELESS N...
OPTIMIZED ROUTING AND DENIAL OF SERVICE FOR ROBUST TRANSMISSION IN WIRELESS N...IRJET Journal
 
PERFORMANCE ANALYSIS OF ENERGY EFFICIENT SCALABLE HEIRARCHIAL PROTOCOL FOR HO...
PERFORMANCE ANALYSIS OF ENERGY EFFICIENT SCALABLE HEIRARCHIAL PROTOCOL FOR HO...PERFORMANCE ANALYSIS OF ENERGY EFFICIENT SCALABLE HEIRARCHIAL PROTOCOL FOR HO...
PERFORMANCE ANALYSIS OF ENERGY EFFICIENT SCALABLE HEIRARCHIAL PROTOCOL FOR HO...IAEME Publication
 
Ccna PPT
Ccna PPTCcna PPT
Ccna PPTAIRTEL
 

Similar to Ax24329333 (20)

International Journal of Engineering Research and Development
International Journal of Engineering Research and DevelopmentInternational Journal of Engineering Research and Development
International Journal of Engineering Research and Development
 
5113jgraph01
5113jgraph015113jgraph01
5113jgraph01
 
DYNAMIC HYBRID CHANNEL (WMN) FOR BANDWIDTH GUARANTEES IN AD_HOC NETWORKS
DYNAMIC HYBRID CHANNEL (WMN) FOR BANDWIDTH GUARANTEES IN AD_HOC NETWORKSDYNAMIC HYBRID CHANNEL (WMN) FOR BANDWIDTH GUARANTEES IN AD_HOC NETWORKS
DYNAMIC HYBRID CHANNEL (WMN) FOR BANDWIDTH GUARANTEES IN AD_HOC NETWORKS
 
Gi3112131218
Gi3112131218Gi3112131218
Gi3112131218
 
F04503057062
F04503057062F04503057062
F04503057062
 
www.ijerd.com
www.ijerd.comwww.ijerd.com
www.ijerd.com
 
Design of fault tolerant algorithm for network on chip router using field pr...
Design of fault tolerant algorithm for network on chip router  using field pr...Design of fault tolerant algorithm for network on chip router  using field pr...
Design of fault tolerant algorithm for network on chip router using field pr...
 
Active Path Updation For Layered Routing (Apular) In Wireless Mesh Networks
Active Path Updation For Layered Routing (Apular) In Wireless Mesh NetworksActive Path Updation For Layered Routing (Apular) In Wireless Mesh Networks
Active Path Updation For Layered Routing (Apular) In Wireless Mesh Networks
 
Active path updation for layered routing (apular) in wireless
Active path updation for layered routing (apular) in wirelessActive path updation for layered routing (apular) in wireless
Active path updation for layered routing (apular) in wireless
 
Network on Chip Architecture and Routing Techniques: A survey
Network on Chip Architecture and Routing Techniques: A surveyNetwork on Chip Architecture and Routing Techniques: A survey
Network on Chip Architecture and Routing Techniques: A survey
 
A Professional QoS Provisioning in the Intra Cluster Packet Level Resource Al...
A Professional QoS Provisioning in the Intra Cluster Packet Level Resource Al...A Professional QoS Provisioning in the Intra Cluster Packet Level Resource Al...
A Professional QoS Provisioning in the Intra Cluster Packet Level Resource Al...
 
Ijcnc050209
Ijcnc050209Ijcnc050209
Ijcnc050209
 
Cross-layer Design of an Asymmetric Loadpower Control Protocol in Ad hoc Netw...
Cross-layer Design of an Asymmetric Loadpower Control Protocol in Ad hoc Netw...Cross-layer Design of an Asymmetric Loadpower Control Protocol in Ad hoc Netw...
Cross-layer Design of an Asymmetric Loadpower Control Protocol in Ad hoc Netw...
 
Hb3512341239
Hb3512341239Hb3512341239
Hb3512341239
 
International Journal of Engineering Inventions (IJEI)
International Journal of Engineering Inventions (IJEI)International Journal of Engineering Inventions (IJEI)
International Journal of Engineering Inventions (IJEI)
 
What Is Routing Overhead Of The Network
What Is Routing Overhead Of The NetworkWhat Is Routing Overhead Of The Network
What Is Routing Overhead Of The Network
 
OPTIMIZED ROUTING AND DENIAL OF SERVICE FOR ROBUST TRANSMISSION IN WIRELESS N...
OPTIMIZED ROUTING AND DENIAL OF SERVICE FOR ROBUST TRANSMISSION IN WIRELESS N...OPTIMIZED ROUTING AND DENIAL OF SERVICE FOR ROBUST TRANSMISSION IN WIRELESS N...
OPTIMIZED ROUTING AND DENIAL OF SERVICE FOR ROBUST TRANSMISSION IN WIRELESS N...
 
Aj32242252
Aj32242252Aj32242252
Aj32242252
 
PERFORMANCE ANALYSIS OF ENERGY EFFICIENT SCALABLE HEIRARCHIAL PROTOCOL FOR HO...
PERFORMANCE ANALYSIS OF ENERGY EFFICIENT SCALABLE HEIRARCHIAL PROTOCOL FOR HO...PERFORMANCE ANALYSIS OF ENERGY EFFICIENT SCALABLE HEIRARCHIAL PROTOCOL FOR HO...
PERFORMANCE ANALYSIS OF ENERGY EFFICIENT SCALABLE HEIRARCHIAL PROTOCOL FOR HO...
 
Ccna PPT
Ccna PPTCcna PPT
Ccna PPT
 

Ax24329333

  • 1. Anzar Ahmad, Prof. SC Gupta / International Journal of Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com Vol. 2, Issue 4, July-August 2012, pp.329-333 A Simulation Study for Performance comparison of MAC Layer in flat and hierarchical network in MANET Anzar Ahmad*, Prof. SC Gupta** *(Department of Electronics &Communication, Graphic University, Dehradun) ** (Department of Computer science , IIT Roorkee University, India) ABSTRACT Out of several issues of MANET such as larger Internet. In general, Ad hoc wireless networks routing, mobility management, power are self-creating, self-organizing, and self- management, security, and quality of service (QoS) administrating networks. Hence, they offer unique issues, medium (or channel) access is also one of benefits and flexibility for a variety of situations and main issues . Many protocols are defined to applications. Because of these features, the Ad hoc establish and maintain routing paths in Ad hoc networks are used where wired network and mobile mobile networks. Some of the MAC protocols access is either unproductive or not feasible.. The defined are Carrier Sense Multiple Access principal use of MAC is to manage the channel access (CSMA), Multiple Access with Collision Avoidance among multiple nodes to achieve high channel (MACA),Floor Acquisition Multiple Access utilization. In other words, the coordination of channel (FAMA), and IEEE 802.11 MAC protocol which access should minimize or eliminate the incidence of specifies a Distributed Coordination Function collisions and maximize spatial reuse at the same time (DCF) . In this paper by using Exata Cyber .The scalability issue of MANET is addressed through Simulation tool we compare and analyzed MAC a hierarchical approach that divide the network into layer performance for flat and hierarchical clusters. In this way the network becomes more network . We analyzed the reduction of number manageable. The implementation of clustering of packets dropped at MAC layer in flat and schemes allow a better performance of the protocols hierarchical network . for the Medium Access Control (MAC) layer by improving the spatial reuse, throughput, scalability Keywords - Cluster ,CH , MAC, Overheads, and power consumption. I. INTRODUCTION II. RELATED WORK Future information technology will be mainly Cluster based routing [8] is a convenient way based on wireless technology. Infrastructure based for routing in MANET . In MANET nodes are very cellular and mobile networks are still limited by the close to each other normally one hop or two hop need of infrastructure such like base station, allocation distance, each cluster has one or more gateway node to of frequencies .To fulfill the demand of users various connect to other cluster in the network. Back bone approaches are given such as frequency reuse base routing [9] and spine based routing [10] uses a concepts, clustering technique, sectoring technique, similar approach. In most clustering techniques nodes and assignment of conflict free channels. are selected to play different roles according to a This infrastructure based communication fulfills the certain criteria. In general, three types of nodes are desire of users, but we are still lag behind to use the defined: Ordinary nodes are simply members of a full advantage of wireless communication, where cluster ,other node is are called gateways node there is no infrastructure such as mobile ad hoc because they are able to listen to transmissions from network. Adhoc networks are key to the evolution of another node which is in a different cluster[1] [22]. In wireless networks [6]. A mobile Ad hoc network most clustering techniques nodes are selected to play (MANET) is an autonomous system of mobile routers different roles according to a certain criteria. In (and associated hosts) connected by wireless links. general, three types of nodes are defined [23].Ordinary The routers are free to move randomly and organize nodes are members of a cluster which do not have themselves arbitrarily; thus, the network’s wireless neighbors belonging to a different cluster [1].Gateway topology may change rapidly and unpredictably. Such nodes are nodes in a non-cluster head state located at a network may operate in a stand-alone fashion, or the periphery of a cluster. These types of nodes are may be connected to the called gateways because they are able to listen to 329 | P a g e
  • 2. Anzar Ahmad, Prof. SC Gupta / International Journal of Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com Vol. 2, Issue 4, July-August 2012, pp.329-333 transmissions from .Most clustering approaches for III. PROBLEM FORMULATION mobile ad hoc networks select a subset of nodes in In our problem, we have taken two scenario order to form a network backbone that supports one for flat architecture of 30 nodes without any head control functions. A set of the selected nodes are and gateway and other we have partitioned this flat called cluster head (CH) and each node in the network architecture into two hierarchical network having is associated with one. Cluster heads are connected cluster head(CH) and gateway both scenario shown in with one. the figure1 and figure2 respectively. Fig1: Flat architecture without any head and gateway Fig 2: Hierarchical architecture with cluster head and gateway 330 | P a g e
  • 3. Anzar Ahmad, Prof. SC Gupta / International Journal of Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com Vol. 2, Issue 4, July-August 2012, pp.329-333 IV. SIMULATION ENVIRONMENT We used Exata Cyber 2.0 simulator to simulate and compared MAC layer performance in flat and hierarchical network EXata is a comprehensive suite of tools for emulating large wired and wireless networks. It uses simulation and emulation to predict the behavior and performance of networks to improve their design, operation, and management. It creates a digital network replica that interfaces with real networks and applications. 1.1Problem Definition We have taken 30 mobile nodes with AODV enabled, and all nodes are randomly distributed with the mobility of 0- 10 me / sec. Node 12 is source node and node17 is destination node sending CBR file. Environment size for simulation is 1500x1500 mtrs . 2.1Simulation Setup: In Exata first we have to configure the profile for MANET, and there were three important Fig3: CBR Server throughput of flat architecture configurations for standard application. 2.3Mobility Configuration Mobility configuration, related to description about the mobility of mobile nodes, and for this we set the three important parameters TABLE 1 S. Parameter Value No 1 Speed 10 Meter / Sec 2 Pause Time 0 Sec 3 Start Time 10 Sec. Mobility Configuration Fig4: CBR Server throughput of hierarchical architecture V. VALIDATION Analysis for Wireless LAN Throughput (Server) Analysis for Wireless LAN number of dropped In the result analysis for the throughput of both packets at MAC layer flat and hierarchical network, we concluded that throughput of both case is same as shown in the fig In the result analysis for number of dropped 3 and fig 4. packets at MAC layer 802.11.4 we concluded that for the hierarchical network number of packets dropped are only at three nodes while in flat network number of packets dropped are at fourteen nodes as shown in the fig 5 and fig 6.Hence over performance of hierarchical network is better. 331 | P a g e
  • 4. Anzar Ahmad, Prof. SC Gupta / International Journal of Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com Vol. 2, Issue 4, July-August 2012, pp.329-333 Conference on Computer Networks and Security" World Academic of Science Engineering and Technology(WASET) Journal in Singapore December 2011 ICCNS 2010 [2] NFS Tethaless T3 and beyond Workshop, interim report November, 1998. [3] NFS Wireless Information Technology & Networks Program announcement NFS, 1999. [4] Report to the president, Information technology: Transforming our society, PITAC Report ,Feb 1999. [5] M.Q.Rafiq, M.Chauhan, S.Kumar, S.Husain “Mathematical simulation of Cochannel Interference Ratio for the Omni Directional Antenna in Mobile Computing” NCAICT, CSI Fig5: No of packets dropped in flat architecture Allahabad chapter, India,15 -16 March,2008. [6] M.Q.Rafiq, S.R Chauduri, S.Kumar, S.Husain “Deciding the Cluster Size on Behalf of Co- channel Interference Ratio for the Omni Directional Antenna in Mobile Computing”ISTE day conference New Delhi Chapter 31st May & 1st June,08. [7] NFS Wireless & Mobile Communications Workshop, Northern Virgenia,March 1997. [8] Dharma Prakash Agrawal and Qing- An Zeng,” Introduction to Wireless and Mobile System” University of Cincinnati. [9] P.Krishna, M.Chatterjee, N.H Vaidya,& D.K Pardhan,” A Cluster based Approach for routing in adhoc networks”, Proceeding of 2nd USENIX Symposium on Mobile and Location Independent Computing.P.1 1995 [10] B.Das, E. Sivakumar,V Bhargavan,”Routing Fig6: No of packets dropped in hierarchical in backbone network using a virtual architecture backbone”, Proceeding of 6th International IV.CONCLUSION Conference on computer communication and In the given approach by partitioning the network (IC3N’97),1997 large MANET network into small clusters ,we have [11] B.Das,V Bhargavan,”Routing in adhoc network simulated and compared the MAC Layer using a spine”, IEEE International performance of flat and hierarchical network and Conference on computer & communication concluded that in hierarchical network MAC layer network (ICC’97),1997. performance is good because of less overheads . [12] David B. Johnson and David A.Maltz, REFERENCES “Dynamic source routing in adhoc wireless [1]- Anzar Ahamd et al. “A Cluster Head Gateway networks”. In MobileComputing , edited by Approach For Deciding The Cluster Head In Tomasz Imielinski and Hank Korth, chapter 5, Mobile Adhoc Network” "International pages 153-181. Kluwer Academic Publishers. 332 | P a g e
  • 5. Anzar Ahmad, Prof. SC Gupta / International Journal of Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com Vol. 2, Issue 4, July-August 2012, pp.329-333 [13] David B. Johnson and David A. Maltz, draft, draft-ietf-manet-aodv-01.txt, August “Protocols for adap tive wireless and mobile 1998. computing”. In IEEE Personal Communications , 3(1), February 1996. [19] Charles E. Perkins, “Ad Hoc On Demand Distance Vector (AODV) [14] Stephen Kent and Randall Atkinson, “Security [20] L. Wang and S. Olariu, “Cluster maintenance Architecture for the Internet Protocol”, Internet in mobile ad-hoc networks,” Cluster draft, draft-ietf-ipsec-arch-sec-07.txt, July Computing, vol. 8, no. 2-3, pp. 111–118, 2005. 1998. [15] Mobile Ad -hoc Networks (MANET). URL: http://www.ietf.org/html.charters/manet- [21] T. C. Hou and T. J. Tsai, “An access-based charter.html. (1998-11-29). clustering protocol for multihop wireless ad hoc networks,” IEEE JSAC, vol. 19, no. 7, [16] Vincent D. Park and M. Scott Corson, pp.1201–1210, 2001. “Temporally-Ordered Routing Algorithm (TORA) Version 1: Functional specification”. [22] I. Er and W. Seah, “Mobility-based d-hop Internet draft, draft-ietf-manet-tora-spec-01.txt, clustering algorithm for mobile ad hoc August 1998. networks,” in Wireless Communications and Networking Conference, 2004. WCNC. 2004 [17] Vincent D. Park and M. Scott Corson, “A IEEE, vol. 4, 2004, pp. 2359–2364. performance comparison of the Temporally- Ordered Routing Algorithm and Ideal Link- [23] J. Wu and J. Cao, “Connected k-hop clustering state routing”. In Proceedings of IEEE in ad hoc networks,” in ICPP ’05: Proceedings Symposium on Computers and Communication of the 2005 International Conference on ’98 , June 1998. Parallel Processing (ICPP’05). Washington, DC, USA: IEEE Computer Society,2005, pp. [18] Charles E. Perkins, “Ad Hoc On Demand 373–380. Distance Vector (AODV) Routing”. Internet 333 | P a g e