An Energy-Efficient Initialization Protocol for Wireless Sensor Networks with No Collision Detection
スポンサーリンク
概要
- 論文の詳細を見る
A Wireless Sensor Network (WSN, for short) is a distributed system consisting of n sensor nodes and a base station. In this paper, we propose an energy-efficient protocol to initialize the sensor nodes in a WSN, that is, to assign a unique ID to each sensor node. We show that if an upper bound u on the number n of sensor nodes is known beforehand, for any f ≥ 1 and any small μ (O < μ < 1), a WSN without collision detection capability can be initialized in O((log 1/μ + log f)u^<1+μ>) time slots, with probability exceeding 1 - 1/f with no sensor node probability exceedig 1 - 1/f, with no sensor node being awake for more than O(log 1/μ + log f) time slots.
- 社団法人電子情報通信学会の論文
- 2002-02-01
著者
-
ISHII Naohiro
Department of Intelligence and Computer Science, Nagoya Institute of Technology
-
Ishii N
Nagoya Inst. Technol.
-
Ishii Naohiro
The Author Is With The Department Of Intelligence And Computer Science Nagoya Institute Of Technolog
-
Ishii Naohiro
Department Of Intelligence And Computer Science Nagoya Institute Of Technology
-
Ishii Naohiro
The Authors Are With The Department Of Intelligence And Computer Science Nagoya Institute Of Technol
-
Cui J
Nagoya Inst. Technol. Nagoya‐shi Jpn
-
Nakano K
School Of Information Science Japan Advanced Institute Of Technology
-
BHUVANESWARAN Raghuvel
School of Computer Science and Engineering, Anna University
-
BORDIM Jacir
School of Information Science, Japan Advanced Institute of Technology
-
CUI Jiangtao
Department of Intelligence and Computer Science, Nagoya Institute of Technology
-
NAKANO Koji
School of Information Science, Japan Advanced Institute of Technology
-
Bordim J
Japan Advanced Inst. Sci. And Technol. Ishikawa‐ken Jpn
-
Bordim Jacir
Atr-adaptive Communications Research
-
Bordim Jacir
School Of Information Science Japan Advanced Institute Of Science And Technology
-
Bordim Jacir
The Authors Are. With The School Of Information Science Japan Advanced Institute Of Science And Tech
-
Cui Jiangtao
Department Of Intelligence And Computer Engineering Nagoya Institute Of Technology
-
Cui Jiangtao
The Authors Are With The Department Of Intelligence And Computer Science Nagoya Institute Of Technol
-
Bhuvaneswaran Raghuvel
School Of Computer Science And Engineering Anna University
-
Nakano Koji
School Of Information Science Japan Advanced Institute Of Technology
-
Nakano Koji
Advanced Research Laboratory Hitachi Ltd.
-
Nakano Koji
School Of Engineering Hiroshima University
-
Ishii Naohiro
Department Of Electrical Engineering And Computer Science Nagoya Institute Of Technology
関連論文
- The Completeness of Order-Sorted Term Rewriting Systems Is Preserved by Currying
- Fundamental Protocols to Gather Information in Wireless Sensor Networks(Regular Section)
- An Energy-Efficient Initialization Protocol for Wireless Sensor Networks with No Collision Detection
- Energy-Efficient Initialization Protocols for Ad-Hoc Radio Networks
- Termination of Order-Sorted Rewriting with Non-minimal Signatures
- Enhanced Look-Ahead Scheduling Technique to Overlap Communication with Computation
- Accuracy of the Minimum Time Estimate for Programs on Heterogeneous Machines
- A Lookahead Heuristic for Heterogeneous Multiprocessor Scheduling with Communication Costs (Special Issue on Parallel and Distributed Supercomputing)
- An Improved Increase over the Minimum Execution Time of a Parallel Program
- A Parallel Method for the Prefix Convex Hulls Problem
- Distributed Leader Election on Chordal Ring Networks
- Parallel Algorithms for Convex Hull Problems and Their Paradigm(Special Issue on Algorithm Engineering : Surveys)
- An Energy Efficient Leader Election Protocol for Radio Network with a Single Transceiver(Discrete Mathematics and Its Applications)
- Distributed QoS Scheme for Multimedia Communication in Mobile Ad Hoc Network(Advances in Ad Hoc Mobile Communications and Networking)
- B-15-21 Admission Control and Simple Class based QoS Provisioning for Mobile Ad hoc Networks
- Doubly-Logarithmic Energy-Efficient Initialization Protocols for Single-Hop Radio Networks(Special Section on Discrete Mathematics and Its Applications)
- Accelerating the CKY Parsing Using FPGAs
- An Efficient Method for Computing All Reducts
- A Hybrid Method of Feature Subset Selection
- Improving Performance of the k-Nearest Neighbor Classifier by Combining Feature Selection with Feature Weighting
- Speeding up String Searching Algorithms for Nonuniform Texts
- On Relationships between Decomposable Programs and Rule Commutative Programs
- Efficient Evaluation of One-directional Cycle-recursive Formulas
- An Energy Efficient Ranking Protocol for Radio Networks(Discrete Mathematics and Its Applications)
- A Performance Measure for the Scheduling of Typed Task Systems with Communication Costs
- Decomposable Programs Revised
- Determining Feature Weight of Pattern Classification by Using Rough Genetic Algorithm and Fuzzy Similarity Measure
- Fast On-line String Searching
- Special Section on Foundations of Computer Science
- Low-Temperature Growth of SiO_2 Films by Electron-Induced Ultrahigh Vacuum Chemical Vapor Deposition
- Randomized Time- and Energy-Optimal Routing Single-Hop, Single-Channel Radio Networks
- Reliability of a Mobile Communication System with Network Congestion
- Halftoning Through Optimization of Restored Images : A New Approach with Hardware Acceleration
- An Image Retrieval System Using FPGAs
- Hardware n Choose k Counters with Applications to the Partial Exhaustive Search(Programmable Logic, VLSI, CAD and Layout, Recent Advances in Circuits and Systems-Part 1)
- An Efficient Algorithm for Summing up Binary Values on a Reconfigurable Mesh (Special Section on Discrete Mathematics and Its Applications)
- Optimizing Linear Recursive Formulas by Detaching Isolated Variables