Autonomous Multi-Source Multi-Sink Routing in Wireless Sensor Networks
スポンサーリンク
概要
- 論文の詳細を見る
This paper proposes a distributed algorithm to calculate a subnetwork of a given wireless sensor network (WSN) connecting a set of sources and a set of sinks, in such a way that: 1) the length of one of the shortest paths connecting from a source to a sink in the subgraph does not exceed the distance from the source to the farthest sink in the original graph, and 2) the number of links contained in the subgraph is smallest. The proposed algorithm tries to improve an initial solution generated by a heuristic scheme by repeatedly applying a local search. The result of simulations indicates that: 1) using a heuristic to generate an initial solution, the size of the initial solution is reduced by 10% compared with a simple shortest path tree; and 2) the local search reduces the size of the resultant subgraph by 20% and the cost required for such an improvement by the local search can be recovered by utilizing the resultant subgraph for a sufficiently long time such as a few days.
著者
-
Fujita Satoshi
Graduate School Of Engineering Faculty Of Engineering Hiroshima University
-
Kamei Sayaka
Graduate School of Engineering, Hiroshima University
-
He XingPing
Toshiba Tec Corporation
関連論文
- A Fault-Tolerant Content Addressable Network(Networks)
- A Localization Scheme for Sensor Networks Based on Wireless Communication with Anchor Groups(Challenges in Ad-hoc and Multi-hop Wireless Communications)
- CHQ : A Multi-Agent Reinforcement Learning Scheme for Partially Observable Markov Decision Processes(Artificial Intelligence and Cognitive Science)
- On Some Computational Aspect of Point Configurations in the Enclidean Space
- An Efficient Scheduling Scheme for Assigning Transmission Opportunity in QoS-Guaranteed Wireless LAN
- A Generic Solver Based on Functional Parallelism for Solving Combinatorial Optimization Problems(Distributed Cooperation and Agents)
- SwRED: a robust active queue management scheme based on load level prediction (情報ネットワーク)
- A New Caching Technique to Support Conjunctive Queries in P2P DHT
- Semi-Dynamic Multiprocessor Scheduling with an Asymptotically Optimal Performance Ratio
- A Greedy Multicast Algorithm in ★-Ary n-Cubes and Its Worst Case Analysis (Special Issue on Selected Papers from LA Symposium)
- Importance of intracellular Fe pools on growth of marine diatoms by using unialgal cultures and on the Oyashio region phytoplankton community during spring
- Autonomous Multi-Source Multi-Sink Routing in Wireless Sensor Networks
- Autonomous Multi-Source Multi-Sink Routing in Wireless Sensor Networks
- Special Section on Discrete Mathematics and Its Applications
- Time-Optimal Gathering Algorithm of Mobile Robots with Local Weak Multiplicity Detection in Rings
- Reputation-Based Colluder Detection Schemes for Peer-to-Peer Content Delivery Networks