Implementing information paths in a dense wireless sensor network

Authors:
Masoumeh Haghpanahi;Mehdi Kalantari;Mark Shayman
Affiliations:
Department of Electrical & Computer Engineering, University of Maryland;Department of Electrical & Computer Engineering, University of Maryland;Department of Electrical & Computer Engineering, University of Maryland
Venue:
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Year:
2009

Citing 7
Cited 1

Elements of information theory

Elements of information theory
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Electric-field-based routing: a reliable framework for routing in MANETs

ACM SIGMOBILE Mobile Computing and Communications Review
Optimal design and operation of massively dense wireless networks: or how to solve 21st century problems using 19th century mathematics

Interperf '06 Proceedings from the 2006 workshop on Interdisciplinary systems approach in performance evaluation and design of computer & communications sytems
Mother nature knows best: A survey of recent results on wireless networks based on analogies with physics

Computer Networks: The International Journal of Computer and Telecommunications Networking
The capacity of wireless networks

IEEE Transactions on Information Theory
Optimal deployment of large wireless sensor networks

IEEE Transactions on Information Theory

Gauss-seidel correction algorithm: A macroscopic model-derived routing algorithm for WSNs

ACM Transactions on Sensor Networks (TOSN)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a sensor network with information sources and a sink, we assume a single path between every location in the network and the destination. These abstract information paths represent the desired paths for transmission of information. If the number of sensor nodes is large enough to approximate information paths with a certain precision, we call the network implementable. In this paper, we investigate the relation between density of nodes and implementability of information paths. We show that a quadratic relation between the density of nodes and the magnitude of information flow does not guarantee implementability. On the other hand, we show that in a rectangular geometry with a line source and a line sink, and a total load of θ bps, N = O(θ2 log θ) number of nodes is sufficient for implementing the information paths. Furthermore, we show via simulation that adding the log factor is also a necessity for implementing the paths.