检索结果-内蒙古大学图书馆

Wireless networks Using Matroid along with network coding

网际网路技术学刊 2017年第4期18卷 775-786页

作者： Purnendu Shekhar Pandey Neetesh Purohit Shekhar Verma

network coding has a vast impact on the throughput of a network. It not only combines the packet to improve throughput but it makes it more robust from errors. A fundamental problem for applying network coding is to find the number of nodes that can be treated as network coding nodes. It is found that application of network coding to every node within network results in more delay and increases the computational complexity which ultimately results in huge congestion and packet loss. Whereas selective network coding node selection decreases packet replication and increases innovative flow rate within network. To overcome this node selection problem for dynamic changing network, we have applied the concept of Matroid to construct network and form various spanning trees out of that matroidal network. In this process, subsequently Greedy algorithm for matroid is applied to find the most suitable spanning tree with minimum weight. Hence forth, Priority based selection scheme is used to prioritize the nodes within the network and subsequently nodes having highest priority will perform network coding. Lastly, we have applied an algorithm to select the best spanning tree with the help of Laplacian Matrix and all these schemes put together are named as Rule Based Selective Scheme. Thus, priority node selection and dynamic switching of spanning trees and selected NC nodes, in case of congestion, makes this rule based selective scheme more appropriate for real scenarios whereas centrality based scheme and random selection scheme do not follow this approach. The Comparative results have shown a clear indication that fi nding and applying network coding to selected number of nodes in accordance with our algorithm produces better throughput, reduces decoding delay and dynamic switching in case of congestion makes it more effi cient as compared to other mentioned schemes.

关键词： Matroid network coding coding gain XOR Decoding delay

来源：评论

学校读者我要写书评

暂无评论

network coding based BSM Broadcasting at Road Intersection in V2V Communication 84

Network Coding based BSM Broadcasting at Road Intersection i...

引用

84th IEEE Vehicular Technology Conference (VTC-Fall)

作者： Gao, Yumeng Ali, G. G. Md. Nawaz Chong, Peter Han Joo Guan, Yong Liang Nanyang Technol Univ Sch Elect & Elect Engn Singapore Singapore Auckland Univ Technol Dept Elect & Elect Engn Auckland New Zealand

ISBN: (纸本)9781509017010

Basic safety message(BSM) or heartbeat message is periodically broadcast by each vehicle on the road, conveying vehicle's instantaneous position and driving state. The vehicular communication network enables the fast exchange of BSMs with neighboring vehicles which assists drivers in acquiring the local driving environment and maneuvering promptly in case of any potential hazard. Such message is exceptionally crucial for vehicles at road intersection to avoid collisions. In this paper, we propose a novel BSM broadcast scheme using random linear network coding (NCB-RI) to address the message dissemination at road intersection. Considering each BSM packet broadcast occupies one broadcast slot, our objective is to reduce the required number of broadcast slots and lower the total transmission time for exchanging all BSMs among the studied vehicles. The coding overhead caused by the random linear network coding is further deducted by using coefficient seeds. The upper bounds regarding the broadcast slots for both NCB-RI and traditional broadcast scheme without network coding are discussed. Our proposed NCB-RI outperforms the traditional solution which is verified by analysis and simulations.

关键词： road junctions BSM network coding vehicle transmission time V2V Automobile driving Linear networks

来源：评论

学校读者我要写书评

暂无评论

A Energy-Saving Path-Shared Protection Based on Diversity network coding for Multi-rate Multicast in WDM Mesh networks

引用

Journal of Optical Communications 2017年第3期38卷 281-286页

作者： Zheng, Danling Lv, Lei Liu, Huanlin Chongqing400065 China

For improving the survivability and energy saving of multi-rate multicast, a novel energy-saving pathshared protection based on diversity network coding (EPP-DNC) for multi-rate multicast in wavelength division multiplexing (WDM) mesh networks is proposed in the paper. In the EPP-DNC algorithm, diversity network coding on the source node for multi-rate multicast is adopted to reduce the coding energy consumption by avoiding network coding on the network's intermediate nodes. To decrease the transmission energy, shortest path shared based on heuristic is proposed to transmit the protection information for the request. To provision request's working paths efficiency, the working paths are routed on the preselected P-cycles with minimum required links and minimum energy consumption. Simulation results show that the proposed EPP-DNC can save energy consumption and improve bandwidth utilization. © 2017 Walter de Gruyter GmbH, Berlin/Boston.

关键词： network coding

来源：评论

学校读者我要写书评

暂无评论

network coding: Connections Between Information Theory And Estimation Theory 17

Network Coding: Connections Between Information Theory And E...

引用

17th IEEE International Symposium on A World of Wireless, Mobile and Multimedia networks (WoWMoM)

作者： Ghanem, Samah A. M. Eurecom Inst Sophia Antipolis France

ISBN: (纸本)9781509021857

In this paper, we prove the existence of fundamental relations between information theory and estimation theory for network-coded flows. When the network is represented by a directed graph G = (V, epsilon) and under the assumption of uncorrelated noise over information flows between the directed links connecting transmitters, switches (relays), and receivers. We unveil that there yet exist closed-form relations for the gradient of the mutual information with respect to different components of the system matrix M. On the one hand, this result opens a new class of problems casting further insights into effects of the network topology, topological changes when nodes are mobile, and the impact of errors and delays in certain links into the network capacity which can be further studied in scenarios where one source multi-sinks multicasts and multi-source multicast where the invertibility and the rank of matrix M plays a significant role in the decoding process and therefore, on the network capacity. On the other hand, it opens further research questions of finding precoding solutions adapted to the network level.

关键词： directed graph estimation theory information theory minimum mean-squared error (MMSE) mutual information network information flow network coding

来源：评论

学校读者我要写书评

暂无评论

Cooperative and Adaptive network coding for Gradient Based Routing in Wireless Sensor networks with Multiple Sinks

引用

JOURNAL OF COMPUTER networkS AND COMMUNICATIONS 2017年第1期2017卷

作者： Migabo, M. E. Olwal, T. O. Djouani, K. Kurien, A. M. Tshwane Univ Technol TUT FSATI ZA-0001 Pretoria South Africa Univ Paris Est Creteil UPEC LISSI Paris France

Despite its low computational cost, the Gradient Based Routing (GBR) broadcast of interest messages inWireless Sensor networks (WSNs) causes significant packets duplications and unnecessary packets transmissions. This results in energy wastage, traffic load imbalance, high network traffic, and low throughput. Thanks to the emergence of fast and powerful processors, the development of efficient network coding strategies is expected to enable efficient packets aggregations and reduce packets retransmissions. For multiple sinks WSNs, the challenge consists of efficiently selecting a suitable network coding scheme. This article proposes a Cooperative and Adaptive network coding for GBR (CoAdNC-GBR) technique which considers the network density as dynamically defined by the average number of neighbouring nodes, to efficiently aggregate interest messages. The aggregation is performed by means of linear combinations of random coefficients of a finite Galois Field of variable size GF(2..) at each node and the decoding is performed by means of Gaussian elimination. The obtained results reveal that, by exploiting the cooperation of the multiple sinks, the CoAdNC-GBR not only improves the transmission reliability of links and lowers the number of transmissions and the propagation latency, but also enhances the energy efficiency of the network when compared to the GBR-network coding (GBR-NC) techniques.

关键词： network coding

来源：评论

学校读者我要写书评

暂无评论

network coding in Internet of Things 21

Network Coding in Internet of Things

引用

21st IEEE International Workshop on Computer Aided Modelling and Design of Communication Links and networks (CAMAD)

作者： Amirjavid, Farzad Spachos, Petros Song, Liang Plataniotis, Konstantinos N. Univ Toronto Dept Elect & Comp Engn Toronto ON Canada Univ Guelph Sch Engn Guelph ON Canada OMESH Networks Inc Toronto ON Canada

ISBN: (纸本)9781509025589

Wireless Smart Home Sensor network (WSHSN) is a home-similar environment, where several wireless sensors can observe the home status and transmit the data streams to the Smart Home Information System (SHIS). Communication in Wireless Sensor network (WSN) in small living environments faces noise and data transmission speed problems. Especially in the case of employing mobile agents, the WSN restructures dynamically, hence the network performance reduces dramatically. On the one hand, the Internet of Things (IoT) concept includes a broad application of wireless devices, while on the other hand, the WSN throughput decreases significantly by application of more wireless devices. network coding is a promising technique that can help to broaden the utilization of nodes in WSNs, while network throughput improves by the application of more wireless nodes. In this paper, IoT in WSHSN is modelled as a particular instance of butterfly network and the corresponding network coding based methodology aiming to increase the network throughput is proposed. A case study, supporting the theory of network coding in IoT in small living rooms, is proposed.

关键词： network coding

来源：评论

学校读者我要写书评

暂无评论

Data Dissemination With network coding in Two-Way Vehicle-to-Vehicle networks

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2016年第4期65卷 2445-2456页

作者： Liu, Fang Chen, Zhiyong Xia, Bin Shanghai Jiao Tong Univ Dept Elect Engn Shanghai 200240 Peoples R China

Vehicular ad hoc networks (VANETs) can efficiently offer safety-related and commercial contents for in-vehicle consumption. In this paper, we analyze the vehicle-to-vehicle (V2V) data dissemination with network coding in two-way road networks, where the vehicles move in opposite directions. In particular, depending on whether the broadcasting coverage areas overlap or not, two-way data dissemination is usually carried out in two phases, namely, the encountering phase and the separated phase. We first derive the probability mass function (pmf) of the dissemination completion time for the encountering disseminators during the encountering phase. The data dissemination velocity in the separated phase is mathematically derived. We prove that, without the help of the data dissemination in their own direction, the vehicles cannot recover all original packets from the opposite direction under a scarce handover condition. Furthermore, the dissemination slope and cache capacity of the vehicles in the proposed model are also analytically presented. Simulation results are provided to confirm the accuracy of the developed analytical results.

关键词： Data dissemination network coding two-way road vehicle-to-vehicle (V2V) vehicular ad hoc networks (VANETs)

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficient Cooperative network coding With Joint Relay Scheduling and Power Allocation

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2016年第11期64卷 4506-4519页

作者： Qi, Nan Xiao, Ming Tsiftsis, Theodoros A. Skoglund, Mikael Cao, Phuong L. Li, Lixin Northwest Polytech Univ Sch Elect & Informat Xian 710129 Peoples R China KTH Royal Inst Technol S-10044 Stockholm Sweden KTH Royal Inst Technol Sch Elect Engn S-10044 Stockholm Sweden Nazarbayev Univ Sch Engn Astana 010000 Kazakhstan Technol Educ Inst Cent Greece Lamia 35100 Greece

The energy efficiency (EE) of a multi-user multi-relay system with the maximum diversity network coding (MDNC) is studied. We explicitly find the connection among the outage probability, energy consumption, and EE, and formulate the maximizing EE problem under the outage probability constraint. Relay scheduling (RS) and power allocation (PA) are applied to schedule the relay states (transmitting, sleeping, and so on) and optimize the transmitting power under the practical channel and power consumption models. Since the optimization problem is NP hard, to reduce computational complexity, the outage probability is first tightly approximated to a log-convex form. Furthermore, the EE is converted into a subtractive form based on the fractional programming. Then, a convex mixed-integer nonlinear problem is eventually obtained. With a generalized outer approximation algorithm, RS and PA are solved in an iterative manner. The Pareto-optimal curves between the EE and the target outage probability show the EE gains from PA and RS. Moreover, by comparing with the no network coding (NoNC) scenario, we conclude that with the same number of relays, MDNC can lead to EE gains. However, if RS is implemented, NoNC can outperform MDNC in terms of the EE when more relays are needed in the MDNC scheme.

关键词： Energy efficiency-outage probability tradeoff network coding relay scheduling power allocation generalized outer approximation (GOA)

来源：评论

学校读者我要写书评

暂无评论

Reduction and Fixed Points of Boolean networks and Linear network coding Solvability

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2016年第5期62卷 2504-2519页

作者： Gadouleau, Maximilien Richard, Adrien Fanchon, Eric Univ Durham Sch Engn & Comp Sci Durham DH1 3LE England Univ Nice Sophia Antipolis CNRS Lab I3S F-06900 Nice France Univ Grenoble CNRS F-38041 Grenoble France

Linear network coding transmits data through networks by letting the intermediate nodes combine the messages they receive and forward the combinations toward their destinations. The solvability problem asks whether the demands of all the destinations can be simultaneously satisfied by using linear network coding. The guessing number approach converts this problem into determining the number of fixed points of coding functions f : A(n) -> A(n) over a finite alphabet A (usually referred to as Boolean networks if A = {0, 1}) with a given interaction graph that describes which local functions depend on which variables. In this paper, we generalize the so-called reduction of coding functions in order to eliminate variables. We then determine the maximum number of fixed points of a fully reduced coding function, whose interaction graph has a loop on every vertex. Since the reduction preserves the number of fixed points, we then apply these ideas and results to obtain four main results on the linear network coding solvability problem. First, we prove that non-decreasing coding functions cannot solve any more instances than routing already does. Second, we show that the triangle-free undirected graphs are linearly solvable if and only if they are solvable by routing. This is the first classification result for the linear network coding solvability problem. Third, we exhibit a new class of non-linearly solvable graphs. Fourth, we determine large classes of strictly linearly solvable graphs.

关键词： network coding Boolean functions network theory (graphs)

来源：评论

学校读者我要写书评

暂无评论

Calculation and Simulation of Transmission Reliability in Wireless Sensor network Based on network coding

引用

INTERNATIONAL JOURNAL OF ONLINE ENGINEERING 2017年第12期13卷 150-161页

作者： Luan, Zhifu Weifang Univ Sci & Technol Weifang Shandong Peoples R China

The wireless sensor network (WSN) has penetrated into every corner in our lives, ranging from national defense, biological medicine, environmental monitoring, to traffic management. It is of great significance to study the reliability of data transmission, a key determinant of the results of monitoring events. The network reliability lies in fault tolerance: when some nodes or links in the network fail, the data can be recovered at the sink node by selecting the appropriate finite domain space. In this paper, network coding is used to improve the reliability of WSN. Firstly, the author calculated the data transmission reliability and average energy consumption of network coding in single-path and multi-path scenarios. Then, the average energy consumption of network coding was compared with that of the traditional method. Finally, the reliabilities of the two different methods were simulated on MATLAB at different channel loss rates. The experimental results show that the reliability of the network coding technique is better than the traditional one at the expense of a small amount of energy.

关键词： Wireless Sensor network (WSN) network coding Reliability

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：