On the public citation graph
Auction‐based task allocation with trust management for shared sensor networks
0 signed · 34 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/ett.1413openalex-snapshot
Trust management in wireless sensor networks
inferredcites →https://doi.org/10.1007/s11036-006-5192-yopenalex-snapshot
Auction-Based Spectrum Sharing
inferredcites →https://doi.org/10.1109/ccnc.2007.124openalex-snapshot
Cluster-Based Reputation and Trust for Wireless Sensor Networks
inferredcites →https://doi.org/10.1109/glocomw.2007.4437800openalex-snapshot
Using Trust in Key Distribution in Wireless Sensor Networks
inferredcites →https://doi.org/10.1109/hicss.2006.29openalex-snapshot
A Secure Routing Protocol for Wireless Ad Hoc Networks
inferredcites →https://doi.org/10.1109/icact.2005.245914openalex-snapshot
Trust evaluation model for wireless sensor networks
inferredcites →https://doi.org/10.1109/iccsp.2011.5739330openalex-snapshot
Trust management techniques in Wireless Sensor Networks: An evaluation
inferredcites →https://doi.org/10.1109/icppw.2006.33openalex-snapshot
Dynamic Critical-Path Task Mapping and Scheduling for Collaborative In-Network Processing in Multi-Hop Wireless Sensor Networks
inferredcites →https://doi.org/10.1109/infcom.2010.5462016openalex-snapshot
Wireless Network Virtualization as A Sequential Auction Game
inferredcites →https://doi.org/10.1109/mobhoc.2007.4428674openalex-snapshot
TARP: A Trust-Aware Routing Protocol for Sensor-Actuator Networks
inferredcites →https://doi.org/10.1109/mobhoc.2009.5337039openalex-snapshot
A price-based adaptive task allocation for Wireless Sensor Network
inferredcites →https://doi.org/10.1109/msp.2002.1012351openalex-snapshot
Energy-efficient DSPs for wireless sensor networks
inferredcites →https://doi.org/10.1109/noms.2008.4575214openalex-snapshot
Using trust for key distribution and route selection in Wireless Sensor Networks
inferredcites →https://doi.org/10.1109/percomw.2010.5470540openalex-snapshot
Distributed winner determination protocol for reverse auction-based task allocation in pervasive computing
inferredcites →https://doi.org/10.1109/percomw.2010.5470601openalex-snapshot
Supporting multi-fidelity-aware concurrent applications in dynamic sensor networks
inferredcites →https://doi.org/10.1109/tc.2007.1082openalex-snapshot
Combinatorial Reverse Auction based Scheduling in Multi-Rate Wireless Systems
inferredcites →https://doi.org/10.1145/1791212.1791219openalex-snapshot
On-line sensing task optimization for shared sensors
inferredcites →https://doi.org/10.1145/1860093.1860118openalex-snapshot
Near optimal multi-application allocation in shared sensor networks
inferredcites →https://doi.org/10.1145/352871.352873openalex-snapshot
Optimal solutions for multi-unit combinatorial auctions
inferredcites →https://doi.org/10.1145/544741.544760openalex-snapshot
Winner determination in combinatorial auction generalizations
inferredcites →https://doi.org/10.5555/1251203.1251226openalex-snapshot
Decentralized, adaptive resource allocation for sensor networks
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/sec.1026openalex-snapshot
Trust dynamic task allocation algorithm with Nash equilibrium for heterogeneous wireless sensor network
inferred← citeshttps://doi.org/10.1002/sec.915openalex-snapshot
An energy‐efficient and security aware route selection protocol for wireless sensor networks
inferred← citeshttps://doi.org/10.1007/978-3-319-26869-9_5openalex-snapshot
SERAPH: Service Allocation Algorithm for the Execution of Multiple Applications in Heterogeneous Shared Sensor and Actuator Networks
inferred← citeshttps://doi.org/10.1016/j.adhoc.2016.04.004openalex-snapshot
On optimal resource allocation in virtual sensor networks
inferred← citeshttps://doi.org/10.1016/j.oceaneng.2023.113841openalex-snapshot
Multi-AUV dynamic trajectory optimization and collaborative search combined with task urgency and energy consumption scheduling in 3-D underwater environment with random ocean currents and uncertain obstacles
inferred← citeshttps://doi.org/10.1109/comst.2016.2582841openalex-snapshot
Data Collection and Wireless Communication in Internet of Things (IoT) Using Economic Analysis and Pricing Models: A Survey
inferred← citeshttps://doi.org/10.1109/glocom.2014.7417187openalex-snapshot
An Optimization Framework for Resource Allocation in Virtual Sensor Networks
inferred← citeshttps://doi.org/10.1109/glocom.2015.7417187openalex-snapshot
An Optimization Framework for Resource Allocation in Virtual Sensor Networks
inferred← citeshttps://doi.org/10.1109/icus52573.2021.9641375openalex-snapshot
Task Allocation for Multiple Unmanned Aerial Vehicles Based on Combinatorial Auctions
inferred← citeshttps://doi.org/10.1109/lra.2022.3220155openalex-snapshot
Consensus-Based Decentralized Task Allocation for Multi-Agent Systems and Simultaneous Multi-Agent Tasks
inferred← citeshttps://doi.org/10.1109/lra.2025.3597900openalex-snapshot
Communication-Efficient Decentralized Task Allocation for Large-Scale Multi-Agent Systems
inferred← citeshttps://doi.org/10.1109/tcds.2018.2866984openalex-snapshot
A Workload Balanced Algorithm for Task Assignment and Path Planning of Inhomogeneous Autonomous Underwater Vehicle System
inferred← citeshttps://doi.org/10.1109/tmc.2024.3442809openalex-snapshot
VNF Scheduling and Sampling Rate Maximization in Energy Harvesting IoT Networks
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.