We consider the problem of joint network coding and packet scheduling for multimedia transmission from the Access Point (AP) to multiple receivers in 802.11 networks. The state of receivers is described by a hidden Ma...
详细信息
ISBN:
(纸本)9781424446513
We consider the problem of joint network coding and packet scheduling for multimedia transmission from the Access Point (AP) to multiple receivers in 802.11 networks. The state of receivers is described by a hidden Markov model and the AP acts as a decision maker which employs a partially observable Markov decision process (POMDP) to optimize the media transmission. Importantly, we introduce a simulation-based dynamic programming algorithm as a solution tool for our POMDP abstract. Our simulation-based algorithm simplifies the modeling process as well as reduces the computational complexity of the solution process. Our simulation results demonstrate that the proposed scheme provides higher performance than the network coding scheme without using optimization techniques and traditional retransmission scheme.
We demonstrate that the gain attained by network coding (NC) on the multicast capacity of random wireless ad hoc networks is bounded by a constant factor. We consider a network with n nodes distributed uniformly in a ...
详细信息
ISBN:
(纸本)9781424434343
We demonstrate that the gain attained by network coding (NC) on the multicast capacity of random wireless ad hoc networks is bounded by a constant factor. We consider a network with n nodes distributed uniformly in a unit square, with each node acting as a source for independent information to be sent to a multicast group consisting of m randomly chosen destinations. We show that, under the protocol model, the per-session capacity in the presence of arbitrary NC has a tight bound of Theta (1/root mnlog(n)) when m = O (n/log (n)) and Theta (1/n) when m= Omega(n/log(n)). Our result follows from the fact that prior work has shown that the same order bounds are achievable with pure routing based only on traditional store-and-forward methods.
Some Applications need to propagate important and critical data to all nodes in a wireless ad-hoc network Flooding and its variants are good and simple protocols to achieve this target, but they are not efficient. Net...
详细信息
ISBN:
(纸本)9781424412297
Some Applications need to propagate important and critical data to all nodes in a wireless ad-hoc network Flooding and its variants are good and simple protocols to achieve this target, but they are not efficient. network coding can improve the performance of these algorithms. In designing such algorithms there are some important parameters which should be taken into account. Energy consumption, coverage and total delay are the most important parameters in a wireless ad-hoe network. Also in the network coding based algorithms, complexity of coding and packet overhead that network coding inserts to the system are important design parameters. In this article, XRBCast, a reliable and energy efficient single source broadcasting algorithm is proposed which uses network coding to achieve better performance. XRBCast guarantees the delivery of desired messages to all nodes. Other advantages of the proposed algorithm are reduced energy consumption and total delay. All coding operations have been done on a unit size finite field which reduces the overhead size and complexity of operations. Reliability is achieved through a simple acknowledge mechanism which is taken from the inherent properties of network coding. Simulations are performed to demonstrate the advantages of the proposed algorithm.
Vehicular named data networking (V-NDN) is promising to match dynamic topology of vehicular ad hoc networks. However, it has some potential issues such as broadcast storm of Interest packets due to flooding and blind ...
详细信息
ISBN:
(纸本)9781728190549
Vehicular named data networking (V-NDN) is promising to match dynamic topology of vehicular ad hoc networks. However, it has some potential issues such as broadcast storm of Interest packets due to flooding and blind forwarding strategy at intermediate nodes. To address these issues, we propose a network coding enhanced forwarding strategy with predictive content discovery (NC-PCD) mechanism which functions at key nodes (e.g., road intersections). First, content providers provide innovative encoded data packets. Second, the NDN packet formats are extended to carry the information about the innovative degree, distance, congestion level and path quality, etc. Finally, the NDN router at the key node collects information to select the optimal forwarding direction for subsequent requests. This problem is formulated as a joint optimization problem and solved by deep reinforcement learning. Simulation results show that the proposed NC-PCD is significantly superior to the existing forwarding strategies in terms of Interest satisfied ratio, response delay and number of transmitted packets.
This paper presents a complete framework for content discovery and retrieval in Information-Centric networks. For content discovery, we implement a method similar to our previously developed pull-based BFR [1], which ...
详细信息
ISBN:
(纸本)9781728150895
This paper presents a complete framework for content discovery and retrieval in Information-Centric networks. For content discovery, we implement a method similar to our previously developed pull-based BFR [1], which uses Bloom filter-based signaling to inform servers about the name prefixes of available requests. For content retrieval, we propose in this paper a feedback-based cooperative protocol implementing network coding-based forwarding. The proposed network coding-based protocol provides a distributed solution to control the multi-session codeblock size, i.e., the number of variables that are combined into network coded packets, by setting a capacity constraint on each node and by piggybacking the available capacity as feedback on messages sent to neighbors. The network codes are decided using linear programming. We compare the proposed network coding-based protocol with push-based BFR [2] and pull-based BFR [1]. The results show that the proposed protocol outperforms both push-based BFR and pull-based BFR in terms of content discovery overhead and average content block retrieval delay.
Peer-to-peer distributed storage systems can be instrumental to develop solutions able to store the massive amounts of data generated by the Internet of Things (IoT) users. Given the higher probability of node failure...
详细信息
ISBN:
(纸本)9781728189642
Peer-to-peer distributed storage systems can be instrumental to develop solutions able to store the massive amounts of data generated by the Internet of Things (IoT) users. Given the higher probability of node failures, losses in the communication channels, and limited resources of devices compared to centralized storage solutions, it is key to minimize data retrieval time, while also maintaining high resiliency in the system. We propose a method based on random linear network coding (RLNC) for data storage and retrieval and the use of Kademlia for our peer-to-peer design to address these challenges. We analyze the performance of the proposed RLNC-based method theoretically as well as the traditional Kademlia in terms of data retrieval time and resiliency to node failures and channel losses. We use PeerSim to simulate the proposed method. Our theoretical analysis and simulation results show that the proposed RLNC-based method significantly outperforms traditional Kademlia for our core performance metrics. These gains in resiliency and data retrieval time are achieved while also reducing the data storage time for a wide region of operation. Our simulations show that only if the redundancy of the RLNC-based scheme is significantly increased (> 100 % redundant RLNC packets), then a small degradation ( < 10 %) in data storage time occurs.
From the paper, we propose a method of relay selection for underwater acoustic cooperative communication which adopted network coding. On the basis of choosing the relay node, we also designed a power distribution mea...
详细信息
ISBN:
(纸本)9781728172361
From the paper, we propose a method of relay selection for underwater acoustic cooperative communication which adopted network coding. On the basis of choosing the relay node, we also designed a power distribution measure. The relay selection scheme takes transmission delay and channel gain as the selection indicators, and the high-performance relay transmission nodes are selected through the standardized joint evaluation of the two indicators. When we select the most suitable transmission node for sending the information, this paper uses the proposed underwater acoustic network and introduces network coding technology to design a power distribution method. Since the node that transmits and forwards information processes more messages than the node which sends information, the relay node needs more power to ensure correct transmission. After calculation and simulation verification, this paper finds the power allocation ratio to ensure information transmission. In addition, through simulation verification, the communication performance of the optimized power allocation proposed is better than the traditional power parity solution when the symbol error rate is same.
network coding is an elegant and novel technique to improve network throughput and performance in practical networking systems. The main challenge in exploiting the network coding is how coding opportunities can accur...
详细信息
ISBN:
(纸本)9781479912919
network coding is an elegant and novel technique to improve network throughput and performance in practical networking systems. The main challenge in exploiting the network coding is how coding opportunities can accurately be identified and utilized. In this paper, we discuss a coding-aware multicast in a multi-hop wireless network with a schedule-based MAC protocol. For a delay-sensitive application, we focus on how fast each destination node can receive the complete information, or equivalently, what the information rate arriving at each destination is. We formulate this problem via a cross-layer approach by taking consideration of resource scheduling and coding-aware multicast routing jointly.
Direct device-to-device (D2D) communication between cellular equipments is proposed to increase data-rate and extend conventional cellular coverage, by introducing underlaying communications with cellular network in c...
详细信息
ISBN:
(纸本)9781479941384
Direct device-to-device (D2D) communication between cellular equipments is proposed to increase data-rate and extend conventional cellular coverage, by introducing underlaying communications with cellular network in cognitive fashion. For enhancing D2D coverage and reliability, we consider advanced relaying techniques. We study D2D communications over more than one hop using relay nodes, i.e., we study utilization of idle devices in connecting the D2D Tx and Rx playing the role of relays. This relaying technique can be implemented using network coding (NC) to provide extra redundancy in the network. With the help of Monte Carlo simulations, we investigate the network performance by comparing the sum rate of the D2D underlaying cellular network achieved with and without NC. It is shown that the physical network coding protocol outperforms the traditional routing scheme, while the digital network coding lies between the performance of both thus offering a good compromise. Finally we show that by considering the best case relay selection can significantly increase the system performance.
In wireless networks packets are lost because of queue congestion during high traffic, collisions, hidden nodes, and link failures. The problem of dropped packets becomes more critical in real-time applications, such ...
详细信息
In wireless networks packets are lost because of queue congestion during high traffic, collisions, hidden nodes, and link failures. The problem of dropped packets becomes more critical in real-time applications, such as video conferences and remote controls. This paper presents a new wireless network coding (WNC) scheme and router detection packet loss (RDPL) algorithm for retrieving packets that are lost in a wireless network. In the WNC scheme, a router combines (encodes) packets originating from the same or different sources and forwards the packets to another router. In the RDPL algorithm, the coding router sends a negative acknowledge to the upper layer routers whenever it receives only one packet or two identical packets. The proposed WNC-RDPL method increases the transmission capacity and packet delivery ratio (PDR). The architecture has been evaluated for one, two, three, and four link failures. The simulation results show that the WNC-RDPL approach obtain 100% PDR gains compared with well-known linear network coding schemes.
暂无评论