Abstract
The attention that the scientific community has paid to the use of Network Coding techniques over Wireless Mesh Networks has remarkably increased in the last years. A large group of the existing proposals are based on the combination of packets belonging to different flows, so as to reduce the number of real transmissions over the wireless channels. This would eventually lead to better performances, together with an energy-aware operation. However, there are certain aspects that might prevent their use. In this paper we empirically study one of these deterrents; we propose an algorithm to establish the feasibility of applying Network Coding over random topologies, by identifying a set of nodes that might be able to act as coding entities. Besides, we discuss the appropriateness of such selection, by comparing the lengths of the corresponding paths. The results show that the probability of promoting these techniques is rather low.
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.
Recall that the Inter-flow coding scheme we are studying encodes packets belonging to different data streams.
- 2.
- 3.
Typically, these are propagated within the topology, reaching the destination node thanks to the physical broadcast nature of wireless links.
References
The ns-3 network simulator. http://www.nsnam.org/
Ahlswede, R., Cai, N., Li, S.Y., Yeung, R.: Network information flow. IEEE Trans. Inf. Theory 46(4), 1204–1216 (2000)
Chachulski, S., Jennings, M., Katti, S., Katabi, D.: Trading structure for randomness in wireless opportunistic routing. In: Proceedings of the 2007 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, SIGCOMM 2007, ACM, New York, NY, USA, pp. 169–180 (2007). http://doi.acm.org/10.1145/1282380.1282400
Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269–271 (1959)
Gómez, D., Hassayoun, S., Herrero, A., Agüero, R., Ros, D.: Impact of network coding on TCP performance in wireless mesh networks. In: 2012 IEEE Proceedings of 23th International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC), September 2012
Gómez, D., Hassayoun, S., Herrero, A., Agüero, R., Ros, D., García-Arranz, M.: On the addition of a network coding layer within an open connectivity services framework. In: Timm-Giel, A., Strassner, J., Agüero, R., Sargento, S., Pentikousis, K. (eds.) MONAMI 2012. LNICST, vol. 58, pp. 298–312. Springer, Heidelberg (2013)
Guo, B., Li, H., Zhou, C., Cheng, Y.: Analysis of general network coding conditions and design of a free-ride-oriented routing metric. IEEE Trans. Veh. Technol. 60(4), 1714–1727 (2011)
Hunderbøll, M., Ledet-Pedersen, J., Heide, J., Pedersen, M., Rein, S., Fitzek, F.: CATWOMAN: Implementation and Performance Evaluation of IEEE 802.11 Based Multi-Hop Networks Using Network Coding
Katti, S., Rahul, H., Hu, W., Katabi, D., Médard, M., Crowcroft, J.: XORs in the air: practical wireless network coding. IEEE/ACM Trans. Netw. 16(3), 497–510 (2008)
Koetter, R., Médard, M.: An algebraic approach to network coding. In: Proceedings of 2001 IEEE International Symposium on Information Theory, p. 104 (2001)
Le, J., Lui, J.S., Chiu, D.M.: DCAR: distributed coding-aware routing in wireless networks. IEEE Trans. Mob. Comput. 9(4), 596–608 (2010)
Li, S.Y., Yeung, R., Cai, N.: Linear network coding. IEEE Trans. Inf. Theory 49(2), 371–381 (2003)
Neumann, A., Aichele, C., Lindner, M., Wunderlich, S.: ABetter Approach To Mobile Ad-hoc Networking (B.A.T.M.A.N.). IETF Internet Draft - work in progress 07, individual, April 2008. http://tools.ietf.org/html/draft-wunderlich-openmesh-manet-routing-00
ParandehGheibi, A., Ozdaglar, A., Effros, M., Médard, M.: Optimal reverse carpooling over wireless networks - a distributed optimization approach. In: 2010 44th Annual Conference on Information Sciences and Systems (CISS), pp. 1–6, March 2010
Sengupta, S., Rayanchu, S., Banerjee, S.: An analysis of wireless network coding for unicast sessions: the case for coding-aware routing. In: 26th IEEE International Conference on Computer Communications, INFOCOM 2007, pp. 1028–1036. IEEE, May 2007
Traskov, D., Ratnakar, N., Lun, D.S., Koetter, R., Médard, M.: Network coding for multiple unicasts: an approach based on linear optimization. IEEE Int. Symp. Inf. Theory 52, 6 (2006)
Wu, Y.: Information exchange in wireless networks with network coding and physical-layer broadcast (2004)
Yen, J.Y.: Finding the lengths of all shortest paths in n-node nonnegative-distance complete networks using 12n3 additions and n3 comparisons. J. ACM 19(3), 423–424 (1972). http://doi.acm.org/10.1145/321707.321712
Acknowledgements
This work has been supported by the Spanish Government by its funding through the COSAIF project, “Connectivity as a Service: Access for the Internet of the Future” (TEC2012-38754-C02-02).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Garrido, P., Gómez, D., Santos, F., Agüero, R. (2015). On the Feasibility of Inter-flow Network Coding Over Random Wireless Mesh Networks. In: Agüero, R., Zinner, T., Goleva, R., Timm-Giel, A., Tran-Gia, P. (eds) Mobile Networks and Management. MONAMI 2014. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 141. Springer, Cham. https://doi.org/10.1007/978-3-319-16292-8_19
Download citation
DOI: https://doi.org/10.1007/978-3-319-16292-8_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-16291-1
Online ISBN: 978-3-319-16292-8
eBook Packages: Computer ScienceComputer Science (R0)