Affiliation:
1. School of Electrical and Computer Engineering, Ben-Gurion University of the Negev, Israel
Abstract
In this paper, we investigate the topic of designing a sensor network by simultaneously optimizing its data energy efficiency and latency. We propose to design a network structure based on the number of nearest neighbors of wireless nodes and provide an analytic bound for the network measurements such as energy consumption and hop-diameter. We also show how to obtain the tradeoff between both criteria. To the best of our knowledge, no non-trivial sublogarithmic hop-diameter bound has been known before. Moreover, our structure is highly fault resilient. We also present simulation results to validate our claims.
1
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Networks and Communications
Reference26 articles.
1. Residual Energy-Based Cluster-Head Selection in WSNs for IoT Application
2. Energy‐efficient modified LEACH protocol for IoT application
3. Bounded-hops power assignment in ad hoc wireless networks;Calinescu Gruia;Discrete Applied Mathematics,2006
4. Paz Carmi , Lilach Chaitman-Yerushalmi , and Ohad Trabelsi . 2015 . On the bounded-hop range assignment problem . In Workshop on Algorithms and Data Structures. Springer, 140–151 . Paz Carmi, Lilach Chaitman-Yerushalmi, and Ohad Trabelsi. 2015. On the bounded-hop range assignment problem. In Workshop on Algorithms and Data Structures. Springer, 140–151.
5. On the Power Assignment Problem in Radio Networks