[go: up one dir, main page]

Girgis et al., 2014 - Google Patents

Solving the wireless mesh network design problem using genetic algorithm and simulated annealing optimization methods

Girgis et al., 2014

View PDF
Document ID
4107714598152326256
Author
Girgis M
Mahmoud T
Abdullatif B
Rabie A
Publication year
Publication venue
International Journal of Computer Applications

External Links

Snippet

Mesh clients, mesh routers and gateways are components of Wireless Mesh Network (WMN). In WMN, gateways connect to Internet using wireline links and supply Internet access services for users. Multiple gateways are needed, which take time and cost budget to …
Continue reading at www.academia.edu (PDF) (other versions)

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organizing networks, e.g. ad-hoc networks or sensor networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H04L45/123—Evaluation of link metrics
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance or administration or management of packet switching networks
    • H04L41/08—Configuration management of network or network elements
    • H04L41/0803—Configuration setting of network or network elements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/04—Interdomain routing, e.g. hierarchical routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/48—Routing tree calculation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance or administration or management of packet switching networks
    • H04L41/12—Arrangements for maintenance or administration or management of packet switching networks network topology discovery or management
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/24—Cell structures
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/02—Arrangements for optimizing operational condition
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance or administration or management of packet switching networks
    • H04L41/50—Network service management, i.e. ensuring proper service fulfillment according to an agreement or contract between two parties, e.g. between an IT-provider and a customer
    • H04L41/5041—Service implementation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W84/00—Network topologies
    • H04W84/02—Hierarchical pre-organized networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W48/00—Access restriction; Network selection; Access point selection
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W28/00—Network traffic or resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W72/00—Local resource management, e.g. wireless traffic scheduling or selection or allocation of wireless resources
    • H04W72/04—Wireless resource allocation

Similar Documents

Publication Publication Date Title
Girgis et al. Solving the wireless mesh network design problem using genetic algorithm and simulated annealing optimization methods
Ding et al. Using partially overlapping channels to improve throughput in wireless mesh networks
Sakamoto et al. A comparison study of hill climbing, simulated annealing and genetic algorithm for node placement problem in WMNs
Barolli et al. A QoS routing method for ad-hoc networks based on genetic algorithm
US8107399B2 (en) Methods and devices for providing robust nomadic wireless mesh networks using directional antennas
Sankararaman et al. On channel-discontinuity-constraint routing in wireless networks
Kashyap et al. Integrated topology control and routing in wireless optical mesh networks
Moayyedi et al. Generalizable GNN-based 5G RAN/MEC slicing and admission control in metropolitan networks
EP3425861A1 (en) Improved routing in an heterogeneous iot network
Karamad et al. Optimizing placements of backhaul hubs and orientations of antennas in small cell networks
Chu et al. Deployment of a connected reinforced backbone network with a limited number of backbone nodes
Beljadid et al. Optimal design of broadband wireless mesh networks
Zakaria et al. Joint channel assignment and routing in multiradio multichannel wireless mesh networks: design considerations and approaches
Dong et al. Building robust nomadic wireless mesh networks using directional antennas
US20160050612A1 (en) Aggregation-node selection using virtual hub
Arivudainambi et al. Heuristic approach for broadcast scheduling, problem in wireless mesh networks
Wang et al. DeepRP: Bottleneck Theory Guided Relay Placement for 6G Mesh Backhaul Augmentation
Farzinvash A novel approach for multicast call acceptance in multi-channel multi-radio wireless mesh networks
Alba et al. Evolutionary algorithms in telecommunications
Jahanshahi et al. Gateway placement and selection solutions in wmns: A survey
Girgis et al. Solving wireless mesh network design problem using genetic algorithm and Tabu search optimization methods
WO2016072838A1 (en) A system and method for next hop selection in a wireless sensor network
Ngo et al. GHAR: Graph-based hybrid adaptive routing for cognitive radio based disaster response networks
Sultana et al. A minimum spanning tree based routing protocol for multi-hop and multi-channel cognitive radio
Singh et al. NGUB: Novel greedy algorithms for user and beam selection in mmWave networks