WSN08-5: On the Relation Between Capacity and Number of Sinks in an Sensor Network
- 1 November 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1 (1930529X), 1-5
- https://doi.org/10.1109/glocom.2006.510
Abstract
Surveillance data generated by the nodes of a wireless ad-hoc (multihop) sensor network is aggregated at local sinks and forwarded to a central node. The number of sensor nodes that the sinks can support determines a "capacity" of the network. The number of surveillance data flows (each emanating from a sensor node) that a node can relay is limited by a variety of factors such as channel conditions (including interference, attenuation, fading and ambient noise) and internal hardware and energy resources of the node. Assuming that the one-hop neighbors of a sink form the most significant communication relaying bottleneck, we analytically determine the fraction of sensor nodes that are unable to connect to their sink, i.e., the outage probability. This expression is numerically evaluated and its accuracy is assessed and reported in a preliminary simulation study.Keywords
This publication has 15 references indexed in Scilit:
- Ad hoc networking with directional antennas: a complete system solutionIEEE Journal on Selected Areas in Communications, 2005
- Purposeful mobility for relaying and surveillance in mobile ad hoc sensor networksIEEE Transactions on Mobile Computing, 2004
- The nominal capacity of wireless mesh networksIEEE Wireless Communications, 2003
- Performance Evaluation of Modified IEEE 802.11 MAC for Multi-Channel Multi-Hop Ad Hoc NetworksJournal of Interconnection Networks, 2003
- Mobility increases the capacity of ad-hoc wireless networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Capacity of Ad Hoc wireless networksPublished by Association for Computing Machinery (ACM) ,2001
- A Capacity Analysis for the IEEE 802.11 MAC ProtocolWireless Networks, 2001
- The capacity of wireless networksIEEE Transactions on Information Theory, 2000
- Poisson-Voronoi Spanning Trees with Applications to the Optimization of Communication NetworksOperations Research, 1999
- Ad-hoc on-demand distance vector routingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1999