Abstract
We consider data transmission in a wireless multi-hop network, where node failures may occur and it is risky to send over a single path. As the stations may transmit at the same time, we apply the Cai-Lu-Wang collision avoidance scheme. We assume that the nodes know only their neighbors and there is no global coordination. The routing strategy is to transmits to all nodes that are in some sense closer to the destination node.
We analyze propagation strategy for the case that the nodes know only the nodes in their propagation range and there is no global coordination of the network. Instead, a node transmits to all nodes that appear in some sense closer to the destination node. We investigate data propagation speed in such networks, namely the delay due to conflict resolution.
In order to understand the phenomena arising there we focus on a fundamental case called a braid chain. We prove that for a braid chain of n layers the normalized delay due to anti-collision mechanism is \({\approx }0.28 n \cdot \varDelta \) (while the expected time for a chain of single stations is \(0.5n \cdot \varDelta \)), where \(\varDelta \) stands for the time interval length of Cai-Lu-Wang scheme. We also show that the behavior of the braid chain rapidly converges to its stationary distribution with the length of the chain. For these results we develop analytical methods that can be applied for other networks, e.g. for the case when the forwarding delays are chosen with exponential distribution.
Supported by National Science Centre, project HARMONIA, decision DEC-2013/08/M/ST6/00928.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
A reader interested in deriving them is advised to use a symbolic computations program.
References
Baquero, C., Almeida, P.S., Menezes, R.: Fast estimation of aggregates in unstructured networks. In: ICAS, pp. 88–93. IEEE Computer Society (2009)
Cai, Z., Lu, M., Wang, X.: Distributed initialization algorithms for single-hop ad hoc networks with minislotted carrier sensing. IEEE Trans. Parallel Distrib. Syst. 14(5), 516–528 (2003)
Cichoń, J., Klonowski, M.: On flooding in the presence of random faults. Fundam. Inform. 123(3), 273–287 (2013)
Cichoń, J., Lemiesz, J., Zawada, M.: On message complexity of extrema propagation techniques. In: Li, X.-Y., Papavassiliou, S., Ruehrup, S. (eds.) ADHOC-NOW 2012. LNCS, vol. 7363, pp. 1–13. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-31638-8_1
Cichoń, J., Gebala, M., Zawada, M.: Fault tolerant protocol for data collecting in wireless sensor networks. In: The 22nd IEEE Symposium on Computers and Communications, July 2017
Feller, W.: An Introduction to Probability Theory and Its Applications, vol. 2, 2nd edn. Wiley, New York (1971)
Flajolet, P., Sedgewick, R.: Analytic Combinatorics, 1st edn. Cambridge University Press, New York (2009)
Lindvall, T.: Lectures on the Coupling Method. A Wiley-Interscience Publication, New York (1992)
Mosk-Aoyama, D., Shah, D.: Computing separable functions via gossip. In: ACM PODC 2006, pp. 113–122. ACM (2006)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Cichoń, J., Kutyłowski, M., Wolny, K. (2017). Braid Chain Radio Communication. In: Fernández Anta, A., Jurdzinski, T., Mosteiro, M., Zhang, Y. (eds) Algorithms for Sensor Systems. ALGOSENSORS 2017. Lecture Notes in Computer Science(), vol 10718. Springer, Cham. https://doi.org/10.1007/978-3-319-72751-6_17
Download citation
DOI: https://doi.org/10.1007/978-3-319-72751-6_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-72750-9
Online ISBN: 978-3-319-72751-6
eBook Packages: Computer ScienceComputer Science (R0)