Call for Paper - January 2023 Edition
IJCA solicits original research papers for the January 2023 Edition. Last date of manuscript submission is December 20, 2022. Read More

The Network Coding based on Marked Packets

Print
PDF
International Journal of Computer Applications
© 2013 by IJCA Journal
Volume 77 - Number 6
Year of Publication: 2013
Authors:
Nadia Al-rousan
Hazem Al-najjar
10.5120/13398-1046

Nadia Al-rousan and Hazem Al-najjar. Article: The Network Coding based on Marked Packets. International Journal of Computer Applications 77(6):18-23, September 2013. Full text available. BibTeX

@article{key:article,
	author = {Nadia Al-rousan and Hazem Al-najjar},
	title = {Article: The Network Coding based on Marked Packets},
	journal = {International Journal of Computer Applications},
	year = {2013},
	volume = {77},
	number = {6},
	pages = {18-23},
	month = {September},
	note = {Full text available}
}

Abstract

In N–sinks and N-sources network, if the number of the received packets from the source is less than the number of the required packets to solve the linear independence relationship in the sink side, then the sink node will not be able to retrieve the event correctly. Therefore, in this paper, a new approach was designed to enhance the total number of meaningful packets (the true packets that describe the event without redundancy and malicious packets), throughput and availability in the network. The new approach was designed to enhance weighted and un-weighted network, taking into consideration two network types: wired and wireless networks. In the wireless networks, a simple approach was suggested to convert the wireless network to a graph problem. On another hand, a new reconstruction algorithm for the network topology was suggested by using extra information in the incoming packets. However, after analyzing the proposed algorithms and models, the proposed system achieved lower overhead, higher availability, lower traffic, and maximum lifetime.

References

  • R. Ahlswede, C. Ning, S. Y. R. Li, and R. W. Yeung, "Network information ?ow," Information Theory, IEEE Transactions on, vol. 46, no. 4, pp. 1204–1216, 2000.
  • J. Meng and X. Pan, "The Optimization Study of Network Coding for Coding-Aware Wireless MESH Networks," 2nd International Conference on Future Computer and Communication, 2010.
  • J. Yang?B. Dai, B. Huang, C. Huang, "Topology Awareness of hierarchical Peer-to-Peer Network based on Network Coding with Feedback," 2nd International Workshop on Intelligent Systems and Applications (ISA), 2010.
  • M. Langberg, A. Sprintson, J. Bruck, "The Encoding Complexity of Network Coding," Information Theory, IEEE Transactions on, vol. 52, no. 6,pp. 2386 – 2397,2006.
  • W. Cheng, L. Yu, F. Xiong and W. Wang, "Trusted Network Coding in Wireless Ad Hoc Networks," in IEEE Globecom, 2010.
  • X. Hu, M. Leeson and E. Hines, "Dynamic Network Coding Problem: An Evolutionary Approach," 5th International Conference on Wireless Communications, Networking and Mobile Computing WiCom '09, 2009.
  • S. Y. Oh, M. Gerla, "Protecting Network Coded Packets in Coalition Networks," 7th IEEE/IFIP international Conf. on Wireless On-demand Network Systems and Services (WONS), 2010.
  • S. Banu and R. Dhanasekaran "A New Multipath Routing Approach for Energy Efficiency in Wireless Sensor Networks," International Journal of Computer Applications, Volume 55– No. 11, October 2012.
  • S. C. Chabalala,T. N. Muddenahalli and F. Takawira "Energy-Efficient Dynamic Source Routing Protocol for Wireless Sensor Networks," IJCSNS International Journal of Computer Science and Network Security, VOL. 12 No. 10, October 2012.
  • P. Spachos, P. Chatzimisios and D. Hatzinakos "Cognitive Networking with Opportunistic Routing in Wireless Sensor Networks," IEEE ICC 2013 - Communication QoS, Reliability and Modeling Symposium,2013