skip to main content
10.1145/1540343.1540353acmconferencesArticle/Chapter ViewAbstractPublication PagesmobihocConference Proceedingsconference-collections
research-article

Can a packet walk straight through a field of randomly dying location-unaware wireless nodes?

Published: 18 May 2009 Publication History

Abstract

A protocol, dubbed BeSpoken, steers data transmissions along a straight path called a spoke through a wireless sensor network with many location-unaware nodes. BeSpoken implements a simple, spatially recursive communication process, where a set of control packets and a data packet are exchanged among daisy-chained relays that constitute the spoke. It directs data transmissions by randomly selecting relays from crescent-shaped areas along the spoke axis created by intersecting transmission ranges of control and data packets. To specify design rules for protocol parameters that minimize energy consumption while ensuring that spokes propagate far enough and have a limited wobble with respect to the spoke axis, our model of the spoke propagation matches the protocol parameters to the density of network nodes, assuming that nodes are spatially distributed as a Poisson point process of known uniform intensity. To avoid this requirement, we propose and characterize an adaptive mechanism that ensures desired spoke propagation in a network of arbitrary density. This necessitates a qualitatively new protocol model used to evaluate the spoke propagation under both the basic and the adaptive protocol. The introduced adaptive mechanism repairs the spoke when the crescent-shaped area is empty which may occur in the case of network thinning and as a result of random or arbitrary sensor death. Our analytical and simulation results demonstrate that the adaptive BeSpoken creates longer spokes both in networks with uniform distribution of nodes and in networks with holes. In addition, the adaptive protocol is significantly less sensitive to changes in the distribution of network nodes and their density.

References

[1]
P. Bose et al. "Routing with guaranteed delivery in ad hoc wireless networks," Proc. of the 3rd Int. Workshop on Discrete Algorithms and methods for mobile computing and communications (DialM), 1999.
[2]
Q. Fang et al. "GLIDER:Gradient landmark-based distributed routing for sensor networks," Proc. of the 24th Conference of the IEEE Communication Society (INFOCOM), 2005.
[3]
J. Heidemann, F. Silva, and D. Estrin. Matching data dissemination algorithms to application requirements. In ACM SenSys Conference, Los Angeles, California, USA, pages 218--229, Nov 2003.
[4]
W.R. Heinzelman, J. Kulik, and H. Balakrishnan. Adaptive protocols for information dissemination in wireless sensor network. In Proc. of ACM MobiCom 1999, 1999.
[5]
K. Holger and A. Willig. Protocols and Architectures for Wireless Sensor Networks. J. Wiley, 2005.
[6]
C. Intanagonwiwat et al. Directed diffusion for wireless sensor networking. IEEE/ACM Transactions on Networking (TON), 11(1):2--16, 2003.
[7]
B. Karp and H. Kung. Gpsr: Greedy perimeter stateless routing for wireless networks. In Proc. of the 6th MOBICOM, 2000.
[8]
S. Kokalj-Filipovic, P. Spasojevic, and R. Yates. Bespoken protocol for data dissemination in wireless sensor networks. In SpaSWIN 2007 workshop. IEEE, April 2007.
[9]
S. Kokalj-Filipovic, R. Yates, and P. Spasojevic. Random walk models for geographic data propagation in wireless sensor networks. In CISS 2007. IEEE, March 2007.
[10]
J.C. Navas and T. Imielinski. Geocast -- geographic addressing and routing. In ACM/IEEE Int. Conf. on Mobile Computing and Networking (MobiCom), Sep 1997.
[11]
S. Ni et al. The broadcast storm problem in a mobile ad hoc network. In Proc. 5th ACM/IEEE MOBICOM, 1999.
[12]
L. Guibas, Q. Fang, and J. Gao. Landmark-based information storage and retrieval in sensor networks. In Proc. of INFOCOM'06, 2006.
[13]
D. Stoyan, W.S. Kendall, and J. Mecke. Stochastic Geometry and its Applications. J. Wiley, 1995.
[14]
H. Takagi and L. Kleinrock. Optimal transmission ranges for randomly distributed packet radio terminals. IEEE Trans. on Comms., 1984.

Index Terms

  1. Can a packet walk straight through a field of randomly dying location-unaware wireless nodes?

        Recommendations

        Comments

        Information & Contributors

        Information

        Published In

        cover image ACM Conferences
        FOWANC '09: Proceedings of the 2nd ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
        May 2009
        104 pages
        ISBN:9781605585239
        DOI:10.1145/1540343
        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Sponsors

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        Published: 18 May 2009

        Permissions

        Request permissions for this article.

        Check for updates

        Author Tags

        1. adaptive
        2. directional propagation
        3. location-unaware nodes
        4. network thinning
        5. random walk
        6. stochastic model
        7. wireless

        Qualifiers

        • Research-article

        Conference

        MobiHoc '09
        Sponsor:

        Contributors

        Other Metrics

        Bibliometrics & Citations

        Bibliometrics

        Article Metrics

        • 0
          Total Citations
        • 110
          Total Downloads
        • Downloads (Last 12 months)0
        • Downloads (Last 6 weeks)0
        Reflects downloads up to 17 Feb 2025

        Other Metrics

        Citations

        View Options

        Login options

        View options

        PDF

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        Figures

        Tables

        Media

        Share

        Share

        Share this Publication link

        Share on social media