Optimal placement and channel assignment of relay stations in heterogeneous wireless mesh networks b.docx
- 文档编号:29831054
- 上传时间:2023-07-27
- 格式:DOCX
- 页数:32
- 大小:35.42KB
Optimal placement and channel assignment of relay stations in heterogeneous wireless mesh networks b.docx
《Optimal placement and channel assignment of relay stations in heterogeneous wireless mesh networks b.docx》由会员分享,可在线阅读,更多相关《Optimal placement and channel assignment of relay stations in heterogeneous wireless mesh networks b.docx(32页珍藏版)》请在冰豆网上搜索。
Optimalplacementandchannelassignmentofrelaystationsinheterogeneouswirelessmeshnetworksb
Acost-effectiveWDM-PONarchitecturesimultaneouslysupportingwired,wirelessandopticalVPNservices OriginalResearchArticle
OpticsCommunications
Itisbelievedthatnext-generationpassiveopticalnetworks(PONs)arerequiredtoprovideflexibleandvariousservicestousersinacost-effectiveway.Toaddressthisissue,forthefirsttime,thispaperproposesanddemonstratesanovelwavelength-division-multiplexedPON(WDM-PON)architecturetosimultaneouslysupportthreetypesofservices:
1)wirelessaccesstraffic,2)opticalvirtualpassivenetwork(VPN)communications,and3)conventionalwiredservices.Intheopticallineterminal(OLT),weusetwocascadedMach–Zehndermodulators(MZMs)oneachwavelengthchanneltogenerateanopticalcarrier,andproducethewirelessandthedownstreamtrafficusingtheorthogonalmodulationtechnique.Ineachopticalnetworkunit(ONU),theobtainedopticalcarrierismodulatedbyasingleMZMtoprovidetheVPNandupstreamcommunications.Consequently,thelightsourcesintheONUsaresavedandthesystemcostisreduced.Thefeasibilityofourproposalisexperimentallyandnumericallyverified.
ArticleOutline
1.Introduction
2.Principleandarchitecture
3.Experimentandsimulation
3.1.Resultsofdownstreamtransmission
3.2.ResultsforupstreamandVPNtransmissions
4.Conclusion
Acknowledgements
References
Researchhighlights
AWDM-PONarchitecturesupportswired,wirelessandopticalVPNservices.
Thesystemiscost-effective.
Theorthogonalmodulationtechniqueisused.
AsingleMZMisusedtoprovidetheVPNandupstreamcommunications.
Source-freeONUisrealized.
Multipathroutingwithspatialseparationinwirelessmulti-hopnetworkswithoutlocationinformation OriginalResearchArticle
ComputerNetworks
Wedevelopanon-demandmultipathroutingprotocolformulti-hopwirelessnetworks(MWNs),capableoffindingspatiallydisjointpaths(pathsphysicallydistantfromeachother)withouttheneedoflocationinformation.MultipathroutingcanenablevariousapplicationsandenhancementsinMWNs,suchasloadbalancing,bandwidthaggregation,reliabilityandsecurecommunications.Theuseofspatiallydisjointroutesisimportanttoeffectivelyachievethesegains,duetothenon-interferingnatureanddistanceofthepaths.MostoftheproposedmultipathprotocolsforMWNsfocusonreliabilityanddonotfindspatiallyseparatepaths.Weproposeanewon-demandprotocolcalledSpatiallyDisjointMultipathRouting(SDMR),capableoffindingmultiplepathsinoneroutediscovery,measuringthedistancebetweenthemandchoosingpathswithmostseparation.Anewdistancemetricispresentedtomeasurepathseparation,whichprovestobecongruentwithEuclideandistanceacrossnodesinthepaths.Wedevelopaheuristicalgorithmwhich,givenatopologygraphandutilizingtheproposeddistancemetric,candiscoverspatiallydisjointpathsbetweenanytwonodesinthegraph.Toevaluatetheprotocol,wehavestudiedtheoverheadbothanalyticallyincomparisonwithOLSR,andbysimulation.Thesimulationsalsodemonstratetheeffectivenessoftheprotocolinfindingspatiallyseparateroutes.
ArticleOutline
1.Introductionandmotivation
2.Relatedwork
3.SpatiallyDisjointMultipathRoutingprotocol
3.1.SDMRoverview
3.2.Definitions
3.3.Neighbordetection
3.4.Routingpacketsatthesource
3.5.Topologydiscovery
3.5.1.TopologyRequestpropagation
3.5.2.TopologyReplypropagation
3.5.3.Topologydiscoveryresolution
3.6.Pathcalculation
3.7.Routemaintenance
4.PathCalculation
4.1.Definitionsandassumptions
4.2.Pathdistancemetric
4.3.PathCalculationAlgorithm
4.3.1.Algorithmoverview
4.3.2.Algorithm
4.4.TimecomplexityofPathCalculationAlgorithm
5.Protocoloverheadstudy
5.1.Bestcasescenario
5.1.1.OLSR
5.1.2.SDMR
5.1.3.ComparisonofSDMRandOLSR
5.2.Worstcasescenario
5.2.1.OLSR
5.2.2.SDMR
5.2.3.ComparisonofSDMRandOLSR
6.Performanceevaluation
6.1.Simulationenvironment
6.2.Performancemetrics
6.3.DistancebetweenpathsfoundbySDMR
6.4.Comparisonofprotocolperformance
6.5.Analysisofsessioninterception
6.6.Performanceundermobility
7.Conclusions
Acknowledgements
References
EnergyefficientandperceivedQoSawarevideoroutingoverWirelessMultimediaSensorNetworks OriginalResearchArticle
AdHocNetworks
WirelessSensorNetworks(WSNs)haveaneverincreasingvarietyofmultimediabasedapplications.Ιnthesetypesofapplications,networknodesshouldideallymaximizeQoSandminimizeenergyexpendituresinvideocommunication.ThisarticlepresentsPEMuR,anoveldualschemeforefficientvideocommunication,whichaimsatbothenergysavingandhighQoSattainment.Toachieveitsobjectives,PEMuRproposesthecombineduseofanenergyawarehierarchicalroutingprotocolwithanintelligentvideopacketschedulingalgorithm.Theadoptedroutingprotocolenablestheselectionofthemostenergyefficientroutingpaths,managesthenetworkloadaccordingtotheenergyresiduesofthenodesandpreventsuselessdatatransmissionsthroughtheproposeduseofanenergythreshold.Inthisway,anoutstandinglevelofenergyefficiencyisachieved.Additionally,theproposedpacketschedulingalgorithmenablesthereductionofthevideotransmissionratewiththeminimumpossibleincreaseofdistortion.Inordertodoso,itmakesuseofananalyticaldistortionpredictionmodelthatcanaccuratelypredicttheresultedvideodistortionduetoanyerrorpattern.Thus,thealgorithmmaycopewithlimitedavailablechannelbandwidthbyselectivelydroppinglesssignificantpacketspriortotheirtransmission.Simulationresultsdemonstratetheeffectivenessoftheproposedscheme.
ArticleOutline
1.Introduction
2.Relatedwork
2.1.Hierarchicalroutingprotocols
2.2.Routeselectionschemes
2.3.Wirelessvideocommunication
2.4.Packetlossmodels
3.Proposedschemeoverview
3.1.Energyefficienthierarchicalroutingprotocol
3.2.Videopacketscheduling
3.2.1.Videodistortionmodel
3.2.2.Videotransmissionrateadaptation
3.3.PEMuRalgorithmoverview
4.Simulationsetupdescription
5.Simulationresultspresentation
6.Simulationresultsevaluation
7.Conclusions
References
Vitae
QoSNET:
AnintegratedQoSnetworkforroutingprotocolsinlargescalewirelesssensornetworks OriginalResearchArticle
ComputerCommunications
NumerousQoSroutingstrategiesfocusonend-to-enddelaystoprovidetimeconstrainedroutingprotocolsinwirelesssensornetworks(WSNs).Withthearrivalofwirelessmultimediasensornetworks,trafficcanbecomposedoftimesensitivepacketsandreliability-demandingpackets.Insuchsituations,someworksalsotakeintoaccountlinkreliabilitytoprovideprobabilisticQoS.Thetrade-offbetweentheguaranteeoftheQoSrequirementsandthenetworklifetimeremainsanopenissue,especiallyinlargescaleWSNs.ThispaperproposesapromisingmultipathQoSroutingprotocolbasedonaseparationofthenodesintotwosub-networks:
thefirstpartincludesspecificnodesthatareoccasionallyinvolvedinroutingdecisions,whiletheremainingnodesinthesecondsub-networkfullytakepartinthem.TheQoSroutingisformulatedasanoptimizationproblemthataimstoextendthenetworklifetimesubjecttoQoSconstraints.Usingthepercolationtheory,aroutingalgorithmisdesignedtosolvetheproblemontherespectivesub-networks.Simulationresultsshowtheefficiencyofthisnovelapproachintermsofaverageend-to-enddelays,on-timepacketdeliveryratio,andnetworklifetime.
ArticleOutline
1.Introduction
2.Relatedwork
3.Thesystemmodel
3.1.TheQoSnetworkmodel
3.2.End-to-endQoSparameters
3.3.SwitchingQoSrouting
3.4.MappingQoSNetresolutiontositepercolation
4.Performanceevaluation
5.Conclusion
References
Distributedenergybalancedroutingforwirelesssensornetworks OriginalResearchArticle
Computers&IndustrialEngineering
Mostroutingalgorithmsforsensornetworksfocusonfindingenergyefficientpathstoprolongthelifetimeofsensornetworks.Asaresult,thepowerofsensorsonefficientpathsdepletesquickly,andconsequentlysensornetworksbecomeincapableofmonitoringeventsfromsomepartsoftheirtargetareas.Inmanysensornetworkapplications,theeventsthatmustbetrackedoccuratrandomlocationsandhavenon-deterministicgenerationpatterns.Therefore,ideally,routingalgorithmsshouldconsidernotonlyenergyefficiency,butalsotheamountofenergyremainingineachsensor,thusavoidingnon-functioningsensorsduetoearlypowerdepletion.Thispaperintroducesanewmetric,energycost,devisedtoconsiderabalanceofsensors’remainingenergies,aswellasenergyefficiency.Thismetricgivesrisetothedesignofthedistributedenergybalancedrouting(DEBR)algorithmdevisedtobalancethedatatrafficofsensornetworksinadecentralizedmannerandconsequentlyprolongthelifetimeofthenetworks.DEBRisscalableinthenumberofsensorsandalsorobusttothevariationsinthedynamicsofeventgeneration.Wedemonstratetheeffectivenessoftheproposedalgorithmbycomparingthreeexistingroutingalgorithms:
directcommunicationapproach,minimumtransmissionenergy,andself-organizedroutingandfindthatenergybalanceshouldbeconsideredtoextendlifetimeofsensornetworkandincreaserobustnessofsensornetworkfordiverseeventgenerationpatterns.
ArticleOutline
1.Introduction
2.Sensornetworkmodel
2.1.Networktopology
2.2.Energyconsumptionmodel
2.3.Lifetimeofsensornetwork
2.4.Eventgenerationfunctions
3.Routingi
- 配套讲稿:
如PPT文件的首页显示word图标,表示该PPT已包含配套word讲稿。双击word图标可打开word文档。
- 特殊限制:
部分文档作品中含有的国旗、国徽等图片,仅作为作品整体效果示例展示,禁止商用。设计者仅对作品中独创性部分享有著作权。
- 关 键 词:
- Optimal placement and channel assignment of relay stations in heterogeneous wireless mesh networks
![提示](https://static.bdocx.com/images/bang_tan.gif)
链接地址:https://www.bdocx.com/doc/29831054.html