By Topic

Optimal deployment of large wireless sensor networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Toumpis, Stavros ; Dept. of Electr. & Comput. Eng., Univ. of Cyprus, Nicosia, Cyprus ; Tassiulas, L.

A spatially distributed set of sources is creating data that must be delivered to a spatially distributed set of sinks. A network of wireless nodes is responsible for sensing the data at the sources, transporting them over a wireless channel, and delivering them to the sinks. The problem is to find the optimal placement of nodes, so that a minimum number of them is needed. The critical assumption is made that the network is massively dense, i.e., there are so many sources, sinks, and wireless nodes, that it does not make sense to discuss in terms of microscopic parameters, such as their individual placements, but rather in terms of macroscopic parameters, such as their spatial densities. Assuming a particular interference-limited, capacity-achieving physical layer, and specifying that nodes only need to transport the data (and not to sense them at the sources, or deliver them at the sinks once their location is reached), the optimal node placement induces a traffic flow that is identical to the electrostatic field created if the sources and sinks are replaced by a corresponding distribution of positive and negative charges. Assuming a general model for the physical layer, and specifying that nodes must not only transport the data, but also sense them at the sources and deliver them at the sinks, the optimal placement of nodes is given by a scalar nonlinear partial differential equation found by calculus of variations techniques. The proposed formulation and derived equations can help in the design of large wireless sensor networks that are deployed in the most efficient manner, not only avoiding the formation of bottlenecks, but also striking the optimal balance between reducing congestion and having the data packets follow short routes.

Published in:

Information Theory, IEEE Transactions on  (Volume:52 ,  Issue: 7 )