[go: up one dir, main page]

Oliveira et al., 2006 - Google Patents

Ad hoc networks: Optimization problems and solution methods

Oliveira et al., 2006

Document ID
1225315001542206196
Author
Oliveira C
Pardalos P
Publication year
Publication venue
Combinatorial Optimization in Communication Networks

External Links

Snippet

5 Concluding Remarks Ad hoc networks are an area of telecommunications that has grown in popularity due to its wide applicability. It also presents some interesting and difficult optimization problems. In this chapter we presented some of the optimization issues related …
Continue reading at link.springer.com (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
    • H04W84/20—Master-slave selection or change arrangements
    • 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
    • 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
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • 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/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
    • 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
    • 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
    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network-specific arrangements or communication protocols supporting networked applications
    • H04L67/10—Network-specific arrangements or communication protocols supporting networked applications in which an application is distributed across nodes in the network
    • 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
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/46—Cluster building
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a programme unit and a register, e.g. for a simultaneous processing of several programmes

Similar Documents

Publication Publication Date Title
Bruzgiene et al. MANET network in internet of things system
Kong et al. An energy-aware routing protocol for wireless sensor network based on genetic algorithm
Qiu et al. TOSG: A topology optimization scheme with global small world for industrial heterogeneous Internet of Things
Li et al. Distributed consensus algorithm for events detection in cyber-physical systems
Bhardwaj et al. Bounding the lifetime of sensor networks via optimal role assignments
Alameri MANETS and Internet of Things: The Development of a Data Routing Algorithm.
Tao et al. Flow-balanced routing for multi-hop clustered wireless sensor networks
Radhika et al. Fuzzy based sleep scheduling algorithm with machine learning techniques to enhance energy efficiency in wireless sensor networks
Wang et al. A spectrum-aware clustering algorithm based on weighted clustering metric in cognitive radio sensor networks
Orojloo et al. A Tabu search based routing algorithm for wireless sensor networks
Hu et al. Dynamic spatial-correlation-aware topology control of wireless sensor networks using game theory
Erciyes et al. Graph theoretic clustering algorithms in mobile ad hoc networks and wireless sensor networks
Das et al. Extending lifetime of wireless sensor networks using multi-sensor data fusion
Zhu et al. Energy-efficient tree-based message ferrying routing schemes for wireless sensor networks
Ye et al. A security fault-tolerant routing for multi-layer non-uniform clustered WSNs
Rana et al. Energy-efficient routing for wireless sensor network using genetic algorithm and particle swarm optimisation techniques
Gogu et al. Using dynamic programming to solve the wireless sensor network configuration problem
Kim et al. Multiple sink positioning and routing to maximize the lifetime of sensor networks
Oliveira et al. Ad hoc networks: Optimization problems and solution methods
He et al. A fuzzy model for content-centric routing in Zigbee-based wireless sensor networks (WSNs)
Shu et al. An optimized multi-hop routing algorithm based on clonal selection strategy for energy-efficient management in wireless sensor networks
Mpitziopoulos et al. Mobile agent middleware for autonomic data fusion in wireless sensor networks
Wang et al. An energy efficient and load balancing routing algorithm for wireless sensor networks
Chakraborty et al. Data fusion in wireless sensor network-a survey
Kim et al. An energy-aware multipath routing algorithm in wireless sensor networks