oalib
Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
Lower Bounds on the Maximum Energy Benefit of Network Coding for Wireless Multiple Unicast  [cached]
Goseling Jasper,Matsumoto Ryutaroh,Uyematsu Tomohiko,Weber JosH
EURASIP Journal on Wireless Communications and Networking , 2010,
Abstract: We consider the energy savings that can be obtained by employing network coding instead of plain routing in wireless multiple unicast problems. We establish lower bounds on the benefit of network coding, defined as the maximum of the ratio of the minimum energy required by routing and network coding solutions, where the maximum is over all configurations. It is shown that if coding and routing solutions are using the same transmission range, the benefit in d-dimensional networks is at least . Moreover, it is shown that if the transmission range can be optimized for routing and coding individually, the benefit in 2-dimensional networks is at least 3. Our results imply that codes following a decode-and-recombine strategy are not always optimal regarding energy efficiency.
Lower Bounds on the Maximum Energy Benefit of Network Coding for Wireless Multiple Unicast  [cached]
Jasper Goseling,Ryutaroh Matsumoto,Tomohiko Uyematsu,Jos H. Weber
EURASIP Journal on Wireless Communications and Networking , 2010, DOI: 10.1155/2010/605421
Abstract: We consider the energy savings that can be obtained by employing network coding instead of plain routing in wireless multiple unicast problems. We establish lower bounds on the benefit of network coding, defined as the maximum of the ratio of the minimum energy required by routing and network coding solutions, where the maximum is over all configurations. It is shown that if coding and routing solutions are using the same transmission range, the benefit in d-dimensional networks is at least 2d/ d . Moreover, it is shown that if the transmission range can be optimized for routing and coding individually, the benefit in 2-dimensional networks is at least 3. Our results imply that codes following a decode-and-recombine strategy are not always optimal regarding energy efficiency.
Energy Benefit of Network Coding for Multiple Unicast in Wireless Networks  [PDF]
Jasper Goseling,Jos. H. Weber
Mathematics , 2008,
Abstract: We show that the maximum possible energy benefit of network coding for multiple unicast on wireless networks is at least 3. This improves the previously known lower bound of 2.4 from [1].
Network Coding for a Kind of Multicast Graph in Wireless Network
无线网络中一类多播网络的网络编码

WANG Jing,ZHAO Lin-sen,LIU Xiang-yang,WANG Xin-mei,
王静
,赵林森,刘向阳,王新梅

计算机科学 , 2008,
Abstract: In this paper,a method for constructing wireless network in the space is proposed.More specifically,elementary graphs are used to model the states of network nodes,and wireless network model is realized dynamically by the adding or leaving of the node elementary graph.For k-redundant multicast network,the maximum multicast rate can be achieved with network coding.For k-redundant multicast network in wireless network,a network coding algorithm is presented from the network flow perspective.
Wireless Network Coding with Imperfect Overhearing  [PDF]
Haishi Ning,Cong Ling,Kin K. Leung
Mathematics , 2010,
Abstract: Not only is network coding essential to achieve the capacity of a single-session multicast network, it can also help to improve the throughput of wireless networks with multiple unicast sessions when overheard information is available. Most previous research aimed at realizing such improvement by using perfectly overheard information, while in practice, especially for wireless networks, overheard information is often imperfect. To date, it is unclear whether network coding should still be used in such situations with imperfect overhearing. In this paper, a simple but ubiquitous wireless network model with two unicast sessions is used to investigate this problem. From the diversity and multiplexing tradeoff perspective, it is proved that even when overheard information is imperfect, network coding can still help to improve the overall system performance. This result implies that network coding should be used actively regardless of the reception quality of overheard information.
Exchange of Information in Wireless Sensor Networks using Network Coding.  [PDF]
S.K.Rajalakshmi,S.Senthilnathan,A.P.Prabakaran
International Journal of Engineering Sciences & Research Technology , 2013,
Abstract: The exchange of independent information between two nodes in a wireless network can be viewed as two unicast sessions, corresponding to information trans-fer along one direction and the opposite direction.. Many schemes are applied to achieve this say Conventional scheme and Cooperative Diversity Scheme. In this paper we propose a scheme called Network coding where, instead of simply relaying the packets of information they receive, the nodes of a network will take several packets and combine them together for transmission. This can be used to attain the maximum possible information flow in a network. Network coding is a field of information theory and coding theory. The observations show that network coding scheme has better energy efficiency than the other schemes.
Performance of wireless network coding: motivating small encoding numbers  [PDF]
Petteri Mannersalo,Georgios S. Paschos,Lazaros Gkatzikis
Computer Science , 2010,
Abstract: This paper focuses on a particular transmission scheme called local network coding, which has been reported to provide significant performance gains in practical wireless networks. The performance of this scheme strongly depends on the network topology and thus on the locations of the wireless nodes. Also, it has been shown previously that finding the encoding strategy, which achieves maximum performance, requires complex calculations to be undertaken by the wireless node in real-time. Both deterministic and random point pattern are explored and using the Boolean connectivity model we provide upper bounds for the maximum coding number, i.e., the number of packets that can be combined such that the corresponding receivers are able to decode. For the models studied, this upper bound is of order of $\sqrt{N}$, where $N$ denotes the (mean) number of neighbors. Moreover, achievable coding numbers are provided for grid-like networks. We also calculate the multiplicative constants that determine the gain in case of a small network. Building on the above results, we provide an analytic expression for the upper bound of the efficiency of local network coding. The conveyed message is that it is favorable to reduce computational complexity by relying only on small encoding numbers since the resulting expected throughput loss is negligible.
Heuristics for Network Coding in Wireless Networks  [PDF]
Song Yean Cho,Cédric Adjih,Philippe Jacquet
Computer Science , 2007,
Abstract: Multicast is a central challenge for emerging multi-hop wireless architectures such as wireless mesh networks, because of its substantial cost in terms of bandwidth. In this report, we study one specific case of multicast: broadcasting, sending data from one source to all nodes, in a multi-hop wireless network. The broadcast we focus on is based on network coding, a promising avenue for reducing cost; previous work of ours showed that the performance of network coding with simple heuristics is asymptotically optimal: each transmission is beneficial to nearly every receiver. This is for homogenous and large networks of the plan. But for small, sparse or for inhomogeneous networks, some additional heuristics are required. This report proposes such additional new heuristics (for selecting rates) for broadcasting with network coding. Our heuristics are intended to use only simple local topology information. We detail the logic of the heuristics, and with experimental results, we illustrate the behavior of the heuristics, and demonstrate their excellent performance.
A Multicast Algorithm for Wireless Sensor Networks Based on Network Coding  [PDF]
Zhi-jie Han,Ru-chuan Wang,Fu Xiao
International Journal of Distributed Sensor Networks , 2014, DOI: 10.1155/2014/427679
Abstract: We propose a set of distributed algorithms for improving the multicast throughput in wireless sensor networks. To this end, network coding is applied when exploiting path diversity with two disjoint paths to each multicast group receiver. We depart from the traditional wisdom that the multicast topology from source to receivers needs to be a tree and propose a novel and distributed algorithm to construct a 2-redundant multicast graph (a directed acyclic graph) as the multicast topology, on which network coding is applied. We conduct both analytical and simulation-based studies to evaluate the effectiveness and performance of our algorithm. 1. Introduction Multicast mechanism is mainly used in sink nodes to send control messages to the sensor nodes in wireless sensor networks (WSNs), or in a sensor node to send data to multiple sink nodes. Multicast routing algorithm plays a vital role in WSN regarding the survival time and transmission efficiency of the WSNs. Ahlswede et al. proposed network coding [1–3] in 2000. This method is useful for greatly improving the network throughput and reliability. Literatures [4, 5] have proved that in each multicast diagram, corresponding linear coding can be found to achieve minimum cut-maximum flow. Zhu et al. [6] found that the network coding has good performance and advantage in multicast network, but the network topology has different effect on the throughput and bandwidth of multicast; redundant multicast figure presented better efficiency and performance than the traditional multicast tree. Jiang et al. [7] proposed a multicast tree algorithm through network coding, determined the relationship between cluster heads, and analyzed the algorithm performance using network calculus. Yuan et al. [8] analyzed the performance of network coding by the stochastic process. Li et al. [9] analyzed the end-to-end route delay performance based on the network coding using network calculus. According to the WSN characteristic, considering the geographic and energy-aware routing (GEAR) [10], we constructed -redundant multicast graph in the form of overlay network in this paper using the multicast algorithm based on network coding (MABNC). We improved the multicast performance by reducing the energy consumption. 2. Algorithm Description The proposed algorithm is for sensor networks. Based on the geographic routing algorithms, -redundant multicast graph was constructed. The network throughput and bandwidth utilization were improved, the effect of minimum cut to maximum flow was determined, and the network multicast routing
Distributed Intrusion Detection of Byzantine Attacks in Wireless Networks with Random Linear Network Coding  [PDF]
Jen-Yeu Chen,Yi-ying Tseng
Computer Science , 2013,
Abstract: Network coding is an elegant technique where, instead of simply relaying the packets of information they receive, the nodes of a network are allowed to combine \emph{several} packets together for transmission and this technique can be used to achieve the maximum possible information flow in a network and save the needed number of packet transmissions. Moreover, in an energy-constraint wireless network such as Wireless Sensor Network (a typical type of wireless ad hoc network), applying network coding to reduce the number of wireless transmissions can also prolong the life time of sensor nodes. Although applying network coding in a wireless sensor network is obviously beneficial, due to the operation that one transmitting information is actually combination of multiple other information, it is possible that an error propagation may occur in the network. This special characteristic also exposes network coding system to a wide range of error attacks, especially Byzantine attacks. When some adversary nodes generate error data in the network with network coding, those erroneous information will be mixed at intermeidate nodes and thus corrupt all the information reaching a destination. Recent research efforts have shown that network coding can be combined with classical error control codes and cryptography for secure communication or misbehavior detection. Nevertheless, when it comes to Byzantine attacks, these results have limited effect. In fact, unless we find out those adversary nodes and isolate them, network coding may perform much worse than pure routing in the presence of malicious nodes. In this paper, a distributed hierarchical algorithm based on random linear network coding is developed to detect, locate and isolate malicious nodes.
Page 1 /100
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.