NDLI: Secure sparse network coding for reliable routing in large scale DTMN

Content Provider	IEEE Xplore Digital Library
Author	Chanyour, T. Saadane, R. Belkasmi, M.
Copyright Year	2015
Description	Author affiliation: LASI EHTP, SIRC2S, Casablanca, Morocco (Saadane, R.) \|\| SIME Labo, Mohammed V-Rabat Univ., Rabat, Morocco (Chanyour, T.; Belkasmi, M.)
Abstract	Security issue occupies an important part in all communication system and especially for new generation networks. Among these networks, we find Delay Tolerant Mobile Networks (DTMNs) which are a class of useful but challenging networks. Combining Network Coding (NC) and clustering for routing in such networks gives more efficiency and copes with routing reliability problem among large scale networks. Our work's concern is to build a secure network coding scheme in the presence of eavesdroppers in large-scale DTMNs. Therefore, we used a cluster based routing protocol dedicated to DTMN specificities. In addition, we used Sparse Random Linear Network Coding (SRLNC) to feat low computational capabilities requirement in such networks. Furthermore, we addressed the packets retransmission decision problem for SRLNC with a fair trade-off throughput/overhead. The results are very encouraging and the proposed routing scheme has the advantage to be reliable as well as secure for large scale DTMN.
Starting Page	57
Ending Page	62
File Size	671959
Page Count	6
File Format	PDF
ISBN	9781467380959
e-ISBN	9781467380966
DOI	10.1109/RAWSN.2015.7173280
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-05-13
Publisher Place	Morocco
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Large scale DTMN DTMN Sparse random linear network coding Network coding Logic gates Secure network coding Routing Encoding Delays Decoding Clustring Reliability
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

Rank Distribution Analysis for Sparse Random Linear Network Coding

A New Efficient Secure Coding Scheme for Random Linear Network Coding

The precoding problem for sparse random linear network coding

Maximum multicast throughput by network coding on undirected hypernetworks

Singularity Probability Analysis for Sparse Random Linear Network Coding

Instantly decodable network coding protocols with unequal error protection

Rapprochement between instantly decodable and random linear network coding

Network coding and coding-aware scheduling for multicast in wireless networks

Adjustable redundancy for secure network coding in a unicast scenario

Secure sparse network coding for reliable routing in large scale DTMN

Similar Documents

Rank Distribution Analysis for Sparse Random Linear Network Coding

A New Efficient Secure Coding Scheme for Random Linear Network Coding

The precoding problem for sparse random linear network coding

Maximum multicast throughput by network coding on undirected hypernetworks

Singularity Probability Analysis for Sparse Random Linear Network Coding

Instantly decodable network coding protocols with unequal error protection

Rapprochement between instantly decodable and random linear network coding

Network coding and coding-aware scheduling for multicast in wireless networks

Adjustable redundancy for secure network coding in a unicast scenario

Secure sparse network coding for reliable routing in large scale DTMN