{"title":"Adaptive routing with intelligent portal in wireless mesh networks","authors":"R. Zoican","doi":"10.1109/SIBIRCON.2008.4602564","DOIUrl":null,"url":null,"abstract":"Mesh networks, motivated by wireless neighborhood networks are composed of static wireless nodes that have ample energy supply. Each of these wireless nodes can be equipped with multiple radios, called a multiradio/multichannel node, and each of the radios can be configured to a different channel to enhance network capacity. All wireless nodes cooperatively route each otherpsilas traffic to the Internet through one or more Internet Transit Access Points (TAPS), which are gateways to the Internet. Nodes may also communicate with each other directly through the mesh network without going through TAPS. Supporting communication among mesh nodes and TAPS requires the use of routing protocols that must be combined with a routing metric to determine which route among all possible routes between a pair of nodes will be used. The design of effective routing metrics, however, depends on the specific characteristics of the target network. For example, the severe energy constraints of sensor networks demand the design of energy efficient routing, while the mobility of nodes in ad hoc networks demand the design of protocols that can efficiently maintain connectivity. The unique combination of static nodes with the shared nature of the wireless medium in mesh networks also imposes specific requirements for the design of routing metrics. In this paper it was analyzed the proposed IPRA (Intelligent Portal Routing Algorithm) protocol and its performances in comparison with those offered by the AODV (Ad-hoc on Demand Vector) and DSDV (Destination Sequence Distance Vector) protocols.","PeriodicalId":295946,"journal":{"name":"2008 IEEE Region 8 International Conference on Computational Technologies in Electrical and Electronics Engineering","volume":"78 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE Region 8 International Conference on Computational Technologies in Electrical and Electronics Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIBIRCON.2008.4602564","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Mesh networks, motivated by wireless neighborhood networks are composed of static wireless nodes that have ample energy supply. Each of these wireless nodes can be equipped with multiple radios, called a multiradio/multichannel node, and each of the radios can be configured to a different channel to enhance network capacity. All wireless nodes cooperatively route each otherpsilas traffic to the Internet through one or more Internet Transit Access Points (TAPS), which are gateways to the Internet. Nodes may also communicate with each other directly through the mesh network without going through TAPS. Supporting communication among mesh nodes and TAPS requires the use of routing protocols that must be combined with a routing metric to determine which route among all possible routes between a pair of nodes will be used. The design of effective routing metrics, however, depends on the specific characteristics of the target network. For example, the severe energy constraints of sensor networks demand the design of energy efficient routing, while the mobility of nodes in ad hoc networks demand the design of protocols that can efficiently maintain connectivity. The unique combination of static nodes with the shared nature of the wireless medium in mesh networks also imposes specific requirements for the design of routing metrics. In this paper it was analyzed the proposed IPRA (Intelligent Portal Routing Algorithm) protocol and its performances in comparison with those offered by the AODV (Ad-hoc on Demand Vector) and DSDV (Destination Sequence Distance Vector) protocols.