Optimal sub-graph selection over coded networks with delay and limited-size buffering

Ghasvari, Hossein; Raayatpanah, Mohammad Ali; Khalaj, Babak Hossein; Bakhshi, Hamidreza

doi:10.1049/iet-com.2010.0612

Cited by 14 publications

(11 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Firstly, the constraint (14) is used to replace the constraint (8). Specifically, the constraint (14) is equivalent to…”

Section: Constraint(10)mentioning

confidence: 99%

“…Related studies have proved that LNC not only can make the multicast transmission reach the theoretical upper bound of throughput [7,8] but also can provide information confidentiality due to its inherent characteristics [9]. Specifically, when applying LNC to multicast communication, the data information transmitted in the network is no longer the original data chunk, but the linear combination of original data chunks, which is called the encoded packet.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Secure Data Delivery with Linear Network Coding for Multiple Multicasts with Multiple Streams in Internet of Things

Shi

Wang

Peng

2018

Security and Communication Networks

View full text Add to dashboard Cite

With the rapid developments of Internet of Things (IoT), tremendous number of sensors are deployed in the environment to monitor and collect different types of information. When a group of sensors located with the same location (or area) should deliver their data to a set of users and they have connected with the same network device, e.g., base station or access point, the data delivery between them and their users can be treated as a single source multicast in the core network from the network device connected with them to the network devices connected with their users. Generally, in such a case, multiple multicast sessions exist in the network simultaneously. In this paper, we study two major considerations, i.e., transmission throughput and information security, for multiple multicasts with multiple streams in IoT by using linear network coding (LNC). Specifically, we jointly consider the transmission rate allocation, transmission topology selection, and secure LNC design for multiple multicasts to maximize the total secure weighted throughput (SWT), which is referred to as the secure delivery for multiple multicasts with multiple streams (SMMS) problem. To this end, we firstly consider the SMMS problem in the case that each sensor is connected with a fixed network device. We then study the SMMS problem when the source of each multicast can be selected from a set of nodes. For the first case, we formulate it to be a linear programming (LP), based on which we give the MORT algorithm to optimally solve it. On the other hand, for the second case, we first formulate it to be an integer linear programming (ILP) and then propose an efficient MBLP algorithm based on linear programming relaxation to obtain a suboptimal solution. Finally, we conduct extensive simulations to show the effectiveness and efficiency of the proposed algorithms.

show abstract

“…Firstly, the constraint (14) is used to replace the constraint (8). Specifically, the constraint (14) is equivalent to…”

Section: Constraint(10)mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Secure Data Delivery with Linear Network Coding for Multiple Multicasts with Multiple Streams in Internet of Things

Shi

Wang

Peng

2018

Security and Communication Networks

View full text Add to dashboard Cite

show abstract

“…In the same vein reference [18] considered the problem of finding a minimum cost multicast subgraph based on network coding, where delay values associated with each link is the only performance metrics taken into consideration, inadequate buffer-size of intermediate nodes and link capacity variations were taken into account. The decentralized algorithm proposed uses an auxiliary timeexpanded network.…”

Section: Review Of Some Multicast Algorithmmentioning

confidence: 99%

Multicast Algorithms over Wireless Networks Using Network Coding: A Review

Adedokun

Soja²,

Tekanyi³

2015

COM

View full text Add to dashboard Cite

Multicasting over wireless network has been an area of intensive research and many researchers have employed the use of algorithms for addressing multicast problems. With the fast development in technology and the use of multimedia applications, efficient multicasting over the internet is taking the center stage. For this back drop, the review of some multicast algorithms over wireless network becomes compulsory with the aim of addressing some of the challenges encountered and seeing the possibilities of implementing these algorithms in real time situations. In this paper, we have reviewed some multicast algorithms developed based on network coding based multicast with the view of recognizing some of their strengths and weakness in order to open wide areas for future research and applications.

show abstract

“…In addition, NC was shown to be in close relationship with other areas of research such as information theory [11,12], graph theory [13], coding theory [14,15], matroid theory [16,17] and complexity theory [18,3]. In the last decade, capacity-achieving network codes have been designed for numerous practical settings, the theoretical complexity of several fundamental network coding problems have been established and efficient algorithms developed.…”

Section: Introduction To Network Codingmentioning

confidence: 97%

Instantly Decodable Network Coding: From Centralized to Device-to-Device Communications

Douik

Sorour

Al-Naffouri

et al. 2017

IEEE Commun. Surv. Tutorials

View full text Add to dashboard Cite

Instantly Decodable Network Coding: From Centralized to Device-to-Device Communications Ahmed DouikFrom its introduction to its quindecennial, network coding has built a strong reputation in enhancing the packet recovery process and achieving maximum information flow in both wired and wireless networks. Traditional studies focused on optimizing the throughput of the network by proposing complex schemes that achieve optimal delay. With the shift toward distributed computing on mobile devices, throughput and complexity become both critical factors that affect the efficiency of a coding scheme. Instantly decodable network coding imposed itself as a new paradigm in network coding that trades off these two aspects. This paper presents a survey of instantly decodable network coding schemes that are proposed in the literature. The various schemes are identified, categorized and evaluated. Two categories can be distinguished namely the conventional centralized schemes and the distributed or cooperative schemes. For each scheme, the comparison is carried out in terms of reliability, performance, complexity and packet selection methodology. Although the performance is generally inversely proportional to the computation complexity, numerous successful schemes from both the performance and complexity viewpoint are identified.

show abstract

Optimal sub-graph selection over coded networks with delay and limited-size buffering

Cited by 14 publications

References 15 publications

Secure Data Delivery with Linear Network Coding for Multiple Multicasts with Multiple Streams in Internet of Things

Secure Data Delivery with Linear Network Coding for Multiple Multicasts with Multiple Streams in Internet of Things

Multicast Algorithms over Wireless Networks Using Network Coding: A Review

Instantly Decodable Network Coding: From Centralized to Device-to-Device Communications

Contact Info

Product

Resources

About