skip to main content
article

On the delay performance of in-network aggregation in lossy wireless sensor networks

Published: 01 April 2014 Publication History

Abstract

In this paper, we study the implication of wireless broadcast for data aggregation in lossy wireless sensor networks. Each sensor node generates information by sensing its physical environment and transmits the data to a special node called the sink, via multihop communications. The goal of the network system is to compute a function at the sink from the information gathered by spatially distributed sensor nodes. In the course of collecting information, in-network computation at intermediate forwarding nodes can substantially increase network efficiency by reducing the number of transmissions. On the other hand, it also increases the amount of the information contained in a single packet and makes the system vulnerable to packet loss. Instead of retransmitting lost packets, which incurs additional delay, we develop a wireless system architecture that exploits the diversity of the wireless medium for reliable operations. To elaborate, we show that for a class of aggregation functions, wireless broadcasting is an effective strategy to improve delay performance while satisfying reliability constraint. We provide scaling law results on the performance improvement of our solution over unicast architecture with retransmissions. Interestingly, the improvement depends on the transmission range as well as the reliability constraint.

References

[1]
A. Giridhar and P. R. Kumar, "Toward a theory of in-network computation in wireless sensor networks," IEEE Commun. Mag., vol. 44, no. 4, pp. 98-107, Apr. 2006.
[2]
R. G. Gallager, "Finding parity in a simple broadcast network," IEEE Trans. Inf. Theory, vol. 34, no. 2, pp. 176-180, Mar. 1988.
[3]
E. Kushilevitz and Y. Mansour, "Computation in noisy radio networks," SIAM J. Discrete Math., vol. 19, no. 1, pp. 96-108, 2005.
[4]
L. Ying, R. Srikant, and G. Dullerud, "Distributed symmetric function computation in noisy wireless sensor networks," IEEE Trans. Inf. Theory, vol. 53, no. 12, pp. 4826-4833, Dec. 2007.
[5]
L. L. Peterson and B. S. Davie, Computer Networks: A Systems Approach, 3rd Edition. San Francisco, CA, USA: Morgan Kaufmann, 2003.
[6]
A. Giridhar and P. R. Kumar, "Computing and communicating functions over sensor networks," IEEE J. Sel. Areas Commun., vol. 23, no. 4, pp. 755-764, Apr. 2005.
[7]
S. Kamath and D. Manjunath, "On distributed function computation in structure-free random networks," in Proc. IEEE ISIT, Jul. 2008, pp. 647-651.
[8]
C. Li and H. Dai, "Towards efficient designs for in-network computing with noisy wireless channels," in Proc. IEEE INFOCOM, Mar. 2010, pp. 1-8.
[9]
J. Zhao, R. Govindan, and D. Estrin, "Computing aggregates for monitoring wireless sensor networks," in Proc. IEEE Int. Workshop Sensor Netw. Protocols Appl., May 2003, pp. 139-148.
[10]
J.-Y. Chen, G. Pandurangan, and D. Xu, "Robust computation of aggregates in wireless sensor networks: Distributed randomized algorithms and analysis," in Proc. IPSN, 2005, p. 46.
[11]
N. Khude, A. Kumar, and A. Karnik, "Time and energy complexity of distributed computation in wireless sensor networks," in Proc. IEEE INFOCOM, 2005, vol. 4, pp. 2625-2637.
[12]
S. A. Hofmeyr, A. Somayaji, and S. Forrest, "Intrusion detection using sequences of system calls," J. Comput. Security, vol. 6, pp. 151-180, 1998.
[13]
E. D. Manley, H. A. Nahas, and J. S. Deogun, "Localization and tracking in sensor systems," in Proc. IEEE Int. Conf. Sensor Netw., Ubiq., Trustworthy Comput., Jun. 2006, vol. 2, pp. 237-242.
[14]
Z. Wang and J. Crowcroft, "Eliminating periodic packet losses in the 4.3-Tahoe BSD TCP congestion control algorithm," Comput. Commun. Rev., vol. 22, no. 2, pp. 9-16, April 1992.
[15]
S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, "Randomized gossip algorithm," IEEE/ACM Trans. Netw., vol. 14, no. 3, pp. 2508-2530, Jun. 2006.
[16]
P. Gupta and P. R. Kumar, "The capacity of wireless networks," IEEE Trans. Inf. Theory, vol. 46, no. 2, pp. 388-404, Mar. 2000.
[17]
P. Gupta and P. R. Kumar, "Critical power for asymptotic connectivity in wireless networks," in Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W.H. Fleming. Cambridge, MA, USA: Birkhauser, 1998, pp. 547-566.
[18]
S. Kulkarni, A. Iyer, and C. Rosenberg, "An address-light, integrated MAC and routing protocol for wireless sensor networks," IEEE/ACM Trans. Netw., vol. 14, no. 4, pp. 793-806, Aug. 2006.
[19]
Y. Zhou and M. Medidi, "Sleep-based topology control for wakeup scheduling in wireless sensor networks," in Proc. IEEE SECON, Jun. 2007, pp. 304-313.
[20]
W. Pak, J.-G. Choi, and S. Bahk, "Tier based anycast to achieve maximum lifetime by duty cycle control in wireless sensor networks," in Proc. IWCMC, Aug. 2008, pp. 123-128.

Cited By

View all

Index Terms

  1. On the delay performance of in-network aggregation in lossy wireless sensor networks

        Recommendations

        Comments

        Information & Contributors

        Information

        Published In

        cover image IEEE/ACM Transactions on Networking
        IEEE/ACM Transactions on Networking  Volume 22, Issue 2
        April 2014
        339 pages
        ISSN:1063-6692
        • Editor:
        • R. Srikant
        Issue’s Table of Contents

        Publisher

        IEEE Press

        Publication History

        Published: 01 April 2014
        Accepted: 24 March 2013
        Received: 10 June 2012
        Published in TON Volume 22, Issue 2

        Author Tags

        1. data aggregation
        2. delay performance
        3. lossy wireless networks

        Qualifiers

        • Article

        Contributors

        Other Metrics

        Bibliometrics & Citations

        Bibliometrics

        Article Metrics

        • Downloads (Last 12 months)4
        • Downloads (Last 6 weeks)1
        Reflects downloads up to 06 Jan 2025

        Other Metrics

        Citations

        Cited By

        View all

        View Options

        Login options

        Full Access

        View options

        PDF

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        Media

        Figures

        Other

        Tables

        Share

        Share

        Share this Publication link

        Share on social media