Reducing the Number of Forward Nodes from 1-Hop Nodes to Cover 2-Hop Nodes with Network Coding


  • Mayank Kumar Goyal Department of Computer Science & Engineering, Jaypee University of Information Technology
  • Satya Prakash Ghrera Department of Computer Science & Engineering, Jaypee University of Information Technology
  • Jai Prakash Gupta Department of Computer Science & Engineering, Lingaya’s University


Broadcasting, Broadcast Storm Problem, Collision, Contention, Flooding, MANET, Network Coding, Redundancy,


All neighbors of a node can receive a data packet conveyed by a broadcasting node in an ad-hoc wireless network. In this way, the no. of forwarding nodes is utilized as the cost criterion for propagation. Among different estimation approaches, the researcher uses 1-Hop nodes to cover entire 2- Hop nodes utilizing 2-hop region information to decrease repetitive communicates. We dissect a few deficiencies of this approach and propose an improved algorithm along with the network coding concepts in this paper. Our algorithm utilizes 2-hop neighborhood more successfully to lessen excess communicates. The Simulation results of applying this algorithm demonstrate performance improvements. Nowadays the scientists are acquainting the idea of Network coding to neighbour topology aware protocols that beats the excess number of broadcast by victimization the using XOR of data packets. We have made an endeavor to seek out the network coding gain. We’ve shown simulation, implementation and breakdown of result in various circumstances.


W. Lou and J. Wu, “On reducing broadcast redundancy in ad hoc wireless networks,” IEEE Transactions on Mobile Computing, vol. 1,no. 2, pp. 111–123, Apr.-June 2002.

C. Fragouli, J. Y. Boudec, and J. Widmer, “Network coding: An instant primer,” ACM SIGCOMM Computer Communication Review, vol. 36, no. 1, pp. 63–68, 2006.

Z. Wang, Y. Chen, and C. Li, “CORMAN: A novel cooperative opportunistic routing scheme in mobile Ad Hoc networks,” IEEE J. Sel. Areas Commun., vol. 30, no. 2, pp. 289–296, Feb. 2012.

F. T. Zohra and A. Rahman,"Mathematical analysis of self-pruning and a new dynamic probabilistic broadcast for MANETs," International Conference on : Networking Systems and Security (NSysS), pp 1-9, February 2015

H. Dhillon and H. Q. Ngo, "CQMP: A Mesh-based Multicast Routing Protocol with Consolidated Query Packets," IEEE WCNC, pp. 2168- 2174, 2005. (Pubitemid 41310831)

W. Shin et al., "Efficient 2-D mesh election algorithms for OFDMAbased wireless mesh networks", Proc. IEEE ICSPCS 2011 2011.J. Clerk Maxwell A Treatise on Electricity and Magnetism, vol. 2, pp. 68-73

Agbaria, A., Hugerat, M., & Friedman, R. (2011). Efficient and reliable dissemination in mobile Ad Hoc networks by location extrapolation. Journal of Computer Networks and Communications, 2011, 1–11.

W. Lou, J. Wu, "Toward broadcast reliability in mobile ad hoc networks with double coverage", IEEE Transactions on Mobile Computing, vol. 6, no. 2, pp. 148-163, 2007.

M.E. Hoque, F. Rahman, S.K. Kundu, A. Rahman, '‘Enhanced partial dominant pruning (EPDP) based broadcasting in ad hoc wireless networks’' (2008)

V. D. Park and M. S. Corson. Temporally-ordered routing algorithm (TORA) version 1: Functional specification. Internet Draft, 1997.

W. Peng and X.C. Lu. On the reduction of broadcast redundancy in mobile ad hoc networks. Proc. First Annual Workshop on Mobile and AdHoc Networking and Computing, MOBIHOC, pp. 129–130, Aug. 2000. Boston, USA.

C. Perkins and E. M. Royer. Ad-hoc on-demand distance vector routing. Proc. 2nd IEEE WMCSA, pp. 90–100, Feb. 1999.

A. Qayyum, L. Viennot, and A. Laouiti. Multipoint relaying for flooding broadcast message in mobile wireless networks. Proc. HICSS-35, Jan. 2002.

E. M. Royer and C. K. Toh. A review of current routing protocols for adhoc mobile wireless networks. IEEE Personal Communications, 6(2):46–55, 1999.

I. Stojmenovic, S. Seddigh, and J. Zunic. Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks. IEEE Trans. on Parallel and Distributed Systems, 13(1):14– 25, Jan. 2002.

J. Wu and H. Li. On calculating connected dominating sets for efficient routing in ad hoc wireless networks. Proc. ACM DIALM’99, pp. 7–14, august 1999.

B. Das, R. Sivakumar, and V. Bharghavan. Routing in ad-hoc networks using a virtual backbone. Proc. ICCCN’97, pages 1–20, Sept. 1997.

R. Sivakumar, B. Das, and V. Bharghavan. An improved spine-based infrastructure for routing in ad hoc networks. IEEE Symposium on Computers and Communications (ISCC) 98, 1998. Athens, Greece.

K. M. Alzoubi, P. J.Wan, and O. Frieder. New distributed algorithm for connected dominating set in wireless ad hoc networks. Proc. HICSS’35, 2002. (CD-ROM).

M. G. J. Wu, I. Stojmenovic, "On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks", Proc. Int. Conf. Parallel Processing, pp. 346-354, 2002-Aug.

F. Dai, J. Wu, "Distributed Dominant Pruning in Ad Hoc Networks", Proc. IEEE 2003 Int'l Conf. Communications (ICC 2003), pp. 353- 357, 2003.

M. A. Spohn and J. J. Garcia-Luna-Aceves, "Enhanced dominant pruning applied to the route discovery process of on-demand routing protocols," in Proceedings of the 12th IEEE ICCCN, October 2003.




How to Cite

Goyal, M. K., Ghrera, S. P., & Gupta, J. P. (2017). Reducing the Number of Forward Nodes from 1-Hop Nodes to Cover 2-Hop Nodes with Network Coding. Journal of Telecommunication, Electronic and Computer Engineering (JTEC), 9(3-6), 13–17. Retrieved from