WorldWideScience

Sample records for network protection codes

  1. Review of Rateless-Network-Coding-Based Packet Protection in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    A. S. Abdullah

    2015-01-01

    Full Text Available In recent times, there have been many developments in wireless sensor network (WSN technologies using coding theory. Fast and efficient protection schemes for data transfer over the WSN are some of the issues in coding theory. This paper reviews the issues related to the application of the joint rateless-network coding (RNC within the WSN in the context of packet protection. The RNC is a method in which any node in the network is allowed to encode and decode the transmitted data in order to construct a robust network, improve network throughput, and decrease delays. To the best of our knowledge, there has been no comprehensive discussion about RNC. To begin with, this paper briefly describes the concept of packet protection using network coding and rateless codes. We therefore discuss the applications of RNC for improving the capability of packet protection. Several works related to this issue are discussed. Finally, the paper concludes that the RNC-based packet protection scheme is able to improve the packet reception rate and suggests future studies to enhance the capability of RNC protection.

  2. Equidistant Linear Network Codes with maximal Error-protection from Veronese Varieties

    DEFF Research Database (Denmark)

    Hansen, Johan P.

    2012-01-01

    Linear network coding transmits information in terms of a basis of a vector space and the information is received as a basis of a possible altered vectorspace. Ralf Koetter and Frank R. Kschischang in Coding for errors and erasures in random network coding (IEEE Transactions on Information Theory...... construct explicit families of vector-spaces of constant dimension where any pair of distinct vector-spaces are equidistant in the above metric. The parameters of the resulting linear network codes which have maximal error-protection are determined....

  3. Network Coding

    Indian Academy of Sciences (India)

    Home; Journals; Resonance – Journal of Science Education; Volume 15; Issue 7. Network Coding. K V Rashmi Nihar B Shah P Vijay Kumar. General Article Volume 15 Issue 7 July 2010 pp 604-621. Fulltext. Click here to view fulltext PDF. Permanent link: https://www.ias.ac.in/article/fulltext/reso/015/07/0604-0621 ...

  4. Vector Network Coding Algorithms

    OpenAIRE

    Ebrahimi, Javad; Fragouli, Christina

    2010-01-01

    We develop new algebraic algorithms for scalar and vector network coding. In vector network coding, the source multicasts information by transmitting vectors of length L, while intermediate nodes process and combine their incoming packets by multiplying them with L x L coding matrices that play a similar role as coding c in scalar coding. Our algorithms for scalar network jointly optimize the employed field size while selecting the coding coefficients. Similarly, for vector coding, our algori...

  5. Vector Network Coding

    OpenAIRE

    Ebrahimi, Javad; Fragouli, Christina

    2010-01-01

    We develop new algebraic algorithms for scalar and vector network coding. In vector network coding, the source multicasts information by transmitting vectors of length L, while intermediate nodes process and combine their incoming packets by multiplying them with L X L coding matrices that play a similar role as coding coefficients in scalar coding. Our algorithms for scalar network jointly optimize the employed field size while selecting the coding coefficients. Similarly, for vector co...

  6. Physical Layer Network Coding

    DEFF Research Database (Denmark)

    Fukui, Hironori; Yomo, Hironori; Popovski, Petar

    2013-01-01

    of interfering nodes and usage of spatial reservation mechanisms. Specifically, we introduce a reserved area in order to protect the nodes involved in two-way relaying from the interference caused by neighboring nodes. We analytically derive the end-to-end rate achieved by PLNC considering the impact......Physical layer network coding (PLNC) has the potential to improve throughput of multi-hop networks. However, most of the works are focused on the simple, three-node model with two-way relaying, not taking into account the fact that there can be other neighboring nodes that can cause....../receive interference. The way to deal with this problem in distributed wireless networks is usage of MAC-layer mechanisms that make a spatial reservation of the shared wireless medium, similar to the well-known RTS/CTS in IEEE 802.11 wireless networks. In this paper, we investigate two-way relaying in presence...

  7. Network Coded Software Defined Networking

    DEFF Research Database (Denmark)

    Krigslund, Jeppe; Hansen, Jonas; Roetter, Daniel Enrique Lucani

    2015-01-01

    Software Defined Networking (SDN) and Network Coding (NC) are two key concepts in networking that have garnered a large attention in recent years. On the one hand, SDN's potential to virtualize services in the Internet allows a large flexibility not only for routing data, but also to manage....... This paper advocates for the use of SDN to bring about future Internet and 5G network services by incorporating network coding (NC) functionalities. The inherent flexibility of both SDN and NC provides a fertile ground to envision more efficient, robust, and secure networking designs, that may also...

  8. Fulcrum Network Codes

    DEFF Research Database (Denmark)

    2015-01-01

    Fulcrum network codes, which are a network coding framework, achieve three objectives: (i) to reduce the overhead per coded packet to almost 1 bit per source packet; (ii) to operate the network using only low field size operations at intermediate nodes, dramatically reducing complexity...... in the network; and (iii) to deliver an end-to-end performance that is close to that of a high field size network coding system for high-end receivers while simultaneously catering to low-end ones that can only decode in a lower field size. Sources may encode using a high field size expansion to increase...... the number of dimensions seen by the network using a linear mapping. Receivers can tradeoff computational effort with network delay, decoding in the high field size, the low field size, or a combination thereof....

  9. Network Coded Software Defined Networking

    DEFF Research Database (Denmark)

    Hansen, Jonas; Roetter, Daniel Enrique Lucani; Krigslund, Jeppe

    2015-01-01

    Software defined networking has garnered large attention due to its potential to virtualize services in the Internet, introducing flexibility in the buffering, scheduling, processing, and routing of data in network routers. SDN breaks the deadlock that has kept Internet network protocols stagnant...... for decades, while applications and physical links have evolved. This article advocates for the use of SDN to bring about 5G network services by incorporating network coding (NC) functionalities. The latter constitutes a major leap forward compared to the state-of-the- art store and forward Internet paradigm...

  10. Coded Network Function Virtualization

    DEFF Research Database (Denmark)

    Al-Shuwaili, A.; Simone, O.; Kliewer, J.

    2016-01-01

    Network function virtualization (NFV) prescribes the instantiation of network functions on general-purpose network devices, such as servers and switches. While yielding a more flexible and cost-effective network architecture, NFV is potentially limited by the fact that commercial off......-the-shelf hardware is less reliable than the dedicated network elements used in conventional cellular deployments. The typical solution for this problem is to duplicate network functions across geographically distributed hardware in order to ensure diversity. In contrast, this letter proposes to leverage channel...... coding in order to enhance the robustness on NFV to hardware failure. The proposed approach targets the network function of uplink channel decoding, and builds on the algebraic structure of the encoded data frames in order to perform in-network coding on the signals to be processed at different servers...

  11. The network code

    International Nuclear Information System (INIS)

    1997-01-01

    The Network Code defines the rights and responsibilities of all users of the natural gas transportation system in the liberalised gas industry in the United Kingdom. This report describes the operation of the Code, what it means, how it works and its implications for the various participants in the industry. The topics covered are: development of the competitive gas market in the UK; key points in the Code; gas transportation charging; impact of the Code on producers upstream; impact on shippers; gas storage; supply point administration; impact of the Code on end users; the future. (20 tables; 33 figures) (UK)

  12. Software Defined Coded Networking

    DEFF Research Database (Denmark)

    Di Paola, Carla; Roetter, Daniel Enrique Lucani; Palazzo, Sergio

    2017-01-01

    the quality of each link and even across neighbouring links and using simulations to show that an additional reduction of packet transmission in the order of 40% is possible. Second, to advocate for the use of network coding (NC) jointly with software defined networking (SDN) providing an implementation...

  13. Physical layer network coding

    DEFF Research Database (Denmark)

    Fukui, Hironori; Popovski, Petar; Yomo, Hiroyuki

    2014-01-01

    Physical layer network coding (PLNC) has been proposed to improve throughput of the two-way relay channel, where two nodes communicate with each other, being assisted by a relay node. Most of the works related to PLNC are focused on a simple three-node model and they do not take into account...

  14. NETWORK CODING BY BEAM FORMING

    DEFF Research Database (Denmark)

    2013-01-01

    Network coding by beam forming in networks, for example, in single frequency networks, can provide aid in increasing spectral efficiency. When network coding by beam forming and user cooperation are combined, spectral efficiency gains may be achieved. According to certain embodiments, a method...... cooperating with the plurality of user equipment to decode the received data....

  15. Network Coding Fundamentals and Applications

    CERN Document Server

    Medard, Muriel

    2011-01-01

    Network coding is a field of information and coding theory and is a method of attaining maximum information flow in a network. This book is an ideal introduction for the communications and network engineer, working in research and development, who needs an intuitive introduction to network coding and to the increased performance and reliability it offers in many applications. This book is an ideal introduction for the research and development communications and network engineer who needs an intuitive introduction to the theory and wishes to understand the increased performance and reliabil

  16. On Network Coded Filesystem Shim

    DEFF Research Database (Denmark)

    Sørensen, Chres Wiant; Roetter, Daniel Enrique Lucani; Médard, Muriel

    2017-01-01

    Although network coding has shown the potential to revolutionize networking and storage, its deployment has faced a number of challenges. Usual proposals involve two approaches. First, deploying a new protocol (e.g., Multipath Coded TCP), or retrofitting another one (e.g., TCP/NC) to deliver bene...

  17. Tunable Sparse Network Coding for Multicast Networks

    DEFF Research Database (Denmark)

    Feizi, Soheil; Roetter, Daniel Enrique Lucani; Sørensen, Chres Wiant

    2014-01-01

    This paper shows the potential and key enabling mechanisms for tunable sparse network coding, a scheme in which the density of network coded packets varies during a transmission session. At the beginning of a transmission session, sparsely coded packets are transmitted, which benefits decoding...... complexity. At the end of a transmission, when receivers have accumulated degrees of freedom, coding density is increased. We propose a family of tunable sparse network codes (TSNCs) for multicast erasure networks with a controllable trade-off between completion time performance to decoding complexity...... a mechanism to perform efficient Gaussian elimination over sparse matrices going beyond belief propagation but maintaining low decoding complexity. Supporting simulation results are provided showing the trade-off between decoding complexity and completion time....

  18. Linear network error correction coding

    CERN Document Server

    Guang, Xuan

    2014-01-01

    There are two main approaches in the theory of network error correction coding. In this SpringerBrief, the authors summarize some of the most important contributions following the classic approach, which represents messages by sequences?similar to algebraic coding,?and also briefly discuss the main results following the?other approach,?that uses the theory of rank metric codes for network error correction of representing messages by subspaces. This book starts by establishing the basic linear network error correction (LNEC) model and then characterizes two equivalent descriptions. Distances an

  19. Coherence protection by random coding

    International Nuclear Information System (INIS)

    Brion, E; Akulin, V M; Dumer, I; Harel, G; Kurizki, G

    2005-01-01

    We show that the multidimensional Zeno effect combined with non-holonomic control allows one to efficiently protect quantum systems from decoherence by a method similar to classical random coding. The method is applicable to arbitrary error-inducing Hamiltonians and general quantum systems. The quantum encoding approaches the Hamming upper bound for large dimension increases. Applicability of the method is demonstrated with a seven-qubit toy computer

  20. Special issue on network coding

    Science.gov (United States)

    Monteiro, Francisco A.; Burr, Alister; Chatzigeorgiou, Ioannis; Hollanti, Camilla; Krikidis, Ioannis; Seferoglu, Hulya; Skachek, Vitaly

    2017-12-01

    Future networks are expected to depart from traditional routing schemes in order to embrace network coding (NC)-based schemes. These have created a lot of interest both in academia and industry in recent years. Under the NC paradigm, symbols are transported through the network by combining several information streams originating from the same or different sources. This special issue contains thirteen papers, some dealing with design aspects of NC and related concepts (e.g., fountain codes) and some showcasing the application of NC to new services and technologies, such as data multi-view streaming of video or underwater sensor networks. One can find papers that show how NC turns data transmission more robust to packet losses, faster to decode, and more resilient to network changes, such as dynamic topologies and different user options, and how NC can improve the overall throughput. This issue also includes papers showing that NC principles can be used at different layers of the networks (including the physical layer) and how the same fundamental principles can lead to new distributed storage systems. Some of the papers in this issue have a theoretical nature, including code design, while others describe hardware testbeds and prototypes.

  1. Medical reliable network using concatenated channel codes through GSM network.

    Science.gov (United States)

    Ahmed, Emtithal; Kohno, Ryuji

    2013-01-01

    Although the 4(th) generation (4G) of global mobile communication network, i.e. Long Term Evolution (LTE) coexisting with the 3(rd) generation (3G) has successfully started; the 2(nd) generation (2G), i.e. Global System for Mobile communication (GSM) still playing an important role in many developing countries. Without any other reliable network infrastructure, GSM can be applied for tele-monitoring applications, where high mobility and low cost are necessary. A core objective of this paper is to introduce the design of a more reliable and dependable Medical Network Channel Code system (MNCC) through GSM Network. MNCC design based on simple concatenated channel code, which is cascade of an inner code (GSM) and an extra outer code (Convolution Code) in order to protect medical data more robust against channel errors than other data using the existing GSM network. In this paper, the MNCC system will provide Bit Error Rate (BER) equivalent to the BER for medical tele monitoring of physiological signals, which is 10(-5) or less. The performance of the MNCC has been proven and investigated using computer simulations under different channels condition such as, Additive White Gaussian Noise (AWGN), Rayleigh noise and burst noise. Generally the MNCC system has been providing better performance as compared to GSM.

  2. Network Coding Over The 232

    DEFF Research Database (Denmark)

    Pedersen, Morten Videbæk; Heide, Janus; Vingelmann, Peter

    2013-01-01

    Creating efficient finite field implementations has been an active research topic for several decades. Many appli- cations in areas such as cryptography, signal processing, erasure coding and now also network coding depend on this research to deliver satisfactory performance. In this paper we...... from a benchmark application written in C++. These results are finally compared to different binary and binary extension field implementations. The results show that the prime field implementation offers a large field size while maintaining a very good performance. We believe that using prime fields...

  3. Forms and Linear Network Codes

    DEFF Research Database (Denmark)

    Hansen, Johan P.

    We present a general theory to obtain linear network codes utilizing forms and obtain explicit families of equidimensional vector spaces, in which any pair of distinct vector spaces intersect in the same small dimension. The theory is inspired by the methods of the author utilizing the osculating...... spaces of Veronese varieties. Linear network coding transmits information in terms of a basis of a vector space and the information is received as a basis of a possibly altered vector space. Ralf Koetter and Frank R. Kschischang introduced a metric on the set af vector spaces and showed that a minimal...... distance decoder for this metric achieves correct decoding if the dimension of the intersection of the transmitted and received vector space is sufficiently large. The vector spaces in our construction are equidistant in the above metric and the distance between any pair of vector spaces is large making...

  4. A graph model for opportunistic network coding

    KAUST Repository

    Sorour, Sameh; Aboutoraby, Neda; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim

    2015-01-01

    © 2015 IEEE. Recent advancements in graph-based analysis and solutions of instantly decodable network coding (IDNC) trigger the interest to extend them to more complicated opportunistic network coding (ONC) scenarios, with limited increase

  5. Network coding at different layers in wireless networks

    CERN Document Server

    2016-01-01

    This book focuses on how to apply network coding at different layers in wireless networks – including MAC, routing, and TCP – with special focus on cognitive radio networks. It discusses how to select parameters in network coding (e.g., coding field, number of packets involved, and redundant information ration) in order to be suitable for the varying wireless environments. The book explores how to deploy network coding in MAC to improve network performance and examines joint network coding with opportunistic routing to improve the successful rate of routing. In regards to TCP and network coding, the text considers transport layer protocol working with network coding to overcome the transmission error rate, particularly with how to use the ACK feedback of TCP to enhance the efficiency of network coding. The book pertains to researchers and postgraduate students, especially whose interests are in opportunistic routing and TCP in cognitive radio networks.

  6. Network Coding for Wireless Cooperative Networks

    DEFF Research Database (Denmark)

    Khamfroush, Hana; Roetter, Daniel Enrique Lucani; Barros, João

    2014-01-01

    We consider the problem of finding an optimal packet transmission policy that minimizes the total cost of transmitting M data packets from a source S to two receivers R1,R2 over half-duplex, erasure channels. The source can either broadcast random linear network coding (RLNC) packets to the recei......We consider the problem of finding an optimal packet transmission policy that minimizes the total cost of transmitting M data packets from a source S to two receivers R1,R2 over half-duplex, erasure channels. The source can either broadcast random linear network coding (RLNC) packets...... to the receivers or transmit using unicast sessions at each time slot. We assume that the receivers can share their knowledge with each other by sending RLNC packets using unicast transmissions. We model this problem by using a Markov Decision Process (MDP), where the actions include the source of and type...... of transmission to be used in a given time slot given perfect knowledge of the system state. We study the distribution of actions selected by the MDP in terms of the knowledge at the receivers, the channel erasure probabilities, and the ratio between the cost of broadcast and unicast. This allowed us to learn...

  7. Optical network security using unipolar Walsh code

    Science.gov (United States)

    Sikder, Somali; Sarkar, Madhumita; Ghosh, Shila

    2018-04-01

    Optical code-division multiple-access (OCDMA) is considered as a good technique to provide optical layer security. Many research works have been published to enhance optical network security by using optical signal processing. The paper, demonstrates the design of the AWG (arrayed waveguide grating) router-based optical network for spectral-amplitude-coding (SAC) OCDMA networks with Walsh Code to design a reconfigurable network codec by changing signature codes to against eavesdropping. In this paper we proposed a code reconfiguration scheme to improve the network access confidentiality changing the signature codes by cyclic rotations, for OCDMA system. Each of the OCDMA network users is assigned a unique signature code to transmit the information and at the receiving end each receiver correlates its own signature pattern a(n) with the receiving pattern s(n). The signal arriving at proper destination leads to s(n)=a(n).

  8. Network Coding Protocols for Smart Grid Communications

    DEFF Research Database (Denmark)

    Prior, Rui; Roetter, Daniel Enrique Lucani; Phulpin, Yannick

    2014-01-01

    We propose a robust network coding protocol for enhancing the reliability and speed of data gathering in smart grids. At the heart of our protocol lies the idea of tunable sparse network coding, which adopts the transmission of sparsely coded packets at the beginning of the transmission process b...

  9. Optimal Near-Hitless Network Failure Recovery Using Diversity Coding

    Science.gov (United States)

    Avci, Serhat Nazim

    2013-01-01

    Link failures in wide area networks are common and cause significant data losses. Mesh-based protection schemes offer high capacity efficiency but they are slow, require complex signaling, and instable. Diversity coding is a proactive coding-based recovery technique which offers near-hitless (sub-ms) restoration with a competitive spare capacity…

  10. Applications of Coding in Network Communications

    Science.gov (United States)

    Chang, Christopher SungWook

    2012-01-01

    This thesis uses the tool of network coding to investigate fast peer-to-peer file distribution, anonymous communication, robust network construction under uncertainty, and prioritized transmission. In a peer-to-peer file distribution system, we use a linear optimization approach to show that the network coding framework significantly simplifies…

  11. Protection of electricity distribution networks

    CERN Document Server

    Gers, Juan M

    2004-01-01

    Written by two practicing electrical engineers, this second edition of the bestselling Protection of Electricity Distribution Networks offers both practical and theoretical coverage of the technologies, from the classical electromechanical relays to the new numerical types, which protect equipment on networks and in electrical plants. A properly coordinated protection system is vital to ensure that an electricity distribution network can operate within preset requirements for safety for individual items of equipment, staff and public, and the network overall. Suitable and reliable equipment sh

  12. Network coding for multi-resolution multicast

    DEFF Research Database (Denmark)

    2013-01-01

    A method, apparatus and computer program product for utilizing network coding for multi-resolution multicast is presented. A network source partitions source content into a base layer and one or more refinement layers. The network source receives a respective one or more push-back messages from one...... or more network destination receivers, the push-back messages identifying the one or more refinement layers suited for each one of the one or more network destination receivers. The network source computes a network code involving the base layer and the one or more refinement layers for at least one...... of the one or more network destination receivers, and transmits the network code to the one or more network destination receivers in accordance with the push-back messages....

  13. Network Coding Protocols for Data Gathering Applications

    DEFF Research Database (Denmark)

    Nistor, Maricica; Roetter, Daniel Enrique Lucani; Barros, João

    2015-01-01

    Tunable sparse network coding (TSNC) with various sparsity levels of the coded packets and different feedback mechanisms is analysed in the context of data gathering applications in multi-hop networks. The goal is to minimize the completion time, i.e., the total time required to collect all data ...

  14. A Mobile Application Prototype using Network Coding

    DEFF Research Database (Denmark)

    Pedersen, Morten Videbæk; Heide, Janus; Fitzek, Frank

    2010-01-01

    This paper looks into implementation details of network coding for a mobile application running on commercial mobile phones. We describe the necessary coding operations and algorithms that implements them. The coding algorithms forms the basis for a implementation in C++ and Symbian C++. We report...

  15. All-optical network coding for DPSK signals

    DEFF Research Database (Denmark)

    An, Yi; Da Ros, Francesco; Peucheret, Christophe

    2013-01-01

    All-optical network coding for path protection is experimentally demonstrated using four-wave mixing in SOAs for10 Gbit/s NRZ-DPSK signals with error free performance. The total power penalty after two cascaded XOR stage is only 2 dB.......All-optical network coding for path protection is experimentally demonstrated using four-wave mixing in SOAs for10 Gbit/s NRZ-DPSK signals with error free performance. The total power penalty after two cascaded XOR stage is only 2 dB....

  16. On Delay and Security in Network Coding

    Science.gov (United States)

    Dikaliotis, Theodoros K.

    2013-01-01

    In this thesis, delay and security issues in network coding are considered. First, we study the delay incurred in the transmission of a fixed number of packets through acyclic networks comprised of erasure links. The two transmission schemes studied are routing with hop-by-hop retransmissions, where every node in the network simply stores and…

  17. Audio coding in wireless acoustic sensor networks

    DEFF Research Database (Denmark)

    Zahedi, Adel; Østergaard, Jan; Jensen, Søren Holdt

    2015-01-01

    In this paper, we consider the problem of source coding for a wireless acoustic sensor network where each node in the network makes its own noisy measurement of the sound field, and communicates with other nodes in the network by sending and receiving encoded versions of the measurements. To make...

  18. PV installations, protection and the code

    Energy Technology Data Exchange (ETDEWEB)

    Silecky, L. [Mersen, Toronto, ON (Canada)

    2010-12-15

    This article discussed the need for improved standards in Ontario's solar industry to ensure safety for the systems and also safety for the workers. Photovoltaic cells used in solar arrays can now deliver between 50 vDC to 600 vDC. The workings of such a high voltage photocell must be understood in order to understand its protection needs. Since PVs are semiconductors and susceptible to damage from short circuits and overloads, a fast-acting overcurrent protective device (OCPD) should be used. Combiner boxes are also needed to provide a clean method of safely connecting all the wires that are needed in the system, including surge protection and a means of isolation between the PV array and the inverter. Section 50 of the Canadian Electrical Code outlines the requirements for solar PV systems, but it does not mention the protection of DC circuits, including DC fuse protectors which are manufactured to provide a high degree of protection for the PV array. As the photovoltaic (PV) market continues to grow in Ontario, the PV industry also has a responsibility to ensure it is in compliance with codes and standards related to photovoltaic systems. This author suggested that Article 690 of the National Electric Code (NEC) is a good document to use when determining the requirements for PV systems. 3 figs.

  19. Opportunistic Adaptive Transmission for Network Coding Using Nonbinary LDPC Codes

    Directory of Open Access Journals (Sweden)

    Cocco Giuseppe

    2010-01-01

    Full Text Available Network coding allows to exploit spatial diversity naturally present in mobile wireless networks and can be seen as an example of cooperative communication at the link layer and above. Such promising technique needs to rely on a suitable physical layer in order to achieve its best performance. In this paper, we present an opportunistic packet scheduling method based on physical layer considerations. We extend channel adaptation proposed for the broadcast phase of asymmetric two-way bidirectional relaying to a generic number of sinks and apply it to a network context. The method consists of adapting the information rate for each receiving node according to its channel status and independently of the other nodes. In this way, a higher network throughput can be achieved at the expense of a slightly higher complexity at the transmitter. This configuration allows to perform rate adaptation while fully preserving the benefits of channel and network coding. We carry out an information theoretical analysis of such approach and of that typically used in network coding. Numerical results based on nonbinary LDPC codes confirm the effectiveness of our approach with respect to previously proposed opportunistic scheduling techniques.

  20. Reliable Communication in Wireless Meshed Networks using Network Coding

    DEFF Research Database (Denmark)

    Pahlevani, Peyman; Paramanathan, Achuthan; Hundebøll, Martin

    2012-01-01

    The advantages of network coding have been extensively studied in the field of wireless networks. Integrating network coding with existing IEEE 802.11 MAC layer is a challenging problem. The IEEE 802.11 MAC does not provide any reliability mechanisms for overheard packets. This paper addresses...... this problem and suggests different mechanisms to support reliability as part of the MAC protocol. Analytical expressions to this problem are given to qualify the performance of the modified network coding. These expressions are confirmed by numerical result. While the suggested reliability mechanisms...

  1. Low Computational Complexity Network Coding For Mobile Networks

    DEFF Research Database (Denmark)

    Heide, Janus

    2012-01-01

    Network Coding (NC) is a technique that can provide benefits in many types of networks, some examples from wireless networks are: In relay networks, either the physical or the data link layer, to reduce the number of transmissions. In reliable multicast, to reduce the amount of signaling and enable......-flow coding technique. One of the key challenges of this technique is its inherent computational complexity which can lead to high computational load and energy consumption in particular on the mobile platforms that are the target platform in this work. To increase the coding throughput several...

  2. Applying Physical-Layer Network Coding in Wireless Networks

    Directory of Open Access Journals (Sweden)

    Liew SoungChang

    2010-01-01

    Full Text Available A main distinguishing feature of a wireless network compared with a wired network is its broadcast nature, in which the signal transmitted by a node may reach several other nodes, and a node may receive signals from several other nodes, simultaneously. Rather than a blessing, this feature is treated more as an interference-inducing nuisance in most wireless networks today (e.g., IEEE 802.11. This paper shows that the concept of network coding can be applied at the physical layer to turn the broadcast property into a capacity-boosting advantage in wireless ad hoc networks. Specifically, we propose a physical-layer network coding (PNC scheme to coordinate transmissions among nodes. In contrast to "straightforward" network coding which performs coding arithmetic on digital bit streams after they have been received, PNC makes use of the additive nature of simultaneously arriving electromagnetic (EM waves for equivalent coding operation. And in doing so, PNC can potentially achieve 100% and 50% throughput increases compared with traditional transmission and straightforward network coding, respectively, in 1D regular linear networks with multiple random flows. The throughput improvements are even larger in 2D regular networks: 200% and 100%, respectively.

  3. Reliability of Broadcast Communications Under Sparse Random Linear Network Coding

    OpenAIRE

    Brown, Suzie; Johnson, Oliver; Tassi, Andrea

    2018-01-01

    Ultra-reliable Point-to-Multipoint (PtM) communications are expected to become pivotal in networks offering future dependable services for smart cities. In this regard, sparse Random Linear Network Coding (RLNC) techniques have been widely employed to provide an efficient way to improve the reliability of broadcast and multicast data streams. This paper addresses the pressing concern of providing a tight approximation to the probability of a user recovering a data stream protected by this kin...

  4. Network Coding in the Bidirectional Cross

    DEFF Research Database (Denmark)

    Ertli, Gergö; Paramanathan, Achuthan; Rein, Stephan Alexander

    2013-01-01

    This paper presents a detailed performance evaluation of inter-session network coding in wireless meshed networks in terms of throughput and energy consumption. A full analytical model is given for three different communication approaches for the bidirectional cross topology using an IEEE 802.11 ...

  5. Spike Code Flow in Cultured Neuronal Networks.

    Science.gov (United States)

    Tamura, Shinichi; Nishitani, Yoshi; Hosokawa, Chie; Miyoshi, Tomomitsu; Sawai, Hajime; Kamimura, Takuya; Yagi, Yasushi; Mizuno-Matsumoto, Yuko; Chen, Yen-Wei

    2016-01-01

    We observed spike trains produced by one-shot electrical stimulation with 8 × 8 multielectrodes in cultured neuronal networks. Each electrode accepted spikes from several neurons. We extracted the short codes from spike trains and obtained a code spectrum with a nominal time accuracy of 1%. We then constructed code flow maps as movies of the electrode array to observe the code flow of "1101" and "1011," which are typical pseudorandom sequence such as that we often encountered in a literature and our experiments. They seemed to flow from one electrode to the neighboring one and maintained their shape to some extent. To quantify the flow, we calculated the "maximum cross-correlations" among neighboring electrodes, to find the direction of maximum flow of the codes with lengths less than 8. Normalized maximum cross-correlations were almost constant irrespective of code. Furthermore, if the spike trains were shuffled in interval orders or in electrodes, they became significantly small. Thus, the analysis suggested that local codes of approximately constant shape propagated and conveyed information across the network. Hence, the codes can serve as visible and trackable marks of propagating spike waves as well as evaluating information flow in the neuronal network.

  6. Spike Code Flow in Cultured Neuronal Networks

    Directory of Open Access Journals (Sweden)

    Shinichi Tamura

    2016-01-01

    Full Text Available We observed spike trains produced by one-shot electrical stimulation with 8 × 8 multielectrodes in cultured neuronal networks. Each electrode accepted spikes from several neurons. We extracted the short codes from spike trains and obtained a code spectrum with a nominal time accuracy of 1%. We then constructed code flow maps as movies of the electrode array to observe the code flow of “1101” and “1011,” which are typical pseudorandom sequence such as that we often encountered in a literature and our experiments. They seemed to flow from one electrode to the neighboring one and maintained their shape to some extent. To quantify the flow, we calculated the “maximum cross-correlations” among neighboring electrodes, to find the direction of maximum flow of the codes with lengths less than 8. Normalized maximum cross-correlations were almost constant irrespective of code. Furthermore, if the spike trains were shuffled in interval orders or in electrodes, they became significantly small. Thus, the analysis suggested that local codes of approximately constant shape propagated and conveyed information across the network. Hence, the codes can serve as visible and trackable marks of propagating spike waves as well as evaluating information flow in the neuronal network.

  7. MINET [momentum integral network] code documentation

    International Nuclear Information System (INIS)

    Van Tuyle, G.J.; Nepsee, T.C.; Guppy, J.G.

    1989-12-01

    The MINET computer code, developed for the transient analysis of fluid flow and heat transfer, is documented in this four-part reference. In Part 1, the MINET models, which are based on a momentum integral network method, are described. The various aspects of utilizing the MINET code are discussed in Part 2, The User's Manual. The third part is a code description, detailing the basic code structure and the various subroutines and functions that make up MINET. In Part 4, example input decks, as well as recent validation studies and applications of MINET are summarized. 32 refs., 36 figs., 47 tabs

  8. Convolutional coding techniques for data protection

    Science.gov (United States)

    Massey, J. L.

    1975-01-01

    Results of research on the use of convolutional codes in data communications are presented. Convolutional coding fundamentals are discussed along with modulation and coding interaction. Concatenated coding systems and data compression with convolutional codes are described.

  9. On Network Coded Distributed Storage

    DEFF Research Database (Denmark)

    Cabrera Guerrero, Juan Alberto; Roetter, Daniel Enrique Lucani; Fitzek, Frank Hanns Paul

    2016-01-01

    systems typically rely on expensive infrastructure with centralized control to store, repair and access the data. This approach introduces a large delay for accessing and storing the data driven in part by a high RTT between users and the cloud. These characteristics are at odds with the massive increase......This paper focuses on distributed fog storage solutions, where a number of unreliable devices organize themselves in Peer-to-Peer (P2P) networks with the purpose to store reliably their data and that of other devices and/or local users and provide lower delay and higher throughput. Cloud storage...... of devices and generated data in coming years as well as the requirements of low latency in many applications. We focus on characterizing optimal solutions for maintaining data availability when nodes in the fog continuously leave the network. In contrast with state-of-the-art data repair formulations, which...

  10. Radon Protection in the Technical Building Code

    International Nuclear Information System (INIS)

    Frutos, B.; Garcia, J. P.; Martin, J. L.; Olaya, M.; Serrano, J I.; Suarez, E.; Fernandez, J. A.; Rodrigo, F.

    2003-01-01

    Building construction in areas with high radon gas contamination in land requires the incorporation of certain measures in order to prevent the accumulation of this gas on the inside of buildings. These measures should be considered primarily in the design and construction phases and should take the area of the country into consideration where the construction will take place depending on the potential risk of radon entrance. Within the Technical Building Code, radon protection has been considered through general classification of the country and specific areas where building construction is to take place, in different risk categories and in the introduction of building techniques appropriate for each area. (Author) 17 refs

  11. Conflict free network coding for distributed storage networks

    KAUST Repository

    Al-Habob, Ahmed A.; Sorour, Sameh; Aboutorab, Neda; Sadeghi, Parastoo

    2015-01-01

    © 2015 IEEE. In this paper, we design a conflict free instantly decodable network coding (IDNC) solution for file download from distributed storage servers. Considering previously downloaded files at the clients from these servers as side

  12. Network Coding Applications and Implementations on Mobile Devices

    DEFF Research Database (Denmark)

    Fitzek, Frank; Pedersen, Morten Videbæk; Heide, Janus

    2010-01-01

    Network coding has attracted a lot of attention lately. The goal of this paper is to demonstrate that the implementation of network coding is feasible on mobile platforms. The paper will guide the reader through some examples and demonstrate uses for network coding. Furthermore the paper will also...... show that the implementation of network coding is feasible today on commercial mobile platforms....

  13. A Network Coding Approach to Loss Tomography

    DEFF Research Database (Denmark)

    Sattari, Pegah; Markopoulou, Athina; Fragouli, Christina

    2013-01-01

    network coding capabilities. We design a framework for estimating link loss rates, which leverages network coding capabilities and we show that it improves several aspects of tomography, including the identifiability of links, the tradeoff between estimation accuracy and bandwidth efficiency......, and the complexity of probe path selection. We discuss the cases of inferring the loss rates of links in a tree topology or in a general topology. In the latter case, the benefits of our approach are even more pronounced compared to standard techniques but we also face novel challenges, such as dealing with cycles...

  14. CATHENA 4. A thermalhydraulics network analysis code

    International Nuclear Information System (INIS)

    Aydemir, N.U.; Hanna, B.N.

    2009-01-01

    Canadian Algorithm for THErmalhydraulic Network Analysis (CATHENA) is a one-dimensional, non-equilibrium, two-phase, two fluid network analysis code that has been in use for over two decades by various groups in Canada and around the world. The objective of the present paper is to describe the design, application and future development plans for the CATHENA 4 thermalhydraulics network analysis code, which is a modernized version of the present frozen CATHENA 3 code. The new code is designed in modular form, using the Fortran 95 (F95) programming language. The semi-implicit numerical integration scheme of CATHENA 3 is re-written to implement a fully-implicit methodology using Newton's iterative solution scheme suitable for nonlinear equations. The closure relations, as a first step, have been converted from the existing CATHENA 3 implementation to F95 but modularized to achieve ease of maintenance. The paper presents the field equations, followed by a description of the Newton's scheme used. The finite-difference form of the field equations is given, followed by a discussion of convergence criteria. Two applications of CATHENA 4 are presented to demonstrate the temporal and spatial convergence of the new code for problems with known solutions or available experimental data. (author)

  15. Erasure Coded Storage on a Changing Network

    DEFF Research Database (Denmark)

    Sipos, Marton A.; Venkat, Narayan; Oran, David

    2016-01-01

    As faster storage devices become commercially viable alternatives to disk drives, the network is increasingly becoming the bottleneck in achieving good performance in distributed storage systems. This is especially true for erasure coded storage, where the reconstruction of lost data can signific...

  16. Impact of intra-flow network coding on the relay channel performance: an analytical study

    OpenAIRE

    Apavatjrut , Anya; Goursaud , Claire; Jaffrès-Runser , Katia; Gorce , Jean-Marie

    2012-01-01

    International audience; One of the most powerful ways to achieve trans- mission reliability over wireless links is to employ efficient coding techniques. This paper investigates the performance of a transmission over a relay channel where information is protected by two layers of coding. In the first layer, transmission reliability is ensured by fountain coding at the source. The second layer incorporates network coding at the relay node. Thus, fountain coded packets are re-encoded at the relay...

  17. Distributed Cloud Storage Using Network Coding

    OpenAIRE

    Sipos, Marton A.; Fitzek, Frank; Roetter, Daniel Enrique Lucani; Pedersen, Morten Videbæk

    2014-01-01

    Distributed storage is usually considered within acloud provider to ensure availability and reliability of the data.However, the user is still directly dependent on the quality of asingle system. It is also entrusting the service provider with largeamounts of private data, which may be accessed by a successfulattack to that cloud system or even be inspected by governmentagencies in some countries. This paper advocates a generalframework for network coding enabled distributed storage overmulti...

  18. Learning and coding in biological neural networks

    Science.gov (United States)

    Fiete, Ila Rani

    How can large groups of neurons that locally modify their activities learn to collectively perform a desired task? Do studies of learning in small networks tell us anything about learning in the fantastically large collection of neurons that make up a vertebrate brain? What factors do neurons optimize by encoding sensory inputs or motor commands in the way they do? In this thesis I present a collection of four theoretical works: each of the projects was motivated by specific constraints and complexities of biological neural networks, as revealed by experimental studies; together, they aim to partially address some of the central questions of neuroscience posed above. We first study the role of sparse neural activity, as seen in the coding of sequential commands in a premotor area responsible for birdsong. We show that the sparse coding of temporal sequences in the songbird brain can, in a network where the feedforward plastic weights must translate the sparse sequential code into a time-varying muscle code, facilitate learning by minimizing synaptic interference. Next, we propose a biologically plausible synaptic plasticity rule that can perform goal-directed learning in recurrent networks of voltage-based spiking neurons that interact through conductances. Learning is based on the correlation of noisy local activity with a global reward signal; we prove that this rule performs stochastic gradient ascent on the reward. Thus, if the reward signal quantifies network performance on some desired task, the plasticity rule provably drives goal-directed learning in the network. To assess the convergence properties of the learning rule, we compare it with a known example of learning in the brain. Song-learning in finches is a clear example of a learned behavior, with detailed available neurophysiological data. With our learning rule, we train an anatomically accurate model birdsong network that drives a sound source to mimic an actual zebrafinch song. Simulation and

  19. Emulating Wired Backhaul with Wireless Network Coding

    DEFF Research Database (Denmark)

    Thomsen, Henning; De Carvalho, Elisabeth; Popovski, Petar

    2014-01-01

    In this paper we address the need for wireless network densification. We propose a solution wherein the wired backhaul employed in heterogeneous cellular networks is replaced with wireless links, while maintaining the rate requirements of the uplink and downlink traffic of each user. The first...... of the two-way protocol. The transmit power is set high enough to enable successive decoding at the small cell base station where the downlink data to the user is first decoded and its contribution removed from the received signal followed by the uplink data from the user. The decoding of the second layer......, the uplink traffic to the user, remains identical to the one performed in a wired system. In the broadcast phase, the decoding of the downlink traffic can also be guaranteed to remain identical. Hence, our solution claims an emulation of a wired backhaul with wireless network coding with same performance. We...

  20. Composite Extension Finite Fields for Low Overhead Network Coding

    DEFF Research Database (Denmark)

    Heide, Janus; Roetter, Daniel Enrique Lucani

    2015-01-01

    Although Network Coding (NC) has been proven to increase throughput and reliability in communication networks, its adoption is typically hindered by the additional complexity it introduces at various nodes in the network and the overhead to signal the coding coefficients associated with each code...

  1. Generalized instantly decodable network coding for relay-assisted networks

    KAUST Repository

    Elmahdy, Adel M.

    2013-09-01

    In this paper, we investigate the problem of minimizing the frame completion delay for Instantly Decodable Network Coding (IDNC) in relay-assisted wireless multicast networks. We first propose a packet recovery algorithm in the single relay topology which employs generalized IDNC instead of strict IDNC previously proposed in the literature for the same relay-assisted topology. This use of generalized IDNC is supported by showing that it is a super-set of the strict IDNC scheme, and thus can generate coding combinations that are at least as efficient as strict IDNC in reducing the average completion delay. We then extend our study to the multiple relay topology and propose a joint generalized IDNC and relay selection algorithm. This proposed algorithm benefits from the reception diversity of the multiple relays to further reduce the average completion delay in the network. Simulation results show that our proposed solutions achieve much better performance compared to previous solutions in the literature. © 2013 IEEE.

  2. Non-coding RNA networks in cancer.

    Science.gov (United States)

    Anastasiadou, Eleni; Jacob, Leni S; Slack, Frank J

    2018-01-01

    Thousands of unique non-coding RNA (ncRNA) sequences exist within cells. Work from the past decade has altered our perception of ncRNAs from 'junk' transcriptional products to functional regulatory molecules that mediate cellular processes including chromatin remodelling, transcription, post-transcriptional modifications and signal transduction. The networks in which ncRNAs engage can influence numerous molecular targets to drive specific cell biological responses and fates. Consequently, ncRNAs act as key regulators of physiological programmes in developmental and disease contexts. Particularly relevant in cancer, ncRNAs have been identified as oncogenic drivers and tumour suppressors in every major cancer type. Thus, a deeper understanding of the complex networks of interactions that ncRNAs coordinate would provide a unique opportunity to design better therapeutic interventions.

  3. Application and Implementation of Network Coding for Cooperative Wireless Networks

    DEFF Research Database (Denmark)

    Pedersen, Morten Videbæk

    2012-01-01

    the initial development of systems and protocols and show that the potential is there. However, I also find that network coding needs to be implemented with care and protocols have to be designed with consideration to make use of this novel technique. 2) The final aspect of this PhD investigates different...... ways that cooperative models may be implemented to cover a wide range of applications. This addresses the development of user cooperative protocols and how we in Device To Device (D2D) communication may reward users that contribute more to the network than they gain. In this area I suggest the use...

  4. A graph model for opportunistic network coding

    KAUST Repository

    Sorour, Sameh

    2015-08-12

    © 2015 IEEE. Recent advancements in graph-based analysis and solutions of instantly decodable network coding (IDNC) trigger the interest to extend them to more complicated opportunistic network coding (ONC) scenarios, with limited increase in complexity. In this paper, we design a simple IDNC-like graph model for a specific subclass of ONC, by introducing a more generalized definition of its vertices and the notion of vertex aggregation in order to represent the storage of non-instantly-decodable packets in ONC. Based on this representation, we determine the set of pairwise vertex adjacency conditions that can populate this graph with edges so as to guarantee decodability or aggregation for the vertices of each clique in this graph. We then develop the algorithmic procedures that can be applied on the designed graph model to optimize any performance metric for this ONC subclass. A case study on reducing the completion time shows that the proposed framework improves on the performance of IDNC and gets very close to the optimal performance.

  5. On Identifying which Intermediate Nodes Should Code in Multicast Networks

    DEFF Research Database (Denmark)

    Pinto, Tiago; Roetter, Daniel Enrique Lucani; Médard, Muriel

    2013-01-01

    the data packets. Previous work has shown that in lossless wireline networks, the performance of tree-packing mechanisms is comparable to network coding, albeit with added complexity at the time of computing the trees. This means that most nodes in the network need not code. Thus, mechanisms that identify...... intermediate nodes that do require coding is instrumental for the efficient operation of coded networks and can have a significant impact in overall energy consumption. We present a distributed, low complexity algorithm that allows every node to identify if it should code and, if so, through what output link...

  6. Preemptive mobile code protection using spy agents

    OpenAIRE

    Kalogridis, Georgios

    2011-01-01

    This thesis introduces 'spy agents' as a new security paradigm for evaluating trust in remote hosts in mobile code scenarios. In this security paradigm, a spy agent, i.e. a mobile agent which circulates amongst a number of remote hosts, can employ a variety of techniques in order to both appear 'normal' and suggest to a malicious host that it can 'misuse' the agent's data or code without being held accountable. A framework for the operation and deployment of such spy agents is described. ...

  7. Code of practice for radiation protection in veterinary medicine

    International Nuclear Information System (INIS)

    Duffy, J.; Fenton, D.; McGarry, A.; McAllister, H.; Skelly, C

    2002-11-01

    This Code of Practice updates the Code of Practice on Radiation Protection in Veterinary Radiology prepared by the Nuclear Energy Board in June 1989. The Code is designed to give guidance to veterinary surgeons to ensure that they, their employees and members of the public are adequately protected from the hazards of ionising radiation arising from the use of X-ray equipment and radioactive substances in the practice of veterinary medicine. It reflects the regulations as specified in the Radiological Protection Act, 1991, (Ionising Radiation) Order, 2000 (S.I. No. 125 of 2000)

  8. Medical data protection: a proposal for a deontology code.

    Science.gov (United States)

    Gritzalis, D; Tomaras, A; Katsikas, S; Keklikoglou, J

    1990-12-01

    In this paper, a proposal for a Medical Data Protection Deontology Code in Greece is presented. Undoubtedly, this code should also be of interest to other countries. The whole effort for the composition of this code is based on what holds internationally, particularly in the EC countries, on recent data acquired from Greek sources and on the experience resulting from what is acceptable in Greece. Accordingly, policies and their influence on the protection of health data, as well as main problems related to that protection, have been considered.

  9. Securing optical code-division multiple-access networks with a postswitching coding scheme of signature reconfiguration

    Science.gov (United States)

    Huang, Jen-Fa; Meng, Sheng-Hui; Lin, Ying-Chen

    2014-11-01

    The optical code-division multiple-access (OCDMA) technique is considered a good candidate for providing optical layer security. An enhanced OCDMA network security mechanism with a pseudonoise (PN) random digital signals type of maximal-length sequence (M-sequence) code switching to protect against eavesdropping is presented. Signature codes unique to individual OCDMA-network users are reconfigured according to the register state of the controlling electrical shift registers. Examples of signature reconfiguration following state switching of the controlling shift register for both the network user and the eavesdropper are numerically illustrated. Dynamically changing the PN state of the shift register to reconfigure the user signature sequence is shown; this hinders eavesdroppers' efforts to decode correct data sequences. The proposed scheme increases the probability of eavesdroppers committing errors in decoding and thereby substantially enhances the degree of an OCDMA network's confidentiality.

  10. Random Linear Network Coding for 5G Mobile Video Delivery

    Directory of Open Access Journals (Sweden)

    Dejan Vukobratovic

    2018-03-01

    Full Text Available An exponential increase in mobile video delivery will continue with the demand for higher resolution, multi-view and large-scale multicast video services. Novel fifth generation (5G 3GPP New Radio (NR standard will bring a number of new opportunities for optimizing video delivery across both 5G core and radio access networks. One of the promising approaches for video quality adaptation, throughput enhancement and erasure protection is the use of packet-level random linear network coding (RLNC. In this review paper, we discuss the integration of RLNC into the 5G NR standard, building upon the ideas and opportunities identified in 4G LTE. We explicitly identify and discuss in detail novel 5G NR features that provide support for RLNC-based video delivery in 5G, thus pointing out to the promising avenues for future research.

  11. Protection of Low Voltage CIGRE distribution Network

    DEFF Research Database (Denmark)

    Mustafa, Ghullam; Bak-Jensen, Birgitte; Bak, Claus Leth

    2013-01-01

    High quality electricity services are the prime objectives in the modern power systems around the world. One of the main players to achieve this is protection of the system which needs to be fast, reliable and cost effective. The study about the protection of the Low Voltage (LV) CIGRE distribution...... grid and networks like this has been proposed in this paper. The main objective of this paper is to develop protection against short circuit faults which might appear any-where in the network. The protection of the power networks that comprises of renewable energy generation units is complicated...... because of the bidirectional flow of the current and is a challenge for the protection engineers. The selection of the protection devices in this paper is made to protect the network against faults in grid connected and island mode of operation. Ultra-fast fuses are proposed in order to protect...

  12. Code of practice of radiation protection in fixed nuclear gauges

    International Nuclear Information System (INIS)

    Eltayeb, M. A. M.

    2012-09-01

    The present work aims at developing and updating a code of practice of radiation protection in fixed nuclear gauges that comply with current international recommendations. The work also intended to evaluate the current radiation protection situation in two selected companies using nuclear gauges in Sudan. A draft of the code is proposed which includes the basic principle of protection such as source construction and gauges radiation monitoring, storage maintenance and leak testing as well as specific issues related to nuclear gauges. The practical part of this study included investigation of radiation protection in the comparisons using nuclear gauges for level detection, to evaluate the level of radiation protection and the compliance to the regulatory authority regulations. The result revealed that the two companies do not have an effective radiation protection program and that can lead to exposure of workers to unnecessary doses. Some recommendations were stated, if implemented they could improve the status of radiation protection in those companies. (Author)

  13. Improved Design of Unequal Error Protection LDPC Codes

    Directory of Open Access Journals (Sweden)

    Sandberg Sara

    2010-01-01

    Full Text Available We propose an improved method for designing unequal error protection (UEP low-density parity-check (LDPC codes. The method is based on density evolution. The degree distribution with the best UEP properties is found, under the constraint that the threshold should not exceed the threshold of a non-UEP code plus some threshold offset. For different codeword lengths and different construction algorithms, we search for good threshold offsets for the UEP code design. The choice of the threshold offset is based on the average a posteriori variable node mutual information. Simulations reveal the counter intuitive result that the short-to-medium length codes designed with a suitable threshold offset all outperform the corresponding non-UEP codes in terms of average bit-error rate. The proposed codes are also compared to other UEP-LDPC codes found in the literature.

  14. Variable weight spectral amplitude coding for multiservice OCDMA networks

    Science.gov (United States)

    Seyedzadeh, Saleh; Rahimian, Farzad Pour; Glesk, Ivan; Kakaee, Majid H.

    2017-09-01

    The emergence of heterogeneous data traffic such as voice over IP, video streaming and online gaming have demanded networks with capability of supporting quality of service (QoS) at the physical layer with traffic prioritisation. This paper proposes a new variable-weight code based on spectral amplitude coding for optical code-division multiple-access (OCDMA) networks to support QoS differentiation. The proposed variable-weight multi-service (VW-MS) code relies on basic matrix construction. A mathematical model is developed for performance evaluation of VW-MS OCDMA networks. It is shown that the proposed code provides an optimal code length with minimum cross-correlation value when compared to other codes. Numerical results for a VW-MS OCDMA network designed for triple-play services operating at 0.622 Gb/s, 1.25 Gb/s and 2.5 Gb/s are considered.

  15. Performance analysis of WS-EWC coded optical CDMA networks with/without LDPC codes

    Science.gov (United States)

    Huang, Chun-Ming; Huang, Jen-Fa; Yang, Chao-Chin

    2010-10-01

    One extended Welch-Costas (EWC) code family for the wavelength-division-multiplexing/spectral-amplitude coding (WDM/SAC; WS) optical code-division multiple-access (OCDMA) networks is proposed. This system has a superior performance as compared to the previous modified quadratic congruence (MQC) coded OCDMA networks. However, since the performance of such a network is unsatisfactory when the data bit rate is higher, one class of quasi-cyclic low-density parity-check (QC-LDPC) code is adopted to improve that. Simulation results show that the performance of the high-speed WS-EWC coded OCDMA network can be greatly improved by using the LDPC codes.

  16. On the Need of Network coding for Mobile Clouds

    DEFF Research Database (Denmark)

    Fitzek, Frank; Heide, Janus; Pedersen, Morten Videbæk

    for mobile clouds. The paper will list the benefits of network coding for mobile clouds as well as introduce both concepts in a tutorial way. The results used throughout this paper are collaborative work of different research institutes, but mainly taken from the mobile device group at Aalborg University.......This paper advocates the need of network coding for mobile clouds. Mobile clouds as well as network coding are describing two novel concepts. The concept of mobile clouds describes the potential of mobile devices to communicate with each other and form a cooperative cluster in which new services...... and potentials are created. Network coding on the other side enables the mobile cloud to communicate in a very efficient and secure way in terms of energy and bandwidth usage. Even though network coding can be applied in a variety of communication networks, it has some inherent features that makes it suitable...

  17. Enhancement of Unequal Error Protection Properties of LDPC Codes

    Directory of Open Access Journals (Sweden)

    Poulliat Charly

    2007-01-01

    Full Text Available It has been widely recognized in the literature that irregular low-density parity-check (LDPC codes exhibit naturally an unequal error protection (UEP behavior. In this paper, we propose a general method to emphasize and control the UEP properties of LDPC codes. The method is based on a hierarchical optimization of the bit node irregularity profile for each sensitivity class within the codeword by maximizing the average bit node degree while guaranteeing a minimum degree as high as possible. We show that this optimization strategy is efficient, since the codes that we optimize show better UEP capabilities than the codes optimized for the additive white Gaussian noise channel.

  18. On the Need of Novel Medium Access Control Schemes for Network Coding enabled Wireless Mesh Networks

    DEFF Research Database (Denmark)

    Paramanathan, Achuthan; Pahlevani, Peyman; Roetter, Daniel Enrique Lucani

    2013-01-01

    that network coding will improve the throughput in such systems, but our novel medium access scheme improves the performance in the cross topology by another 66 % for network coding and 150 % for classical forwarding in theory. These gains translate in a theoretical gain of 33 % of network coding over...

  19. Sending policies in dynamic wireless mesh using network coding

    DEFF Research Database (Denmark)

    Pandi, Sreekrishna; Fitzek, Frank; Pihl, Jeppe

    2015-01-01

    This paper demonstrates the quick prototyping capabilities of the Python-Kodo library for network coding based performance evaluation and investigates the problem of data redundancy in a network coded wireless mesh with opportunistic overhearing. By means of several wireless meshed architectures ...

  20. O2-GIDNC: Beyond instantly decodable network coding

    KAUST Repository

    Aboutorab, Neda; Sorour, Sameh; Sadeghi, Parastoo

    2013-01-01

    In this paper, we are concerned with extending the graph representation of generalized instantly decodable network coding (GIDNC) to a more general opportunistic network coding (ONC) scenario, referred to as order-2 GIDNC (O2-GIDNC). In the O2-GIDNC

  1. Multimedia distribution using network coding on the iphone platform

    DEFF Research Database (Denmark)

    Vingelmann, Peter; Pedersen, Morten Videbæk; Fitzek, Frank

    2010-01-01

    This paper looks into the implementation details of random linear network coding on the Apple iPhone and iPod Touch mobile platforms for multimedia distribution. Previous implementations of network coding on this platform failed to achieve a throughput which is sufficient to saturate the WLAN...

  2. A New Prime Code for Synchronous Optical Code Division Multiple-Access Networks

    Directory of Open Access Journals (Sweden)

    Huda Saleh Abbas

    2018-01-01

    Full Text Available A new spreading code based on a prime code for synchronous optical code-division multiple-access networks that can be used in monitoring applications has been proposed. The new code is referred to as “extended grouped new modified prime code.” This new code has the ability to support more terminal devices than other prime codes. In addition, it patches subsequences with “0s” leading to lower power consumption. The proposed code has an improved cross-correlation resulting in enhanced BER performance. The code construction and parameters are provided. The operating performance, using incoherent on-off keying modulation and incoherent pulse position modulation systems, has been analyzed. The performance of the code was compared with other prime codes. The results demonstrate an improved performance, and a BER floor of 10−9 was achieved.

  3. Rate Aware Instantly Decodable Network Codes

    KAUST Repository

    Douik, Ahmed

    2016-02-26

    This paper addresses the problem of reducing the delivery time of data messages to cellular users using instantly decodable network coding (IDNC) with physical-layer rate awareness. While most of the existing literature on IDNC does not consider any physical layer complications, this paper proposes a cross-layer scheme that incorporates the different channel rates of the various users in the decision process of both the transmitted message combinations and the rates with which they are transmitted. The completion time minimization problem in such scenario is first shown to be intractable. The problem is, thus, approximated by reducing, at each transmission, the increase of an anticipated version of the completion time. The paper solves the problem by formulating it as a maximum weight clique problem over a newly designed rate aware IDNC (RA-IDNC) graph. Further, the paper provides a multi-layer solution to improve the completion time approximation. Simulation results suggest that the cross-layer design largely outperforms the uncoded transmissions strategies and the classical IDNC scheme. © 2015 IEEE.

  4. Rate Aware Instantly Decodable Network Codes

    KAUST Repository

    Douik, Ahmed; Sorour, Sameh; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim

    2016-01-01

    This paper addresses the problem of reducing the delivery time of data messages to cellular users using instantly decodable network coding (IDNC) with physical-layer rate awareness. While most of the existing literature on IDNC does not consider any physical layer complications, this paper proposes a cross-layer scheme that incorporates the different channel rates of the various users in the decision process of both the transmitted message combinations and the rates with which they are transmitted. The completion time minimization problem in such scenario is first shown to be intractable. The problem is, thus, approximated by reducing, at each transmission, the increase of an anticipated version of the completion time. The paper solves the problem by formulating it as a maximum weight clique problem over a newly designed rate aware IDNC (RA-IDNC) graph. Further, the paper provides a multi-layer solution to improve the completion time approximation. Simulation results suggest that the cross-layer design largely outperforms the uncoded transmissions strategies and the classical IDNC scheme. © 2015 IEEE.

  5. Energy-Efficient Cluster Based Routing Protocol in Mobile Ad Hoc Networks Using Network Coding

    OpenAIRE

    Srinivas Kanakala; Venugopal Reddy Ananthula; Prashanthi Vempaty

    2014-01-01

    In mobile ad hoc networks, all nodes are energy constrained. In such situations, it is important to reduce energy consumption. In this paper, we consider the issues of energy efficient communication in MANETs using network coding. Network coding is an effective method to improve the performance of wireless networks. COPE protocol implements network coding concept to reduce number of transmissions by mixing the packets at intermediate nodes. We incorporate COPE into cluster based routing proto...

  6. Fast frequency hopping codes applied to SAC optical CDMA network

    Science.gov (United States)

    Tseng, Shin-Pin

    2015-06-01

    This study designed a fast frequency hopping (FFH) code family suitable for application in spectral-amplitude-coding (SAC) optical code-division multiple-access (CDMA) networks. The FFH code family can effectively suppress the effects of multiuser interference and had its origin in the frequency hopping code family. Additional codes were developed as secure codewords for enhancing the security of the network. In considering the system cost and flexibility, simple optical encoders/decoders using fiber Bragg gratings (FBGs) and a set of optical securers using two arrayed-waveguide grating (AWG) demultiplexers (DeMUXs) were also constructed. Based on a Gaussian approximation, expressions for evaluating the bit error rate (BER) and spectral efficiency (SE) of SAC optical CDMA networks are presented. The results indicated that the proposed SAC optical CDMA network exhibited favorable performance.

  7. PRIVACY PROTECTION PROBLEMS IN SOCIAL NETWORKS

    OpenAIRE

    OKUR, M. Cudi

    2011-01-01

    Protecting privacy has become a major concern for most social network users because of increased difficulties of controlling the online data. This article presents an assessment of the common privacy related risks of social networking sites. Open and hidden privacy risks of active and passive online profiles are examined and increasing share of social networking in these phenomena is discussed. Inadequacy of available legal and institutional protection is demonstrated and the effectiveness of...

  8. Lightening protection, techniques, applied codes and standards. Vol. 4

    International Nuclear Information System (INIS)

    Mahmoud, M.; Shaaban, H.; Lamey, S.

    1996-01-01

    Lightening is the only natural disaster that protection against is highly effective. Therefore for the safety of critical installations specifically nuclear, an effective lightening protection system (LPS) is required. The design and installation of LPS's have been addressed by many international codes and standards. In this paper, the various LPS's are discussed and compared, including radioactive air terminals, ionizing air terminals, and terminals equipped with electrical trigging devices. Also, the so-called dissipation array systems are discussed and compared to other systems technically and economically. Moreover, the available international codes and standards related to the lightening protection are discussed. such standards include those published by the national fire protection association (NFPA), lightening protection institute (LPI), underwriters laboratories (UL), and british standards Finally, the possibility of developing an egyptian national standards is discussed

  9. Binary Systematic Network Coding for Progressive Packet Decoding

    OpenAIRE

    Jones, Andrew L.; Chatzigeorgiou, Ioannis; Tassi, Andrea

    2015-01-01

    We consider binary systematic network codes and investigate their capability of decoding a source message either in full or in part. We carry out a probability analysis, derive closed-form expressions for the decoding probability and show that systematic network coding outperforms conventional net- work coding. We also develop an algorithm based on Gaussian elimination that allows progressive decoding of source packets. Simulation results show that the proposed decoding algorithm can achieve ...

  10. Reducing Computational Overhead of Network Coding with Intrinsic Information Conveying

    DEFF Research Database (Denmark)

    Heide, Janus; Zhang, Qi; Pedersen, Morten V.

    is RLNC (Random Linear Network Coding) and the goal is to reduce the amount of coding operations both at the coding and decoding node, and at the same time remove the need for dedicated signaling messages. In a traditional RLNC system, coding operation takes up significant computational resources and adds...... the coding operations must be performed in a particular way, which we introduce. Finally we evaluate the suggested system and find that the amount of coding can be significantly reduced both at nodes that recode and decode.......This paper investigated the possibility of intrinsic information conveying in network coding systems. The information is embedded into the coding vector by constructing the vector based on a set of predefined rules. This information can subsequently be retrieved by any receiver. The starting point...

  11. Conflict free network coding for distributed storage networks

    KAUST Repository

    Al-Habob, Ahmed A.

    2015-06-01

    © 2015 IEEE. In this paper, we design a conflict free instantly decodable network coding (IDNC) solution for file download from distributed storage servers. Considering previously downloaded files at the clients from these servers as side information, IDNC can speed up the current download process. However, transmission conflicts can occur since multiple servers can simultaneously send IDNC combinations of files to the same client, which can tune to only one of them at a time. To avoid such conflicts and design more efficient coded download patterns, we propose a dual conflict IDNC graph model, which extends the conventional IDNC graph model in order to guarantee conflict free server transmissions to each of the clients. We then formulate the download time minimization problem as a stochastic shortest path problem whose action space is defined by the independent sets of this new graph. Given the intractability of the solution, we design a channel-aware heuristic algorithm and show that it achieves a considerable reduction in the file download time, compared to applying the conventional IDNC approach separately at each of the servers.

  12. Code 672 observational science branch computer networks

    Science.gov (United States)

    Hancock, D. W.; Shirk, H. G.

    1988-01-01

    In general, networking increases productivity due to the speed of transmission, easy access to remote computers, ability to share files, and increased availability of peripherals. Two different networks within the Observational Science Branch are described in detail.

  13. Neural network decoder for quantum error correcting codes

    Science.gov (United States)

    Krastanov, Stefan; Jiang, Liang

    Artificial neural networks form a family of extremely powerful - albeit still poorly understood - tools used in anything from image and sound recognition through text generation to, in our case, decoding. We present a straightforward Recurrent Neural Network architecture capable of deducing the correcting procedure for a quantum error-correcting code from a set of repeated stabilizer measurements. We discuss the fault-tolerance of our scheme and the cost of training the neural network for a system of a realistic size. Such decoders are especially interesting when applied to codes, like the quantum LDPC codes, that lack known efficient decoding schemes.

  14. On Field Size and Success Probability in Network Coding

    DEFF Research Database (Denmark)

    Geil, Hans Olav; Matsumoto, Ryutaroh; Thomsen, Casper

    2008-01-01

    Using tools from algebraic geometry and Gröbner basis theory we solve two problems in network coding. First we present a method to determine the smallest field size for which linear network coding is feasible. Second we derive improved estimates on the success probability of random linear network...... coding. These estimates take into account which monomials occur in the support of the determinant of the product of Edmonds matrices. Therefore we finally investigate which monomials can occur in the determinant of the Edmonds matrix....

  15. Riemann-Roch Spaces and Linear Network Codes

    DEFF Research Database (Denmark)

    Hansen, Johan P.

    We construct linear network codes utilizing algebraic curves over finite fields and certain associated Riemann-Roch spaces and present methods to obtain their parameters. In particular we treat the Hermitian curve and the curves associated with the Suzuki and Ree groups all having the maximal...... number of points for curves of their respective genera. Linear network coding transmits information in terms of a basis of a vector space and the information is received as a basis of a possibly altered vector space. Ralf Koetter and Frank R. Kschischang %\\cite{DBLP:journals/tit/KoetterK08} introduced...... in the above metric making them suitable for linear network coding....

  16. ComboCoding: Combined intra-/inter-flow network coding for TCP over disruptive MANETs

    Directory of Open Access Journals (Sweden)

    Chien-Chia Chen

    2011-07-01

    Full Text Available TCP over wireless networks is challenging due to random losses and ACK interference. Although network coding schemes have been proposed to improve TCP robustness against extreme random losses, a critical problem still remains of DATA–ACK interference. To address this issue, we use inter-flow coding between DATA and ACK to reduce the number of transmissions among nodes. In addition, we also utilize a “pipeline” random linear coding scheme with adaptive redundancy to overcome high packet loss over unreliable links. The resulting coding scheme, ComboCoding, combines intra-flow and inter-flow coding to provide robust TCP transmission in disruptive wireless networks. The main contributions of our scheme are twofold; the efficient combination of random linear coding and XOR coding on bi-directional streams (DATA and ACK, and the novel redundancy control scheme that adapts to time-varying and space-varying link loss. The adaptive ComboCoding was tested on a variable hop string topology with unstable links and on a multipath MANET with dynamic topology. Simulation results show that TCP with ComboCoding delivers higher throughput than with other coding options in high loss and mobile scenarios, while introducing minimal overhead in normal operation.

  17. Protect Heterogeneous Environment Distributed Computing from Malicious Code Assignment

    Directory of Open Access Journals (Sweden)

    V. S. Gorbatov

    2011-09-01

    Full Text Available The paper describes the practical implementation of the protection system of heterogeneous environment distributed computing from malicious code for the assignment. A choice of technologies, development of data structures, performance evaluation of the implemented system security are conducted.

  18. Protecting information on local area networks

    CERN Document Server

    Schweitzer, James A

    1988-01-01

    Protecting Information on Local Area Networks presents the various types of networks and explains why they are being expanded at such a rapid pace. This book considers how management can gain control of the valuable network-services information resources generally available.Organized into three parts encompassing seven chapters, this book begins with an overview of the various networks and their operations. This text then discusses the appropriate management actions to ensure some control over the use of networks and the business information resource. Other chapters consider the management rat

  19. Dynamic Protection of Optical Networks

    DEFF Research Database (Denmark)

    Ruepp, Sarah Renée

    2008-01-01

    This thesis deals with making optical networks resilient to failures. The recovery performance of path, segment and span restoration is evaluated in a network with limited wavelength conversion capability using both standard and enhanced wavelength assignment schemes. The enhanced wavelength...... stubs at the failure adjacent nodes. Both modifcations have a positive influence on the recovery percentage. The recovery enhancements are applicable in both single and multi-domain network environments. Stub release, where the still working parts of a failure affected connection are released prior...... of the modularity of capacity units is investigated for resilient network design. Different span upgrading strategies and algorithms for finding restoration paths are evaluated. Furthermore, the capacity effciency of constraining restoration requests for the same destination node to the same restoration path...

  20. Decoding Algorithms for Random Linear Network Codes

    DEFF Research Database (Denmark)

    Heide, Janus; Pedersen, Morten Videbæk; Fitzek, Frank

    2011-01-01

    We consider the problem of efficient decoding of a random linear code over a finite field. In particular we are interested in the case where the code is random, relatively sparse, and use the binary finite field as an example. The goal is to decode the data using fewer operations to potentially...... achieve a high coding throughput, and reduce energy consumption.We use an on-the-fly version of the Gauss-Jordan algorithm as a baseline, and provide several simple improvements to reduce the number of operations needed to perform decoding. Our tests show that the improvements can reduce the number...

  1. An Optical Multicast Routing with Minimal Network Coding Operations in WDM Networks

    Directory of Open Access Journals (Sweden)

    Huanlin Liu

    2014-01-01

    Full Text Available Network coding can improve the optical multicast routing performance in terms of network throughput, bandwidth utilization, and traffic load balance. But network coding needs high encoding operations costs in all-optical WDM networks due to shortage of optical RAM. In the paper, the network coding operation is defined to evaluate the number of network coding operation cost in the paper. An optical multicast routing algorithm based on minimal number of network coding operations is proposed to improve the multicast capacity. Two heuristic criteria are designed to establish the multicast routing with low network coding cost and high multicast capacity. One is to select one path from the former K shortest paths with the least probability of dropping the multicast maximal capacity. The other is to select the path with lowest potential coding operations with the highest link shared degree among the multiple wavelength disjoint paths cluster from source to each destination. Comparing with the other multicast routing based on network coding, simulation results show that the proposed multicast routing algorithm can effectively reduce the times of network coding operations, can improve the probability of reaching multicast maximal capacity, and can keep the less multicast routing link cost for optical WDM networks.

  2. Decoding small surface codes with feedforward neural networks

    Science.gov (United States)

    Varsamopoulos, Savvas; Criger, Ben; Bertels, Koen

    2018-01-01

    Surface codes reach high error thresholds when decoded with known algorithms, but the decoding time will likely exceed the available time budget, especially for near-term implementations. To decrease the decoding time, we reduce the decoding problem to a classification problem that a feedforward neural network can solve. We investigate quantum error correction and fault tolerance at small code distances using neural network-based decoders, demonstrating that the neural network can generalize to inputs that were not provided during training and that they can reach similar or better decoding performance compared to previous algorithms. We conclude by discussing the time required by a feedforward neural network decoder in hardware.

  3. PlayNCool: Opportunistic Network Coding for Local Optimization of Routing in Wireless Mesh Networks

    DEFF Research Database (Denmark)

    Pahlevani, Peyman; Roetter, Daniel Enrique Lucani; Pedersen, Morten Videbæk

    2013-01-01

    This paper introduces PlayNCool, an opportunistic protocol with local optimization based on network coding to increase the throughput of a wireless mesh network (WMN). PlayNCool aims to enhance current routing protocols by (i) allowing random linear network coding transmissions end-to-end, (ii) r...

  4. Network Coding to Enhance Standard Routing Protocols in Wireless Mesh Networks

    DEFF Research Database (Denmark)

    Pahlevani, Peyman; Roetter, Daniel Enrique Lucani; Fitzek, Frank

    2013-01-01

    This paper introduces a design and simulation of a locally optimized network coding protocol, called PlayNCool, for wireless mesh networks. PlayN-Cool is easy to implement and compatible with existing routing protocols and devices. This allows the system to gain from network coding capabilities i...

  5. Protecting Personal Information on Social Networking Sites

    Science.gov (United States)

    Gallant, David T.

    2011-01-01

    Almost everyone uses social networking sites like Facebook, MySpace, and LinkedIn. Since Facebook is the most popular site in the history of the Internet, this article will focus on how one can protect his/her personal information and how that extends to protecting the private information of others.

  6. Population coding in sparsely connected networks of noisy neurons

    OpenAIRE

    Tripp, Bryan P.; Orchard, Jeff

    2012-01-01

    This study examines the relationship between population coding and spatial connection statistics in networks of noisy neurons. Encoding of sensory information in the neocortex is thought to require coordinated neural populations, because individual cortical neurons respond to a wide range of stimuli, and exhibit highly variable spiking in response to repeated stimuli. Population coding is rooted in network structure, because cortical neurons receive information only from other neurons, and be...

  7. Convolutional Codes with Maximum Column Sum Rank for Network Streaming

    OpenAIRE

    Mahmood, Rafid; Badr, Ahmed; Khisti, Ashish

    2015-01-01

    The column Hamming distance of a convolutional code determines the error correction capability when streaming over a class of packet erasure channels. We introduce a metric known as the column sum rank, that parallels column Hamming distance when streaming over a network with link failures. We prove rank analogues of several known column Hamming distance properties and introduce a new family of convolutional codes that maximize the column sum rank up to the code memory. Our construction invol...

  8. On the Combination of Multi-Layer Source Coding and Network Coding for Wireless Networks

    DEFF Research Database (Denmark)

    Krigslund, Jeppe; Fitzek, Frank; Pedersen, Morten Videbæk

    2013-01-01

    quality is developed. A linear coding structure designed to gracefully encapsulate layered source coding provides both low complexity of the utilised linear coding while enabling robust erasure correction in the form of fountain coding capabilities. The proposed linear coding structure advocates efficient...

  9. Towards Effective Intra-flow Network Coding in Software Defined Wireless Mesh Networks

    Directory of Open Access Journals (Sweden)

    Donghai Zhu

    2016-01-01

    Full Text Available Wireless Mesh Networks (WMNs have potential to provide convenient broadband wireless Internet access to mobile users.With the support of Software-Defined Networking (SDN paradigm that separates control plane and data plane, WMNs can be easily deployed and managed. In addition, by exploiting the broadcast nature of the wireless medium and the spatial diversity of multi-hop wireless networks, intra-flow network coding has shown a greater benefit in comparison with traditional routing paradigms in data transmission for WMNs. In this paper, we develop a novel OpenCoding protocol, which combines the SDN technique with intra-flow network coding for WMNs. Our developed protocol can simplify the deployment and management of the network and improve network performance. In OpenCoding, a controller that works on the control plane makes routing decisions for mesh routers and the hop-by-hop forwarding function is replaced by network coding functions in data plane. We analyze the overhead of OpenCoding. Through a simulation study, we show the effectiveness of the OpenCoding protocol in comparison with existing schemes. Our data shows that OpenCoding outperforms both traditional routing and intra-flow network coding schemes.

  10. Distributed Estimation, Coding, and Scheduling in Wireless Visual Sensor Networks

    Science.gov (United States)

    Yu, Chao

    2013-01-01

    In this thesis, we consider estimation, coding, and sensor scheduling for energy efficient operation of wireless visual sensor networks (VSN), which consist of battery-powered wireless sensors with sensing (imaging), computation, and communication capabilities. The competing requirements for applications of these wireless sensor networks (WSN)…

  11. On the Effects of Heterogeneous Packet Lengths on Network Coding

    DEFF Research Database (Denmark)

    Compta, Pol Torres; Fitzek, Frank; Roetter, Daniel Enrique Lucani

    2014-01-01

    Random linear network coding (RLNC) has been shown to provide increased throughput, security and robustness for the transmission of data through the network. Most of the analysis and the demonstrators have focused on the study of data packets with the same size (number of bytes). This constitutes...

  12. Adaptive Relay Activation in the Network Coding Protocols

    DEFF Research Database (Denmark)

    Pahlevani, Peyman; Roetter, Daniel Enrique Lucani; Fitzek, Frank

    2015-01-01

    State-of-the-art Network coding based routing protocols exploit the link quality information to compute the transmission rate in the intermediate nodes. However, the link quality discovery protocols are usually inaccurate, and introduce overhead in wireless mesh networks. In this paper, we presen...

  13. Collaborative Multi-Layer Network Coding in Hybrid Cellular Cognitive Radio Networks

    KAUST Repository

    Moubayed, Abdallah J.; Sorour, Sameh; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim

    2015-01-01

    In this paper, as an extension to [1], we propose a prioritized multi-layer network coding scheme for collaborative packet recovery in hybrid (interweave and underlay) cellular cognitive radio networks. This scheme allows the uncoordinated

  14. Collaborative Multi-Layer Network Coding For Hybrid Cellular Cognitive Radio Networks

    KAUST Repository

    Moubayed, Abdallah J.

    2014-01-01

    In this thesis, as an extension to [1], we propose a prioritized multi-layer network coding scheme for collaborative packet recovery in hybrid (interweave and underlay) cellular cognitive radio networks. This scheme allows the uncoordinated

  15. Network Coding Opportunities for Wireless Grids Formed by Mobile Devices

    DEFF Research Database (Denmark)

    Nielsen, Karsten Fyhn; Madsen, Tatiana Kozlova; Fitzek, Frank

    2008-01-01

    Wireless grids have potential in sharing communication, computational and storage resources making these networks more powerful, more robust, and less cost intensive. However, to enjoy the benefits of cooperative resource sharing, a number of issues should be addressed and the cost of the wireless...... link should be taken into account. We focus on the question how nodes can efficiently communicate and distribute data in a wireless grid. We show the potential of a network coding approach when nodes have the possibility to combine packets thus increasing the amount of information per transmission. Our...... implementation demonstrates the feasibility of network coding for wireless grids formed by mobile devices....

  16. Network Coding is the 5G Key Enabling Technology

    DEFF Research Database (Denmark)

    Compta, Pol Torres; Fitzek, Frank; Roetter, Daniel Enrique Lucani

    2015-01-01

    The exponential growth of the mobile devices market, not only smartphones, but also tablets, laptops or wearables, poses a serious challenge for 5G communications. Random Linear Network Coding (RLNC) is a promising solution for present and future networks as it has been shown to provide increased...... throughput, security, and robustness for the transmission of data through the network. Most of the analysis and the demonstrators have focused on the study of data packets with the same size (number of bytes). This constitutes a best case scenario as coded packets will incur little overhead to handle...

  17. Energy-Efficient Channel Coding Strategy for Underwater Acoustic Networks

    Directory of Open Access Journals (Sweden)

    Grasielli Barreto

    2017-03-01

    Full Text Available Underwater acoustic networks (UAN allow for efficiently exploiting and monitoring the sub-aquatic environment. These networks are characterized by long propagation delays, error-prone channels and half-duplex communication. In this paper, we address the problem of energy-efficient communication through the use of optimized channel coding parameters. We consider a two-layer encoding scheme employing forward error correction (FEC codes and fountain codes (FC for UAN scenarios without feedback channels. We model and evaluate the energy consumption of different channel coding schemes for a K-distributed multipath channel. The parameters of the FEC encoding layer are optimized by selecting the optimal error correction capability and the code block size. The results show the best parameter choice as a function of the link distance and received signal-to-noise ratio.

  18. Robust Self-Authenticating Network Coding

    Science.gov (United States)

    2008-11-30

    efficient as traditional point-to-point coding schemes 3m*b*c*ts»tt a«2b»c*dt4g »4.0»C* 3d *Sh Number of symbols that an intermediate node has to...Institute of Technology This work was partly supported by the Fundacao para a Ciencia e Tecnologia (Portuguese foundation lor Science and Technology

  19. The Vulnerability Assessment Code for Physical Protection System

    International Nuclear Information System (INIS)

    Jang, Sung Soon; Yoo, Ho Sik

    2007-01-01

    To neutralize the increasing terror threats, nuclear facilities have strong physical protection system (PPS). PPS includes detectors, door locks, fences, regular guard patrols, and a hot line to a nearest military force. To design an efficient PPS and to fully operate it, vulnerability assessment process is required. Evaluating PPS of a nuclear facility is complicate process and, hence, several assessment codes have been developed. The estimation of adversary sequence interruption (EASI) code analyzes vulnerability along a single intrusion path. To evaluate many paths to a valuable asset in an actual facility, the systematic analysis of vulnerability to intrusion (SAVI) code was developed. KAERI improved SAVI and made the Korean analysis of vulnerability to intrusion (KAVI) code. Existing codes (SAVI and KAVI) have limitations in representing the distance of a facility because they use the simplified model of a PPS called adversary sequence diagram. In adversary sequence diagram the position of doors, sensors and fences is described just as the locating area. Thus, the distance between elements is inaccurate and we cannot reflect the range effect of sensors. In this abstract, we suggest accurate and intuitive vulnerability assessment based on raster map modeling of PPS. The raster map of PPS accurately represents the relative position of elements and, thus, the range effect of sensor can be easily incorporable. Most importantly, the raster map is easy to understand

  20. Network Protection Against DDoS Attacks

    Directory of Open Access Journals (Sweden)

    Petr Dzurenda

    2015-03-01

    Full Text Available The paper deals with possibilities of the network protection against Distributed Denial of Service attacks (DDoS. The basic types of DDoS attacks and their impact on the protected network are presented here. Furthermore, we present basic detection and defense techniques thanks to which it is possible to increase resistance of the protected network or device against DDoS attacks. Moreover, we tested the ability of current commercial Intrusion Prevention Systems (IPS, especially Radware DefensePro 6.10.00 product against the most common types of DDoS attacks. We create five scenarios that are varied in type and strength of the DDoS attacks. The attacks intensity was much greater than the normal intensity of the current DDoS attacks.

  1. Performance Evaluation of Coded Meshed Networks

    DEFF Research Database (Denmark)

    Krigslund, Jeppe; Hansen, Jonas; Pedersen, Morten Videbæk

    2013-01-01

    of the former to enhance the gains of the latter. We first motivate our work through measurements in WiFi mesh networks. Later, we compare state-of-the-art approaches, e.g., COPE, RLNC, to CORE. Our measurements show the higher reliability and throughput of CORE over other schemes, especially, for asymmetric...

  2. The summarize of the technique about proactive network security protection

    International Nuclear Information System (INIS)

    Liu Baoxu; Li Xueying; Cao Aijuan; Yu Chuansong; Xu Rongsheng

    2003-01-01

    The proactive protection measures and the traditional passive security protection tools are complementarities each other. It also can supply the conventional network security protection system and enhance its capability of the security protection. Based upon sorts of existing network security technologies, this article analyses and summarizes the technologies, functions and the development directions of some key proactive network security protection tools. (authors)

  3. Code of practice for radiation protection in nuclear medicine

    International Nuclear Information System (INIS)

    Hamed, M. I.

    2010-05-01

    In aim of this study was to develop a draft for a new code practice for radiation protection in nuclear medicine that meets the current relevant international recommendation. The draft includes the following main fields: methods of radiation protection for workers, patients and public. Also, the principles of safe design of nuclear medicine departments, quality assurance program, proper manipulation of radiation sources including radioactive waste and emergency preparedness and response. The practical part of this study includes inspections of three nuclear medicine departments available in Sudan so as to assess the degree of compliance of those departments with what is stated in this code. The inspection missions have been conducted using a checklist that addresses all items that may affect radiation raincoat issues in addition to per formin area radiation monitoring around the installation of the radioactive sources. The results of this revealed that most of the departments do not have effective radiation protection program which in turn could lead to unnecessary exposure to patients, public and workers. Finally, some recommendations are given that - if implemented - could improve the status of radiation protection in nuclear medicine department. (Author)

  4. Privacy rules for DNA databanks. Protecting coded 'future diaries'.

    Science.gov (United States)

    Annas, G J

    1993-11-17

    In privacy terms, genetic information is like medical information. But the information contained in the DNA molecule itself is more sensitive because it contains an individual's probabilistic "future diary," is written in a code that has only partially been broken, and contains information about an individual's parents, siblings, and children. Current rules for protecting the privacy of medical information cannot protect either genetic information or identifiable DNA samples stored in DNA databanks. A review of the legal and public policy rationales for protecting genetic privacy suggests that specific enforceable privacy rules for DNA databanks are needed. Four preliminary rules are proposed to govern the creation of DNA databanks, the collection of DNA samples for storage, limits on the use of information derived from the samples, and continuing obligations to those whose DNA samples are in the databanks.

  5. Coded Cooperation for Multiway Relaying in Wireless Sensor Networks

    Science.gov (United States)

    Si, Zhongwei; Ma, Junyang; Thobaben, Ragnar

    2015-01-01

    Wireless sensor networks have been considered as an enabling technology for constructing smart cities. One important feature of wireless sensor networks is that the sensor nodes collaborate in some manner for communications. In this manuscript, we focus on the model of multiway relaying with full data exchange where each user wants to transmit and receive data to and from all other users in the network. We derive the capacity region for this specific model and propose a coding strategy through coset encoding. To obtain good performance with practical codes, we choose spatially-coupled LDPC (SC-LDPC) codes for the coded cooperation. In particular, for the message broadcasting from the relay, we construct multi-edge-type (MET) SC-LDPC codes by repeatedly applying coset encoding. Due to the capacity-achieving property of the SC-LDPC codes, we prove that the capacity region can theoretically be achieved by the proposed MET SC-LDPC codes. Numerical results with finite node degrees are provided, which show that the achievable rates approach the boundary of the capacity region in both binary erasure channels and additive white Gaussian channels. PMID:26131675

  6. Coded Cooperation for Multiway Relaying in Wireless Sensor Networks.

    Science.gov (United States)

    Si, Zhongwei; Ma, Junyang; Thobaben, Ragnar

    2015-06-29

    Wireless sensor networks have been considered as an enabling technology for constructing smart cities. One important feature of wireless sensor networks is that the sensor nodes collaborate in some manner for communications. In this manuscript, we focus on the model of multiway relaying with full data exchange where each user wants to transmit and receive data to and from all other users in the network. We derive the capacity region for this specific model and propose a coding strategy through coset encoding. To obtain good performance with practical codes, we choose spatially-coupled LDPC (SC-LDPC) codes for the coded cooperation. In particular, for the message broadcasting from the relay, we construct multi-edge-type (MET) SC-LDPC codes by repeatedly applying coset encoding. Due to the capacity-achieving property of the SC-LDPC codes, we prove that the capacity region can theoretically be achieved by the proposed MET SC-LDPC codes. Numerical results with finite node degrees are provided, which show that the achievable rates approach the boundary of the capacity region in both binary erasure channels and additive white Gaussian channels.

  7. Coded Cooperation for Multiway Relaying in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Zhongwei Si

    2015-06-01

    Full Text Available Wireless sensor networks have been considered as an enabling technology for constructing smart cities. One important feature of wireless sensor networks is that the sensor nodes collaborate in some manner for communications. In this manuscript, we focus on the model of multiway relaying with full data exchange where each user wants to transmit and receive data to and from all other users in the network. We derive the capacity region for this specific model and propose a coding strategy through coset encoding. To obtain good performance with practical codes, we choose spatially-coupled LDPC (SC-LDPC codes for the coded cooperation. In particular, for the message broadcasting from the relay, we construct multi-edge-type (MET SC-LDPC codes by repeatedly applying coset encoding. Due to the capacity-achieving property of the SC-LDPC codes, we prove that the capacity region can theoretically be achieved by the proposed MET SC-LDPC codes. Numerical results with finite node degrees are provided, which show that the achievable rates approach the boundary of the capacity region in both binary erasure channels and additive white Gaussian channels.

  8. Single-shot secure quantum network coding on butterfly network with free public communication

    Science.gov (United States)

    Owari, Masaki; Kato, Go; Hayashi, Masahito

    2018-01-01

    Quantum network coding on the butterfly network has been studied as a typical example of quantum multiple cast network. We propose a secure quantum network code for the butterfly network with free public classical communication in the multiple unicast setting under restricted eavesdropper’s power. This protocol certainly transmits quantum states when there is no attack. We also show the secrecy with shared randomness as additional resource when the eavesdropper wiretaps one of the channels in the butterfly network and also derives the information sending through public classical communication. Our protocol does not require verification process, which ensures single-shot security.

  9. A Secure Network Coding Based on Broadcast Encryption in SDN

    Directory of Open Access Journals (Sweden)

    Yue Chen

    2016-01-01

    Full Text Available By allowing intermediate nodes to encode the received packets before sending them out, network coding improves the capacity and robustness of multicast applications. But it is vulnerable to the pollution attacks. Some signature schemes were proposed to thwart such attacks, but most of them need to be homomorphic that the keys cannot be generated and managed easily. In this paper, we propose a novel fast and secure switch network coding multicast (SSNC on the software defined networks (SDN. In our scheme, the complicated secure multicast management was separated from the fast data transmission based on the SDN. Multiple multicasts will be aggregated to one multicast group according to the requirements of services and the network status. Then, the controller will route aggregated multicast group with network coding; only the trusted switch will be allowed to join the network coding by using broadcast encryption. The proposed scheme can use the traditional cryptography without homomorphy, which greatly reduces the complexity of the computation and improves the efficiency of transmission.

  10. A neutron spectrum unfolding computer code based on artificial neural networks

    Science.gov (United States)

    Ortiz-Rodríguez, J. M.; Reyes Alfaro, A.; Reyes Haro, A.; Cervantes Viramontes, J. M.; Vega-Carrillo, H. R.

    2014-02-01

    The Bonner Spheres Spectrometer consists of a thermal neutron sensor placed at the center of a number of moderating polyethylene spheres of different diameters. From the measured readings, information can be derived about the spectrum of the neutron field where measurements were made. Disadvantages of the Bonner system are the weight associated with each sphere and the need to sequentially irradiate the spheres, requiring long exposure periods. Provided a well-established response matrix and adequate irradiation conditions, the most delicate part of neutron spectrometry, is the unfolding process. The derivation of the spectral information is not simple because the unknown is not given directly as a result of the measurements. The drawbacks associated with traditional unfolding procedures have motivated the need of complementary approaches. Novel methods based on Artificial Intelligence, mainly Artificial Neural Networks, have been widely investigated. In this work, a neutron spectrum unfolding code based on neural nets technology is presented. This code is called Neutron Spectrometry and Dosimetry with Artificial Neural networks unfolding code that was designed in a graphical interface. The core of the code is an embedded neural network architecture previously optimized using the robust design of artificial neural networks methodology. The main features of the code are: easy to use, friendly and intuitive to the user. This code was designed for a Bonner Sphere System based on a 6LiI(Eu) neutron detector and a response matrix expressed in 60 energy bins taken from an International Atomic Energy Agency compilation. The main feature of the code is that as entrance data, for unfolding the neutron spectrum, only seven rate counts measured with seven Bonner spheres are required; simultaneously the code calculates 15 dosimetric quantities as well as the total flux for radiation protection purposes. This code generates a full report with all information of the unfolding in

  11. Location privacy protection in mobile networks

    CERN Document Server

    Liu, Xinxin

    2013-01-01

    This SpringerBrief analyzes the potential privacy threats in wireless and mobile network environments, and reviews some existing works. It proposes multiple privacy preserving techniques against several types of privacy threats that are targeting users in a mobile network environment. Depending on the network architecture, different approaches can be adopted. The first proposed approach considers a three-party system architecture where there is a trusted central authority that can be used to protect users? privacy. The second approach considers a totally distributed environment where users per

  12. Joint opportunistic scheduling and network coding for bidirectional relay channel

    KAUST Repository

    Shaqfeh, Mohammad

    2013-07-01

    In this paper, we consider a two-way communication system in which two users communicate with each other through an intermediate relay over block-fading channels. We investigate the optimal opportunistic scheduling scheme in order to maximize the long-term average transmission rate in the system assuming symmetric information flow between the two users. Based on the channel state information, the scheduler decides that either one of the users transmits to the relay, or the relay transmits to a single user or broadcasts to both users a combined version of the two users\\' transmitted information by using linear network coding. We obtain the optimal scheduling scheme by using the Lagrangian dual problem. Furthermore, in order to characterize the gains of network coding and opportunistic scheduling, we compare the achievable rate of the system versus suboptimal schemes in which the gains of network coding and opportunistic scheduling are partially exploited. © 2013 IEEE.

  13. Spectral Amplitude Coding (SAC)-OCDMA Network with 8DPSK

    Science.gov (United States)

    Aldhaibani, A. O.; Aljunid, S. A.; Fadhil, Hilal A.; Anuar, M. S.

    2013-09-01

    Optical code division multiple access (OCDMA) technique is required to meet the increased demand for high speed, large capacity communications in optical networks. In this paper, the transmission performance of a spectral amplitude coding (SAC)-OCDMA network is investigated when a conventional single-mode fiber (SMF) is used as the transmission link using 8DPSK modulation. The DW has a fixed weight of two. Simulation results reveal that the transmission distance is limited mainly by the fiber dispersion when high coding chip rate is used. For a two-user SAC-OCDMA network operating with 2 Gbit/s data rate and two wavelengths for each user, the maximum allowable transmission distance is about 15 km.

  14. Osculating Spaces of Varieties and Linear Network Codes

    DEFF Research Database (Denmark)

    Hansen, Johan P.

    2013-01-01

    We present a general theory to obtain good linear network codes utilizing the osculating nature of algebraic varieties. In particular, we obtain from the osculating spaces of Veronese varieties explicit families of equidimensional vector spaces, in which any pair of distinct vector spaces...... intersects in the same dimension. Linear network coding transmits information in terms of a basis of a vector space and the information is received as a basis of a possible altered vector space. Ralf Koetter and Frank R. Kschischang introduced a metric on the set af vector spaces and showed that a minimal...... distance decoder for this metric achieves correct decoding if the dimension of the intersection of the transmitted and received vector space is sufficiently large. The obtained osculating spaces of Veronese varieties are equidistant in the above metric. The parameters of the resulting linear network codes...

  15. Osculating Spaces of Varieties and Linear Network Codes

    DEFF Research Database (Denmark)

    Hansen, Johan P.

    We present a general theory to obtain good linear network codes utilizing the osculating nature of algebraic varieties. In particular, we obtain from the osculating spaces of Veronese varieties explicit families of equideminsional vector spaces, in which any pair of distinct vector spaces...... intersects in the same dimension. Linear network coding transmits information in terms of a basis of a vector space and the information is received as a basis of a possible altered vector space. Ralf Koetter and Frank R. Kschischang introduced a metric on the set af vector spaces and showed that a minimal...... distance decoder for this metric achieves correct decoding if the dimension of the intersection of the transmitted and received vector space is sufficiently large. The obtained osculating spaces of Veronese varieties are equidistant in the above metric. The parameters of the resulting linear network codes...

  16. A Secure Network Coding-based Data Gathering Model and Its Protocol in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Qian Xiao

    2012-09-01

    Full Text Available To provide security for data gathering based on network coding in wireless sensor networks (WSNs, a secure network coding-based data gathering model is proposed, and a data-privacy preserving and pollution preventing (DPPaamp;PP protocol using network coding is designed. DPPaamp;PP makes use of a new proposed pollution symbol selection and pollution (PSSP scheme based on a new obfuscation idea to pollute existing symbols. Analyses of DPPaamp;PP show that it not only requires low overhead on computation and communication, but also provides high security on resisting brute-force attacks.

  17. Security enhanced BioEncoding for protecting iris codes

    Science.gov (United States)

    Ouda, Osama; Tsumura, Norimichi; Nakaguchi, Toshiya

    2011-06-01

    Improving the security of biometric template protection techniques is a key prerequisite for the widespread deployment of biometric technologies. BioEncoding is a recently proposed template protection scheme, based on the concept of cancelable biometrics, for protecting biometric templates represented as binary strings such as iris codes. The main advantage of BioEncoding over other template protection schemes is that it does not require user-specific keys and/or tokens during verification. Besides, it satisfies all the requirements of the cancelable biometrics construct without deteriorating the matching accuracy. However, although it has been shown that BioEncoding is secure enough against simple brute-force search attacks, the security of BioEncoded templates against more smart attacks, such as record multiplicity attacks, has not been sufficiently investigated. In this paper, a rigorous security analysis of BioEncoding is presented. Firstly, resistance of BioEncoded templates against brute-force attacks is revisited thoroughly. Secondly, we show that although the cancelable transformation employed in BioEncoding might be non-invertible for a single protected template, the original iris code could be inverted by correlating several templates used in different applications but created from the same iris. Accordingly, we propose an important modification to the BioEncoding transformation process in order to hinder attackers from exploiting this type of attacks. The effectiveness of adopting the suggested modification is validated and its impact on the matching accuracy is investigated empirically using CASIA-IrisV3-Interval dataset. Experimental results confirm the efficacy of the proposed approach and show that it preserves the matching accuracy of the unprotected iris recognition system.

  18. Improved transformer protection using probabilistic neural network ...

    African Journals Online (AJOL)

    user

    secure and dependable protection for power transformers. Owing to its superior learning and generalization capabilities Artificial. Neural Network (ANN) can considerably enhance the scope of WI method. ANN approach is faster, robust and easier to implement than the conventional waveform approach. The use of neural ...

  19. Improved transformer protection using probabilistic neural network ...

    African Journals Online (AJOL)

    This article presents a novel technique to distinguish between magnetizing inrush current and internal fault current of power transformer. An algorithm has been developed around the theme of the conventional differential protection method in which parallel combination of Probabilistic Neural Network (PNN) and Power ...

  20. Code of practice for radiation protection in dentistry (1987)

    International Nuclear Information System (INIS)

    1988-01-01

    This code is intended as a guide to safe practices and lays down detailed requirements for the following protective measures : allocation of responsibility and need for clinical assessment of the indications for radiography; provision of appropriate equipment, film and processing facilities; adoption of procedures to minimise exposure to radiation. This code deals with radiographic procedures commonly used in general and specialist dental practice. These entail : intra-oral radiography: periapical, bitewing and occlusal views; panoramic radiography: intra-oral tube radiography and panoramic tomography; radiography of the complete skull or certain parts of the dento-maxillo-facial region; hand and wrist radiography for the sole purpose of the determination of the bone age

  1. Optical code-division multiple-access networks

    Science.gov (United States)

    Andonovic, Ivan; Huang, Wei

    1999-04-01

    This review details the approaches adopted to implement classical code division multiple access (CDMA) principles directly in the optical domain, resulting in all optical derivatives of electronic systems. There are a number of ways of realizing all-optical CDMA systems, classified as incoherent and coherent based on spreading in the time and frequency dimensions. The review covers the basic principles of optical CDMA (OCDMA), the nature of the codes used in these approaches and the resultant limitations on system performance with respect to the number of stations (code cardinality), the number of simultaneous users (correlation characteristics of the families of codes), concluding with consideration of network implementation issues. The latest developments will be presented with respect to the integration of conventional time spread codes, used in the bulk of the demonstrations of these networks to date, with wavelength division concepts, commonplace in optical networking. Similarly, implementations based on coherent correlation with the aid of a local oscillator will be detailed and comparisons between approaches will be drawn. Conclusions regarding the viability of these approaches allowing the goal of a large, asynchronous high capacity optical network to be realized will be made.

  2. Applying a rateless code in content delivery networks

    Science.gov (United States)

    Suherman; Zarlis, Muhammad; Parulian Sitorus, Sahat; Al-Akaidi, Marwan

    2017-09-01

    Content delivery network (CDN) allows internet providers to locate their services, to map their coverage into networks without necessarily to own them. CDN is part of the current internet infrastructures, supporting multi server applications especially social media. Various works have been proposed to improve CDN performances. Since accesses on social media servers tend to be short but frequent, providing redundant to the transmitted packets to ensure lost packets not degrade the information integrity may improve service performances. This paper examines the implementation of rateless code in the CDN infrastructure. The NS-2 evaluations show that rateless code is able to reduce packet loss up to 50%.

  3. Performance and complexity of tunable sparse network coding with gradual growing tuning functions over wireless networks

    OpenAIRE

    Garrido Ortiz, Pablo; Sørensen, Chres W.; Lucani Roetter, Daniel Enrique; Agüero Calvo, Ramón

    2016-01-01

    Random Linear Network Coding (RLNC) has been shown to be a technique with several benefits, in particular when applied over wireless mesh networks, since it provides robustness against packet losses. On the other hand, Tunable Sparse Network Coding (TSNC) is a promising concept, which leverages a trade-off between computational complexity and goodput. An optimal density tuning function has not been found yet, due to the lack of a closed-form expression that links density, performance and comp...

  4. H.264 Layered Coded Video over Wireless Networks: Channel Coding and Modulation Constraints

    Directory of Open Access Journals (Sweden)

    Ghandi MM

    2006-01-01

    Full Text Available This paper considers the prioritised transmission of H.264 layered coded video over wireless channels. For appropriate protection of video data, methods such as prioritised forward error correction coding (FEC or hierarchical quadrature amplitude modulation (HQAM can be employed, but each imposes system constraints. FEC provides good protection but at the price of a high overhead and complexity. HQAM is less complex and does not introduce any overhead, but permits only fixed data ratios between the priority layers. Such constraints are analysed and practical solutions are proposed for layered transmission of data-partitioned and SNR-scalable coded video where combinations of HQAM and FEC are used to exploit the advantages of both coding methods. Simulation results show that the flexibility of SNR scalability and absence of picture drift imply that SNR scalability as modelled is superior to data partitioning in such applications.

  5. Environment Protection (Nuclear Codes) Act 1978, No. 32

    International Nuclear Information System (INIS)

    1978-01-01

    The purpose of this Act is to make provision for protecting the health and safety of the people of Australia, and the environment from possible harmful effects associated with nuclear activities. The competent Federal Minister, after consultation with the appropriate Minister of each State, may from time to time arrange for the formulation of codes of practice for regulating and controlling nuclear activities. Also, the Governor-General may authorize by order a Minister to take such action as is necessary to control and eliminate hazards to the health and safety of persons, or the environment, resulting from a nuclear activity. (NEA) [fr

  6. Combining Topological Hardware and Topological Software: Color-Code Quantum Computing with Topological Superconductor Networks

    Science.gov (United States)

    Litinski, Daniel; Kesselring, Markus S.; Eisert, Jens; von Oppen, Felix

    2017-07-01

    We present a scalable architecture for fault-tolerant topological quantum computation using networks of voltage-controlled Majorana Cooper pair boxes and topological color codes for error correction. Color codes have a set of transversal gates which coincides with the set of topologically protected gates in Majorana-based systems, namely, the Clifford gates. In this way, we establish color codes as providing a natural setting in which advantages offered by topological hardware can be combined with those arising from topological error-correcting software for full-fledged fault-tolerant quantum computing. We provide a complete description of our architecture, including the underlying physical ingredients. We start by showing that in topological superconductor networks, hexagonal cells can be employed to serve as physical qubits for universal quantum computation, and we present protocols for realizing topologically protected Clifford gates. These hexagonal-cell qubits allow for a direct implementation of open-boundary color codes with ancilla-free syndrome read-out and logical T gates via magic-state distillation. For concreteness, we describe how the necessary operations can be implemented using networks of Majorana Cooper pair boxes, and we give a feasibility estimate for error correction in this architecture. Our approach is motivated by nanowire-based networks of topological superconductors, but it could also be realized in alternative settings such as quantum-Hall-superconductor hybrids.

  7. Combining Topological Hardware and Topological Software: Color-Code Quantum Computing with Topological Superconductor Networks

    Directory of Open Access Journals (Sweden)

    Daniel Litinski

    2017-09-01

    Full Text Available We present a scalable architecture for fault-tolerant topological quantum computation using networks of voltage-controlled Majorana Cooper pair boxes and topological color codes for error correction. Color codes have a set of transversal gates which coincides with the set of topologically protected gates in Majorana-based systems, namely, the Clifford gates. In this way, we establish color codes as providing a natural setting in which advantages offered by topological hardware can be combined with those arising from topological error-correcting software for full-fledged fault-tolerant quantum computing. We provide a complete description of our architecture, including the underlying physical ingredients. We start by showing that in topological superconductor networks, hexagonal cells can be employed to serve as physical qubits for universal quantum computation, and we present protocols for realizing topologically protected Clifford gates. These hexagonal-cell qubits allow for a direct implementation of open-boundary color codes with ancilla-free syndrome read-out and logical T gates via magic-state distillation. For concreteness, we describe how the necessary operations can be implemented using networks of Majorana Cooper pair boxes, and we give a feasibility estimate for error correction in this architecture. Our approach is motivated by nanowire-based networks of topological superconductors, but it could also be realized in alternative settings such as quantum-Hall–superconductor hybrids.

  8. Population coding in sparsely connected networks of noisy neurons.

    Science.gov (United States)

    Tripp, Bryan P; Orchard, Jeff

    2012-01-01

    This study examines the relationship between population coding and spatial connection statistics in networks of noisy neurons. Encoding of sensory information in the neocortex is thought to require coordinated neural populations, because individual cortical neurons respond to a wide range of stimuli, and exhibit highly variable spiking in response to repeated stimuli. Population coding is rooted in network structure, because cortical neurons receive information only from other neurons, and because the information they encode must be decoded by other neurons, if it is to affect behavior. However, population coding theory has often ignored network structure, or assumed discrete, fully connected populations (in contrast with the sparsely connected, continuous sheet of the cortex). In this study, we modeled a sheet of cortical neurons with sparse, primarily local connections, and found that a network with this structure could encode multiple internal state variables with high signal-to-noise ratio. However, we were unable to create high-fidelity networks by instantiating connections at random according to spatial connection probabilities. In our models, high-fidelity networks required additional structure, with higher cluster factors and correlations between the inputs to nearby neurons.

  9. Radiation protection code of practice in academic and research institutes

    International Nuclear Information System (INIS)

    Abdalla, A. A. M.

    2010-05-01

    The main aim of this study was to establish a code of practice on radiation protection for safe control of radiation sources used in academic and research institutes, another aim of this study was to assess the current situation of radiation protection in some of the academic and research institutes.To achieve the aims of this study, a draft of a code of practice has been developed which is based on international and local relevant recommendation. The developed code includes the following main issues: regulatory responsibilities, radiation protection program and design of radiation installations. The second aim had been accomplished by conducting inspection visits to five (A, B, C, D and E) academic and to four (F, G, H and I ) research institutes. Eight of such institutes are located in Khartoum State and the ninth one is in Madani city (Aljazeera State). The inspection activities have been carried out using a standard inspection check list developed by the regulatory authority of the Sudan. The inspection missions to the above mentioned institutes involved also evaluation of radiation levels around the premises and storage areas of radiation sources. The dose rate measurement around radiation sources locations were found to be quite low. This mainly is due to the fact that the activities of most radionuclides that are used in these institutes are quite low ( in the range of micro curies). Also ,most the x-ray machines that were found in use for scientific academic and research purposes work at low k Vp of maximum 60 k Vp. None of the radiation workers in the inspected institutes has a personal radiation monitoring device, therefor staff dose levels have not been assessed. However it was noted that in most of the academic/ research studies radiation workers are only exposed to very low levels of radiation and for a very short time that dose not exceed 1 minute, therefore the expected occupational exposure of the staff is very low. Radiation measurement in public

  10. Selecting Optimal Parameters of Random Linear Network Coding for Wireless Sensor Networks

    DEFF Research Database (Denmark)

    Heide, J; Zhang, Qi; Fitzek, F H P

    2013-01-01

    This work studies how to select optimal code parameters of Random Linear Network Coding (RLNC) in Wireless Sensor Networks (WSNs). With Rateless Deluge [1] the authors proposed to apply Network Coding (NC) for Over-the-Air Programming (OAP) in WSNs, and demonstrated that with NC a significant...... reduction in the number of transmitted packets can be achieved. However, NC introduces additional computations and potentially a non-negligible transmission overhead, both of which depend on the chosen coding parameters. Therefore it is necessary to consider the trade-off that these coding parameters...... present in order to obtain the lowest energy consumption per transmitted bit. This problem is analyzed and suitable coding parameters are determined for the popular Tmote Sky platform. Compared to the use of traditional RLNC, these parameters enable a reduction in the energy spent per bit which grows...

  11. A neutron spectrum unfolding computer code based on artificial neural networks

    International Nuclear Information System (INIS)

    Ortiz-Rodríguez, J.M.; Reyes Alfaro, A.; Reyes Haro, A.; Cervantes Viramontes, J.M.; Vega-Carrillo, H.R.

    2014-01-01

    The Bonner Spheres Spectrometer consists of a thermal neutron sensor placed at the center of a number of moderating polyethylene spheres of different diameters. From the measured readings, information can be derived about the spectrum of the neutron field where measurements were made. Disadvantages of the Bonner system are the weight associated with each sphere and the need to sequentially irradiate the spheres, requiring long exposure periods. Provided a well-established response matrix and adequate irradiation conditions, the most delicate part of neutron spectrometry, is the unfolding process. The derivation of the spectral information is not simple because the unknown is not given directly as a result of the measurements. The drawbacks associated with traditional unfolding procedures have motivated the need of complementary approaches. Novel methods based on Artificial Intelligence, mainly Artificial Neural Networks, have been widely investigated. In this work, a neutron spectrum unfolding code based on neural nets technology is presented. This code is called Neutron Spectrometry and Dosimetry with Artificial Neural networks unfolding code that was designed in a graphical interface. The core of the code is an embedded neural network architecture previously optimized using the robust design of artificial neural networks methodology. The main features of the code are: easy to use, friendly and intuitive to the user. This code was designed for a Bonner Sphere System based on a 6 LiI(Eu) neutron detector and a response matrix expressed in 60 energy bins taken from an International Atomic Energy Agency compilation. The main feature of the code is that as entrance data, for unfolding the neutron spectrum, only seven rate counts measured with seven Bonner spheres are required; simultaneously the code calculates 15 dosimetric quantities as well as the total flux for radiation protection purposes. This code generates a full report with all information of the unfolding

  12. The radiation protection code of practice in teletherapy facilities

    International Nuclear Information System (INIS)

    Fadlalla, N. S. M.

    2010-05-01

    This study aimed to provide a document (code) for the standard practice in teletherapy facilities to be a reference and guide for establishing new teletherapy facilities or mending an existing one, another aim was to evaluated the teletherapy facilities with regard to their compliance to the recommendations and guides mentioned in this document. This document includes: safety specifications for teletherapy equipment, facility planning and shielding design, radiation protection and work practice, quality assurance and personnel requirements and responsibilities. In order to assess the degree of compliance of the two centers in the country with what was stated in the developed document IAEA inspection checklist was utilized and made some radiation measurement were made around the treatment rooms. The results of such inspection mission revealed that the current status of radiation protection in both of inspected centers is almost similar and both are not satisfactory as many of the essential items of radiation protection as stipulated in this document were not followed, which lead to unnecessary, radiation exposure to patients and staff. Finally, some recommendations that may help to improve the status of radiation protection in radiotherapy departments in Sudan are given. (Author)

  13. Energy-Efficient Cluster Based Routing Protocol in Mobile Ad Hoc Networks Using Network Coding

    Directory of Open Access Journals (Sweden)

    Srinivas Kanakala

    2014-01-01

    Full Text Available In mobile ad hoc networks, all nodes are energy constrained. In such situations, it is important to reduce energy consumption. In this paper, we consider the issues of energy efficient communication in MANETs using network coding. Network coding is an effective method to improve the performance of wireless networks. COPE protocol implements network coding concept to reduce number of transmissions by mixing the packets at intermediate nodes. We incorporate COPE into cluster based routing protocol to further reduce the energy consumption. The proposed energy-efficient coding-aware cluster based routing protocol (ECCRP scheme applies network coding at cluster heads to reduce number of transmissions. We also modify the queue management procedure of COPE protocol to further improve coding opportunities. We also use an energy efficient scheme while selecting the cluster head. It helps to increase the life time of the network. We evaluate the performance of proposed energy efficient cluster based protocol using simulation. Simulation results show that the proposed ECCRP algorithm reduces energy consumption and increases life time of the network.

  14. Enabling Cognitive Load-Aware AR with Rateless Coding on a Wearable Network

    Directory of Open Access Journals (Sweden)

    R. Razavi

    2008-01-01

    Full Text Available Augmented reality (AR on a head-mounted display is conveniently supported by a wearable wireless network. If, in addition, the AR display is moderated to take account of the cognitive load of the wearer, then additional biosensors form part of the network. In this paper, the impact of these additional traffic sources is assessed. Rateless coding is proposed to not only protect the fragile encoded video stream from wireless noise and interference but also to reduce coding overhead. The paper proposes a block-based form of rateless channel coding in which the unit of coding is a block within a packet. The contribution of this paper is that it minimizes energy consumption by reducing the overhead from forward error correction (FEC, while error correction properties are conserved. Compared to simple packet-based rateless coding, with this form of block-based coding, data loss is reduced and energy efficiency is improved. Cross-layer organization of piggy-backed response blocks must take place in response to feedback, as detailed in the paper. Compared also to variants of its default FEC scheme, results from a Bluetooth (IEEE 802.15.1 wireless network show a consistent improvement in energy consumption, packet arrival latency, and video quality at the AR display.

  15. A Practical View on Tunable Sparse Network Coding

    DEFF Research Database (Denmark)

    Sørensen, Chres Wiant; Shahbaz Badr, Arash; Cabrera Guerrero, Juan Alberto

    2015-01-01

    Tunable sparse network coding (TSNC) constitutes a promising concept for trading off computational complexity and delay performance. This paper advocates for the use of judicious feedback as a key not only to make TSNC practical, but also to deliver a highly consistent and controlled delay perfor...

  16. Physical-layer network coding in coherent optical OFDM systems.

    Science.gov (United States)

    Guan, Xun; Chan, Chun-Kit

    2015-04-20

    We present the first experimental demonstration and characterization of the application of optical physical-layer network coding in coherent optical OFDM systems. It combines two optical OFDM frames to share the same link so as to enhance system throughput, while individual OFDM frames can be recovered with digital signal processing at the destined node.

  17. Optically transparent multiple access networks employing incoherent spectral codes

    NARCIS (Netherlands)

    Huiszoon, B.

    2008-01-01

    This Ph.D. thesis is divided into 7 chapters to provide the reader an overview of the main results achieved in di®erent sub-topics of the study towards optically transparent multiple access networks employing incoherent spectral codes taking into account wireless transmission aspects. The work

  18. Network coding and its applications to satellite systems

    DEFF Research Database (Denmark)

    Vieira, Fausto; Roetter, Daniel Enrique Lucani

    2015-01-01

    Network coding has its roots in information theory where it was initially proposed as a way to improve a two-node communication using a (broadcasting) relay. For this theoretical construct, a satellite communications system was proposed as an illustrative example, where the relay node would be a ...

  19. Random linear network coding for streams with unequally sized packets

    DEFF Research Database (Denmark)

    Taghouti, Maroua; Roetter, Daniel Enrique Lucani; Pedersen, Morten Videbæk

    2016-01-01

    State of the art Random Linear Network Coding (RLNC) schemes assume that data streams generate packets with equal sizes. This is an assumption that results in the highest efficiency gains for RLNC. A typical solution for managing unequal packet sizes is to zero-pad the smallest packets. However, ...

  20. Source Coding in Networks with Covariance Distortion Constraints

    DEFF Research Database (Denmark)

    Zahedi, Adel; Østergaard, Jan; Jensen, Søren Holdt

    2016-01-01

    results to a joint source coding and denoising problem. We consider a network with a centralized topology and a given weighted sum-rate constraint, where the received signals at the center are to be fused to maximize the output SNR while enforcing no linear distortion. We show that one can design...

  1. A primer on physical-layer network coding

    CERN Document Server

    Liew, Soung Chang; Zhang, Shengli

    2015-01-01

    The concept of physical-layer network coding (PNC) was proposed in 2006 for application in wireless networks. Since then it has developed into a subfield of communications and networking with a wide following. This book is a primer on PNC. It is the outcome of a set of lecture notes for a course for beginning graduate students at The Chinese University of Hong Kong. The target audience is expected to have some prior background knowledge in communication theory and wireless communications, but not working knowledge at the research level. Indeed, a goal of this book/course is to allow the reader

  2. Maximization Network Throughput Based on Improved Genetic Algorithm and Network Coding for Optical Multicast Networks

    Science.gov (United States)

    Wei, Chengying; Xiong, Cuilian; Liu, Huanlin

    2017-12-01

    Maximal multicast stream algorithm based on network coding (NC) can improve the network's throughput for wavelength-division multiplexing (WDM) networks, which however is far less than the network's maximal throughput in terms of theory. And the existing multicast stream algorithms do not give the information distribution pattern and routing in the meantime. In the paper, an improved genetic algorithm is brought forward to maximize the optical multicast throughput by NC and to determine the multicast stream distribution by hybrid chromosomes construction for multicast with single source and multiple destinations. The proposed hybrid chromosomes are constructed by the binary chromosomes and integer chromosomes, while the binary chromosomes represent optical multicast routing and the integer chromosomes indicate the multicast stream distribution. A fitness function is designed to guarantee that each destination can receive the maximum number of decoding multicast streams. The simulation results showed that the proposed method is far superior over the typical maximal multicast stream algorithms based on NC in terms of network throughput in WDM networks.

  3. Asymmetric Modulation Gains in Network Coded Relay Networks

    DEFF Research Database (Denmark)

    Roetter, Daniel Enrique Lucani; Fitzek, Frank

    2015-01-01

    Wireless relays have usually been considered in two ways. On the one hand, a physical layer approach focused on per-packet reliability and involving the relay on each packet transmission. On the other, recent approaches have relied on the judicious activation of the relay at the network level to ...

  4. Security Concerns and Countermeasures in Network Coding Based Communications Systems

    DEFF Research Database (Denmark)

    Talooki, Vahid; Bassoli, Riccardo; Roetter, Daniel Enrique Lucani

    2015-01-01

    key protocol types, namely, state-aware and stateless protocols, specifying the benefits and disadvantages of each one of them. We also present the key security assumptions of network coding (NC) systems as well as a detailed analysis of the security goals and threats, both passive and active......This survey paper shows the state of the art in security mechanisms, where a deep review of the current research and the status of this topic is carried out. We start by introducing network coding and its variety applications in enhancing current traditional networks. In particular, we analyze two....... This paper also presents a detailed taxonomy and a timeline of the different NC security mechanisms and schemes reported in the literature. Current proposed security mechanisms and schemes for NC in the literature are classified later. Finally a timeline of these mechanism and schemes is presented....

  5. Towards Effective Intra-flow Network Coding in Software Defined Wireless Mesh Networks

    OpenAIRE

    Donghai Zhu; Xinyu Yang Yang; Peng Zhao; Wei Yu

    2016-01-01

    Wireless Mesh Networks (WMNs) have potential to provide convenient broadband wireless Internet access to mobile users.With the support of Software-Defined Networking (SDN) paradigm that separates control plane and data plane, WMNs can be easily deployed and managed. In addition, by exploiting the broadcast nature of the wireless medium and the spatial diversity of multi-hop wireless networks, intra-flow network coding has shown a greater benefit in comparison with traditional routing paradigm...

  6. Supervised Learning Based on Temporal Coding in Spiking Neural Networks.

    Science.gov (United States)

    Mostafa, Hesham

    2017-08-01

    Gradient descent training techniques are remarkably successful in training analog-valued artificial neural networks (ANNs). Such training techniques, however, do not transfer easily to spiking networks due to the spike generation hard nonlinearity and the discrete nature of spike communication. We show that in a feedforward spiking network that uses a temporal coding scheme where information is encoded in spike times instead of spike rates, the network input-output relation is differentiable almost everywhere. Moreover, this relation is piecewise linear after a transformation of variables. Methods for training ANNs thus carry directly to the training of such spiking networks as we show when training on the permutation invariant MNIST task. In contrast to rate-based spiking networks that are often used to approximate the behavior of ANNs, the networks we present spike much more sparsely and their behavior cannot be directly approximated by conventional ANNs. Our results highlight a new approach for controlling the behavior of spiking networks with realistic temporal dynamics, opening up the potential for using these networks to process spike patterns with complex temporal information.

  7. Network Coding on Heterogeneous Multi-Core Processors for Wireless Sensor Networks

    Science.gov (United States)

    Kim, Deokho; Park, Karam; Ro, Won W.

    2011-01-01

    While network coding is well known for its efficiency and usefulness in wireless sensor networks, the excessive costs associated with decoding computation and complexity still hinder its adoption into practical use. On the other hand, high-performance microprocessors with heterogeneous multi-cores would be used as processing nodes of the wireless sensor networks in the near future. To this end, this paper introduces an efficient network coding algorithm developed for the heterogenous multi-core processors. The proposed idea is fully tested on one of the currently available heterogeneous multi-core processors referred to as the Cell Broadband Engine. PMID:22164053

  8. The Exploration of Network Coding in IEEE 802.15.4 Networks

    Directory of Open Access Journals (Sweden)

    Deze Zeng

    2011-01-01

    communication protocol should be energy efficient. The IEEE 802.15.4 is designed as a standard protocol for low power, low data rate, low complexity, and short range connections in WPANs. The standard supports allocating several numbers of collision-free guarantee time slots (GTSs within a superframe for some time-critical transmissions. Recently, COPE was proposed as a promising network coding architecture to essentially improve the throughput of wireless networks. In this paper, we exploit the network coding technique at coordinators to improve energy efficiency of the WPAN. Some related practical issues, such as GTS allocation and multicast, are also discussed in order to exploit the network coding opportunities efficiently. Since the coding opportunities are mostly exploited, our proposal achieves both higher energy efficiency and throughput performance than the original IEEE 802.15.4.

  9. The queueing perspective of asynchronous network coding in two-way relay network

    Science.gov (United States)

    Liang, Yaping; Chang, Qing; Li, Xianxu

    2018-04-01

    Asynchronous network coding (NC) has potential to improve the wireless network performance compared with a routing or the synchronous network coding. Recent researches concentrate on the optimization between throughput/energy consuming and delay with a couple of independent input flow. However, the implementation of NC requires a thorough investigation of its impact on relevant queueing systems where few work focuses on. Moreover, few works study the probability density function (pdf) in network coding scenario. In this paper, the scenario with two independent Poisson input flows and one output flow is considered. The asynchronous NC-based strategy is that a new arrival evicts a head packet holding in its queue when waiting for another packet from the other flow to encode. The pdf for the output flow which contains both coded and uncoded packets is derived. Besides, the statistic characteristics of this strategy are analyzed. These results are verified by numerical simulations.

  10. Easy as Pi: A Network Coding Raspberry Pi Testbed

    Directory of Open Access Journals (Sweden)

    Chres W. Sørensen

    2016-10-01

    Full Text Available In the near future, upcoming communications and storage networks are expected to tolerate major difficulties produced by huge amounts of data being generated from the Internet of Things (IoT. For these types of networks, strategies and mechanisms based on network coding have appeared as an alternative to overcome these difficulties in a holistic manner, e.g., without sacrificing the benefit of a given network metric when improving another. There has been recurrent issues on: (i making large-scale deployments akin to the Internet of Things; (ii assessing and (iii replicating the obtained results in preliminary studies. Therefore, finding testbeds that can deal with large-scale deployments and not lose historic data in order to evaluate these mechanisms are greatly needed and desirable from a research perspective. However, this can be hard to manage, not only due to the inherent costs of the hardware, but also due to maintenance challenges. In this paper, we present the required key steps to design, setup and maintain an inexpensive testbed using Raspberry Pi devices for communications and storage networks with network coding capabilities. This testbed can be utilized for any applications requiring results replicability.

  11. Population Coding in Sparsely Connected Networks of Noisy Neurons

    Directory of Open Access Journals (Sweden)

    Bryan Patrick Tripp

    2012-05-01

    Full Text Available This study examines the relationship between population coding and spatial connection statistics in networks of noisy neurons. Encoding of sensory information in the neocortex is thought to require coordinated neural populations, because individual cortical neurons respond to a wide range of stimuli, and exhibit highly variable spiking in response to repeated stimuli. Population coding is rooted in network structure, because cortical neurons receive information only from other neurons, and because the information they encode must be decoded by other neurons, if it is to affect behaviour. However, population coding theory has often ignored network structure, or assumed discrete, fully-connected populations (in contrast with the sparsely connected, continuous sheet of the cortex. In this study, we model a sheet of cortical neurons with sparse, primarily local connections, and find that a network with this structure can encode multiple internal state variables with high signal-to-noise ratio. However, in our model, although connection probability varies with the distance between neurons, we find that the connections cannot be instantiated at random according to these probabilities, but must have additional structure if information is to be encoded with high fidelity.

  12. On Applicability of Network Coding Technique for 6LoWPAN-based Sensor Networks.

    Science.gov (United States)

    Amanowicz, Marek; Krygier, Jaroslaw

    2018-05-26

    In this paper, the applicability of the network coding technique in 6LoWPAN-based sensor multihop networks is examined. The 6LoWPAN is one of the standards proposed for the Internet of Things architecture. Thus, we can expect the significant growth of traffic in such networks, which can lead to overload and decrease in the sensor network lifetime. The authors propose the inter-session network coding mechanism that can be implemented in resource-limited sensor motes. The solution reduces the overall traffic in the network, and in consequence, the energy consumption is decreased. Used procedures take into account deep header compressions of the native 6LoWPAN packets and the hop-by-hop changes of the header structure. Applied simplifications reduce signaling traffic that is typically occurring in network coding deployments, keeping the solution usefulness for the wireless sensor networks with limited resources. The authors validate the proposed procedures in terms of end-to-end packet delay, packet loss ratio, traffic in the air, total energy consumption, and network lifetime. The solution has been tested in a real wireless sensor network. The results confirm the efficiency of the proposed technique, mostly in delay-tolerant sensor networks.

  13. Ethical codes. Fig leaf argument, ballast or cultural element for radiation protection?

    International Nuclear Information System (INIS)

    Gellermann, Rainer

    2014-01-01

    The international association for radiation protection (IRPA) adopted in May 2004 a Code of Ethics in order to allow their members to hold an adequate professional level of ethical line of action. Based on this code of ethics the professional body of radiation protection (Fachverband fuer Strahlenschutz) has developed its own ethical code and adopted in 2005.

  14. Oscillator Neural Network Retrieving Sparsely Coded Phase Patterns

    Science.gov (United States)

    Aoyagi, Toshio; Nomura, Masaki

    1999-08-01

    Little is known theoretically about the associative memory capabilities of neural networks in which information is encoded not only in the mean firing rate but also in the timing of firings. Particularly, in the case of sparsely coded patterns, it is biologically important to consider the timings of firings and to study how such consideration influences storage capacities and quality of recalled patterns. For this purpose, we propose a simple extended model of oscillator neural networks to allow for expression of a nonfiring state. Analyzing both equilibrium states and dynamical properties in recalling processes, we find that the system possesses good associative memory.

  15. Secure Network Coding against Wiretapping and Byzantine Attacks

    Directory of Open Access Journals (Sweden)

    Qin Guo

    2010-01-01

    Full Text Available In wireless networks, an attacker can tune a receiver and tap the communication between two nodes. Whether or not some meaningful information is obtained by tapping a wireless connection depends on the transmission scheme. In this paper, we design some secure network coding by combining information-theoretic approaches with cryptographic approaches. It ensures that the wiretapper cannot get any meaningful information no matter how many channels are wiretapped. In addition, if each source packet is augmented with a hash symbol which is computed from a simple nonlinear polynomial function of the data symbols, then the probability of detecting the modification is very high.

  16. Opportunistic quantum network coding based on quantum teleportation

    Science.gov (United States)

    Shang, Tao; Du, Gang; Liu, Jian-wei

    2016-04-01

    It seems impossible to endow opportunistic characteristic to quantum network on the basis that quantum channel cannot be overheard without disturbance. In this paper, we propose an opportunistic quantum network coding scheme by taking full advantage of channel characteristic of quantum teleportation. Concretely, it utilizes quantum channel for secure transmission of quantum states and can detect eavesdroppers by means of quantum channel verification. What is more, it utilizes classical channel for both opportunistic listening to neighbor states and opportunistic coding by broadcasting measurement outcome. Analysis results show that our scheme can reduce the times of transmissions over classical channels for relay nodes and can effectively defend against classical passive attack and quantum active attack.

  17. International Code Centres Network. Summary Report of the Technical Meeting

    International Nuclear Information System (INIS)

    Chung, H-K.

    2011-01-01

    Fifteen international experts on computational aspects of atomic, molecular and particle surface interaction data for fusion energy research participated in the 2nd technical meeting of the International Code Centres Network. Participants reported their research on data production and computational capabilities at their institutions. Experts in the field of plasma modeling of magnetic fusion research joined this meeting to present the data needs and bring the perspective of data users. The interaction and discussion among data producers and data users in this two-day meeting led to an agreement that the scope and function of Code Centres Network should be reformulated to serve the needs of fusion community in more effective way. (author)

  18. QoS-Aware Error Recovery in Wireless Body Sensor Networks Using Adaptive Network Coding

    Science.gov (United States)

    Razzaque, Mohammad Abdur; Javadi, Saeideh S.; Coulibaly, Yahaya; Hira, Muta Tah

    2015-01-01

    Wireless body sensor networks (WBSNs) for healthcare and medical applications are real-time and life-critical infrastructures, which require a strict guarantee of quality of service (QoS), in terms of latency, error rate and reliability. Considering the criticality of healthcare and medical applications, WBSNs need to fulfill users/applications and the corresponding network's QoS requirements. For instance, for a real-time application to support on-time data delivery, a WBSN needs to guarantee a constrained delay at the network level. A network coding-based error recovery mechanism is an emerging mechanism that can be used in these systems to support QoS at very low energy, memory and hardware cost. However, in dynamic network environments and user requirements, the original non-adaptive version of network coding fails to support some of the network and user QoS requirements. This work explores the QoS requirements of WBSNs in both perspectives of QoS. Based on these requirements, this paper proposes an adaptive network coding-based, QoS-aware error recovery mechanism for WBSNs. It utilizes network-level and user-/application-level information to make it adaptive in both contexts. Thus, it provides improved QoS support adaptively in terms of reliability, energy efficiency and delay. Simulation results show the potential of the proposed mechanism in terms of adaptability, reliability, real-time data delivery and network lifetime compared to its counterparts. PMID:25551485

  19. QOS-aware error recovery in wireless body sensor networks using adaptive network coding.

    Science.gov (United States)

    Razzaque, Mohammad Abdur; Javadi, Saeideh S; Coulibaly, Yahaya; Hira, Muta Tah

    2014-12-29

    Wireless body sensor networks (WBSNs) for healthcare and medical applications are real-time and life-critical infrastructures, which require a strict guarantee of quality of service (QoS), in terms of latency, error rate and reliability. Considering the criticality of healthcare and medical applications, WBSNs need to fulfill users/applications and the corresponding network's QoS requirements. For instance, for a real-time application to support on-time data delivery, a WBSN needs to guarantee a constrained delay at the network level. A network coding-based error recovery mechanism is an emerging mechanism that can be used in these systems to support QoS at very low energy, memory and hardware cost. However, in dynamic network environments and user requirements, the original non-adaptive version of network coding fails to support some of the network and user QoS requirements. This work explores the QoS requirements of WBSNs in both perspectives of QoS. Based on these requirements, this paper proposes an adaptive network coding-based, QoS-aware error recovery mechanism for WBSNs. It utilizes network-level and user-/application-level information to make it adaptive in both contexts. Thus, it provides improved QoS support adaptively in terms of reliability, energy efficiency and delay. Simulation results show the potential of the proposed mechanism in terms of adaptability, reliability, real-time data delivery and network lifetime compared to its counterparts.

  20. Supporting Dynamic Adaptive Streaming over HTTP in Wireless Meshed Networks using Random Linear Network Coding

    DEFF Research Database (Denmark)

    Hundebøll, Martin; Pedersen, Morten Videbæk; Roetter, Daniel Enrique Lucani

    2014-01-01

    This work studies the potential and impact of the FRANC network coding protocol for delivering high quality Dynamic Adaptive Streaming over HTTP (DASH) in wireless networks. Although DASH aims to tailor the video quality rate based on the available throughput to the destination, it relies...

  1. Cooperative and Adaptive Network Coding for Gradient Based Routing in Wireless Sensor Networks with Multiple Sinks

    Directory of Open Access Journals (Sweden)

    M. E. Migabo

    2017-01-01

    Full Text Available Despite its low computational cost, the Gradient Based Routing (GBR broadcast of interest messages in Wireless 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(2S 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.

  2. Minimizing The Completion Time Of A Wireless Cooperative Network Using Network Coding

    DEFF Research Database (Denmark)

    Roetter, Daniel Enrique Lucani; Khamfroush, Hana; Barros, João

    2013-01-01

    We consider the performance of network coding for a wireless cooperative network in which a source wants to transmit M data packets to two receivers. We assume that receivers can share their received packets with each other or simply wait to receive the packets from the source. The problem of fin...

  3. Network Coding for Hop-by-Hop Communication Enhancement in Multi-hop Networks

    DEFF Research Database (Denmark)

    Pahlevani, Peyman; Khamfroush, Hana; Roetter, Daniel Enrique Lucani

    2016-01-01

    In our recent study, we introduced the PlayNCool protocol that increases the throughput of the wireless networks by enabling a helper node to strengthen the communication link between two neighboring nodes and using random linear network coding. This paper focuses on design and implementation adv...

  4. Performance and Complexity of Tunable Sparse Network Coding with Gradual Growing Tuning Functions over Wireless Networks

    DEFF Research Database (Denmark)

    Garrido, Pablo; Sørensen, Chres Wiant; Roetter, Daniel Enrique Lucani

    2016-01-01

    Random Linear Network Coding (RLNC) has been shown to be a technique with several benefits, in particular when applied over wireless mesh networks, since it provides robustness against packet losses. On the other hand, Tunable Sparse Network Coding (TSNC) is a promising concept, which leverages...... a trade-off between computational complexity and goodput. An optimal density tuning function has not been found yet, due to the lack of a closed-form expression that links density, performance and computational cost. In addition, it would be difficult to implement, due to the feedback delay. In this work...

  5. Physical-layer Network Coding in Two-Way Heterogeneous Cellular Networks with Power Imbalance

    OpenAIRE

    Thampi, Ajay K; Liew, Soung Chang; Armour, Simon M D; Fan, Zhong; You, Lizhao; Kaleshi, Dritan

    2016-01-01

    The growing demand for high-speed data, quality of service (QoS) assurance and energy efficiency has triggered the evolution of 4G LTE-A networks to 5G and beyond. Interference is still a major performance bottleneck. This paper studies the application of physical-layer network coding (PNC), a technique that exploits interference, in heterogeneous cellular networks. In particular, we propose a rate-maximising relay selection algorithm for a single cell with multiple relays assuming the decode...

  6. Throughput vs. Delay in Lossy Wireless Mesh Networks with Random Linear Network Coding

    OpenAIRE

    Hundebøll, Martin; Pahlevani, Peyman; Roetter, Daniel Enrique Lucani; Fitzek, Frank

    2014-01-01

    This work proposes a new protocol applying on–the–fly random linear network coding in wireless mesh net-works. The protocol provides increased reliability, low delay,and high throughput to the upper layers, while being obliviousto their specific requirements. This seemingly conflicting goalsare achieved by design, using an on–the–fly network codingstrategy. Our protocol also exploits relay nodes to increasethe overall performance of individual links. Since our protocolnaturally masks random p...

  7. QoS-Aware Error Recovery in Wireless Body Sensor Networks Using Adaptive Network Coding

    Directory of Open Access Journals (Sweden)

    Mohammad Abdur Razzaque

    2014-12-01

    Full Text Available Wireless body sensor networks (WBSNs for healthcare and medical applications are real-time and life-critical infrastructures, which require a strict guarantee of quality of service (QoS, in terms of latency, error rate and reliability. Considering the criticality of healthcare and medical applications, WBSNs need to fulfill users/applications and the corresponding network’s QoS requirements. For instance, for a real-time application to support on-time data delivery, a WBSN needs to guarantee a constrained delay at the network level. A network coding-based error recovery mechanism is an emerging mechanism that can be used in these systems to support QoS at very low energy, memory and hardware cost. However, in dynamic network environments and user requirements, the original non-adaptive version of network coding fails to support some of the network and user QoS requirements. This work explores the QoS requirements of WBSNs in both perspectives of QoS. Based on these requirements, this paper proposes an adaptive network coding-based, QoS-aware error recovery mechanism for WBSNs. It utilizes network-level and user-/application-level information to make it adaptive in both contexts. Thus, it provides improved QoS support adaptively in terms of reliability, energy efficiency and delay. Simulation results show the potential of the proposed mechanism in terms of adaptability, reliability, real-time data delivery and network lifetime compared to its counterparts.

  8. Molecular codes in biological and chemical reaction networks.

    Directory of Open Access Journals (Sweden)

    Dennis Görlich

    Full Text Available Shannon's theory of communication has been very successfully applied for the analysis of biological information. However, the theory neglects semantic and pragmatic aspects and thus cannot directly be applied to distinguish between (bio- chemical systems able to process "meaningful" information from those that do not. Here, we present a formal method to assess a system's semantic capacity by analyzing a reaction network's capability to implement molecular codes. We analyzed models of chemical systems (martian atmosphere chemistry and various combustion chemistries, biochemical systems (gene expression, gene translation, and phosphorylation signaling cascades, an artificial chemistry, and random reaction networks. Our study suggests that different chemical systems possess different semantic capacities. No semantic capacity was found in the model of the martian atmosphere chemistry, the studied combustion chemistries, and highly connected random networks, i.e. with these chemistries molecular codes cannot be implemented. High semantic capacity was found in the studied biochemical systems and in random reaction networks where the number of second order reactions is twice the number of species. We conclude that our approach can be applied to evaluate the information processing capabilities of a chemical system and may thus be a useful tool to understand the origin and evolution of meaningful information, e.g. in the context of the origin of life.

  9. Content-Based Multi-Channel Network Coding Algorithm in the Millimeter-Wave Sensor Network

    Directory of Open Access Journals (Sweden)

    Kai Lin

    2016-07-01

    Full Text Available With the development of wireless technology, the widespread use of 5G is already an irreversible trend, and millimeter-wave sensor networks are becoming more and more common. However, due to the high degree of complexity and bandwidth bottlenecks, the millimeter-wave sensor network still faces numerous problems. In this paper, we propose a novel content-based multi-channel network coding algorithm, which uses the functions of data fusion, multi-channel and network coding to improve the data transmission; the algorithm is referred to as content-based multi-channel network coding (CMNC. The CMNC algorithm provides a fusion-driven model based on the Dempster-Shafer (D-S evidence theory to classify the sensor nodes into different classes according to the data content. By using the result of the classification, the CMNC algorithm also provides the channel assignment strategy and uses network coding to further improve the quality of data transmission in the millimeter-wave sensor network. Extensive simulations are carried out and compared to other methods. Our simulation results show that the proposed CMNC algorithm can effectively improve the quality of data transmission and has better performance than the compared methods.

  10. Network Coded Cooperation Over Time-Varying Channels

    DEFF Research Database (Denmark)

    Khamfroush, Hana; Roetter, Daniel Enrique Lucani; Barros, João

    2014-01-01

    transmissions, e.g., in terms of the rate of packet transmission or the energy consumption. A comprehensive analysis of the MDP solution is carried out under different network conditions to extract optimal rules of packet transmission. Inspired by the extracted rules, we propose two near-optimal heuristics......In this paper, we investigate the optimal design of cooperative network-coded strategies for a three-node wireless network with time-varying, half-duplex erasure channels. To this end, we formulate the problem of minimizing the total cost of transmitting M packets from source to two receivers...... as a Markov Decision Process (MDP). The actions of the MDP model include the source and the type of transmission to be used in a given time slot given perfect knowledge of the system state. The cost of packet transmission is defined such that it can incorporate the difference between broadcast and unicast...

  11. Predictive coding of dynamical variables in balanced spiking networks.

    Science.gov (United States)

    Boerlin, Martin; Machens, Christian K; Denève, Sophie

    2013-01-01

    Two observations about the cortex have puzzled neuroscientists for a long time. First, neural responses are highly variable. Second, the level of excitation and inhibition received by each neuron is tightly balanced at all times. Here, we demonstrate that both properties are necessary consequences of neural networks that represent information efficiently in their spikes. We illustrate this insight with spiking networks that represent dynamical variables. Our approach is based on two assumptions: We assume that information about dynamical variables can be read out linearly from neural spike trains, and we assume that neurons only fire a spike if that improves the representation of the dynamical variables. Based on these assumptions, we derive a network of leaky integrate-and-fire neurons that is able to implement arbitrary linear dynamical systems. We show that the membrane voltage of the neurons is equivalent to a prediction error about a common population-level signal. Among other things, our approach allows us to construct an integrator network of spiking neurons that is robust against many perturbations. Most importantly, neural variability in our networks cannot be equated to noise. Despite exhibiting the same single unit properties as widely used population code models (e.g. tuning curves, Poisson distributed spike trains), balanced networks are orders of magnitudes more reliable. Our approach suggests that spikes do matter when considering how the brain computes, and that the reliability of cortical representations could have been strongly underestimated.

  12. Lower Bounds on the Maximum Energy Benefit of Network Coding for Wireless Multiple Unicast

    NARCIS (Netherlands)

    Goseling, J.; Matsumoto, R.; Uyematsu, T.; Weber, J.H.

    2010-01-01

    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

  13. Lower bounds on the maximum energy benefit of network coding for wireless multiple unicast

    NARCIS (Netherlands)

    Goseling, Jasper; Matsumoto, Ryutaroh; Uyematsu, Tomohiko; Weber, Jos H.

    2010-01-01

    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

  14. Coping with the Upcoming Heterogeneity in 5G Communications and Storage Using Fulcrum Network Codes

    DEFF Research Database (Denmark)

    Roetter, Daniel Enrique Lucani; Pedersen, Morten Videbæk; Heide, Janus

    2014-01-01

    In this paper, Fulcrum network codes are introduced as a viable solution to cope with the heterogeneity of 5G communication and storage systems. Fulcrum network codes are an enhancement of random linear network codes (RLNC) offering high throughput performance at low overhead. This contrasts with...

  15. Network Coded Cooperative Communication in a Real-Time Wireless Hospital Sensor Network.

    Science.gov (United States)

    Prakash, R; Balaji Ganesh, A; Sivabalan, Somu

    2017-05-01

    The paper presents a network coded cooperative communication (NC-CC) enabled wireless hospital sensor network architecture for monitoring health as well as postural activities of a patient. A wearable device, referred as a smartband is interfaced with pulse rate, body temperature sensors and an accelerometer along with wireless protocol services, such as Bluetooth and Radio-Frequency transceiver and Wi-Fi. The energy efficiency of wearable device is improved by embedding a linear acceleration based transmission duty cycling algorithm (NC-DRDC). The real-time demonstration is carried-out in a hospital environment to evaluate the performance characteristics, such as power spectral density, energy consumption, signal to noise ratio, packet delivery ratio and transmission offset. The resource sharing and energy efficiency features of network coding technique are improved by proposing an algorithm referred as network coding based dynamic retransmit/rebroadcast decision control (LA-TDC). From the experimental results, it is observed that the proposed LA-TDC algorithm reduces network traffic and end-to-end delay by an average of 27.8% and 21.6%, respectively than traditional network coded wireless transmission. The wireless architecture is deployed in a hospital environment and results are then successfully validated.

  16. Search 40 Code of Federal Regulations (CFR): Protection of the Environment

    Data.gov (United States)

    U.S. Environmental Protection Agency — Title 40 is the section of the Code of Federal Regulations (CFR) that deals with EPA's mission of protecting human health and the environment. This web page provides...

  17. Entanglement entropy from tensor network states for stabilizer codes

    Science.gov (United States)

    He, Huan; Zheng, Yunqin; Bernevig, B. Andrei; Regnault, Nicolas

    2018-03-01

    In this paper, we present the construction of tensor network states (TNS) for some of the degenerate ground states of three-dimensional (3D) stabilizer codes. We then use the TNS formalism to obtain the entanglement spectrum and entropy of these ground states for some special cuts. In particular, we work out examples of the 3D toric code, the X-cube model, and the Haah code. The latter two models belong to the category of "fracton" models proposed recently, while the first one belongs to the conventional topological phases. We mention the cases for which the entanglement entropy and spectrum can be calculated exactly: For these, the constructed TNS is a singular value decomposition (SVD) of the ground states with respect to particular entanglement cuts. Apart from the area law, the entanglement entropies also have constant and linear corrections for the fracton models, while the entanglement entropies for the toric code models only have constant corrections. For the cuts we consider, the entanglement spectra of these three models are completely flat. We also conjecture that the negative linear correction to the area law is a signature of extensive ground-state degeneracy. Moreover, the transfer matrices of these TNSs can be constructed. We show that the transfer matrices are projectors whose eigenvalues are either 1 or 0. The number of nonzero eigenvalues is tightly related to the ground-state degeneracy.

  18. Collaborative multi-layer network coding for cellular cognitive radio networks

    KAUST Repository

    Sorour, Sameh

    2013-06-01

    In this paper, we propose a prioritized multi-layer network coding scheme for collaborative packet recovery in underlay cellular cognitive radio networks. This scheme allows the collocated primary and cognitive radio base-stations to collaborate with each other, in order to minimize their own and each other\\'s packet recovery overheads, and thus improve their throughput, without any coordination between them. This non-coordinated collaboration is done using a novel multi-layer instantly decodable network coding scheme, which guarantees that each network\\'s help to the other network does not result in any degradation in its own performance. It also does not cause any violation to the primary networks interference thresholds in the same and adjacent cells. Yet, our proposed scheme both guarantees the reduction of the recovery overhead in collocated primary and cognitive radio networks, and allows early recovery of their packets compared to non-collaborative schemes. Simulation results show that a recovery overhead reduction of 15% and 40% can be achieved by our proposed scheme in the primary and cognitive radio networks, respectively, compared to the corresponding non-collaborative scheme. © 2013 IEEE.

  19. Collaborative Multi-Layer Network Coding in Hybrid Cellular Cognitive Radio Networks

    KAUST Repository

    Moubayed, Abdallah J.

    2015-05-01

    In this paper, as an extension to [1], we propose a prioritized multi-layer network coding scheme for collaborative packet recovery in hybrid (interweave and underlay) cellular cognitive radio networks. This scheme allows the uncoordinated collaboration between the collocated primary and cognitive radio base-stations in order to minimize their own as well as each other\\'s packet recovery overheads, thus by improving their throughput. The proposed scheme ensures that each network\\'s performance is not degraded by its help to the other network. Moreover, it guarantees that the primary network\\'s interference threshold is not violated in the same and adjacent cells. Yet, the scheme allows the reduction of the recovery overhead in the collocated primary and cognitive radio networks. The reduction in the cognitive radio network is further amplified due to the perfect detection of spectrum holes which allows the cognitive radio base station to transmit at higher power without fear of violating the interference threshold of the primary network. For the secondary network, simulation results show reductions of 20% and 34% in the packet recovery overhead, compared to the non-collaborative scheme, for low and high probabilities of primary packet arrivals, respectively. For the primary network, this reduction was found to be 12%. © 2015 IEEE.

  20. Channel estimation for physical layer network coding systems

    CERN Document Server

    Gao, Feifei; Wang, Gongpu

    2014-01-01

    This SpringerBrief presents channel estimation strategies for the physical later network coding (PLNC) systems. Along with a review of PLNC architectures, this brief examines new challenges brought by the special structure of bi-directional two-hop transmissions that are different from the traditional point-to-point systems and unidirectional relay systems. The authors discuss the channel estimation strategies over typical fading scenarios, including frequency flat fading, frequency selective fading and time selective fading, as well as future research directions. Chapters explore the performa

  1. Impact of Distributed Generation Grid Code Requirements on Islanding Detection in LV Networks

    Directory of Open Access Journals (Sweden)

    Fabio Bignucolo

    2017-01-01

    Full Text Available The recent growing diffusion of dispersed generation in low voltage (LV distribution networks is entailing new rules to make local generators participate in network stability. Consequently, national and international grid codes, which define the connection rules for stability and safety of electrical power systems, have been updated requiring distributed generators and electrical storage systems to supply stabilizing contributions. In this scenario, specific attention to the uncontrolled islanding issue has to be addressed since currently required anti-islanding protection systems, based on relays locally measuring voltage and frequency, could no longer be suitable. In this paper, the effects on the interface protection performance of different LV generators’ stabilizing functions are analysed. The study takes into account existing requirements, such as the generators’ active power regulation (according to the measured frequency and reactive power regulation (depending on the local measured voltage. In addition, the paper focuses on other stabilizing features under discussion, derived from the medium voltage (MV distribution network grid codes or proposed in the literature, such as fast voltage support (FVS and inertia emulation. Stabilizing functions have been reproduced in the DIgSILENT PowerFactory 2016 software environment, making use of its native programming language. Later, they are tested both alone and together, aiming to obtain a comprehensive analysis on their impact on the anti-islanding protection effectiveness. Through dynamic simulations in several network scenarios the paper demonstrates the detrimental impact that such stabilizing regulations may have on loss-of-main protection effectiveness, leading to an increased risk of unintentional islanding.

  2. On Optimal Policies for Network-Coded Cooperation

    DEFF Research Database (Denmark)

    Khamfroush, Hana; Roetter, Daniel Enrique Lucani; Pahlevani, Peyman

    2015-01-01

    Network-coded cooperative communication (NC-CC) has been proposed and evaluated as a powerful technology that can provide a better quality of service in the next-generation wireless systems, e.g., D2D communications. Previous contributions have focused on performance evaluation of NC-CC scenarios...... rather than searching for optimal policies that can minimize the total cost of reliable packet transmission. We break from this trend by initially analyzing the optimal design of NC-CC for a wireless network with one source, two receivers, and half-duplex erasure channels. The problem is modeled...... as a special case of Markov decision process (MDP), which is called stochastic shortest path (SSP), and is solved for any field size, arbitrary number of packets, and arbitrary erasure probabilities of the channels. The proposed MDP solution results in an optimal transmission policy per time slot, and we use...

  3. DYNAVAC: a transient-vacuum-network analysis code

    International Nuclear Information System (INIS)

    Deis, G.A.

    1980-01-01

    This report discusses the structure and use of the program DYNAVAC, a new transient-vacuum-network analysis code implemented on the NMFECC CDC-7600 computer. DYNAVAC solves for the transient pressures in a network of up to twenty lumped volumes, interconnected in any configuration by specified conductances. Each volume can have an internal gas source, a pumping speed, and any initial pressure. The gas-source rates can vary with time in any piecewise-linear manner, and up to twenty different time variations can be included in a single problem. In addition, the pumping speed in each volume can vary with the total gas pumped in the volume, thus simulating the saturation of surface pumping. This report is intended to be both a general description and a user's manual for DYNAVAC

  4. Network coding multiuser scheme for indoor visible light communications

    Science.gov (United States)

    Zhang, Jiankun; Dang, Anhong

    2017-12-01

    Visible light communication (VLC) is a unique alternative for indoor data transfer and developing beyond point-to-point. However, for realizing high-capacity networks, VLC is facing challenges including the constrained bandwidth of the optical access point and random occlusion. A network coding scheme for VLC (NC-VLC) is proposed, with increased throughput and system robustness. Based on the Lambertian illumination model, theoretical decoding failure probability of the multiuser NC-VLC system is derived, and the impact of the system parameters on the performance is analyzed. Experiments demonstrate the proposed scheme successfully in the indoor multiuser scenario. These results indicate that the NC-VLC system shows a good performance under the link loss and random occlusion.

  5. Mechanisms of protection of information in computer networks and systems

    Directory of Open Access Journals (Sweden)

    Sergey Petrovich Evseev

    2011-10-01

    Full Text Available Protocols of information protection in computer networks and systems are investigated. The basic types of threats of infringement of the protection arising from the use of computer networks are classified. The basic mechanisms, services and variants of realization of cryptosystems for maintaining authentication, integrity and confidentiality of transmitted information are examined. Their advantages and drawbacks are described. Perspective directions of development of cryptographic transformations for the maintenance of information protection in computer networks and systems are defined and analyzed.

  6. O2-GIDNC: Beyond instantly decodable network coding

    KAUST Repository

    Aboutorab, Neda

    2013-06-01

    In this paper, we are concerned with extending the graph representation of generalized instantly decodable network coding (GIDNC) to a more general opportunistic network coding (ONC) scenario, referred to as order-2 GIDNC (O2-GIDNC). In the O2-GIDNC scheme, receivers can store non-instantly decodable packets (NIDPs) comprising two of their missing packets, and use them in a systematic way for later decodings. Once this graph representation is found, it can be used to extend the GIDNC graph-based analyses to the proposed O2-GIDNC scheme with a limited increase in complexity. In the proposed O2-GIDNC scheme, the information of the stored NIDPs at the receivers and the decoding opportunities they create can be exploited to improve the broadcast completion time and decoding delay compared to traditional GIDNC scheme. The completion time and decoding delay minimizing algorithms that can operate on the new O2-GIDNC graph are further described. The simulation results show that our proposed O2-GIDNC improves the completion time and decoding delay performance of the traditional GIDNC. © 2013 IEEE.

  7. Distributed coding/decoding complexity in video sensor networks.

    Science.gov (United States)

    Cordeiro, Paulo J; Assunção, Pedro

    2012-01-01

    Video Sensor Networks (VSNs) are recent communication infrastructures used to capture and transmit dense visual information from an application context. In such large scale environments which include video coding, transmission and display/storage, there are several open problems to overcome in practical implementations. This paper addresses the most relevant challenges posed by VSNs, namely stringent bandwidth usage and processing time/power constraints. In particular, the paper proposes a novel VSN architecture where large sets of visual sensors with embedded processors are used for compression and transmission of coded streams to gateways, which in turn transrate the incoming streams and adapt them to the variable complexity requirements of both the sensor encoders and end-user decoder terminals. Such gateways provide real-time transcoding functionalities for bandwidth adaptation and coding/decoding complexity distribution by transferring the most complex video encoding/decoding tasks to the transcoding gateway at the expense of a limited increase in bit rate. Then, a method to reduce the decoding complexity, suitable for system-on-chip implementation, is proposed to operate at the transcoding gateway whenever decoders with constrained resources are targeted. The results show that the proposed method achieves good performance and its inclusion into the VSN infrastructure provides an additional level of complexity control functionality.

  8. Collaborative Image Coding and Transmission over Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Min Wu

    2007-01-01

    Full Text Available The imaging sensors are able to provide intuitive visual information for quick recognition and decision. However, imaging sensors usually generate vast amount of data. Therefore, processing and coding of image data collected in a sensor network for the purpose of energy efficient transmission poses a significant technical challenge. In particular, multiple sensors may be collecting similar visual information simultaneously. We propose in this paper a novel collaborative image coding and transmission scheme to minimize the energy for data transmission. First, we apply a shape matching method to coarsely register images to find out maximal overlap to exploit the spatial correlation between images acquired from neighboring sensors. For a given image sequence, we transmit background image only once. A lightweight and efficient background subtraction method is employed to detect targets. Only the regions of target and their spatial locations are transmitted to the monitoring center. The whole image can then be reconstructed by fusing the background and the target images as well as their spatial locations. Experimental results show that the energy for image transmission can indeed be greatly reduced with collaborative image coding and transmission.

  9. Throughput vs. Delay in Lossy Wireless Mesh Networks with Random Linear Network Coding

    DEFF Research Database (Denmark)

    Hundebøll, Martin; Pahlevani, Peyman; Roetter, Daniel Enrique Lucani

    2014-01-01

    This work proposes a new protocol applying on– the–fly random linear network coding in wireless mesh net- works. The protocol provides increased reliability, low delay, and high throughput to the upper layers, while being oblivious to their specific requirements. This seemingly conflicting goals ...

  10. Improved Iterative Decoding of Network-Channel Codes for Multiple-Access Relay Channel.

    Science.gov (United States)

    Majumder, Saikat; Verma, Shrish

    2015-01-01

    Cooperative communication using relay nodes is one of the most effective means of exploiting space diversity for low cost nodes in wireless network. In cooperative communication, users, besides communicating their own information, also relay the information of other users. In this paper we investigate a scheme where cooperation is achieved using a common relay node which performs network coding to provide space diversity for two information nodes transmitting to a base station. We propose a scheme which uses Reed-Solomon error correcting code for encoding the information bit at the user nodes and convolutional code as network code, instead of XOR based network coding. Based on this encoder, we propose iterative soft decoding of joint network-channel code by treating it as a concatenated Reed-Solomon convolutional code. Simulation results show significant improvement in performance compared to existing scheme based on compound codes.

  11. Physical-layer network coding for passive optical interconnect in datacenter networks.

    Science.gov (United States)

    Lin, Rui; Cheng, Yuxin; Guan, Xun; Tang, Ming; Liu, Deming; Chan, Chun-Kit; Chen, Jiajia

    2017-07-24

    We introduce physical-layer network coding (PLNC) technique in a passive optical interconnect (POI) architecture for datacenter networks. The implementation of the PLNC in the POI at 2.5 Gb/s and 10Gb/s have been experimentally validated while the gains in terms of network layer performances have been investigated by simulation. The results reveal that in order to realize negligible packet drop, the wavelengths usage can be reduced by half while a significant improvement in packet delay especially under high traffic load can be achieved by employing PLNC over POI.

  12. Collaborative Multi-Layer Network Coding For Hybrid Cellular Cognitive Radio Networks

    KAUST Repository

    Moubayed, Abdallah J.

    2014-05-01

    In this thesis, as an extension to [1], we propose a prioritized multi-layer network coding scheme for collaborative packet recovery in hybrid (interweave and underlay) cellular cognitive radio networks. This scheme allows the uncoordinated collaboration between the collocated primary and cognitive radio base-stations in order to minimize their own as well as each other’s packet recovery overheads, thus by improving their throughput. The proposed scheme ensures that each network’s performance is not degraded by its help to the other network. Moreover, it guarantees that the primary network’s interference threshold is not violated in the same and adjacent cells. Yet, the scheme allows the reduction of the recovery overhead in the collocated primary and cognitive radio networks. The reduction in the cognitive radio network is further amplified due to the perfect detection of spectrum holes which allows the cognitive radio base station to transmit at higher power without fear of violating the interference threshold of the primary network. For the secondary network, simulation results show reductions of 20% and 34% in the packet recovery overhead, compared to the non-collaborative scheme, for low and high probabilities of primary packet arrivals, respectively. For the primary network, this reduction was found to be 12%. Furthermore, with the use of fractional cooperation, the average recovery overhead is further reduced by around 5% for the primary network and around 10% for the secondary network when a high fractional cooperation probability is used.

  13. Data Dissemination Based on Fuzzy Logic and Network Coding in Vehicular Networks

    Directory of Open Access Journals (Sweden)

    Xiaolan Tang

    2017-01-01

    Full Text Available Vehicular networks, as a significant technology in intelligent transportation systems, improve the convenience, efficiency, and safety of driving in smart cities. However, because of the high velocity, the frequent topology change, and the limited bandwidth, it is difficult to efficiently propagate data in vehicular networks. This paper proposes a data dissemination scheme based on fuzzy logic and network coding for vehicular networks, named SFN. It uses fuzzy logic to compute a transmission ability for each vehicle by comprehensively considering the effects of three factors: the velocity change rate, the velocity optimization degree, and the channel quality. Then, two nodes with high abilities are selected as primary backbone and slave backbone in every road segment, which propagate data to other vehicles in this segment and forward them to the backbones in the next segment. The backbone network helps to increase the delivery ratio and avoid invalid transmissions. Additionally, network coding is utilized to reduce transmission overhead and accelerate data retransmission in interbackbone forwarding and intrasegment broadcasting. Experiments show that, compared with existing schemes, SFN has a high delivery ratio and a short dissemination delay, while the backbone network keeps high reliability.

  14. Code of practice for radiological protection in dentistry

    International Nuclear Information System (INIS)

    1988-01-01

    This Code of Practice applies to all those involved in the practice of dentistry and is designed to minimise radiation doses to patients, dental staff and the public from the use of dental radiographic equipment

  15. Calculation codes in radiation protection, radiation physics and dosimetry

    International Nuclear Information System (INIS)

    2003-01-01

    These scientific days had for objective to draw up the situation of calculation codes of radiation transport, of sources estimation, of radiation doses managements and to draw the future perspectives. (N.C.)

  16. Performance analysis of wavelength/spatial coding system with fixed in-phase code matrices in OCDMA network

    Science.gov (United States)

    Tsai, Cheng-Mu; Liang, Tsair-Chun

    2011-12-01

    This paper proposes a wavelength/spatial (W/S) coding system with fixed in-phase code (FIPC) matrix in the optical code-division multiple-access (OCDMA) network. A scheme is presented to form the FIPC matrix which is applied to construct the W/S OCDMA network. The encoder/decoder in the W/S OCDMA network is fully able to eliminate the multiple-access-interference (MAI) at the balanced photo-detectors (PD), according to fixed in-phase cross correlation. The phase-induced intensity noise (PIIN) related to the power square is markedly suppressed in the receiver by spreading the received power into each PD while the net signal power is kept the same. Simulation results show that the W/S OCDMA network based on the FIPC matrices cannot only completely remove the MAI but effectively suppress the PIIN to upgrade the network performance.

  17. Impact of Network Coding on Delay and Throughput in Practical Wireless Chain Topologies

    DEFF Research Database (Denmark)

    Hundebøll, Martin; Rein, Stephan Alexander; Fitzek, Frank

    2013-01-01

    In this paper, we present results from a practical evaluation of network coding in a setup consisting of eight nodes deployed in a chain topology. With the tradition pure relaying, delay increases dramatically as the network gets congested, and here network coding helps to moderate this increase ...

  18. Benefit of adaptive FEC in shared backup path protected elastic optical network.

    Science.gov (United States)

    Guo, Hong; Dai, Hua; Wang, Chao; Li, Yongcheng; Bose, Sanjay K; Shen, Gangxiang

    2015-07-27

    We apply an adaptive forward error correction (FEC) allocation strategy to an Elastic Optical Network (EON) operated with shared backup path protection (SBPP). To maximize the protected network capacity that can be carried, an Integer Linear Programing (ILP) model and a spectrum window plane (SWP)-based heuristic algorithm are developed. Simulation results show that the FEC coding overhead required by the adaptive FEC scheme is significantly lower than that needed by a fixed FEC allocation strategy resulting in higher network capacity for the adaptive strategy. The adaptive FEC allocation strategy can also significantly outperform the fixed FEC allocation strategy both in terms of the spare capacity redundancy and the average FEC coding overhead needed per optical channel. The proposed heuristic algorithm is efficient and not only performs closer to the ILP model but also does much better than the shortest-path algorithm.

  19. On imperfect node protection in complex communication networks

    International Nuclear Information System (INIS)

    Xiao Shi; Xiao Gaoxi

    2011-01-01

    Motivated by recent research on complex networks, we study enhancing complex communication networks against intentional attack which takes down network nodes in a decreasing order of their degrees. Specifically, we evaluate an effect which has been largely ignored in existing studies; many real-life systems, especially communication systems, have protection mechanisms for their important components. Due to the existence of such protection, it is generally quite difficult to totally crash a protected node, though partially paralyzing it may still be feasible. Our analytical and simulation results show that such 'imperfect' protections generally speaking still help significantly enhance network robustness. Such insight may be helpful for the future developments of efficient network attack and protection schemes.

  20. On imperfect node protection in complex communication networks

    Energy Technology Data Exchange (ETDEWEB)

    Xiao Shi [Hubei Province Key Laboratory of Intelligent Robot and School of Computer Science and Engineering, Wuhan Institute of Technology, Wuhan 430073 (China); Xiao Gaoxi, E-mail: xiao_moon2002@yahoo.com.cn, E-mail: egxxiao@ntu.edu.sg [Division of Communication Engineering, School of Electrical and Electronic Engineering, Nanyang Technological University, 639798 (Singapore)

    2011-02-04

    Motivated by recent research on complex networks, we study enhancing complex communication networks against intentional attack which takes down network nodes in a decreasing order of their degrees. Specifically, we evaluate an effect which has been largely ignored in existing studies; many real-life systems, especially communication systems, have protection mechanisms for their important components. Due to the existence of such protection, it is generally quite difficult to totally crash a protected node, though partially paralyzing it may still be feasible. Our analytical and simulation results show that such 'imperfect' protections generally speaking still help significantly enhance network robustness. Such insight may be helpful for the future developments of efficient network attack and protection schemes.

  1. On the Feasibility of a Network Coded Mobile Storage Cloud

    DEFF Research Database (Denmark)

    Sipos, Marton A.; Fitzek, Frank; Roetter, Daniel Enrique Lucani

    2015-01-01

    Conventional cloud storage services offer relatively good reliability and performance in a cost-effective manner. However, they are typically structured in a centralized and highly controlled fashion. In more dynamic storage scenarios, these centralized approaches are unfeasible and developing...... to provide an effective and flexible erasure correcting code. This paper identifies and answers key questions regarding the feasibility of such a system. We show that the mobile cloud has sufficient network resources to adapt to changes in node numbers and also study the redundancy level needed to maintain...... data availability. We have found that as little as 75% redundancy is enough to offer 99.28% availability for the examined period and essentially 100% availability is achieved when using 50% redundancy along with high-availability nodes. We have leveraged traces from a popular P2P mobile application...

  2. 76 FR 70413 - National Fire Protection Association (NFPA): Request for Comments on NFPA's Codes and Standards

    Science.gov (United States)

    2011-11-14

    ... Private Fire Protection. P NFPA 36 Standard for Solvent Extraction Plants P NFPA 52 Vehicular Gaseous Fuel Systems Code P NFPA 67 Guideline on Explosion Protection for Gaseous N Mixtures in Pipe Systems. NFPA 68 Standard on Explosion Protection by Deflagration P Venting. NFPA 70B Recommended Practice for Electrical...

  3. Ethical codes. Fig leaf argument, ballast or cultural element for radiation protection?; Ethik-Codes. Feigenblatt, Ballast oder Kulturelement fuer den Strahlenschutz?

    Energy Technology Data Exchange (ETDEWEB)

    Gellermann, Rainer [Nuclear Control and Consulting GmbH, Braunschweig (Germany)

    2014-07-01

    The international association for radiation protection (IRPA) adopted in May 2004 a Code of Ethics in order to allow their members to hold an adequate professional level of ethical line of action. Based on this code of ethics the professional body of radiation protection (Fachverband fuer Strahlenschutz) has developed its own ethical code and adopted in 2005.

  4. Partially blind instantly decodable network codes for lossy feedback environment

    KAUST Repository

    Sorour, Sameh

    2014-09-01

    In this paper, we study the multicast completion and decoding delay minimization problems for instantly decodable network coding (IDNC) in the case of lossy feedback. When feedback loss events occur, the sender falls into uncertainties about packet reception at the different receivers, which forces it to perform partially blind selections of packet combinations in subsequent transmissions. To determine efficient selection policies that reduce the completion and decoding delays of IDNC in such an environment, we first extend the perfect feedback formulation in our previous works to the lossy feedback environment, by incorporating the uncertainties resulting from unheard feedback events in these formulations. For the completion delay problem, we use this formulation to identify the maximum likelihood state of the network in events of unheard feedback and employ it to design a partially blind graph update extension to the multicast IDNC algorithm in our earlier work. For the decoding delay problem, we derive an expression for the expected decoding delay increment for any arbitrary transmission. This expression is then used to find the optimal policy that reduces the decoding delay in such lossy feedback environment. Results show that our proposed solutions both outperform previously proposed approaches and achieve tolerable degradation even at relatively high feedback loss rates.

  5. Code of practice on radiation protection in the mining and milling of radioactive ores 1987

    Energy Technology Data Exchange (ETDEWEB)

    1987-01-01

    This Code was formulated under provisions of the Environment Protection (Nuclear Codes) Act 1978 in close consultation with the Governments of the States and the Northern Territory. It is a major revision of the Code of Practice on Radiation Protection in the Mining and Milling of Radioactive Ores (1980), incorporating changes flowing from advances in internationally agreed radiation protection philosophy, and experience gained in Australia in uranium mining and milling operations and the extraction of monazite from mineral sands. The Code specifies the standards, practices, procedures, and measures to prevent or limit risk to employees and to the public from uranium mining and milling, mineral sands operations and extraction of radioactive ores. To assist the industry in meeting the requirements and responsibilities imposed by the Code, guidelines to the former Code will be reviewed and, if appropriate, revised. New guidelines to assist compliance with changed requirements will also be prepared. The Act provides for the revision of codes of practice. The Code of Practice on Radiation Protection in the Mining and Milling of Radioactive Ores (1987) will be reviewed from time to time and revised if necessary to ensure that the highest standards of radiation protection in the mining and milling of radioactive ores are maintained.

  6. Code of practice on radiation protection in the mining and milling of radioactive ores 1987

    International Nuclear Information System (INIS)

    1987-01-01

    This Code was formulated under provisions of the Environment Protection (Nuclear Codes) Act 1978 in close consultation with the Governments of the States and the Northern Territory. It is a major revision of the Code of Practice on Radiation Protection in the Mining and Milling of Radioactive Ores (1980), incorporating changes flowing from advances in internationally agreed radiation protection philosophy, and experience gained in Australia in uranium mining and milling operations and the extraction of monazite from mineral sands. The Code specifies the standards, practices, procedures, and measures to prevent or limit risk to employees and to the public from uranium mining and milling, mineral sands operations and extraction of radioactive ores. To assist the industry in meeting the requirements and responsibilities imposed by the Code, guidelines to the former Code will be reviewed and, if appropriate, revised. New guidelines to assist compliance with changed requirements will also be prepared. The Act provides for the revision of codes of practice. The Code of Practice on Radiation Protection in the Mining and Milling of Radioactive Ores (1987) will be reviewed from time to time and revised if necessary to ensure that the highest standards of radiation protection in the mining and milling of radioactive ores are maintained

  7. Energy and Power Measurements for Network Coding in the Context of Green Mobile Clouds

    DEFF Research Database (Denmark)

    Paramanathan, Achuthan; Pedersen, Morten Videbæk; Roetter, Daniel Enrique Lucani

    2013-01-01

    results for inter-session network coding in Open-Mesh routers underline that the energy invested in performing network coding pays off by dramatically reducing the total energy for the transmission of data over wireless links. We also show measurements for intra-session network coding in three different......This paper presents an in-depth power and energy measurement campaign for inter- and intra-session network coding enabled communication in mobile clouds. The measurements are carried out on different commercial platforms with focus on routers and mobile phones with different CPU capabilities. Our...

  8. Interactive Video Coding and Transmission over Heterogeneous Wired-to-Wireless IP Networks Using an Edge Proxy

    Directory of Open Access Journals (Sweden)

    Modestino James W

    2004-01-01

    Full Text Available Digital video delivered over wired-to-wireless networks is expected to suffer quality degradation from both packet loss and bit errors in the payload. In this paper, the quality degradation due to packet loss and bit errors in the payload are quantitatively evaluated and their effects are assessed. We propose the use of a concatenated forward error correction (FEC coding scheme employing Reed-Solomon (RS codes and rate-compatible punctured convolutional (RCPC codes to protect the video data from packet loss and bit errors, respectively. Furthermore, the performance of a joint source-channel coding (JSCC approach employing this concatenated FEC coding scheme for video transmission is studied. Finally, we describe an improved end-to-end architecture using an edge proxy in a mobile support station to implement differential error protection for the corresponding channel impairments expected on the two networks. Results indicate that with an appropriate JSCC approach and the use of an edge proxy, FEC-based error-control techniques together with passive error-recovery techniques can significantly improve the effective video throughput and lead to acceptable video delivery quality over time-varying heterogeneous wired-to-wireless IP networks.

  9. Network Coding for Backhaul Offloading in D2D Cooperative Fog Data Networks

    Directory of Open Access Journals (Sweden)

    Ben Quinton

    2018-01-01

    Full Text Available Future distributed data networks are expected to be assisted by users cooperation and coding schemes. Given the explosive increase in the end-users’ demand for download of the content from the servers, in this paper, the implementation of instantly decodable network coding (IDNC is considered in full-duplex device-to-device (D2D cooperative fog data networks. In particular, this paper is concerned with designing efficient transmission schemes to offload traffic from the expensive backhaul of network servers by employing IDNC and users cooperation. The generalized framework where users send request for multiple packets and the transmissions are subject to erasure is considered. The optimal problem formulation is presented using the stochastic shortest path (SSP technique over the IDNC graph with induced subgraphs. However, as the optimal solution suffers from the intractability of being NP-hard, it is not suitable for real-time communications. The complexity of the problem is addressed by presenting a greedy heuristic algorithm used over the proposed graph model. The paper shows that by implementing IDNC in a full-duplex cooperative D2D network model significant reduction in the number of downloads required from the servers can be achieved, which will result in offloading of the backhaul servers and thus saving valuable servers’ resources. It is also shown that the performance of the proposed heuristic algorithm is very close to the optimal solution with much lower computational complexity.

  10. A concatenated coding scheme for biometric template protection

    NARCIS (Netherlands)

    Shao, X.; Xu, H.; Veldhuis, Raymond N.J.; Slump, Cornelis H.

    2012-01-01

    Cryptography may mitigate the privacy problem in biometric recognition systems. However, cryptography technologies lack error-tolerance and biometric samples cannot be reproduced exactly, rising the robustness problem. The biometric template protection system needs a good feature extraction

  11. Anonymous communication networks protecting privacy on the web

    CERN Document Server

    Peng, Kun

    2014-01-01

    In today's interactive network environment, where various types of organizations are eager to monitor and track Internet use, anonymity is one of the most powerful resources available to counterbalance the threat of unknown spectators and to ensure Internet privacy.Addressing the demand for authoritative information on anonymous Internet usage, Anonymous Communication Networks: Protecting Privacy on the Web examines anonymous communication networks as a solution to Internet privacy concerns. It explains how anonymous communication networks make it possible for participants to communicate with

  12. Lower Bounds on the Maximum Energy Benefit of Network Coding for Wireless Multiple Unicast

    Directory of Open Access Journals (Sweden)

    Matsumoto Ryutaroh

    2010-01-01

    Full Text Available 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.

  13. Energy and Data Throughput for Asymmetric Inter-Session Network Coding

    DEFF Research Database (Denmark)

    Paramanathan, Achuthan; Heide, Janus; Pahlevani, Peyman

    2012-01-01

    on commercial platforms. The outcome of this paper confirms the analytical expression, and the results shows that even with a large asymmetric data rate there is a gain in terms of energy consumption and throughput when network coding is applied in compare to the case when network coding is not applied.......In this paper we investigate the impact of asymmetric traffic patterns on the energy consumption and throughput in a wireless multi hop network. Network coding is a novel technique for communication systems and a viable solution for wireless multi hop networks. State-of-the-art research is mainly...

  14. Unequal Error Protected JPEG 2000 Broadcast Scheme with Progressive Fountain Codes

    OpenAIRE

    Chen, Zhao; Xu, Mai; Yin, Luiguo; Lu, Jianhua

    2012-01-01

    This paper proposes a novel scheme, based on progressive fountain codes, for broadcasting JPEG 2000 multimedia. In such a broadcast scheme, progressive resolution levels of images/video have been unequally protected when transmitted using the proposed progressive fountain codes. With progressive fountain codes applied in the broadcast scheme, the resolutions of images (JPEG 2000) or videos (MJPEG 2000) received by different users can be automatically adaptive to their channel qualities, i.e. ...

  15. Hybrid information privacy system: integration of chaotic neural network and RSA coding

    Science.gov (United States)

    Hsu, Ming-Kai; Willey, Jeff; Lee, Ting N.; Szu, Harold H.

    2005-03-01

    Electronic mails are adopted worldwide; most are easily hacked by hackers. In this paper, we purposed a free, fast and convenient hybrid privacy system to protect email communication. The privacy system is implemented by combining private security RSA algorithm with specific chaos neural network encryption process. The receiver can decrypt received email as long as it can reproduce the specified chaos neural network series, so called spatial-temporal keys. The chaotic typing and initial seed value of chaos neural network series, encrypted by the RSA algorithm, can reproduce spatial-temporal keys. The encrypted chaotic typing and initial seed value are hidden in watermark mixed nonlinearly with message media, wrapped with convolution error correction codes for wireless 3rd generation cellular phones. The message media can be an arbitrary image. The pattern noise has to be considered during transmission and it could affect/change the spatial-temporal keys. Since any change/modification on chaotic typing or initial seed value of chaos neural network series is not acceptable, the RSA codec system must be robust and fault-tolerant via wireless channel. The robust and fault-tolerant properties of chaos neural networks (CNN) were proved by a field theory of Associative Memory by Szu in 1997. The 1-D chaos generating nodes from the logistic map having arbitrarily negative slope a = p/q generating the N-shaped sigmoid was given first by Szu in 1992. In this paper, we simulated the robust and fault-tolerance properties of CNN under additive noise and pattern noise. We also implement a private version of RSA coding and chaos encryption process on messages.

  16. Network protection and insulation monitoring. Schutztechnik mit Isolationsueberwachung

    Energy Technology Data Exchange (ETDEWEB)

    Hofheinz, W

    1983-01-01

    With the increasing use of unearthed power supply networks, the selection of suitable monitoring systems has become increasingly important. By combining the unearthed power supply networks with insulation monitoring, one arrives at a protective technique with high reliability, fireproofness and accident protection. The book describes this type of network and its applications, e.g. for medical purposes. Technologies in West Germany and the USA are compared, and a historical outline is given of protective wire systems and their applications. Methods of measurement employed in insulation monitoring systems are described, and the relevant VDE regulations are cited.

  17. Intercluster Connection in Cognitive Wireless Mesh Networks Based on Intelligent Network Coding

    Science.gov (United States)

    Chen, Xianfu; Zhao, Zhifeng; Jiang, Tao; Grace, David; Zhang, Honggang

    2009-12-01

    Cognitive wireless mesh networks have great flexibility to improve spectrum resource utilization, within which secondary users (SUs) can opportunistically access the authorized frequency bands while being complying with the interference constraint as well as the QoS (Quality-of-Service) requirement of primary users (PUs). In this paper, we consider intercluster connection between the neighboring clusters under the framework of cognitive wireless mesh networks. Corresponding to the collocated clusters, data flow which includes the exchanging of control channel messages usually needs four time slots in traditional relaying schemes since all involved nodes operate in half-duplex mode, resulting in significant bandwidth efficiency loss. The situation is even worse at the gateway node connecting the two colocated clusters. A novel scheme based on network coding is proposed in this paper, which needs only two time slots to exchange the same amount of information mentioned above. Our simulation shows that the network coding-based intercluster connection has the advantage of higher bandwidth efficiency compared with the traditional strategy. Furthermore, how to choose an optimal relaying transmission power level at the gateway node in an environment of coexisting primary and secondary users is discussed. We present intelligent approaches based on reinforcement learning to solve the problem. Theoretical analysis and simulation results both show that the intelligent approaches can achieve optimal throughput for the intercluster relaying in the long run.

  18. Protection of data carriers using secure optical codes

    Science.gov (United States)

    Peters, John A.; Schilling, Andreas; Staub, René; Tompkin, Wayne R.

    2006-02-01

    Smartcard technologies, combined with biometric-enabled access control systems, are required for many high-security government ID card programs. However, recent field trials with some of the most secure biometric systems have indicated that smartcards are still vulnerable to well equipped and highly motivated counterfeiters. In this paper, we present the Kinegram Secure Memory Technology which not only provides a first-level visual verification procedure, but also reinforces the existing chip-based security measures. This security concept involves the use of securely-coded data (stored in an optically variable device) which communicates with the encoded hashed information stored in the chip memory via a smartcard reader device.

  19. Connecting to the Internet Securely; Protecting Home Networks CIAC-2324

    Energy Technology Data Exchange (ETDEWEB)

    Orvis, W J; Krystosek, P; Smith, J

    2002-11-27

    With more and more people working at home and connecting to company networks via the Internet, the risk to company networks to intrusion and theft of sensitive information is growing. Working from home has many positive advantages for both the home worker and the company they work for. However, as companies encourage people to work from home, they need to start considering the interaction of the employee's home network and the company network he connects to. This paper discusses problems and solutions related to protection of home computers from attacks on those computers via the network connection. It does not consider protection of those systems from people who have physical access to the computers nor does it consider company laptops taken on-the-road. Home networks are often targeted by intruders because they are plentiful and they are usually not well secured. While companies have departments of professionals to maintain and secure their networks, home networks are maintained by the employee who may be less knowledgeable about network security matters. The biggest problems with home networks are that: Home networks are not designed to be secure and may use technologies (wireless) that are not secure; The operating systems are not secured when they are installed; The operating systems and applications are not maintained (for security considerations) after they are installed; and The networks are often used for other activities that put them at risk for being compromised. Home networks that are going to be connected to company networks need to be cooperatively secured by the employee and the company so they do not open up the company network to intruders. Securing home networks involves many of the same operations as securing a company network: Patch and maintain systems; Securely configure systems; Eliminate unneeded services; Protect remote logins; Use good passwords; Use current antivirus software; and Moderate your Internet usage habits. Most of these

  20. Construction and performance research on variable-length codes for multirate OCDMA multimedia networks

    Science.gov (United States)

    Li, Chuan-qi; Yang, Meng-jie; Luo, De-jun; Lu, Ye; Kong, Yi-pu; Zhang, Dong-chuang

    2014-09-01

    A new kind of variable-length codes with good correlation properties for the multirate asynchronous optical code division multiple access (OCDMA) multimedia networks is proposed, called non-repetition interval (NRI) codes. The NRI codes can be constructed by structuring the interval-sets with no repetition, and the code length depends on the number of users and the code weight. According to the structural characteristics of NRI codes, the formula of bit error rate (BER) is derived. Compared with other variable-length codes, the NRI codes have lower BER. A multirate OCDMA multimedia simulation system is designed and built, the longer codes are assigned to the users who need slow speed, while the shorter codes are assigned to the users who need high speed. It can be obtained by analyzing the eye diagram that the user with slower speed has lower BER, and the conclusion is the same as the actual demand in multimedia data transport.

  1. Development of a tracer transport option for the NAPSAC fracture network computer code

    International Nuclear Information System (INIS)

    Herbert, A.W.

    1990-06-01

    The Napsac computer code predicts groundwater flow through fractured rock using a direct fracture network approach. This paper describes the development of a tracer transport algorithm for the NAPSAC code. A very efficient particle-following approach is used enabling tracer transport to be predicted through large fracture networks. The new algorithm is tested against three test examples. These demonstrations confirm the accuracy of the code for simple networks, where there is an analytical solution to the transport problem, and illustrates the use of the computer code on a more realistic problem. (author)

  2. Fresh Prime Codes Evaluation for Synchronous PPM and OPPM Signaling for Optical CDMA Networks

    Science.gov (United States)

    Karbassian, M. Massoud; Ghafouri-Shiraz, H.

    2007-06-01

    In this paper, we have proposed a novel prime spreading sequence family hereby referred to as “Double-Padded Modified Prime Code (DPMPC)” for direct-detection synchronous optical code-division multiple-access (OCDMA) networks. The new code is applied to both pulse-position and overlapping pulse-position modulation CDMA networks, and their performances were evaluated and compared with existing prime codes family. In addition, we have analyzed the system throughput and also introduced a new interference cancellation technique which significantly improves the bit error probability of OCDMA networks.

  3. Protecting infrastructure networks from cost-based attacks

    International Nuclear Information System (INIS)

    Wang Xingang; Guan Shuguang; Lai, Choy Heng

    2009-01-01

    It is well known that heterogeneous networks are vulnerable to the intentional removal of a small fraction of highly connected or loaded nodes, implying that to protect the network effectively, the important nodes should be allocated more defense resource than the others. However, if too much resource is allocated to the few important nodes, the numerous less-important nodes will be less protected, which if attacked together can still lead to devastating damage. A natural question is therefore how to efficiently distribute the limited defense resource among the network nodes such that the network damage is minimized against any attack strategy. In this paper, taking into account the factor of attack cost, the problem of network security is reconsidered in terms of efficient network defense against cost-based attacks. The results show that, for a general complex network, there exists an optimal distribution of the defense resource with which the network is best protected from cost-based attacks. Furthermore, it is found that the configuration of the optimal defense is dependent on the network parameters. Specifically, networks of larger size, sparser connection and more heterogeneous structure will more likely benefit from the defense optimization.

  4. Energy Consumption Model and Measurement Results for Network Coding-enabled IEEE 802.11 Meshed Wireless Networks

    DEFF Research Database (Denmark)

    Paramanathan, Achuthan; Rasmussen, Ulrik Wilken; Hundebøll, Martin

    2012-01-01

    This paper presents an energy model and energy measurements for network coding enabled wireless meshed networks based on IEEE 802.11 technology. The energy model and the energy measurement testbed is limited to a simple Alice and Bob scenario. For this toy scenario we compare the energy usages...... for a system with and without network coding support. While network coding reduces the number of radio transmissions, the operational activity on the devices due to coding will be increased. We derive an analytical model for the energy consumption and compare it to real measurements for which we build...... a flexible, low cost tool to be able to measure at any given node in a meshed network. We verify the precision of our tool by comparing it to a sophisticated device. Our main results in this paper are the derivation of an analytical energy model, the implementation of a distributed energy measurement testbed...

  5. Prioritized Degree Distribution in Wireless Sensor Networks with a Network Coded Data Collection Method

    Science.gov (United States)

    Wan, Jan; Xiong, Naixue; Zhang, Wei; Zhang, Qinchao; Wan, Zheng

    2012-01-01

    The reliability of wireless sensor networks (WSNs) can be greatly affected by failures of sensor nodes due to energy exhaustion or the influence of brutal external environment conditions. Such failures seriously affect the data persistence and collection efficiency. Strategies based on network coding technology for WSNs such as LTCDS can improve the data persistence without mass redundancy. However, due to the bad intermediate performance of LTCDS, a serious ‘cliff effect’ may appear during the decoding period, and source data are hard to recover from sink nodes before sufficient encoded packets are collected. In this paper, the influence of coding degree distribution strategy on the ‘cliff effect’ is observed and the prioritized data storage and dissemination algorithm PLTD-ALPHA is presented to achieve better data persistence and recovering performance. With PLTD-ALPHA, the data in sensor network nodes present a trend that their degree distribution increases along with the degree level predefined, and the persistent data packets can be submitted to the sink node according to its degree in order. Finally, the performance of PLTD-ALPHA is evaluated and experiment results show that PLTD-ALPHA can greatly improve the data collection performance and decoding efficiency, while data persistence is not notably affected. PMID:23235451

  6. Prioritized degree distribution in wireless sensor networks with a network coded data collection method.

    Science.gov (United States)

    Wan, Jan; Xiong, Naixue; Zhang, Wei; Zhang, Qinchao; Wan, Zheng

    2012-12-12

    The reliability of wireless sensor networks (WSNs) can be greatly affected by failures of sensor nodes due to energy exhaustion or the influence of brutal external environment conditions. Such failures seriously affect the data persistence and collection efficiency. Strategies based on network coding technology for WSNs such as LTCDS can improve the data persistence without mass redundancy. However, due to the bad intermediate performance of LTCDS, a serious 'cliff effect' may appear during the decoding period, and source data are hard to recover from sink nodes before sufficient encoded packets are collected. In this paper, the influence of coding degree distribution strategy on the 'cliff effect' is observed and the prioritized data storage and dissemination algorithm PLTD-ALPHA is presented to achieve better data persistence and recovering performance. With PLTD-ALPHA, the data in sensor network nodes present a trend that their degree distribution increases along with the degree level predefined, and the persistent data packets can be submitted to the sink node according to its degree in order. Finally, the performance of PLTD-ALPHA is evaluated and experiment results show that PLTD-ALPHA can greatly improve the data collection performance and decoding efficiency, while data persistence is not notably affected.

  7. The Application of Social Characteristic and L1 Optimization in the Error Correction for Network Coding in Wireless Sensor Networks.

    Science.gov (United States)

    Zhang, Guangzhi; Cai, Shaobin; Xiong, Naixue

    2018-02-03

    One of the remarkable challenges about Wireless Sensor Networks (WSN) is how to transfer the collected data efficiently due to energy limitation of sensor nodes. Network coding will increase network throughput of WSN dramatically due to the broadcast nature of WSN. However, the network coding usually propagates a single original error over the whole network. Due to the special property of error propagation in network coding, most of error correction methods cannot correct more than C /2 corrupted errors where C is the max flow min cut of the network. To maximize the effectiveness of network coding applied in WSN, a new error-correcting mechanism to confront the propagated error is urgently needed. Based on the social network characteristic inherent in WSN and L1 optimization, we propose a novel scheme which successfully corrects more than C /2 corrupted errors. What is more, even if the error occurs on all the links of the network, our scheme also can correct errors successfully. With introducing a secret channel and a specially designed matrix which can trap some errors, we improve John and Yi's model so that it can correct the propagated errors in network coding which usually pollute exactly 100% of the received messages. Taking advantage of the social characteristic inherent in WSN, we propose a new distributed approach that establishes reputation-based trust among sensor nodes in order to identify the informative upstream sensor nodes. With referred theory of social networks, the informative relay nodes are selected and marked with high trust value. The two methods of L1 optimization and utilizing social characteristic coordinate with each other, and can correct the propagated error whose fraction is even exactly 100% in WSN where network coding is performed. The effectiveness of the error correction scheme is validated through simulation experiments.

  8. Network Security Hacks Tips & Tools for Protecting Your Privacy

    CERN Document Server

    Lockhart, Andrew

    2009-01-01

    This second edition of Network Security Hacks offers 125 concise and practical hacks, including more information for Windows administrators, hacks for wireless networking (such as setting up a captive portal and securing against rogue hotspots), and techniques to ensure privacy and anonymity, including ways to evade network traffic analysis, encrypt email and files, and protect against phishing attacks. System administrators looking for reliable answers will also find concise examples of applied encryption, intrusion detection, logging, trending, and incident response.

  9. Characterization of the Network of Protected Areas in Puerto Rico

    Science.gov (United States)

    J. Castro-Prieto; Maya Quinones; William Gould

    2016-01-01

    Our goal was to describe the biodiversity and associated landscape diversity and forest cover characteristics within the network of terrestrial protected areas in Puerto Rico. We conducted spatial analysis to quantify different indicators of diversity at these sites. We found that protected areas in Puerto Rico overlap the most species-rich regions on the island,...

  10. A large scale code resolution service network in the Internet of Things.

    Science.gov (United States)

    Yu, Haining; Zhang, Hongli; Fang, Binxing; Yu, Xiangzhan

    2012-11-07

    In the Internet of Things a code resolution service provides a discovery mechanism for a requester to obtain the information resources associated with a particular product code immediately. In large scale application scenarios a code resolution service faces some serious issues involving heterogeneity, big data and data ownership. A code resolution service network is required to address these issues. Firstly, a list of requirements for the network architecture and code resolution services is proposed. Secondly, in order to eliminate code resolution conflicts and code resolution overloads, a code structure is presented to create a uniform namespace for code resolution records. Thirdly, we propose a loosely coupled distributed network consisting of heterogeneous, independent; collaborating code resolution services and a SkipNet based code resolution service named SkipNet-OCRS, which not only inherits DHT’s advantages, but also supports administrative control and autonomy. For the external behaviors of SkipNet-OCRS, a novel external behavior mode named QRRA mode is proposed to enhance security and reduce requester complexity. For the internal behaviors of SkipNet-OCRS, an improved query algorithm is proposed to increase query efficiency. It is analyzed that integrating SkipNet-OCRS into our resolution service network can meet our proposed requirements. Finally, simulation experiments verify the excellent performance of SkipNet-OCRS.

  11. A Large Scale Code Resolution Service Network in the Internet of Things

    Directory of Open Access Journals (Sweden)

    Xiangzhan Yu

    2012-11-01

    Full Text Available In the Internet of Things a code resolution service provides a discovery mechanism for a requester to obtain the information resources associated with a particular product code immediately. In large scale application scenarios a code resolution service faces some serious issues involving heterogeneity, big data and data ownership. A code resolution service network is required to address these issues. Firstly, a list of requirements for the network architecture and code resolution services is proposed. Secondly, in order to eliminate code resolution conflicts and code resolution overloads, a code structure is presented to create a uniform namespace for code resolution records. Thirdly, we propose a loosely coupled distributed network consisting of heterogeneous, independent; collaborating code resolution services and a SkipNet based code resolution service named SkipNet-OCRS, which not only inherits DHT’s advantages, but also supports administrative control and autonomy. For the external behaviors of SkipNet-OCRS, a novel external behavior mode named QRRA mode is proposed to enhance security and reduce requester complexity. For the internal behaviors of SkipNet-OCRS, an improved query algorithm is proposed to increase query efficiency. It is analyzed that integrating SkipNet-OCRS into our resolution service network can meet our proposed requirements. Finally, simulation experiments verify the excellent performance of SkipNet-OCRS.

  12. A Large Scale Code Resolution Service Network in the Internet of Things

    Science.gov (United States)

    Yu, Haining; Zhang, Hongli; Fang, Binxing; Yu, Xiangzhan

    2012-01-01

    In the Internet of Things a code resolution service provides a discovery mechanism for a requester to obtain the information resources associated with a particular product code immediately. In large scale application scenarios a code resolution service faces some serious issues involving heterogeneity, big data and data ownership. A code resolution service network is required to address these issues. Firstly, a list of requirements for the network architecture and code resolution services is proposed. Secondly, in order to eliminate code resolution conflicts and code resolution overloads, a code structure is presented to create a uniform namespace for code resolution records. Thirdly, we propose a loosely coupled distributed network consisting of heterogeneous, independent; collaborating code resolution services and a SkipNet based code resolution service named SkipNet-OCRS, which not only inherits DHT's advantages, but also supports administrative control and autonomy. For the external behaviors of SkipNet-OCRS, a novel external behavior mode named QRRA mode is proposed to enhance security and reduce requester complexity. For the internal behaviors of SkipNet-OCRS, an improved query algorithm is proposed to increase query efficiency. It is analyzed that integrating SkipNet-OCRS into our resolution service network can meet our proposed requirements. Finally, simulation experiments verify the excellent performance of SkipNet-OCRS. PMID:23202207

  13. Green Mobile Clouds: Network Coding and User Cooperation for Improved Energy Efficiency

    DEFF Research Database (Denmark)

    Heide, Janus; Fitzek, Frank; Pedersen, Morten Videbæk

    2012-01-01

    This paper highlights the benefits of user cooperation and network coding for energy saving in cellular networks. It is shown that these techniques allow for reliable and efficient multicast services from both a user and network perspective. The working principles and advantages in terms of energy...

  14. Delay reduction in multi-hop device-to-device communication using network coding

    KAUST Repository

    Douik, Ahmed S.; Sorour, Sameh; Al-Naffouri, Tareq Y.; Yang, Hong-Chuan; Alouini, Mohamed-Slim

    2015-01-01

    This paper considers the problem of reducing the broadcast delay of wireless networks using instantly decodable network coding (IDNC) based device-to-device (D2D) communications. In D2D-enabled networks, devices help hasten the recovery of the lost

  15. Channel coding in the space station data system network

    Science.gov (United States)

    Healy, T.

    1982-01-01

    A detailed discussion of the use of channel coding for error correction, privacy/secrecy, channel separation, and synchronization is presented. Channel coding, in one form or another, is an established and common element in data systems. No analysis and design of a major new system would fail to consider ways in which channel coding could make the system more effective. The presence of channel coding on TDRS, Shuttle, the Advanced Communication Technology Satellite Program system, the JSC-proposed Space Operations Center, and the proposed 30/20 GHz Satellite Communication System strongly support the requirement for the utilization of coding for the communications channel. The designers of the space station data system have to consider the use of channel coding.

  16. Artificial neural network based approach to transmission lines protection

    International Nuclear Information System (INIS)

    Joorabian, M.

    1999-05-01

    The aim of this paper is to present and accurate fault detection technique for high speed distance protection using artificial neural networks. The feed-forward multi-layer neural network with the use of supervised learning and the common training rule of error back-propagation is chosen for this study. Information available locally at the relay point is passed to a neural network in order for an assessment of the fault location to be made. However in practice there is a large amount of information available, and a feature extraction process is required to reduce the dimensionality of the pattern vectors, whilst retaining important information that distinguishes the fault point. The choice of features is critical to the performance of the neural networks learning and operation. A significant feature in this paper is that an artificial neural network has been designed and tested to enhance the precision of the adaptive capabilities for distance protection

  17. Enhancing a network coding security scheme to avoid packet dropping in wireless mesh networks / H.L.H.C. Terblanche.

    OpenAIRE

    Terblanche, Heila Levina Helena Catharina

    2013-01-01

    With the increase of mobile and smart device usage, the interest in dynamically forming networks is rising. One such type of network isWireless Mesh Networks (WMNs). WMNs are multi-hop networks, with a decentralised nature that can dynamically form into mesh topologies. Network Coding (NC) is a method that is used to increase the efficiency of networks by encoding and decoding data on packet level by means of an XOR operation. NC works well with WMNs because it can exploit WMNs broadcast a...

  18. Network-Coded Content Delivery in Femtocaching-Assisted Cellular Networks

    KAUST Repository

    Shnaiwer, Yousef N.; Sorour, Sameh; Aboutorab, Neda; Sadeghi, Parastoo; Al-Naffouri, Tareq Y.

    2015-01-01

    Next-generation cellular networks are expected to be assisted by femtocaches (FCs), which collectively store the most popular files for the clients. Given any arbitrary non-fragmented placement of such files, a strict no-latency constraint, and clients' prior knowledge, new file download requests could be efficiently handled by both the FCs and the macrocell base station (MBS) using opportunistic network coding (ONC). In this paper, we aim to find the best allocation of coded file downloads to the FCs so as to minimize the MBS involvement in this download process. We first formulate this optimization problem over an ONC graph, and show that it is NP-hard. We then propose a greedy approach that maximizes the number of files downloaded by the FCs, with the goal to reduce the download share of the MBS. This allocation is performed using a dual conflict ONC graph to avoid conflicts among the FC downloads. Simulations show that our proposed scheme almost achieves the optimal performance and significantly saves on the MBS bandwidth.

  19. Network-Coded Content Delivery in Femtocaching-Assisted Cellular Networks

    KAUST Repository

    Shnaiwer, Yousef N.

    2015-12-06

    Next-generation cellular networks are expected to be assisted by femtocaches (FCs), which collectively store the most popular files for the clients. Given any arbitrary non-fragmented placement of such files, a strict no-latency constraint, and clients\\' prior knowledge, new file download requests could be efficiently handled by both the FCs and the macrocell base station (MBS) using opportunistic network coding (ONC). In this paper, we aim to find the best allocation of coded file downloads to the FCs so as to minimize the MBS involvement in this download process. We first formulate this optimization problem over an ONC graph, and show that it is NP-hard. We then propose a greedy approach that maximizes the number of files downloaded by the FCs, with the goal to reduce the download share of the MBS. This allocation is performed using a dual conflict ONC graph to avoid conflicts among the FC downloads. Simulations show that our proposed scheme almost achieves the optimal performance and significantly saves on the MBS bandwidth.

  20. DNBR calculation in digital core protection system by a subchannel analysis code

    International Nuclear Information System (INIS)

    In, W. K.; Yoo, Y. J.; Hwang, T. H.; Ji, S. K.

    2001-01-01

    The DNBR calculation uncertainty and DNBR margin were evaluated in digital core protection system by a thermal-hydrualic subchannel analysis code MATRA. A simplified thermal-hydraulic code CETOP is used to calculate on-line DNBR in core protection system at a digital PWR. The DNBR tuning process against a best-estimate subchannel analysis code is required for CETOP to ensure accurate and conservative DNBR calculation but not necessary for MATRA. The DNBR calculations by MATRA and CETOP were performed for a large number of operating condition in Yonggwang nulcear units 3-4 where the digitial core protection system is initially implemented in Korea. MATRA resulted in a less negative mean value (i.e., reduce the overconservatism) and a somewhat larger standard deviation of the DNBR error. The uncertainty corrected minimum DNBR by MATRA was shown to be higher by 1.8% -9.9% that the CETOP DNBR

  1. Kodo: An Open and Research Oriented Network Coding Library

    DEFF Research Database (Denmark)

    Pedersen, Morten Videbæk; Heide, Janus; Fitzek, Frank

    2011-01-01

    We consider the problem of efficient decoding of a random linear code over a finite field. In particular we are interested in the case where the code is random, relatively sparse, and use the binary finite field as an example. The goal is to decode the data using fewer operations to potentially a...

  2. Spatially coupled LDPC coding in cooperative wireless networks

    NARCIS (Netherlands)

    Jayakody, D.N.K.; Skachek, V.; Chen, B.

    2016-01-01

    This paper proposes a novel technique of spatially coupled low-density parity-check (SC-LDPC) code-based soft forwarding relaying scheme for a two-way relay system. We introduce an array-based optimized SC-LDPC codes in relay channels. A more precise model is proposed to characterize the residual

  3. Iterated decoding of modified product codes in optical networks

    DEFF Research Database (Denmark)

    Justesen, Jørn

    2009-01-01

    Appendix I of the standard ITU-T G.975 contains several codes that have been proposed for improved performance of optical transmission. While the original application was submarine cables, the codes are now also used in terrestrial systems where wavelength-division multiplexing (WDM) is introduced...

  4. The Tile-map Based Vulnerability Assessment Code of a Physical Protection System: SAPE (Systematic Analysis of Protection Effectiveness)

    International Nuclear Information System (INIS)

    Jang, Sung Soon; Kwak, Sung Woo; Yoo, Ho Sik; Kim, Jung Soo; Yoon, Wan Ki

    2008-01-01

    Increasing threats on nuclear facilities demands stronger physical protection system (PPS) within the limited budget. For this reason we need an efficient physical protection system and before making an efficient PPS we need to evaluate it. This evaluation process should faithfully reflect real situation, reveal weak points and unnecessary protection elements, and give comparable quantitative values. Performance based analysis helps to build an efficient physical protection system. Instead of regulating the number of sensors and barriers, the performance based analysis evaluates a PPS fit to the situation of a facility. The analysis assesses delay (sensors) and detection (barriers) of a PPS against an intrusion, and judges whether a response force arrives before intruders complete their job. Performance based analysis needs complicated calculation and, hence, several assessment codes have been developed. A code called the estimation of adversary sequence interruption (EASI) was developed to analyze vulnerability along a single intrusion path. The systematic analysis of vulnerability to intrusion (SAVI) code investigates multi-paths to a valuable asset in an actual facility. SAVI uses adversary sequence diagram to describe multi-paths

  5. Impact of dynamic rate coding aspects of mobile phone networks on forensic voice comparison.

    Science.gov (United States)

    Alzqhoul, Esam A S; Nair, Balamurali B T; Guillemin, Bernard J

    2015-09-01

    Previous studies have shown that landline and mobile phone networks are different in their ways of handling the speech signal, and therefore in their impact on it. But the same is also true of the different networks within the mobile phone arena. There are two major mobile phone technologies currently in use today, namely the global system for mobile communications (GSM) and code division multiple access (CDMA) and these are fundamentally different in their design. For example, the quality of the coded speech in the GSM network is a function of channel quality, whereas in the CDMA network it is determined by channel capacity (i.e., the number of users sharing a cell site). This paper examines the impact on the speech signal of a key feature of these networks, namely dynamic rate coding, and its subsequent impact on the task of likelihood-ratio-based forensic voice comparison (FVC). Surprisingly, both FVC accuracy and precision are found to be better for both GSM- and CDMA-coded speech than for uncoded. Intuitively one expects FVC accuracy to increase with increasing coded speech quality. This trend is shown to occur for the CDMA network, but, surprisingly, not for the GSM network. Further, in respect to comparisons between these two networks, FVC accuracy for CDMA-coded speech is shown to be slightly better than for GSM-coded speech, particularly when the coded-speech quality is high, but in terms of FVC precision the two networks are shown to be very similar. Copyright © 2015 The Chartered Society of Forensic Sciences. Published by Elsevier Ireland Ltd. All rights reserved.

  6. Implementation and Performance Evaluation of Distributed Cloud Storage Solutions using Random Linear Network Coding

    DEFF Research Database (Denmark)

    Fitzek, Frank; Toth, Tamas; Szabados, Áron

    2014-01-01

    This paper advocates the use of random linear network coding for storage in distributed clouds in order to reduce storage and traffic costs in dynamic settings, i.e. when adding and removing numerous storage devices/clouds on-the-fly and when the number of reachable clouds is limited. We introduce...... various network coding approaches that trade-off reliability, storage and traffic costs, and system complexity relying on probabilistic recoding for cloud regeneration. We compare these approaches with other approaches based on data replication and Reed-Solomon codes. A simulator has been developed...... to carry out a thorough performance evaluation of the various approaches when relying on different system settings, e.g., finite fields, and network/storage conditions, e.g., storage space used per cloud, limited network use, and limited recoding capabilities. In contrast to standard coding approaches, our...

  7. Adaptive Network Coded Clouds: High Speed Downloads and Cost-Effective Version Control

    DEFF Research Database (Denmark)

    Sipos, Marton A.; Heide, Janus; Roetter, Daniel Enrique Lucani

    2018-01-01

    Although cloud systems provide a reliable and flexible storage solution, the use of a single cloud service constitutes a single point of failure, which can compromise data availability, download speed, and security. To address these challenges, we advocate for the use of multiple cloud storage...... providers simultaneously using network coding as the key enabling technology. Our goal is to study two challenges of network coded storage systems. First, the efficient update of the number of coded fragments per cloud in a system aggregating multiple clouds in order to boost the download speed of files. We...... developed a novel scheme using recoding with limited packets to trade-off storage space, reliability, and data retrieval speed. Implementation and measurements with commercial cloud providers show that up to 9x less network use is needed compared to other network coding schemes, while maintaining similar...

  8. Validation Study of CODES Dragonfly Network Model with Theta Cray XC System

    Energy Technology Data Exchange (ETDEWEB)

    Mubarak, Misbah [Argonne National Lab. (ANL), Argonne, IL (United States); Ross, Robert B. [Argonne National Lab. (ANL), Argonne, IL (United States)

    2017-05-31

    This technical report describes the experiments performed to validate the MPI performance measurements reported by the CODES dragonfly network simulation with the Theta Cray XC system at the Argonne Leadership Computing Facility (ALCF).

  9. On minimizing the maximum broadcast decoding delay for instantly decodable network coding

    KAUST Repository

    Douik, Ahmed S.; Sorour, Sameh; Alouini, Mohamed-Slim; Ai-Naffouri, Tareq Y.

    2014-01-01

    In this paper, we consider the problem of minimizing the maximum broadcast decoding delay experienced by all the receivers of generalized instantly decodable network coding (IDNC). Unlike the sum decoding delay, the maximum decoding delay as a

  10. Shared protection based virtual network mapping in space division multiplexing optical networks

    Science.gov (United States)

    Zhang, Huibin; Wang, Wei; Zhao, Yongli; Zhang, Jie

    2018-05-01

    Space Division Multiplexing (SDM) has been introduced to improve the capacity of optical networks. In SDM optical networks, there are multiple cores/modes in each fiber link, and spectrum resources are multiplexed in both frequency and core/modes dimensions. Enabled by network virtualization technology, one SDM optical network substrate can be shared by several virtual networks operators. Similar with point-to-point connection services, virtual networks (VN) also need certain survivability to guard against network failures. Based on customers' heterogeneous requirements on the survivability of their virtual networks, this paper studies the shared protection based VN mapping problem and proposes a Minimum Free Frequency Slots (MFFS) mapping algorithm to improve spectrum efficiency. Simulation results show that the proposed algorithm can optimize SDM optical networks significantly in terms of blocking probability and spectrum utilization.

  11. Knowledge extraction from evolving spiking neural networks with rank order population coding.

    Science.gov (United States)

    Soltic, Snjezana; Kasabov, Nikola

    2010-12-01

    This paper demonstrates how knowledge can be extracted from evolving spiking neural networks with rank order population coding. Knowledge discovery is a very important feature of intelligent systems. Yet, a disproportionally small amount of research is centered on the issue of knowledge extraction from spiking neural networks which are considered to be the third generation of artificial neural networks. The lack of knowledge representation compatibility is becoming a major detriment to end users of these networks. We show that a high-level knowledge can be obtained from evolving spiking neural networks. More specifically, we propose a method for fuzzy rule extraction from an evolving spiking network with rank order population coding. The proposed method was used for knowledge discovery on two benchmark taste recognition problems where the knowledge learnt by an evolving spiking neural network was extracted in the form of zero-order Takagi-Sugeno fuzzy IF-THEN rules.

  12. Caching and Network Coding for Smart Radio Access

    NARCIS (Netherlands)

    Serbetci, Berksan

    2018-01-01

    The current generation has undoubtedly been witnessing a revolution of wireless network technologies in recent decades. First of all, there has been an enormous growth of wireless user equipments and network infrastructures in terms of both number and variety. Moreover, data traffic over wireless

  13. Implementation of Network Coding for Social Mobile Clouds

    DEFF Research Database (Denmark)

    Fitzek, Frank; Heide, Janus; Pedersen, Morten Videbæk

    2013-01-01

    , the social elements will play an important role. By means of social networks, examples were given of how social benefits can be created to persuade users to cooperate. More examples will be found in the future as social networking technology develops, but the initial examples underline the feasibility...

  14. On the Throughput and Energy Benefits of Network Coded Cooperation

    DEFF Research Database (Denmark)

    Hernandez, Nestor; Heide, Janus; Roetter, Daniel Enrique Lucani

    2014-01-01

    Cooperative techniques in wireless mobile networks typically leverage short-range communication technologies, e.g., WiFi, to allow data exchange between devices forming a mobile cloud. These mobile clouds have been considered as a key to reduce the cost of multicast services for the network...

  15. Parity-Check Network Coding for Multiple Access Relay Channel in Wireless Sensor Cooperative Communications

    Directory of Open Access Journals (Sweden)

    Du Bing

    2010-01-01

    Full Text Available A recently developed theory suggests that network coding is a generalization of source coding and channel coding and thus yields a significant performance improvement in terms of throughput and spatial diversity. This paper proposes a cooperative design of a parity-check network coding scheme in the context of a two-source multiple access relay channel (MARC model, a common compact model in hierarchical wireless sensor networks (WSNs. The scheme uses Low-Density Parity-Check (LDPC as the surrogate to build up a layered structure which encapsulates the multiple constituent LDPC codes in the source and relay nodes. Specifically, the relay node decodes the messages from two sources, which are used to generate extra parity-check bits by a random network coding procedure to fill up the rate gap between Source-Relay and Source-Destination transmissions. Then, we derived the key algebraic relationships among multidimensional LDPC constituent codes as one of the constraints for code profile optimization. These extra check bits are sent to the destination to realize a cooperative diversity as well as to approach MARC decode-and-forward (DF capacity.

  16. Bridging Inter-flow and Intra-flow Network Coding for Video Applications

    DEFF Research Database (Denmark)

    Hansen, Jonas; Krigslund, Jeppe; Roetter, Daniel Enrique Lucani

    2013-01-01

    transmission approach to decide how much and when to send redundancy in the network, and a minimalistic feedback mechanism to guarantee delivery of generations of the different flows. Given the delay constraints of video applications, we proposed a simple yet effective coding mechanism, Block Coding On The Fly...

  17. Secure-Network-Coding-Based File Sharing via Device-to-Device Communication

    Directory of Open Access Journals (Sweden)

    Lei Wang

    2017-01-01

    Full Text Available In order to increase the efficiency and security of file sharing in the next-generation networks, this paper proposes a large scale file sharing scheme based on secure network coding via device-to-device (D2D communication. In our scheme, when a user needs to share data with others in the same area, the source node and all the intermediate nodes need to perform secure network coding operation before forwarding the received data. This process continues until all the mobile devices in the networks successfully recover the original file. The experimental results show that secure network coding is very feasible and suitable for such file sharing. Moreover, the sharing efficiency and security outperform traditional replication-based sharing scheme.

  18. 75 FR 66725 - National Fire Protection Association (NFPA) Proposes To Revise Codes and Standards

    Science.gov (United States)

    2010-10-29

    ... for Solvent 5/23/2011 Extraction Plants. NFPA 51--2007 Standard for the Design and 11/23/2010... Practice for a 5/23/2011 Field Flame Test for Textiles and Films. NFPA 909--2010 Code for the Protection of...

  19. A rapid protection switching method in carrier ethernet ring networks

    Science.gov (United States)

    Yuan, Liang; Ji, Meng

    2008-11-01

    Abstract: Ethernet is the most important Local Area Network (LAN) technology since more than 90% data traffic in access layer is carried on Ethernet. From 10M to 10G, the improving Ethernet technology can be not only used in LAN, but also a good choice for MAN even WAN. MAN are always constructed in ring topology because the ring network could provide resilient path protection by using less resource (fibre or cable) than other network topologies. In layer 2 data networks, spanning tree protocol (STP) is always used to protect transmit link and preventing the formation of logic loop in networks. However, STP cannot guarantee the efficiency of service convergence when link fault happened. In fact, convergent time of networks with STP is about several minutes. Though Rapid Spanning Tree Protocol (RSTP) and Multi-Spanning Tree Protocol (MSTP) improve the STP technology, they still need a couple of seconds to achieve convergence, and can not provide sub-50ms protection switching. This paper presents a novel rapid ring protection method (RRPM) for carrier Ethernet. Unlike other link-fault detection method, it adopts distributed algorithm to detect link fault rapidly (sub-50ms). When networks restore from link fault, it can revert to the original working state. RRPM can provide single ring protection and interconnected ring protection without the formation of super loop. In normal operation, the master node blocks the secondary port for all non-RRPM Ethernet frames belonging to the given RRPM Ring, thereby avoiding a loop in the ring. When link fault happens, the node on which the failure happens moves from the "ring normal" state to the "ring fault" state. It also sends "link down" frame immediately to other nodes and blocks broken port and flushes its forwarding database. Those who receive "link down" frame will flush forwarding database and master node should unblock its secondary port. When the failure restores, the whole ring will revert to the normal state. That is

  20. Polarization diversity scheme on spectral polarization coding optical code-division multiple-access network

    Science.gov (United States)

    Yen, Chih-Ta; Huang, Jen-Fa; Chang, Yao-Tang; Chen, Bo-Hau

    2010-12-01

    We present an experiment demonstrating the spectral-polarization coding optical code-division multiple-access system introduced with a nonideal state of polarization (SOP) matching conditions. In the proposed system, the encoding and double balanced-detection processes are implemented using a polarization-diversity scheme. Because of the quasiorthogonality of Hadamard codes combining with array waveguide grating routers and a polarization beam splitter, the proposed codec pair can encode-decode multiple code words of Hadamard code while retaining the ability for multiple-access interference cancellation. The experimental results demonstrate that when the system is maintained with an orthogonal SOP for each user, an effective reduction in the phase-induced intensity noise is obtained. The analytical SNR values are found to overstate the experimental results by around 2 dB when the received effective power is large. This is mainly limited by insertion losses of components and a nonflattened optical light source. Furthermore, the matching conditions can be improved by decreasing nonideal influences.

  1. Synchrophasor Sensor Networks for Grid Communication and Protection.

    Science.gov (United States)

    Gharavi, Hamid; Hu, Bin

    2017-07-01

    This paper focuses primarily on leveraging synchronized current/voltage amplitudes and phase angle measurements to foster new categories of applications, such as improving the effectiveness of grid protection and minimizing outage duration for distributed grid systems. The motivation for such an application arises from the fact that with the support of communication, synchronized measurements from multiple sites in a grid network can greatly enhance the accuracy and timeliness of identifying the source of instabilities. The paper first provides an overview of synchrophasor networks and then presents techniques for power quality assessment, including fault detection and protection. To achieve this we present a new synchrophasor data partitioning scheme that is based on the formation of a joint space and time observation vector. Since communication is an integral part of synchrophasor networks, the newly adopted wireless standard for machine-to-machine (M2M) communication, known as IEEE 802.11ah, has been investigated. The paper also presents a novel implementation of a hardware in the loop testbed for real-time performance evaluation. The purpose is to illustrate the use of both hardware and software tools to verify the performance of synchrophasor networks under more realistic environments. The testbed is a combination of grid network modeling, and an Emulab-based communication network. The combined grid and communication network is then used to assess power quality for fault detection and location using the IEEE 39-bus and 390-bus systems.

  2. The Protection of the Right to Life in the New Criminal Code

    Directory of Open Access Journals (Sweden)

    Lavinia Mihaela Vladila

    2011-05-01

    Full Text Available The present article illustrates general aspects of the actual regulation on the protection of the rightto life, in comparison with the new regulation, which shall be analyzed more carefully. The paper is based onthe study of the new Criminal Code, emphasizing the most important differences between the actualregulation and the new Criminal Code, and the few texts elaborated in this area. The approach of the subjectis a more practical one, because few texts were written about the new Criminal Code, at the moment of itsentrance into force, the doctrinaires will need to know the differences and the innovations brought by it. Theresult is meant to increase the understanding of the new text and to enrich the analysis and synthesis of thenew Criminal Code.

  3. Outage Analysis and Optimization of SWIPT in Network-Coded Two-Way Relay Networks

    Directory of Open Access Journals (Sweden)

    Ruihong Jiang

    2017-01-01

    Full Text Available This paper investigates the outage performance of simultaneous wireless information and power transfer (SWIPT in network-coded two-way relay systems, where a relay first harvests energy from the signals transmitted by two sources and then uses the harvested energy to forward the received information to the two sources. We consider two transmission protocols, power splitting two-way relay (PS-TWR and time switching two-way relay (TS-TWR protocols. We present two explicit expressions for the system outage probability of the two protocols and further derive approximate expressions for them in high and low SNR cases. To explore the system performance limits, two optimization problems are formulated to minimize the system outage probability. Since the problems are nonconvex and have no known solution methods, a genetic algorithm- (GA- based algorithm is designed. Numerical and simulation results validate our theoretical analysis. It is shown that, by jointly optimizing the time assignment and SWIPT receiver parameters, a great performance gain can be achieved for both PS-TWR and TS-TWR. Moreover, the optimized PS-TWR always outperforms the optimized TS-TWR in terms of outage performance. Additionally, the effects of parameters including relay location and transmit powers are also discussed, which provide some insights for the SWIPT-enabled two-way relay networks.

  4. Network-Coded Macrocell Offloading in Femtocaching-Assisted Cellular Networks

    KAUST Repository

    Shnaiwer, Yousef; Sorour, Sameh; Sadeghi, Parastoo; Aboutorab, Neda; Al-Naffouri, Tareq Y.

    2017-01-01

    Opportunistic network coding (ONC) has shown high potential in enhancing the quality-of-experience (QoE) for the clients of cellular networks using their previously downloaded files. In this paper, we study the problem of offloading clients from the macrocell base station (MBS) with the help of femtocaches (FCs) and ONC. We formulate this MBS offloading problem as an optimization problem over an ONC graph, and prove that it is non-deterministic polynomial-time (NP)-hard. Thus, we propose an ONC-broadcast offloading scheme, which utilizes separate ONC graphs at the MBS and FCs in addition to uncoded broadcasting, to offload the clients from the MBS. We analyze the performance of the ONC-broadcast offloading scheme and show that it is asymptotically optimal using random graph theory. Since even this ONC-broadcast offloading scheme is still NP-hard to implement, we devise an efficient heuristic to simplify the implementation. We show that the proposed heuristic reduces the worst-case complexity of implementing the ONC-broadcast offloading scheme from an exponential to a quadratic function of the total number of vertices in the FC ONC graph. Simulation results show that, despite its low complexity, the proposed heuristic achieves similar MBS offloading performance to the ONC-broadcast offloading scheme.

  5. Network-Coded Macrocell Offloading in Femtocaching-Assisted Cellular Networks

    KAUST Repository

    Shnaiwer, Yousef

    2017-11-08

    Opportunistic network coding (ONC) has shown high potential in enhancing the quality-of-experience (QoE) for the clients of cellular networks using their previously downloaded files. In this paper, we study the problem of offloading clients from the macrocell base station (MBS) with the help of femtocaches (FCs) and ONC. We formulate this MBS offloading problem as an optimization problem over an ONC graph, and prove that it is non-deterministic polynomial-time (NP)-hard. Thus, we propose an ONC-broadcast offloading scheme, which utilizes separate ONC graphs at the MBS and FCs in addition to uncoded broadcasting, to offload the clients from the MBS. We analyze the performance of the ONC-broadcast offloading scheme and show that it is asymptotically optimal using random graph theory. Since even this ONC-broadcast offloading scheme is still NP-hard to implement, we devise an efficient heuristic to simplify the implementation. We show that the proposed heuristic reduces the worst-case complexity of implementing the ONC-broadcast offloading scheme from an exponential to a quadratic function of the total number of vertices in the FC ONC graph. Simulation results show that, despite its low complexity, the proposed heuristic achieves similar MBS offloading performance to the ONC-broadcast offloading scheme.

  6. A Multicast Sparse-Grooming Algorithm Based on Network Coding in WDM Networks

    Science.gov (United States)

    Zhang, Shengfeng; Peng, Han; Sui, Meng; Liu, Huanlin

    2015-03-01

    To improve the limited number of wavelength utilization and decrease the traffic blocking probability in sparse-grooming wavelength-division multiplexing (WDM) networks, a multicast sparse-grooming algorithm based on network coding (MCSA-NC) is put forward to solve the routing problem for dynamic multicast requests in this paper. In the proposed algorithm, a traffic partition strategy, that the coarse-granularity multicast request with grooming capability on the source node is split into several fine-granularity multicast requests, is designed so as to increase the probability for traffic grooming successfully in MCSA-NC. Besides considering that multiple destinations should receive the data from source of the multicast request at the same time, the traditional transmission mechanism is improved by constructing edge-disjoint paths for each split multicast request. Moreover, in order to reduce the number of wavelengths required and further decrease the traffic blocking probability, a light-tree reconfiguration mechanism is presented in the MCSA-NC, which can select a minimal cost light tree from the established edge-disjoint paths for a new multicast request.

  7. Coded-subcarrier-aided chromatic dispersion monitoring scheme for flexible optical OFDM networks.

    Science.gov (United States)

    Tse, Kam-Hon; Chan, Chun-Kit

    2014-08-11

    A simple coded-subcarrier aided scheme is proposed to perform chromatic dispersion monitoring in flexible optical OFDM networks. A pair of coded label subcarriers is added to both edges of the optical OFDM signal spectrum at the edge transmitter node. Upon reception at any intermediate or the receiver node, chromatic dispersion estimation is performed, via simple direct detection, followed by electronic correlation procedures with the designated code sequences. The feasibility and the performance of the proposed scheme have been experimentally characterized. It provides a cost-effective monitoring solution for the optical OFDM signals across intermediate nodes in flexible OFDM networks.

  8. Cooperative MIMO Communication at Wireless Sensor Network: An Error Correcting Code Approach

    Science.gov (United States)

    Islam, Mohammad Rakibul; Han, Young Shin

    2011-01-01

    Cooperative communication in wireless sensor network (WSN) explores the energy efficient wireless communication schemes between multiple sensors and data gathering node (DGN) by exploiting multiple input multiple output (MIMO) and multiple input single output (MISO) configurations. In this paper, an energy efficient cooperative MIMO (C-MIMO) technique is proposed where low density parity check (LDPC) code is used as an error correcting code. The rate of LDPC code is varied by varying the length of message and parity bits. Simulation results show that the cooperative communication scheme outperforms SISO scheme in the presence of LDPC code. LDPC codes with different code rates are compared using bit error rate (BER) analysis. BER is also analyzed under different Nakagami fading scenario. Energy efficiencies are compared for different targeted probability of bit error pb. It is observed that C-MIMO performs more efficiently when the targeted pb is smaller. Also the lower encoding rate for LDPC code offers better error characteristics. PMID:22163732

  9. Relay-assisted Network Coding Multicast in the Presence of Neighbours

    DEFF Research Database (Denmark)

    Khamfroush, Hana; Roetter, Daniel Enrique Lucani; Pahlevani, Peyman

    2015-01-01

    We study the problem of minimizing the cost of packet transmission from a source to two receivers with the help of a relay and using network coding in wireless mesh networks consisting of many active neighbours sharing the same channel. The cost minimization problem is modeled as a Markov Decisio...

  10. Unsupervised clustering with spiking neurons by sparse temporal coding and multi-layer RBF networks

    NARCIS (Netherlands)

    S.M. Bohte (Sander); J.A. La Poutré (Han); J.N. Kok (Joost)

    2000-01-01

    textabstractWe demonstrate that spiking neural networks encoding information in spike times are capable of computing and learning clusters from realistic data. We show how a spiking neural network based on spike-time coding and Hebbian learning can successfully perform unsupervised clustering on

  11. Security Management Strategies for Protecting Your Library's Network.

    Science.gov (United States)

    Ives, David J.

    1996-01-01

    Presents security procedures for protecting a library's computer system from potential threats by patrons or personnel, and describes how security can be breached. A sidebar identifies four areas of concern in security management: the hardware, the operating system, the network, and the user interface. A selected bibliography of sources on…

  12. To overhear or not to overhear: a dilemma between network coding gain and energy consumption in multi-hop wireless networks

    OpenAIRE

    Javan, Nastooh Taheri; Sabaei, Masoud; Dehghan, Mehdi

    2018-01-01

    Any properly designed network coding technique can result in increased throughput and reliability of multi-hop wireless networks by taking advantage of the broadcast nature of wireless medium. In many inter-flow network coding schemes nodes are encouraged to overhear neighbours traffic in order to improve coding opportunities at the transmitter nodes. A study of these schemes reveal that some of the overheard packets are not useful for coding operation and thus this forced overhearing increas...

  13. Cooperative Coding and Caching for Streaming Data in Multihop Wireless Networks

    Directory of Open Access Journals (Sweden)

    Dan Wang

    2010-01-01

    Full Text Available This paper studies the distributed caching managements for the current flourish of the streaming applications in multihop wireless networks. Many caching managements to date use randomized network coding approach, which provides an elegant solution for ubiquitous data accesses in such systems. However, the encoding, essentially a combination operation, makes the coded data difficult to be changed. In particular, to accommodate new data, the system may have to first decode all the combined data segments, remove some unimportant ones, and then reencode the data segments again. This procedure is clearly expensive for continuously evolving data storage. As such, we introduce a novel Cooperative Coding and Caching (C3 scheme, which allows decoding-free data removal through a triangle-like codeword organization. Its decoding performance is very close to the conventional network coding with only a sublinear overhead. Our scheme offers a promising solution to the caching management for streaming data.

  14. Cooperative Coding and Caching for Streaming Data in Multihop Wireless Networks

    Directory of Open Access Journals (Sweden)

    Liu Jiangchuan

    2010-01-01

    Full Text Available This paper studies the distributed caching managements for the current flourish of the streaming applications in multihop wireless networks. Many caching managements to date use randomized network coding approach, which provides an elegant solution for ubiquitous data accesses in such systems. However, the encoding, essentially a combination operation, makes the coded data difficult to be changed. In particular, to accommodate new data, the system may have to first decode all the combined data segments, remove some unimportant ones, and then reencode the data segments again. This procedure is clearly expensive for continuously evolving data storage. As such, we introduce a novel Cooperative Coding and Caching ( scheme, which allows decoding-free data removal through a triangle-like codeword organization. Its decoding performance is very close to the conventional network coding with only a sublinear overhead. Our scheme offers a promising solution to the caching management for streaming data.

  15. Secure-Network-Coding-Based File Sharing via Device-to-Device Communication

    OpenAIRE

    Wang, Lei; Wang, Qing

    2017-01-01

    In order to increase the efficiency and security of file sharing in the next-generation networks, this paper proposes a large scale file sharing scheme based on secure network coding via device-to-device (D2D) communication. In our scheme, when a user needs to share data with others in the same area, the source node and all the intermediate nodes need to perform secure network coding operation before forwarding the received data. This process continues until all the mobile devices in the netw...

  16. Distributed Remote Vector Gaussian Source Coding for Wireless Acoustic Sensor Networks

    DEFF Research Database (Denmark)

    Zahedi, Adel; Østergaard, Jan; Jensen, Søren Holdt

    2014-01-01

    In this paper, we consider the problem of remote vector Gaussian source coding for a wireless acoustic sensor network. Each node receives messages from multiple nodes in the network and decodes these messages using its own measurement of the sound field as side information. The node’s measurement...... and the estimates of the source resulting from decoding the received messages are then jointly encoded and transmitted to a neighboring node in the network. We show that for this distributed source coding scenario, one can encode a so-called conditional sufficient statistic of the sources instead of jointly...

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

    KAUST Repository

    Douik, Ahmed S.

    2015-05-01

    From its introduction to its quindecennial, network coding have built a strong reputation in enhancing packet recovery process and achieving maximum information flow in both wires 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 at 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 this 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.

  18. Reliable Wireless Broadcast with Linear Network Coding for Multipoint-to-Multipoint Real-Time Communications

    Science.gov (United States)

    Kondo, Yoshihisa; Yomo, Hiroyuki; Yamaguchi, Shinji; Davis, Peter; Miura, Ryu; Obana, Sadao; Sampei, Seiichi

    This paper proposes multipoint-to-multipoint (MPtoMP) real-time broadcast transmission using network coding for ad-hoc networks like video game networks. We aim to achieve highly reliable MPtoMP broadcasting using IEEE 802.11 media access control (MAC) that does not include a retransmission mechanism. When each node detects packets from the other nodes in a sequence, the correctly detected packets are network-encoded, and the encoded packet is broadcasted in the next sequence as a piggy-back for its native packet. To prevent increase of overhead in each packet due to piggy-back packet transmission, network coding vector for each node is exchanged between all nodes in the negotiation phase. Each user keeps using the same coding vector generated in the negotiation phase, and only coding information that represents which user signal is included in the network coding process is transmitted along with the piggy-back packet. Our simulation results show that the proposed method can provide higher reliability than other schemes using multi point relay (MPR) or redundant transmissions such as forward error correction (FEC). We also implement the proposed method in a wireless testbed, and show that the proposed method achieves high reliability in a real-world environment with a practical degree of complexity when installed on current wireless devices.

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

    KAUST Repository

    Douik, Ahmed S.

    2015-01-01

    From its introduction to its quindecennial, network coding have built a strong reputation in enhancing packet recovery process and achieving maximum information flow in both wires 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 at 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 this 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.

  20. Analysis and Construction of Full-Diversity Joint Network-LDPC Codes for Cooperative Communications

    Directory of Open Access Journals (Sweden)

    Capirone Daniele

    2010-01-01

    Full Text Available Transmit diversity is necessary in harsh environments to reduce the required transmit power for achieving a given error performance at a certain transmission rate. In networks, cooperative communication is a well-known technique to yield transmit diversity and network coding can increase the spectral efficiency. These two techniques can be combined to achieve a double diversity order for a maximum coding rate on the Multiple-Access Relay Channel (MARC, where two sources share a common relay in their transmission to the destination. However, codes have to be carefully designed to obtain the intrinsic diversity offered by the MARC. This paper presents the principles to design a family of full-diversity LDPC codes with maximum rate. Simulation of the word error rate performance of the new proposed family of LDPC codes for the MARC confirms the full diversity.

  1. Throughput, Energy and Overhead of Multicast Device-to-Device Communications with Network Coded Cooperation

    DEFF Research Database (Denmark)

    Hernandez, Nestor; Heide, Janus; Roetter, Daniel Enrique Lucani

    2017-01-01

    , this assumes that the throughput gains and energy savings in multicasting are much larger between devices than the base station to the receivers. However, current mobile networks suffer from many different issues varying the performance in data rates, which calls into question these assumptions. Therefore......, a first objective of this work is to assess the operating regions where employing cooperation results in higher throughput and/or energy savings. We consider multicast scenarios with network coded mechanisms employing Random Linear Network Coding (RLNC). However, although RLNC is good for low amount...... of transmissions in multicast, it has an inherent overhead from extreme high or low field related caveats. Thus, as a second objective, we review and propose the application of new network codes that posses low overhead for multicasting, by having a short representation and low dependence probability. We provide...

  2. Lightning protection design of nuclear power plants. KTA safety code, version 6/99

    International Nuclear Information System (INIS)

    1999-06-01

    This KTA safety code does not cover calculation methods for determination of lightning-induced voltage inputs to control room systems within the reactor building, as the literature presents a variety of applicable methods, which however cannot be directly applied to any power plant, due to the great diversity of geometries of the electrical systems and control room systems in nuclear power plants. Compliance with the design requirements of this safety code for shielding of buildings, and installation and shielding of cables, can be considered to offer the appropriate protection. (orig./CB) [de

  3. On the Throughput and Energy Benefits of Network Coded Cooperation

    OpenAIRE

    Hernandez, Nestor; Heide, Janus; Roetter, Daniel Enrique Lucani; Fitzek, Frank

    2014-01-01

    Cooperative techniques in wireless mobile networks typically leverage short-range communication technologies, e.g., WiFi, to allow data exchange between devices forming a mobile cloud. These mobile clouds have been considered as a key to reduce the cost of multicast services for the network operators as well as a means to deliver a better quality to the users. In fact, LTE-A includes Device-to-Device communication capabilities to enable such a direct communication between devices. The underly...

  4. PRELIMINARY STUDY ON APPLICATION OF MAX PLUS ALGEBRA IN DISTRIBUTED STORAGE SYSTEM THROUGH NETWORK CODING

    Directory of Open Access Journals (Sweden)

    Agus Maman Abadi

    2016-04-01

    Full Text Available The increasing need in techniques of storing big data presents a new challenge. One way to address this challenge is the use of distributed storage systems. One strategy that implemented in distributed data storage systems is the use of Erasure Code which applied to network coding. The code used in this technique is based on the algebraic structure which is called as vector space. Some studies have also been carried out to create code that is based on other algebraic structures such as module.  In this study, we are going to try to set up a code based on the algebraic structure which is a generalization of the module that is semimodule by utilizing the max operations and sum operations at max plus algebra. The results of this study indicate that the max operation and the addition operation on max plus algebra cannot be used to establish a semimodule code, but by modifying the operation "+" as "min", we get a code based on semimodule. Keywords:   code, distributed storage systems, network coding, semimodule, max plus algebra

  5. Multiple Description Coding with Feedback Based Network Compression

    DEFF Research Database (Denmark)

    Sørensen, Jesper Hemming; Østergaard, Jan; Popovski, Petar

    2010-01-01

    and an intermediate node, respectively. A trade-off exists between reducing the delay of the feedback by adapting in the vicinity of the receiver and increasing the gain from compression by adapting close to the source. The analysis shows that adaptation in the network provides a better trade-off than adaptation...

  6. Peer-Assisted Content Distribution with Random Linear Network Coding

    DEFF Research Database (Denmark)

    Hundebøll, Martin; Ledet-Pedersen, Jeppe; Sluyterman, Georg

    2014-01-01

    Peer-to-peer networks constitute a widely used, cost-effective and scalable technology to distribute bandwidth-intensive content. The technology forms a great platform to build distributed cloud storage without the need of a central provider. However, the majority of todays peer-to-peer systems...

  7. Neural Network Approach to Locating Cryptography in Object Code

    Energy Technology Data Exchange (ETDEWEB)

    Jason L. Wright; Milos Manic

    2009-09-01

    Finding and identifying cryptography is a growing concern in the malware analysis community. In this paper, artificial neural networks are used to classify functional blocks from a disassembled program as being either cryptography related or not. The resulting system, referred to as NNLC (Neural Net for Locating Cryptography) is presented and results of applying this system to various libraries are described.

  8. Novel Concepts for Device to Device Communication using Network Coding

    DEFF Research Database (Denmark)

    Pahlevani, Peyman; Hundebøll, Martin; Pedersen, Morten Videbæk

    2014-01-01

    Device-to-device communication is currently a hot research topic within 3GPP. Even though D2D communication has been part of previous ad hoc, meshed and sensor networks proposals, the main contribution by 3GPP is that the direct communication among two devices is carried out over a dynamically as...

  9. Hardware Abstraction and Protocol Optimization for Coded Sensor Networks

    DEFF Research Database (Denmark)

    Nistor, Maricica; Roetter, Daniel Enrique Lucani; Barros, João

    2015-01-01

    The design of the communication protocols in wireless sensor networks (WSNs) often neglects several key characteristics of the sensor's hardware, while assuming that the number of transmitted bits is the dominating factor behind the system's energy consumption. A closer look at the hardware speci...

  10. Gain control network conditions in early sensory coding.

    Directory of Open Access Journals (Sweden)

    Eduardo Serrano

    Full Text Available Gain control is essential for the proper function of any sensory system. However, the precise mechanisms for achieving effective gain control in the brain are unknown. Based on our understanding of the existence and strength of connections in the insect olfactory system, we analyze the conditions that lead to controlled gain in a randomly connected network of excitatory and inhibitory neurons. We consider two scenarios for the variation of input into the system. In the first case, the intensity of the sensory input controls the input currents to a fixed proportion of neurons of the excitatory and inhibitory populations. In the second case, increasing intensity of the sensory stimulus will both, recruit an increasing number of neurons that receive input and change the input current that they receive. Using a mean field approximation for the network activity we derive relationships between the parameters of the network that ensure that the overall level of activity of the excitatory population remains unchanged for increasing intensity of the external stimulation. We find that, first, the main parameters that regulate network gain are the probabilities of connections from the inhibitory population to the excitatory population and of the connections within the inhibitory population. Second, we show that strict gain control is not achievable in a random network in the second case, when the input recruits an increasing number of neurons. Finally, we confirm that the gain control conditions derived from the mean field approximation are valid in simulations of firing rate models and Hodgkin-Huxley conductance based models.

  11. Code of practice and design principles for portable and transportable radiological protection systems

    International Nuclear Information System (INIS)

    Wells, F.H.; Powell, R.G.

    1980-10-01

    The Code of Practice and design principles for portable and transportable radiological protection systems are presented in three parts. Part 1 specifies the requirement for Radiological Protection Instrumentation (RPI) including operational characteristics and the effects of both a radiation and non-radiation environment. Part 2 satisfies the requirement for RPI equipment as regards the overall design, the availability, the reliability, the information display, the human factors, the power supplies, the manufacture and quality assurance, the testing and the cost. Part 3 deals with the supply, location and operation of the RPI equipment. (U.K.)

  12. Experiments for the validation of computer codes uses to assess the protection factors afforded by dwellings

    International Nuclear Information System (INIS)

    Le Grand, J.; Roux, Y.; Kerlau, G.

    1988-09-01

    Two experimental campaigns were carried out to verify: 1) the method of assessing the mean kerma in a household used in the computer code BILL calculating the protection factor afforded by dwellings; 2) in what conditions the kerma calculated in cubic meshes of a given size (code PIECE) agreed with TLD measurements. To that purpose, a house was built near the caesium 137 source of the Ecosystem irradiator located at the Cadarache Nuclear Research Center. During the first campaign, four experiments with different house characteristics were conducted. Some 50 TLSs locations describing the inhabitable volume were defined in order to obtain the mean kerma. 16 locations were considered outside the house. During the second campaign a cobalt 60 source was installed on the side. Only five measurement locations were defined, each with 6 TLDs. The results of dosimetric measurements are presented and compared with the calculations of the two computer codes. The effects of wall heterogeneity were also studied [fr

  13. Perfect quantum multiple-unicast network coding protocol

    Science.gov (United States)

    Li, Dan-Dan; Gao, Fei; Qin, Su-Juan; Wen, Qiao-Yan

    2018-01-01

    In order to realize long-distance and large-scale quantum communication, it is natural to utilize quantum repeater. For a general quantum multiple-unicast network, it is still puzzling how to complete communication tasks perfectly with less resources such as registers. In this paper, we solve this problem. By applying quantum repeaters to multiple-unicast communication problem, we give encoding-decoding schemes for source nodes, internal ones and target ones, respectively. Source-target nodes share EPR pairs by using our encoding-decoding schemes over quantum multiple-unicast network. Furthermore, quantum communication can be accomplished perfectly via teleportation. Compared with existed schemes, our schemes can reduce resource consumption and realize long-distance transmission of quantum information.

  14. Protecting posted genes: social networking and the limits of GINA.

    Science.gov (United States)

    Soo-Jin Lee, Sandra; Borgelt, Emily

    2014-01-01

    The combination of decreased genotyping costs and prolific social media use is fueling a personal genetic testing industry in which consumers purchase and interact with genetic risk information online. Consumers and their genetic risk profiles are protected in some respects by the 2008 federal Genetic Information Nondiscrimination Act (GINA), which forbids the discriminatory use of genetic information by employers and health insurers; however, practical and technical limitations undermine its enforceability, given the everyday practices of online social networking and its impact on the workplace. In the Web 2.0 era, employers in most states can legally search about job candidates and employees online, probing social networking sites for personal information that might bear on hiring and employment decisions. We examine GINA's protections for online sharing of genetic information as well as its limitations, and propose policy recommendations to address current gaps that leave employees' genetic information vulnerable in a Web-based world.

  15. Joint Network Coding and Opportunistic Scheduling for the Bidirectional Relay Channel

    KAUST Repository

    Shaqfeh, Mohammad

    2013-05-27

    In this paper, we consider a two-way communication system in which two users communicate with each other through an intermediate relay over block-fading channels. We investigate the optimal opportunistic scheduling scheme in order to maximize the long-term average transmission rate in the system assuming symmetric information flow between the two users. Based on the channel state information, the scheduler decides that either one of the users transmits to the relay, or the relay transmits to a single user or broadcasts to both users a combined version of the two users’ transmitted information by using linear network coding. We obtain the optimal scheduling scheme by using the Lagrangian dual problem. Furthermore, in order to characterize the gains of network coding and opportunistic scheduling, we compare the achievable rate of the system versus suboptimal schemes in which the gains of network coding and opportunistic scheduling are partially exploited.

  16. Joint Network Coding and Opportunistic Scheduling for the Bidirectional Relay Channel

    KAUST Repository

    Shaqfeh, Mohammad; Alnuweiri, Hussein; Alouini, Mohamed-Slim; Zafar, Ammar

    2013-01-01

    In this paper, we consider a two-way communication system in which two users communicate with each other through an intermediate relay over block-fading channels. We investigate the optimal opportunistic scheduling scheme in order to maximize the long-term average transmission rate in the system assuming symmetric information flow between the two users. Based on the channel state information, the scheduler decides that either one of the users transmits to the relay, or the relay transmits to a single user or broadcasts to both users a combined version of the two users’ transmitted information by using linear network coding. We obtain the optimal scheduling scheme by using the Lagrangian dual problem. Furthermore, in order to characterize the gains of network coding and opportunistic scheduling, we compare the achievable rate of the system versus suboptimal schemes in which the gains of network coding and opportunistic scheduling are partially exploited.

  17. Development of Integrated Code for Risk Assessment (INCORIA) for Physical Protection System

    International Nuclear Information System (INIS)

    Jang, Sung Soon; Seo, Hyung Min; Yoo, Ho Sik

    2010-01-01

    A physical protection system (PPS) integrates people, procedures and equipment for the protection of assets or facilities against theft, sabotage or other malevolent human attacks. Among critical facilities, nuclear facilities and nuclear weapon sites require the highest level of PPS. After the September 11, 2001 terrorist attacks, international communities, including the IAEA, have made substantial efforts to protect nuclear material and nuclear facilities. The international flow on nuclear security is using the concept or risk assessment. The concept of risk assessment is firstly devised by nuclear safety people. They considered nuclear safety including its possible risk, which is the frequency of failure and possible consequence. Nuclear security people also considers security risk, which is the frequency of threat action, vulnerability, and consequences. The concept means that we should protect more when the credible threat exists and the possible radiological consequence is high. Even if there are several risk assessment methods of nuclear security, the application needs the help of tools because of a lot of calculation. It's also hard to find tools for whole phase of risk assessment. Several codes exist for the part of risk assessment. SAVI are used for vulnerability of PPS. Vital area identification code is used for consequence analysis. We are developing Integrated Code for Risk Assessment (INCORIA) to apply risk assessment methods for nuclear facilities. INCORIA evaluates PP-KINAC measures and generation tools for threat scenario. PP-KINAC is risk assessment measures for physical protection system developed by Hosik Yoo and is easy to apply. A threat scenario tool is used to generate threat scenario, which is used as one of input value to PP-KINAC measures

  18. Comparison of Analytical and Measured Performance Results on Network Coding in IEEE 802.11 Ad-Hoc Networks

    DEFF Research Database (Denmark)

    Zhao, Fang; Médard, Muriel; Hundebøll, Martin

    2012-01-01

    CATWOMAN that can run on standard WiFi hardware. We present an analytical model to evaluate the performance of COPE in simple networks, and our results show the excellent predictive quality of this model. By closely examining the performance in two simple topologies, we observe that the coding gain results...

  19. Fast rerouting schemes for protected mobile IP over MPLS networks

    Science.gov (United States)

    Wen, Chih-Chao; Chang, Sheng-Yi; Chen, Huan; Chen, Kim-Joan

    2005-10-01

    Fast rerouting is a critical traffic engineering operation in the MPLS networks. To implement the Mobile IP service over the MPLS network, one can collaborate with the fast rerouting operation to enhance the availability and survivability. MPLS can protect critical LSP tunnel between Home Agent (HA) and Foreign Agent (FA) using the fast rerouting scheme. In this paper, we propose a simple but efficient algorithm to address the triangle routing problem for the Mobile IP over the MPLS networks. We consider this routing issue as a link weighting and capacity assignment (LW-CA) problem. The derived solution is used to plan the fast restoration mechanism to protect the link or node failure. In this paper, we first model the LW-CA problem as a mixed integer optimization problem. Our goal is to minimize the call blocking probability on the most congested working truck for the mobile IP connections. Many existing network topologies are used to evaluate the performance of our scheme. Results show that our proposed scheme can obtain the best performance in terms of the smallest blocking probability compared to other schemes.

  20. Error Concealment using Neural Networks for Block-Based Image Coding

    Directory of Open Access Journals (Sweden)

    M. Mokos

    2006-06-01

    Full Text Available In this paper, a novel adaptive error concealment (EC algorithm, which lowers the requirements for channel coding, is proposed. It conceals errors in block-based image coding systems by using neural network. In this proposed algorithm, only the intra-frame information is used for reconstruction of the image with separated damaged blocks. The information of pixels surrounding a damaged block is used to recover the errors using the neural network models. Computer simulation results show that the visual quality and the MSE evaluation of a reconstructed image are significantly improved using the proposed EC algorithm. We propose also a simple non-neural approach for comparison.

  1. Source Authentication for Code Dissemination Supporting Dynamic Packet Size in Wireless Sensor Networks.

    Science.gov (United States)

    Kim, Daehee; Kim, Dongwan; An, Sunshin

    2016-07-09

    Code dissemination in wireless sensor networks (WSNs) is a procedure for distributing a new code image over the air in order to update programs. Due to the fact that WSNs are mostly deployed in unattended and hostile environments, secure code dissemination ensuring authenticity and integrity is essential. Recent works on dynamic packet size control in WSNs allow enhancing the energy efficiency of code dissemination by dynamically changing the packet size on the basis of link quality. However, the authentication tokens attached by the base station become useless in the next hop where the packet size can vary according to the link quality of the next hop. In this paper, we propose three source authentication schemes for code dissemination supporting dynamic packet size. Compared to traditional source authentication schemes such as μTESLA and digital signatures, our schemes provide secure source authentication under the environment, where the packet size changes in each hop, with smaller energy consumption.

  2. Source Authentication for Code Dissemination Supporting Dynamic Packet Size in Wireless Sensor Networks

    Science.gov (United States)

    Kim, Daehee; Kim, Dongwan; An, Sunshin

    2016-01-01

    Code dissemination in wireless sensor networks (WSNs) is a procedure for distributing a new code image over the air in order to update programs. Due to the fact that WSNs are mostly deployed in unattended and hostile environments, secure code dissemination ensuring authenticity and integrity is essential. Recent works on dynamic packet size control in WSNs allow enhancing the energy efficiency of code dissemination by dynamically changing the packet size on the basis of link quality. However, the authentication tokens attached by the base station become useless in the next hop where the packet size can vary according to the link quality of the next hop. In this paper, we propose three source authentication schemes for code dissemination supporting dynamic packet size. Compared to traditional source authentication schemes such as μTESLA and digital signatures, our schemes provide secure source authentication under the environment, where the packet size changes in each hop, with smaller energy consumption. PMID:27409616

  3. Verification of the network flow and transport/distributed velocity (NWFT/DVM) computer code

    International Nuclear Information System (INIS)

    Duda, L.E.

    1984-05-01

    The Network Flow and Transport/Distributed Velocity Method (NWFT/DVM) computer code was developed primarily to fulfill a need for a computationally efficient ground-water flow and contaminant transport capability for use in risk analyses where, quite frequently, large numbers of calculations are required. It is a semi-analytic, quasi-two-dimensional network code that simulates ground-water flow and the transport of dissolved species (radionuclides) in a saturated porous medium. The development of this code was carried out under a program funded by the US Nuclear Regulatory Commission (NRC) to develop a methodology for assessing the risk from disposal of radioactive wastes in deep geologic formations (FIN: A-1192 and A-1266). In support to the methodology development program, the NRC has funded a separate Maintenance of Computer Programs Project (FIN: A-1166) to ensure that the codes developed under A-1192 or A-1266 remain consistent with current operating systems, are as error-free as possible, and have up-to-date documentations for reference by the NRC staff. Part of this effort would include verification and validation tests to assure that a code correctly performs the operations specified and/or is representing the processes or system for which it is intended. This document contains four verification problems for the NWFT/DVM computer code. Two of these problems are analytical verifications of NWFT/DVM where results are compared to analytical solutions. The other two are code-to-code verifications where results from NWFT/DVM are compared to those of another computer code. In all cases NWFT/DVM showed good agreement with both the analytical solutions and the results from the other code

  4. The Energy Coding of a Structural Neural Network Based on the Hodgkin-Huxley Model.

    Science.gov (United States)

    Zhu, Zhenyu; Wang, Rubin; Zhu, Fengyun

    2018-01-01

    Based on the Hodgkin-Huxley model, the present study established a fully connected structural neural network to simulate the neural activity and energy consumption of the network by neural energy coding theory. The numerical simulation result showed that the periodicity of the network energy distribution was positively correlated to the number of neurons and coupling strength, but negatively correlated to signal transmitting delay. Moreover, a relationship was established between the energy distribution feature and the synchronous oscillation of the neural network, which showed that when the proportion of negative energy in power consumption curve was high, the synchronous oscillation of the neural network was apparent. In addition, comparison with the simulation result of structural neural network based on the Wang-Zhang biophysical model of neurons showed that both models were essentially consistent.

  5. Designing an efficient LT-code with unequal error protection for image transmission

    Science.gov (United States)

    S. Marques, F.; Schwartz, C.; Pinho, M. S.; Finamore, W. A.

    2015-10-01

    The use of images from earth observation satellites is spread over different applications, such as a car navigation systems and a disaster monitoring. In general, those images are captured by on board imaging devices and must be transmitted to the Earth using a communication system. Even though a high resolution image can produce a better Quality of Service, it leads to transmitters with high bit rate which require a large bandwidth and expend a large amount of energy. Therefore, it is very important to design efficient communication systems. From communication theory, it is well known that a source encoder is crucial in an efficient system. In a remote sensing satellite image transmission, this efficiency is achieved by using an image compressor, to reduce the amount of data which must be transmitted. The Consultative Committee for Space Data Systems (CCSDS), a multinational forum for the development of communications and data system standards for space flight, establishes a recommended standard for a data compression algorithm for images from space systems. Unfortunately, in the satellite communication channel, the transmitted signal is corrupted by the presence of noise, interference signals, etc. Therefore, the receiver of a digital communication system may fail to recover the transmitted bit. Actually, a channel code can be used to reduce the effect of this failure. In 2002, the Luby Transform code (LT-code) was introduced and it was shown that it was very efficient when the binary erasure channel model was used. Since the effect of the bit recovery failure depends on the position of the bit in the compressed image stream, in the last decade many e orts have been made to develop LT-code with unequal error protection. In 2012, Arslan et al. showed improvements when LT-codes with unequal error protection were used in images compressed by SPIHT algorithm. The techniques presented by Arslan et al. can be adapted to work with the algorithm for image compression

  6. Sensitivity of marine protected area network connectivity to atmospheric variability.

    Science.gov (United States)

    Fox, Alan D; Henry, Lea-Anne; Corne, David W; Roberts, J Murray

    2016-11-01

    International efforts are underway to establish well-connected systems of marine protected areas (MPAs) covering at least 10% of the ocean by 2020. But the nature and dynamics of ocean ecosystem connectivity are poorly understood, with unresolved effects of climate variability. We used 40-year runs of a particle tracking model to examine the sensitivity of an MPA network for habitat-forming cold-water corals in the northeast Atlantic to changes in larval dispersal driven by atmospheric cycles and larval behaviour. Trajectories of Lophelia pertusa larvae were strongly correlated to the North Atlantic Oscillation (NAO), the dominant pattern of interannual atmospheric circulation variability over the northeast Atlantic. Variability in trajectories significantly altered network connectivity and source-sink dynamics, with positive phase NAO conditions producing a well-connected but asymmetrical network connected from west to east. Negative phase NAO produced reduced connectivity, but notably some larvae tracked westward-flowing currents towards coral populations on the mid-Atlantic ridge. Graph theoretical metrics demonstrate critical roles played by seamounts and offshore banks in larval supply and maintaining connectivity across the network. Larval longevity and behaviour mediated dispersal and connectivity, with shorter lived and passive larvae associated with reduced connectivity. We conclude that the existing MPA network is vulnerable to atmospheric-driven changes in ocean circulation.

  7. Development of a new version of the Vehicle Protection Factor Code (VPF3)

    Science.gov (United States)

    Jamieson, Terrance J.

    1990-10-01

    The Vehicle Protection Factor (VPF) Code is an engineering tool for estimating radiation protection afforded by armoured vehicles and other structures exposed to neutron and gamma ray radiation from fission, thermonuclear, and fusion sources. A number of suggestions for modifications have been offered by users of early versions of the code. These include: implementing some of the more advanced features of the air transport rating code, ATR5, used to perform the air over ground radiation transport analyses; allowing the ability to study specific vehicle orientations within the free field; implementing an adjoint transport scheme to reduce the number of transport runs required; investigating the possibility of accelerating the transport scheme; and upgrading the computer automated design (CAD) package used by VPF. The generation of radiation free field fluences for infinite air geometries as required for aircraft analysis can be accomplished by using ATR with the air over ground correction factors disabled. Analysis of the effects of fallout bearing debris clouds on aircraft will require additional modelling of VPF.

  8. Integrity protection for code-on-demand mobile agents in e-commerce

    OpenAIRE

    Wang, TH; Guan, SU; Chan, TK

    2002-01-01

    The mobile agent paradigm has been proposed as a promising solution to facilitate distributed computing over open and heterogeneous networks. Mobility, autonomy, and intelligence are identified as key features of mobile agent systems and enabling characteristics for the next-generation smart electronic commerce on the Internet. However, security-related issues, especially integrity protection in mobile agent technology, still hinder the widespread use of software agents: from the agent’s pers...

  9. Collection of regulatory texts relative to radiation protection. Part 2: orders and decisions taken in application of the Public Health Code and Labour Code concerning the protection of populations, patients and workers against the risks of ionizing radiations

    International Nuclear Information System (INIS)

    2007-05-01

    This collection of texts includes the general measures of population protection, exposure to natural radiations, general system of authorizations and statements, protection of persons exposed to ionizing radiations for medical purpose, situations of radiological emergency and long exposure to ionizing radiations, penal dispositions, application of the Public Health code and application of the Labour code. Chronological contents by date of publication is given. (N.C.)

  10. Computer code structure for evaluation of fire protection measures and fighting capability at nuclear plants

    International Nuclear Information System (INIS)

    Anton, V.

    1997-01-01

    In this work a computer code structure for Fire Protection Measures (FPM) and Fire Fighting Capability (FFC) at Nuclear Power Plants (NPP) is presented. It allows to evaluate the category (satisfactory (s), needs for further evaluation (n), unsatisfactory (u)) to which belongs the given NPP for a self-control in view of an IAEA inspection. This possibility of a self assessment resulted from IAEA documents. Our approach is based on international experience gained in this field and stated in IAEA recommendations. As an illustration we used the FORTRAN programming language statement to make clear the structure of the computer code for the problem taken into account. This computer programme can be conceived so that some literal message in English and Romanian languages be displayed beside the percentage assessments. (author)

  11. Radiation protection for human exploration of the moon and mars: Application of the mash code system

    International Nuclear Information System (INIS)

    Johnson, J.O.; Santoro, R.T.; Drischler, J.D.; Barnes, J.M.

    1992-01-01

    The Monte Carlo Adjoint Shielding code system -- MASH, developed for the Department of Defense for calculating radiation protection factors for armored vehicles against neutron and gamma radiation, has been used to assess the dose from reactor radiation to an occupant in a habitat on Mars. The capability of MASH to reproduce measured data is summarized to demonstrate the accuracy of the code. The estimation of the radiation environment in an idealized reactor-habitat model is reported to illustrate the merits of the adjoint Monte Carlo procedure for space related studies. The reactor radiation dose for different reactor-habitat surface configurations to a habitat occupant is compared with the natural radiation dose acquired during a 500-day Mars mission

  12. Rate Control for Network-Coded Multipath Relaying with Time-Varying Connectivity

    Science.gov (United States)

    2010-12-10

    Armen Babikyan, Nathaniel M. Jones, Thomas H. Shake, and Andrew P. Worthen MIT Lincoln Laboratory 244 Wood Street Lexington, MA 02420 DDRE, 1777...delay U U U U SAR 11 Zach Sweet 781-981-5997 1 Rate Control for Network-Coded Multipath Relaying with Time-Varying Connectivity Brooke Shrader, Armen

  13. Relay-aided multi-cell broadcasting with random network coding

    DEFF Research Database (Denmark)

    Lu, Lu; Sun, Fan; Xiao, Ming

    2010-01-01

    We investigate a relay-aided multi-cell broadcasting system using random network codes, where the focus is on devising efficient scheduling algorithms between relay and base stations. Two scheduling algorithms are proposed based on different feedback strategies; namely, a one-step scheduling...

  14. InP monolithically integrated label swapper device for spectral amplitude coded optical packet networks

    NARCIS (Netherlands)

    Muñoz, P.; García-Olcina, R.; Doménech, J.D.; Rius, M.; Sancho, J.C.; Capmany, J.; Chen, L.R.; Habib, C.; Leijtens, X.J.M.; Vries, de T.; Heck, M.J.R.; Augustin, L.M.; Nötzel, R.; Robbins, D.J.

    2010-01-01

    In this paper a label swapping device, for spectral amplitude coded optical packet networks, fully integrated using InP technology is presented. Compared to previous demonstrations using discrete component assembly, the device footprint is reduced by a factor of 105 and the operation speed is

  15. On the effectiveness of recoding-based repair in network coded distributed storage

    DEFF Research Database (Denmark)

    Sipos, Marton A.; Braun, Patrik J.; Roetter, Daniel Enrique Lucani

    2017-01-01

    High capacity storage systems distribute less across several storage devices (nodes) and apply an erasure code to meet availability and reliability requirements. Since devices can lose network connectivity or fail permanently, a dynamic repair mechanism must be put in place. In such cases a new r...

  16. Adaptive comanagement of a marine protected area network in Fiji.

    Science.gov (United States)

    Weeks, Rebecca; Jupiter, Stacy D

    2013-12-01

    Adaptive management of natural resources is an iterative process of decision making whereby management strategies are progressively changed or adjusted in response to new information. Despite an increasing focus on the need for adaptive conservation strategies, there remain few applied examples. We describe the 9-year process of adaptive comanagement of a marine protected area network in Kubulau District, Fiji. In 2011, a review of protected area boundaries and management rules was motivated by the need to enhance management effectiveness and the desire to improve resilience to climate change. Through a series of consultations, with the Wildlife Conservation Society providing scientific input to community decision making, the network of marine protected areas was reconfigured so as to maximize resilience and compliance. Factors identified as contributing to this outcome include well-defined resource-access rights; community respect for a flexible system of customary governance; long-term commitment and presence of comanagement partners; supportive policy environment for comanagement; synthesis of traditional management approaches with systematic monitoring; and district-wide coordination, which provided a broader spatial context for adaptive-management decision making. Co-Manejo Adaptativo de una Red de Áreas Marinas Protegidas en Fiyi. © 2013 The Authors. Conservation Biology published by Wiley Periodicals, Inc., on behalf of the Society for Conservation Biology.

  17. Architecture, design and protection of power distribution networks; Architecture, conception et protection des reseaux de distribution

    Energy Technology Data Exchange (ETDEWEB)

    Sorrel, J.P. [Schneider Electric SA, 92 - Boulogne-Billancourt (France)

    2000-10-01

    The design of all-electric ships calls for high power levels in the propulsion systems. Merchant ships and especially naval vessels demand rugged, reliable propulsion systems with high availability, low maintenance and ease of operation. These constraints imply the choice of an optimized single winding system. The design of the network topology and protection system, and the choice of operating voltage and HT neutral configuration are the main steps in the design. (author)

  18. A Reaction-Diffusion-Based Coding Rate Control Mechanism for Camera Sensor Networks

    Directory of Open Access Journals (Sweden)

    Naoki Wakamiya

    2010-08-01

    Full Text Available A wireless camera sensor network is useful for surveillance and monitoring for its visibility and easy deployment. However, it suffers from the limited capacity of wireless communication and a network is easily overflown with a considerable amount of video traffic. In this paper, we propose an autonomous video coding rate control mechanism where each camera sensor node can autonomously determine its coding rate in accordance with the location and velocity of target objects. For this purpose, we adopted a biological model, i.e., reaction-diffusion model, inspired by the similarity of biological spatial patterns and the spatial distribution of video coding rate. Through simulation and practical experiments, we verify the effectiveness of our proposal.

  19. A reaction-diffusion-based coding rate control mechanism for camera sensor networks.

    Science.gov (United States)

    Yamamoto, Hiroshi; Hyodo, Katsuya; Wakamiya, Naoki; Murata, Masayuki

    2010-01-01

    A wireless camera sensor network is useful for surveillance and monitoring for its visibility and easy deployment. However, it suffers from the limited capacity of wireless communication and a network is easily overflown with a considerable amount of video traffic. In this paper, we propose an autonomous video coding rate control mechanism where each camera sensor node can autonomously determine its coding rate in accordance with the location and velocity of target objects. For this purpose, we adopted a biological model, i.e., reaction-diffusion model, inspired by the similarity of biological spatial patterns and the spatial distribution of video coding rate. Through simulation and practical experiments, we verify the effectiveness of our proposal.

  20. Performance analysis of quantum access network using code division multiple access model

    International Nuclear Information System (INIS)

    Hu Linxi; Yang Can; He Guangqiang

    2017-01-01

    A quantum access network has been implemented by frequency division multiple access and time division multiple access, while code division multiple access is limited for its difficulty to realize the orthogonality of the code. Recently, the chaotic phase shifters were proposed to guarantee the orthogonality by different chaotic signals and spread the spectral content of the quantum states. In this letter, we propose to implement the code division multiple access quantum network by using chaotic phase shifters and synchronization. Due to the orthogonality of the different chaotic phase shifter, every pair of users can faithfully transmit quantum information through a common channel and have little crosstalk between different users. Meanwhile, the broadband spectra of chaotic signals efficiently help the quantum states to defend against channel loss and noise. (paper)

  1. Real-Coded Quantum-Inspired Genetic Algorithm-Based BP Neural Network Algorithm

    Directory of Open Access Journals (Sweden)

    Jianyong Liu

    2015-01-01

    Full Text Available The method that the real-coded quantum-inspired genetic algorithm (RQGA used to optimize the weights and threshold of BP neural network is proposed to overcome the defect that the gradient descent method makes the algorithm easily fall into local optimal value in the learning process. Quantum genetic algorithm (QGA is with good directional global optimization ability, but the conventional QGA is based on binary coding; the speed of calculation is reduced by the coding and decoding processes. So, RQGA is introduced to explore the search space, and the improved varied learning rate is adopted to train the BP neural network. Simulation test shows that the proposed algorithm is effective to rapidly converge to the solution conformed to constraint conditions.

  2. Authorship attribution of source code by using back propagation neural network based on particle swarm optimization.

    Science.gov (United States)

    Yang, Xinyu; Xu, Guoai; Li, Qi; Guo, Yanhui; Zhang, Miao

    2017-01-01

    Authorship attribution is to identify the most likely author of a given sample among a set of candidate known authors. It can be not only applied to discover the original author of plain text, such as novels, blogs, emails, posts etc., but also used to identify source code programmers. Authorship attribution of source code is required in diverse applications, ranging from malicious code tracking to solving authorship dispute or software plagiarism detection. This paper aims to propose a new method to identify the programmer of Java source code samples with a higher accuracy. To this end, it first introduces back propagation (BP) neural network based on particle swarm optimization (PSO) into authorship attribution of source code. It begins by computing a set of defined feature metrics, including lexical and layout metrics, structure and syntax metrics, totally 19 dimensions. Then these metrics are input to neural network for supervised learning, the weights of which are output by PSO and BP hybrid algorithm. The effectiveness of the proposed method is evaluated on a collected dataset with 3,022 Java files belong to 40 authors. Experiment results show that the proposed method achieves 91.060% accuracy. And a comparison with previous work on authorship attribution of source code for Java language illustrates that this proposed method outperforms others overall, also with an acceptable overhead.

  3. Radiation protection of workers in the mining and milling of radioactive ores. Code of practice and technical addendum. 1983 ed

    International Nuclear Information System (INIS)

    1983-01-01

    This Code of Practice sets forth the means of ensuring protection against ionizing radiation for workers engaged in mining and milling of radioactive ores: general provisions outlining the responsibilities of the employer and the worker, limits of radiation exposure, administrative organization of radiation protection, radiation surveillance, engineering and administrative protective measures and medical surveillance. It is designed to facilitate the preparation and adoption of national and local regulations and factory rules for radiation protection in mining and milling of radioactive ores.

  4. An Adaption Broadcast Radius-Based Code Dissemination Scheme for Low Energy Wireless Sensor Networks.

    Science.gov (United States)

    Yu, Shidi; Liu, Xiao; Liu, Anfeng; Xiong, Naixue; Cai, Zhiping; Wang, Tian

    2018-05-10

    Due to the Software Defined Network (SDN) technology, Wireless Sensor Networks (WSNs) are getting wider application prospects for sensor nodes that can get new functions after updating program codes. The issue of disseminating program codes to every node in the network with minimum delay and energy consumption have been formulated and investigated in the literature. The minimum-transmission broadcast (MTB) problem, which aims to reduce broadcast redundancy, has been well studied in WSNs where the broadcast radius is assumed to be fixed in the whole network. In this paper, an Adaption Broadcast Radius-based Code Dissemination (ABRCD) scheme is proposed to reduce delay and improve energy efficiency in duty cycle-based WSNs. In the ABCRD scheme, a larger broadcast radius is set in areas with more energy left, generating more optimized performance than previous schemes. Thus: (1) with a larger broadcast radius, program codes can reach the edge of network from the source in fewer hops, decreasing the number of broadcasts and at the same time, delay. (2) As the ABRCD scheme adopts a larger broadcast radius for some nodes, program codes can be transmitted to more nodes in one broadcast transmission, diminishing the number of broadcasts. (3) The larger radius in the ABRCD scheme causes more energy consumption of some transmitting nodes, but radius enlarging is only conducted in areas with an energy surplus, and energy consumption in the hot-spots can be reduced instead due to some nodes transmitting data directly to sink without forwarding by nodes in the original hot-spot, thus energy consumption can almost reach a balance and network lifetime can be prolonged. The proposed ABRCD scheme first assigns a broadcast radius, which doesn’t affect the network lifetime, to nodes having different distance to the code source, then provides an algorithm to construct a broadcast backbone. In the end, a comprehensive performance analysis and simulation result shows that the proposed

  5. An Adaption Broadcast Radius-Based Code Dissemination Scheme for Low Energy Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Shidi Yu

    2018-05-01

    Full Text Available Due to the Software Defined Network (SDN technology, Wireless Sensor Networks (WSNs are getting wider application prospects for sensor nodes that can get new functions after updating program codes. The issue of disseminating program codes to every node in the network with minimum delay and energy consumption have been formulated and investigated in the literature. The minimum-transmission broadcast (MTB problem, which aims to reduce broadcast redundancy, has been well studied in WSNs where the broadcast radius is assumed to be fixed in the whole network. In this paper, an Adaption Broadcast Radius-based Code Dissemination (ABRCD scheme is proposed to reduce delay and improve energy efficiency in duty cycle-based WSNs. In the ABCRD scheme, a larger broadcast radius is set in areas with more energy left, generating more optimized performance than previous schemes. Thus: (1 with a larger broadcast radius, program codes can reach the edge of network from the source in fewer hops, decreasing the number of broadcasts and at the same time, delay. (2 As the ABRCD scheme adopts a larger broadcast radius for some nodes, program codes can be transmitted to more nodes in one broadcast transmission, diminishing the number of broadcasts. (3 The larger radius in the ABRCD scheme causes more energy consumption of some transmitting nodes, but radius enlarging is only conducted in areas with an energy surplus, and energy consumption in the hot-spots can be reduced instead due to some nodes transmitting data directly to sink without forwarding by nodes in the original hot-spot, thus energy consumption can almost reach a balance and network lifetime can be prolonged. The proposed ABRCD scheme first assigns a broadcast radius, which doesn’t affect the network lifetime, to nodes having different distance to the code source, then provides an algorithm to construct a broadcast backbone. In the end, a comprehensive performance analysis and simulation result shows that

  6. Quantum secure direct communication network with superdense coding and decoy photons

    International Nuclear Information System (INIS)

    Deng Fuguo; Li Xihan; Li Chunyan; Zhou Ping; Zhou Hongyu

    2007-01-01

    A quantum secure direct communication network scheme is proposed with quantum superdense coding and decoy photons. The servers on a passive optical network prepare and measure the quantum signal, i.e. a sequence of the d-dimensional Bell states. After confirming the security of the photons received from the receiver, the sender codes his secret message on them directly. For preventing a dishonest server from eavesdropping, some decoy photons prepared by measuring one photon in the Bell states are used to replace some original photons. One of the users on the network can communicate to any other one. This scheme has the advantage of high capacity, and it is more convenient than others as only a sequence of photons is transmitted in quantum line

  7. Code of practice and design principles for installed radiological protection systems

    International Nuclear Information System (INIS)

    Powell, R.G.

    1979-03-01

    For some years there has been comprehensive guidance documentation for Nuclear Reactor Instrumentation, but apparently no corresponding guide for designers and installers of Radiological Protection Instrumentation. A small group of instrumentation engineers discussed this lack of a suitable guide, and they examined the main points on which it should be based. This document attempts to present a comprehensive and detailed review of these points. It is intended to give an overall coverage and serve as a reference document for specific points; it should also be of value to the newcomer to the Radiological Protection Instrumentation field. This Code of Practice represents a standard of good practice and takes the form of recommendations only. Each installation must be assessed individually, and agreement on its suitability must be reached locally by the designers and the officers responsible for safety and operation. (author)

  8. Collection of regulatory texts relative to radiation protection. Part 1: laws and decrees (Extracts of the Public Health Code and of the Labour Code dealing with the protection of population, patients and workers against the hazards of ionizing radiations

    International Nuclear Information System (INIS)

    Rivas, Robert; Feries, Jean; Marzorati, Frank; Chevalier, Celine; Lachaume, Jean-Luc

    2013-01-01

    This first part contains legal and regulatory texts extracted from the Public Health Code and related to health general protection and to health products (medical devices), from the Social Security Code, and from the Labour Code related to individual work relationships, to health and safety at work, to work places, to work equipment and means of protection, to the prevention of some exposure risks and of risks related to some activities. This document is an update of the previous version from January 25, 2011

  9. Ultrafast all-optical code-division multiple-access networks

    Science.gov (United States)

    Kwong, Wing C.; Prucnal, Paul R.; Liu, Yanming

    1992-12-01

    In optical code-division multiple access (CDMA), the architecture of optical encoders/decoders is another important factor that needs to be considered, besides the correlation properties of those already extensively studied optical codes. The architecture of optical encoders/decoders affects, for example, the amount of power loss and length of optical delays that are associated with code sequence generation and correlation, which, in turn, affect the power budget, size, and cost of an optical CDMA system. Various CDMA coding architectures are studied in the paper. In contrast to the encoders/decoders used in prime networks (i.e., prime encodes/decoders), which generate, select, and correlate code sequences by a parallel combination of fiber-optic delay-lines, and in 2n networks (i.e., 2n encoders/decoders), which generate and correlate code sequences by a serial combination of 2 X 2 passive couplers and fiber delays with sequence selection performed in a parallel fashion, the modified 2n encoders/decoders generate, select, and correlate code sequences by a serial combination of directional couplers and delays. The power and delay- length requirements of the modified 2n encoders/decoders are compared to that of the prime and 2n encoders/decoders. A 100 Mbit/s optical CDMA experiment in free space demonstrating the feasibility of the all-serial coding architecture using a serial combination of 50/50 beam splitters and retroreflectors at 10 Tchip/s (i.e., 100,000 chip/bit) with 100 fs laser pulses is reported.

  10. Cooperative MIMO communication at wireless sensor network: an error correcting code approach.

    Science.gov (United States)

    Islam, Mohammad Rakibul; Han, Young Shin

    2011-01-01

    Cooperative communication in wireless sensor network (WSN) explores the energy efficient wireless communication schemes between multiple sensors and data gathering node (DGN) by exploiting multiple input multiple output (MIMO) and multiple input single output (MISO) configurations. In this paper, an energy efficient cooperative MIMO (C-MIMO) technique is proposed where low density parity check (LDPC) code is used as an error correcting code. The rate of LDPC code is varied by varying the length of message and parity bits. Simulation results show that the cooperative communication scheme outperforms SISO scheme in the presence of LDPC code. LDPC codes with different code rates are compared using bit error rate (BER) analysis. BER is also analyzed under different Nakagami fading scenario. Energy efficiencies are compared for different targeted probability of bit error p(b). It is observed that C-MIMO performs more efficiently when the targeted p(b) is smaller. Also the lower encoding rate for LDPC code offers better error characteristics.

  11. Lossy Data Aggregation with Network Coding in Stand-Alone Wireless Sensor Networks

    DEFF Research Database (Denmark)

    Madsen, Tatiana Kozlova

    2011-01-01

    in chemical plants, etc. Given resource constrained operation of a sensor network where the nodes are battery powered and buffer sizes are limited, efficient methods for in-network data storage abd it subsequent fast and reliable transmission to a gateway is desirable. To save scarse resources and to prolong......This work focuses on a special type of wireless sensor networks (WSNs) that we refer to as a stand alone network. These netwoks operate in harsh and extreme environments where data collection is done only occasionally. Typical examples include habitat monitoring systems, monitoring systems...

  12. Development of flow network analysis code for block type VHTR core by linear theory method

    International Nuclear Information System (INIS)

    Lee, J. H.; Yoon, S. J.; Park, J. W.; Park, G. C.

    2012-01-01

    VHTR (Very High Temperature Reactor) is high-efficiency nuclear reactor which is capable of generating hydrogen with high temperature of coolant. PMR (Prismatic Modular Reactor) type reactor consists of hexagonal prismatic fuel blocks and reflector blocks. The flow paths in the prismatic VHTR core consist of coolant holes, bypass gaps and cross gaps. Complicated flow paths are formed in the core since the coolant holes and bypass gap are connected by the cross gap. Distributed coolant was mixed in the core through the cross gap so that the flow characteristics could not be modeled as a simple parallel pipe system. It requires lot of effort and takes very long time to analyze the core flow with CFD analysis. Hence, it is important to develop the code for VHTR core flow which can predict the core flow distribution fast and accurate. In this study, steady state flow network analysis code is developed using flow network algorithm. Developed flow network analysis code was named as FLASH code and it was validated with the experimental data and CFD simulation results. (authors)

  13. The origins and evolutionary history of human non-coding RNA regulatory networks.

    Science.gov (United States)

    Sherafatian, Masih; Mowla, Seyed Javad

    2017-04-01

    The evolutionary history and origin of the regulatory function of animal non-coding RNAs are not well understood. Lack of conservation of long non-coding RNAs and small sizes of microRNAs has been major obstacles in their phylogenetic analysis. In this study, we tried to shed more light on the evolution of ncRNA regulatory networks by changing our phylogenetic strategy to focus on the evolutionary pattern of their protein coding targets. We used available target databases of miRNAs and lncRNAs to find their protein coding targets in human. We were able to recognize evolutionary hallmarks of ncRNA targets by phylostratigraphic analysis. We found the conventional 3'-UTR and lesser known 5'-UTR targets of miRNAs to be enriched at three consecutive phylostrata. Firstly, in eukaryata phylostratum corresponding to the emergence of miRNAs, our study revealed that miRNA targets function primarily in cell cycle processes. Moreover, the same overrepresentation of the targets observed in the next two consecutive phylostrata, opisthokonta and eumetazoa, corresponded to the expansion periods of miRNAs in animals evolution. Coding sequence targets of miRNAs showed a delayed rise at opisthokonta phylostratum, compared to the 3' and 5' UTR targets of miRNAs. LncRNA regulatory network was the latest to evolve at eumetazoa.

  14. Beamforming-Based Physical Layer Network Coding for Non-Regenerative Multi-Way Relaying

    Directory of Open Access Journals (Sweden)

    Klein Anja

    2010-01-01

    Full Text Available We propose non-regenerative multi-way relaying where a half-duplex multi-antenna relay station (RS assists multiple single-antenna nodes to communicate with each other. The required number of communication phases is equal to the number of the nodes, N. There are only one multiple-access phase, where the nodes transmit simultaneously to the RS, and broadcast (BC phases. Two transmission methods for the BC phases are proposed, namely, multiplexing transmission and analog network coded transmission. The latter is a cooperation method between the RS and the nodes to manage the interference in the network. Assuming that perfect channel state information is available, the RS performs transceive beamforming to the received signals and transmits simultaneously to all nodes in each BC phase. We address the optimum transceive beamforming maximising the sum rate of non-regenerative multi-way relaying. Due to the nonconvexity of the optimization problem, we propose suboptimum but practical signal processing schemes. For multiplexing transmission, we propose suboptimum schemes based on zero forcing, minimising the mean square error, and maximising the signal to noise ratio. For analog network coded transmission, we propose suboptimum schemes based on matched filtering and semidefinite relaxation of maximising the minimum signal to noise ratio. It is shown that analog network coded transmission outperforms multiplexing transmission.

  15. Experience of the international network in radiation protection

    International Nuclear Information System (INIS)

    Medina Gironzini, Eduardo

    2008-01-01

    With the aim of exchanging information on various subjects about radiation protection and designing a site where the members can send and receive information on courses, scientific activities, articles, technical opinions, commentaries and everything that promotes the communication, collaboration and integration, the 15th March 2002 the networking: 'radioproteccion' is created with 11 persons from 11 countries. The number of members had been increased. By the first month it had 117 members and by the end of the year 2002 it had already 179 members, 315 messages were send by then. By December 2007, there were 726 members from 28 countries mainly from Latin America: Argentina, Brazil, Bolivia, Chile, Colombia, Costa Rica, Cuba, Dominican Republic, Ecuador, Guatemala, Honduras, Mexico, Nicaragua, Panama, Paraguay, Peru, Uruguay and Venezuela. There were also members from Austria, Canada, France, Israel, Italy, Portugal, Spain, Sweden, United Kingdom and United States. There have been distributed 2049 messages about Congress, courses and activities on national and international radiation protection and related issues which initially were in Latin American and the Caribbean. This has allowed diverse specialists that work in different themes to interchange experiences and information about subjects of common interest. This objective is the continuation of the spreading of activities that since 1991 and for 10 consecutive years had been made through the Bulletin 'Proteccion Radiologica', from which 65000 samples were published and distributed to specialists from 40 countries thanks to the support of the International Atomic Energy Agency (IAEA) and the Pan-American Health Organization (PAHO). This idea is complemented by the Web: www.radioproteccion.org. Interesting topics have been discussed in the network for example: Pregnancy and medical radiation, emergency response, occupational exposure, radiation protection responsibilities, lessons learned from accidental

  16. Performance Analysis for Bit Error Rate of DS- CDMA Sensor Network Systems with Source Coding

    Directory of Open Access Journals (Sweden)

    Haider M. AlSabbagh

    2012-03-01

    Full Text Available The minimum energy (ME coding combined with DS-CDMA wireless sensor network is analyzed in order to reduce energy consumed and multiple access interference (MAI with related to number of user(receiver. Also, the minimum energy coding which exploits redundant bits for saving power with utilizing RF link and On-Off-Keying modulation. The relations are presented and discussed for several levels of errors expected in the employed channel via amount of bit error rates and amount of the SNR for number of users (receivers.

  17. Review of the Monte Carlo and deterministic codes in radiation protection and dosimetry

    International Nuclear Information System (INIS)

    Tagziria, H.

    2000-02-01

    Monte Carlo technique is that the solutions are given at specific locations only, are statistically fluctuating and are arrived at with lots of computer effort. Sooner rather than later, however, one would expect that powerful variance reductions and ever-faster processor machines would balance these disadvantages out. This is especially true if one considers the rapid advances in computer technology and parallel computers, which can achieve a 300, fold faster convergence. In many fields and cases the user would, however, benefit greatly by considering when possible alternative methods to the Monte Carlo technique, such as deterministic methods, at least as a way of validation. It can be shown in fact, that for less complex problems a deterministic approach can have many advantages. In its earlier manifestations, Monte Carlo simulation was primarily performed by experts who were intimately involved in the development of the computer code. Increasingly, however, codes are being supplied as relatively user-friendly packages for widespread use, which allows them to be used by those with less specialist knowledge. This enables them to be used as 'black boxes', which in turn provides scope for costly errors, especially in the choice of cross section data and accelerator techniques. The Monte Carlo method as employed with modem computers goes back several decades, and nowadays science and software libraries would be virtually empty if one excluded work that is either directly or indirectly related to this technique. This is specifically true in the fields of 'computational dosimetry', 'radiation protection' and radiation transport in general. Hundreds of codes have been written and applied with various degrees of success. Some of these have become trademarks, generally well supported and taken over by the thousands of users. Other codes, which should be encouraged, are the so-called in house codes, which still serve well their developers' and their groups' in their intended

  18. Protecting Clock Synchronization: Adversary Detection through Network Monitoring

    Directory of Open Access Journals (Sweden)

    Elena Lisova

    2016-01-01

    Full Text Available Nowadays, industrial networks are often used for safety-critical applications with real-time requirements. Such applications usually have a time-triggered nature with message scheduling as a core property. Scheduling requires nodes to share the same notion of time, that is, to be synchronized. Therefore, clock synchronization is a fundamental asset in real-time networks. However, since typical standards for clock synchronization, for example, IEEE 1588, do not provide the required level of security, it raises the question of clock synchronization protection. In this paper, we identify a way to break synchronization based on the IEEE 1588 standard, by conducting a man-in-the-middle (MIM attack followed by a delay attack. A MIM attack can be accomplished through, for example, Address Resolution Protocol (ARP poisoning. Using the AVISPA tool, we evaluate the potential to perform a delay attack using ARP poisoning and analyze its consequences showing both that the attack can, indeed, break clock synchronization and that some design choices, such as a relaxed synchronization condition mode, delay bounding, and using knowledge of environmental conditions, can make the network more robust/resilient against these kinds of attacks. Lastly, a Configuration Agent is proposed to monitor and detect anomalies introduced by an adversary performing attacks targeting clock synchronization.

  19. Dynamic quality of service differentiation using fixed code weight in optical CDMA networks

    Science.gov (United States)

    Kakaee, Majid H.; Essa, Shawnim I.; Abd, Thanaa H.; Seyedzadeh, Saleh

    2015-11-01

    The emergence of network-driven applications, such as internet, video conferencing, and online gaming, brings in the need for a network the environments with capability of providing diverse Quality of Services (QoS). In this paper, a new code family of novel spreading sequences, called a Multi-Service (MS) code, has been constructed to support multiple services in Optical- Code Division Multiple Access (CDMA) system. The proposed method uses fixed weight for all services, however reducing the interfering codewords for the users requiring higher QoS. The performance of the proposed code is demonstrated using mathematical analysis. It shown that the total number of served users with satisfactory BER of 10-9 using NB=2 is 82, while they are only 36 and 10 when NB=3 and 4 respectively. The developed MS code is compared with variable-weight codes such as Variable Weight-Khazani Syed (VW-KS) and Multi-Weight-Random Diagonal (MW-RD). Different numbers of basic users (NB) are used to support triple-play services (audio, data and video) with different QoS requirements. Furthermore, reference to the BER of 10-12, 10-9, and 10-3 for video, data and audio, respectively, the system can support up to 45 total users. Hence, results show that the technique can clearly provide a relative QoS differentiation with lower value of basic users can support larger number of subscribers as well as better performance in terms of acceptable BER of 10-9 at fixed code weight.

  20. Code of Practice for the Protection of Persons against Ionizing Radiations arising from Medical and Dental Use

    Energy Technology Data Exchange (ETDEWEB)

    1972-01-01

    This Code is a revision of the 1964 Code of Practice for the protection of persons against ionizing radiations arising from medical and dental use. This revised Code (which does not have the force of law) applies to the use of ionizing radiations arising from all forms of medical and dental practice and from allied research involving human subjects. It covers both workers, patients and members of the public. Although the arrangements recommended relate primarily to institutions they should be applied, as far as possible, by all medical and dental practitioners. The Code has been drawn up in the light of the recommendations of the International Commission on Radiological Protection (ICRP) and of the views of the Medical Research Council's Committee on Protection against Ionizing Radiations.

  1. Code of Practice for the Protection of Persons against Ionizing Radiations arising from Medical and Dental Use

    International Nuclear Information System (INIS)

    1972-01-01

    This Code is a revision of the 1964 Code of Practice for the protection of persons against ionizing radiations arising from medical and dental use. This revised Code (which does not have the force of law) applies to the use of ionizing radiations arising from all forms of medical and dental practice and from allied research involving human subjects. It covers both workers, patients and members of the public. Although the arrangements recommended relate primarily to institutions they should be applied, as far as possible, by all medical and dental practitioners. The Code has been drawn up in the light of the recommendations of the International Commission on Radiological Protection (ICRP) and of the views of the Medical Research Council's Committee on Protection against Ionizing Radiations. (NEA) [fr

  2. Network Coding

    Indian Academy of Sciences (India)

    the other four pirates after his death. So, he ... level are intermediate nodes, representing the four other pirates. ..... A square matrix is said to be nilpotent if some power of the matrix is a .... at these determinants is to treat them as polynomials.

  3. Calculation codes in radiation protection, radiation physics and dosimetry; Codes de calcul en radioprotection, radiophysique et dosimetrie

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    2003-07-01

    These scientific days had for objective to draw up the situation of calculation codes of radiation transport, of sources estimation, of radiation doses managements and to draw the future perspectives. (N.C.)

  4. A neutron spectrum unfolding code based on generalized regression artificial neural networks

    International Nuclear Information System (INIS)

    Rosario Martinez-Blanco, Ma. del

    2016-01-01

    The most delicate part of neutron spectrometry, is the unfolding process. The derivation of the spectral information is not simple because the unknown is not given directly as a result of the measurements. Novel methods based on Artificial Neural Networks have been widely investigated. In prior works, back propagation neural networks (BPNN) have been used to solve the neutron spectrometry problem, however, some drawbacks still exist using this kind of neural nets, i.e. the optimum selection of the network topology and the long training time. Compared to BPNN, it's usually much faster to train a generalized regression neural network (GRNN). That's mainly because spread constant is the only parameter used in GRNN. Another feature is that the network will converge to a global minimum, provided that the optimal values of spread has been determined and that the dataset adequately represents the problem space. In addition, GRNN are often more accurate than BPNN in the prediction. These characteristics make GRNNs to be of great interest in the neutron spectrometry domain. This work presents a computational tool based on GRNN capable to solve the neutron spectrometry problem. This computational code, automates the pre-processing, training and testing stages using a k-fold cross validation of 3 folds, the statistical analysis and the post-processing of the information, using 7 Bonner spheres rate counts as only entrance data. The code was designed for a Bonner Spheres System based on a "6LiI(Eu) neutron detector and a response matrix expressed in 60 energy bins taken from an International Atomic Energy Agency compilation. - Highlights: • Main drawback of neutron spectrometry with BPNN is network topology optimization. • Compared to BPNN, it’s usually much faster to train a (GRNN). • GRNN are often more accurate than BPNN in the prediction. These characteristics make GRNNs to be of great interest. • This computational code, automates the pre-processing, training

  5. Delay reduction in multi-hop device-to-device communication using network coding

    KAUST Repository

    Douik, Ahmed S.

    2015-08-12

    This paper considers the problem of reducing the broadcast delay of wireless networks using instantly decodable network coding (IDNC) based device-to-device (D2D) communications. In D2D-enabled networks, devices help hasten the recovery of the lost packets of devices in their transmission range by sending network coded packets. To solve the problem, the different events occurring at each device are identified so as to derive an expression for the probability distribution of the decoding delay. The joint optimization problem over the set of transmitting devices and the packet combinations of each is formulated. Due to the high complexity of finding the optimal solution, this paper focuses on cooperation without interference between the transmitting users. The optimal solution, in such interference-less scenario, is expressed using a graph theory approach by introducing the cooperation graph. Extensive simulations compare the decoding delay experienced in the Point to Multi-Point (PMP), the fully connected D2D (FC-D2D) and the more practical partially connected D2D (PC-D2D) configurations and suggest that the PC-D2D outperforms the FC-D2D in all situations and provides an enormous gain for poorly connected networks.

  6. A neutron spectrum unfolding code based on generalized regression artificial neural networks

    International Nuclear Information System (INIS)

    Ortiz R, J. M.; Martinez B, M. R.; Castaneda M, R.; Solis S, L. O.; Vega C, H. R.

    2015-10-01

    The most delicate part of neutron spectrometry, is the unfolding process. Then derivation of the spectral information is not simple because the unknown is not given directly as result of the measurements. Novel methods based on Artificial Neural Networks have been widely investigated. In prior works, back propagation neural networks (BPNN) have been used to solve the neutron spectrometry problem, however, some drawbacks still exist using this kind of neural nets, as the optimum selection of the network topology and the long training time. Compared to BPNN, is usually much faster to train a generalized regression neural network (GRNN). That is mainly because spread constant is the only parameter used in GRNN. Another feature is that the network will converge to a global minimum. In addition, often are more accurate than BPNN in prediction. These characteristics make GRNN be of great interest in the neutron spectrometry domain. In this work is presented a computational tool based on GRNN, capable to solve the neutron spectrometry problem. This computational code, automates the pre-processing, training and testing stages, the statistical analysis and the post-processing of the information, using 7 Bonner spheres rate counts as only entrance data. The code was designed for a Bonner Spheres System based on a 6 LiI(Eu) neutron detector and a response matrix expressed in 60 energy bins taken from an International Atomic Energy Agency compilation. (Author)

  7. A neutron spectrum unfolding code based on generalized regression artificial neural networks

    Energy Technology Data Exchange (ETDEWEB)

    Ortiz R, J. M.; Martinez B, M. R.; Castaneda M, R.; Solis S, L. O. [Universidad Autonoma de Zacatecas, Unidad Academica de Ingenieria Electrica, Av. Ramon Lopez Velarde 801, Col. Centro, 98000 Zacatecas, Zac. (Mexico); Vega C, H. R., E-mail: morvymm@yahoo.com.mx [Universidad Autonoma de Zacatecas, Unidad Academica de Estudios Nucleares, Cipres No. 10, Fracc. La Penuela, 98068 Zacatecas, Zac. (Mexico)

    2015-10-15

    The most delicate part of neutron spectrometry, is the unfolding process. Then derivation of the spectral information is not simple because the unknown is not given directly as result of the measurements. Novel methods based on Artificial Neural Networks have been widely investigated. In prior works, back propagation neural networks (BPNN) have been used to solve the neutron spectrometry problem, however, some drawbacks still exist using this kind of neural nets, as the optimum selection of the network topology and the long training time. Compared to BPNN, is usually much faster to train a generalized regression neural network (GRNN). That is mainly because spread constant is the only parameter used in GRNN. Another feature is that the network will converge to a global minimum. In addition, often are more accurate than BPNN in prediction. These characteristics make GRNN be of great interest in the neutron spectrometry domain. In this work is presented a computational tool based on GRNN, capable to solve the neutron spectrometry problem. This computational code, automates the pre-processing, training and testing stages, the statistical analysis and the post-processing of the information, using 7 Bonner spheres rate counts as only entrance data. The code was designed for a Bonner Spheres System based on a {sup 6}LiI(Eu) neutron detector and a response matrix expressed in 60 energy bins taken from an International Atomic Energy Agency compilation. (Author)

  8. Integration and visualization of non-coding RNA and protein interaction networks

    OpenAIRE

    Junge, Alexander; Refsgaard, Jan Christian; Garde, Christian; Pan, Xiaoyong; Santos Delgado, Alberto; Anthon, Christian; Alkan, Ferhat; von Mering, Christian; Workman, Christopher; Jensen, Lars Juhl; Gorodkin, Jan

    2015-01-01

    Non-coding RNAs (ncRNAs) fulfill a diverse set of biological functions relying on interactions with other molecular entities. The advent of new experimental and computational approaches makes it possible to study ncRNAs and their associations on an unprecedented scale. We present RAIN (RNA Association and Interaction Networks) - a database that combines ncRNA-ncRNA, ncRNA-mRNA and ncRNA-protein interactions with large-scale protein association networks available in the STRING database. By int...

  9. Design and Performance Evaluation of Underwater Data Dissemination Strategies using Interference Avoidance and Network Coding

    DEFF Research Database (Denmark)

    Palacios, Raul; Heide, Janus; Fitzek, Frank

    2012-01-01

    constraints and achieve efficient data transmission under water. Network Coding can exploit the broadcast channel to send different information to several receivers simultaneously. With Interference Avoidance the long propagation delay can be used to communicate in full-duplex mode. Alone and combined...... these concepts could increase channel utilisation as well as improve energy efficiency of the network nodes. The main goal is to investigate the potential benefits of new strategies for data dissemination over a string topology scenario. Comprehensive simulations prove the feasibility of Interference Avoidance...

  10. Energy Effective Congestion Control for Multicast with Network Coding in Wireless Ad Hoc Network

    Directory of Open Access Journals (Sweden)

    Chuanxin Zhao

    2014-01-01

    Full Text Available In order to improve network throughput and reduce energy consumption, we propose in this paper a cross-layer optimization design that is able to achieve multicast utility maximization and energy consumption minimization. The joint optimization of congestion control and power allocation is formulated to be a nonlinear nonconvex problem. Using dual decomposition, a distributed optimization algorithm is proposed to avoid the congestion by control flow rate at the source node and eliminate the bottleneck by allocating the power at the intermediate node. Simulation results show that the cross-layer algorithm can increase network performance, reduce the energy consumption of wireless nodes and prolong the network lifetime, while keeping network throughput basically unchanged.

  11. When are network coding based dynamic multi-homing techniques beneficial?

    DEFF Research Database (Denmark)

    Pereira, Carlos; Aguiar, Ana; Roetter, Daniel Enrique Lucani

    2016-01-01

    Mechanisms that can cope with unreliable wireless channels in an efficient manner are required due to the increasing number of resource constrained devices. Concurrent use of multiple communications technologies can be instrumental towards improving services to mobile devices in heterogeneous...... networks. In our previous work, we developed an optimization framework to generate channel-aware transmission policies for multi-homed devices under different cost criteria. Our formulation considers network coding as a key technique that simplifies load allocation across multiple channels and provides...... high resiliency under time-varying channel conditions. This paper seeks to explore the parameter space and identify the operating regions where dynamic coded policies offer most improvement over static ones in terms of energy consumption and channel utilization. We leverage meta-heuristics to find...

  12. Analysis and Optimization of Sparse Random Linear Network Coding for Reliable Multicast Services

    DEFF Research Database (Denmark)

    Tassi, Andrea; Chatzigeorgiou, Ioannis; Roetter, Daniel Enrique Lucani

    2016-01-01

    Point-to-multipoint communications are expected to play a pivotal role in next-generation networks. This paper refers to a cellular system transmitting layered multicast services to a multicast group of users. Reliability of communications is ensured via different random linear network coding (RLNC......) techniques. We deal with a fundamental problem: the computational complexity of the RLNC decoder. The higher the number of decoding operations is, the more the user's computational overhead grows and, consequently, the faster the battery of mobile devices drains. By referring to several sparse RLNC...... techniques, and without any assumption on the implementation of the RLNC decoder in use, we provide an efficient way to characterize the performance of users targeted by ultra-reliable layered multicast services. The proposed modeling allows to efficiently derive the average number of coded packet...

  13. Using Wireless Network Coding to Replace a Wired with Wireless Backhaul

    DEFF Research Database (Denmark)

    Thomsen, Henning; De Carvalho, Elisabeth; Popovski, Petar

    2014-01-01

    of wireless emulated wire (WEW), based on two-way relaying and network coding. This setup leads to a new type of broadcast problem, with decoding conditions that are specific to the requirement for equivalence to the wired backhaul. We formulate and solve the associated optimization problems. The proposed...... approach is a convincing argument that wireless backhauling solutions should be designed and optimized for two-way communication....

  14. International Code Centres Network. Summary Report of the 3rd Biennial Technical Meeting

    International Nuclear Information System (INIS)

    Chung, Hyun-Kyung

    2013-07-01

    This report summarizes the proceedings of the third Technical Meeting of the International Code Centres Network held on 6-8 May in 2013. Ten experts from seven member states and four IAEA staff members attended the three-day meeting held at the IAEA Headquarters in Vienna to discuss issues on uncertainty estimates of theoretical atomic and molecular data. The report includes discussions on data issues, meeting conclusions and recommendations for the IAEA Atomic and Molecular Data Unit. (author)

  15. Dynamic spatial coding within the dorsal frontoparietal network during a visual search task.

    Directory of Open Access Journals (Sweden)

    Wieland H Sommer

    Full Text Available To what extent are the left and right visual hemifields spatially coded in the dorsal frontoparietal attention network? In many experiments with neglect patients, the left hemisphere shows a contralateral hemifield preference, whereas the right hemisphere represents both hemifields. This pattern of spatial coding is often used to explain the right-hemispheric dominance of lesions causing hemispatial neglect. However, pathophysiological mechanisms of hemispatial neglect are controversial because recent experiments on healthy subjects produced conflicting results regarding the spatial coding of visual hemifields. We used an fMRI paradigm that allowed us to distinguish two attentional subprocesses during a visual search task. Either within the left or right hemifield subjects first attended to stationary locations (spatial orienting and then shifted their attentional focus to search for a target line. Dynamic changes in spatial coding of the left and right hemifields were observed within subregions of the dorsal front-parietal network: During stationary spatial orienting, we found the well-known spatial pattern described above, with a bilateral hemifield representation in the right hemisphere and a contralateral preference in the left hemisphere. However, during search, the right hemisphere had a contralateral preference and the left hemisphere equally represented both hemifields. This finding leads to novel perspectives regarding models of visuospatial attention and hemispatial neglect.

  16. Hierarchical surface code for network quantum computing with modules of arbitrary size

    Science.gov (United States)

    Li, Ying; Benjamin, Simon C.

    2016-10-01

    The network paradigm for quantum computing involves interconnecting many modules to form a scalable machine. Typically it is assumed that the links between modules are prone to noise while operations within modules have a significantly higher fidelity. To optimize fault tolerance in such architectures we introduce a hierarchical generalization of the surface code: a small "patch" of the code exists within each module and constitutes a single effective qubit of the logic-level surface code. Errors primarily occur in a two-dimensional subspace, i.e., patch perimeters extruded over time, and the resulting noise threshold for intermodule links can exceed ˜10 % even in the absence of purification. Increasing the number of qubits within each module decreases the number of qubits necessary for encoding a logical qubit. But this advantage is relatively modest, and broadly speaking, a "fine-grained" network of small modules containing only about eight qubits is competitive in total qubit count versus a "course" network with modules containing many hundreds of qubits.

  17. The NEST Dry-Run Mode: Efficient Dynamic Analysis of Neuronal Network Simulation Code

    Directory of Open Access Journals (Sweden)

    Susanne Kunkel

    2017-06-01

    Full Text Available NEST is a simulator for spiking neuronal networks that commits to a general purpose approach: It allows for high flexibility in the design of network models, and its applications range from small-scale simulations on laptops to brain-scale simulations on supercomputers. Hence, developers need to test their code for various use cases and ensure that changes to code do not impair scalability. However, running a full set of benchmarks on a supercomputer takes up precious compute-time resources and can entail long queuing times. Here, we present the NEST dry-run mode, which enables comprehensive dynamic code analysis without requiring access to high-performance computing facilities. A dry-run simulation is carried out by a single process, which performs all simulation steps except communication as if it was part of a parallel environment with many processes. We show that measurements of memory usage and runtime of neuronal network simulations closely match the corresponding dry-run data. Furthermore, we demonstrate the successful application of the dry-run mode in the areas of profiling and performance modeling.

  18. Code of practice and design principles, for installed radiological protection systems

    International Nuclear Information System (INIS)

    Powell, R.G.

    1980-09-01

    The main points on which a guide for designers and installers of radiological protection instrumentation (RPI) should be based have been examined by a small group of instrumentation engineers. The purpose of this document is to present a comprehensive and detailed review of these points. It is intended to give an overall coverage and serve as a reference document for specific points; it should also be of value to newcomers to the RPI field. The code presents a standard of good practice and takes the form of recommendations only. The contents cover: the requirement for RPI; design, availability and reliability, information displays, human factors, power supplies, manufacture, quality assurance, testing, cost, installation, operation, maintenance and documentation. Appendices include: Radon and thoron decay series, air sampling, reliability of component combinations and redundancy. (28 references). (author)

  19. Electronic Contracts and the Personal data Protection of the Consumer: Sources Dialogue Between the Consumer Protection Code and the Internet Civil Mark.

    Directory of Open Access Journals (Sweden)

    Rosane Leal Da Silva

    2016-10-01

    Full Text Available This paper analyzes the personal data protection of the consumer and your vulnerability in interactive electronic contracts, aiming to point means of defense. For this, uses the deductive approach and starts of the electronic contracting to discuss the legal protection of the consumer in light of the capturing and processing of personal data by the furnisher. Considering the absence of law about personal data, concludes that electronic contracting expands the consumer vulnerability, which requires the principles application of the Consumer Protection Code, adding the Internet Civil Mark in relation to the privacy protection.

  20. Facility Targeting, Protection and Mission Decision Making Using the VISAC Code

    Science.gov (United States)

    Morris, Robert H.; Sulfredge, C. David

    2011-01-01

    The Visual Interactive Site Analysis Code (VISAC) has been used by DTRA and several other agencies to aid in targeting facilities and to predict the associated collateral effects for the go, no go mission decision making process. VISAC integrates the three concepts of target geometric modeling, damage assessment capabilities, and an event/fault tree methodology for evaluating accident/incident consequences. It can analyze a variety of accidents/incidents at nuclear or industrial facilities, ranging from simple component sabotage to an attack with military or terrorist weapons. For nuclear facilities, VISAC predicts the facility damage, estimated downtime, amount and timing of any radionuclides released. Used in conjunction with DTRA's HPAC code, VISAC also can analyze transport and dispersion of the radionuclides, levels of contamination of the surrounding area, and the population at risk. VISAC has also been used by the NRC to aid in the development of protective measures for nuclear facilities that may be subjected to attacks by car/truck bombs.

  1. An Adaptive Data Gathering Scheme for Multi-Hop Wireless Sensor Networks Based on Compressed Sensing and Network Coding.

    Science.gov (United States)

    Yin, Jun; Yang, Yuwang; Wang, Lei

    2016-04-01

    Joint design of compressed sensing (CS) and network coding (NC) has been demonstrated to provide a new data gathering paradigm for multi-hop wireless sensor networks (WSNs). By exploiting the correlation of the network sensed data, a variety of data gathering schemes based on NC and CS (Compressed Data Gathering--CDG) have been proposed. However, these schemes assume that the sparsity of the network sensed data is constant and the value of the sparsity is known before starting each data gathering epoch, thus they ignore the variation of the data observed by the WSNs which are deployed in practical circumstances. In this paper, we present a complete design of the feedback CDG scheme where the sink node adaptively queries those interested nodes to acquire an appropriate number of measurements. The adaptive measurement-formation procedure and its termination rules are proposed and analyzed in detail. Moreover, in order to minimize the number of overall transmissions in the formation procedure of each measurement, we have developed a NP-complete model (Maximum Leaf Nodes Minimum Steiner Nodes--MLMS) and realized a scalable greedy algorithm to solve the problem. Experimental results show that the proposed measurement-formation method outperforms previous schemes, and experiments on both datasets from ocean temperature and practical network deployment also prove the effectiveness of our proposed feedback CDG scheme.

  2. Comparison of a Ring On-Chip Network and a Code-Division Multiple-Access On-Chip Network

    Directory of Open Access Journals (Sweden)

    Xin Wang

    2007-01-01

    Full Text Available Two network-on-chip (NoC designs are examined and compared in this paper. One design applies a bidirectional ring connection scheme, while the other design applies a code-division multiple-access (CDMA connection scheme. Both of the designs apply globally asynchronous locally synchronous (GALS scheme in order to deal with the issue of transferring data in a multiple-clock-domain environment of an on-chip system. The two NoC designs are compared with each other by their network structures, data transfer principles, network node structures, and their asynchronous designs. Both the synchronous and the asynchronous designs of the two on-chip networks are realized using a hardware-description language (HDL in order to make the entire designs suit the commonly used synchronous design tools and flow. The performance estimation and comparison of the two NoC designs which are based on the HDL realizations are addressed. By comparing the two NoC designs, the advantages and disadvantages of applying direct connection and CDMA connection schemes in an on-chip communication network are discussed.

  3. Models of neural networks temporal aspects of coding and information processing in biological systems

    CERN Document Server

    Hemmen, J; Schulten, Klaus

    1994-01-01

    Since the appearance of Vol. 1 of Models of Neural Networks in 1991, the theory of neural nets has focused on two paradigms: information coding through coherent firing of the neurons and functional feedback. Information coding through coherent neuronal firing exploits time as a cardinal degree of freedom. This capacity of a neural network rests on the fact that the neuronal action potential is a short, say 1 ms, spike, localized in space and time. Spatial as well as temporal correlations of activity may represent different states of a network. In particular, temporal correlations of activity may express that neurons process the same "object" of, for example, a visual scene by spiking at the very same time. The traditional description of a neural network through a firing rate, the famous S-shaped curve, presupposes a wide time window of, say, at least 100 ms. It thus fails to exploit the capacity to "bind" sets of coherently firing neurons for the purpose of both scene segmentation and figure-ground segregatio...

  4. Container-code recognition system based on computer vision and deep neural networks

    Science.gov (United States)

    Liu, Yi; Li, Tianjian; Jiang, Li; Liang, Xiaoyao

    2018-04-01

    Automatic container-code recognition system becomes a crucial requirement for ship transportation industry in recent years. In this paper, an automatic container-code recognition system based on computer vision and deep neural networks is proposed. The system consists of two modules, detection module and recognition module. The detection module applies both algorithms based on computer vision and neural networks, and generates a better detection result through combination to avoid the drawbacks of the two methods. The combined detection results are also collected for online training of the neural networks. The recognition module exploits both character segmentation and end-to-end recognition, and outputs the recognition result which passes the verification. When the recognition module generates false recognition, the result will be corrected and collected for online training of the end-to-end recognition sub-module. By combining several algorithms, the system is able to deal with more situations, and the online training mechanism can improve the performance of the neural networks at runtime. The proposed system is able to achieve 93% of overall recognition accuracy.

  5. Enhancing source location protection in wireless sensor networks

    Science.gov (United States)

    Chen, Juan; Lin, Zhengkui; Wu, Di; Wang, Bailing

    2015-12-01

    Wireless sensor networks are widely deployed in the internet of things to monitor valuable objects. Once the object is monitored, the sensor nearest to the object which is known as the source informs the base station about the object's information periodically. It is obvious that attackers can capture the object successfully by localizing the source. Thus, many protocols have been proposed to secure the source location. However, in this paper, we examine that typical source location protection protocols generate not only near but also highly localized phantom locations. As a result, attackers can trace the source easily from these phantom locations. To address these limitations, we propose a protocol to enhance the source location protection (SLE). With phantom locations far away from the source and widely distributed, SLE improves source location anonymity significantly. Theory analysis and simulation results show that our SLE provides strong source location privacy preservation and the average safety period increases by nearly one order of magnitude compared with existing work with low communication cost.

  6. Increasing data distribution in BitTorrent networks by using network coding techniques

    DEFF Research Database (Denmark)

    Braun, Patrik János; Sipos, Marton A.; Ekler, Péter

    2015-01-01

    Abstract: Peer-to-peer networks are well known for their benefits when used for sharing data among multiple users. One of the most common protocols for shared data distribution is BitTorrent. Despite its popularity, it has some inefficiencies that affect the speed of the content distribution. In ...

  7. Efficient File Sharing by Multicast - P2P Protocol Using Network Coding and Rank Based Peer Selection

    Science.gov (United States)

    Stoenescu, Tudor M.; Woo, Simon S.

    2009-01-01

    In this work, we consider information dissemination and sharing in a distributed peer-to-peer (P2P highly dynamic communication network. In particular, we explore a network coding technique for transmission and a rank based peer selection method for network formation. The combined approach has been shown to improve information sharing and delivery to all users when considering the challenges imposed by the space network environments.

  8. Synthesis of the scientific French speaking days on numerical codes in radiation protection, in radio physics and in dosimetry

    International Nuclear Information System (INIS)

    Paul, D.; Makovicka, L.; Ricard, M.

    2005-01-01

    Synthesis of the scientific French speaking days on numerical codes in radiation protection, in radio-physics and in dosimetry. The paper carries the title of 'French speaking' scientific days co-organized on October 2-3, 2003 in Sochaux by the SFRP, SFPM and FIRAM societies. It has for objective to establish the scientific balance sheet of this international event, to give the synthesis of current tendencies in the field of the development and of the use of the numerical codes in radiation protection, in radio-physics and in dosimetry. (author)

  9. Delay reduction in lossy intermittent feedback for generalized instantly decodable network coding

    KAUST Repository

    Douik, Ahmed S.; Sorour, Sameh; Alouini, Mohamed-Slim; Ai-Naffouri, Tareq Y.

    2013-01-01

    In this paper, we study the effect of lossy intermittent feedback loss events on the multicast decoding delay performance of generalized instantly decodable network coding. These feedback loss events create uncertainty at the sender about the reception statues of different receivers and thus uncertainty to accurately determine subsequent instantly decodable coded packets. To solve this problem, we first identify the different possibilities of uncertain packets at the sender and their probabilities. We then derive the expression of the mean decoding delay. We formulate the Generalized Instantly Decodable Network Coding (G-IDNC) minimum decoding delay problem as a maximum weight clique problem. Since finding the optimal solution is NP-hard, we design a variant of the algorithm employed in [1]. Our algorithm is compared to the two blind graph update proposed in [2] through extensive simulations. Results show that our algorithm outperforms the blind approaches in all the situations and achieves a tolerable degradation, against the perfect feedback, for large feedback loss period. © 2013 IEEE.

  10. Delay reduction in lossy intermittent feedback for generalized instantly decodable network coding

    KAUST Repository

    Douik, Ahmed S.

    2013-10-01

    In this paper, we study the effect of lossy intermittent feedback loss events on the multicast decoding delay performance of generalized instantly decodable network coding. These feedback loss events create uncertainty at the sender about the reception statues of different receivers and thus uncertainty to accurately determine subsequent instantly decodable coded packets. To solve this problem, we first identify the different possibilities of uncertain packets at the sender and their probabilities. We then derive the expression of the mean decoding delay. We formulate the Generalized Instantly Decodable Network Coding (G-IDNC) minimum decoding delay problem as a maximum weight clique problem. Since finding the optimal solution is NP-hard, we design a variant of the algorithm employed in [1]. Our algorithm is compared to the two blind graph update proposed in [2] through extensive simulations. Results show that our algorithm outperforms the blind approaches in all the situations and achieves a tolerable degradation, against the perfect feedback, for large feedback loss period. © 2013 IEEE.

  11. How to Use FASTLANEs to Protect IP Networks

    National Research Council Canada - National Science Library

    Robson, Christopher L

    2006-01-01

    .... By using appropriate configuration and taking full advantage of new IP technologies and successful network encryption FASTLANE devices, interconnecting individual agency networks into a common...

  12. The research of computer network security and protection strategy

    Science.gov (United States)

    He, Jian

    2017-05-01

    With the widespread popularity of computer network applications, its security is also received a high degree of attention. Factors affecting the safety of network is complex, for to do a good job of network security is a systematic work, has the high challenge. For safety and reliability problems of computer network system, this paper combined with practical work experience, from the threat of network security, security technology, network some Suggestions and measures for the system design principle, in order to make the masses of users in computer networks to enhance safety awareness and master certain network security technology.

  13. Extremely Scalable Spiking Neuronal Network Simulation Code: From Laptops to Exascale Computers

    Directory of Open Access Journals (Sweden)

    Jakob Jordan

    2018-02-01

    Full Text Available State-of-the-art software tools for neuronal network simulations scale to the largest computing systems available today and enable investigations of large-scale networks of up to 10 % of the human cortex at a resolution of individual neurons and synapses. Due to an upper limit on the number of incoming connections of a single neuron, network connectivity becomes extremely sparse at this scale. To manage computational costs, simulation software ultimately targeting the brain scale needs to fully exploit this sparsity. Here we present a two-tier connection infrastructure and a framework for directed communication among compute nodes accounting for the sparsity of brain-scale networks. We demonstrate the feasibility of this approach by implementing the technology in the NEST simulation code and we investigate its performance in different scaling scenarios of typical network simulations. Our results show that the new data structures and communication scheme prepare the simulation kernel for post-petascale high-performance computing facilities without sacrificing performance in smaller systems.

  14. Extremely Scalable Spiking Neuronal Network Simulation Code: From Laptops to Exascale Computers.

    Science.gov (United States)

    Jordan, Jakob; Ippen, Tammo; Helias, Moritz; Kitayama, Itaru; Sato, Mitsuhisa; Igarashi, Jun; Diesmann, Markus; Kunkel, Susanne

    2018-01-01

    State-of-the-art software tools for neuronal network simulations scale to the largest computing systems available today and enable investigations of large-scale networks of up to 10 % of the human cortex at a resolution of individual neurons and synapses. Due to an upper limit on the number of incoming connections of a single neuron, network connectivity becomes extremely sparse at this scale. To manage computational costs, simulation software ultimately targeting the brain scale needs to fully exploit this sparsity. Here we present a two-tier connection infrastructure and a framework for directed communication among compute nodes accounting for the sparsity of brain-scale networks. We demonstrate the feasibility of this approach by implementing the technology in the NEST simulation code and we investigate its performance in different scaling scenarios of typical network simulations. Our results show that the new data structures and communication scheme prepare the simulation kernel for post-petascale high-performance computing facilities without sacrificing performance in smaller systems.

  15. Extremely Scalable Spiking Neuronal Network Simulation Code: From Laptops to Exascale Computers

    Science.gov (United States)

    Jordan, Jakob; Ippen, Tammo; Helias, Moritz; Kitayama, Itaru; Sato, Mitsuhisa; Igarashi, Jun; Diesmann, Markus; Kunkel, Susanne

    2018-01-01

    State-of-the-art software tools for neuronal network simulations scale to the largest computing systems available today and enable investigations of large-scale networks of up to 10 % of the human cortex at a resolution of individual neurons and synapses. Due to an upper limit on the number of incoming connections of a single neuron, network connectivity becomes extremely sparse at this scale. To manage computational costs, simulation software ultimately targeting the brain scale needs to fully exploit this sparsity. Here we present a two-tier connection infrastructure and a framework for directed communication among compute nodes accounting for the sparsity of brain-scale networks. We demonstrate the feasibility of this approach by implementing the technology in the NEST simulation code and we investigate its performance in different scaling scenarios of typical network simulations. Our results show that the new data structures and communication scheme prepare the simulation kernel for post-petascale high-performance computing facilities without sacrificing performance in smaller systems. PMID:29503613

  16. An Improved MOEA/D for QoS Oriented Multimedia Multicasting with Network Coding

    Directory of Open Access Journals (Sweden)

    Zhaoyuan Wang

    2015-08-01

    Full Text Available Recent years witness a significant growth in multimedia applications. Among them, a stream of applications is real-time and requires one-to-many fast data transmission with stringent quality-of-service (QoS requirements, where multicast is an important supporting technology. In particular, with more and more mobile end users requesting real-time broadband multimedia applications, it is of vital importance to provide them with satisfied quality of experience. As network coding can offer higher bandwidth to users and accommodate more flows for networks than traditional routing, this paper studies the multicast routing problem with network coding and formulates it as a multi-objective optimization problem. As delay and packet loss ratio (PLR are two important performance indicators for QoS, we consider them as the two objectives for minimization. To address the problem above, we present a multi-objective evolutionary algorithm based on decomposition (MOEA/D, where an all population updating rule is devised to address the problem of lacking feasible solutions in the search space. Experimental results demonstrate the effectiveness of the proposed algorithm and it outperforms a number of state-of-the-art algorithms.

  17. Application of DIgSILENT POWERFACTORY software for modeling of industrial network relay protection system

    Directory of Open Access Journals (Sweden)

    Sučević Nikola

    2016-01-01

    Full Text Available This paper presents modeling of industrial network relay protection system using DIgSILENT PowerFactory software. The basis for the model of protection system is a model of a single substation in an industrial network. The paper presents the procedure for modeling of protective devices of 6 kV asynchronous motors, 6/0,4 kV/kV transformers as well as protection in the bus coupler and busbar protection. Protective relay system response for the simulated disturbances is shown in the paper.

  18. Application of DIgSILENT POWERFACTORY software for modeling of industrial network relay protection system

    OpenAIRE

    Sučević Nikola; Milošević Dejan

    2016-01-01

    This paper presents modeling of industrial network relay protection system using DIgSILENT PowerFactory software. The basis for the model of protection system is a model of a single substation in an industrial network. The paper presents the procedure for modeling of protective devices of 6 kV asynchronous motors, 6/0,4 kV/kV transformers as well as protection in the bus coupler and busbar protection. Protective relay system response for the simulated disturbances is shown in the paper.

  19. Radiation protection studies for medical particle accelerators using FLUKA Monte Carlo code

    International Nuclear Information System (INIS)

    Infantino, Angelo; Mostacci, Domiziano; Cicoria, Gianfranco; Lucconi, Giulia; Pancaldi, Davide; Vichi, Sara; Zagni, Federico; Marengo, Mario

    2017-01-01

    Radiation protection (RP) in the use of medical cyclotrons involves many aspects both in the routine use and for the decommissioning of a site. Guidelines for site planning and installation, as well as for RP assessment, are given in international documents; however, the latter typically offer analytic methods of calculation of shielding and materials activation, in approximate or idealised geometry set-ups. The availability of Monte Carlo (MC) codes with accurate up-to-date libraries for transport and interaction of neutrons and charged particles at energies below 250 MeV, together with the continuously increasing power of modern computers, makes the systematic use of simulations with realistic geometries possible, yielding equipment and site-specific evaluation of the source terms, shielding requirements and all quantities relevant to RP at the same time. In this work, the well-known FLUKA MC code was used to simulate different aspects of RP in the use of biomedical accelerators, particularly for the production of medical radioisotopes. In the context of the Young Professionals Award, held at the IRPA 14 conference, only a part of the complete work is presented. In particular, the simulation of the GE PETtrace cyclotron (16.5 MeV) installed at S. Orsola-Malpighi University Hospital evaluated the effective dose distribution around the equipment; the effective number of neutrons produced per incident proton and their spectral distribution; the activation of the structure of the cyclotron and the vault walls; the activation of the ambient air, in particular the production of "4"1Ar. The simulations were validated, in terms of physical and transport parameters to be used at the energy range of interest, through an extensive measurement campaign of the neutron environmental dose equivalent using a rem-counter and TLD dosemeters. The validated model was then used in the design and the licensing request of a new Positron Emission Tomography facility. (authors)

  20. Australia’s protected area network fails to adequately protect the world’s most threatened marine fishes

    Directory of Open Access Journals (Sweden)

    Karen R. Devitt

    2015-01-01

    Full Text Available In order to maintain ecosystems and biodiversity, Australia has long invested in the development of marine and terrestrial protected area networks. Within this land- and sea-scape, northern Australia represents a global population stronghold for four species of the world’s most threatened marine fish family, the sawfishes (family Pristidae. The distribution of sawfishes across northern Australia has previously only been coarsely estimated, and the adequacy of their representation in protected areas has not been evaluated. The calculated range of each species was intersected with Australia’s marine and terrestrial protected area datasets, and targets of 10% marine and 17% inland range protection were used to determine adequacy of sawfish range protection. Marine targets have been achieved for all species, but the inland range protection targets have not been met for any species. Results indicate that further protection of inland habitats is required in order to improve sawfish protection and habitat connectivity.

  1. Surveying multidisciplinary aspects in real-time distributed coding for Wireless Sensor Networks.

    Science.gov (United States)

    Braccini, Carlo; Davoli, Franco; Marchese, Mario; Mongelli, Maurizio

    2015-01-27

    Wireless Sensor Networks (WSNs), where a multiplicity of sensors observe a physical phenomenon and transmit their measurements to one or more sinks, pertain to the class of multi-terminal source and channel coding problems of Information Theory. In this category, "real-time" coding is often encountered for WSNs, referring to the problem of finding the minimum distortion (according to a given measure), under transmission power constraints, attainable by encoding and decoding functions, with stringent limits on delay and complexity. On the other hand, the Decision Theory approach seeks to determine the optimal coding/decoding strategies or some of their structural properties. Since encoder(s) and decoder(s) possess different information, though sharing a common goal, the setting here is that of Team Decision Theory. A more pragmatic vision rooted in Signal Processing consists of fixing the form of the coding strategies (e.g., to linear functions) and, consequently, finding the corresponding optimal decoding strategies and the achievable distortion, generally by applying parametric optimization techniques. All approaches have a long history of past investigations and recent results. The goal of the present paper is to provide the taxonomy of the various formulations, a survey of the vast related literature, examples from the authors' own research, and some highlights on the inter-play of the different theories.

  2. Surveying Multidisciplinary Aspects in Real-Time Distributed Coding for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Carlo Braccini

    2015-01-01

    Full Text Available Wireless Sensor Networks (WSNs, where a multiplicity of sensors observe a physical phenomenon and transmit their measurements to one or more sinks, pertain to the class of multi-terminal source and channel coding problems of Information Theory. In this category, “real-time” coding is often encountered for WSNs, referring to the problem of finding the minimum distortion (according to a given measure, under transmission power constraints, attainable by encoding and decoding functions, with stringent limits on delay and complexity. On the other hand, the Decision Theory approach seeks to determine the optimal coding/decoding strategies or some of their structural properties. Since encoder(s and decoder(s possess different information, though sharing a common goal, the setting here is that of Team Decision Theory. A more pragmatic vision rooted in Signal Processing consists of fixing the form of the coding strategies (e.g., to linear functions and, consequently, finding the corresponding optimal decoding strategies and the achievable distortion, generally by applying parametric optimization techniques. All approaches have a long history of past investigations and recent results. The goal of the present paper is to provide the taxonomy of the various formulations, a survey of the vast related literature, examples from the authors’ own research, and some highlights on the inter-play of the different theories.

  3. A Distributed Flow Rate Control Algorithm for Networked Agent System with Multiple Coding Rates to Optimize Multimedia Data Transmission

    Directory of Open Access Journals (Sweden)

    Shuai Zeng

    2013-01-01

    Full Text Available With the development of wireless technologies, mobile communication applies more and more extensively in the various walks of life. The social network of both fixed and mobile users can be seen as networked agent system. At present, kinds of devices and access network technology are widely used. Different users in this networked agent system may need different coding rates multimedia data due to their heterogeneous demand. This paper proposes a distributed flow rate control algorithm to optimize multimedia data transmission of the networked agent system with the coexisting various coding rates. In this proposed algorithm, transmission path and upload bandwidth of different coding rate data between source node, fixed and mobile nodes are appropriately arranged and controlled. On the one hand, this algorithm can provide user nodes with differentiated coding rate data and corresponding flow rate. On the other hand, it makes the different coding rate data and user nodes networked, which realizes the sharing of upload bandwidth of user nodes which require different coding rate data. The study conducts mathematical modeling on the proposed algorithm and compares the system that adopts the proposed algorithm with the existing system based on the simulation experiment and mathematical analysis. The results show that the system that adopts the proposed algorithm achieves higher upload bandwidth utilization of user nodes and lower upload bandwidth consumption of source node.

  4. On the Delay Characteristics for Point-to-Point links using Random Linear Network Coding with On-the-fly Coding Capabilities

    DEFF Research Database (Denmark)

    Tömösközi, Máté; Fitzek, Frank; Roetter, Daniel Enrique Lucani

    2014-01-01

    Video surveillance and similar real-time applications on wireless networks require increased reliability and high performance of the underlying transmission layer. Classical solutions, such as Reed-Solomon codes, increase the reliability, but typically have the negative side-effect of additional ...

  5. Collection of regulatory texts relative to radiation protection. Part 2: orders and decisions taken in application of the Public Health Code and Labour Code concerning the protection of populations, patients and workers against the risks of ionizing radiations; Recueil de textes reglementaires relatifs a la radioprotection. Partie 2: arretes et decisions pris en application du Code de Sante Publique et du Code du Travail concernant la protection de la population, des patients et des travailleurs contre les dangers des rayonnements ionisants

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    2007-05-15

    This collection of texts includes the general measures of population protection, exposure to natural radiations, general system of authorizations and statements, protection of persons exposed to ionizing radiations for medical purpose, situations of radiological emergency and long exposure to ionizing radiations, penal dispositions, application of the Public Health code and application of the Labour code. Chronological contents by date of publication is given. (N.C.)

  6. Image transmission in multicore-fiber code-division multiple access network

    Science.gov (United States)

    Yang, Guu-Chang; Kwong, Wing C.

    1997-01-01

    Recently, two-dimensional (2-D) signature patterns were proposed to encode binary digitized image pixels in optical code-division multiple-access (CDMA) networks with 'multicore' fiber. The new technology enables parallel transmission and simultaneous access of 2-D images in multiple-access environment, where these signature patterns are defined as optical orthogonal signature pattern codes (OOSPCs). However, previous work on OOSPCs assumed that the weight of each signature pattern was the same. In this paper, we construct a new family of OOSPCs with the removal of this assumption. Since varying the weight of a user's signature pattern affects that user's performance, this approach is useful for CDMA optical systems with multiple performance requirements.

  7. Constructing a two bands optical code-division multiple-access network of bipolar optical access codecs using Walsh-coded liquid crystal modulators

    Science.gov (United States)

    Yen, Chih-Ta; Huang, Jen-Fa; Chih, Ping-En

    2014-08-01

    We propose and experimentally demonstrated the two bands optical code-division multiple-access (OCDMA) network over bipolar Walsh-coded liquid-crystal modulators (LCMs) and driven by green light and red light lasers. Achieving system performance depends on the construction of a decoder that implements a true bipolar correlation using only unipolar signals and intensity detection for each band. We took advantage of the phase delay characteristics of LCMs to construct a prototype optical coder/decoder (codec). Matched and unmatched Walsh signature codes were evaluated to detect correlations among multiuser data in the access network. By using LCMs, a red and green laser light source was spectrally encoded and the summed light dots were complementary decoded. Favorable contrast on auto- and cross-correlations indicates that binary information symbols can be properly recovered using a balanced photodetector.

  8. Topology-selective jamming of fully-connected, code-division random-access networks

    Science.gov (United States)

    Polydoros, Andreas; Cheng, Unjeng

    1990-01-01

    The purpose is to introduce certain models of topology selective stochastic jamming and examine its impact on a class of fully-connected, spread-spectrum, slotted ALOHA-type random access networks. The theory covers dedicated as well as half-duplex units. The dominant role of the spatial duty factor is established, and connections with the dual concept of time selective jamming are discussed. The optimal choices of coding rate and link access parameters (from the users' side) and the jamming spatial fraction are numerically established for DS and FH spreading.

  9. THE OPTIMAL CONTROL IN THE MODELOF NETWORK SECURITY FROM MALICIOUS CODE

    Directory of Open Access Journals (Sweden)

    2016-01-01

    Full Text Available The paper deals with a mathematical model of network security. The model is described in terms of the nonlinear optimal control. As a criterion of the control problem quality the price of the summary damage inflicted by the harmful codes is chosen, under additional restriction: the number of recovered nodes is maximized. The Pontryagin maximum principle for construction of the optimal decisions is formulated. The number of switching points of the optimal control is found. The explicit form of optimal control is given using the Lagrange multipliers method.

  10. CEASEMT system: the COCO code. Automatic network of planar and three-dimensional structures

    International Nuclear Information System (INIS)

    Charras, Thierry; Hoffmann, Alain.

    1977-01-01

    COCO is a code written in Fortran IV for IBM 360; it is intended to meshing bi- or tri-dimensional structures: planar structures, shells and beams, pipes in space. The existence of a real language makes possible a simple flexible use of COCO. Due to its modular structure COCO can incorporate new feasibilities if needed. The elements can have 2, 3, 4, 6, 8, 15, 20 vertices at will. COCO makes it possible to divide the network of the structure in independent sectors and gather them together through new numbering. Partial results can be verified at any time by listing or displaying them on a cathode screen [fr

  11. Fixed capacity and variable member grouping assignment of orthogonal variable spreading factor code tree for code division multiple access networks

    Directory of Open Access Journals (Sweden)

    Vipin Balyan

    2014-08-01

    Full Text Available Orthogonal variable spreading factor codes are used in the downlink to maintain the orthogonality between different channels and are used to handle new calls arriving in the system. A period of operation leads to fragmentation of vacant codes. This leads to code blocking problem. The assignment scheme proposed in this paper is not affected by fragmentation, as the fragmentation is generated by the scheme itself. In this scheme, the code tree is divided into groups whose capacity is fixed and numbers of members (codes are variable. A group with maximum number of busy members is used for assignment, this leads to fragmentation of busy groups around code tree and compactness within group. The proposed scheme is well evaluated and compared with other schemes using parameters like code blocking probability and call establishment delay. Through simulations it has been demonstrated that the proposed scheme not only adequately reduces code blocking probability, but also requires significantly less time before assignment to locate a vacant code for assignment, which makes it suitable for the real-time calls.

  12. Review of the Monte Carlo and deterministic codes in radiation protection and dosimetry

    Energy Technology Data Exchange (ETDEWEB)

    Tagziria, H

    2000-02-01

    Monte Carlo technique is that the solutions are given at specific locations only, are statistically fluctuating and are arrived at with lots of computer effort. Sooner rather than later, however, one would expect that powerful variance reductions and ever-faster processor machines would balance these disadvantages out. This is especially true if one considers the rapid advances in computer technology and parallel computers, which can achieve a 300, fold faster convergence. In many fields and cases the user would, however, benefit greatly by considering when possible alternative methods to the Monte Carlo technique, such as deterministic methods, at least as a way of validation. It can be shown in fact, that for less complex problems a deterministic approach can have many advantages. In its earlier manifestations, Monte Carlo simulation was primarily performed by experts who were intimately involved in the development of the computer code. Increasingly, however, codes are being supplied as relatively user-friendly packages for widespread use, which allows them to be used by those with less specialist knowledge. This enables them to be used as 'black boxes', which in turn provides scope for costly errors, especially in the choice of cross section data and accelerator techniques. The Monte Carlo method as employed with modem computers goes back several decades, and nowadays science and software libraries would be virtually empty if one excluded work that is either directly or indirectly related to this technique. This is specifically true in the fields of 'computational dosimetry', 'radiation protection' and radiation transport in general. Hundreds of codes have been written and applied with various degrees of success. Some of these have become trademarks, generally well supported and taken over by the thousands of users. Other codes, which should be encouraged, are the so-called in house codes, which still serve well their developers

  13. On network coding and modulation mapping for three-phase bidirectional relaying

    KAUST Repository

    Chang, Ronald Y.; Lin, Sian Jheng; Chung, Wei-Ho

    2015-01-01

    © 2015 IEEE. In this paper, we consider the network coding (NC) enabled three-phase protocol for information exchange between two users in a wireless two-way (bidirectional) relay network. Modulo-based (nonbinary) and XOR-based (binary) NC schemes are considered as information mixture schemes at the relay while all transmissions adopt pulse amplitude modulation (PAM). We first obtain the optimal constellation mapping at the relay that maximizes the decoding performance at the users for each NC scheme. Then, we compare the two NC schemes, each in conjunction with the optimal constellation mapping at the relay, in different conditions. Our results demonstrate that, in the low SNR regime, binary NC outperforms nonbinary NC with 4-PAM, while they have mixed performance with 8-PAM. This observation applies to quadrature amplitude modulation (QAM) composed of two parallel PAMs.

  14. Random Linear Network Coding is Key to Data Survival in Highly Dynamic Distributed Storage

    DEFF Research Database (Denmark)

    Sipos, Marton A.; Fitzek, Frank; Roetter, Daniel Enrique Lucani

    2015-01-01

    Distributed storage solutions have become widespread due to their ability to store large amounts of data reliably across a network of unreliable nodes, by employing repair mechanisms to prevent data loss. Conventional systems rely on static designs with a central control entity to oversee...... and control the repair process. Given the large costs for maintaining and cooling large data centers, our work proposes and studies the feasibility of a fully decentralized systems that can store data even on unreliable and, sometimes, unavailable mobile devices. This imposes new challenges on the design...... as the number of available nodes varies greatly over time and keeping track of the system's state becomes unfeasible. As a consequence, conventional erasure correction approaches are ill-suited for maintaining data integrity. In this highly dynamic context, random linear network coding (RLNC) provides...

  15. On the Coded Packet Relay Network in the Presence of Neighbors

    DEFF Research Database (Denmark)

    Khamfroush, Hana; Pahlevani, Peyman; Roetter, Daniel Enrique Lucani

    2014-01-01

    This paper studies the problem of optimal use of a relay for reducing the transmission time of data packets from a source to a destination using network coding. More importantly, we address an effect that is typically overlooked in previous studies: the presence of active transmitting nodes...... in the neighborhood of such devices, which is typical in wireless mesh networks. We show that in systems with a fair medium access control mechanism (MAC), the use of a relay in a crowded medium brings forth considerable and unforeseen improvements, including up to 3.5x gains in terms of throughput compared to using...... only the direct link in some of our examples, and a considerable extension of the operating region where using a relay is beneficial. The problem is formulated as a Markov Decision Process (MDP) and numerical results are provided comparing simple, close–to–optimal heuristics to the optimal scheme....

  16. Modelling and Simulation of National Electronic Product Code Network Demonstrator Project

    Science.gov (United States)

    Mo, John P. T.

    The National Electronic Product Code (EPC) Network Demonstrator Project (NDP) was the first large scale consumer goods track and trace investigation in the world using full EPC protocol system for applying RFID technology in supply chains. The NDP demonstrated the methods of sharing information securely using EPC Network, providing authentication to interacting parties, and enhancing the ability to track and trace movement of goods within the entire supply chain involving transactions among multiple enterprise. Due to project constraints, the actual run of the NDP was 3 months only and was unable to consolidate with quantitative results. This paper discusses the modelling and simulation of activities in the NDP in a discrete event simulation environment and provides an estimation of the potential benefits that can be derived from the NDP if it was continued for one whole year.

  17. Rack Aware Data Placement for Network Consumption in Erasure-Coded Clustered Storage Systems

    Directory of Open Access Journals (Sweden)

    Bilin Shao

    2018-06-01

    Full Text Available The amount of encoded data replication in an erasure-coded clustered storage system has a great impact on the bandwidth consumption and network latency, mostly during data reconstruction. Aimed at the reasons that lead to the excess data transmission between racks, a rack aware data block placement method is proposed. In order to ensure rack-level fault tolerance and reduce the frequency and amount of the cross-rack data transmission during data reconstruction, the method deploys partial data block concentration to store the data blocks of a file in fewer racks. Theoretical analysis and simulation results show that our proposed strategy greatly reduces the frequency and data volume of the cross-rack transmission during data reconstruction. At the same time, it has better performance than the typical random distribution method in terms of network usage and data reconstruction efficiency.

  18. Implementation of Finite Volume based Navier Stokes Algorithm Within General Purpose Flow Network Code

    Science.gov (United States)

    Schallhorn, Paul; Majumdar, Alok

    2012-01-01

    This paper describes a finite volume based numerical algorithm that allows multi-dimensional computation of fluid flow within a system level network flow analysis. There are several thermo-fluid engineering problems where higher fidelity solutions are needed that are not within the capacity of system level codes. The proposed algorithm will allow NASA's Generalized Fluid System Simulation Program (GFSSP) to perform multi-dimensional flow calculation within the framework of GFSSP s typical system level flow network consisting of fluid nodes and branches. The paper presents several classical two-dimensional fluid dynamics problems that have been solved by GFSSP's multi-dimensional flow solver. The numerical solutions are compared with the analytical and benchmark solution of Poiseulle, Couette and flow in a driven cavity.

  19. On network coding and modulation mapping for three-phase bidirectional relaying

    KAUST Repository

    Chang, Ronald Y.

    2015-12-03

    © 2015 IEEE. In this paper, we consider the network coding (NC) enabled three-phase protocol for information exchange between two users in a wireless two-way (bidirectional) relay network. Modulo-based (nonbinary) and XOR-based (binary) NC schemes are considered as information mixture schemes at the relay while all transmissions adopt pulse amplitude modulation (PAM). We first obtain the optimal constellation mapping at the relay that maximizes the decoding performance at the users for each NC scheme. Then, we compare the two NC schemes, each in conjunction with the optimal constellation mapping at the relay, in different conditions. Our results demonstrate that, in the low SNR regime, binary NC outperforms nonbinary NC with 4-PAM, while they have mixed performance with 8-PAM. This observation applies to quadrature amplitude modulation (QAM) composed of two parallel PAMs.

  20. Code of Practice for Protection Against Ionizing Radiation Emitted from X-ray Analysis Equipment (1984)

    International Nuclear Information System (INIS)

    1984-01-01

    Appropriate working rules, safety features and monitoring requirements for general X-ray analysis units or equipment are laid down in this Code which is intended for users of such equipment. The Code advises that establishments draw up their own working procedures based on appropriate legislation and on the recommendations contained in this Code. The Code also describes the requirements for X-ray analysis equipment necessary to ensure safety. (NEA) [fr

  1. Research for the Influence of Distribution Network Line Reclosing Current on Line Protection

    Directory of Open Access Journals (Sweden)

    Yu Kansheng

    2016-01-01

    Full Text Available According to the distribution network line structure and reclosing control strategy, the system simulation model of distribution network lines has established based on the real-time digital simulation RTDS. Based on this, distribution network switching impulse current characteristic has researched with different capacity, different distribution and different load power factor under the different voltage switching angles. The results of the study provide a scientific basis for distribution network line protection setting, in order to further lay the foundation for improvement the validity and reliability of distribution network line protection action.

  2. Impact of distributed generation units with power electronic converters on distribution network protection

    NARCIS (Netherlands)

    Morren, J.; Haan, de S.W.H.

    2008-01-01

    An increasing number of distributed generation units (DG units) are connected to the distribution network. These generators affect the operation and coordination of the distribution network protection. The influence from DG units that are coupled to the network with a power electronic converter

  3. Novel mechanism of network protection against the new generation of cyber attacks

    Science.gov (United States)

    Milovanov, Alexander; Bukshpun, Leonid; Pradhan, Ranjit

    2012-06-01

    A new intelligent mechanism is presented to protect networks against the new generation of cyber attacks. This mechanism integrates TCP/UDP/IP protocol stack protection and attacker/intruder deception to eliminate existing TCP/UDP/IP protocol stack vulnerabilities. It allows to detect currently undetectable, highly distributed, low-frequency attacks such as distributed denial-of-service (DDoS) attacks, coordinated attacks, botnet, and stealth network reconnaissance. The mechanism also allows insulating attacker/intruder from the network and redirecting the attack to a simulated network acting as a decoy. As a result, network security personnel gain sufficient time to defend the network and collect the attack information. The presented approach can be incorporated into wireless or wired networks that require protection against known and the new generation of cyber attacks.

  4. A Novel Cooperation-Based Network Coding Scheme for Walking Scenarios in WBANs

    Directory of Open Access Journals (Sweden)

    Hongyun Zhang

    2017-01-01

    Full Text Available In Wireless Body Area Networks (WBANs, the tradeoff between network throughput and energy efficiency remains a key challenge. Most current transmission schemes try to cope with the challenge from the perspective of general Wireless Sensor Networks (WSNs, which may not take the peculiarities of WBAN channels into account. In this paper, we take advantage of the correlation of on-body channels in walking scenarios to achieve a better tradeoff between throughput and energy consumption. We first analyze the characteristics of on-body channels based on realistic channel gain datasets, which are collected by our customized wireless transceivers in walking scenarios. The analytical results confirm the rationale of our newly proposed transmission scheme A3NC, which explores the combination of the aggregative allocation (AA mechanism in MAC layer and the Analog Network Coding (ANC technique in PHY layer. Both theoretical analyses and simulation results show that the A3NC scheme achieves significant improvement in upload throughput and energy efficiency, compared to the conventional approaches.

  5. A New Wavelength Optimization and Energy-Saving Scheme Based on Network Coding in Software-Defined WDM-PON Networks

    Science.gov (United States)

    Ren, Danping; Wu, Shanshan; Zhang, Lijing

    2016-09-01

    In view of the characteristics of the global control and flexible monitor of software-defined networks (SDN), we proposes a new optical access network architecture dedicated to Wavelength Division Multiplexing-Passive Optical Network (WDM-PON) systems based on SDN. The network coding (NC) technology is also applied into this architecture to enhance the utilization of wavelength resource and reduce the costs of light source. Simulation results show that this scheme can optimize the throughput of the WDM-PON network, greatly reduce the system time delay and energy consumption.

  6. NSDann2BS, a neutron spectrum unfolding code based on neural networks technology and two bonner spheres

    Science.gov (United States)

    Ortiz-Rodríguez, J. M.; Reyes Alfaro, A.; Reyes Haro, A.; Solís Sánches, L. O.; Miranda, R. Castañeda; Cervantes Viramontes, J. M.; Vega-Carrillo, H. R.

    2013-07-01

    In this work a neutron spectrum unfolding code, based on artificial intelligence technology is presented. The code called "Neutron Spectrometry and Dosimetry with Artificial Neural Networks and two Bonner spheres", (NSDann2BS), was designed in a graphical user interface under the LabVIEW programming environment. The main features of this code are to use an embedded artificial neural network architecture optimized with the "Robust design of artificial neural networks methodology" and to use two Bonner spheres as the only piece of information. In order to build the code here presented, once the net topology was optimized and properly trained, knowledge stored at synaptic weights was extracted and using a graphical framework build on the LabVIEW programming environment, the NSDann2BS code was designed. This code is friendly, intuitive and easy to use for the end user. The code is freely available upon request to authors. To demonstrate the use of the neural net embedded in the NSDann2BS code, the rate counts of 252Cf, 241AmBe and 239PuBe neutron sources measured with a Bonner spheres system.

  7. NSDann2BS, a neutron spectrum unfolding code based on neural networks technology and two bonner spheres

    International Nuclear Information System (INIS)

    Ortiz-Rodríguez, J. M.; Reyes Alfaro, A.; Reyes Haro, A.; Solís Sánches, L. O.; Miranda, R. Castañeda; Cervantes Viramontes, J. M.; Vega-Carrillo, H. R.

    2013-01-01

    In this work a neutron spectrum unfolding code, based on artificial intelligence technology is presented. The code called ''Neutron Spectrometry and Dosimetry with Artificial Neural Networks and two Bonner spheres'', (NSDann2BS), was designed in a graphical user interface under the LabVIEW programming environment. The main features of this code are to use an embedded artificial neural network architecture optimized with the ''Robust design of artificial neural networks methodology'' and to use two Bonner spheres as the only piece of information. In order to build the code here presented, once the net topology was optimized and properly trained, knowledge stored at synaptic weights was extracted and using a graphical framework build on the LabVIEW programming environment, the NSDann2BS code was designed. This code is friendly, intuitive and easy to use for the end user. The code is freely available upon request to authors. To demonstrate the use of the neural net embedded in the NSDann2BS code, the rate counts of 252 Cf, 241 AmBe and 239 PuBe neutron sources measured with a Bonner spheres system

  8. NSDann2BS, a neutron spectrum unfolding code based on neural networks technology and two bonner spheres

    Energy Technology Data Exchange (ETDEWEB)

    Ortiz-Rodriguez, J. M.; Reyes Alfaro, A.; Reyes Haro, A.; Solis Sanches, L. O.; Miranda, R. Castaneda; Cervantes Viramontes, J. M. [Universidad Autonoma de Zacatecas, Unidad Academica de Ingenieria Electrica. Av. Ramon Lopez Velarde 801. Col. Centro Zacatecas, Zac (Mexico); Vega-Carrillo, H. R. [Universidad Autonoma de Zacatecas, Unidad Academica de Ingenieria Electrica. Av. Ramon Lopez Velarde 801. Col. Centro Zacatecas, Zac., Mexico. and Unidad Academica de Estudios Nucleares. C. Cip (Mexico)

    2013-07-03

    In this work a neutron spectrum unfolding code, based on artificial intelligence technology is presented. The code called ''Neutron Spectrometry and Dosimetry with Artificial Neural Networks and two Bonner spheres'', (NSDann2BS), was designed in a graphical user interface under the LabVIEW programming environment. The main features of this code are to use an embedded artificial neural network architecture optimized with the ''Robust design of artificial neural networks methodology'' and to use two Bonner spheres as the only piece of information. In order to build the code here presented, once the net topology was optimized and properly trained, knowledge stored at synaptic weights was extracted and using a graphical framework build on the LabVIEW programming environment, the NSDann2BS code was designed. This code is friendly, intuitive and easy to use for the end user. The code is freely available upon request to authors. To demonstrate the use of the neural net embedded in the NSDann2BS code, the rate counts of {sup 252}Cf, {sup 241}AmBe and {sup 239}PuBe neutron sources measured with a Bonner spheres system.

  9. SOMM: A new service oriented middleware for generic wireless multimedia sensor networks based on code mobility.

    Science.gov (United States)

    Faghih, Mohammad Mehdi; Moghaddam, Mohsen Ebrahimi

    2011-01-01

    Although much research in the area of Wireless Multimedia Sensor Networks (WMSNs) has been done in recent years, the programming of sensor nodes is still time-consuming and tedious. It requires expertise in low-level programming, mainly because of the use of resource constrained hardware and also the low level API provided by current operating systems. The code of the resulting systems has typically no clear separation between application and system logic. This minimizes the possibility of reusing code and often leads to the necessity of major changes when the underlying platform is changed. In this paper, we present a service oriented middleware named SOMM to support application development for WMSNs. The main goal of SOMM is to enable the development of modifiable and scalable WMSN applications. A network which uses the SOMM is capable of providing multiple services to multiple clients at the same time with the specified Quality of Service (QoS). SOMM uses a virtual machine with the ability to support mobile agents. Services in SOMM are provided by mobile agents and SOMM also provides a t space on each node which agents can use to communicate with each other.

  10. Comprehensive Reconstruction and Visualization of Non-Coding Regulatory Networks in Human

    Science.gov (United States)

    Bonnici, Vincenzo; Russo, Francesco; Bombieri, Nicola; Pulvirenti, Alfredo; Giugno, Rosalba

    2014-01-01

    Research attention has been powered to understand the functional roles of non-coding RNAs (ncRNAs). Many studies have demonstrated their deregulation in cancer and other human disorders. ncRNAs are also present in extracellular human body fluids such as serum and plasma, giving them a great potential as non-invasive biomarkers. However, non-coding RNAs have been relatively recently discovered and a comprehensive database including all of them is still missing. Reconstructing and visualizing the network of ncRNAs interactions are important steps to understand their regulatory mechanism in complex systems. This work presents ncRNA-DB, a NoSQL database that integrates ncRNAs data interactions from a large number of well established on-line repositories. The interactions involve RNA, DNA, proteins, and diseases. ncRNA-DB is available at http://ncrnadb.scienze.univr.it/ncrnadb/. It is equipped with three interfaces: web based, command-line, and a Cytoscape app called ncINetView. By accessing only one resource, users can search for ncRNAs and their interactions, build a network annotated with all known ncRNAs and associated diseases, and use all visual and mining features available in Cytoscape. PMID:25540777

  11. Comprehensive reconstruction and visualization of non-coding regulatory networks in human.

    Science.gov (United States)

    Bonnici, Vincenzo; Russo, Francesco; Bombieri, Nicola; Pulvirenti, Alfredo; Giugno, Rosalba

    2014-01-01

    Research attention has been powered to understand the functional roles of non-coding RNAs (ncRNAs). Many studies have demonstrated their deregulation in cancer and other human disorders. ncRNAs are also present in extracellular human body fluids such as serum and plasma, giving them a great potential as non-invasive biomarkers. However, non-coding RNAs have been relatively recently discovered and a comprehensive database including all of them is still missing. Reconstructing and visualizing the network of ncRNAs interactions are important steps to understand their regulatory mechanism in complex systems. This work presents ncRNA-DB, a NoSQL database that integrates ncRNAs data interactions from a large number of well established on-line repositories. The interactions involve RNA, DNA, proteins, and diseases. ncRNA-DB is available at http://ncrnadb.scienze.univr.it/ncrnadb/. It is equipped with three interfaces: web based, command-line, and a Cytoscape app called ncINetView. By accessing only one resource, users can search for ncRNAs and their interactions, build a network annotated with all known ncRNAs and associated diseases, and use all visual and mining features available in Cytoscape.

  12. 10 CFR 73.54 - Protection of digital computer and communication systems and networks.

    Science.gov (United States)

    2010-01-01

    ... 10 Energy 2 2010-01-01 2010-01-01 false Protection of digital computer and communication systems and networks. 73.54 Section 73.54 Energy NUCLEAR REGULATORY COMMISSION (CONTINUED) PHYSICAL PROTECTION... security program as a component of the physical protection program. (c) The cyber security program must be...

  13. Coding the presence of visual objects in a recurrent neural network of visual cortex.

    Science.gov (United States)

    Zwickel, Timm; Wachtler, Thomas; Eckhorn, Reinhard

    2007-01-01

    Before we can recognize a visual object, our visual system has to segregate it from its background. This requires a fast mechanism for establishing the presence and location of objects independently of their identity. Recently, border-ownership neurons were recorded in monkey visual cortex which might be involved in this task [Zhou, H., Friedmann, H., von der Heydt, R., 2000. Coding of border ownership in monkey visual cortex. J. Neurosci. 20 (17), 6594-6611]. In order to explain the basic mechanisms required for fast coding of object presence, we have developed a neural network model of visual cortex consisting of three stages. Feed-forward and lateral connections support coding of Gestalt properties, including similarity, good continuation, and convexity. Neurons of the highest area respond to the presence of an object and encode its position, invariant of its form. Feedback connections to the lowest area facilitate orientation detectors activated by contours belonging to potential objects, and thus generate the experimentally observed border-ownership property. This feedback control acts fast and significantly improves the figure-ground segregation required for the consecutive task of object recognition.

  14. Phonion: Practical Protection of Metadata in Telephony Networks

    Directory of Open Access Journals (Sweden)

    Heuser Stephan

    2017-01-01

    Full Text Available The majority of people across the globe rely on telephony networks as their primary means of communication. As such, many of the most sensitive personal, corporate and government related communications pass through these systems every day. Unsurprisingly, such connections are subject to a wide range of attacks. Of increasing concern is the use of metadata contained in Call Detail Records (CDRs, which contain source, destination, start time and duration of a call. This information is potentially dangerous as the very act of two parties communicating can reveal significant details about their relationship and put them in the focus of targeted observation or surveillance, which is highly critical especially for journalists and activists. To address this problem, we develop the Phonion architecture to frustrate such attacks by separating call setup functions from call delivery. Specifically, Phonion allows users to preemptively establish call circuits across multiple providers and technologies before dialing into the circuit and does not require constant Internet connectivity. Since no single carrier can determine the ultimate destination of the call, it provides unlinkability for its users and helps them to avoid passive surveillance. We define and discuss a range of adversary classes and analyze why current obfuscation technologies fail to protect users against such metadata attacks. In our extensive evaluation we further analyze advanced anonymity technologies (e.g., VoIP over Tor, which do not preserve our functional requirements for high voice quality in the absence of constant broadband Internet connectivity and compatibility with landline and feature phones. Phonion is the first practical system to provide guarantees of unlinkable communication against a range of practical adversaries in telephony systems.

  15. Bearing performance degradation assessment based on time-frequency code features and SOM network

    International Nuclear Information System (INIS)

    Zhang, Yan; Tang, Baoping; Han, Yan; Deng, Lei

    2017-01-01

    Bearing performance degradation assessment and prognostics are extremely important in supporting maintenance decision and guaranteeing the system’s reliability. To achieve this goal, this paper proposes a novel feature extraction method for the degradation assessment and prognostics of bearings. Features of time-frequency codes (TFCs) are extracted from the time-frequency distribution using a hybrid procedure based on short-time Fourier transform (STFT) and non-negative matrix factorization (NMF) theory. An alternative way to design the health indicator is investigated by quantifying the similarity between feature vectors using a self-organizing map (SOM) network. On the basis of this idea, a new health indicator called time-frequency code quantification error (TFCQE) is proposed to assess the performance degradation of the bearing. This indicator is constructed based on the bearing real-time behavior and the SOM model that is previously trained with only the TFC vectors under the normal condition. Vibration signals collected from the bearing run-to-failure tests are used to validate the developed method. The comparison results demonstrate the superiority of the proposed TFCQE indicator over many other traditional features in terms of feature quality metrics, incipient degradation identification and achieving accurate prediction. Highlights • Time-frequency codes are extracted to reflect the signals’ characteristics. • SOM network served as a tool to quantify the similarity between feature vectors. • A new health indicator is proposed to demonstrate the whole stage of degradation development. • The method is useful for extracting the degradation features and detecting the incipient degradation. • The superiority of the proposed method is verified using experimental data. (paper)

  16. Optimal power allocation and joint source-channel coding for wireless DS-CDMA visual sensor networks

    Science.gov (United States)

    Pandremmenou, Katerina; Kondi, Lisimachos P.; Parsopoulos, Konstantinos E.

    2011-01-01

    In this paper, we propose a scheme for the optimal allocation of power, source coding rate, and channel coding rate for each of the nodes of a wireless Direct Sequence Code Division Multiple Access (DS-CDMA) visual sensor network. The optimization is quality-driven, i.e. the received quality of the video that is transmitted by the nodes is optimized. The scheme takes into account the fact that the sensor nodes may be imaging scenes with varying levels of motion. Nodes that image low-motion scenes will require a lower source coding rate, so they will be able to allocate a greater portion of the total available bit rate to channel coding. Stronger channel coding will mean that such nodes will be able to transmit at lower power. This will both increase battery life and reduce interference to other nodes. Two optimization criteria are considered. One that minimizes the average video distortion of the nodes and one that minimizes the maximum distortion among the nodes. The transmission powers are allowed to take continuous values, whereas the source and channel coding rates can assume only discrete values. Thus, the resulting optimization problem lies in the field of mixed-integer optimization tasks and is solved using Particle Swarm Optimization. Our experimental results show the importance of considering the characteristics of the video sequences when determining the transmission power, source coding rate and channel coding rate for the nodes of the visual sensor network.

  17. Measuring the effectiveness of protected area networks in reducing deforestation.

    Science.gov (United States)

    Andam, Kwaw S; Ferraro, Paul J; Pfaff, Alexander; Sanchez-Azofeifa, G Arturo; Robalino, Juan A

    2008-10-21

    Global efforts to reduce tropical deforestation rely heavily on the establishment of protected areas. Measuring the effectiveness of these areas is difficult because the amount of deforestation that would have occurred in the absence of legal protection cannot be directly observed. Conventional methods of evaluating the effectiveness of protected areas can be biased because protection is not randomly assigned and because protection can induce deforestation spillovers (displacement) to neighboring forests. We demonstrate that estimates of effectiveness can be substantially improved by controlling for biases along dimensions that are observable, measuring spatial spillovers, and testing the sensitivity of estimates to potential hidden biases. We apply matching methods to evaluate the impact on deforestation of Costa Rica's renowned protected-area system between 1960 and 1997. We find that protection reduced deforestation: approximately 10% of the protected forests would have been deforested had they not been protected. Conventional approaches to evaluating conservation impact, which fail to control for observable covariates correlated with both protection and deforestation, substantially overestimate avoided deforestation (by over 65%, based on our estimates). We also find that deforestation spillovers from protected to unprotected forests are negligible. Our conclusions are robust to potential hidden bias, as well as to changes in modeling assumptions. Our results show that, with appropriate empirical methods, conservation scientists and policy makers can better understand the relationships between human and natural systems and can use this to guide their attempts to protect critical ecosystem services.

  18. Study on the overcurrent character analysis and its protective system of underground LV distribution networks

    Energy Technology Data Exchange (ETDEWEB)

    Song, J.; Shi, Z.; Yang, Y.; Shi, W.; Wei, H.; Zhai, S.; Xie, H. [Taiyuan University of Technology, Taiyuan (China)

    2001-02-01

    The overcurrent fault characteristics in underground LV cable distribution networks is analysed and the fundamental principle of overcurrent protective system is described in this paper. The emphasis is paid to the determination of the characteristic curves of phase-sensitive symmetrical short-circuit protection, the design of negative-sequence current filter and the definition of the mathematical model of overload. Besides, the hardware block diagram and the software flowchart of the protective system, which is controlled by a single chip microcomputer, is also introduced in the paper. The protective system was tested before being applied to the underground LV distribution networks. The results obtained are in conformity with the design specification. It has been verified that the protective distance is extended and the protective sensitivity is improved with the protective system. The field experience has shown that the protective system is stable and reliable, and will be of great application value in the mining industry. 7 refs., 5 figs., 2 tabs.

  19. A Game Theoretic Approach to Minimize the Completion Time of Network Coded Cooperative Data Exchange

    KAUST Repository

    Douik, Ahmed S.

    2014-05-11

    In this paper, we introduce a game theoretic framework for studying the problem of minimizing the completion time of instantly decodable network coding (IDNC) for cooperative data exchange (CDE) in decentralized wireless network. In this configuration, clients cooperate with each other to recover the erased packets without a central controller. Game theory is employed herein as a tool for improving the distributed solution by overcoming the need for a central controller or additional signaling in the system. We model the session by self-interested players in a non-cooperative potential game. The utility function is designed such that increasing individual payoff results in a collective behavior achieving both a desirable system performance in a shared network environment and the Pareto optimal solution. Through extensive simulations, our approach is compared to the best performance that could be found in the conventional point-to-multipoint (PMP) recovery process. Numerical results show that our formulation largely outperforms the conventional PMP scheme in most practical situations and achieves a lower delay.

  20. A Game Theoretic Approach to Minimize the Completion Time of Network Coded Cooperative Data Exchange

    KAUST Repository

    Douik, Ahmed S.; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim; Sorour, Sameh; Tembine, Hamidou

    2014-01-01

    In this paper, we introduce a game theoretic framework for studying the problem of minimizing the completion time of instantly decodable network coding (IDNC) for cooperative data exchange (CDE) in decentralized wireless network. In this configuration, clients cooperate with each other to recover the erased packets without a central controller. Game theory is employed herein as a tool for improving the distributed solution by overcoming the need for a central controller or additional signaling in the system. We model the session by self-interested players in a non-cooperative potential game. The utility function is designed such that increasing individual payoff results in a collective behavior achieving both a desirable system performance in a shared network environment and the Pareto optimal solution. Through extensive simulations, our approach is compared to the best performance that could be found in the conventional point-to-multipoint (PMP) recovery process. Numerical results show that our formulation largely outperforms the conventional PMP scheme in most practical situations and achieves a lower delay.

  1. Secure Communications in High Speed Fiber Optical Networks Using Code Division Multiple Access (CDMA) Transmission

    Energy Technology Data Exchange (ETDEWEB)

    Han, I; Bond, S; Welty, R; Du, Y; Yoo, S; Reinhardt, C; Behymer, E; Sperry, V; Kobayashi, N

    2004-02-12

    This project is focused on the development of advanced components and system technologies for secure data transmission on high-speed fiber optic data systems. This work capitalizes on (1) a strong relationship with outstanding faculty at the University of California-Davis who are experts in high speed fiber-optic networks, (2) the realization that code division multiple access (CDMA) is emerging as a bandwidth enhancing technique for fiber optic networks, (3) the realization that CDMA of sufficient complexity forms the basis for almost unbreakable one-time key transmissions, (4) our concepts for superior components for implementing CDMA, (5) our expertise in semiconductor device processing and (6) our Center for Nano and Microtechnology, which is where the majority of the experimental work was done. Here we present a novel device concept, which will push the limits of current technology, and will simultaneously solve system implementation issues by investigating new state-of-the-art fiber technologies. This will enable the development of secure communication systems for the transmission and reception of messages on deployed commercial fiber optic networks, through the CDMA phase encoding of broad bandwidth pulses. CDMA technology has been developed as a multiplexing technology, much like wavelength division multiplexing (WDM) or time division multiplexing (TDM), to increase the potential number of users on a given communication link. A novel application of the techniques created for CDMA is to generate secure communication through physical layer encoding. Physical layer encoding devices are developed which utilize semiconductor waveguides with fast carrier response times to phase encode spectral components of a secure signal. Current commercial technology, most commonly a spatial light modulator, allows phase codes to be changed at rates of only 10's of Hertz ({approx}25ms response). The use of fast (picosecond to nanosecond) carrier dynamics of semiconductors

  2. Contaminant transport in fracture networks with heterogeneous rock matrices. The Picnic code

    International Nuclear Information System (INIS)

    Barten, Werner; Robinson, Peter C.

    2001-02-01

    In the context of safety assessment of radioactive waste repositories, complex radionuclide transport models covering key safety-relevant processes play a major role. In recent Swiss safety assessments, such as Kristallin-I, an important drawback was the limitation in geosphere modelling capability to account for geosphere heterogeneities. In marked contrast to this limitation in modelling capabilities, great effort has been put into investigating the heterogeneity of the geosphere as it impacts on hydrology. Structural geological methods have been used to look at the geometry of the flow paths on a small scale and the diffusion and sorption properties of different rock materials have been investigated. This huge amount of information could however be only partially applied in geosphere transport modelling. To make use of these investigations the 'PICNIC project' was established as a joint cooperation of PSI/Nagra and QuantiSci to provide a new geosphere transport model for Swiss safety assessment of radioactive waste repositories. The new transport code, PICNIC, can treat all processes considered in the older geosphere model RANCH MD generally used in the Kristallin-I study and, in addition, explicitly accounts for the heterogeneity of the geosphere on different spatial scales. The effects and transport phenomena that can be accounted for by PICNIC are a combination of (advective) macro-dispersion due to transport in a network of conduits (legs), micro-dispersion in single legs, one-dimensional or two-dimensional matrix diffusion into a wide range of homogeneous and heterogeneous rock matrix geometries, linear sorption of nuclides in the flow path and the rock matrix and radioactive decay and ingrowth in the case of nuclide chains. Analytical and numerical Laplace transformation methods are integrated in a newly developed hierarchical linear response concept to efficiently account for the transport mechanisms considered which typically act on extremely different

  3. Contaminant transport in fracture networks with heterogeneous rock matrices. The Picnic code

    Energy Technology Data Exchange (ETDEWEB)

    Barten, Werner [Paul Scherrer Inst., CH-5232 Villigen PSI (Switzerland); Robinson, Peter C. [QuantiSci Limited, Henley-on-Thames (United Kingdom)

    2001-02-01

    In the context of safety assessment of radioactive waste repositories, complex radionuclide transport models covering key safety-relevant processes play a major role. In recent Swiss safety assessments, such as Kristallin-I, an important drawback was the limitation in geosphere modelling capability to account for geosphere heterogeneities. In marked contrast to this limitation in modelling capabilities, great effort has been put into investigating the heterogeneity of the geosphere as it impacts on hydrology. Structural geological methods have been used to look at the geometry of the flow paths on a small scale and the diffusion and sorption properties of different rock materials have been investigated. This huge amount of information could however be only partially applied in geosphere transport modelling. To make use of these investigations the 'PICNIC project' was established as a joint cooperation of PSI/Nagra and QuantiSci to provide a new geosphere transport model for Swiss safety assessment of radioactive waste repositories. The new transport code, PICNIC, can treat all processes considered in the older geosphere model RANCH MD generally used in the Kristallin-I study and, in addition, explicitly accounts for the heterogeneity of the geosphere on different spatial scales. The effects and transport phenomena that can be accounted for by PICNIC are a combination of (advective) macro-dispersion due to transport in a network of conduits (legs), micro-dispersion in single legs, one-dimensional or two-dimensional matrix diffusion into a wide range of homogeneous and heterogeneous rock matrix geometries, linear sorption of nuclides in the flow path and the rock matrix and radioactive decay and ingrowth in the case of nuclide chains. Analytical and numerical Laplace transformation methods are integrated in a newly developed hierarchical linear response concept to efficiently account for the transport mechanisms considered which typically act on extremely

  4. Multiple-valued logic-protected coding for an optical non-quantum communication line

    NARCIS (Netherlands)

    Antipov, A. L.; Bykovsky, A. Yu.; Vasiliev, N. A.; Egorov, A. A.

    2006-01-01

    A simple and cheap method of secret coding in an optical line is proposed based on multiple-valued logic. This method is shown to have very high cryptography resources and is designated for bidirectional information exchange in a team of mobile robots, where quantum teleportation coding cannot yet

  5. Instantly decodable network coding for real-time device-to-device communications

    KAUST Repository

    Douik, Ahmed

    2016-01-04

    This paper studies the delay reduction problem for instantly decodable network coding (IDNC)-based device-to-device (D2D) communication-enabled networks. Unlike conventional point-to-multipoint (PMP) systems in which the wireless base station has the sufficient computation abilities, D2D networks rely on battery-powered operations of the devices. Therefore, a particular emphasis on the computation complexity needs to be addressed in the design of delay reduction algorithms for D2D networks. While most of the existing literature on IDNC directly extend the delay reduction PMP schemes, known to be NP-hard, to the D2D setting, this paper proposes to investigate and minimize the complexity of such algorithms for battery-powered devices. With delay minimization problems in IDNC-based systems being equivalent to a maximum weight clique problems in the IDNC graph, the presented algorithms, in this paper, can be applied to different delay aspects. This paper introduces and focuses on the reduction of the maximum value of the decoding delay as it represents the most general solution. The complexity of the solution is reduced by first proposing efficient methods for the construction, the update, and the dimension reduction of the IDNC graph. The paper, further, shows that, under particular scenarios, the problem boils down to a maximum clique problem. Due to the complexity of discovering such maximum clique, the paper presents a fast selection algorithm. Simulation results illustrate the performance of the proposed schemes and suggest that the proposed fast selection algorithm provides appreciable complexity gain as compared to the optimal selection one, with a negligible degradation in performance. In addition, they indicate that the running time of the proposed solution is close to the random selection algorithm.

  6. Network protection against worms and cascading failures using modularity partitioning

    NARCIS (Netherlands)

    Omic, J.; Hernandez, J.M.; Van Mieghem, P.

    2010-01-01

    Communication networks are prone to virus and worms spreading and cascading failures. Recently, a number of social networking worms have spread over public Web sites. Another example is error propagation in routing tables, such as in BGP tables. The immunization and error curing applied to these

  7. Social Networks in the workplace - some data protection issues

    OpenAIRE

    Haynes, D.

    2011-01-01

    There are many benefits to be gained from using social networks in the workplace but there is a downside – a growing concern about privacy and misuse of personal information. Using the results from a survey he conducted to highlight the issues, David Haynes puts forward an approach to managing social networks through the introduction of organisational policy.

  8. Evaluating the performance of two neutron spectrum unfolding codes based on iterative procedures and artificial neural networks

    Energy Technology Data Exchange (ETDEWEB)

    Ortiz-Rodriguez, J. M.; Reyes Alfaro, A.; Reyes Haro, A.; Solis Sanches, L. O.; Miranda, R. Castaneda; Cervantes Viramontes, J. M. [Universidad Autonoma de Zacatecas, Unidad Academica de Ingenieria Electrica. Av. Ramon Lopez Velarde 801. Col. Centro Zacatecas, Zac (Mexico); Vega-Carrillo, H. R. [Universidad Autonoma de Zacatecas, Unidad Academica de Ingenieria Electrica. Av. Ramon Lopez Velarde 801. Col. Centro Zacatecas, Zac., Mexico. and Unidad Academica de Estudios Nucleares. C. Cip (Mexico)

    2013-07-03

    In this work the performance of two neutron spectrum unfolding codes based on iterative procedures and artificial neural networks is evaluated. The first one code based on traditional iterative procedures and called Neutron spectrometry and dosimetry from the Universidad Autonoma de Zacatecas (NSDUAZ) use the SPUNIT iterative algorithm and was designed to unfold neutron spectrum and calculate 15 dosimetric quantities and 7 IAEA survey meters. The main feature of this code is the automated selection of the initial guess spectrum trough a compendium of neutron spectrum compiled by the IAEA. The second one code known as Neutron spectrometry and dosimetry with artificial neural networks (NDSann) is a code designed using neural nets technology. The artificial intelligence approach of neural net does not solve mathematical equations. By using the knowledge stored at synaptic weights on a neural net properly trained, the code is capable to unfold neutron spectrum and to simultaneously calculate 15 dosimetric quantities, needing as entrance data, only the rate counts measured with a Bonner spheres system. Similarities of both NSDUAZ and NSDann codes are: they follow the same easy and intuitive user's philosophy and were designed in a graphical interface under the LabVIEW programming environment. Both codes unfold the neutron spectrum expressed in 60 energy bins, calculate 15 dosimetric quantities and generate a full report in HTML format. Differences of these codes are: NSDUAZ code was designed using classical iterative approaches and needs an initial guess spectrum in order to initiate the iterative procedure. In NSDUAZ, a programming routine was designed to calculate 7 IAEA instrument survey meters using the fluence-dose conversion coefficients. NSDann code use artificial neural networks for solving the ill-conditioned equation system of neutron spectrometry problem through synaptic weights of a properly trained neural network. Contrary to iterative procedures, in

  9. Evaluating the performance of two neutron spectrum unfolding codes based on iterative procedures and artificial neural networks

    Science.gov (United States)

    Ortiz-Rodríguez, J. M.; Reyes Alfaro, A.; Reyes Haro, A.; Solís Sánches, L. O.; Miranda, R. Castañeda; Cervantes Viramontes, J. M.; Vega-Carrillo, H. R.

    2013-07-01

    In this work the performance of two neutron spectrum unfolding codes based on iterative procedures and artificial neural networks is evaluated. The first one code based on traditional iterative procedures and called Neutron spectrometry and dosimetry from the Universidad Autonoma de Zacatecas (NSDUAZ) use the SPUNIT iterative algorithm and was designed to unfold neutron spectrum and calculate 15 dosimetric quantities and 7 IAEA survey meters. The main feature of this code is the automated selection of the initial guess spectrum trough a compendium of neutron spectrum compiled by the IAEA. The second one code known as Neutron spectrometry and dosimetry with artificial neural networks (NDSann) is a code designed using neural nets technology. The artificial intelligence approach of neural net does not solve mathematical equations. By using the knowledge stored at synaptic weights on a neural net properly trained, the code is capable to unfold neutron spectrum and to simultaneously calculate 15 dosimetric quantities, needing as entrance data, only the rate counts measured with a Bonner spheres system. Similarities of both NSDUAZ and NSDann codes are: they follow the same easy and intuitive user's philosophy and were designed in a graphical interface under the LabVIEW programming environment. Both codes unfold the neutron spectrum expressed in 60 energy bins, calculate 15 dosimetric quantities and generate a full report in HTML format. Differences of these codes are: NSDUAZ code was designed using classical iterative approaches and needs an initial guess spectrum in order to initiate the iterative procedure. In NSDUAZ, a programming routine was designed to calculate 7 IAEA instrument survey meters using the fluence-dose conversion coefficients. NSDann code use artificial neural networks for solving the ill-conditioned equation system of neutron spectrometry problem through synaptic weights of a properly trained neural network. Contrary to iterative procedures, in neural

  10. Evaluating the performance of two neutron spectrum unfolding codes based on iterative procedures and artificial neural networks

    International Nuclear Information System (INIS)

    Ortiz-Rodríguez, J. M.; Reyes Alfaro, A.; Reyes Haro, A.; Solís Sánches, L. O.; Miranda, R. Castañeda; Cervantes Viramontes, J. M.; Vega-Carrillo, H. R.

    2013-01-01

    In this work the performance of two neutron spectrum unfolding codes based on iterative procedures and artificial neural networks is evaluated. The first one code based on traditional iterative procedures and called Neutron spectrometry and dosimetry from the Universidad Autonoma de Zacatecas (NSDUAZ) use the SPUNIT iterative algorithm and was designed to unfold neutron spectrum and calculate 15 dosimetric quantities and 7 IAEA survey meters. The main feature of this code is the automated selection of the initial guess spectrum trough a compendium of neutron spectrum compiled by the IAEA. The second one code known as Neutron spectrometry and dosimetry with artificial neural networks (NDSann) is a code designed using neural nets technology. The artificial intelligence approach of neural net does not solve mathematical equations. By using the knowledge stored at synaptic weights on a neural net properly trained, the code is capable to unfold neutron spectrum and to simultaneously calculate 15 dosimetric quantities, needing as entrance data, only the rate counts measured with a Bonner spheres system. Similarities of both NSDUAZ and NSDann codes are: they follow the same easy and intuitive user's philosophy and were designed in a graphical interface under the LabVIEW programming environment. Both codes unfold the neutron spectrum expressed in 60 energy bins, calculate 15 dosimetric quantities and generate a full report in HTML format. Differences of these codes are: NSDUAZ code was designed using classical iterative approaches and needs an initial guess spectrum in order to initiate the iterative procedure. In NSDUAZ, a programming routine was designed to calculate 7 IAEA instrument survey meters using the fluence-dose conversion coefficients. NSDann code use artificial neural networks for solving the ill-conditioned equation system of neutron spectrometry problem through synaptic weights of a properly trained neural network. Contrary to iterative procedures, in neural

  11. Coding/decoding and reversibility of droplet trains in microfluidic networks.

    Science.gov (United States)

    Fuerstman, Michael J; Garstecki, Piotr; Whitesides, George M

    2007-02-09

    Droplets of one liquid suspended in a second, immiscible liquid move through a microfluidic device in which a channel splits into two branches that reconnect downstream. The droplets choose a path based on the number of droplets that occupy each branch. The interaction among droplets in the channels results in complex sequences of path selection. The linearity of the flow through the microchannels, however, ensures that the behavior of the system can be reversed. This reversibility makes it possible to encrypt and decrypt signals coded in the intervals between droplets. The encoding/decoding device is a functional microfluidic system that requires droplets to navigate a network in a precise manner without the use of valves, switches, or other means of external control.

  12. Synchronized Multimedia Streaming on the iPhone Platform with Network Coding

    DEFF Research Database (Denmark)

    Vingelmann, Peter; Fitzek, Frank; Pedersen, Morten Videbæk

    2011-01-01

    on the iPhone that use point-to-point architectures. After acknowledging their limitations, we propose a solution based on network coding to efficiently and reliably deliver the multimedia content to many devices in a synchronized manner. Then we introduce an application that implements this technique......This work presents the implementation of synchronized multimedia streaming for the Apple iPhone platform. The idea is to stream multimedia content from a single source to multiple receivers with direct or multihop connections to the source. First we look into existing solutions for video streaming...... on the iPhone. We also present our testbed, which consists of 16 iPod Touch devices to showcase the capabilities of our application....

  13. Dynamic Allocation and Efficient Distribution of Data Among Multiple Clouds Using Network Coding

    DEFF Research Database (Denmark)

    Sipos, Marton A.; Fitzek, Frank; Roetter, Daniel Enrique Lucani

    2014-01-01

    Distributed storage has attracted large interest lately from both industry and researchers as a flexible, cost-efficient, high performance, and potentially secure solution for geographically distributed data centers, edge caching or sharing storage among users. This paper studies the benefits...... of random linear network coding to exploit multiple commercially available cloud storage providers simultaneously with the possibility to constantly adapt to changing cloud performance in order to optimize data retrieval times. The main contribution of this paper is a new data distribution mechanisms...... that cleverly stores and moves data among different clouds in order to optimize performance. Furthermore, we investigate the trade-offs among storage space, reliability and data retrieval speed for our proposed scheme. By means of real-world implementation and measurements using well-known and publicly...

  14. Joint Power Allocation for Multicast Systems with Physical-Layer Network Coding

    Directory of Open Access Journals (Sweden)

    Zhu Wei-Ping

    2010-01-01

    Full Text Available This paper addresses the joint power allocation issue in physical-layer network coding (PLNC of multicast systems with two sources and two destinations communicating via a large number of distributed relays. By maximizing the achievable system rate, a constrained optimization problem is first formulated to jointly allocate powers for the source and relay terminals. Due to the nonconvex nature of the cost function, an iterative algorithm with guaranteed convergence is developed to solve the joint power allocation problem. As an alternative, an upper bound of the achievable rate is also derived to modify the original cost function in order to obtain a convex optimization solution. This approximation is shown to be asymptotically optimal in the sense of maximizing the achievable rate. It is confirmed through Monte Carlo simulations that the proposed joint power allocation schemes are superior to the existing schemes in terms of achievable rate and cumulative distribution function (CDF.

  15. Establishment of A+M Computer Code Network. Summary report of IAEA technical meeting

    International Nuclear Information System (INIS)

    Clark, R.E.H.

    2006-01-01

    Eleven international experts on computational aspects of atomic and molecular data for fusion energy research participated in a technical meeting arranged to discuss the establishment of an A and M Computer Code Network, and held at IAEA Headquarters on 23-25 May 2005. Each participant reviewed the current status of their own speciality and current lines of research, as well as anticipated needs in new data for nuclear fusion energy research. A preliminary method for making these valuable resources more readily available was outlined, and implementation will proceed. Several of the computational tools presented are already available through Internet connections. All the goals of the meeting were achieved, and every participant indicated a desire to see more collaboration and cooperation in fulfilling the A and M data needs for fusion. The discussions, conclusions and recommendations of the meeting are briefly described in this report. (author)

  16. Three-Dimensional Terahertz Coded-Aperture Imaging Based on Matched Filtering and Convolutional Neural Network.

    Science.gov (United States)

    Chen, Shuo; Luo, Chenggao; Wang, Hongqiang; Deng, Bin; Cheng, Yongqiang; Zhuang, Zhaowen

    2018-04-26

    As a promising radar imaging technique, terahertz coded-aperture imaging (TCAI) can achieve high-resolution, forward-looking, and staring imaging by producing spatiotemporal independent signals with coded apertures. However, there are still two problems in three-dimensional (3D) TCAI. Firstly, the large-scale reference-signal matrix based on meshing the 3D imaging area creates a heavy computational burden, thus leading to unsatisfactory efficiency. Secondly, it is difficult to resolve the target under low signal-to-noise ratio (SNR). In this paper, we propose a 3D imaging method based on matched filtering (MF) and convolutional neural network (CNN), which can reduce the computational burden and achieve high-resolution imaging for low SNR targets. In terms of the frequency-hopping (FH) signal, the original echo is processed with MF. By extracting the processed echo in different spike pulses separately, targets in different imaging planes are reconstructed simultaneously to decompose the global computational complexity, and then are synthesized together to reconstruct the 3D target. Based on the conventional TCAI model, we deduce and build a new TCAI model based on MF. Furthermore, the convolutional neural network (CNN) is designed to teach the MF-TCAI how to reconstruct the low SNR target better. The experimental results demonstrate that the MF-TCAI achieves impressive performance on imaging ability and efficiency under low SNR. Moreover, the MF-TCAI has learned to better resolve the low-SNR 3D target with the help of CNN. In summary, the proposed 3D TCAI can achieve: (1) low-SNR high-resolution imaging by using MF; (2) efficient 3D imaging by downsizing the large-scale reference-signal matrix; and (3) intelligent imaging with CNN. Therefore, the TCAI based on MF and CNN has great potential in applications such as security screening, nondestructive detection, medical diagnosis, etc.

  17. Combating QR-Code-Based Compromised Accounts in Mobile Social Networks.

    Science.gov (United States)

    Guo, Dong; Cao, Jian; Wang, Xiaoqi; Fu, Qiang; Li, Qiang

    2016-09-20

    Cyber Physical Social Sensing makes mobile social networks (MSNs) popular with users. However, such attacks are rampant as malicious URLs are spread covertly through quick response (QR) codes to control compromised accounts in MSNs to propagate malicious messages. Currently, there are generally two types of methods to identify compromised accounts in MSNs: one type is to analyze the potential threats on wireless access points and the potential threats on handheld devices' operation systems so as to stop compromised accounts from spreading malicious messages; the other type is to apply the method of detecting compromised accounts in online social networks to MSNs. The above types of methods above focus neither on the problems of MSNs themselves nor on the interaction of sensors' messages, which leads to the restrictiveness of platforms and the simplification of methods. In order to stop the spreading of compromised accounts in MSNs effectively, the attacks have to be traced to their sources first. Through sensors, users exchange information in MSNs and acquire information by scanning QR codes. Therefore, analyzing the traces of sensor-related information helps to identify the compromised accounts in MSNs. This paper analyzes the diversity of information sending modes of compromised accounts and normal accounts, analyzes the regularity of GPS (Global Positioning System)-based location information, and introduces the concepts of entropy and conditional entropy so as to construct an entropy-based model based on machine learning strategies. To achieve the goal, about 500,000 accounts of Sina Weibo and about 100 million corresponding messages are collected. Through the validation, the accuracy rate of the model is proved to be as high as 87.6%, and the false positive rate is only 3.7%. Meanwhile, the comparative experiments of the feature sets prove that sensor-based location information can be applied to detect the compromised accounts in MSNs.

  18. Combating QR-Code-Based Compromised Accounts in Mobile Social Networks

    Directory of Open Access Journals (Sweden)

    Dong Guo

    2016-09-01

    Full Text Available Cyber Physical Social Sensing makes mobile social networks (MSNs popular with users. However, such attacks are rampant as malicious URLs are spread covertly through quick response (QR codes to control compromised accounts in MSNs to propagate malicious messages. Currently, there are generally two types of methods to identify compromised accounts in MSNs: one type is to analyze the potential threats on wireless access points and the potential threats on handheld devices’ operation systems so as to stop compromised accounts from spreading malicious messages; the other type is to apply the method of detecting compromised accounts in online social networks to MSNs. The above types of methods above focus neither on the problems of MSNs themselves nor on the interaction of sensors’ messages, which leads to the restrictiveness of platforms and the simplification of methods. In order to stop the spreading of compromised accounts in MSNs effectively, the attacks have to be traced to their sources first. Through sensors, users exchange information in MSNs and acquire information by scanning QR codes. Therefore, analyzing the traces of sensor-related information helps to identify the compromised accounts in MSNs. This paper analyzes the diversity of information sending modes of compromised accounts and normal accounts, analyzes the regularity of GPS (Global Positioning System-based location information, and introduces the concepts of entropy and conditional entropy so as to construct an entropy-based model based on machine learning strategies. To achieve the goal, about 500,000 accounts of Sina Weibo and about 100 million corresponding messages are collected. Through the validation, the accuracy rate of the model is proved to be as high as 87.6%, and the false positive rate is only 3.7%. Meanwhile, the comparative experiments of the feature sets prove that sensor-based location information can be applied to detect the compromised accounts in MSNs.

  19. Incorporation of punishable offences against the law on protection of the environment into the penal code

    International Nuclear Information System (INIS)

    Moehrenschlager, M.

    1979-01-01

    The government bill on the sixteenth act amending the penal legislation - act on the prevention of environmental offences - is presented, with comments being given on the most important stipulations. Paragraph 328 of the penal code deals with the unauthorized handling of nuclear fuels and represents an almost complete adoption of Paragraph 45 of the Atomic Energy law. The prohibition of the operation of nuclear facilities laid down in Paragraph 45, par. 1, No.4 of the Atomic Energy law, has been incorporated into the factural characteristics of illegal operation of facilities (Paragraph 327, par. 1,3 No. 1 of the penal code). The illegal handling of other radioactive substances has been dealt with in regard to some important cases: specifically for the case of illegal waste disposal (Paragraph 326, par. 1 No. 2, par. 2 of the penal code), and for the case of irregular transport leading to concrete danger or nuisance (Paragraph 330, par. 1 No. 4 of the penal code), as well as for the case of release of ionizing radiation having any such consequences (Paragraph 330, par. 1 No. 2, item c of the penal code). According to Paragraph 324 of the penal code, radioactive contamination of waters is a punishable offence. The rule of qualification of Paragraph 330 par. 1 of the penal code is to be applied to all these facts. (orig./HP) 891 HP/orig.- 892 MB [de

  20. Participation in protected areas: A social network case study in Catalonia, Spain

    NARCIS (Netherlands)

    Calvet-Mir, L.; Maestre Andrés, S.; Molina, J.L.; van den Bergh, J.C.J.M.

    2015-01-01

    Local participation of stakeholders in governance of protected areas is considered to be important to natural resource management and biodiversity conservation. Social network analysis (SNA) is a useful tool for analysis because it allows the understanding of stakeholders’ relationships,

  1. Assessing the efficiency of information protection systems in the computer systems and networks

    OpenAIRE

    Nachev, Atanas; Zhelezov, Stanimir

    2015-01-01

    The specific features of the information protection systems in the computer systems and networks require the development of non-trivial methods for their analysis and assessment. Attempts for solutions in this area are given in this paper.

  2. Main concept of local area network protection on the basis of the SAAM 'TRAFFIC'

    International Nuclear Information System (INIS)

    Vasil'ev, P.M.; Kryukov, Yu.A.; Kuptsov, S.I.; Ivanov, V.V.; Koren'kov, V.V.

    2002-01-01

    In our previous paper we developed a system for acquisition, analysis and management of the network traffic (SAAM 'Traffic') for a segment of the JINR local area computer network (JINR LAN). In our present work we consider well-known scenarios of attacks on local area networks and propose protection methods based on the SAAM 'Traffic'. Although the system for LAN protection is installed on a router computer, it is not analogous to the firewall scheme and, thus, it does not hinder the performance of distributed network applications. This provides a possibility to apply such an approach to GRID-technologies, where network protection on the firewall basis can not be basically used. (author)

  3. Application of flow network models of SINDA/FLUINT{sup TM} to a nuclear power plant system thermal hydraulic code

    Energy Technology Data Exchange (ETDEWEB)

    Chung, Ji Bum [Institute for Advanced Engineering, Yongin (Korea, Republic of); Park, Jong Woon [Korea Electric Power Research Institute, Taejon (Korea, Republic of)

    1998-12-31

    In order to enhance the dynamic and interactive simulation capability of a system thermal hydraulic code for nuclear power plant, applicability of flow network models in SINDA/FLUINT{sup TM} has been tested by modeling feedwater system and coupling to DSNP which is one of a system thermal hydraulic simulation code for a pressurized heavy water reactor. The feedwater system is selected since it is one of the most important balance of plant systems with a potential to greatly affect the behavior of nuclear steam supply system. The flow network model of this feedwater system consists of condenser, condensate pumps, low and high pressure heaters, deaerator, feedwater pumps, and control valves. This complicated flow network is modeled and coupled to DSNP and it is tested for several normal and abnormal transient conditions such turbine load maneuvering, turbine trip, and loss of class IV power. The results show reasonable behavior of the coupled code and also gives a good dynamic and interactive simulation capabilities for the several mild transient conditions. It has been found that coupling system thermal hydraulic code with a flow network code is a proper way of upgrading simulation capability of DSNP to mature nuclear plant analyzer (NPA). 5 refs., 10 figs. (Author)

  4. APPLIED OF IMPRESSED CURRENT CATHODIC PROTECTION DESIGN FOR FUEL PIPELINE NETWORK AT NAVAL BASE

    Directory of Open Access Journals (Sweden)

    k. Susilo

    2017-06-01

    Full Text Available Indonesian Navy (TNI AL is the main component for Maritime Security and Defence. Because of that, TNI AL needs Indonesian Warship (KRI to covered Maritime area. The main requirement from KRI is fulfilled by demand. To pock of fuel demand from KRI at Naval Base, it needs a new pipeline of fuel distribution network system. The pipeline network system used for maximum lifetime must be protected from corrosion. Basically, there are five methods of corrosion control such as change to a more suitable material, modification to the environment, use of protective coating, design modification to the system or component, and the application of cathodic or anodic protection. Cathodic protection for pipeline available in two kinds, namely Sacrifice Anode and Impressed Current Cathodic Protection (ICCP. This paper makes analysis from design of Impressed Current Cathodic Protection and total current requirement in the method. This paper showed both experimental from speciment test and theoritical calculation. The result showed that design of Impressed Current Cathodic Protection on fuel distribution pipeline network system requires voltage 33,759 V(DC, protection current 6,6035 A(DC by theoritical calculation and 6,544 A(DC from pipeline specimen test, with 0,25 mpy for corrosion rate. Transformer Rectifier design needs requirements 45 V with 10 A for current. This research result can be made as literature and standardization for Indonesian Navy in designing the Impressed Current Cathodic Protection for fuel distribution pipeline network system.

  5. Storage of phase-coded patterns via STDP in fully-connected and sparse network: a study of the network capacity

    Directory of Open Access Journals (Sweden)

    Silvia Scarpetta

    2010-08-01

    Full Text Available We study the storage and retrieval of phase-coded patterns as stable dynamical attractors in recurrent neural networks, for both an analog and a integrate-and-fire spiking model. The synaptic strength is determined by a learning rule based on spike-time-dependent plasticity, with an asymmetric time window depending on the relative timing between pre- and post-synaptic activity. We store multiple patterns and study the network capacity. For the analog model, we find that the network capacity scales linearly with the network size, and that both capacity and the oscillation frequency of the retrieval state depend on the asymmetry of the learning time window. In addition to fully-connected networks, we study sparse networks, where each neuron is connected only to a small number $zll N$ of other neurons. Connections can be short range, between neighboring neurons placed on a regular lattice, or long range, between randomly chosen pairs of neurons. We find that a small fraction of long range connections is able to amplify the capacity of the network. This imply that a small-world-network topology is optimal, as a compromise between the cost of long range connections and the capacity increase. Also in the spiking integrate and fire model the crucial result of storing and retrieval of multiple phase-coded patterns is observed. The capacity of the fully-connected spiking network is investigated, together with the relation between oscillation frequency of retrieval state and window asymmetry.

  6. The application of the Monte Carlo code FLUKA in radiation protection studies for the large hadron collider

    International Nuclear Information System (INIS)

    Battistoni, Giuseppe; Broggi, Francesco; Brugger, Markus

    2010-01-01

    The multi-purpose particle interaction and transport code FLUKA is integral part of all radiation protection studies for the design and operation of the Large Hadron Collider (LHC) at CERN. It is one of the very few codes available for this type of calculations which is capable to calculate in one and the same simulation proton-proton and heavy ion collisions at LHC energies as well as the entire hadronic and electromagnetic particle cascade initiated by secondary particles in detectors and beam-line components from TeV energies down to energies of thermal neutrons. The present paper reviews these capabilities of FLUKA in giving details of relevant physics models along with examples of radiation protection studies for the LHC such as shielding studies for underground areas occupied by personnel during LHC operation and the simulation of induced radioactivity around beam loss points. Integral part of the FLUKA development is a careful benchmarking of specific models as well as the code performance in complex, real life applications which is demonstrated with examples of studies relevant to radiation protection at the LHC. (author)

  7. Synchronization Control for a Class of Discrete-Time Dynamical Networks With Packet Dropouts: A Coding-Decoding-Based Approach.

    Science.gov (United States)

    Wang, Licheng; Wang, Zidong; Han, Qing-Long; Wei, Guoliang

    2017-09-06

    The synchronization control problem is investigated for a class of discrete-time dynamical networks with packet dropouts via a coding-decoding-based approach. The data is transmitted through digital communication channels and only the sequence of finite coded signals is sent to the controller. A series of mutually independent Bernoulli distributed random variables is utilized to model the packet dropout phenomenon occurring in the transmissions of coded signals. The purpose of the addressed synchronization control problem is to design a suitable coding-decoding procedure for each node, based on which an efficient decoder-based control protocol is developed to guarantee that the closed-loop network achieves the desired synchronization performance. By applying a modified uniform quantization approach and the Kronecker product technique, criteria for ensuring the detectability of the dynamical network are established by means of the size of the coding alphabet, the coding period and the probability information of packet dropouts. Subsequently, by resorting to the input-to-state stability theory, the desired controller parameter is obtained in terms of the solutions to a certain set of inequality constraints which can be solved effectively via available software packages. Finally, two simulation examples are provided to demonstrate the effectiveness of the obtained results.

  8. FONESYS: The FOrum and NEtwork of SYStem Thermal-Hydraulic Codes in Nuclear Reactor Thermal-Hydraulics

    Energy Technology Data Exchange (ETDEWEB)

    Ahn, S.H., E-mail: k175ash@kins.re.kr [Korea Institute of Nuclear Safety (KINS) (Korea, Republic of); Aksan, N., E-mail: nusr.aksan@gmail.com [University of Pisa San Piero a Grado Nuclear Research Group (GRNSPG) (Italy); Austregesilo, H., E-mail: henrique.austregesilo@grs.de [Gesellschaft für Anlagen- und Reaktorsicherheit (GRS) (Germany); Bestion, D., E-mail: dominique.bestion@cea.fr [Commissariat à l’énergie atomique et aux énergies alternatives (CEA) (France); Chung, B.D., E-mail: bdchung@kaeri.re.kr [Korea Atomic Energy Research Institute (KAERI) (Korea, Republic of); D’Auria, F., E-mail: f.dauria@ing.unipi.it [University of Pisa San Piero a Grado Nuclear Research Group (GRNSPG) (Italy); Emonot, P., E-mail: philippe.emonot@cea.fr [Commissariat à l’énergie atomique et aux énergies alternatives (CEA) (France); Gandrille, J.L., E-mail: jeanluc.gandrille@areva.com [AREVA NP (France); Hanninen, M., E-mail: markku.hanninen@vtt.fi [VTT Technical Research Centre of Finland (VTT) (Finland); Horvatović, I., E-mail: i.horvatovic@ing.unipi.it [University of Pisa San Piero a Grado Nuclear Research Group (GRNSPG) (Italy); Kim, K.D., E-mail: kdkim@kaeri.re.kr [Korea Atomic Energy Research Institute (KAERI) (Korea, Republic of); Kovtonyuk, A., E-mail: a.kovtonyuk@ing.unipi.it [University of Pisa San Piero a Grado Nuclear Research Group (GRNSPG) (Italy); Petruzzi, A., E-mail: a.petruzzi@ing.unipi.it [University of Pisa San Piero a Grado Nuclear Research Group (GRNSPG) (Italy)

    2015-01-15

    Highlights: • We briefly presented the project called Forum and Network of System Thermal-Hydraulics Codes in Nuclear Reactor Thermal-Hydraulics (FONESYS). • We presented FONESYS participants and their codes. • We explained FONESYS projects motivation, its main targets and working modalities. • We presented FONESYS position about projects topics and subtopics. - Abstract: The purpose of this article is to present briefly the project called Forum and Network of System Thermal-Hydraulics Codes in Nuclear Reactor Thermal-Hydraulics (FONESYS), its participants, the motivation for the project, its main targets and working modalities. System Thermal-Hydraulics (SYS-TH) codes, also as part of the Best Estimate Plus Uncertainty (BEPU) approaches, are expected to achieve a more-and-more relevant role in nuclear reactor technology, safety and design. Namely, the number of code-users can easily be predicted to increase in the countries where nuclear technology is exploited. Thus, the idea of establishing a forum and a network among the code developers and with possible extension to code users has started to have major importance and value. In this framework the FONESYS initiative has been created. The main targets of FONESYS are: • To promote the use of SYS-TH Codes and the application of the BEPU approaches. • To establish acceptable and recognized procedures and thresholds for Verification and Validation (V and V). • To create a common ground for discussing envisaged improvements in various areas, including user-interface, and the connection with other numerical tools, including Computational Fluid Dynamics (CFD) Codes.

  9. Relay Protection Coordination for Photovoltaic Power Plant Connected on Distribution Network

    OpenAIRE

    Nikolovski, Srete; Papuga, Vanja; Knežević, Goran

    2014-01-01

    This paper presents a procedure and computation of relay protection coordination for a PV power plant connected to the distribution network. In recent years, the growing concern for environment preservation has caused expansion of photovoltaic PV power plants in distribution networks. Numerical computer simulation is an indispensable tool for studying photovoltaic (PV) systems protection coordination. In this paper, EasyPower computer program is used with the module Power Protector. Time-curr...

  10. Collection of regulatory texts relative to radiation protection. Part 2: by-laws, decisions, non-codified decrees / Collection of legal and statutory provisions relative to radiation protection. Part 2: by-laws and decisions taken in application of the Public Health Code and Labour Code concerning the protection of populations, patients and workers against the risks of ionizing radiations

    International Nuclear Information System (INIS)

    Rivas, Robert; Feries, Jean; Marzorati, Frank; Chevalier, Celine; Lachaume, Jean-Luc

    2012-01-01

    This second part gathers texts extracted from the Public Health Code and related to ionizing radiations (general measures for the protection of the population, exposure to natural radiations, general regime of authorizations and declarations, purchase, retailing, importation, exportation, transfer and elimination of radioactive sources, protection of persons exposed to ionizing radiations for medical or forensics purposes, situations of radiological emergency and of sustained exposure to ionizing radiations, control), to the safety of waters and food products, and to the control of medical devices, to the protection of patients. It also contains extracts for the Labour Code related to workers protection. This document is an update of the previous version from March 2011

  11. Species-free species distribution models describe macroecological properties of protected area networks.

    Science.gov (United States)

    Robinson, Jason L; Fordyce, James A

    2017-01-01

    Among the greatest challenges facing the conservation of plants and animal species in protected areas are threats from a rapidly changing climate. An altered climate creates both challenges and opportunities for improving the management of protected areas in networks. Increasingly, quantitative tools like species distribution modeling are used to assess the performance of protected areas and predict potential responses to changing climates for groups of species, within a predictive framework. At larger geographic domains and scales, protected area network units have spatial geoclimatic properties that can be described in the gap analysis typically used to measure or aggregate the geographic distributions of species (stacked species distribution models, or S-SDM). We extend the use of species distribution modeling techniques in order to model the climate envelope (or "footprint") of individual protected areas within a network of protected areas distributed across the 48 conterminous United States and managed by the US National Park System. In our approach we treat each protected area as the geographic range of a hypothetical endemic species, then use MaxEnt and 5 uncorrelated BioClim variables to model the geographic distribution of the climatic envelope associated with each protected area unit (modeling the geographic area of park units as the range of a species). We describe the individual and aggregated climate envelopes predicted by a large network of 163 protected areas and briefly illustrate how macroecological measures of geodiversity can be derived from our analysis of the landscape ecological context of protected areas. To estimate trajectories of change in the temporal distribution of climatic features within a protected area network, we projected the climate envelopes of protected areas in current conditions onto a dataset of predicted future climatic conditions. Our results suggest that the climate envelopes of some parks may be locally unique or have

  12. Deep Constrained Siamese Hash Coding Network and Load-Balanced Locality-Sensitive Hashing for Near Duplicate Image Detection.

    Science.gov (United States)

    Hu, Weiming; Fan, Yabo; Xing, Junliang; Sun, Liang; Cai, Zhaoquan; Maybank, Stephen

    2018-09-01

    We construct a new efficient near duplicate image detection method using a hierarchical hash code learning neural network and load-balanced locality-sensitive hashing (LSH) indexing. We propose a deep constrained siamese hash coding neural network combined with deep feature learning. Our neural network is able to extract effective features for near duplicate image detection. The extracted features are used to construct a LSH-based index. We propose a load-balanced LSH method to produce load-balanced buckets in the hashing process. The load-balanced LSH significantly reduces the query time. Based on the proposed load-balanced LSH, we design an effective and feasible algorithm for near duplicate image detection. Extensive experiments on three benchmark data sets demonstrate the effectiveness of our deep siamese hash encoding network and load-balanced LSH.

  13. Validating User Flows to Protect Software Defined Network Environments

    Directory of Open Access Journals (Sweden)

    Ihsan H. Abdulqadder

    2018-01-01

    Full Text Available Software Defined Network is a promising network paradigm which has led to several security threats in SDN applications that involve user flows, switches, and controllers in the network. Threats as spoofing, tampering, information disclosure, Denial of Service, flow table overloading, and so on have been addressed by many researchers. In this paper, we present novel SDN design to solve three security threats: flow table overloading is solved by constructing a star topology-based architecture, unsupervised hashing method mitigates link spoofing attack, and fuzzy classifier combined with L1-ELM running on a neural network for isolating anomaly packets from normal packets. For effective flow migration Discrete-Time Finite-State Markov Chain model is applied. Extensive simulations using OMNeT++ demonstrate the performance of our proposed approach, which is better at preserving holding time than are other state-of-the-art works from the literature.

  14. A Game-theoretic Framework for Network Coding Based Device-to-Device Communications

    KAUST Repository

    Douik, Ahmed S.; Sorour, Sameh; Tembine, Hamidou; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim

    2016-01-01

    This paper investigates the delay minimization problem for instantly decodable network coding (IDNC) based deviceto- device (D2D) communications. In D2D enabled systems, users cooperate to recover all their missing packets. The paper proposes a game theoretic framework as a tool for improving the distributed solution by overcoming the need for a central controller or additional signaling in the system. The session is modeled by self-interested players in a non-cooperative potential game. The utility functions are designed so as increasing individual payoff results in a collective behavior achieving both a desirable system performance in a shared network environment and the Nash equilibrium. Three games are developed whose first reduces the completion time, the second the maximum decoding delay and the third the sum decoding delay. The paper, further, improves the formulations by including a punishment policy upon collision occurrence so as to achieve the Nash bargaining solution. Learning algorithms are proposed for systems with complete and incomplete information, and for the imperfect feedback scenario. Numerical results suggest that the proposed game-theoretical formulation provides appreciable performance gain against the conventional point-to-multipoint (PMP), especially for reliable user-to-user channels.

  15. A Game-theoretic Framework for Network Coding Based Device-to-Device Communications

    KAUST Repository

    Douik, Ahmed

    2016-06-29

    This paper investigates the delay minimization problem for instantly decodable network coding (IDNC) based deviceto- device (D2D) communications. In D2D enabled systems, users cooperate to recover all their missing packets. The paper proposes a game theoretic framework as a tool for improving the distributed solution by overcoming the need for a central controller or additional signaling in the system. The session is modeled by self-interested players in a non-cooperative potential game. The utility functions are designed so as increasing individual payoff results in a collective behavior achieving both a desirable system performance in a shared network environment and the Nash equilibrium. Three games are developed whose first reduces the completion time, the second the maximum decoding delay and the third the sum decoding delay. The paper, further, improves the formulations by including a punishment policy upon collision occurrence so as to achieve the Nash bargaining solution. Learning algorithms are proposed for systems with complete and incomplete information, and for the imperfect feedback scenario. Numerical results suggest that the proposed game-theoretical formulation provides appreciable performance gain against the conventional point-to-multipoint (PMP), especially for reliable user-to-user channels.

  16. A multiscale network analysis of protected-area connectivity for mammals in the United States.

    Science.gov (United States)

    Minor, Emily S; Lookingbill, Todd R

    2010-12-01

    Protected areas must be close, or connected, enough to allow for the preservation of large-scale ecological and evolutionary processes, such as gene flow, migration, and range shifts in response to climate change. Nevertheless, it is unknown whether the network of protected areas in the United States is connected in a way that will preserve biodiversity over large temporal and spatial scales. It is also unclear whether protected-area networks that function for larger species will function for smaller species. We assessed the connectivity of protected areas in the three largest biomes in the United States. With methods from graph theory--a branch of mathematics that deals with connectivity and flow--we identified and measured networks of protected areas for three different groups of mammals. We also examined the value of using umbrella species (typically large-bodied, far-ranging mammals) in designing large-scale networks of protected areas. Although the total amount of protected land varied greatly among biomes in the United States, overall connectivity did not. In general, protected-area networks were well connected for large mammals but not for smaller mammals. Additionally, it was not possible to predict connectivity for small mammals on the basis of connectivity for large mammals, which suggests the umbrella species approach may not be an appropriate design strategy for conservation networks intended to protect many species. Our findings indicate different strategies should be used to increase the likelihood of persistence for different groups of species. Strategic linkages of existing lands should be a conservation priority for smaller mammals, whereas conservation of larger mammals would benefit most from the protection of more land. © 2010 Society for Conservation Biology.

  17. Evaluation of four-dimensional nonbinary LDPC-coded modulation for next-generation long-haul optical transport networks.

    Science.gov (United States)

    Zhang, Yequn; Arabaci, Murat; Djordjevic, Ivan B

    2012-04-09

    Leveraging the advanced coherent optical communication technologies, this paper explores the feasibility of using four-dimensional (4D) nonbinary LDPC-coded modulation (4D-NB-LDPC-CM) schemes for long-haul transmission in future optical transport networks. In contrast to our previous works on 4D-NB-LDPC-CM which considered amplified spontaneous emission (ASE) noise as the dominant impairment, this paper undertakes transmission in a more realistic optical fiber transmission environment, taking into account impairments due to dispersion effects, nonlinear phase noise, Kerr nonlinearities, and stimulated Raman scattering in addition to ASE noise. We first reveal the advantages of using 4D modulation formats in LDPC-coded modulation instead of conventional two-dimensional (2D) modulation formats used with polarization-division multiplexing (PDM). Then we demonstrate that 4D LDPC-coded modulation schemes with nonbinary LDPC component codes significantly outperform not only their conventional PDM-2D counterparts but also the corresponding 4D bit-interleaved LDPC-coded modulation (4D-BI-LDPC-CM) schemes, which employ binary LDPC codes as component codes. We also show that the transmission reach improvement offered by the 4D-NB-LDPC-CM over 4D-BI-LDPC-CM increases as the underlying constellation size and hence the spectral efficiency of transmission increases. Our results suggest that 4D-NB-LDPC-CM can be an excellent candidate for long-haul transmission in next-generation optical networks.

  18. Residential building codes, affordability, and health protection: a risk-tradeoff approach.

    Science.gov (United States)

    Hammitt, J K; Belsky, E S; Levy, J I; Graham, J D

    1999-12-01

    Residential building codes intended to promote health and safety may produce unintended countervailing risks by adding to the cost of construction. Higher construction costs increase the price of new homes and may increase health and safety risks through "income" and "stock" effects. The income effect arises because households that purchase a new home have less income remaining for spending on other goods that contribute to health and safety. The stock effect arises because suppression of new-home construction leads to slower replacement of less safe housing units. These countervailing risks are not presently considered in code debates. We demonstrate the feasibility of estimating the approximate magnitude of countervailing risks by combining the income effect with three relatively well understood and significant home-health risks. We estimate that a code change that increases the nationwide cost of constructing and maintaining homes by $150 (0.1% of the average cost to build a single-family home) would induce offsetting risks yielding between 2 and 60 premature fatalities or, including morbidity effects, between 20 and 800 lost quality-adjusted life years (both discounted at 3%) each year the code provision remains in effect. To provide a net health benefit, the code change would need to reduce risk by at least this amount. Future research should refine these estimates, incorporate quantitative uncertainty analysis, and apply a full risk-tradeoff approach to real-world case studies of proposed code changes.

  19. Protection coordination of the Kennedy Space Center electric distribution network

    Science.gov (United States)

    1976-01-01

    A computer technique is described for visualizing the coordination and protection of any existing system of devices and settings by plotting the tripping characteristics of the involved devices on a common basis. The program determines the optimum settings of a given set of protective devices and configuration in the sense of the best expected coordinated operation of these devices. Subroutines are given for simulating time versus current characteristics of the different relays, circuit breakers, and fuses in the system; coordination index computation; protection checks; plotting; and coordination optimation.

  20. A dedicated tool for analysing protection selectivity and back-up in large MV networks

    NARCIS (Netherlands)

    Rombouts, S. P.J.; Morren, J.

    2010-01-01

    Due to integration of distributed generation the operation of medium-voltage distribution networks is becoming more difficult. This paper describes a dedicated simulation tool that can be used to study the protection coordination in the network. One of the main advantages of the program is that it

  1. Use of social networks to improve radiation protection

    International Nuclear Information System (INIS)

    Medina Gironzini, E.

    2013-01-01

    The development of information and communication technologies has improved relations between the specialists in radiation protection worldwide. Takes advantage of these media to exchange experiences on issues of common interest and technical concerns are resolved in very short times. (Author)

  2. Designing a protected area network for conservation planning in Jhum landscapes of Garo Hills, Meghalaya

    Science.gov (United States)

    A. Kumar; Bruce Marcot; G. Talukdar

    2010-01-01

    We studied vegetation and land cover characteristics within the existing array of protected areas (PAs) in South Garo Hills of Meghalaya, northeast India and introduce the concept of protected area network (PAN) and methods to determine linkages of forests among existing PAs. We describe and analyze potential elements of a PAN, including PAs, reserved forests,...

  3. Multiple implementation of a reactor protection code in PHI2, PASCAL, and IFTRAN on the SIEMENS-330 computer

    International Nuclear Information System (INIS)

    Gmeiner, L.; Lemperle, W.; Voges, U.

    1978-01-01

    In safety related computer applications, as in the case of a reactor protection system considered here, mostly multi-computer systems are necessary for reasons of reliability and availability. The hardware structure of the protection system and the software requierements derived from it are explained. In order to study the effects of diversified programming of the three computers the protection codes were implemented in the languages IFTRAN, PASCAL, and PHI2. According to the experience gained diversified programming seems to be a proper means to prevent identical programming errors in all three computers on one hand and to detect ambiguities of the specification on the other. During all of the experiment the errors occurring were recorded in detail and at the moment are being evaluated. (orig./WB) [de

  4. Representation of global and national conservation priorities by Colombia's Protected Area Network.

    Science.gov (United States)

    Forero-Medina, German; Joppa, Lucas

    2010-10-12

    How do national-level actions overlap with global priorities for conservation? Answering this question is especially important in countries with high and unique biological diversity like Colombia. Global biodiversity schemes provide conservation guidance at a large scale, while national governments gazette land for protection based on a combination of criteria at regional or local scales. Information on how a protected area network represents global and national conservation priorities is crucial for finding gaps in coverage and for future expansion of the system. We evaluated the agreement of Colombia's protected area network with global conservation priorities, and the extent to which the network reflects the country's biomes, species richness, and common environmental and physical conditions. We used this information to identify priority biomes for conservation. We find the dominant strategy in Colombia has been a proactive one, allocating the highest proportion of protected land on intact, difficult to access and species rich areas like the Amazon. Threatened and unique areas are disproportionately absent from Colombia's protected lands. We highlight six biomes in Colombia as conservation priorities that should be considered in any future expansion of Colombia's protected area network. Two of these biomes have less than 3% of their area protected and more than 70% of their area transformed for human use. One has less than 3% protected and high numbers of threatened vertebrates. Three biomes fall in both categories. Expansion of Colombia's Protected Area Network should consider the current representativeness of the network. We indicate six priority biomes that can contribute to improving the representation of threatened species and biomes in Colombia.

  5. Protecting against cyber threats in networked information systems

    Science.gov (United States)

    Ertoz, Levent; Lazarevic, Aleksandar; Eilertson, Eric; Tan, Pang-Ning; Dokas, Paul; Kumar, Vipin; Srivastava, Jaideep

    2003-07-01

    This paper provides an overview of our efforts in detecting cyber attacks in networked information systems. Traditional signature based techniques for detecting cyber attacks can only detect previously known intrusions and are useless against novel attacks and emerging threats. Our current research at the University of Minnesota is focused on developing data mining techniques to automatically detect attacks against computer networks and systems. This research is being conducted as a part of MINDS (Minnesota Intrusion Detection System) project at the University of Minnesota. Experimental results on live network traffic at the University of Minnesota show that the new techniques show great promise in detecting novel intrusions. In particular, during the past few months our techniques have been successful in automatically identifying several novel intrusions that could not be detected using state-of-the-art tools such as SNORT.

  6. Architecture, design and protection of electrical distribution networks

    Energy Technology Data Exchange (ETDEWEB)

    Sorrel, J.P. [Schneider electric Industries SA (France)

    2000-07-01

    Architectures related to AII Electric Ship (AES) require high level of propulsion power. Merchant ships and obviously warships require a low vulnerability, a high reliability and availability, a simple maintainability as well as an ordinary ode of operation. These constraints converge to an optimum single line diagram. We will focus on the mode of operation of the network, its constraints, the facilities to use a ring distribution for the ship service distribution system, the earthing of HV network as well as future developments. (author)

  7. Multicast backup reprovisioning problem for Hamiltonian cycle-based protection on WDM networks

    Science.gov (United States)

    Din, Der-Rong; Huang, Jen-Shen

    2014-03-01

    As networks grow in size and complexity, the chance and the impact of failures increase dramatically. The pre-allocated backup resources cannot provide 100% protection guarantee when continuous failures occur in a network. In this paper, the multicast backup re-provisioning problem (MBRP) for Hamiltonian cycle (HC)-based protection on WDM networks for the link-failure case is studied. We focus on how to recover the protecting capabilities of Hamiltonian cycle against the subsequent link-failures on WDM networks for multicast transmissions, after recovering the multicast trees affected by the previous link-failure. Since this problem is a hard problem, an algorithm, which consists of several heuristics and a genetic algorithm (GA), is proposed to solve it. The simulation results of the proposed method are also given. Experimental results indicate that the proposed algorithm can solve this problem efficiently.

  8. Projected impacts of climate change on a continent-wide protected area network

    DEFF Research Database (Denmark)

    Hole, David G; Willis, Stephen G; Pain, Deborah J

    2009-01-01

    Despite widespread concern, the continuing effectiveness of networks of protected areas under projected 21st century climate change is uncertain. Shifts in species' distributions could mean these resources will cease to afford protection to those species for which they were originally established...... species). Persistence of suitable climate space across the network as a whole, however, is notably high, with 88-92% of priority species retaining suitable climate space in >or= 1 IBA(s) in which they are currently found. Only 7-8 priority species lose climatic representation from the network. Hence......, despite the likelihood of significant community disruption, we demonstrate that rigorously defined networks of protected areas can play a key role in mitigating the worst impacts of climate change on biodiversity....

  9. A hybrid path-oriented code assignment CDMA-based MAC protocol for underwater acoustic sensor networks.

    Science.gov (United States)

    Chen, Huifang; Fan, Guangyu; Xie, Lei; Cui, Jun-Hong

    2013-11-04

    Due to the characteristics of underwater acoustic channel, media access control (MAC) protocols designed for underwater acoustic sensor networks (UWASNs) are quite different from those for terrestrial wireless sensor networks. Moreover, in a sink-oriented network with event information generation in a sensor field and message forwarding to the sink hop-by-hop, the sensors near the sink have to transmit more packets than those far from the sink, and then a funneling effect occurs, which leads to packet congestion, collisions and losses, especially in UWASNs with long propagation delays. An improved CDMA-based MAC protocol, named path-oriented code assignment (POCA) CDMA MAC (POCA-CDMA-MAC), is proposed for UWASNs in this paper. In the proposed MAC protocol, both the round-robin method and CDMA technology are adopted to make the sink receive packets from multiple paths simultaneously. Since the number of paths for information gathering is much less than that of nodes, the length of the spreading code used in the POCA-CDMA-MAC protocol is shorter greatly than that used in the CDMA-based protocols with transmitter-oriented code assignment (TOCA) or receiver-oriented code assignment (ROCA). Simulation results show that the proposed POCA-CDMA-MAC protocol achieves a higher network throughput and a lower end-to-end delay compared to other CDMA-based MAC protocols.

  10. A Hybrid Path-Oriented Code Assignment CDMA-Based MAC Protocol for Underwater Acoustic Sensor Networks

    Directory of Open Access Journals (Sweden)

    Huifang Chen

    2013-11-01

    Full Text Available Due to the characteristics of underwater acoustic channel, media access control (MAC protocols designed for underwater acoustic sensor networks (UWASNs are quite different from those for terrestrial wireless sensor networks. Moreover, in a sink-oriented network with event information generation in a sensor field and message forwarding to the sink hop-by-hop, the sensors near the sink have to transmit more packets than those far from the sink, and then a funneling effect occurs, which leads to packet congestion, collisions and losses, especially in UWASNs with long propagation delays. An improved CDMA-based MAC protocol, named path-oriented code assignment (POCA CDMA MAC (POCA-CDMA-MAC, is proposed for UWASNs in this paper. In the proposed MAC protocol, both the round-robin method and CDMA technology are adopted to make the sink receive packets from multiple paths simultaneously. Since the number of paths for information gathering is much less than that of nodes, the length of the spreading code used in the POCA-CDMA-MAC protocol is shorter greatly than that used in the CDMA-based protocols with transmitter-oriented code assignment (TOCA or receiver-oriented code assignment (ROCA. Simulation results show that the proposed POCA-CDMA-MAC protocol achieves a higher network throughput and a lower end-to-end delay compared to other CDMA-based MAC protocols.

  11. On the Impact of Zero-padding in Network Coding Efficiency with Internet Traffic and Video Traces

    DEFF Research Database (Denmark)

    Taghouti, Maroua; Roetter, Daniel Enrique Lucani; Pedersen, Morten Videbæk

    2016-01-01

    Random Linear Network Coding (RLNC) theoretical results typically assume that packets have equal sizes while in reality, data traffic presents a random packet size distribution. Conventional wisdom considers zero-padding of original packets as a viable alternative, but its effect can reduce the e...

  12. Extra-capacity versus protection for supply networks under attack

    International Nuclear Information System (INIS)

    Bricha, Naji; Nourelfath, Mustapha

    2014-01-01

    This article develops a game-theoretical model to deal with the protection of facilities, in the context of the capacitated fixed-charge location and capacity acquisition problem. A set of investment alternatives is available for direct protection of facilities. Furthermore, extra-capacity of neighbouring functional facilities can be used after attacks to avoid the backlog of demands and backorders. The proposed model considers a non-cooperative two-period game between the players, and an algorithm is presented to determine the equilibrium solution and the optimal defender strategy under capacity constraints. A method is developed to evaluate the utilities of the defender and the attacker. The benefit of the proposed approach is illustrated using a numerical example. The defence strategy of our model is compared to other strategies, and the obtained results clearly indicate the superiority of our model in finding the best trade-off between direct protection investment and extra-capacity deployment

  13. Dynamic segment shared protection for multicast traffic in meshed wavelength-division-multiplexing optical networks

    Science.gov (United States)

    Liao, Luhua; Li, Lemin; Wang, Sheng

    2006-12-01

    We investigate the protection approach for dynamic multicast traffic under shared risk link group (SRLG) constraints in meshed wavelength-division-multiplexing optical networks. We present a shared protection algorithm called dynamic segment shared protection for multicast traffic (DSSPM), which can dynamically adjust the link cost according to the current network state and can establish a primary light-tree as well as corresponding SRLG-disjoint backup segments for a dependable multicast connection. A backup segment can efficiently share the wavelength capacity of its working tree and the common resources of other backup segments based on SRLG-disjoint constraints. The simulation results show that DSSPM not only can protect the multicast sessions against a single-SRLG breakdown, but can make better use of the wavelength resources and also lower the network blocking probability.

  14. Defeating Insider Attacks via Autonomic Self-Protective Networks

    Science.gov (United States)

    Sibai, Faisal M.

    2012-01-01

    There has been a constant growing security concern with insider attacks on network accessible computer systems. Users with power credentials can do almost anything they want with the systems they own with very little control or oversight. Most breaches occurring nowadays by power users are considered legitimate access and not necessarily…

  15. Provable network activity for protecting users against false accusation

    NARCIS (Netherlands)

    Papadopoulos, Panagiotis; Athanasopoulos, Ilias; Kosta, Eleni; Siganos, George; Keromytis, Angelos D.; Markatos, Evangelos P.

    2016-01-01

    With the proliferation of the World Wide Web, data traces that correspond to users’ network activity can be collected by several Internet actors, including (i) web sites, (ii) smartphone apps, and even (iii) Internet Service Providers. Given that the collection and storage of these data are beyond

  16. Efficacy analysis of LDPC coded APSK modulated differential space-time-frequency coded for wireless body area network using MB-pulsed OFDM UWB technology.

    Science.gov (United States)

    Manimegalai, C T; Gauni, Sabitha; Kalimuthu, K

    2017-12-04

    Wireless body area network (WBAN) is a breakthrough technology in healthcare areas such as hospital and telemedicine. The human body has a complex mixture of different tissues. It is expected that the nature of propagation of electromagnetic signals is distinct in each of these tissues. This forms the base for the WBAN, which is different from other environments. In this paper, the knowledge of Ultra Wide Band (UWB) channel is explored in the WBAN (IEEE 802.15.6) system. The measurements of parameters in frequency range from 3.1-10.6 GHz are taken. The proposed system, transmits data up to 480 Mbps by using LDPC coded APSK Modulated Differential Space-Time-Frequency Coded MB-OFDM to increase the throughput and power efficiency.

  17. Exploring a QoS Driven Scheduling Approach for Peer-to-Peer Live Streaming Systems with Network Coding

    Science.gov (United States)

    Cui, Laizhong; Lu, Nan; Chen, Fu

    2014-01-01

    Most large-scale peer-to-peer (P2P) live streaming systems use mesh to organize peers and leverage pull scheduling to transmit packets for providing robustness in dynamic environment. The pull scheduling brings large packet delay. Network coding makes the push scheduling feasible in mesh P2P live streaming and improves the efficiency. However, it may also introduce some extra delays and coding computational overhead. To improve the packet delay, streaming quality, and coding overhead, in this paper are as follows. we propose a QoS driven push scheduling approach. The main contributions of this paper are: (i) We introduce a new network coding method to increase the content diversity and reduce the complexity of scheduling; (ii) we formulate the push scheduling as an optimization problem and transform it to a min-cost flow problem for solving it in polynomial time; (iii) we propose a push scheduling algorithm to reduce the coding overhead and do extensive experiments to validate the effectiveness of our approach. Compared with previous approaches, the simulation results demonstrate that packet delay, continuity index, and coding ratio of our system can be significantly improved, especially in dynamic environments. PMID:25114968

  18. Women violente network of protection: Advances and challenges

    Directory of Open Access Journals (Sweden)

    Patricia Krieger Grossi

    2008-11-01

    Full Text Available In Brazil, violence in marital relations has been the object of an increase in police charges, as well as in the judiciary system and public institutions of social welfare, education and health. Domestic violence causes large psychosocial, economic and political repercussions in the individual and family sphere as well as in the woman’s social sphere. Given the complexity of the problem, surrounded by the prejudice and different types of discrimination, women who are victims of domestic violence suffer diverse changes, often drastic, in the environment they live and with whom they live as time passes by. This results in a complete process of fragilization in their belonging networks. The present article presents data based on two researches: “The Support Network for Women in Domestic Violence Situations: Limits and Possibilities”, and “From tears to Hope: The Process of Empowerment of Women in Domestic Violence Situation”, carried out in the Research Group on Violence – NEPEVI, Faculty of Social Work, Catholic University of Rio Grande do Sul (PUCRS, Brazil. Our purpose was to provide theoretical and practical bases to contribute with the services and empowerment of women in domestic violence situations. This research consisted in the identification of the limits and possibilities of the network support for women in domestic violence situation in the municipalities of Porto Alegre, São Leopoldo and Novo Hamburgo, State of Rio Grande do Sul. Women who were service users of this network of support and professionals connected to this network, among them, social workers, psychologists, delegates, and others were interviewed. 

  19. 76 FR 70414 - National Fire Protection Association (NFPA) Proposes To Revise Codes and Standards

    Science.gov (United States)

    2011-11-14

    ... Commercial Cooking Operations. NFPA 99--2012 Health Care Facilities Code 6/22/2012 NFPA 99B--2010 Standard... Explosion Investigations..... 1/4/2012 NFPA 1005--2007 Standard for Professional Qualifications for 1/4/2012 Marine Fire Fighting for Land-Based Fire Fighters. NFPA 1021--2009 Standard for Fire Officer Professional...

  20. Automated processing of thermal infrared images of Osservatorio Vesuviano permanent surveillance network by using Matlab code

    Science.gov (United States)

    Sansivero, Fabio; Vilardo, Giuseppe; Caputo, Teresa

    2017-04-01

    The permanent thermal infrared surveillance network of Osservatorio Vesuviano (INGV) is composed of 6 stations which acquire IR frames of fumarole fields in the Campi Flegrei caldera and inside the Vesuvius crater (Italy). The IR frames are uploaded to a dedicated server in the Surveillance Center of Osservatorio Vesuviano in order to process the infrared data and to excerpt all the information contained. In a first phase the infrared data are processed by an automated system (A.S.I.R.A. Acq- Automated System of IR Analysis and Acquisition) developed in Matlab environment and with a user-friendly graphic user interface (GUI). ASIRA daily generates time-series of residual temperature values of the maximum temperatures observed in the IR scenes after the removal of seasonal effects. These time-series are displayed in the Surveillance Room of Osservatorio Vesuviano and provide information about the evolution of shallow temperatures field of the observed areas. In particular the features of ASIRA Acq include: a) efficient quality selection of IR scenes, b) IR images co-registration in respect of a reference frame, c) seasonal correction by using a background-removal methodology, a) filing of IR matrices and of the processed data in shared archives accessible to interrogation. The daily archived records can be also processed by ASIRA Plot (Matlab code with GUI) to visualize IR data time-series and to help in evaluating inputs parameters for further data processing and analysis. Additional processing features are accomplished in a second phase by ASIRA Tools which is Matlab code with GUI developed to extract further information from the dataset in automated way. The main functions of ASIRA Tools are: a) the analysis of temperature variations of each pixel of the IR frame in a given time interval, b) the removal of seasonal effects from temperature of every pixel in the IR frames by using an analytic approach (removal of sinusoidal long term seasonal component by using a