Random sensory networks: a delay analysis

Authors:
Cedric Florens;Masoud Sharif;Robert J. McEliece
Affiliations:
Department of Electrical Engineering, California Institute of Technology, Pasadena, CA;Department of Electrical and Computer Engineering, Boston University, Boston, MA;Department of Electrical Engineering, California Institute of Technology, Pasadena, CA
Venue:
IEEE Transactions on Information Theory
Year:
2009

Citing 4
Cited 1

Deterministic broadcasting in ad hoc radio networks

Distributed Computing
The capacity of wireless networks

IEEE Transactions on Information Theory
A survey on sensor networks

IEEE Communications Magazine
Lower bounds on data collection time in sensory networks

IEEE Journal on Selected Areas in Communications

Multi-state reliability and message time delay in wireless sensor networks

International Journal of Wireless and Mobile Computing

Quantified Score

Hi-index	754.84

Visualization

Abstract

A fundamental function performed by a sensory network is the retrieval of data gathered collectively by sensor nodes. The metrics that measure the efficiency of this data collection process are time and energy. In this paper, we study via simple discrete mathematical models, the statistics of the data collection time in sensory networks. Specifically, we analyze the average minimum delay in collecting randomly located/distributed sensors data for networks of various topologies when the number of nodes becomes large. Furthermore, we analyze the impact of various parameters such as size of packet, transmission range, and channel erasure probability on the optimal time performance. Our analysis applies to directional antenna systems as well as omnidirectional ones. This paper focuses on directional antenna systems and briefly presents results on omnidirectional antenna systems. Finally, a simple comparative analysis shows the respective advantages of the two systems.