Adhoc Network – Energy Efficient Networking in XOR and Random Linear Network Coding
N. Thangamani1
Correspondence should be addressed to: ADHOC, Random Linear Network Coding, Connected Dominating Set.
Section:Research Paper, Product Type: Journal Paper
Volume-6 ,
Issue-7 , Page no. 1267-1270, Jul-2018
CrossRef-DOI: https://doi.org/10.26438/ijcse/v6i7.12671270
Online published on Jul 31, 2018
Copyright © N. Thangamani . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
View this paper at Google Scholar | DPI Digital Library
How to Cite this Paper
- IEEE Citation
- MLA Citation
- APA Citation
- BibTex Citation
- RIS Citation
IEEE Style Citation: N. Thangamani, “Adhoc Network – Energy Efficient Networking in XOR and Random Linear Network Coding,” International Journal of Computer Sciences and Engineering, Vol.6, Issue.7, pp.1267-1270, 2018.
MLA Style Citation: N. Thangamani "Adhoc Network – Energy Efficient Networking in XOR and Random Linear Network Coding." International Journal of Computer Sciences and Engineering 6.7 (2018): 1267-1270.
APA Style Citation: N. Thangamani, (2018). Adhoc Network – Energy Efficient Networking in XOR and Random Linear Network Coding. International Journal of Computer Sciences and Engineering, 6(7), 1267-1270.
BibTex Style Citation:
@article{Thangamani_2018,
author = {N. Thangamani},
title = {Adhoc Network – Energy Efficient Networking in XOR and Random Linear Network Coding},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {7 2018},
volume = {6},
Issue = {7},
month = {7},
year = {2018},
issn = {2347-2693},
pages = {1267-1270},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=2597},
doi = {https://doi.org/10.26438/ijcse/v6i7.12671270}
publisher = {IJCSE, Indore, INDIA},
}
RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v6i7.12671270}
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=2597
TI - Adhoc Network – Energy Efficient Networking in XOR and Random Linear Network Coding
T2 - International Journal of Computer Sciences and Engineering
AU - N. Thangamani
PY - 2018
DA - 2018/07/31
PB - IJCSE, Indore, INDIA
SP - 1267-1270
IS - 7
VL - 6
SN - 2347-2693
ER -
VIEWS | XML | |
388 | 266 downloads | 259 downloads |
Abstract
RLNC-based broadcasting and introduce an analytical model that captures the performance of coding-based broadcast schemes. This paper proposes a new design a novel RLNC-based broadcast algorithm that for the first time applies RLNC over CDS-based broadcasting. The proposed algorithm provides a more systematic pruning of redundant transmissions without compromising RLNC’s efficiency. We also investigate generation management that is a key issue in RLNC and introduce a new distributed scheme that is suitable for mobile environments. Finally, through extensive simulations, we show that the proposed algorithm outperforms XOR-based as well as RLNC-based schemes even when global knowledge is used for managing packet generations.
Key-Words / Index Term
References
[1] A. Vahdat, D. Becker, et al., “Epidemic routing for partially connected ad hoc networks,” in Duke University, CS-200006,2000.
[2] D. Miorandi, S. Sicari, F. D. Pellegrini, and I. Chlamtac, “Internet of things: Vision, applications and research challenges,” Ad Hoc Networks, vol. 10, no. 7, pp. 1497 – 1516, 2012.
[3] D. G. Reina, S. L. Toral, F. Barrero, N. Bessis, and E. Asimakopoulou, “The role of ad hoc networks in the internet of things: A case scenario for smart environments,” in Internet of Things and Inter-cooperative Computational Technologies for Collective Intelligence (N. Bessis, F. Xhafa, D. Varvarigou, R. Hill, and M. Li, eds.), pp. 89–113, Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.
[4] P. Bellavista, G. Cardone, A. Corradi, and L. Foschini, “Convergence of manet and wsn in iot urban scenarios,” IEEE Sensors Journal, vol. 13, no. 10, pp. 3558– 3567, 2013.
[5] G. Fanti, Y. B. David, S. Benthall, E. Brewer, and S. Shenker, “Rangzen: Circumventing government-imposed communication blackouts,” University of California, Berkeley, Tech. Rep. UCB/EECS-2013-128, 2013.
[6] F. Rebecchi, M. D. de Amorim, V. Conan, A. Passarella, R. Bruno, and M. Conti, “Data offloading techniques in cellular networks: A survey,” IEEE Communications Surveys Tutorials, vol. 17, no. 2, pp. 580–603, 2015.
[7] M. Conti and S. Giordano, “Mobile ad hoc networking: milestones, challenges, and new research directions,” IEEE Communications Magazine, vol. 52, no. 1, pp. 85–96, 2014.
[8] V. F. Mota, F. D. Cunha, D. F. Macedo, J. M. Nogueira, and A. A. Loureiro, “Protocols, mobility models and tools in opportunistic networks: A survey,” Computer Communications, vol. 48, pp. 5 – 19, 2014.
[9] B. Williams and T. Camp, “Comparison of Broadcasting Techniques for Mobile Ad Hoc Networks,” in ACM Proc. Int. Symp. Mobile Ad Hoc Networking & Computing (MobiHoc), pp. 194–205, 2002.
[10] P. Ruiz and P. Bouvry, “Survey on Broadcast Algorithms for Mobile Ad Hoc Networks,” ACM Comput. Surv., vol. 48, no. 1, pp. 8:1–8:35, 2015.
[11] I. Stojmenovic and J. Wu, “Broadcasting and activity scheduling in ad hoc networks,” in Mobile Ad Hoc Networking (S. Basagni, M. Conti, S. Giordano, and I. Stojmenovic, eds.), ch. 7, pp. 205–229, Wiley-IEEE Press, 2005.
[12] O. Liang, Y. A. Sekercioglu, and N. Mani, “A survey of multipoint relay based broadcast schemes in wireless ad hoc networks,” IEEE Communications Surveys & Tutorials, vol. 8, no. 4, pp. 30–46, 2006.
[13] D. Reina, S. Toral, P. Johnson, and F. Barrero, “A survey on probabilistic broadcast schemes for wireless ad hoc networks,” Ad Hoc Networks, vol. 25, Part A, pp. 263 – 292, 2015.
[14] M. Abolhasan, T. Wysocki, and E. Dutkiewicz, “A review of routing protocols for mobile ad hoc networks,” Elsevier Ad hoc Networks, vol. 2, no. 1, pp. 1–22, 2004.
[15] A. Boukerche, B. Turgut, N. Aydin, M. Z. Ahmad, L. Bölöni, and D. Turgut, “Routing protocols in ad hoc networks: A survey,” Computer Networks, vol. 55, no. 13, pp. 3032 – 3080, 2011.