ABSTRACT
The main goal of this paper is to show that multi-hop single-user communication achieves the per node transport capacity of Θ(ln N<over>N) in homogeneous sensor networks, making it order-optimal. Our contributions in this paper are three-fold. First, we construct a route-discovery and scheduling scheme based on spatial TDMA for sensor networks. Second, we show that our schedule achieves a per node transport capacity of Θ(lnN<over>N), the same as that achievable by beamforming. Third, we compare multi-hop communication and beamforming based methods in terms of the network power consumption required to attain a fixed throughput. Based on our power calculations, we conclude that if the channel attenuation is above a certain threshold (which we calculate), then multi-hop communication performs better, whereas below the threshold, beamforming is preferable.
- E. Arikan. Some complexity results about packet radio networks. IEEE Trans. Info. Th., 30:681--685, July 1984.Google ScholarDigital Library
- R. Benzel. The capacity region of a class of discrete additive degraded interference channels. IEEE Trans. Info. Th., 25(2):228--231, March 1979.Google ScholarCross Ref
- A. Chakrabarti, A. Sabharwal, and B. Aazhang. Using predictable observer mobility for power efficient design of sensor networks. In IPSN 2003, pages 129--145, April 2003. Google ScholarDigital Library
- M. H. M. Costa. On the Gaussian interference channel. IEEE Trans. Info. Th., 31(5):607--615, September 1985.Google ScholarCross Ref
- T. M. Cover and A. A. El Gamal. Capacity theorems for the relay channel. IEEE Trans. Info. Th., 25:572--584, September 1979.Google ScholarDigital Library
- H. El Gamal. On the scaling laws of dense wireless sensor networks. IEEE Trans. Info. Th., April 2003. submitted. Google ScholarDigital Library
- J. Elson and D. Estrin. Time synchronization for wireless sensor networks. In Parallel and Distributed Processing Symposium, pages 1965--1970, April 2001. Google ScholarDigital Library
- M. Gastpar and M. Vetterli. On the capacity of wireless networks: The relay case. In IEEE INFOCOM., June 2002.Google ScholarCross Ref
- M. Grossglauser and D. Tse. Mobility increases the capacity of ad hoc wireless networks. In IEEE INFOCOM., volume 3, pages 1360--1369, 2001. Google ScholarDigital Library
- P. Gupta and P. R. Kumar. Critical power for asymptotic connectivity in wireless networks. In Stochastic Analysis, Control, Optimization and Applications, Boston., pages 1106--1110, 1998.Google Scholar
- P. Gupta and P. R. Kumar. Towards an information theory of large networks: An achievable rate region. IEEE Trans. Info. Th., 49:1877--1894, August 2003. Google ScholarDigital Library
- M. A. Khojastepour, A. Sabharwal, and B. Aazhang. Bounds on achievable rates for general multi-terminal networks with practical constraints. In Lecture Notes in Computer Science - 2634, pages 146--161, 2003. Google Scholar
- J. N. Laneman and G. W. Wornell. Energy-efficient antenna sharing and relaying for wireless networks. In Wireless Communications and Networking Conference, volume 1, pages 7--12, September 2000.Google ScholarCross Ref
- D. Marco, E. J. Duarte-Melo, M. Liu, and D. L. Neuhoff. On the many-to-one transport capacity of a dense wireless sensor network and the compressibility of its data. In IPSN 2003, pages 1--16, April 2003. Google ScholarDigital Library
- R. Min and A. Chandrakasan. Energy-efficient communication for ad-hoc wireless sensor networks. In Conference Record of the Thirty-Fifth Asilomar Conference on Signals, Systems and Computers, volume 1, pages 139--143, 2001.Google ScholarCross Ref
- K. J. Quirk, M. Srinivasan, and J. R. Agre. Cooperative modulation techniques for long haul relay in sensor networks. In GLOBECOM, volume 2, pages 1171--1175, November 2001.Google ScholarCross Ref
- B. Schein and R. Gallager. The gaussian parallel relay network. In IEEE ISIT 2000, page 22, June 2000.Google ScholarCross Ref
- A. Sendonaris, E. Erkip, and B. Aazhang. Increasing uplink capacity via user cooperation diversity. In IEEE ISIT 1998, page 156, August 1998.Google ScholarCross Ref
- M. Sichitiu and C. Veerarittiphan. Simple, accurate time synchronization for wireless sensor networks. In Wireless Communications and Networking, pages 1266--1273, March 2003.Google ScholarCross Ref
- D. Slepian and J. Wolf. Noiseless coding of correlated information sources. IEEE Trans. Info. Th., 19:471--480, July 1973.Google ScholarCross Ref
- E. Uysal-Biyikoglu and A. Keshavarzian. Throughput achievable with no relaying in a mobile interference network. In IEEE ISCC, pages 641--645, June 2003. Google ScholarDigital Library
- G. Wang and N. Ansari. Optimal broadcast scheduling in packet radio networks using mean field annealing. IEEE Journal on Selected Areas in Communications, 15:250--260, February 1997. Google ScholarDigital Library
Index Terms
- Multi-hop communication is order-optimal for homogeneous sensor networks
Recommendations
Goodput and throughput comparison of single-hop and multi-hop routing for IEEE 802.11 DCF-based wireless networks under hidden terminal existence
We investigate how multi-hop routing affects the goodput and throughput performances of IEEE 802.11 distributed coordination function-based wireless networks compared with direct transmission single hopping, when medium access control dynamics such as ...
DS/CDMA throughput of a multi-hop sensor network in a Rayleigh fading underwater acoustic channel: Research Articles
Performance Analysis and Enhancements of Wireless NetworksAsynchronous half-duplex Direct-Sequence Code-Division Multiple-Access (DS/CDMA) is a suitable candidate for the MAC protocol design of underwater acoustic (UWA) sensor networks owing to its many attractive features. Our ad-hoc multi-hop network is ...
Throughput analysis for interference limited TDMA and TDMA-CDMA wireless ad hoc networks
The node throughput, which is defined as the total rate received at each node, is evaluated for the interference limited TDMA and TDMA-CDMA wireless ad hoc networks. In the TDMA wireless ad hoc network, there is only one transmission link connected to ...
Comments