[go: up one dir, main page]

Wu et al., 2008 - Google Patents

Toward the optimal itinerary-based KNN query processing in mobile sensor networks

Wu et al., 2008

Document ID
1816181266637699684
Author
Wu S
Chuang K
Chen C
Chen M
Publication year
Publication venue
IEEE Transactions on Knowledge and Data Engineering

External Links

Snippet

The K-nearest neighbors (KNN) query has been of significant interest in many studies and has become one of the most important spatial queries in mobile sensor networks. Applications of KNN queries may include vehicle navigation, wildlife social discovery, and …
Continue reading at ieeexplore.ieee.org (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
    • H04W4/00—Mobile application services or facilities specially adapted for wireless communication networks
    • H04W4/02—Mobile application Services making use of the location of users or terminals, e.g. OMA SUPL, OMA MLP or 3GPP LCS
    • H04W4/023—Mobile application Services making use of the location of users or terminals, e.g. OMA SUPL, OMA MLP or 3GPP LCS using mutual or relative location information between multiple location based services [LBS] targets or of distance thresholds
    • 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/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
    • H04W4/00—Mobile application services or facilities specially adapted for wireless communication networks
    • H04W4/02—Mobile application Services making use of the location of users or terminals, e.g. OMA SUPL, OMA MLP or 3GPP LCS
    • H04W4/025—Mobile application Services making use of the location of users or terminals, e.g. OMA SUPL, OMA MLP or 3GPP LCS using location based information parameters
    • 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
    • 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/02—Topology update or discovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W64/00—Locating users or terminals or network equipment for network management purposes, e.g. mobility management
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • 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
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing packet switching networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/02—Details

Similar Documents

Publication Publication Date Title
Bhushan et al. Routing protocols in wireless sensor networks
Mundada et al. A study on energy efficient routing protocols in wireless sensor networks
Cho et al. Survey on underwater delay/disruption tolerant wireless sensor network routing
Derhab et al. Data replication protocols for mobile ad-hoc networks: a survey and taxonomy
Li et al. Navigation protocols in sensor networks
Wu et al. DIKNN: an itinerary-based KNN query processing algorithm for mobile sensor networks
Huang et al. On the effect of group mobility to data replication in ad hoc networks
Liu et al. Balancing push and pull for efficient information discovery in large-scale sensor networks
Shahraki et al. Hierarchical distributed management clustering protocol for wireless sensor networks
Beaver et al. Location-aware routing for data aggregation in sensor networks
Wu et al. Toward the optimal itinerary-based KNN query processing in mobile sensor networks
Winter et al. Energy efficient processing of k nearest neighbor queries in location-aware sensor networks
Fu et al. Parallelizing itinerary-based KNN query processing in wireless sensor networks
Chow et al. On efficient and scalable support of continuous queries in mobile peer-to-peer environments
Yu et al. On in-network synopsis join processing for sensor networks
Winter et al. KPT: a dynamic KNN query processing algorithm for location-aware sensor networks
Xu et al. Processing k nearest neighbor queries in location-aware sensor networks
Hawbani et al. GLT: Grouping based location tracking for object tracking sensor networks
Ren et al. Distributed aggregation algorithms for mobile sensor networks with group mobility model
Zhang et al. Balancing the trade-offs between query delay and data availability in MANETs
Zhu et al. BTDGS: Binary-tree based data gathering scheme with mobile sink for wireless multimedia sensor networks
Galdames et al. A generic platform for efficient processing of spatial monitoring queries in mobile peer-to-peer networks
Chen et al. Clustered DTN routing based on sensing node relationship strength
Lee et al. Processing multiple aggregation queries in geo-sensor networks
Tang et al. Selective message forwarding in delay tolerant networks