Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA Graph Theoretical Approach for Network Coding in Wireless Body Area Networks
149
0
0.0
(
0
)
Added by
Eimear Byrne
Publication date
2011
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
Modern medical wireless systems, such as wireless body area networks (WBANs), are applications of wireless networks that can be used as a tool of data transmission between patients and doctors. Accuracy of data transmission is an important requirement for such systems. In this paper, we will propose a WBAN which is robust against erasures and describe its properties using graph theoretic techniques.
rate research
Read More
We consider a communication network where there exist wiretappers who can access a subset of channels, called a wiretap set, which is chosen from a given collection of wiretap sets. The collection of wiretap sets can be arbitrary. Secure network coding is applied to prevent the source information from being leaked to the wiretappers. In secure network coding, the required alphabet size is an open problem not only of theoretical interest but also of practical importance, because it is closely related to the implementation of such coding schemes in terms of computational complexity and storage requirement. In this paper, we develop a systematic graph-theoretic approach for improving Cai and Yeungs lower bound on the required alphabet size for the existence of secure network codes. The new lower bound thus obtained, which depends only on the network topology and the collection of wiretap sets, can be significantly smaller than Cai and Yeungs lower bound. A polynomial-time algorithm is devised for efficient computation of the new lower bound.
A sum-network is a directed acyclic network where each source independently generates one symbol from a given field $mathbb F$ and each terminal wants to receive the sum $($over $mathbb F)$ of the source symbols. For sum-networks with two sources or two terminals, the solvability is characterized by the connection condition of each source-terminal pair [3]. A necessary and sufficient condition for the solvability of the $3$-source $3$-terminal $(3$s$/3$t$)$ sum-networks was given by Shenvi and Dey [6]. However, the general case of arbitrary sources/sinks is still open. In this paper, we investigate the sum-network with three sources and $n$ sinks using a region decomposition method. A sufficient and necessary condition is established for a class of $3$s$/n$t sum-networks. As a direct application of this result, a necessary and sufficient condition of solvability is obtained for the special case of $3$s$/3$t sum-networks.
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.
With the rapid enhancement of computer computing power, deep learning methods, e.g., convolution neural networks, recurrent neural networks, etc., have been applied in wireless network widely and achieved impressive performance. In recent years, in order to mine the topology information of graph-structured data in wireless network as well as contextual information, graph neural networks have been introduced and have achieved the state-of-the-art performance of a series of wireless network problems. In this review, we first simply introduce the progress of several classical paradigms, such as graph convolutional neural networks, graph attention networks, graph auto-encoder, graph recurrent networks, graph reinforcement learning and spatial-temporal graph neural networks, of graph neural networks comprehensively. Then, several applications of graph neural networks in wireless networks such as power control, link scheduling, channel control, wireless traffic prediction, vehicular communication, point cloud, etc., are discussed in detail. Finally, some research trends about the applications of graph neural networks in wireless networks are discussed.
This paper develops a tractable framework for exploiting the potential benefits of physical layer security in three-tier wireless sensor networks using stochastic geometry. In such networks, the sensing data from the remote sensors are collected by sinks with the help of access points, and the external eavesdroppers intercept the data transmissions.We focus on the secure transmission in two scenarios: i) the active sensors transmit their sensing data to the access points, and ii) the active access points forward the data to the sinks. We derive new compact expressions for the average secrecy rate in these two scenarios. We also derive a new compact expression for the overall average secrecy rate. Numerical results corroborate our analysis and show that multiple antennas at the access points can enhance the security of three-tier wireless sensor networks. Our results show that increasing the number of access points decreases the average secrecy rate between the access point and its associated sink. However, we find that increasing the number of access points first increases the overall average secrecy rate, with a critical value beyond which the overall average secrecy rate then decreases. When increasing the number of active sensors, both the average secrecy rate between the sensor and its associated access point and the overall average secrecy rate decrease. In contrast, increasing the number of sinks improves both the average secrecy rate between the access point and its associated sink, as well as the overall average secrecy rate.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
