NDLI: On network coding in wireless ad-hoc networks

Content Provider	IEEE Xplore Digital Library
Author	Jingyao Zhang Pingyi Fan
Copyright Year	2005
Description	Author affiliation: Dept. of Electron. Eng., Tsinghua Univ., Beijing (Jingyao Zhang; Pingyi Fan)
Abstract	Network coding has been proven to be an effective way to achieve the maximum flow capacity in a multicast network, which is bounded by the famous maximum-flow minimum-cut theorem. This technique is specially fit for some new types of network, e.g., ad-hoc, sensor network etc. In order to reduce the cost and complexity of network coding, rather than carrying out encoding at all the nodes along the routes of traffic flow, it is better to find out the nodes that need encoding, and perform the coding algorithm at these nodes only, so that the number of encoding nodes are as few as possible. Fragouli et al. (2004) presented a method to get the encoding nodes by subtree decomposition. In this paper, we take a random graph as the model of wireless ad-hoc multicast network, and apply a modified Ford-Fulkerson algorithm to obtain the maximum flow and encoding nodes in an undirected graph. Its correctness can be proven in theory. Furthermore, simulations are done in different conditions to get some meaningful results of this scheme. We also investigate the statistical properties of encoding nodes and maximum flow in ad-hoc multicast networks by random graph theory. We showed that the number of encoding nodes is approximately binomial-distributed, and as the size of the network tends to infinite, it is approximately a Poisson distribution
Starting Page	8
Ending Page	8
File Size	173128
Page Count	1
File Format	PDF
ISBN	9810545738
DOI	10.1109/MTAS.2005.207127
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2005-11-15
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Mobility Organising Committee
Subject Keyword	maximum-flow minimum-cut Costs random graph Telecommunication traffic Ad hoc networks Encoding Graph theory Electronic mail Ford-Fulkerson Algorithm multicast network Multicast algorithms Ad-hoc network Network coding Traffic control Communication networks
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in