[go: up one dir, main page]

Lipman et al., 2003 - Google Patents

Optimized flooding algorithms for ad hoc networks

Lipman et al., 2003

View PDF
Document ID
14371415898825468569
Author
Lipman J
Boustead P
Chicharo J
Judge J
Publication year
Publication venue
Proceedings of The 2nd Workshop on the Internet, Telecommunications and Signal Processing (WITSP'03), Coolangatta, Gold Coast, Australia

External Links

Snippet

Abstract Information dissemination (flooding) forms an integral part of routing protocols, network management, service discovery and information collection. Given the broadcast nature of ad hoc network communications, information dissemination provides a challenging …
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/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
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/246—Connectivity information 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
    • 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
    • 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/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
    • 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
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W28/00—Network traffic or resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/06—Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information
    • 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
    • H04W88/00—Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
    • H04W88/02—Terminal devices
    • H04W88/04—Terminal devices adapted for relaying to or from another terminal or user
    • 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
    • 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
    • H04W74/00—Wireless channel access, e.g. scheduled or random access
    • H04W74/08—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access]
    • H04W74/0808—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using carrier sensing, e.g. as in CSMA
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. local area networks [LAN], wide area networks [WAN]
    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W4/00—Mobile application services or facilities specially adapted for wireless communication networks
    • 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
    • H04W92/00—Interfaces specially adapted for wireless communication networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field

Similar Documents

Publication Publication Date Title
Jarupan et al. A survey of cross-layer design for VANETs
Stojmenovic et al. Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks
Peng et al. AHBP: An efficient broadcast protocol for mobile ad hoc networks
Cartigny et al. Border node retransmission based probabilistic broadcast protocols in ad-hoc networks
EP2280517B1 (en) Method and apparatus for controlling packet transmissions within wireless networks to enhance network formation
JP2009512334A (en) Method and apparatus for determining link cost for routing in wireless network
Lee et al. Broadcasting in Moblie Ad Hoc Networks
La et al. Distribution of path durations in mobile ad hoc networks and path selection
Cartigny et al. RNG relay subset flooding protocols in mobile ad-hoc networks
Iwendi et al. An ACO-KMT energy efficient routing scheme for sensed-IoT network
CN120166375A (en) A UAV swarm networked measurement, control and communication system and communication method
Zhou et al. An on-demand routing protocol for improving channel use efficiency in multichannel ad hoc networks
Lipman et al. Optimized flooding algorithms for ad hoc networks
Katiravan et al. Energy efficient link aware routing with power control in wireless ad hoc networks
Badis et al. Scalable model for the simulation of OLSR and Fast-OLSR protocols
Lipman et al. Neighbor aware adaptive power flooding (NAAP) in mobile ad hoc networks
Chowdhury et al. XCHARM: A routing protocol for multi-channel wireless mesh networks
Khan et al. Coverage-based dynamically adjusted probabilistic forwarding for wireless mobile ad hoc networks
Lipman et al. Localised Minimum Spanning Tree Flooding in Ad-Hoc Networks
Choudhary Performance Evaluation of Routing Protocols and ML-based Enhancements for UAV-Assisted Post-Disaster Communication Networks
Holter Comparing aodv and olsr
Michalak et al. Relative efficiency of broadcasting in the cluster based network—Simulation results
Kim et al. Probabilistic Broadcasting Based on Selfishness and Additional Coverage in MANETs
Yang et al. A cross-layer framework for position-based routing and medium access control in heterogeneous mobile ad hoc networks
Cho et al. Dynamic multipoint relay candidate selection for broadcast data aggregation in mobile ad-hoc networks