 Improved Algorithms for Data-Gathering Time in Sensor Networks II: Ring, Tree, and Grid TopologiesYoram Revah and Michael Segal International Journal of Distributed Sensor Networks, 2009, vol. 5, issue 5, 463-479 Abstract: We address the problem of gathering information in sensor webs consisting of sensors nodes, wherein a round of communication sensor nodes have messages to be sent to a distant central node (called the base station) over the shortest path. There is a wide range of data gathering applications like target and hazard detection, environmental monitoring, battlefield surveillance, etc. Consequently, efficient data collection solutions are needed to improve the performance of the network. In this article, we take into account the fact that interference can occur at the reception of a message at the receiver sensor. In order to save redundant retransmissions and energy, we assume a known distribution of sources (each node wants to transmit at most one packet) and one common destination. We provide a number of scheduling algorithms jointly minimizing both the completion time and the average packet delivery time. We define our network model using directional antennas and consider Ring, Tree, and Grid Network (and its generality) topologies. All our algorithms run in low-polynomial time. Keywords: Scheduling Algorithms; Optimization Problems; Half-Duplex One-Port Model (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:sae:intdis:v:5:y:2009:i:5:p:463-479 DOI: 10.1080/15501320902876071 Access Statistics for this article More articles in International Journal of Distributed Sensor Networks |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.