Abstract
We consider sensor networks in which individual nodes with on-board sensing and low-power transmitters and receivers establish connections with neighboring nodes. The overall objective is to enable energy-efficient data communication, relayed between arbitrary nodes on the network. We develop a distributed algorithm which minimizes the power required for neighbor discovery.Initially nodes do not have deterministic knowledge of the location of their neighbors, and we model the distribution of the nodes as a two-dimensional Poisson process with known intensity. This corresponds to a situation in which a large number of nodes are randomly distributed over a given area. The process of neighbor discovery is modeled as a Markov decision process, and the resulting control policy is a finite automaton, driven by the underlying probability distribution, that minimizes the average power consumed. This policy can be computed offline and stored in each node with very low requirements for online memory and processor capability.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
