An analysis and comparison of different routing algorithms in WiMAX networks

Sangeetha, J.; Balipadi, Pranav Gangadhar; Ismail, Khan Heena; Murthy, K. N. Balasubramanya; Rustagi, Ram P.

doi:10.1109/iadcc.2015.7154804

Cited by 5 publications

(3 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [25], the authors propose a neighbor trust that is based on a customized routing algorithm to extend the text of routing in the case of MANETs. The method modified the path request packet of the traditional AODV routing protocol by computing an additional field that stores the neighbor trust value.…”

Section: Correlated Workmentioning

confidence: 99%

Progressive AODV: A Routing Algorithm Intended for Mobile Ad-Hoc Networks

Sakthivel,

kumar,

Kumar

2019

IJEAT

View full text Add to dashboard Cite

Mobile ad hoc networks are an independent wireless network that is built without permanent infrastructure and base station support. Each node in the network uses a wireless connection for connections and acts not only as an end system but also as a path to accelerating packets. Meanwhile, the network nodes are mobile and can move in each path with changing steps, creating a great dynamic of the network. Therefore, the protocols set for general ad hoc networks are inappropriate for such a situation. In addition, the performance of ad hoc routing protocols decreases with increasing network size. In this context, suggest a new way to extend the recital of routing in MANETs: the on-demand Progressive Distance Vector (PAODV). It is a modified variant of the standard AODV routing protocol, which shrinks the dynamic path when an optimal path exists and switches the traffic to it. Simulation studies with NS2 show that the proposed method improves network performance as network size, weight, or flexibility increase.

show abstract

Section: Correlated Workmentioning

confidence: 99%

Progressive AODV: A Routing Algorithm Intended for Mobile Ad-Hoc Networks

Sakthivel,

kumar,

Kumar

2019

IJEAT

View full text Add to dashboard Cite

show abstract

“…Average jitter is the amount of variation in the arrival of packets to the destination [26,27]. The value of jitter is calculated from end-to-end delay.…”

Section: Average Jittermentioning

confidence: 99%

An Analysis of VoIP Application in Fixed and Mobile WiMAX Networks

Balipadi¹,

Sangeetha²

2016

IJWMT

Self Cite

View full text Add to dashboard Cite

WiMAX is a wireless broadband technology, which promises maximum coverage area and high data rates. WiMAX provides last mile connectivity. This network defines two working models such as fixed WiMAX and mobile WiMAX. The main aim of this paper is to compare and also analyze the performance of the VoIP application over fixed and mobile WiMAX, with respect to various codecs such as G.711, G.723.1ar5.3, G.726ar24, G.728ar16 and G.729. We have considered few QoS parameters such as average end-to-end delay, throughput, average jitter, average one-way delay and average MOS. From the obtained result, codec G.711 and G.726ar24 performs better when compared to other codecs in both fixed and mobile WiMAX network.

show abstract

“…In WiMAX networks (Bayan & Wan, 2011;Sangeetha, Nagaraj, Murthy, & Rustagi, 2016;Sangeetha, Nagaraj, Murthy, & Rustagi, 2017;Sangeetha et al, 2015), there are two types of transmissions,namely,uplinkanddownlinktransmissions.TheuplinktransmissionisfromtheMSs totheBSsorRSs.ThedownlinktransmissionisfromtheBSsorRSstotheMSs.Also,therearetwo typesoflinks,namely,relayandaccesslink,whichisshowninFigure2.Therelaylinkistheedge connectivitybetweentwoRSsorbetweentheBSandRSandtheaccesslinkistheedgeconnectivity betweentheRSandMSorbetweentheBSandMS.TheRSsandMSsareundertheguidanceof itsservingBS.TheRSs (Sydir&Taori,2009)operateusingstore-and-forwardtechniques.TheBS sendsthesignalsinanallocatedfrequencyandspecifictimetotheRSsassociatedwithit.TheRSs receivesthesignals,decodes,andprocessesthesignalandthenindifferentfrequencyallocations andtime,ittransmitsthisreceivedsignaltotheMSsorBS.TheBSsandRSscoverageareascan overlap.TherecanbeoneormoreRSsbetweentheBSandMS.However,theRS (Abichar,Kamal, &Chang,2010)needstobeoptimallyplacedbetweentheBSandtheMSssoastoreducethecost.…”

Section: Introductionmentioning

confidence: 99%

Placement of Relay Stations in WiMAX Network Using Glowworm Swarm Optimization

Sangeetha

Nagaraj

Rustagi³

et al. 2019

International Journal of Applied Metaheuristic Computing

Self Cite

View full text Add to dashboard Cite

The Relay Station (RS) deployment problem for WiMAX networks is studied. Unlike Base Station (BS), RS does not need a wire-line backhaul and has much lower hardware complexity. Hence, usage of RSs can significantly minimize the deployment cost and maximize the network coverage of the system. To solve the RS deployment problem, the authors have used a nature inspired technique known as Glowworm Swarm Optimization (GSO). Different cases have been considered for a single fixed BS, to find the feasible number of RSs and its optimal placement in WiMAX networks. Computational experiments are conducted to show the effect of RS deployments in different distribution scenarios. This article also shows the impact of placing RSs at optimal locations to serve given Mobile Stations (MSs) that are distributed arbitrarily in a given geographic region such that the cost is minimized, and the network coverage is maximized. The results obtained from the GSO algorithm are compared with k-means algorithm and it is observed that GSO performs better than k-means algorithm.

show abstract

An analysis and comparison of different routing algorithms in WiMAX networks

Cited by 5 publications

References 8 publications

Progressive AODV: A Routing Algorithm Intended for Mobile Ad-Hoc Networks

Progressive AODV: A Routing Algorithm Intended for Mobile Ad-Hoc Networks

An Analysis of VoIP Application in Fixed and Mobile WiMAX Networks

Placement of Relay Stations in WiMAX Network Using Glowworm Swarm Optimization

Contact Info

Product

Resources

About