+

Wang et al., 2018 - Google Patents

Efficient path planning for a mobile sink to reliably gather data from sensors with diverse sensing rates and limited buffers

Wang et al., 2018

Document ID
15151129400128077378
Author
Wang Y
Chen K
Publication year
Publication venue
IEEE Transactions on Mobile Computing

External Links

Snippet

Wireless sensor networks are vulnerable to energy holes, where sensors close to a static sink are fast drained of their energy. Using a mobile sink (MS) can conquer this predicament and extend sensor lifetime. How to schedule a traveling path for the MS to efficiently gather …
Continue reading at ieeexplore.ieee.org (other versions)

Classifications

    • 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
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G06F17/30958—Graphs; Linked lists
    • 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/50—Computer-aided design
    • 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/12—Shortest path evaluation
    • 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
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation, e.g. linear programming, "travelling salesman problem" or "cutting stock problem"
    • 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/48—Routing tree calculation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management, e.g. organising, planning, scheduling or allocating time, human or machine resources; Enterprise planning; Organisational models
    • 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

Similar Documents

Publication Publication Date Title
Wang et al. Efficient path planning for a mobile sink to reliably gather data from sensors with diverse sensing rates and limited buffers
Donta et al. An extended ACO-based mobile sink path determination in wireless sensor networks
Jazebi et al. RISA: routing scheme for Internet of Things using shuffled frog leaping optimization algorithm
Mohseni et al. CEDAR: A cluster-based energy-aware data aggregation routing protocol in the internet of things using capuchin search algorithm and fuzzy logic
Agarwal et al. Energy-efficient mobile sink-based intelligent data routing scheme for wireless sensor networks
Abadi et al. RLBEEP: Reinforcement-learning-based energy efficient control and routing protocol for wireless sensor networks
Salarian et al. An energy-efficient mobile-sink path selection strategy for wireless sensor networks
Katsaros et al. Social network analysis concepts in the design of wireless ad hoc network protocols
Zou et al. Wireless sensor network routing method based on improved ant colony algorithm
Pavone et al. A stochastic and dynamic vehicle routing problem with time windows and customer impatience
Kumar et al. Flow based efficient data gathering in wireless sensor network using path-constrained mobile sink
Mehto et al. Virtual grid-based rendezvous point and sojourn location selection for energy and delay efficient data acquisition in wireless sensor networks with mobile sink
Orojloo et al. A Tabu search based routing algorithm for wireless sensor networks
Biabani et al. EE-MSWSN: Energy-efficient mobile sink scheduling in wireless sensor networks
Lu et al. Fuzzy random multi-objective optimization based routing for wireless sensor networks
Kiani AR‐RBFS: Aware‐Routing Protocol Based on Recursive Best‐First Search Algorithm for Wireless Sensor Networks
Wang et al. A novel framework of multi-hop wireless charging for sensor networks using resonant repeaters
Chowdhury et al. EETC: Energy efficient tree-clustering in delay constrained wireless sensor network
Dash Geometric algorithm for finding time-sensitive data gathering path in energy harvesting sensor networks
Jerew et al. Delay tolerance and energy saving in wireless sensor networks with a mobile base station
Das et al. Extending lifetime of wireless sensor networks using multi-sensor data fusion
Arya et al. Optimization approach for energy minimization and bandwidth estimation of WSN for data centric protocols
Rani et al. QoS aware cross layer paradigm for urban development applications in IoT
Hamrioui et al. Cross-layer approach for self-organizing and self-configuring communications within iot
Li et al. Energy efficient mobile sink driven data collection in wireless sensor network with nonuniform data
点击 这是indexloc提供的php浏览器服务，不要输入任何密码和下载