WorldWideScience

Sample records for network-coded cooperative communications

  1. 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

  2. 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.

  3. 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.

  4. 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.

  5. 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...

  6. Reliability Improved Cooperative Communication over Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Zhuangbin Chen

    2017-10-01

    Full Text Available With the development of smart devices and connection technologies, Wireless Sensor Networks (WSNs are becoming increasingly intelligent. New or special functions can be obtained by receiving new versions of program codes to upgrade their software systems, forming the so-called smart Internet of Things (IoT. Due to the lossy property of wireless channels, data collection in WSNs still suffers from a long delay, high energy consumption, and many retransmissions. Thanks to wireless software-defined networks (WSDNs, software in sensors can now be updated to help them transmit data cooperatively, thereby achieving more reliable communication. In this paper, a Reliability Improved Cooperative Communication (RICC data collection scheme is proposed to improve the reliability of random-network-coding-based cooperative communications in multi-hop relay WSNs without reducing the network lifetime. In WSNs, sensors in different positions can have different numbers of packets to handle, resulting in the unbalanced energy consumption of the network. In particular, nodes in non-hotspot areas have up to 90% of their original energy remaining when the network dies. To efficiently use the residual energy, in RICC, high data transmission power is adopted in non-hotspot areas to achieve a higher reliability at the cost of large energy consumption, and relatively low transmission power is adopted in hotspot areas to maintain the long network lifetime. Therefore, high reliability and a long network lifetime can be obtained simultaneously. The simulation results show that compared with other scheme, RICC can reduce the end-to-end Message Fail delivering Ratio (MFR by 59.4%–62.8% under the same lifetime with a more balanced energy utilization.

  7. 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.

  8. 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.

  9. Game theory in communication networks cooperative resolution of interactive networking scenarios

    CERN Document Server

    Antoniou, Josephina

    2012-01-01

    A mathematical tool for scientists and researchers who work with computer and communication networks, Game Theory in Communication Networks: Cooperative Resolution of Interactive Networking Scenarios addresses the question of how to promote cooperative behavior in interactive situations between heterogeneous entities in communication networking scenarios. It explores network design and management from a theoretical perspective, using game theory and graph theory to analyze strategic situations and demonstrate profitable behaviors of the cooperative entities. The book promotes the use of Game T

  10. 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...

  11. 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.

  12. 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.

  13. 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

  14. Future cooperative communication systems driven by social mobile networks

    DEFF Research Database (Denmark)

    Blázovics, L.; Varga, C.; Bamford, W.

    2011-01-01

    In this work we are underlining the importance of social mobile networks for upcoming cooperative communication systems. The assumption of this work is that future mobile communication systems will incorporate user cooperation, i.e. a combination of cellular access in parallel with ongoing short...... cases. By the example of the Gedda-Headz gaming community, possible links between cooperative mobile communication and social mobile networks are shown....

  15. 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...

  16. 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…

  17. 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.

  18. Performance Analysis for Cooperative Communication System with QC-LDPC Codes Constructed with Integer Sequences

    Directory of Open Access Journals (Sweden)

    Yan Zhang

    2015-01-01

    Full Text Available This paper presents four different integer sequences to construct quasi-cyclic low-density parity-check (QC-LDPC codes with mathematical theory. The paper introduces the procedure of the coding principle and coding. Four different integer sequences constructing QC-LDPC code are compared with LDPC codes by using PEG algorithm, array codes, and the Mackey codes, respectively. Then, the integer sequence QC-LDPC codes are used in coded cooperative communication. Simulation results show that the integer sequence constructed QC-LDPC codes are effective, and overall performance is better than that of other types of LDPC codes in the coded cooperative communication. The performance of Dayan integer sequence constructed QC-LDPC is the most excellent performance.

  19. Throughput Maximization for Cognitive Radio Networks Using Active Cooperation and Superposition Coding

    KAUST Repository

    Hamza, Doha R.

    2015-02-13

    We propose a three-message superposition coding scheme in a cognitive radio relay network exploiting active cooperation between primary and secondary users. The primary user is motivated to cooperate by substantial benefits it can reap from this access scenario. Specifically, the time resource is split into three transmission phases: The first two phases are dedicated to primary communication, while the third phase is for the secondary’s transmission. We formulate two throughput maximization problems for the secondary network subject to primary user rate constraints and per-node power constraints with respect to the time durations of primary transmission and the transmit power of the primary and the secondary users. The first throughput maximization problem assumes a partial power constraint such that the secondary power dedicated to primary cooperation, i.e. for the first two communication phases, is fixed apriori. In the second throughput maximization problem, a total power constraint is assumed over the three phases of communication. The two problems are difficult to solve analytically when the relaying channel gains are strictly greater than each other and strictly greater than the direct link channel gain. However, mathematically tractable lowerbound and upperbound solutions can be attained for the two problems. For both problems, by only using the lowerbound solution, we demonstrate significant throughput gains for both the primary and the secondary users through this active cooperation scheme. We find that most of the throughput gains come from minimizing the second phase transmission time since the secondary nodes assist the primary communication during this phase. Finally, we demonstrate the superiority of our proposed scheme compared to a number of reference schemes that include best relay selection, dual-hop routing, and an interference channel model.

  20. Throughput Maximization for Cognitive Radio Networks Using Active Cooperation and Superposition Coding

    KAUST Repository

    Hamza, Doha R.; Park, Kihong; Alouini, Mohamed-Slim; Aissa, Sonia

    2015-01-01

    We propose a three-message superposition coding scheme in a cognitive radio relay network exploiting active cooperation between primary and secondary users. The primary user is motivated to cooperate by substantial benefits it can reap from this access scenario. Specifically, the time resource is split into three transmission phases: The first two phases are dedicated to primary communication, while the third phase is for the secondary’s transmission. We formulate two throughput maximization problems for the secondary network subject to primary user rate constraints and per-node power constraints with respect to the time durations of primary transmission and the transmit power of the primary and the secondary users. The first throughput maximization problem assumes a partial power constraint such that the secondary power dedicated to primary cooperation, i.e. for the first two communication phases, is fixed apriori. In the second throughput maximization problem, a total power constraint is assumed over the three phases of communication. The two problems are difficult to solve analytically when the relaying channel gains are strictly greater than each other and strictly greater than the direct link channel gain. However, mathematically tractable lowerbound and upperbound solutions can be attained for the two problems. For both problems, by only using the lowerbound solution, we demonstrate significant throughput gains for both the primary and the secondary users through this active cooperation scheme. We find that most of the throughput gains come from minimizing the second phase transmission time since the secondary nodes assist the primary communication during this phase. Finally, we demonstrate the superiority of our proposed scheme compared to a number of reference schemes that include best relay selection, dual-hop routing, and an interference channel model.

  1. 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...

  2. Joint Preprocesser-Based Detectors for One-Way and Two-Way Cooperative Communication Networks

    KAUST Repository

    Abuzaid, Abdulrahman I.

    2014-01-01

    Efficient receiver designs for cooperative communication networks are becoming increasingly important. In previous work, cooperative networks communicated with the use of L relays. As the receiver is constrained, channel shortening and reduced

  3. 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.

  4. Communication and cooperation in networked environments: an experimental analysis.

    Science.gov (United States)

    Galimberti, C; Ignazi, S; Vercesi, P; Riva, G

    2001-02-01

    Interpersonal communication and cooperation do not happen exclusively face to face. In work contexts, as in private life, there are more and more situations of mediated communication and cooperation in which new online tools are used. However, understanding how to use the Internet to support collaborative interaction presents a substantial challenge for the designers and users of this emerging technology. First, collaborative Internet environments are designed to serve a purpose, so must be designed with intended users' tasks and goals explicitly considered. Second, in cooperative activities the key content of communication is the interpretation of the situations in which actors are involved. So, the most effective way of clarifying the meaning of messages is to connect them to a shared context of meaning. However, this is more difficult in the Internet than in other computer-based activities. This paper tries to understand the characteristics of cooperative activities in networked environments--shared 3D virtual worlds--through two different studies. The first used the analysis of conversations to explore the characteristics of the interaction during the cooperative task; the second analyzed whether and how the level of immersion in the networked environments influenced the performance and the interactional process. The results are analyzed to identify the psychosocial roots used to support cooperation in a digital interactive communication.

  5. 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...

  6. Cellular Controlled Short-Range Communication for Cooperative P2P Networking

    DEFF Research Database (Denmark)

    Fitzek, Frank H. P.; Katz, Marcos; Zhang, Qi

    2009-01-01

    -range communication network among cooperating mobile and wireless devices. The role of the mobile device will change, from being an agnostic entity in respect to the surrounding world to a cognitive device. This cognitive device is capable of being aware of the neighboring devices as well as on the possibility......This article advocates a novel communication architecture and associated collaborative framework for future wireless communication systems. In contrast to the dominating cellular architecture and the upcoming peer-to-peer architecture, the new approach envisions a cellular controlled short...... to establish cooperation with them. The novel architecture together with several possible cooperative strategies will bring clear benefits for the network and service providers, mobile device manufacturers and also end users....

  7. 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...

  8. 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...

  9. 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.

  10. Towards Reliable and Energy-Efficient Incremental Cooperative Communication for Wireless Body Area Networks.

    Science.gov (United States)

    Yousaf, Sidrah; Javaid, Nadeem; Qasim, Umar; Alrajeh, Nabil; Khan, Zahoor Ali; Ahmed, Mansoor

    2016-02-24

    In this study, we analyse incremental cooperative communication for wireless body area networks (WBANs) with different numbers of relays. Energy efficiency (EE) and the packet error rate (PER) are investigated for different schemes. We propose a new cooperative communication scheme with three-stage relaying and compare it to existing schemes. Our proposed scheme provides reliable communication with less PER at the cost of surplus energy consumption. Analytical expressions for the EE of the proposed three-stage cooperative communication scheme are also derived, taking into account the effect of PER. Later on, the proposed three-stage incremental cooperation is implemented in a network layer protocol; enhanced incremental cooperative critical data transmission in emergencies for static WBANs (EInCo-CEStat). Extensive simulations are conducted to validate the proposed scheme. Results of incremental relay-based cooperative communication protocols are compared to two existing cooperative routing protocols: cooperative critical data transmission in emergencies for static WBANs (Co-CEStat) and InCo-CEStat. It is observed from the simulation results that incremental relay-based cooperation is more energy efficient than the existing conventional cooperation protocol, Co-CEStat. The results also reveal that EInCo-CEStat proves to be more reliable with less PER and higher throughput than both of the counterpart protocols. However, InCo-CEStat has less throughput with a greater stability period and network lifetime. Due to the availability of more redundant links, EInCo-CEStat achieves a reduced packet drop rate at the cost of increased energy consumption.

  11. A Cooperative Communication Model Tailored for Energy Balance in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Camila F. Rêgo

    2017-08-01

    Full Text Available Wireless Sensor Networks (WSN are characterized by their capacity of monitoring the environment, gathering and sharing information. Nodes in a WSN usually cooperate in the task of forwarding the sensed data to a sink node for later retrieval and analysis. The success of this task depends on the availability of efficient routes that meet the application requirements. As topology may change overtime, alternatives to improve and maintain network connectivity are highly desired. In this context, Cooperative Communication (CC emerged as an alternative to improve network connectivity. Despite its benefits, CC-links are known to have higher energy demands as compared to traditional, direct, links. In particular, CC-links require the source node to expend more power than others nodes, shortening their life span. The main contribution of this paper is to propose a new Cooperative Communication model, capable of increasing the energy balance of the CC-links while improving network connectivity. Simulation results show that, compared to other CC schemes, the source node of a Cooperative Communication reduces the amount of expended energy by 68% in the evaluated settings.

  12. 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.

  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. Energy Efficient Four Level Cooperative Opportunistic Communication for Wireless Personal Area Networks (WPAN)

    DEFF Research Database (Denmark)

    Rohokale, Vandana M.; Inamdar, Sandeep; Prasad, Neeli R.

    2013-01-01

    For wireless sensor networks (WSN),energy is a scarce resource. Due to limited battery resources, the energy consumption is the critical issue for the transmission as well as reception of the signals in the wireless communication. WSNs are infrastructure-less shared network demanding more energy...... consumption due to collaborative transmissions. This paper proposes a new cooperative opportunistic four level model for IEEE 802.15.4 Wireless Personal Area Network (WPAN).The average per node energy consumption is observed merely about 0.17mJ for the cooperative wireless communication which proves...... the proposed mechanism to be energy efficient. This paper further proposes four levels of cooperative data transmission from source to destination to improve network coverage with energy efficiency....

  15. Communication and cooperation in underwater acoustic networks

    Science.gov (United States)

    Yerramalli, Srinivas

    In this thesis, we present a study of several problems related to underwater point to point communications and network formation. We explore techniques to improve the achievable data rate on a point to point link using better physical layer techniques and then study sensor cooperation which improves the throughput and reliability in an underwater network. Robust point-to-point communications in underwater networks has become increasingly critical in several military and civilian applications related to underwater communications. We present several physical layer signaling and detection techniques tailored to the underwater channel model to improve the reliability of data detection. First, a simplified underwater channel model in which the time scale distortion on each path is assumed to be the same (single scale channel model in contrast to a more general multi scale model). A novel technique, which exploits the nature of OFDM signaling and the time scale distortion, called Partial FFT Demodulation is derived. It is observed that this new technique has some unique interference suppression properties and performs better than traditional equalizers in several scenarios of interest. Next, we consider the multi scale model for the underwater channel and assume that single scale processing is performed at the receiver. We then derive optimized front end pre-processing techniques to reduce the interference caused during single scale processing of signals transmitted on a multi-scale channel. We then propose an improvised channel estimation technique using dictionary optimization methods for compressive sensing and show that significant performance gains can be obtained using this technique. In the next part of this thesis, we consider the problem of sensor node cooperation among rational nodes whose objective is to improve their individual data rates. We first consider the problem of transmitter cooperation in a multiple access channel and investigate the stability of

  16. 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...

  17. Cooperation Dynamics on Mobile Crowd Networks of Device-to-Device Communications

    Directory of Open Access Journals (Sweden)

    Yong Deng

    2016-01-01

    Full Text Available The explosive use of smart devices enabled the emergence of collective resource sharing among mobile individuals. Mobile users need to cooperate with each other to improve the whole network’s quality of service. By modeling the cooperative behaviors in a mobile crowd into an evolutionary Prisoner’s dilemma game, we investigate the relationships between cooperation rate and some main influence factors, including crowd density, communication range, temptation to defect, and mobility attributes. Using evolutionary game theory, our analysis on the cooperative behaviors of mobile takes a deep insight into the cooperation promotion in a dynamical network with selfish autonomous users. The experiment results show that mobile user’s features, including speed, moving probability, and reaction radius, have an obvious influence on the formation of a cooperative mobile social network. We also found some optimal status when the crowd’s cooperation rate reaches the best. These findings are important if we want to establish a mobile social network with a good performance.

  18. 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.

  19. 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.

  20. 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....

  1. 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...

  2. 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.

  3. 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.

  4. 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....

  5. 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.

  6. 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.

  7. 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.

  8. On Hybrid Cooperation in Underlay Cognitive Radio Networks

    DEFF Research Database (Denmark)

    Mahmood, Nurul Huda; Yilmaz, Ferkan; Øien, Geir E.

    2013-01-01

    of opportunistic wireless systems such as cognitive radio networks. In order to balance the performance gains from cooperative communication against the possible over-utilization of resources, we propose and analyze an adaptive-cooperation technique for underlay cognitive radio networks, termed as hybrid......Cooperative communication is a promising strategy to enhance the performance of a communication network as it helps to improve the coverage area and the outage performance. However, such enhancement comes at the expense of increased resource utilization, which is undesirable; more so in the case......-cooperation. Under the proposed cooperation scheme, secondary users in a cognitive radio network cooperate adaptively to enhance the spectral efficiency and the error performance of the network. The bit error rate, the spectral efficiency and the outage performance of the network under the proposed hybrid...

  9. 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

  10. 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.

  11. 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...

  12. 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

  13. 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...

  14. Cooperative Convex Optimization in Networked Systems: Augmented Lagrangian Algorithms With Directed Gossip Communication

    Science.gov (United States)

    Jakovetic, Dusan; Xavier, João; Moura, José M. F.

    2011-08-01

    We study distributed optimization in networked systems, where nodes cooperate to find the optimal quantity of common interest, x=x^\\star. The objective function of the corresponding optimization problem is the sum of private (known only by a node,) convex, nodes' objectives and each node imposes a private convex constraint on the allowed values of x. We solve this problem for generic connected network topologies with asymmetric random link failures with a novel distributed, decentralized algorithm. We refer to this algorithm as AL-G (augmented Lagrangian gossiping,) and to its variants as AL-MG (augmented Lagrangian multi neighbor gossiping) and AL-BG (augmented Lagrangian broadcast gossiping.) The AL-G algorithm is based on the augmented Lagrangian dual function. Dual variables are updated by the standard method of multipliers, at a slow time scale. To update the primal variables, we propose a novel, Gauss-Seidel type, randomized algorithm, at a fast time scale. AL-G uses unidirectional gossip communication, only between immediate neighbors in the network and is resilient to random link failures. For networks with reliable communication (i.e., no failures,) the simplified, AL-BG (augmented Lagrangian broadcast gossiping) algorithm reduces communication, computation and data storage cost. We prove convergence for all proposed algorithms and demonstrate by simulations the effectiveness on two applications: l_1-regularized logistic regression for classification and cooperative spectrum sensing for cognitive radio networks.

  15. Communicating Cooperative Robots with Bluetooth

    DEFF Research Database (Denmark)

    Schiøler, Henrik; Son, L.T.; Madsen, Ole Brun

    2001-01-01

    A generic architecture for system of cooperating communicating mobile robots is presented. An overall structure is defined from a modularity viewpoint, where a number of generic modules are identified; low level communication interface, network layer services such as initial and adaptive network...... structuring, routing and capacity management, overall behaviour which includes commitment to overall strategies as well as local behaviour like trajectory planning and navigation. Focus is kept on communication aspects and an example application of establishing a reliable wireless real-time communication...

  16. On hybrid cooperation in underlay cognitive radio networks

    KAUST Repository

    Mahmood, Nurul Huda

    2013-09-01

    Cooperative communication is a promising strategy to enhance the performance of a communication network as it helps to improve the coverage area and the outage performance. However, such enhancement comes at the expense of increased resource utilization, which is undesirable; more so in the case of opportunistic wireless systems such as cognitive radio networks. In order to balance the performance gains from cooperative communication against the possible over-utilization of resources, we propose and analyze an adaptive-cooperation technique for underlay cognitive radio networks, termed as hybrid-cooperation. Under the proposed cooperation scheme, secondary users in a cognitive radio network cooperate adaptively to enhance the spectral efficiency and the error performance of the network. The bit error rate, the spectral efficiency and the outage performance of the network under the proposed hybrid cooperation scheme with amplify-and-forward relaying are analyzed in this paper, and compared against conventional cooperation technique. Findings of the analytical performance analyses are further validated numerically through selected computer-based Monte-Carlo simulations. The proposed scheme is found to achieve significantly better performance in terms of the spectral efficiency and the bit error rate, compared to the conventional amplify-and-forward cooperation scheme. © 2013 IEEE.

  17. 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

  18. Joint Preprocesser-Based Detectors for One-Way and Two-Way Cooperative Communication Networks

    KAUST Repository

    Abuzaid, Abdulrahman I.

    2014-05-01

    Efficient receiver designs for cooperative communication networks are becoming increasingly important. In previous work, cooperative networks communicated with the use of L relays. As the receiver is constrained, channel shortening and reduced-rank techniques were employed to design the preprocessing matrix that reduces the length of the received vector from L to U. In the first part of the work, a receiver structure is proposed which combines our proposed threshold selection criteria with the joint iterative optimization (JIO) algorithm that is based on the mean square error (MSE). Our receiver assists in determining the optimal U. Furthermore, this receiver provides the freedom to choose U for each frame depending on the tolerable difference allowed for MSE. Our study and simulation results show that by choosing an appropriate threshold, it is possible to gain in terms of complexity savings while having no or minimal effect on the BER performance of the system. Furthermore, the effect of channel estimation on the performance of the cooperative system is investigated. In the second part of the work, a joint preprocessor-based detector for cooperative communication networks is proposed for one-way and two-way relaying. This joint preprocessor-based detector operates on the principles of minimizing the symbol error rate (SER) instead of minimizing MSE. For a realistic assessment, pilot symbols are used to estimate the channel. From our simulations, it can be observed that our proposed detector achieves the same SER performance as that of the maximum likelihood (ML) detector with all participating relays. Additionally, our detector outperforms selection combining (SC), channel shortening (CS) scheme and reduced-rank techniques when using the same U. Finally, our proposed scheme has the lowest computational complexity.

  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. Communication devices for network-hopping communications and methods of network-hopping communications

    Science.gov (United States)

    Buttles, John W

    2013-04-23

    Wireless communication devices include a software-defined radio coupled to processing circuitry. The system controller is configured to execute computer programming code. Storage media is coupled to the system controller and includes computer programming code configured to cause the system controller to configure and reconfigure the software-defined radio to operate on each of a plurality of communication networks according to a selected sequence. Methods for communicating with a wireless device and methods of wireless network-hopping are also disclosed.

  2. Cooperative communications hardware, channel and PHY

    CERN Document Server

    Dohler, Mischa

    2010-01-01

    Facilitating Cooperation for Wireless Systems Cooperative Communications: Hardware, Channel & PHY focuses on issues pertaining to the PHY layer of wireless communication networks, offering a rigorous taxonomy of this dispersed field, along with a range of application scenarios for cooperative and distributed schemes, demonstrating how these techniques can be employed. The authors discuss hardware, complexity and power consumption issues, which are vital for understanding what can be realized at the PHY layer, showing how wireless channel models differ from more traditional

  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. 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...

  5. Worst-Case Cooperative Jamming for Secure Communications in CIoT Networks.

    Science.gov (United States)

    Li, Zhen; Jing, Tao; Ma, Liran; Huo, Yan; Qian, Jin

    2016-03-07

    The Internet of Things (IoT) is a significant branch of the ongoing advances in the Internet and mobile communications. The use of a large number of IoT devices makes the spectrum scarcity problem even more serious. The usable spectrum resources are almost entirely occupied, and thus, the increasing radio access demands of IoT devices cannot be met. To tackle this problem, the Cognitive Internet of Things (CIoT) has been proposed. In a CIoT network, secondary users, i.e., sensors and actuators, can access the licensed spectrum bands provided by licensed primary users (such as telephones). Security is a major concern in CIoT networks. However, the traditional encryption method at upper layers (such as symmetric cryptography and asymmetric cryptography) may be compromised in CIoT networks, since these types of networks are heterogeneous. In this paper, we address the security issue in spectrum-leasing-based CIoT networks using physical layer methods. Considering that the CIoT networks are cooperative networks, we propose to employ cooperative jamming to achieve secrecy transmission. In the cooperative jamming scheme, a certain secondary user is employed as the helper to harvest energy transmitted by the source and then uses the harvested energy to generate an artificial noise that jams the eavesdropper without interfering with the legitimate receivers. The goal is to minimize the signal to interference plus noise ratio (SINR) at the eavesdropper subject to the quality of service (QoS) constraints of the primary traffic and the secondary traffic. We formulate the considered minimization problem into a two-stage robust optimization problem based on the worst-case Channel State Information of the Eavesdropper. By using semi-definite programming (SDP), the optimal solutions of the transmit covariance matrices can be obtained. Moreover, in order to build an incentive mechanism for the secondary users, we propose an auction framework based on the cooperative jamming scheme

  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. Worst-Case Cooperative Jamming for Secure Communications in CIoT Networks

    Directory of Open Access Journals (Sweden)

    Zhen Li

    2016-03-01

    Full Text Available The Internet of Things (IoT is a significant branch of the ongoing advances in the Internet and mobile communications. Yet, the use of a large number of IoT devices can severely worsen the spectrum scarcity problem. The usable spectrum resources are almost entirely occupied, and thus, the increasing demands of radio access from IoT devices cannot be met. To tackle this problem, the Cognitive Internet of Things (CIoT has been proposed. In a CIoT network, secondary users, i.e., sensors and actuators, can access the licensed spectrum bands provided by licensed primary users (such as cellular telephones. Security is a major concern in CIoT networks. However, the traditional encryption method at upper layers (such as symmetric and asymmetric ciphers may not be suitable for CIoT networks since these networks are composed of low-profile devices. In this paper, we address the security issues in spectrum-leasing-based CIoT networks using physical layer methods. Considering that the CIoT networks are cooperative in nature, we propose to employ cooperative jamming to achieve secure transmission. In our proposed cooperative jamming scheme, a certain secondary user is employed as the helper to harvest energy transmitted by the source and then uses the harvested energy to generate an artificial noise that jams the eavesdropper without interfering with the legitimate receivers. The goal is to minimize the Signal to Interference plus Noise Ratio (SINR at the eavesdropper subject to the Quality of Service (QoS constraints of the primary traffic and the secondary traffic. We formulate the minimization problem into a two-stage robust optimization problem based on the worst-case Channel State Information of the Eavesdropper (ECSI. By using Semi-Definite Programming (SDP, the optimal solutions of the transmit covariance matrices can be obtained. Moreover, in order to build an incentive mechanism for the secondary users, we propose an auction framework based on the

  8. Cooperative Cloudlet for Pervasive Networks

    Directory of Open Access Journals (Sweden)

    Tauseef Jamal

    2017-05-01

    Full Text Available The notion of cooperation in wireless communication has got significant attention from both academia and industrial persons towards to address the performance drawbacks of wireless sensor network due to reason of user’s high mobility and lack of resources of network. The future wireless systems should be highly heterogeneous and interconnected because motivating cooperative relaying has to apply on the future mobile network for efficient results and future demand. As currently the mobile computing is facing latency and battery drainage issues which need to address and solve hence in this work we are proposed mobile - centric and opportunistic communication architecture. In this work mobile devices which are in the range of Wi - Fi of each other can create cluste r with each other and can create an ad - hoc cooperative cloud using Relay Spot[1 - 4]. The Collaboration between these devices can enable them to resourcefully use the augmentation without any infrastructure.

  9. 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...

  10. Cognitive radio networks efficient resource allocation in cooperative sensing, cellular communications, high-speed vehicles, and smart grid

    CERN Document Server

    Jiang, Tao; Cao, Yang

    2015-01-01

    PrefaceAcknowledgmentsAbout the AuthorsIntroductionCognitive Radio-Based NetworksOpportunistic Spectrum Access NetworksCognitive Radio Networks with Cooperative SensingCognitive Radio Networks for Cellular CommunicationsCognitive Radio Networks for High-Speed VehiclesCognitive Radio Networks for a Smart GridContent and OrganizationTransmission Slot Allocation in an Opportunistic Spectrum Access NetworkSingle-User Single-Channel System ModelProbabilistic Slot Allocation SchemeOptimal Probabilistic Slot AllocationBaseline PerformanceExponential DistributionHyper-Erlang DistributionPerformance An

  11. 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.

  12. Towards Efficient Wireless Body Area Network Using Two-Way Relay Cooperation.

    Science.gov (United States)

    Waheed, Maham; Ahmad, Rizwan; Ahmed, Waqas; Drieberg, Micheal; Alam, Muhammad Mahtab

    2018-02-13

    The fabrication of lightweight, ultra-thin, low power and intelligent body-borne sensors leads to novel advances in wireless body area networks (WBANs). Depending on the placement of the nodes, it is characterized as in/on body WBAN; thus, the channel is largely affected by body posture, clothing, muscle movement, body temperature and climatic conditions. The energy resources are limited and it is not feasible to replace the sensor's battery frequently. In order to keep the sensor in working condition, the channel resources should be reserved. The lifetime of the sensor is very crucial and it highly depends on transmission among sensor nodes and energy consumption. The reliability and energy efficiency in WBAN applications play a vital role. In this paper, the analytical expressions for energy efficiency (EE) and packet error rate (PER) are formulated for two-way relay cooperative communication. The results depict better reliability and efficiency compared to direct and one-way relay communication. The effective performance range of direct vs. cooperative communication is separated by a threshold distance. Based on EE calculations, an optimal packet size is observed that provides maximum efficiency over a certain link length. A smart and energy efficient system is articulated that utilizes all three communication modes, namely direct, one-way relay and two-way relay, as the direct link performs better for a certain range, but the cooperative communication gives better results for increased distance in terms of EE. The efficacy of the proposed hybrid scheme is also demonstrated over a practical quasi-static channel. Furthermore, link length extension and diversity is achieved by joint network-channel (JNC) coding the cooperative link.

  13. Towards Efficient Wireless Body Area Network Using Two-Way Relay Cooperation

    Directory of Open Access Journals (Sweden)

    Maham Waheed

    2018-02-01

    Full Text Available The fabrication of lightweight, ultra-thin, low power and intelligent body-borne sensors leads to novel advances in wireless body area networks (WBANs. Depending on the placement of the nodes, it is characterized as in/on body WBAN; thus, the channel is largely affected by body posture, clothing, muscle movement, body temperature and climatic conditions. The energy resources are limited and it is not feasible to replace the sensor’s battery frequently. In order to keep the sensor in working condition, the channel resources should be reserved. The lifetime of the sensor is very crucial and it highly depends on transmission among sensor nodes and energy consumption. The reliability and energy efficiency in WBAN applications play a vital role. In this paper, the analytical expressions for energy efficiency (EE and packet error rate (PER are formulated for two-way relay cooperative communication. The results depict better reliability and efficiency compared to direct and one-way relay communication. The effective performance range of direct vs. cooperative communication is separated by a threshold distance. Based on EE calculations, an optimal packet size is observed that provides maximum efficiency over a certain link length. A smart and energy efficient system is articulated that utilizes all three communication modes, namely direct, one-way relay and two-way relay, as the direct link performs better for a certain range, but the cooperative communication gives better results for increased distance in terms of EE. The efficacy of the proposed hybrid scheme is also demonstrated over a practical quasi-static channel. Furthermore, link length extension and diversity is achieved by joint network-channel (JNC coding the cooperative link.

  14. On hybrid cooperation in underlay cognitive radio networks

    KAUST Repository

    Mahmood, Nurul Huda

    2012-11-01

    In wireless systems where transmitters are subject to a strict received power constraint, such as in underlay cognitive radio networks, cooperative communication is a promising strategy to enhance network performance, as it helps to improve the coverage area and outage performance of a network. However, this comes at the expense of increased resource utilization. To balance the performance gain against the possible over-utilization of resources, we propose a hybrid-cooperation technique for underlay cognitive radio networks, where secondary users cooperate only when required. Various performance measures of the proposed hybrid-cooperation technique are analyzed in this paper, and are also further validated numerically. © 2012 IEEE.

  15. Improving the physical layer security of wireless communication networks using spread spectrum coding and artificial noise approach

    CSIR Research Space (South Africa)

    Adedeji, K

    2016-09-01

    Full Text Available at the application layer to protect the messages against eavesdropping. However, the evolution of strong deciphering mechanisms has made conventional cryptography-based security techniques ineffective against attacks from an intruder. Figure 1: Layer protocol... communication networks with passive and active eavesdropper,” IEEE Globecom; Wireless Communication System, pp. 4868-4873, 2012. [9] Y. Zou, X. Wang and W. Shen, “Optimal relay selection for physical layer security in cooperative wireless networks,” IEEE...

  16. Cooperative Spatial Retreat for Resilient Drone Networks.

    Science.gov (United States)

    Kang, Jin-Hyeok; Kwon, Young-Min; Park, Kyung-Joon

    2017-05-03

    Drones are broadening their scope to various applications such as networking, package delivery, agriculture, rescue, and many more. For proper operation of drones, reliable communication should be guaranteed because drones are remotely controlled. When drones experience communication failure due to bad channel condition, interference, or jamming in a certain area, one existing solution is to exploit mobility or so-called spatial retreat to evacuate them from the communication failure area. However, the conventional spatial retreat scheme moves drones in random directions, which results in inefficient movement with significant evacuation time and waste of battery lifetime. In this paper, we propose a novel spatial retreat technique that takes advantage of cooperation between drones for resilient networking, which is called cooperative spatial retreat (CSR). Our performance evaluation shows that the proposed CSR significantly outperforms existing schemes.

  17. A Multi-Vehicles, Wireless Testbed for Networked Control, Communications and Computing

    Science.gov (United States)

    Murray, Richard; Doyle, John; Effros, Michelle; Hickey, Jason; Low, Steven

    2002-03-01

    We have constructed a testbed consisting of 4 mobile vehicles (with 4 additional vehicles being completed), each with embedded computing and communications capability for use in testing new approaches for command and control across dynamic networks. The system is being used or is planned to be used for testing of a variety of communications-related technologies, including distributed command and control algorithms, dynamically reconfigurable network topologies, source coding for real-time transmission of data in lossy environments, and multi-network communications. A unique feature of the testbed is the use of vehicles that have second order dynamics. Requiring real-time feedback algorithms to stabilize the system while performing cooperative tasks. The testbed was constructed in the Caltech Vehicles Laboratory and consists of individual vehicles with PC-based computation and controls, and multiple communications devices (802.11 wireless Ethernet, Bluetooth, and infrared). The vehicles are freely moving, wheeled platforms propelled by high performance dotted fairs. The room contains an access points for an 802.11 network, overhead visual sensing (to allow emulation of CI'S signal processing), a centralized computer for emulating certain distributed computations, and network gateways to control and manipulate communications traffic.

  18. How to increase the benefits of cooperation: Effects of training in transactive communication on cooperative learning.

    Science.gov (United States)

    Jurkowski, Susanne; Hänze, Martin

    2015-09-01

    Transactive communication means referring to and building on a learning partner's idea, by, for example, extending the partner's idea or interlinking the partner's idea with an idea of one's own. This transforms the partner's idea into a more elaborate one. Previous research found a positive relationship between students' transactive communication and their learning results when working in small groups. To increase the benefits of cooperation, we developed and tested a module for training students in transactive communication. We assumed that this training would enhance students' transactive communication and also increase their knowledge acquisition during cooperative learning. Further, we distinguished between an actor's transactive communication and a learning partner's transactive communication and expected both to be positively associated with an actor's knowledge acquisition. Participants were 80 university students. In an experiment with pre- and post-test measurements, transactive communication was measured by coding students' communication in a cooperative learning situation before training and in another cooperative learning situation after training. For the post-test cooperative learning situation, knowledge was pre-tested and post-tested. Trained students outperformed controls in transactive communication and in knowledge acquisition. Positive training effects on actors' knowledge acquisition were partially mediated by the improved actors' transactive communication. Moreover, actors' knowledge acquisition was positively influenced by learning partners' transactive communication. Results show a meaningful increase in the benefits of cooperation through the training in transactive communication. Furthermore, findings indicate that students benefit from both elaborating on their partner's ideas and having their own ideas elaborated on. © 2015 The British Psychological Society.

  19. 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.

  20. BICM-based cooperative communication systems with relay selection: Constellation and multiplexer design

    KAUST Repository

    Malik, Muhammad Talha

    2014-09-01

    We propose a new bit-interleaved coded modulation (BICM)-based cooperative communication system where different BICM modules can be optimized jointly considering the average signal to noise ratios of the direct and the two-hop Rayleigh fading channels. As such, the full benefit of BICM can be exploited in the context of cooperative communication. Our design considers cooperative communication systems with so called max-min relay selection scheme that has no loss in performance in terms of diversity- multiplexing trade off in orthogonal cooperation. The presented numerical results for rate 1/2 convolutional code with 8-ary pulse amplitude modulation equivalently 64-ary quadrature amplitude modulation show that the proposed design can offer gains up to 1.4 dB over the traditional BICM design for a target bit error rate of 10-6. Moreover the results show that the amount of gain depends on the relays\\' positions and increases with the number of relays available for selection.

  1. On hybrid cooperation in underlay cognitive radio networks

    KAUST Repository

    Mahmood, Nurul Huda; Yilmaz, Ferkan; Ø ien, Geir Egil; Alouini, Mohamed-Slim

    2013-01-01

    Cooperative communication is a promising strategy to enhance the performance of a communication network as it helps to improve the coverage area and the outage performance. However, such enhancement comes at the expense of increased resource

  2. Technological Cooperation Networks at Bio-Manguinhos: the Role of Information and Communication Technologies

    Directory of Open Access Journals (Sweden)

    Lázaro Pereira de Oliveira

    2015-01-01

    Full Text Available This article identifies and discusses the contribution of information and communication technologies (ICTs to the technological cooperation projects of Bio-Manguinhos, a pharmaceutical manufacturer that belongs to Osvaldo Cruz Foundation (FIOCRUZ, responsible for producing vaccines, reagents and biopharmaceuticals, with priority on meeting the needs of the Brazilian public health system. It is a case study with a qualitative approach for descriptive and explanatory purposes. The data were collected from 14 interviews conducted with managers of research and development (R&D projects with high relevance to the organization. The results allow concluding that the ICTs requiring greater interdependence between partners and two-way knowledge flows have not yet been used. They also show the importance of closer cooperation between the information technology (IT and R&D areas. A future positioning of Bio-Manguinhos as a technological center focused on discovery and sale of new active ingredients can favor the use of tools that promote greater integration between the partners of technology cooperation networks.

  3. 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...

  4. PRAGMATIC FOUNDATIONS OF COMMUNICATION CODE FAILURE IN PRESENT-DAY DISCOURSE

    Directory of Open Access Journals (Sweden)

    Pochtar Elena Ivanovna

    2014-09-01

    Full Text Available The article considers the issue of communicative regulations within the discourse frames as viewed through the fact of existing interconnection between speech arrangement modes and speech functional destinations; it analyzes the basic maxims of the P. Grice's Cooperation principle, initially formulated from the speaker's viewpoint, and finds out its relevance for the listeners, thus providing identity of speech behavior principles as shared by both participants in the communication process. Comparing each of the cooperative maxims with the communicative parameters of the present-day discourse the author discovers in it frequent violations of the Cooperation principles suggested by P. Grice and concludes that this system of speech relation fails in cases of discourse realizing an effective function. The article observes that the traditional communicative code is being pressed out as the basic regulator of conversation and goes through some pragmatic changes resulting in communication code failure in present day discourse, some other means of securing the perlocutionary effect in affective discourse are introduced by the author, the politeness principle and the principle of style in particular. Considering the basic mechanisms of these aestheticethical principles in application to the discourse of advertising the author finds proofs to them being functionally adequate and communicatively effective.

  5. 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.

  6. Asymmetrical Modulation for Uplink Communication in Cooperative Networks

    DEFF Research Database (Denmark)

    Zhang, Qi; Fitzek, Frank H.P.; Iversen, Villy Bæk

    2008-01-01

    -range links with neighboring mobile devices to form cooperative clusters. So far the physical communication over cellular links and over short-range links are separated in time or in frequency. Beyond this state of the art, we exploit a method, referred to as asymmetrical modulation, where a mobile device...

  7. Decentralized Control of Unmanned Aerial Robots for Wireless Airborne Communication Networks

    Directory of Open Access Journals (Sweden)

    Deok-Jin Lee

    2010-09-01

    Full Text Available This paper presents a cooperative control strategy for a team of aerial robotic vehicles to establish wireless airborne communication networks between distributed heterogeneous vehicles. Each aerial robot serves as a flying mobile sensor performing a reconfigurable communication relay node which enabls communication networks with static or slow-moving nodes on gorund or ocean. For distributed optimal deployment of the aerial vehicles for communication networks, an adaptive hill-climbing type decentralized control algorithm is developed to seek out local extremum for optimal localization of the vehicles. The sensor networks estabilished by the decentralized cooperative control approach can adopt its configuraiton in response to signal strength as the function of the relative distance between the autonomous aerial robots and distributed sensor nodes in the sensed environment. Simulation studies are conducted to evaluate the effectiveness of the proposed decentralized cooperative control technique for robust communication networks.

  8. An Energy Efficient Cooperative Hierarchical MIMO Clustering Scheme for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Sungyoung Lee

    2011-12-01

    Full Text Available In this work, we present an energy efficient hierarchical cooperative clustering scheme for wireless sensor networks. Communication cost is a crucial factor in depleting the energy of sensor nodes. In the proposed scheme, nodes cooperate to form clusters at each level of network hierarchy ensuring maximal coverage and minimal energy expenditure with relatively uniform distribution of load within the network. Performance is enhanced by cooperative multiple-input multiple-output (MIMO communication ensuring energy efficiency for WSN deployments over large geographical areas. We test our scheme using TOSSIM and compare the proposed scheme with cooperative multiple-input multiple-output (CMIMO clustering scheme and traditional multihop Single-Input-Single-Output (SISO routing approach. Performance is evaluated on the basis of number of clusters, number of hops, energy consumption and network lifetime. Experimental results show significant energy conservation and increase in network lifetime as compared to existing schemes.

  9. Cooperative Diversity in Wireless Networks

    Directory of Open Access Journals (Sweden)

    A. Mahmood

    2010-01-01

    Full Text Available Transmit Diversity is an effective methodology for improving the quality and reliability of a wireless network by reducingthe effects of fading. As majority of the wireless devices (i.e. mobile handsets, etc are limited to only one antenna, especiallydue to hardware constraints, size and cost factors; cooperative communication can be utilized in order to generatetransmit diversity [1]. This enables single antenna wireless devices to share their antennas during transmission in such amanner that creates a virtual MIMO (multiple-input and multiple-output system [2] [3]. In this paper, we will analyze therecent developments and trends in this promising area of wireless Ad hoc networks. The article will also discuss variousmain cooperative signaling methods and will also observe their performance.

  10. Cooperative Spatial Retreat for Resilient Drone Networks

    Science.gov (United States)

    Kang, Jin-Hyeok; Kwon, Young-Min; Park, Kyung-Joon

    2017-01-01

    Drones are broadening their scope to various applications such as networking, package delivery, agriculture, rescue, and many more. For proper operation of drones, reliable communication should be guaranteed because drones are remotely controlled. When drones experience communication failure due to bad channel condition, interference, or jamming in a certain area, one existing solution is to exploit mobility or so-called spatial retreat to evacuate them from the communication failure area. However, the conventional spatial retreat scheme moves drones in random directions, which results in inefficient movement with significant evacuation time and waste of battery lifetime. In this paper, we propose a novel spatial retreat technique that takes advantage of cooperation between drones for resilient networking, which is called cooperative spatial retreat (CSR). Our performance evaluation shows that the proposed CSR significantly outperforms existing schemes. PMID:28467390

  11. Energy-Efficient Cooperative Techniques for Infrastructure-to-Vehicle Communications

    OpenAIRE

    Nguyen , Tuan-Duc; Berder , Olivier; Sentieys , Olivier

    2011-01-01

    International audience; In wireless distributed networks, cooperative relay and cooperative Multi-Input Multi-Output (MIMO) techniques can be used to exploit the spatial and temporal diversity gain in order to increase the performance or reduce the transmission energy consumption. The energy efficiency of cooperative MIMO and relay techniques is then very useful for the Infrastructure to Vehicle (I2V) and Infrastructure to Infrastructure (I2I) communications in Intelligent Transport Systems (I...

  12. Overlapping coalition formation games in wireless communication networks

    CERN Document Server

    Wang, Tianyu; Saad, Walid; Han, Zhu

    2017-01-01

    This brief introduces overlapping coalition formation games (OCF games), a novel mathematical framework from cooperative game theory that can be used to model, design and analyze cooperative scenarios in future wireless communication networks. The concepts of OCF games are explained, and several algorithmic aspects are studied. In addition, several major application scenarios are discussed. These applications are drawn from a variety of fields that include radio resource allocation in dense wireless networks, cooperative spectrum sensing for cognitive radio networks, and resource management for crowd sourcing. For each application, the use of OCF games is discussed in detail in order to show how this framework can be used to solve relevant wireless networking problems. Overlapping Coalition Formation Games in Wireless Communication Networks provides researchers, students and practitioners with a concise overview of existing works in this emerging area, exploring the relevant fundamental theories, key techniqu...

  13. 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...

  14. Tactile communication, cooperation, and performance: an ethological study of the NBA.

    Science.gov (United States)

    Kraus, Michael W; Huang, Cassey; Keltner, Dacher

    2010-10-01

    Tactile communication, or physical touch, promotes cooperation between people, communicates distinct emotions, soothes in times of stress, and is used to make inferences of warmth and trust. Based on this conceptual analysis, we predicted that in group competition, physical touch would predict increases in both individual and group performance. In an ethological study, we coded the touch behavior of players from the National Basketball Association (NBA) during the 2008-2009 regular season. Consistent with hypotheses, early season touch predicted greater performance for individuals as well as teams later in the season. Additional analyses confirmed that touch predicted improved performance even after accounting for player status, preseason expectations, and early season performance. Moreover, coded cooperative behaviors between teammates explained the association between touch and team performance. Discussion focused on the contributions touch makes to cooperative groups and the potential implications for other group settings. (PsycINFO Database Record (c) 2010 APA, all rights reserved).

  15. Performance Analysis of Secondary Link with Cross-Layer Design and Cooperative Relay in Cognitive Radio Networks

    KAUST Repository

    Ma, Hao

    2012-06-01

    In this thesis, we investigate two different system infrastructures in underlay cognitive radio network, in which two popular techniques, cross-layer design and cooperative communication, are considered, respectively. In particular, we introduce the Aggressive Adaptive Modulation and Coding (A-AMC) into the cross-layer design and achieve the optimal boundary points in closed form to choose the AMC and A-AMC transmission modes by taking into account the Channel State Information (CSI) from the secondary transmitter to both the primary receiver and the secondary receiver. What’s more, for the cooperative communication design, we consider three different relay selection schemes: Partial Relay Selection, Opportunistic Relay Selection and Threshold Relay Selection. The Probability Density Functions (PDFs) of the Signal-to- Noise Ratio (SNR) in each hop for different selection schemes are provided, and then the exact closed-form expressions for the end-to-end packet loss rate in the secondary link considering the cooperation of the Decode-and-Forward (DF) relay for different relay selection schemes are derived.

  16. Bio-Inspired Energy-Aware Protocol Design for Cooperative Wireless Networks

    DEFF Research Database (Denmark)

    Perrucci, Gian Paolo; Anggraeni, Puri Novelti; Wardana, Satya Ardhy

    2011-01-01

    In this work, bio-inspired cooperation rules are applied to wireless communication networks. The main goal is to derive cooperative behaviour rules to improve the energy consumption of each mobile device. A medium access control (MAC) protocol particularly designed for peer-to-peer communication...... be achieved by this architecture using game theoretic approaches. As an extension, this work explores the impact of the MAC protocol on the power saving capabilities. This result shows that standard MAC mechanisms are not optimised for the considered cooperative setup. A new MAC protocol is proposed...... among cooperative wireless mobile devices is described. The work is based on a novel communication architecture, where a group of mobile devices are connected both to a cellular base station and among them using short-range communication links. A prior work has investigated the energy saving that can...

  17. 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 ...

  18. Channel coding for underwater acoustic single-carrier CDMA communication system

    Science.gov (United States)

    Liu, Lanjun; Zhang, Yonglei; Zhang, Pengcheng; Zhou, Lin; Niu, Jiong

    2017-01-01

    CDMA is an effective multiple access protocol for underwater acoustic networks, and channel coding can effectively reduce the bit error rate (BER) of the underwater acoustic communication system. For the requirements of underwater acoustic mobile networks based on CDMA, an underwater acoustic single-carrier CDMA communication system (UWA/SCCDMA) based on the direct-sequence spread spectrum is proposed, and its channel coding scheme is studied based on convolution, RA, Turbo and LDPC coding respectively. The implementation steps of the Viterbi algorithm of convolutional coding, BP and minimum sum algorithms of RA coding, Log-MAP and SOVA algorithms of Turbo coding, and sum-product algorithm of LDPC coding are given. An UWA/SCCDMA simulation system based on Matlab is designed. Simulation results show that the UWA/SCCDMA based on RA, Turbo and LDPC coding have good performance such that the communication BER is all less than 10-6 in the underwater acoustic channel with low signal to noise ratio (SNR) from -12 dB to -10dB, which is about 2 orders of magnitude lower than that of the convolutional coding. The system based on Turbo coding with Log-MAP algorithm has the best performance.

  19. A Probabilistic and Highly Efficient Topology Control Algorithm for Underwater Cooperating AUV Networks.

    Science.gov (United States)

    Li, Ning; Cürüklü, Baran; Bastos, Joaquim; Sucasas, Victor; Fernandez, Jose Antonio Sanchez; Rodriguez, Jonathan

    2017-05-04

    The aim of the Smart and Networking Underwater Robots in Cooperation Meshes (SWARMs) project is to make autonomous underwater vehicles (AUVs), remote operated vehicles (ROVs) and unmanned surface vehicles (USVs) more accessible and useful. To achieve cooperation and communication between different AUVs, these must be able to exchange messages, so an efficient and reliable communication network is necessary for SWARMs. In order to provide an efficient and reliable communication network for mission execution, one of the important and necessary issues is the topology control of the network of AUVs that are cooperating underwater. However, due to the specific properties of an underwater AUV cooperation network, such as the high mobility of AUVs, large transmission delays, low bandwidth, etc., the traditional topology control algorithms primarily designed for terrestrial wireless sensor networks cannot be used directly in the underwater environment. Moreover, these algorithms, in which the nodes adjust their transmission power once the current transmission power does not equal an optimal one, are costly in an underwater cooperating AUV network. Considering these facts, in this paper, we propose a Probabilistic Topology Control (PTC) algorithm for an underwater cooperating AUV network. In PTC, when the transmission power of an AUV is not equal to the optimal transmission power, then whether the transmission power needs to be adjusted or not will be determined based on the AUV's parameters. Each AUV determines their own transmission power adjustment probability based on the parameter deviations. The larger the deviation, the higher the transmission power adjustment probability is, and vice versa. For evaluating the performance of PTC, we combine the PTC algorithm with the Fuzzy logic Topology Control (FTC) algorithm and compare the performance of these two algorithms. The simulation results have demonstrated that the PTC is efficient at reducing the transmission power

  20. A Probabilistic and Highly Efficient Topology Control Algorithm for Underwater Cooperating AUV Networks

    Directory of Open Access Journals (Sweden)

    Ning Li

    2017-05-01

    Full Text Available The aim of the Smart and Networking Underwater Robots in Cooperation Meshes (SWARMs project is to make autonomous underwater vehicles (AUVs, remote operated vehicles (ROVs and unmanned surface vehicles (USVs more accessible and useful. To achieve cooperation and communication between different AUVs, these must be able to exchange messages, so an efficient and reliable communication network is necessary for SWARMs. In order to provide an efficient and reliable communication network for mission execution, one of the important and necessary issues is the topology control of the network of AUVs that are cooperating underwater. However, due to the specific properties of an underwater AUV cooperation network, such as the high mobility of AUVs, large transmission delays, low bandwidth, etc., the traditional topology control algorithms primarily designed for terrestrial wireless sensor networks cannot be used directly in the underwater environment. Moreover, these algorithms, in which the nodes adjust their transmission power once the current transmission power does not equal an optimal one, are costly in an underwater cooperating AUV network. Considering these facts, in this paper, we propose a Probabilistic Topology Control (PTC algorithm for an underwater cooperating AUV network. In PTC, when the transmission power of an AUV is not equal to the optimal transmission power, then whether the transmission power needs to be adjusted or not will be determined based on the AUV’s parameters. Each AUV determines their own transmission power adjustment probability based on the parameter deviations. The larger the deviation, the higher the transmission power adjustment probability is, and vice versa. For evaluating the performance of PTC, we combine the PTC algorithm with the Fuzzy logic Topology Control (FTC algorithm and compare the performance of these two algorithms. The simulation results have demonstrated that the PTC is efficient at reducing the

  1. Joint design of QC-LDPC codes for coded cooperation system with joint iterative decoding

    Science.gov (United States)

    Zhang, Shunwai; Yang, Fengfan; Tang, Lei; Ejaz, Saqib; Luo, Lin; Maharaj, B. T.

    2016-03-01

    In this paper, we investigate joint design of quasi-cyclic low-density-parity-check (QC-LDPC) codes for coded cooperation system with joint iterative decoding in the destination. First, QC-LDPC codes based on the base matrix and exponent matrix are introduced, and then we describe two types of girth-4 cycles in QC-LDPC codes employed by the source and relay. In the equivalent parity-check matrix corresponding to the jointly designed QC-LDPC codes employed by the source and relay, all girth-4 cycles including both type I and type II are cancelled. Theoretical analysis and numerical simulations show that the jointly designed QC-LDPC coded cooperation well combines cooperation gain and channel coding gain, and outperforms the coded non-cooperation under the same conditions. Furthermore, the bit error rate performance of the coded cooperation employing jointly designed QC-LDPC codes is better than those of random LDPC codes and separately designed QC-LDPC codes over AWGN channels.

  2. Cooperative OFDM underwater acoustic communications

    CERN Document Server

    Cheng, Xilin; Cheng, Xiang

    2016-01-01

    Following underwater acoustic channel modeling, this book investigates the relationship between coherence time and transmission distances. It considers the power allocation issues of two typical transmission scenarios, namely short-range transmission and medium-long range transmission. For the former scenario, an adaptive system is developed based on instantaneous channel state information. The primary focus is on cooperative dual-hop orthogonal frequency division multiplexing (OFDM). This book includes the decomposed fountain codes designed to enable reliable communications with higher energy efficiency. It covers the Doppler Effect, which improves packet transmission reliability for effective low-complexity mirror-mapping-based intercarrier interference cancellation schemes capable of suppressing the intercarrier interference power level. Designed for professionals and researchers in the field of underwater acoustic communications, this book is also suitable for advanced-level students in electrical enginee...

  3. Cooperative Jamming for Physical Layer Security in Wireless Sensor Networks

    DEFF Research Database (Denmark)

    Rohokale, Vandana M.; Prasad, Neeli R.; Prasad, Ramjee

    2012-01-01

    Interference is generally considered as the redundant and unwanted occurrence in wireless communication. This work proposes a novel cooperative jamming mechanism for scalable networks like Wireless Sensor Networks (WSNs) which makes use of friendly interference to confuse the eavesdropper...

  4. On a User-Centric Base Station Cooperation Scheme for Reliable Communications

    DEFF Research Database (Denmark)

    Kim, Dong Min; Thomsen, Henning; Popovski, Petar

    2017-01-01

    In this paper, we describe CoMP2flex, a user-centric base station (BS) cooperation scheme that provides improvements in reliability of both uplink (UL) and downlink (DL) communications of wireless cellular networks. CoMP2flex supports not only cooperation of two BSs with same direction of traffic...

  5. 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.

  6. 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

  7. 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...

  8. 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...

  9. COalitions in COOperation Networks (COCOON): Social Network Analysis and Game Theory to Enhance Cooperation Networks

    NARCIS (Netherlands)

    Sie, Rory

    2012-01-01

    Sie, R. L. L. (2012). COalitions in COOperation Networks (COCOON): Social Network Analysis and Game Theory to Enhance Cooperation Networks (Unpublished doctoral dissertation). September, 28, 2012, Open Universiteit in the Netherlands (CELSTEC), Heerlen, The Netherlands.

  10. Algebraic Number Precoded OFDM Transmission for Asynchronous Cooperative Multirelay Networks

    Directory of Open Access Journals (Sweden)

    Hua Jiang

    2014-01-01

    Full Text Available This paper proposes a space-time block coding (STBC transmission scheme for asynchronous cooperative systems. By combination of rotated complex constellations and Hadamard transform, these constructed codes are capable of achieving full cooperative diversity with the analysis of the pairwise error probability (PEP. Due to the asynchronous characteristic of cooperative systems, orthogonal frequency division multiplexing (OFDM technique with cyclic prefix (CP is adopted for combating timing delays from relay nodes. The total transmit power across the entire network is fixed and appropriate power allocation can be implemented to optimize the network performance. The relay nodes do not require decoding and demodulation operation, resulting in a low complexity. Besides, there is no delay for forwarding the OFDM symbols to the destination node. At the destination node the received signals have the corresponding STBC structure on each subcarrier. In order to reduce the decoding complexity, the sphere decoder is implemented for fast data decoding. Bit error rate (BER performance demonstrates the effectiveness of the proposed scheme.

  11. QoS and energy aware cooperative routing protocol for wildfire monitoring wireless sensor networks.

    Science.gov (United States)

    Maalej, Mohamed; Cherif, Sofiane; Besbes, Hichem

    2013-01-01

    Wireless sensor networks (WSN) are presented as proper solution for wildfire monitoring. However, this application requires a design of WSN taking into account the network lifetime and the shadowing effect generated by the trees in the forest environment. Cooperative communication is a promising solution for WSN which uses, at each hop, the resources of multiple nodes to transmit its data. Thus, by sharing resources between nodes, the transmission quality is enhanced. In this paper, we use the technique of reinforcement learning by opponent modeling, optimizing a cooperative communication protocol based on RSSI and node energy consumption in a competitive context (RSSI/energy-CC), that is, an energy and quality-of-service aware-based cooperative communication routing protocol. Simulation results show that the proposed algorithm performs well in terms of network lifetime, packet delay, and energy consumption.

  12. SC-FDMA for mobile communications

    CERN Document Server

    Abd El-Samie, Fathi E

    2013-01-01

    SC-FDMA for Mobile Communications examines Single-Carrier Frequency Division Multiple Access (SC-FDMA). Explaining this rapidly evolving system for mobile communications, it describes its advantages and limitations and outlines possible solutions for addressing its current limitations. The book explores the emerging trend of cooperative communication with SC-FDMA and how it can improve the physical layer security. It considers the design of distributed coding schemes and protocols for wireless relay networks where users cooperate to send their data to the destination. Supplying you with the re

  13. Secure Cooperation of Autonomous Mobile Sensors Using an Underwater Acoustic Network

    Directory of Open Access Journals (Sweden)

    Gianluca Dini

    2012-02-01

    Full Text Available Methodologies and algorithms are presented for the secure cooperation of a team of autonomous mobile underwater sensors, connected through an acoustic communication network, within surveillance and patrolling applications. In particular, the work proposes a cooperative algorithm in which the mobile underwater sensors (installed on Autonomous Underwater Vehicles—AUVs respond to simple local rules based on the available information to perform the mission and maintain the communication link with the network (behavioral approach. The algorithm is intrinsically robust: with loss of communication among the vehicles the coverage performance (i.e., the mission goal is degraded but not lost. The ensuing form of graceful degradation provides also a reactive measure against Denial of Service. The cooperative algorithm relies on the fact that the available information from the other sensors, though not necessarily complete, is trustworthy. To ensure trustworthiness, a security suite has been designed, specifically oriented to the underwater scenario, and in particular with the goal of reducing the communication overhead introduced by security in terms of number and size of messages. The paper gives implementation details on the integration between the security suite and the cooperative algorithm and provides statistics on the performance of the system as collected during the UAN project sea trial held in Trondheim, Norway, in May 2011.

  14. Cooperative localization in 5G networks: A survey

    Directory of Open Access Journals (Sweden)

    Ping Zhang

    2017-03-01

    Full Text Available In upcoming 5G networks, key prospects such as increased bandwidth, smaller cells, higher mobile terminal (MT densities, multiple radio access technologies, and the capability of device-to-device communication are beneficial for localization. Meanwhile, technologies suggested in 5G, such as massive multiple-in multiple-out, would also benefit from the accurate locations of MTs. Therefore, an opportunity to develop and integrate mobile localization technology in 5G networks has presented itself at this early stage. This paper reviews recent literature relating to localization in 5G networks, and emphasizes the prospect for implementing cooperative localization, which exploits the location information from additional measurements between MTs. To evaluate the accuracy of cooperative localization, a performance evaluation approach is also suggested.

  15. 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.

  16. Robust Nash Dynamic Game Strategy for User Cooperation Energy Efficiency in Wireless Cellular Networks

    Directory of Open Access Journals (Sweden)

    Shuhuan Wen

    2012-01-01

    Full Text Available Recently, there is an emerging trend of addressing “energy efficiency” aspect of wireless communications. It has been shown that cooperating users relay each other's information to improve data rates. The energy is limited in the wireless cellular network, but the mobile users refuse to relay. This paper presents an approach that encourages user cooperation in order to improve the energy efficiency. The game theory is an efficient method to solve such conflicts. We present a cellular framework in which two mobile users, who desire to communicate with a common base station, may cooperate via decode-and-forward relaying. In the case of imperfect information assumption, cooperative Nash dynamic game is used between the two users' cooperation to tackle the decision making problems: whether to cooperate and how to cooperate in wireless networks. The scheme based on “cooperative game theory” can achieve general pareto-optimal performance for cooperative games, and thus, maximize the entire system payoff while maintaining fairness.

  17. BICM-based cooperative communication systems with relay selection: Constellation and multiplexer design

    KAUST Repository

    Malik, Muhammad Talha; Hossain, Md Jahangir; Alouini, Mohamed-Slim

    2014-01-01

    We propose a new bit-interleaved coded modulation (BICM)-based cooperative communication system where different BICM modules can be optimized jointly considering the average signal to noise ratios of the direct and the two-hop Rayleigh fading

  18. Incentivize Spectrum Leasing in Cognitive Radio Networks by Exploiting Cooperative Retransmission

    Directory of Open Access Journals (Sweden)

    Xiaoyan Wang

    2015-07-01

    Full Text Available This paper addresses the spectrum leasing issue in cognitive radio networks by exploiting the secondary user’s cooperative retransmission. In contrast with the previous researches that focuses on cancellationbased or coding-based cooperative retransmissions, we propose a novel trading-based mechanism to facilitate the cooperative retransmission for cognitive radio networks. By utilizing the Stackelberg game model, we incentivize the otherwise non-cooperative users by maximizing their utilities in terms of transmission rates and economic profit. We analyze the existence of the unique Nash equilibrium of the game, and provide the optimal solutions with corresponding constraints. Numerical results demonstrate the efficiency of the proposed mechanism, under which the performance of the whole system could be substantially improved.

  19. 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

  20. Cooperative Communications for Wireless Information Assurance: Secure Cooperative Communications and Testbed Development

    National Research Council Canada - National Science Library

    Li, Xiaohua

    2007-01-01

    ..., and have invented a new cooperative OFDM transmission scheme to combat transmission asynchronism. They are helpful to the development of future physical-layer wireless information assurance techniques as well as the cooperative communication techniques...

  1. A Cross-Layer Optimization Approach for Energy Efficient Wireless Sensor Networks: Coalition-Aided Data Aggregation, Cooperative Communication, and Energy Balancing

    Directory of Open Access Journals (Sweden)

    Qinghai Gao

    2007-01-01

    Full Text Available We take a cross-layer optimization approach to study energy efficient data transport in coalition-based wireless sensor networks, where neighboring nodes are organized into groups to form coalitions and sensor nodes within one coalition carry out cooperative communications. In particular, we investigate two network models: (1 many-to-one sensor networks where data from one coalition are transmitted to the sink directly, and (2 multihop sensor networks where data are transported by intermediate nodes to reach the sink. For the many-to-one network model, we propose three schemes for data transmission from a coalition to the sink. In scheme 1, one node in the coalition is selected randomly to transmit the data; in scheme 2, the node with the best channel condition in the coalition transmits the data; and in scheme 3, all the nodes in the coalition transmit in a cooperative manner. Next, we investigate energy balancing with cooperative data transport in multihop sensor networks. Built on the above coalition-aided data transmission schemes, the optimal coalition planning is then carried out in multihop networks, in the sense that unequal coalition sizes are applied to minimize the difference of energy consumption among sensor nodes. Numerical analysis reveals that energy efficiency can be improved significantly by the coalition-aided transmission schemes, and that energy balancing across the sensor nodes can be achieved with the proposed coalition structures.

  2. Reliability-Aware Cooperative Node Sleeping and Clustering in Duty-Cycled Sensors Networks

    Directory of Open Access Journals (Sweden)

    Jeungeun Song

    2018-01-01

    Full Text Available Duty-cycled sensor networks provide a new perspective for improvement of energy efficiency and reliability assurance of multi-hop cooperative sensor networks. In this paper, we consider the energy-efficient cooperative node sleeping and clustering problems in cooperative sensor networks where clusters of relay nodes jointly transmit sensory data to the next hop. Our key idea for guaranteeing reliability is to exploit the on-demand number of cooperative nodes, facilitating the prediction of personalized end-to-end (ETE reliability. Namely, a novel reliability-aware cooperative routing (RCR scheme is proposed to select k-cooperative nodes at every hop (RCR-selection. After selecting k cooperative nodes at every hop, all of the non-cooperative nodes will go into sleep status. In order to solve the cooperative node clustering problem, we propose the RCR-based optimal relay assignment and cooperative data delivery (RCR-delivery scheme to provide a low-communication-overhead data transmission and an optimal duty cycle for a given number of cooperative nodes when the network is dynamic, which enables part of cooperative nodes to switch into idle status for further energy saving. Through the extensive OPNET-based simulations, we show that the proposed scheme significantly outperforms the existing geographic routing schemes and beaconless geographic routings in wireless sensor networks with a highly dynamic wireless channel and controls energy consumption, while ETE reliability is effectively guaranteed.

  3. 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.

  4. 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.

  5. 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...

  6. Multi-Source Cooperative Data Collection with a Mobile Sink for the Wireless Sensor Network.

    Science.gov (United States)

    Han, Changcai; Yang, Jinsheng

    2017-10-30

    The multi-source cooperation integrating distributed low-density parity-check codes is investigated to jointly collect data from multiple sensor nodes to the mobile sink in the wireless sensor network. The one-round and two-round cooperative data collection schemes are proposed according to the moving trajectories of the sink node. Specifically, two sparse cooperation models are firstly formed based on geographical locations of sensor source nodes, the impairment of inter-node wireless channels and moving trajectories of the mobile sink. Then, distributed low-density parity-check codes are devised to match the directed graphs and cooperation matrices related with the cooperation models. In the proposed schemes, each source node has quite low complexity attributed to the sparse cooperation and the distributed processing. Simulation results reveal that the proposed cooperative data collection schemes obtain significant bit error rate performance and the two-round cooperation exhibits better performance compared with the one-round scheme. The performance can be further improved when more source nodes participate in the sparse cooperation. For the two-round data collection schemes, the performance is evaluated for the wireless sensor networks with different moving trajectories and the variant data sizes.

  7. 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 ...

  8. Advanced relay technologies in next generation wireless communications

    CERN Document Server

    Krikidis, Ioannis

    2016-01-01

    This book details the use of the cooperative networks/relaying approach in new and emerging telecommunications technologies such as full-duplex radio, massive multiple-input multiple-output (MIMO), network coding and spatial modulation, and new application areas including visible light communications (VLC), wireless power transfer, and 5G.

  9. PPM-based relay communication schemes for wireless body area networks

    NARCIS (Netherlands)

    Zhang, P.; Willems, F.M.J.; Huang, Li

    2012-01-01

    This paper investigates cooperative communication schemes based on a single relay with pulse-position modulation (PPM) signaling, for enhancing energy efficiency of wireless body area networks (WBANs) in noncoherent channel settings. We explore cooperation between the source and the relay such that

  10. 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...

  11. 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...

  12. Achieving energy efficiency in LTE with joint D2D communications and green networking techniques

    KAUST Repository

    Yaacoub, Elias E.

    2013-07-01

    In this paper, the joint operation of cooperative device-to-device (D2D) communications and green cellular communications is investigated. An efficient approach for grouping mobile terminals (MTs) into cooperative clusters is described. In each cluster, MTs cooperate via D2D communications to share content of common interest. Furthermore, an energy-efficient technique for putting BSs in sleep mode in an LTE cellular network is presented. Finally, both methods are combined in order to ensure green communications for both the users\\' MTs and the operator\\'s BSs. The studied methods are investigated in the framework of OFDMA-based state-of-the-art LTE cellular networks, while taking into account intercell interference and resource allocation. © 2013 IEEE.

  13. Cooperative wireless network control based health and activity monitoring system.

    Science.gov (United States)

    Prakash, R; Ganesh, A Balaji; Girish, Siva V

    2016-10-01

    A real-time cooperative communication based wireless network is presented for monitoring health and activity of an end-user in their environment. The cooperative communication offers better energy consumption and also an opportunity to aware the current location of a user non-intrusively. The link between mobile sensor node and relay node is dynamically established by using Received Signal Strength Indicator (RSSI) and Link Quality Indicator (LQI) based on adaptive relay selection scheme. The study proposes a Linear Acceleration based Transmission Power Decision Control (LA-TPDC) algorithm to further enhance the energy efficiency of cooperative communication. Further, the occurrences of false alarms are carefully prevented by introducing three stages of sequential warning system. The real-time experiments are carried-out by using the nodes, namely mobile sensor node, relay nodes and a destination node which are indigenously developed by using a CC430 microcontroller integrated with an in-built transceiver at 868 MHz. The wireless node performance characteristics, such as energy consumption, Signal-Noise ratio (SNR), Bit Error Rate (BER), Packet Delivery Ratio (PDR) and transmission offset are evaluated for all the participated nodes. The experimental results observed that the proposed linear acceleration based transmission power decision control algorithm almost doubles the battery life time than energy efficient conventional cooperative communication.

  14. 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....

  15. Maritime English for Communication and Cooperation.

    Science.gov (United States)

    Thiel, Teresa A.

    Because most maritime accidents are caused by human error, notably breakdowns in communication or cooperation, and because English is the international maritime language, instruction in maritime English for communication and cooperation is an important element in maritime education. The International Maritime Organization, a specialized agency of…

  16. 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.

  17. 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.

  18. Cooperation in human-computer communication

    OpenAIRE

    Kronenberg, Susanne

    2000-01-01

    The goal of this thesis is to simulate cooperation in human-computer communication to model the communicative interaction process of agents in natural dialogs in order to provide advanced human-computer interaction in that coherence is maintained between contributions of both agents, i.e. the human user and the computer. This thesis contributes to certain aspects of understanding and generation and their interaction in the German language. In spontaneous dialogs agents cooperate by the pro...

  19. 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.

  20. 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....

  1. Modeling and performance analysis of cooperative communications in cognitive radio networks

    KAUST Repository

    Khabazian, Mehdi

    2011-09-01

    In this paper, we study the performance of a network comprised of a primary user and a secondary user with the latter having cognitive radio capabilities. The secondary node uses the empty slots of the primary user to transmit its own traffic as well as to relay the primary\\'s traffic in a cooperative fashion. Taking a queuing theory approach, we find the probability generating functions of the numbers of packets in the queues of the primary and secondary users. Subsequently, we determine a number of performance measures such as the average queues\\' lengths, average packet transmission delays and secondary user\\'s queue surcharge due to cooperation. The numerical results along with the simulations show the importance of controlling the number of primary user packets admitted by the secondary user for cooperation and its impacts on the other performance measures. © 2011 IEEE.

  2. 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...

  3. Asymptotic Analysis of Large Cooperative Relay Networks Using Random Matrix Theory

    Directory of Open Access Journals (Sweden)

    H. Poor

    2008-04-01

    Full Text Available Cooperative transmission is an emerging communication technology that takes advantage of the broadcast nature of wireless channels. In cooperative transmission, the use of relays can create a virtual antenna array so that multiple-input/multiple-output (MIMO techniques can be employed. Most existing work in this area has focused on the situation in which there are a small number of sources and relays and a destination. In this paper, cooperative relay networks with large numbers of nodes are analyzed, and in particular the asymptotic performance improvement of cooperative transmission over direction transmission and relay transmission is analyzed using random matrix theory. The key idea is to investigate the eigenvalue distributions related to channel capacity and to analyze the moments of this distribution in large wireless networks. A performance upper bound is derived, the performance in the low signal-to-noise-ratio regime is analyzed, and two approximations are obtained for high and low relay-to-destination link qualities, respectively. Finally, simulations are provided to validate the accuracy of the analytical results. The analysis in this paper provides important tools for the understanding and the design of large cooperative wireless networks.

  4. Coding Theory and Applications : 4th International Castle Meeting

    CERN Document Server

    Malonek, Paula; Vettori, Paolo

    2015-01-01

    The topics covered in this book, written by researchers at the forefront of their field, represent some of the most relevant research areas in modern coding theory: codes and combinatorial structures, algebraic geometric codes, group codes, quantum codes, convolutional codes, network coding and cryptography. The book includes a survey paper on the interconnections of coding theory with constrained systems, written by an invited speaker, as well as 37 cutting-edge research communications presented at the 4th International Castle Meeting on Coding Theory and Applications (4ICMCTA), held at the Castle of Palmela in September 2014. The event’s scientific program consisted of four invited talks and 39 regular talks by authors from 24 different countries. This conference provided an ideal opportunity for communicating new results, exchanging ideas, strengthening international cooperation, and introducing young researchers into the coding theory community.

  5. 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.

  6. 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.

  7. 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.

  8. 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.

  9. Effective Communication between Preservice and Cooperating Teachers

    Science.gov (United States)

    Lawley, Ji Ji; Moore, Jenifer; Smajic, Almir

    2014-01-01

    This article reviews research on communication between preservice and cooperating teachers during a teacher internship. The research reveals that poor communication between preservice teachers and cooperating teachers can cause barriers to planning lessons, feedback, and teaching experiences. Additionally, research indicates that…

  10. 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...

  11. Autonomic computing enabled cooperative networked design

    CERN Document Server

    Wodczak, Michal

    2014-01-01

    This book introduces the concept of autonomic computing driven cooperative networked system design from an architectural perspective. As such it leverages and capitalises on the relevant advancements in both the realms of autonomic computing and networking by welding them closely together. In particular, a multi-faceted Autonomic Cooperative System Architectural Model is defined which incorporates the notion of Autonomic Cooperative Behaviour being orchestrated by the Autonomic Cooperative Networking Protocol of a cross-layer nature. The overall proposed solution not only advocates for the inc

  12. Northern emporia and maritime networks. Modelling past communication using archaeological network analysis

    DEFF Research Database (Denmark)

    Sindbæk, Søren Michael

    2015-01-01

    preserve patterns of thisinteraction. Formal network analysis and modelling holds the potential to identify anddemonstrate such patterns, where traditional methods often prove inadequate. Thearchaeological study of communication networks in the past, however, calls for radically different analytical...... this is not a problem of network analysis, but network synthesis: theclassic problem of cracking codes or reconstructing black-box circuits. It is proposedthat archaeological approaches to network synthesis must involve a contextualreading of network data: observations arising from individual contexts, morphologies...

  13. 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...

  14. 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)…

  15. 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.

  16. 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.

  17. 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...

  18. The evolution of cooperation on geographical networks

    Science.gov (United States)

    Li, Yixiao; Wang, Yi; Sheng, Jichuan

    2017-11-01

    We study evolutionary public goods game on geographical networks, i.e., complex networks which are located on a geographical plane. The geographical feature effects in two ways: In one way, the geographically-induced network structure influences the overall evolutionary dynamics, and, in the other way, the geographical length of an edge influences the cost when the two players at the two ends interact. For the latter effect, we design a new cost function of cooperators, which simply assumes that the longer the distance between two players, the higher cost the cooperator(s) of them have to pay. In this study, network substrates are generated by a previous spatial network model with a cost-benefit parameter controlling the network topology. Our simulations show that the greatest promotion of cooperation is achieved in the intermediate regime of the parameter, in which empirical estimates of various railway networks fall. Further, we investigate how the distribution of edges' geographical costs influences the evolutionary dynamics and consider three patterns of the distribution: an approximately-equal distribution, a diverse distribution, and a polarized distribution. For normal geographical networks which are generated using intermediate values of the cost-benefit parameter, a diverse distribution hinders the evolution of cooperation, whereas a polarized distribution lowers the threshold value of the amplification factor for cooperation in public goods game. These results are helpful for understanding the evolution of cooperation on real-world geographical networks.

  19. Cooperative Hurricane Network Obs

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — Observations from the Cooperative Hurricane Reporting Network (CHURN), a special network of stations that provided observations when tropical cyclones approached the...

  20. Novel Concepts of Cooperative Wireless Networking

    DEFF Research Database (Denmark)

    Zhang, Qi

    2008-01-01

    ; secondly, the increasing density of the wireless devices makes cooperation possible; last, the cost of information exchange (i.e. transmission power, transmission time, spectrum, etc.) is very low if information exchange over short-range link is needed. Cooperation changes the way of information delivery......Although wireless networks have achieved great success in the lastest two decades, the current wireless networks have difficulties to fulll users' ever-increasing expectations and needs. It is mainly due to available spectrum resource scarcity, limited battery capacity of wireless device......, unreliable wireless radio link, etc. To tackle these issues, a new telecommunication paradigm has been proposed, referred to as cooperative wireless networking [1]. The basic idea of cooperative wireless networking is that wireless devices work together to achieve their individual goals or one common goal...

  1. 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.

  2. 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.

  3. Game Theory-Based Cooperation for Underwater Acoustic Sensor Networks: Taxonomy, Review, Research Challenges and Directions.

    Science.gov (United States)

    Muhammed, Dalhatu; Anisi, Mohammad Hossein; Zareei, Mahdi; Vargas-Rosales, Cesar; Khan, Anwar

    2018-02-01

    Exploring and monitoring the underwater world using underwater sensors is drawing a lot of attention these days. In this field cooperation between acoustic sensor nodes has been a critical problem due to the challenging features such as acoustic channel failure (sound signal), long propagation delay of acoustic signal, limited bandwidth and loss of connectivity. There are several proposed methods to improve cooperation between the nodes by incorporating information/game theory in the node's cooperation. However, there is a need to classify the existing works and demonstrate their performance in addressing the cooperation issue. In this paper, we have conducted a review to investigate various factors affecting cooperation in underwater acoustic sensor networks. We study various cooperation techniques used for underwater acoustic sensor networks from different perspectives, with a concentration on communication reliability, energy consumption, and security and present a taxonomy for underwater cooperation. Moreover, we further review how the game theory can be applied to make the nodes cooperate with each other. We further analyze different cooperative game methods, where their performance on different metrics is compared. Finally, open issues and future research direction in underwater acoustic sensor networks are highlighted.

  4. Game Theory-Based Cooperation for Underwater Acoustic Sensor Networks: Taxonomy, Review, Research Challenges and Directions

    Directory of Open Access Journals (Sweden)

    Dalhatu Muhammed

    2018-02-01

    Full Text Available Exploring and monitoring the underwater world using underwater sensors is drawing a lot of attention these days. In this field cooperation between acoustic sensor nodes has been a critical problem due to the challenging features such as acoustic channel failure (sound signal, long propagation delay of acoustic signal, limited bandwidth and loss of connectivity. There are several proposed methods to improve cooperation between the nodes by incorporating information/game theory in the node’s cooperation. However, there is a need to classify the existing works and demonstrate their performance in addressing the cooperation issue. In this paper, we have conducted a review to investigate various factors affecting cooperation in underwater acoustic sensor networks. We study various cooperation techniques used for underwater acoustic sensor networks from different perspectives, with a concentration on communication reliability, energy consumption, and security and present a taxonomy for underwater cooperation. Moreover, we further review how the game theory can be applied to make the nodes cooperate with each other. We further analyze different cooperative game methods, where their performance on different metrics is compared. Finally, open issues and future research direction in underwater acoustic sensor networks are highlighted.

  5. Game Theory-Based Cooperation for Underwater Acoustic Sensor Networks: Taxonomy, Review, Research Challenges and Directions

    Science.gov (United States)

    Muhammed, Dalhatu; Anisi, Mohammad Hossein; Vargas-Rosales, Cesar; Khan, Anwar

    2018-01-01

    Exploring and monitoring the underwater world using underwater sensors is drawing a lot of attention these days. In this field cooperation between acoustic sensor nodes has been a critical problem due to the challenging features such as acoustic channel failure (sound signal), long propagation delay of acoustic signal, limited bandwidth and loss of connectivity. There are several proposed methods to improve cooperation between the nodes by incorporating information/game theory in the node’s cooperation. However, there is a need to classify the existing works and demonstrate their performance in addressing the cooperation issue. In this paper, we have conducted a review to investigate various factors affecting cooperation in underwater acoustic sensor networks. We study various cooperation techniques used for underwater acoustic sensor networks from different perspectives, with a concentration on communication reliability, energy consumption, and security and present a taxonomy for underwater cooperation. Moreover, we further review how the game theory can be applied to make the nodes cooperate with each other. We further analyze different cooperative game methods, where their performance on different metrics is compared. Finally, open issues and future research direction in underwater acoustic sensor networks are highlighted. PMID:29389874

  6. Channel coding techniques for wireless communications

    CERN Document Server

    Deergha Rao, K

    2015-01-01

    The book discusses modern channel coding techniques for wireless communications such as turbo codes, low-density parity check (LDPC) codes, space–time (ST) coding, RS (or Reed–Solomon) codes and convolutional codes. Many illustrative examples are included in each chapter for easy understanding of the coding techniques. The text is integrated with MATLAB-based programs to enhance the understanding of the subject’s underlying theories. It includes current topics of increasing importance such as turbo codes, LDPC codes, Luby transform (LT) codes, Raptor codes, and ST coding in detail, in addition to the traditional codes such as cyclic codes, BCH (or Bose–Chaudhuri–Hocquenghem) and RS codes and convolutional codes. Multiple-input and multiple-output (MIMO) communications is a multiple antenna technology, which is an effective method for high-speed or high-reliability wireless communications. PC-based MATLAB m-files for the illustrative examples are provided on the book page on Springer.com for free dow...

  7. Communicating pictures a course in image and video coding

    CERN Document Server

    Bull, David R

    2014-01-01

    Communicating Pictures starts with a unique historical perspective of the role of images in communications and then builds on this to explain the applications and requirements of a modern video coding system. It draws on the author's extensive academic and professional experience of signal processing and video coding to deliver a text that is algorithmically rigorous, yet accessible, relevant to modern standards, and practical. It offers a thorough grounding in visual perception, and demonstrates how modern image and video compression methods can be designed in order to meet the rate-quality performance levels demanded by today's applications, networks and users. With this book you will learn: Practical issues when implementing a codec, such as picture boundary extension and complexity reduction, with particular emphasis on efficient algorithms for transforms, motion estimators and error resilience Conflicts between conventional video compression, based on variable length coding and spatiotemporal prediction,...

  8. Communicating in Collectivistic Culture: Relationship between Interdependent Self-Construal and Cooperative Communication in Cross-Cultural Communication Model

    Directory of Open Access Journals (Sweden)

    Hoo Pin Lick Soo

    2017-01-01

    Full Text Available This concept paper proposes that when companies have expanded their business and operation throughout the Asian countries, the success or failure of a company abroad depends on how effectively its business negotiators can apply their cross-cultural communication skills in a new cultural environment. At the forefront of this change is interdependent self-construal, which stands as communication medium on interaction goals (international business negotiation outcome in collectivistic culture. The international trade may bring about a lot in terms of cross-cultural communication and international business negotiation, but adopting cooperative communication in the international business negotiations will create more integrative agreements between the international business negotiators. Many scholars believe that if both parties have similarities in communication styles, it will lead to positive interaction (cooperative communication that contributes to cooperation and influences the interaction goals (negotiation outcome. This paper offers critical insight into the theoretical link between interdependent selfconstrual and interaction goals. The proposed cross-cultural communication model uses interdependent self-construal and cooperative communication to understand when collectivistic business negotiators develop relationships that promotes positive interaction goals (negotiation outcome.

  9. Cooperative and networking strategies in small business

    CERN Document Server

    Ferreira, João

    2017-01-01

    The book aims to collect the most recent research and best practices in the cooperative and networking small business field identifying new theoretical models and describing the relationship between cooperation and networks in the small business strategy context. It examines different concepts and analytical techniques better understand the links between cooperative strategies and networks in small business. It also studies the existing economic conditions of network and strategic implications to small business from the point of view of their internal and external consistency. Cooperation and networks is a fashionable topic. It is receiving increasing attention in popular management publications, as well as specialized academic journals. Cooperation between firms and industries is a means of leveraging and aggregating knowledge also generating direct benefits in terms of innovation, productivity and competitiveness. Various options and decisions made within the framework of strategic alliances may be identifi...

  10. Emergence of communication in socio-biological networks

    CERN Document Server

    Berea, Anamaria

    2018-01-01

    This book integrates current advances in biology, economics of information and linguistics research through applications using agent-based modeling and social network analysis to develop scenarios of communication and language emergence in the social aspects of biological communications. The book presents a model of communication emergence that can be applied both to human and non-human living organism networks. The model is based on economic concepts and individual behavior fundamental for the study of trust and reputation networks in social science, particularly in economics; it is also based on the theory of the emergence of norms and historical path dependence that has been influential in institutional economics. Also included are mathematical models and code for agent-based models to explore various scenarios of language evolution, as well as a computer application that explores language and communication in biological versus social organisms, and the emergence of various meanings and grammars in human ...

  11. 'The Tsukuba Network' as a new medium for promoting research communications in Tsukuba

    Science.gov (United States)

    Taguchi, Masamichi

    The Science and Technology Agency constructed a PC-based communication network system named 'The Tsukuba Network' as a new medium for promoting the research communication in, and with, the Tsukuba City. For about a year prior to full operation, a pilot system was operated with the cooperation of some monitoring users to gain skill and experience for managing the PC-based communication network. The main service functions of the system are : bulletin board service; electronic mail ; construction of, and access to, the databases involving research information in Tsukuba City ; electronic conference; common use of softwares ; connection to other communication networks ( e.g., university and local network). The host computer is a work station EWS4800 and the network processor is a personal computer PC-9801 . These two computers are connected with LAN.

  12. Social networks and cooperation in hunter-gatherers.

    Science.gov (United States)

    Apicella, Coren L; Marlowe, Frank W; Fowler, James H; Christakis, Nicholas A

    2012-01-25

    Social networks show striking structural regularities, and both theory and evidence suggest that networks may have facilitated the development of large-scale cooperation in humans. Here, we characterize the social networks of the Hadza, a population of hunter-gatherers in Tanzania. We show that Hadza networks have important properties also seen in modernized social networks, including a skewed degree distribution, degree assortativity, transitivity, reciprocity, geographic decay and homophily. We demonstrate that Hadza camps exhibit high between-group and low within-group variation in public goods game donations. Network ties are also more likely between people who give the same amount, and the similarity in cooperative behaviour extends up to two degrees of separation. Social distance appears to be as important as genetic relatedness and physical proximity in explaining assortativity in cooperation. Our results suggest that certain elements of social network structure may have been present at an early point in human history. Also, early humans may have formed ties with both kin and non-kin, based in part on their tendency to cooperate. Social networks may thus have contributed to the emergence of cooperation.

  13. Emergence of cooperation in non-scale-free networks

    International Nuclear Information System (INIS)

    Zhang, Yichao; Aziz-Alaoui, M A; Bertelle, Cyrille; Zhou, Shi; Wang, Wenting

    2014-01-01

    Evolutionary game theory is one of the key paradigms behind many scientific disciplines from science to engineering. Previous studies proposed a strategy updating mechanism, which successfully demonstrated that the scale-free network can provide a framework for the emergence of cooperation. Instead, individuals in random graphs and small-world networks do not favor cooperation under this updating rule. However, a recent empirical result shows the heterogeneous networks do not promote cooperation when humans play a prisoner’s dilemma. In this paper, we propose a strategy updating rule with payoff memory. We observe that the random graphs and small-world networks can provide even better frameworks for cooperation than the scale-free networks in this scenario. Our observations suggest that the degree heterogeneity may be neither a sufficient condition nor a necessary condition for the widespread cooperation in complex networks. Also, the topological structures are not sufficed to determine the level of cooperation in complex networks. (paper)

  14. Virtual Induction Loops Based on Cooperative Vehicular Communications

    Directory of Open Access Journals (Sweden)

    Maria Calderon

    2013-01-01

    Full Text Available Induction loop detectors have become the most utilized sensors in traffic management systems. The gathered traffic data is used to improve traffic efficiency (i.e., warning users about congested areas or planning new infrastructures. Despite their usefulness, their deployment and maintenance costs are expensive. Vehicular networks are an emerging technology that can support novel strategies for ubiquitous and more cost-effective traffic data gathering. In this article, we propose and evaluate VIL (Virtual Induction Loop, a simple and lightweight traffic monitoring system based on cooperative vehicular communications. The proposed solution has been experimentally evaluated through simulation using real vehicular traces.

  15. Virtual Induction Loops Based on Cooperative Vehicular Communications

    Science.gov (United States)

    Gramaglia, Marco; Bernardos, Carlos J.; Calderon, Maria

    2013-01-01

    Induction loop detectors have become the most utilized sensors in traffic management systems. The gathered traffic data is used to improve traffic efficiency (i.e., warning users about congested areas or planning new infrastructures). Despite their usefulness, their deployment and maintenance costs are expensive. Vehicular networks are an emerging technology that can support novel strategies for ubiquitous and more cost-effective traffic data gathering. In this article, we propose and evaluate VIL (Virtual Induction Loop), a simple and lightweight traffic monitoring system based on cooperative vehicular communications. The proposed solution has been experimentally evaluated through simulation using real vehicular traces. PMID:23348033

  16. 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....

  17. 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.

  18. Determinants of public cooperation in multiplex networks

    Science.gov (United States)

    Battiston, Federico; Perc, Matjaž; Latora, Vito

    2017-07-01

    Synergies between evolutionary game theory and statistical physics have significantly improved our understanding of public cooperation in structured populations. Multiplex networks, in particular, provide the theoretical framework within network science that allows us to mathematically describe the rich structure of interactions characterizing human societies. While research has shown that multiplex networks may enhance the resilience of cooperation, the interplay between the overlap in the structure of the layers and the control parameters of the corresponding games has not yet been investigated. With this aim, we consider here the public goods game on a multiplex network, and we unveil the role of the number of layers and the overlap of links, as well as the impact of different synergy factors in different layers, on the onset of cooperation. We show that enhanced public cooperation emerges only when a significant edge overlap is combined with at least one layer being able to sustain some cooperation by means of a sufficiently high synergy factor. In the absence of either of these conditions, the evolution of cooperation in multiplex networks is determined by the bounds of traditional network reciprocity with no enhanced resilience. These results caution against overly optimistic predictions that the presence of multiple social domains may in itself promote cooperation, and they help us better understand the complexity behind prosocial behavior in layered social systems.

  19. Perturbed cooperative-state feedback strategy for model predictive networked control of interconnected systems.

    Science.gov (United States)

    Tran, Tri; Ha, Q P

    2018-01-01

    A perturbed cooperative-state feedback (PSF) strategy is presented for the control of interconnected systems in this paper. The subsystems of an interconnected system can exchange data via the communication network that has multiple connection topologies. The PSF strategy can resolve both issues, the sensor data losses and the communication network breaks, thanks to the two components of the control including a cooperative-state feedback and a perturbation variable, e.g., u i =K ij x j +w i . The PSF is implemented in a decentralized model predictive control scheme with a stability constraint and a non-monotonic storage function (ΔV(x(k))≥0), derived from the dissipative systems theory. Numerical simulation for the automatic generation control problem in power systems is studied to illustrate the effectiveness of the presented PSF strategy. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

  20. Cooperative communication within and between single nanocatalysts

    Science.gov (United States)

    Zou, Ningmu; Zhou, Xiaochun; Chen, Guanqun; Andoy, Nesha May; Jung, Won; Liu, Guokun; Chen, Peng

    2018-06-01

    Enzymes often show catalytic allostery in which reactions occurring at different sites communicate cooperatively over distances of up to a few nanometres. Whether such effects can occur with non-biological nanocatalysts remains unclear, even though these nanocatalysts can undergo restructuring and molecules can diffuse over catalyst surfaces. Here we report that phenomenologically similar, but mechanistically distinct, cooperative effects indeed exist for nanocatalysts. Using spatiotemporally resolved single-molecule catalysis imaging, we find that catalytic reactions on a single Pd or Au nanocatalyst can communicate with each other, probably via hopping of positively charged holes on the catalyst surface, over 102 nanometres and with a temporal memory of 101 to 102 seconds, giving rise to positive cooperativity among its surface active sites. Similar communication is also observed between individual nanocatalysts, however it operates via a molecular diffusion mechanism involving negatively charged product molecules, and its communication distance is many micrometres. Generalization of these long-range intra- and interparticle catalytic communication mechanisms may introduce a novel conceptual framework for understanding nanoscale catalysis.

  1. Variable Coding and Modulation Experiment Using NASA's Space Communication and Navigation Testbed

    Science.gov (United States)

    Downey, Joseph A.; Mortensen, Dale J.; Evans, Michael A.; Tollis, Nicholas S.

    2016-01-01

    National Aeronautics and Space Administration (NASA)'s Space Communication and Navigation Testbed on the International Space Station provides a unique opportunity to evaluate advanced communication techniques in an operational system. The experimental nature of the Testbed allows for rapid demonstrations while using flight hardware in a deployed system within NASA's networks. One example is variable coding and modulation, which is a method to increase data-throughput in a communication link. This paper describes recent flight testing with variable coding and modulation over S-band using a direct-to-earth link between the SCaN Testbed and the Glenn Research Center. The testing leverages the established Digital Video Broadcasting Second Generation (DVB-S2) standard to provide various modulation and coding options. The experiment was conducted in a challenging environment due to the multipath and shadowing caused by the International Space Station structure. Performance of the variable coding and modulation system is evaluated and compared to the capacity of the link, as well as standard NASA waveforms.

  2. Cooperative vehicular communications in the drive-thru internet

    CERN Document Server

    Zhou, Haibo; Yu, Quan; Shen, Xuemin (Sherman)

    2015-01-01

    This brief presents a unified analytical framework for the evaluation of drive-thru Internet performance and accordingly proposes an optimal spatial access control management approach. A comprehensive overview and in-depth discussion of the research literature is included. It summarizes the main concepts and methods, and highlights future research directions. The brief also introduces a novel cooperative vehicular communication framework together with a delicate linear cluster formation scheme and low-delay content forwarding approach to provide a flexible and efficient vehicular content distribution in the drive-thru Internet. The presented medium access control and vehicular content distribution related research results in this brief provide useful insights for the design approach of Wi-Fi enabled vehicular communications and it motivates a new line of thinking for the performance enhancements of future vehicular networking. Advanced-level students, researchers and professionals interested in vehicular netw...

  3. Cooperative Dynamics in Lattice-Embedded Scale-Free Networks

    International Nuclear Information System (INIS)

    Shang Lihui; Zhang Mingji; Yang Yanqing

    2009-01-01

    We investigate cooperative behaviors of lattice-embedded scale-free networking agents in the prisoner's dilemma game model by employing two initial strategy distribution mechanisms, which are specific distribution to the most connected sites (hubs) and random distribution. Our study indicates that the game dynamics crucially depends on the underlying spatial network structure with different strategy distribution mechanism. The cooperators' specific distribution contributes to an enhanced level of cooperation in the system compared with random one, and cooperation is robust to cooperators' specific distribution but fragile to defectors' specific distribution. Especially, unlike the specific case, increasing heterogeneity of network does not always favor the emergence of cooperation under random mechanism. Furthermore, we study the geographical effects and find that the graphically constrained network structure tends to improve the evolution of cooperation in random case and in specific one for a large temptation to defect.

  4. Cognitive communication and cooperative hetnet coexistence selected advances on spectrum sensing, learning, and security approaches

    CERN Document Server

    Bader, Faouzi

    2014-01-01

    This book, written by experts from universities and major industrial research laboratories, is devoted to the very hot topic of cognitive radio and networking for cooperative coexistence of heterogeneous wireless networks. Selected highly relevant advanced research is presented on spectrum sensing and progress toward the realization of accurate radio environment mapping, biomimetic learning for self-organizing networks, security threats (with a special focus on primary user emulation attack), and cognition as a tool for green next-generation networks. The research activities covered include work undertaken within the framework of the European COST Action IC0902, which is geared towards the definition of a European platform for cognitive radio and networks. Communications engineers, R&D engineers, researchers, and students will all benefit from this complete reference on recent advances in wireless communications and the design and implementation of cognitive radio systems and networks.

  5. An FPGA-based torus communication network

    Energy Technology Data Exchange (ETDEWEB)

    Pivanti, Marcello; Schifano, Sebastiano Fabio [INFN, Ferrara (Italy); Ferrara Univ. (Italy); Simma, Hubert [DESY, Zeuthen (Germany). John von Neumann-Institut fuer Computing NIC

    2011-02-15

    We describe the design and FPGA implementation of a 3D torus network (TNW) to provide nearest-neighbor communications between commodity multi-core processors. The aim of this project is to build up tightly interconnected and scalable parallel systems for scientific computing. The design includes the VHDL code to implement on latest FPGA devices a network processor, which can be accessed by the CPU through a PCIe interface and which controls the external PHYs of the physical links. Moreover, a Linux driver and a library implementing custom communication APIs are provided. The TNW has been successfully integrated in two recent parallel machine projects, QPACE and AuroraScience. We describe some details of the porting of the TNW for the AuroraScience system and report performance results. (orig.)

  6. An FPGA-based torus communication network

    International Nuclear Information System (INIS)

    Pivanti, Marcello; Schifano, Sebastiano Fabio; Simma, Hubert

    2011-02-01

    We describe the design and FPGA implementation of a 3D torus network (TNW) to provide nearest-neighbor communications between commodity multi-core processors. The aim of this project is to build up tightly interconnected and scalable parallel systems for scientific computing. The design includes the VHDL code to implement on latest FPGA devices a network processor, which can be accessed by the CPU through a PCIe interface and which controls the external PHYs of the physical links. Moreover, a Linux driver and a library implementing custom communication APIs are provided. The TNW has been successfully integrated in two recent parallel machine projects, QPACE and AuroraScience. We describe some details of the porting of the TNW for the AuroraScience system and report performance results. (orig.)

  7. An Intelligent Cooperative Visual Sensor Network for Urban Mobility.

    Science.gov (United States)

    Leone, Giuseppe Riccardo; Moroni, Davide; Pieri, Gabriele; Petracca, Matteo; Salvetti, Ovidio; Azzarà, Andrea; Marino, Francesco

    2017-11-10

    Smart cities are demanding solutions for improved traffic efficiency, in order to guarantee optimal access to mobility resources available in urban areas. Intelligent video analytics deployed directly on board embedded sensors offers great opportunities to gather highly informative data about traffic and transport, allowing reconstruction of a real-time neat picture of urban mobility patterns. In this paper, we present a visual sensor network in which each node embeds computer vision logics for analyzing in real time urban traffic. The nodes in the network share their perceptions and build a global and comprehensive interpretation of the analyzed scenes in a cooperative and adaptive fashion. This is possible thanks to an especially designed Internet of Things (IoT) compliant middleware which encompasses in-network event composition as well as full support of Machine-2-Machine (M2M) communication mechanism. The potential of the proposed cooperative visual sensor network is shown with two sample applications in urban mobility connected to the estimation of vehicular flows and parking management. Besides providing detailed results of each key component of the proposed solution, the validity of the approach is demonstrated by extensive field tests that proved the suitability of the system in providing a scalable, adaptable and extensible data collection layer for managing and understanding mobility in smart cities.

  8. Cooperative spreading processes in multiplex networks.

    Science.gov (United States)

    Wei, Xiang; Chen, Shihua; Wu, Xiaoqun; Ning, Di; Lu, Jun-An

    2016-06-01

    This study is concerned with the dynamic behaviors of epidemic spreading in multiplex networks. A model composed of two interacting complex networks is proposed to describe cooperative spreading processes, wherein the virus spreading in one layer can penetrate into the other to promote the spreading process. The global epidemic threshold of the model is smaller than the epidemic thresholds of the corresponding isolated networks. Thus, global epidemic onset arises in the interacting networks even though an epidemic onset does not arise in each isolated network. Simulations verify the analysis results and indicate that cooperative spreading processes in multiplex networks enhance the final infection fraction.

  9. Cooperative Learning for Distributed In-Network Traffic Classification

    Science.gov (United States)

    Joseph, S. B.; Loo, H. R.; Ismail, I.; Andromeda, T.; Marsono, M. N.

    2017-04-01

    Inspired by the concept of autonomic distributed/decentralized network management schemes, we consider the issue of information exchange among distributed network nodes to network performance and promote scalability for in-network monitoring. In this paper, we propose a cooperative learning algorithm for propagation and synchronization of network information among autonomic distributed network nodes for online traffic classification. The results show that network nodes with sharing capability perform better with a higher average accuracy of 89.21% (sharing data) and 88.37% (sharing clusters) compared to 88.06% for nodes without cooperative learning capability. The overall performance indicates that cooperative learning is promising for distributed in-network traffic classification.

  10. Spread-spectrum communication using binary spatiotemporal chaotic codes

    International Nuclear Information System (INIS)

    Wang Xingang; Zhan Meng; Gong Xiaofeng; Lai, C.H.; Lai, Y.-C.

    2005-01-01

    We propose a scheme to generate binary code for baseband spread-spectrum communication by using a chain of coupled chaotic maps. We compare the performances of this type of spatiotemporal chaotic code with those of a conventional code used frequently in digital communication, the Gold code, and demonstrate that our code is comparable or even superior to the Gold code in several key aspects: security, bit error rate, code generation speed, and the number of possible code sequences. As the field of communicating with chaos faces doubts in terms of performance comparison with conventional digital communication schemes, our work gives a clear message that communicating with chaos can be advantageous and it deserves further attention from the nonlinear science community

  11. Conceptual design of data management and communication networks for KALIMER MMIS

    International Nuclear Information System (INIS)

    Cha, K. H.; Kwon, K. C.

    1998-01-01

    This paper describes the design progress for data management and communication networks to be co-operated as subsystems in KALIMER MMIS. Main functions and design bases are being established and validated for functional modules of these subsystems. Real-time data acquisition and signal validation, databases, and data logging have been designed as each functional module of data management while data interfaces of communication networks have been designed with the system information from Top-Tier Requirements for KALIMER MMIS. The conceptual design shall be refined through the iterative and detailed one

  12. Conceptual design of data management and communication networks for KALIMER MMIS

    Energy Technology Data Exchange (ETDEWEB)

    Cha, K. H.; Kwon, K. C. [KAERI, Taejon (Korea, Republic of)

    1998-10-01

    This paper describes the design progress for data management and communication networks to be co-operated as subsystems in KALIMER MMIS. Main functions and design bases are being established and validated for functional modules of these subsystems. Real-time data acquisition and signal validation, databases, and data logging have been designed as each functional module of data management while data interfaces of communication networks have been designed with the system information from Top-Tier Requirements for KALIMER MMIS. The conceptual design shall be refined through the iterative and detailed one.

  13. Decentralized Opportunistic Spectrum Resources Access Model and Algorithm toward Cooperative Ad-Hoc Networks

    Science.gov (United States)

    Liu, Ming; Xu, Yang; Mohammed, Abdul-Wahid

    2016-01-01

    Limited communication resources have gradually become a critical factor toward efficiency of decentralized large scale multi-agent coordination when both system scales up and tasks become more complex. In current researches, due to the agent’s limited communication and observational capability, an agent in a decentralized setting can only choose a part of channels to access, but cannot perceive or share global information. Each agent’s cooperative decision is based on the partial observation of the system state, and as such, uncertainty in the communication network is unavoidable. In this situation, it is a major challenge working out cooperative decision-making under uncertainty with only a partial observation of the environment. In this paper, we propose a decentralized approach that allows agents cooperatively search and independently choose channels. The key to our design is to build an up-to-date observation for each agent’s view so that a local decision model is achievable in a large scale team coordination. We simplify the Dec-POMDP model problem, and each agent can jointly work out its communication policy in order to improve its local decision utilities for the choice of communication resources. Finally, we discuss an implicate resource competition game, and show that, there exists an approximate resources access tradeoff balance between agents. Based on this discovery, the tradeoff between real-time decision-making and the efficiency of cooperation using these channels can be well improved. PMID:26727504

  14. Decentralized Opportunistic Spectrum Resources Access Model and Algorithm toward Cooperative Ad-Hoc Networks.

    Directory of Open Access Journals (Sweden)

    Ming Liu

    Full Text Available Limited communication resources have gradually become a critical factor toward efficiency of decentralized large scale multi-agent coordination when both system scales up and tasks become more complex. In current researches, due to the agent's limited communication and observational capability, an agent in a decentralized setting can only choose a part of channels to access, but cannot perceive or share global information. Each agent's cooperative decision is based on the partial observation of the system state, and as such, uncertainty in the communication network is unavoidable. In this situation, it is a major challenge working out cooperative decision-making under uncertainty with only a partial observation of the environment. In this paper, we propose a decentralized approach that allows agents cooperatively search and independently choose channels. The key to our design is to build an up-to-date observation for each agent's view so that a local decision model is achievable in a large scale team coordination. We simplify the Dec-POMDP model problem, and each agent can jointly work out its communication policy in order to improve its local decision utilities for the choice of communication resources. Finally, we discuss an implicate resource competition game, and show that, there exists an approximate resources access tradeoff balance between agents. Based on this discovery, the tradeoff between real-time decision-making and the efficiency of cooperation using these channels can be well improved.

  15. Threshold-based detection for amplify-and-forward cooperative communication systems with channel estimation error

    KAUST Repository

    Abuzaid, Abdulrahman I.

    2014-09-01

    Efficient receiver designs for cooperative communication systems are becoming increasingly important. In previous work, cooperative networks communicated with the use of $L$ relays. As the receiver is constrained, it can only process $U$ out of $L$ relays. Channel shortening and reduced-rank techniques were employed to design the preprocessing matrix. In this paper, a receiver structure is proposed which combines the joint iterative optimization (JIO) algorithm and our proposed threshold selection criteria. This receiver structure assists in determining the optimal $U-{opt}$. Furthermore, this receiver provides the freedom to choose $U ≤ U-{opt}$ for each frame depending upon the tolerable difference allowed for mean square error (MSE). Our study and simulation results show that by choosing an appropriate threshold, it is possible to gain in terms of complexity savings without affecting the BER performance of the system. Furthermore, in this paper the effect of channel estimation errors is investigated on the MSE performance of the amplify-and-forward (AF) cooperative relaying system.

  16. The key network communication technology in large radiation image cooperative process system

    International Nuclear Information System (INIS)

    Li Zheng; Kang Kejun; Gao Wenhuan; Wang Jingjin

    1998-01-01

    Large container inspection system (LCIS) based on radiation imaging technology is a powerful tool for the customs to check the contents inside a large container without opening it. An image distributed network system is composed of operation manager station, image acquisition station, environment control station, inspection processing station, check-in station, check-out station, database station by using advanced network technology. Mass data, such as container image data, container general information, manifest scanning data, commands and status, must be on-line transferred between different stations. Advanced network communication technology is presented

  17. Data communications and computer communications network

    International Nuclear Information System (INIS)

    Kim, Jang Gwon; Gu, Chang Hoe

    2005-03-01

    This textbook is composed of twelve chapters, which are communication network introduction, foundation of data communication, data link control, circuit switching system, packet switching system, multiple access communication system, protocol and architecture, LAN, MAN communication network, integrated service digital network, internet and Asymmetric digital subscriber Line and Wireless Local Loop. Each chapter has the introduction of the technique, structure, function and practice problems. It also has the appendix on electricity and communication standards organization, characteristic table and glossary.

  18. Research cooperation in the development of laser radar for environmental measurements. Environmental network; Kankyo keisokuyo laser radar no kaihatsu ni kansuru kenkyu kyoryoku. Kankyo network

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    1997-03-01

    Among the research cooperation in the development of laser radar for environmental measurements with Indonesia between FY 1993 and FY 1996, results of the research and development of the environmental network are summarized. For the environmental information network, the Tokyo NOC is linked as an Internet connection point in Japan with the Jakarta NOC using an international dedicated line with a capacity of 64 Kbps. The Tokyo NOC is linked with domestic environmental information researchers using Internet. Thus, data stored in the data processing system of laser radar can be exchanged, information in both countries can be exchanged using E-mail, and data can be accumulated. For the research cooperation with Indonesia, research of path control and information relay server, research of effective transmission of data on the network, and research of multimedia communication have been conducted. The multimedia communication, distributed processing, and extension of dedicated line network using PPTP have been also conducted. 39 figs., 4 tabs.

  19. An eConsent-based System Architecture Supporting Cooperation in Integrated Healthcare Networks.

    Science.gov (United States)

    Bergmann, Joachim; Bott, Oliver J; Hoffmann, Ina; Pretschner, Dietrich P

    2005-01-01

    The economical need for efficient healthcare leads to cooperative shared care networks. A virtual electronic health record is required, which integrates patient related information but reflects the distributed infrastructure and restricts access only to those health professionals involved into the care process. Our work aims on specification and development of a system architecture fulfilling these requirements to be used in concrete regional pilot studies. Methodical analysis and specification have been performed in a healthcare network using the formal method and modelling tool MOSAIK-M. The complexity of the application field was reduced by focusing on the scenario of thyroid disease care, which still includes various interdisciplinary cooperation. Result is an architecture for a secure distributed electronic health record for integrated care networks, specified in terms of a MOSAIK-M-based system model. The architecture proposes business processes, application services, and a sophisticated security concept, providing a platform for distributed document-based, patient-centred, and secure cooperation. A corresponding system prototype has been developed for pilot studies, using advanced application server technologies. The architecture combines a consolidated patient-centred document management with a decentralized system structure without needs for replication management. An eConsent-based approach assures, that access to the distributed health record remains under control of the patient. The proposed architecture replaces message-based communication approaches, because it implements a virtual health record providing complete and current information. Acceptance of the new communication services depends on compatibility with the clinical routine. Unique and cross-institutional identification of a patient is also a challenge, but will loose significance with establishing common patient cards.

  20. Quantum communication network utilizing quadripartite entangled states of optical field

    International Nuclear Information System (INIS)

    Shen Heng; Su Xiaolong; Jia Xiaojun; Xie Changde

    2009-01-01

    We propose two types of quantum dense coding communication networks with optical continuous variables, in which a quadripartite entangled state of the optical field with totally three-party correlations of quadrature amplitudes is utilized. In the networks, the exchange of information between any two participants can be manipulated by one or two of the remaining participants. The channel capacities for a variety of communication protocols are numerically calculated. Due to the fact that the quadripartite entangled states applied in the communication systems have been successfully prepared already in the laboratory, the proposed schemes are experimentally accessible at present.

  1. 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.

  2. Business Networks and Cooperation in International Business Relationships

    OpenAIRE

    Desirée Blankenburg Holm; Kent Eriksson; Jan Johanson

    1996-01-01

    Cooperative relationships between firms can be better understood if they are examined in the context of a network of connected business relationships. Based on research on business relationships and business networks, this paper formulates a LISREL model that analyses cooperation in international business relationships between suppliers and customer firms. Theory suggests that cooperation can raise the value of business relationships, and that business network connections have an impact on co...

  3. Cooperative and supportive neural networks

    International Nuclear Information System (INIS)

    Sree Hari Rao, V.; Raja Sekhara Rao, P.

    2007-01-01

    This Letter deals with the concepts of co-operation and support among neurons existing in a network which contribute to their collective capabilities and distributed operations. Activational dynamical properties of these networks are discussed

  4. Nanoscale molecular communication networks: a game-theoretic perspective

    Science.gov (United States)

    Jiang, Chunxiao; Chen, Yan; Ray Liu, K. J.

    2015-12-01

    Currently, communication between nanomachines is an important topic for the development of novel devices. To implement a nanocommunication system, diffusion-based molecular communication is considered as a promising bio-inspired approach. Various technical issues about molecular communications, including channel capacity, noise and interference, and modulation and coding, have been studied in the literature, while the resource allocation problem among multiple nanomachines has not been well investigated, which is a very important issue since all the nanomachines share the same propagation medium. Considering the limited computation capability of nanomachines and the expensive information exchange cost among them, in this paper, we propose a game-theoretic framework for distributed resource allocation in nanoscale molecular communication systems. We first analyze the inter-symbol and inter-user interference, as well as bit error rate performance, in the molecular communication system. Based on the interference analysis, we formulate the resource allocation problem as a non-cooperative molecule emission control game, where the Nash equilibrium is found and proved to be unique. In order to improve the system efficiency while guaranteeing fairness, we further model the resource allocation problem using a cooperative game based on the Nash bargaining solution, which is proved to be proportionally fair. Simulation results show that the Nash bargaining solution can effectively ensure fairness among multiple nanomachines while achieving comparable social welfare performance with the centralized scheme.

  5. An Intelligent Cooperative Visual Sensor Network for Urban Mobility

    Science.gov (United States)

    Leone, Giuseppe Riccardo; Petracca, Matteo; Salvetti, Ovidio; Azzarà, Andrea

    2017-01-01

    Smart cities are demanding solutions for improved traffic efficiency, in order to guarantee optimal access to mobility resources available in urban areas. Intelligent video analytics deployed directly on board embedded sensors offers great opportunities to gather highly informative data about traffic and transport, allowing reconstruction of a real-time neat picture of urban mobility patterns. In this paper, we present a visual sensor network in which each node embeds computer vision logics for analyzing in real time urban traffic. The nodes in the network share their perceptions and build a global and comprehensive interpretation of the analyzed scenes in a cooperative and adaptive fashion. This is possible thanks to an especially designed Internet of Things (IoT) compliant middleware which encompasses in-network event composition as well as full support of Machine-2-Machine (M2M) communication mechanism. The potential of the proposed cooperative visual sensor network is shown with two sample applications in urban mobility connected to the estimation of vehicular flows and parking management. Besides providing detailed results of each key component of the proposed solution, the validity of the approach is demonstrated by extensive field tests that proved the suitability of the system in providing a scalable, adaptable and extensible data collection layer for managing and understanding mobility in smart cities. PMID:29125535

  6. An Intelligent Cooperative Visual Sensor Network for Urban Mobility

    Directory of Open Access Journals (Sweden)

    Giuseppe Riccardo Leone

    2017-11-01

    Full Text Available Smart cities are demanding solutions for improved traffic efficiency, in order to guarantee optimal access to mobility resources available in urban areas. Intelligent video analytics deployed directly on board embedded sensors offers great opportunities to gather highly informative data about traffic and transport, allowing reconstruction of a real-time neat picture of urban mobility patterns. In this paper, we present a visual sensor network in which each node embeds computer vision logics for analyzing in real time urban traffic. The nodes in the network share their perceptions and build a global and comprehensive interpretation of the analyzed scenes in a cooperative and adaptive fashion. This is possible thanks to an especially designed Internet of Things (IoT compliant middleware which encompasses in-network event composition as well as full support of Machine-2-Machine (M2M communication mechanism. The potential of the proposed cooperative visual sensor network is shown with two sample applications in urban mobility connected to the estimation of vehicular flows and parking management. Besides providing detailed results of each key component of the proposed solution, the validity of the approach is demonstrated by extensive field tests that proved the suitability of the system in providing a scalable, adaptable and extensible data collection layer for managing and understanding mobility in smart cities.

  7. Coded communications with nonideal interleaving

    Science.gov (United States)

    Laufer, Shaul

    1991-02-01

    Burst error channels - a type of block interference channels - feature increasing capacity but decreasing cutoff rate as the memory rate increases. Despite the large capacity, there is degradation in the performance of practical coding schemes when the memory length is excessive. A short-coding error parameter (SCEP) was introduced, which expresses a bound on the average decoding-error probability for codes shorter than the block interference length. The performance of a coded slow frequency-hopping communication channel is analyzed for worst-case partial band jamming and nonideal interleaving, by deriving expressions for the capacity and cutoff rate. The capacity and cutoff rate, respectively, are shown to approach and depart from those of a memoryless channel corresponding to the transmission of a single code letter per hop. For multiaccess communications over a slot-synchronized collision channel without feedback, the channel was considered as a block interference channel with memory length equal to the number of letters transmitted in each slot. The effects of an asymmetrical background noise and a reduced collision error rate were studied, as aspects of real communications. The performance of specific convolutional and Reed-Solomon codes was examined for slow frequency-hopping systems with nonideal interleaving. An upper bound is presented for the performance of a Viterbi decoder for a convolutional code with nonideal interleaving, and a soft decision diversity combining technique is introduced.

  8. On Transmission Policies in Multihop Device-to-Device Communications with Network Coded Cooperation

    DEFF Research Database (Denmark)

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

    2016-01-01

    Ideal transmission policies are relevant nowadays to reduce energy consumption or increase throughput in mobile networks. In this work, we propose two recoding schemes with collision avoidance mechanism to reduce the number of transmission required to convey a batch of packets from a source...

  9. 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...

  10. Co-Operative Learning and Development Networks.

    Science.gov (United States)

    Hodgson, V.; McConnell, D.

    1995-01-01

    Discusses the theory, nature, and benefits of cooperative learning. Considers the Cooperative Learning and Development Network (CLDN) trial in the JITOL (Just in Time Open Learning) project and examines the relationship between theories about cooperative learning and the reality of a group of professionals participating in a virtual cooperative…

  11. MPEG-compliant joint source/channel coding using discrete cosine transform and substream scheduling for visual communication over packet networks

    Science.gov (United States)

    Kim, Seong-Whan; Suthaharan, Shan; Lee, Heung-Kyu; Rao, K. R.

    2001-01-01

    Quality of Service (QoS)-guarantee in real-time communication for multimedia applications is significantly important. An architectural framework for multimedia networks based on substreams or flows is effectively exploited for combining source and channel coding for multimedia data. But the existing frame by frame approach which includes Moving Pictures Expert Group (MPEG) cannot be neglected because it is a standard. In this paper, first, we designed an MPEG transcoder which converts an MPEG coded stream into variable rate packet sequences to be used for our joint source/channel coding (JSCC) scheme. Second, we designed a classification scheme to partition the packet stream into multiple substreams which have their own QoS requirements. Finally, we designed a management (reservation and scheduling) scheme for substreams to support better perceptual video quality such as the bound of end-to-end jitter. We have shown that our JSCC scheme is better than two other two popular techniques by simulation and real video experiments on the TCP/IP environment.

  12. Cooperation in wireless networks principles and applications : real egoistic behavior is to cooperate!

    CERN Document Server

    Fitzek, Frank HP

    2006-01-01

    Covers the underlying principles of cooperative techniques as well as several applications demonstrating the use of such techniques in practical systems. This book also summarizes the strength of cooperation for wireless communication systems, motivating the use of cooperative techniques.

  13. Cooperative Wireless Communications and Physical Layer Security : State of the Art

    DEFF Research Database (Denmark)

    Rohokale, Vandana M.; Prasad, Neeli R.; Prasad, Ramjee

    2012-01-01

    in the mobile equipment is not feasible due to resource constraints. Cooperative wireless communication (CWC) is the upcoming virtual MIMO technique to combat fading and achieve diversity through user cooperation. Physical layer security (PLS) is the imminent security guarantee for the cooperative communication....

  14. Cooperative learning neural network output feedback control of uncertain nonlinear multi-agent systems under directed topologies

    Science.gov (United States)

    Wang, W.; Wang, D.; Peng, Z. H.

    2017-09-01

    Without assuming that the communication topologies among the neural network (NN) weights are to be undirected and the states of each agent are measurable, the cooperative learning NN output feedback control is addressed for uncertain nonlinear multi-agent systems with identical structures in strict-feedback form. By establishing directed communication topologies among NN weights to share their learned knowledge, NNs with cooperative learning laws are employed to identify the uncertainties. By designing NN-based κ-filter observers to estimate the unmeasurable states, a new cooperative learning output feedback control scheme is proposed to guarantee that the system outputs can track nonidentical reference signals with bounded tracking errors. A simulation example is given to demonstrate the effectiveness of the theoretical results.

  15. Cooperation in the prisoner's dilemma game on tunable community networks

    Science.gov (United States)

    Liu, Penghui; Liu, Jing

    2017-04-01

    Community networks have attracted lots of attention as they widely exist in the real world and are essential to study properties of networks. As the game theory illustrates the competitive relationship among individuals, studying the iterated prisoner's dilemma games (PDG) on community networks is meaningful. In this paper, we focus on investigating the relationship between the cooperation level of community networks and that of their communities in the prisoner's dilemma games. With this purpose in mind, a type of tunable community networks whose communities inherit not only the scale-free property, but also the characteristic of adjustable cooperation level of Holme and Kim (HK) networks is designed. Both uniform and non-uniform community networks are investigated. We find out that cooperation enhancement of communities can improve the cooperation level of the whole networks. Moreover, simulation results indicate that a large community is a better choice than a small community to improve the cooperation level of the whole networks. Thus, improving the cooperation level of community networks can be divided into a number of sub-problems targeting at improving the cooperation level of individual communities, which can save the computation cost and deal with the problem of improving the cooperation level of huge community networks. Moreover, as the larger community is a better choice, it is reasonable to start with large communities, according to the greedy strategy when the number of nodes can participate in the enhancement is limited.

  16. Cooperative networking in a heterogeneous wireless medium

    CERN Document Server

    Ismail, Muhammad

    2013-01-01

    This brief focuses on radio resource allocation in a heterogeneous wireless medium. It presents radio resource allocation algorithms with decentralized implementation, which support both single-network and multi-homing services. The brief provides a set of cooperative networking algorithms, which rely on the concepts of short-term call traffic load prediction, network cooperation, convex optimization, and decomposition theory. In the proposed solutions, mobile terminals play an active role in the resource allocation operation, instead of their traditional role as passive service recipients in the networking environment.

  17. Factors that influence cooperation in networks for innovation and learning

    NARCIS (Netherlands)

    Sie, Rory; Bitter-Rijpkema, Marlies; Stoyanov, Slavi; Sloep, Peter

    2018-01-01

    Networked cooperation fails if the available partnerships remain opaque. A literature review and Delphi study uncovered the elements of a fruitful partnership. They relate to personality, diversity, cooperation, and management. Innovation networks and learning networks share the same cooperative

  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. 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...

  1. Cooperative Team Networks

    Science.gov (United States)

    2016-06-01

    team processes, such as identifying motifs of dynamic communication exchanges which goes well beyond simple dyadic and triadic configurations; as well...new metrics and ways to formulate team processes, such as identifying motifs of dynamic communication exchanges which goes well beyond simple dyadic ...sensing, communication , information, and decision networks - Darryl Ahner (AFIT: Air Force Inst Tech) Panel Session: Mathematical Models of

  2. Cooperation and Coordination in an International Intervention: The Use of Information and Communication Technologies in Kosovo

    Directory of Open Access Journals (Sweden)

    Anne Holohan

    2003-01-01

    Full Text Available In international interventions that encompass peacekeeping, democratic transition, and institution building, oneorganization cannot do it all. In Kosovo several organizations—the United Nations (UN, nongovernmentalorganizations (NGOs, the Organization for Security and Cooperation in Europe (OSCE, the militaries (KFOR, andan international police force—formed a temporary network organization, the United Nations Mission in Kosovo(UNMIK, in which they worked together cooperatively at every level to pursue the goals of the mission. Thisresearch, based on ªeldwork in Kosovo with all the organizations in UNMIK, investigates how well the use ofinformation and communications technologies (ICTs reºected the organizational structure and design of themission. What does this experience tell us about the use of ICTs in an interorganizational setting? What does it tellus about information transfer and knowledge sharing in a temporary network organization that comprisesorganizations of diverse structure and culture? The information and communication infrastructure of UNMIK isexamined to discover how well it met the organizational requirements of both the participating hierarchies in themission and the emerging network organization. The question in Kosovo was whether the introduction and use ofnew technologies helped the organizations move from a hierarchical structure and culture to a more collaborativeone.

  3. Cooperation and Development: a study of case in network cooperation

    Directory of Open Access Journals (Sweden)

    June Alisson Westarb Cruz

    2009-03-01

    Full Text Available The need to develop new surviving strategies and competitive advantage by individuals and organizations make cooperation to obtain complementary competences and potentialities very important, through the insertion of social actors in multiple networks of relationships and interactions.  This research was made in an Association Network of Carrinheiros[1] located in Curitiba and in the coast of Paraná.  The objective of the study was to analyze the structural characteristics of the network and its implications to develop collective actions. The data was collected through questionnaires, interviews, document analysis, and the daily direct observation of the network.  An interaction system between individuals and organizations from various sectors in society could be verified. This interaction stimulates the structured work connected to associations and cooperatives.  Between the actors of the network, concepts and realities are different, as well as individual objectives are distinct.  However, they converge to a common general objective that establish a common base for collaborative work.

  4. Transparency in Cooperative Online Education

    DEFF Research Database (Denmark)

    Dalsgaard, Christian; Paulsen, Morten Flate

    2009-01-01

    The purpose of this article is to discuss the following question: What is the potential of social networking within cooperative online education? Social networking does not necessarily involve communication, dialogue, or collaboration. Instead, the authors argue that transparency is a unique...... feature of social networking services. Transparency gives students insight into each other’s actions. Cooperative learning seeks to develop virtual learning environments that allow students to have optimal individual freedom within online learning communities. This article demonstrates how cooperative...... learning can be supported by transparency. To illustrate this with current examples, the article presents NKI Distance Education’s surveys and experiences with cooperative learning. The article discusses by which means social networking and transparency may be utilized within cooperative online education...

  5. Virtual MIMO Beamforming and Device Pairing Enabled by Device-to-Device Communications for Multidevice Networks

    Directory of Open Access Journals (Sweden)

    Yeonjin Jeong

    2017-01-01

    Full Text Available We consider a multidevice network with asymmetric antenna configurations which supports not only communications between an access point and devices but also device-to-device (D2D communications for the Internet of things. For the network, we propose the transmit and receive beamforming with the channel state information (CSI for virtual multiple-input multiple-output (MIMO enabled by D2D receive cooperation. We analyze the sum rate achieved by a device pair in the proposed method and identify the strategies to improve the sum rate of the device pair. We next present a distributed algorithm and its equivalent algorithm for device pairing to maximize the throughput of the multidevice network. Simulation results confirm the advantages of the transmit CSI and D2D cooperation as well as the validity of the distributive algorithm.

  6. The Evolution of Reputation-Based Cooperation in Regular Networks

    Directory of Open Access Journals (Sweden)

    Tatsuya Sasaki

    2017-01-01

    Full Text Available Despite recent advances in reputation technologies, it is not clear how reputation systems can affect human cooperation in social networks. Although it is known that two of the major mechanisms in the evolution of cooperation are spatial selection and reputation-based reciprocity, theoretical study of the interplay between both mechanisms remains almost uncharted. Here, we present a new individual-based model for the evolution of reciprocal cooperation between reputation and networks. We comparatively analyze four of the leading moral assessment rules—shunning, image scoring, stern judging, and simple standing—and base the model on the giving game in regular networks for Cooperators, Defectors, and Discriminators. Discriminators rely on a proper moral assessment rule. By using individual-based models, we show that the four assessment rules are differently characterized in terms of how cooperation evolves, depending on the benefit-to-cost ratio, the network-node degree, and the observation and error conditions. Our findings show that the most tolerant rule—simple standing—is the most robust among the four assessment rules in promoting cooperation in regular networks.

  7. How mutation alters the evolutionary dynamics of cooperation on networks

    Science.gov (United States)

    Ichinose, Genki; Satotani, Yoshiki; Sayama, Hiroki

    2018-05-01

    Cooperation is ubiquitous at every level of living organisms. It is known that spatial (network) structure is a viable mechanism for cooperation to evolve. A recently proposed numerical metric, average gradient of selection (AGoS), a useful tool for interpreting and visualizing evolutionary dynamics on networks, allows simulation results to be visualized on a one-dimensional phase space. However, stochastic mutation of strategies was not considered in the analysis of AGoS. Here we extend AGoS so that it can analyze the evolution of cooperation where mutation may alter strategies of individuals on networks. We show that our extended AGoS correctly visualizes the final states of cooperation with mutation in the individual-based simulations. Our analyses revealed that mutation always has a negative effect on the evolution of cooperation regardless of the payoff functions, fraction of cooperators, and network structures. Moreover, we found that scale-free networks are the most vulnerable to mutation and thus the dynamics of cooperation are altered from bistability to coexistence on those networks, undergoing an imperfect pitchfork bifurcation.

  8. Network public goods with asymmetric information about cooperation preferences and network degree

    NARCIS (Netherlands)

    Dijkstra, Jacob; van Assen, Marcus

    2013-01-01

    We propose a game theoretical model of one-shot network public goods formalizing the 'closure argument' that cooperation is more frequent in denser groups or networks. Equilibrium analyses show that (i) an 'inefficiency problem' exists: players all preferring mutual cooperation need not all

  9. 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...

  10. 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...

  11. 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...

  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. 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.

  14. A User Cooperation Stimulating Strategy Based on Cooperative Game Theory in Cooperative Relay Networks

    Directory of Open Access Journals (Sweden)

    Ping Zhang

    2009-01-01

    Full Text Available This paper proposes a user cooperation stimulating strategy among rational users. The strategy is based on cooperative game theory and enacted in the context of cooperative relay networks. Using the pricing-based mechanism, the system is modeled initially with two nodes and a Base Station (BS. Within this framework, each node is treated as a rational decision maker. To this end, each node can decide whether to cooperate and how to cooperate. Cooperative game theory assists in providing an optimal system utility and provides fairness among users. Under different cooperative forwarding modes, certain questions are carefully investigated, including “what is each node's best reaction to maximize its utility?” and “what is the optimal reimbursement to encourage cooperation?” Simulation results show that the nodes benefit from the proposed cooperation stimulating strategy in terms of utility and thus justify the fairness between each user.

  15. A User Cooperation Stimulating Strategy Based on Cooperative Game Theory in Cooperative Relay Networks

    Directory of Open Access Journals (Sweden)

    Jiang Fan

    2009-01-01

    Full Text Available This paper proposes a user cooperation stimulating strategy among rational users. The strategy is based on cooperative game theory and enacted in the context of cooperative relay networks. Using the pricing-based mechanism, the system is modeled initially with two nodes and a Base Station (BS. Within this framework, each node is treated as a rational decision maker. To this end, each node can decide whether to cooperate and how to cooperate. Cooperative game theory assists in providing an optimal system utility and provides fairness among users. Under different cooperative forwarding modes, certain questions are carefully investigated, including "what is each node's best reaction to maximize its utility?" and "what is the optimal reimbursement to encourage cooperation?" Simulation results show that the nodes benefit from the proposed cooperation stimulating strategy in terms of utility and thus justify the fairness between each user.

  16. Critical cooperation range to improve spatial network robustness.

    Directory of Open Access Journals (Sweden)

    Vitor H P Louzada

    Full Text Available A robust worldwide air-transportation network (WAN is one that minimizes the number of stranded passengers under a sequence of airport closures. Building on top of this realistic example, here we address how spatial network robustness can profit from cooperation between local actors. We swap a series of links within a certain distance, a cooperation range, while following typical constraints of spatially embedded networks. We find that the network robustness is only improved above a critical cooperation range. Such improvement can be described in the framework of a continuum transition, where the critical exponents depend on the spatial correlation of connected nodes. For the WAN we show that, except for Australia, all continental networks fall into the same universality class. Practical implications of this result are also discussed.

  17. Coevolution of network structure and cooperation in the public goods game

    International Nuclear Information System (INIS)

    Wang Lei; Xia Chengyi; Wang Juan

    2013-01-01

    Recently, the emergence of cooperation has become a central topic in the evolutionary game field, and coevolution of game dynamics and network topology structure can give us a fresh viewpoint of how the network evolves and cooperation arises. In this paper, we show in detail a picture of the co-evolutionary behaviors between the microscopic structure of the network and cooperation promotion in the public goods game (PGG). Based on a mechanism named after evolutionary preferential attachment (EPA), in which the growth of the network depends on the outcome of PGG dynamics, we explore the structural properties of networks and cooperative behaviors taking place on the networks created by EPA rules. Extensive simulation results indicate that the structure of the resulting networks displays a transition from homogeneous to heterogeneous properties as the selection strength ϵ increases, and the cooperative behaviors have a non-trivial state in which cooperators and defectors can simultaneously occupy the hub nodes in the network. Current results are of interest for us to further understand the cooperation persistence and structure evolution in many natural, social and economical systems. (paper)

  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. A versatile framework for cooperative hub network development

    NARCIS (Netherlands)

    Cruijssen, F.C.A.M.; Borm, P.; Dullaert, W.; Hamers, H.

    2010-01-01

    This paper introduces a framework for cooperative hub network development. Building a joint physical hub for the transshipment of goods is expensive and, therefore, involves considerable risks for cooperating companies. In a practical setting, it is unlikely that an entire network will be built at

  20. A versatile framework for cooperative hub network development

    NARCIS (Netherlands)

    Cruijssen, Frans; Borm, Peter; Dullaert, Wout; Hamers, Herbert

    This paper introduces a framework for cooperative hub network development. Building a joint physical hub for the transshipment of goods is expensive and, therefore, involves considerable risks for cooperating companies. In a practical setting, it is unlikely that an entire network will be built at

  1. 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).

  2. 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.

  3. 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.

  4. 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)

  5. Performance of an Error Control System with Turbo Codes in Powerline Communications

    Directory of Open Access Journals (Sweden)

    Balbuena-Campuzano Carlos Alberto

    2014-07-01

    Full Text Available This paper reports the performance of turbo codes as an error control technique in PLC (Powerline Communications data transmissions. For this system, computer simulations are used for modeling data networks based on the model classified in technical literature as indoor, and uses OFDM (Orthogonal Frequency Division Multiplexing as a modulation technique. Taking into account the channel, modulation and turbo codes, we propose a methodology to minimize the bit error rate (BER, as a function of the average received signal noise ratio (SNR.

  6. 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.

  7. Multiple-Ring Digital Communication Network

    Science.gov (United States)

    Kirkham, Harold

    1992-01-01

    Optical-fiber digital communication network to support data-acquisition and control functions of electric-power-distribution networks. Optical-fiber links of communication network follow power-distribution routes. Since fiber crosses open power switches, communication network includes multiple interconnected loops with occasional spurs. At each intersection node is needed. Nodes of communication network include power-distribution substations and power-controlling units. In addition to serving data acquisition and control functions, each node acts as repeater, passing on messages to next node(s). Multiple-ring communication network operates on new AbNET protocol and features fiber-optic communication.

  8. 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.

  9. 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

  10. Cooperation and contagion in web-based, networked public goods experiments.

    Directory of Open Access Journals (Sweden)

    Siddharth Suri

    Full Text Available A longstanding idea in the literature on human cooperation is that cooperation should be reinforced when conditional cooperators are more likely to interact. In the context of social networks, this idea implies that cooperation should fare better in highly clustered networks such as cliques than in networks with low clustering such as random networks. To test this hypothesis, we conducted a series of web-based experiments, in which 24 individuals played a local public goods game arranged on one of five network topologies that varied between disconnected cliques and a random regular graph. In contrast with previous theoretical work, we found that network topology had no significant effect on average contributions. This result implies either that individuals are not conditional cooperators, or else that cooperation does not benefit from positive reinforcement between connected neighbors. We then tested both of these possibilities in two subsequent series of experiments in which artificial seed players were introduced, making either full or zero contributions. First, we found that although players did generally behave like conditional cooperators, they were as likely to decrease their contributions in response to low contributing neighbors as they were to increase their contributions in response to high contributing neighbors. Second, we found that positive effects of cooperation were contagious only to direct neighbors in the network. In total we report on 113 human subjects experiments, highlighting the speed, flexibility, and cost-effectiveness of web-based experiments over those conducted in physical labs.

  11. 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.

  12. Cooperative Caching in Mobile Ad Hoc Networks Based on Data Utility

    Directory of Open Access Journals (Sweden)

    Narottam Chand

    2007-01-01

    Full Text Available Cooperative caching, which allows sharing and coordination of cached data among clients, is a potential technique to improve the data access performance and availability in mobile ad hoc networks. However, variable data sizes, frequent data updates, limited client resources, insufficient wireless bandwidth and client's mobility make cache management a challenge. In this paper, we propose a utility based cache replacement policy, least utility value (LUV, to improve the data availability and reduce the local cache miss ratio. LUV considers several factors that affect cache performance, namely access probability, distance between the requester and data source/cache, coherency and data size. A cooperative cache management strategy, Zone Cooperative (ZC, is developed that employs LUV as replacement policy. In ZC one-hop neighbors of a client form a cooperation zone since the cost for communication with them is low both in terms of energy consumption and message exchange. Simulation experiments have been conducted to evaluate the performance of LUV based ZC caching strategy. The simulation results show that, LUV replacement policy substantially outperforms the LRU policy.

  13. 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...

  14. Coevolution of Cooperation and Layer Selection Strategy in Multiplex Networks

    Directory of Open Access Journals (Sweden)

    Katsuki Hayashi

    2016-11-01

    Full Text Available Recently, the emergent dynamics in multiplex networks, composed of layers of multiple networks, has been discussed extensively in network sciences. However, little is still known about whether and how the evolution of strategy for selecting a layer to participate in can contribute to the emergence of cooperative behaviors in multiplex networks of social interactions. To investigate these issues, we constructed a coevolutionary model of cooperation and layer selection strategies in which each an individual selects one layer from multiple layers of social networks and plays the Prisoner’s Dilemma with neighbors in the selected layer. We found that the proportion of cooperative strategies increased with increasing the number of layers regardless of the degree of dilemma, and this increase occurred due to a cyclic coevolution process of game strategies and layer selection strategies. We also showed that the heterogeneity of links among layers is a key factor for multiplex networks to facilitate the evolution of cooperation, and such positive effects on cooperation were observed regardless of the difference in the stochastic properties of network topologies.

  15. Downlink Cooperative Broadcast Transmission Based on Superposition Coding in a Relaying System for Future Wireless Sensor Networks.

    Science.gov (United States)

    Liu, Yang; Han, Guangjie; Shi, Sulong; Li, Zhengquan

    2018-06-20

    This study investigates the superiority of cooperative broadcast transmission over traditional orthogonal schemes when applied in a downlink relaying broadcast channel (RBC). Two proposed cooperative broadcast transmission protocols, one with an amplify-and-forward (AF) relay, and the other with a repetition-based decode-and-forward (DF) relay, are investigated. By utilizing superposition coding (SupC), the source and the relay transmit the private user messages simultaneously instead of sequentially as in traditional orthogonal schemes, which means the channel resources are reused and an increased channel degree of freedom is available to each user, hence the half-duplex penalty of relaying is alleviated. To facilitate a performance evaluation, theoretical outage probability expressions of the two broadcast transmission schemes are developed, based on which, we investigate the minimum total power consumption of each scheme for a given traffic requirement by numerical simulation. The results provide details on the overall system performance and fruitful insights on the essential characteristics of cooperative broadcast transmission in RBCs. It is observed that better overall outage performances and considerable power gains can be obtained by utilizing cooperative broadcast transmissions compared to traditional orthogonal schemes.

  16. Decentralized Model Predictive Control for Cooperative Multiple Vehicles Subject to Communication Loss

    Directory of Open Access Journals (Sweden)

    Hojjat A. Izadi

    2011-01-01

    Full Text Available The decentralized model predictive control (DMPC of multiple cooperative vehicles with the possibility of communication loss/delay is investigated. The neighboring vehicles exchange their predicted trajectories at every sample time to maintain the cooperation objectives. In the event of a communication loss (packet dropout, the most recent available information, which is potentially delayed, is used. Then the communication loss problem changes to a cooperative problem when random large communication delays are present. Such large communication delays can lead to poor cooperation performance and unsafe behaviors such as collisions. A new DMPC approach is developed to improve the cooperation performance and achieve safety in the presence of the large communication delays. The proposed DMPC architecture estimates the tail of neighbor's trajectory which is not available due to the large communication delays for improving the performance. The concept of the tube MPC is also employed to provide the safety of the fleet against collisions, in the presence of large intervehicle communication delays. In this approach, a tube shaped trajectory set is assumed around the trajectory of the neighboring vehicles whose trajectory is delayed/lost. The radius of tube is a function of the communication delay and vehicle's maneuverability (in the absence of model uncertainty. The simulation of formation problem of multiple vehicles is employed to illustrate the effectiveness of the proposed approach.

  17. Analysis of Bullying in Cooperative Multi-agent Systems’ Communications

    Directory of Open Access Journals (Sweden)

    Celia Gutiérrez

    2013-12-01

    Full Text Available Cooperative Multi-agent Systems frameworks do not include modules to test communications yet. The proposed framework incorporates robust analysis tools using IDKAnalysis2.0 to evaluate bullying effect in communications. The present work is based on ICARO-T. This platform follows the Adaptive Multi-agent Systems paradigm. Experimentation with ICARO-T includes two deployments: the equitative and the authoritative. Results confirm the usefulness of the analysis tools when exporting to Cooperative Multi-agent Systems that use different configurations. Besides, ICARO-T is provided with new functionality by a set of tools for communication analysis.

  18. Mutually cooperative epidemics on power-law networks

    Science.gov (United States)

    Cui, Peng-Bi; Colaiori, Francesca; Castellano, Claudio

    2017-08-01

    The spread of an infectious disease can, in some cases, promote the propagation of other pathogens favoring violent outbreaks, which cause a discontinuous transition to an endemic state. The topology of the contact network plays a crucial role in these cooperative dynamics. We consider a susceptible-infected-removed-type model with two mutually cooperative pathogens: An individual already infected with one disease has an increased probability of getting infected by the other. We present a heterogeneous mean-field theoretical approach to the coinfection dynamics on generic uncorrelated power-law degree-distributed networks and validate its results by means of numerical simulations. We show that, when the second moment of the degree distribution is finite, the epidemic transition is continuous for low cooperativity, while it is discontinuous when cooperativity is sufficiently high. For scale-free networks, i.e., topologies with diverging second moment, the transition is instead always continuous. In this way we clarify the effect of heterogeneity and system size on the nature of the transition, and we validate the physical interpretation about the origin of the discontinuity.

  19. COUNTER-PUNISHMENT, COMMUNICATION AND COOPERATION AMONG PARTNERS

    Directory of Open Access Journals (Sweden)

    Giulia eAndrighetto

    2016-04-01

    Full Text Available We study how communication affects cooperation in an experimental public goods environment with punishment and counter-punishment opportunities. Participants interacted over thirty rounds in fixed groups with fixed identifiers that allowed them to trace other group members’ behavior over time. The two dimensions of communication we study are asking for a specific contribution level and having to express oneself when choosing to counter-punish. We conduct four experimental treatments, all involving a contribution stage, a punishment stage and a counter-punishment stage in each round. In the first treatment communication is not possible at any of the stages. The second treatment allows participants to ask for a contribution level at the punishment stage and in the third treatment participants are required to send a message if they decide to counter-punishment. The fourth combines the two communication channels of the second and third treatments. We find that the three treatments involving communication at any of the two relevant stages lead to significantly higher contributions than the baseline treatment. We find no difference between the three treatments with communication. We also relate our results to previous results from treatments without counter-punishment opportunities and do not find that the presence of counter-punishment leads to lower cooperation level. The overall pattern of results shows that given fixed identifiers the key factor is the presence of communication. Whenever communication is possible contributions and earnings are higher than when it is not, regardless of counter-punishment opportunities.

  20. Network flow of mobile agents enhances the evolution of cooperation

    Science.gov (United States)

    Ichinose, G.; Satotani, Y.; Nagatani, T.

    2018-01-01

    We study the effect of contingent movement on the persistence of cooperation on complex networks with empty nodes. Each agent plays the Prisoner's Dilemma game with its neighbors and then it either updates the strategy depending on the payoff difference with neighbors or it moves to another empty node if not satisfied with its own payoff. If no neighboring node is empty, each agent stays at the same site. By extensive evolutionary simulations, we show that the medium density of agents enhances cooperation where the network flow of mobile agents is also medium. Moreover, if the movements of agents are more frequent than the strategy updating, cooperation is further promoted. In scale-free networks, the optimal density for cooperation is lower than other networks because agents get stuck at hubs. Our study suggests that keeping a smooth network flow is significant for the persistence of cooperation in ever-changing societies.

  1. Hybrid optical CDMA-FSO communications network under spatially correlated gamma-gamma scintillation

    DEFF Research Database (Denmark)

    Jurado-Navas, Antonio; Raddo, Thiago R.; Garrido-Balsells, José María

    2016-01-01

    In this paper, we propose a new hybrid network solution based on asynchronous optical code-division multiple-access (OCDMA) and free-space optical (FSO) technologies for last-mile access networks, where fiber deployment is impractical. The architecture of the proposed hybrid OCDMA-FSO network...... is thoroughly described. The users access the network in a fully asynchronous manner by means of assigned fast frequency hopping (FFH)-based codes. In the FSO receiver, an equal gain-combining technique is employed along with intensity modulation and direct detection. New analytical formalisms for evaluating...... can successfully achieve error-free ABER levels for the three scenarios considered as long as forward error correction (FEC) algorithms are employed. Therefore, OCDMA-FSO networks can be a prospective alternative to deliver high-speed communication services to access networks with deficient fiber...

  2. Energy Spectral Behaviors of Communication Networks of Open-Source Communities.

    Directory of Open Access Journals (Sweden)

    Jianmei Yang

    Full Text Available Large-scale online collaborative production activities in open-source communities must be accompanied by large-scale communication activities. Nowadays, the production activities of open-source communities, especially their communication activities, have been more and more concerned. Take CodePlex C # community for example, this paper constructs the complex network models of 12 periods of communication structures of the community based on real data; then discusses the basic concepts of quantum mapping of complex networks, and points out that the purpose of the mapping is to study the structures of complex networks according to the idea of quantum mechanism in studying the structures of large molecules; finally, according to this idea, analyzes and compares the fractal features of the spectra in different quantum mappings of the networks, and concludes that there are multiple self-similarity and criticality in the communication structures of the community. In addition, this paper discusses the insights and application conditions of different quantum mappings in revealing the characteristics of the structures. The proposed quantum mapping method can also be applied to the structural studies of other large-scale organizations.

  3. Evolution of cooperation under social pressure in multiplex networks.

    Science.gov (United States)

    Pereda, María

    2016-09-01

    In this work, we aim to contribute to the understanding of human prosocial behavior by studying the influence that a particular form of social pressure, "being watched," has on the evolution of cooperative behavior. We study how cooperation emerges in multiplex complex topologies by analyzing a particular bidirectionally coupled dynamics on top of a two-layer multiplex network (duplex). The coupled dynamics appears between the prisoner's dilemma game in a network and a threshold cascade model in the other. The threshold model is intended to abstract the behavior of a network of vigilant nodes that impose the pressure of being observed altering hence the temptation to defect of the dilemma. Cooperation or defection in the game also affects the state of a node of being vigilant. We analyze these processes on different duplex networks structures and assess the influence of the topology, average degree and correlated multiplexity, on the outcome of cooperation. Interestingly, we find that the social pressure of vigilance may impact cooperation positively or negatively, depending on the duplex structure, specifically the degree correlations between layers is determinant. Our results give further quantitative insights in the promotion of cooperation under social pressure.

  4. Computer-communication networks

    CERN Document Server

    Meditch, James S

    1983-01-01

    Computer- Communication Networks presents a collection of articles the focus of which is on the field of modeling, analysis, design, and performance optimization. It discusses the problem of modeling the performance of local area networks under file transfer. It addresses the design of multi-hop, mobile-user radio networks. Some of the topics covered in the book are the distributed packet switching queuing network design, some investigations on communication switching techniques in computer networks and the minimum hop flow assignment and routing subject to an average message delay constraint

  5. 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

  6. 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.

  7. 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.

  8. The communications in early warning network for radiation monitoring

    International Nuclear Information System (INIS)

    Oyoun, M.B.; Al-Hussin, Mohamad; Fares, Adnan; Al-Oulabi, Yasser; Othman, Ibrahim

    1992-07-01

    The objectives of early warning network are: The determination of gamma radiation (background) levels in air which depend on location and time, evaluation of any situation resulting from radiation or nuclear accident out of boarder, and after that reporting the emergency situation to relevant authorities on the national and international levels. Monitoring stations were installed using Gm tubes to cover boarder lines from south to north and east to west as follows: Damascus, Darra, Latakia, Tartous, Aleppo, Kamishly, Ragaa, and Qunitra. The following modes of communication: Telephone line, leased line, direct connection, and Syrian data network were used in the Syrian early network. This project was carried out in cooperation with IAEA under project no. RER/9/003. (author). 22 figs., 1 tab

  9. Expert Game experiment predicts emergence of trust in professional communication networks.

    Science.gov (United States)

    Bendtsen, Kristian Moss; Uekermann, Florian; Haerter, Jan O

    2016-10-25

    Strong social capital is increasingly recognized as an organizational advantage. Better knowledge sharing and reduced transaction costs increase work efficiency. To mimic the formation of the associated communication network, we propose the Expert Game, where each individual must find a specific expert and receive her help. Participants act in an impersonal environment and under time constraints that provide short-term incentives for noncooperative behavior. Despite these constraints, we observe cooperation between individuals and the self-organization of a sustained trust network, which facilitates efficient communication channels with increased information flow. We build a behavioral model that explains the experimental dynamics. Analysis of the model reveals an exploitation protection mechanism and measurable social capital, which quantitatively describe the economic utility of trust.

  10. 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....

  11. Cooperative water network system to reduce carbon footprint.

    Science.gov (United States)

    Lim, Seong-Rin; Park, Jong Moon

    2008-08-15

    Much effort has been made in reducing the carbon footprint to mitigate climate change. However, water network synthesis has been focused on reducing the consumption and cost of freshwater within each industrial plant. The objective of this study is to illustrate the necessity of the cooperation of industrial plants to reduce the total carbon footprint of their water supply systems. A mathematical optimization model to minimize global warming potentials is developed to synthesize (1) a cooperative water network system (WNS) integrated over two plants and (2) an individual WNS consisting of two WNSs separated for each plant. The cooperative WNS is compared to the individual WNS. The cooperation reduces their carbon footprint and is economically feasible and profitable. A strategy for implementing the cooperation is suggested for the fair distribution of costs and benefits. As a consequence, industrial plants should cooperate with their neighbor plants to further reduce the carbon footprint.

  12. Children's use of communicative intent in the selection of cooperative partners.

    Directory of Open Access Journals (Sweden)

    Kristen A Dunfield

    Full Text Available Within the animal kingdom, human cooperation represents an outlier. As such, there has been great interest across a number of fields in identifying the factors that support the complex and flexible variety of cooperation that is uniquely human. The ability to identify and preferentially interact with better social partners (partner choice is proposed to be a major factor in maintaining costly cooperation between individuals. Here we show that the ability to engage in flexible and effective partner choice behavior can be traced back to early childhood. Specifically, across two studies, we demonstrate that by 3 years of age, children identify effective communication as "helpful" (Experiments 1 & 2, reward good communicators with information (Experiment 1, and selectively reciprocate communication with diverse cooperative acts (Experiment 2. Taken together, these results suggest that even in early childhood, humans take advantage of cooperative benefits, while mitigating free-rider risks, through appropriate partner choice behavior.

  13. Cooperative optimization and their application in LDPC codes

    Science.gov (United States)

    Chen, Ke; Rong, Jian; Zhong, Xiaochun

    2008-10-01

    Cooperative optimization is a new way for finding global optima of complicated functions of many variables. The proposed algorithm is a class of message passing algorithms and has solid theory foundations. It can achieve good coding gains over the sum-product algorithm for LDPC codes. For (6561, 4096) LDPC codes, the proposed algorithm can achieve 2.0 dB gains over the sum-product algorithm at BER of 4×10-7. The decoding complexity of the proposed algorithm is lower than the sum-product algorithm can do; furthermore, the former can achieve much lower error floor than the latter can do after the Eb / No is higher than 1.8 dB.

  14. Relay Selection for Cooperative Relaying in Wireless Energy Harvesting Networks

    Science.gov (United States)

    Zhu, Kaiyan; Wang, Fei; Li, Songsong; Jiang, Fengjiao; Cao, Lijie

    2018-01-01

    Energy harvesting from the surroundings is a promising solution to provide energy supply and extend the life of wireless sensor networks. Recently, energy harvesting has been shown as an attractive solution to prolong the operation of cooperative networks. In this paper, we propose a relay selection scheme to optimize the amplify-and-forward (AF) cooperative transmission in wireless energy harvesting cooperative networks. The harvesting energy and channel conditions are considered to select the optimal relay as cooperative relay to minimize the outage probability of the system. Simulation results show that our proposed relay selection scheme achieves better outage performance than other strategies.

  15. Modelling of Security Principles Within Car-to-Car Communications in Modern Cooperative Intelligent Transportation Systems

    Directory of Open Access Journals (Sweden)

    Jan Durech

    2016-01-01

    Full Text Available Intelligent transportation systems (ITS bring advanced applications that provide innovative services for various transportation modes in the area of traffic control, and enable better awareness for different users. Communication connections between intelligent vehicles with the use of wireless communication standards, so called Vehicular Ad Hoc Networks (VANETs, require ensuring verification of validity of provided services as well as services related to transmission confidentiality and integrity. The goal of this paper is to analyze secure mechanisms utilised in VANET communication within Cooperative Intelligent Transportation Systems (C-ITS with a focus on safety critical applications. The practical part of the contribution is dedicated to modelling of security properties of VANET networks via OPNET Modeler tool extended by the implementation of the OpenSSL library for authentication protocol realisation based on digital signature schemes. The designed models simulate a transmission of authorised alert messages in Car-to-Car communication for several traffic scenarios with recommended Elliptic Curve Integrated Encryption Scheme (ECIES. The obtained results of the throughput and delay in the simulated network are compared for secured and no-secured communications in dependence on the selected digital signature schemes and the number of mobile nodes. The OpenSSL library has also been utilised for the comparison of time demandingness of digital signature schemes based on RSA (Rivest Shamir Adleman, DSA (Digital Signature Algorithm and ECDSA (Elliptic Curve Digital Signature Algorithm for different key-lengths suitable for real time VANET communications for safety-critical applications of C-ITS.

  16. Fourth international conference on Networks & Communications

    CERN Document Server

    Meghanathan, Natarajan; Nagamalai, Dhinaharan; Computer Networks & Communications (NetCom)

    2013-01-01

    Computer Networks & Communications (NetCom) is the proceedings from the Fourth International Conference on Networks & Communications. This book covers theory, methodology and applications of computer networks, network protocols and wireless networks, data communication technologies, and network security. The proceedings will feature peer-reviewed papers that illustrate research results, projects, surveys and industrial experiences that describe significant advances in the diverse areas of computer networks & communications.

  17. Transparency in Cooperative Online Education

    Science.gov (United States)

    Dalsgaard, Christian; Paulsen, Morten Flate

    2009-01-01

    The purpose of this article is to discuss the following question: What is the potential of social networking within cooperative online education? Social networking does not necessarily involve communication, dialogue, or collaboration. Instead, the authors argue that "transparency" is a unique feature of social networking services.…

  18. Cooperative Handover Management in Dense Cellular Networks

    KAUST Repository

    Arshad, Rabe; Elsawy, Hesham; Sorour, Sameh; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim

    2017-01-01

    Network densification has always been an important factor to cope with the ever increasing capacity demand. Deploying more base stations (BSs) improves the spatial frequency utilization, which increases the network capacity. However, such improvement comes at the expense of shrinking the BSs' footprints, which increases the handover (HO) rate and may diminish the foreseen capacity gains. In this paper, we propose a cooperative HO management scheme to mitigate the HO effect on throughput gains achieved via cellular network densification. The proposed HO scheme relies on skipping HO to the nearest BS at some instances along the user's trajectory while enabling cooperative BS service during HO execution at other instances. To this end, we develop a mathematical model, via stochastic geometry, to quantify the performance of the proposed HO scheme in terms of coverage probability and user throughput. The results show that the proposed cooperative HO scheme outperforms the always best connected based association at high mobility. Also, the value of BS cooperation along with handover skipping is quantified with respect to the HO skipping only that has recently appeared in the literature. Particularly, the proposed cooperative HO scheme shows throughput gains of 12% to 27% and 17% on average, when compared to the always best connected and HO skipping only schemes at user velocity ranging from 80 km/h to 160 Km/h, respectively.

  19. Cooperative Handover Management in Dense Cellular Networks

    KAUST Repository

    Arshad, Rabe

    2017-02-07

    Network densification has always been an important factor to cope with the ever increasing capacity demand. Deploying more base stations (BSs) improves the spatial frequency utilization, which increases the network capacity. However, such improvement comes at the expense of shrinking the BSs\\' footprints, which increases the handover (HO) rate and may diminish the foreseen capacity gains. In this paper, we propose a cooperative HO management scheme to mitigate the HO effect on throughput gains achieved via cellular network densification. The proposed HO scheme relies on skipping HO to the nearest BS at some instances along the user\\'s trajectory while enabling cooperative BS service during HO execution at other instances. To this end, we develop a mathematical model, via stochastic geometry, to quantify the performance of the proposed HO scheme in terms of coverage probability and user throughput. The results show that the proposed cooperative HO scheme outperforms the always best connected based association at high mobility. Also, the value of BS cooperation along with handover skipping is quantified with respect to the HO skipping only that has recently appeared in the literature. Particularly, the proposed cooperative HO scheme shows throughput gains of 12% to 27% and 17% on average, when compared to the always best connected and HO skipping only schemes at user velocity ranging from 80 km/h to 160 Km/h, respectively.

  20. Evolution of Cooperation in Adaptive Social Networks

    Science.gov (United States)

    Segbroeck, Sven Van; Santos, Francisco C.; Traulsen, Arne; Lenaerts, Tom; Pacheco, Jorge M.

    Humans are organized in societies, a phenomenon that would never have been possible without the evolution of cooperative behavior. Several mechanisms that foster this evolution have been unraveled over the years, with population structure as a prominent promoter of cooperation. Modern networks of exchange and cooperation are, however, becoming increasingly volatile, and less and less based on long-term stable structure. Here, we address how this change of paradigm aspects the evolution of cooperation. We discuss analytical and numerical models in which individuals can break social ties and create new ones. Interactions are modeled as two-player dilemmas of cooperation. Once a link between two individuals has formed, the productivity of this link is evaluated. Links can be broken off at different rates. This individual capacity of forming new links or severing inconvenient ones can effectively change the nature of the game. We address random formation of new links and local linking rules as well as different individual capacities to maintain social interactions. We conclude by discussing how adaptive social networks can become an important step towards more realistic models of cultural dynamics.

  1. Designing for Networked Communications

    DEFF Research Database (Denmark)

    Designing for Networked Communications: Strategies and Development explains how to plan, use, and understand the products and the dynamic social processes and tasks some of the most vital innovations in the knowledge society depend upon– social as well as technological. Focusing on various forms...... of design, implementation and integration of computer mediated communication, this book bridges the academic fields of computer science and communication studies. Designing for Networked Communications: Strategies and Development uses an interdisciplinary approach, and presents results from recent...... and important research in a variety of forms for networked communications. A constructive and critical view of the interplay between the new electronic and the more conventional modes of communication are utilized, while studies of organizational work practices demonstrate that the use of new technologies...

  2. 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.

  3. Cooperative control of multi-agent systems optimal and adaptive design approaches

    CERN Document Server

    Lewis, Frank L; Hengster-Movric, Kristian; Das, Abhijit

    2014-01-01

    Task complexity, communication constraints, flexibility and energy-saving concerns are all factors that may require a group of autonomous agents to work together in a cooperative manner. Applications involving such complications include mobile robots, wireless sensor networks, unmanned aerial vehicles (UAVs), spacecraft, and so on. In such networked multi-agent scenarios, the restrictions imposed by the communication graph topology can pose severe problems in the design of cooperative feedback control systems.  Cooperative control of multi-agent systems is a challenging topic for both control theorists and practitioners and has been the subject of significant recent research. Cooperative Control of Multi-Agent Systems extends optimal control and adaptive control design methods to multi-agent systems on communication graphs.  It develops Riccati design techniques for general linear dynamics for cooperative state feedback design, cooperative observer design, and cooperative dynamic output feedback design.  B...

  4. The entire network topology display system of terminal communication access network

    OpenAIRE

    An Yi

    2016-01-01

    Now order terminal communication access network is network technology in Shanxi Province is diversiform, device type complex, lack of unified technical standard, the terminal communication access network management system of construction constitutes a great obstacle. Need to build a “unified communication interface and communication standard, unified communications network management” of the terminal communication access network cut in the integrated network management system, for the termina...

  5. Age structure and cooperation in coevolutionary games on dynamic network

    Science.gov (United States)

    Qin, Zilong; Hu, Zhenhua; Zhou, Xiaoping; Yi, Jingzhang

    2015-04-01

    Our proposed model imitates the growth of a population and describes the age structure and the level of cooperation in games on dynamic network with continuous changes of structure and topology. The removal of nodes and links caused by age-dependent attack, together with the nodes addition standing for the newborns of population, badly ruins Matthew effect in this coevolutionary process. Though the network is generated by growth and preferential attachment, it degenerates into random network and it is no longer heterogeneous. When the removal of nodes and links is equal to the addition of nodes and links, the size of dynamic network is maintained in steady-state, so is the low level of cooperation. Severe structure variation, homogeneous topology and continuous invasion of new defection jointly make dynamic network unsuitable for the survival of cooperator even when the probability with which the newborn players initially adopt the strategy cooperation is high, while things change slightly when the connections of newborn players are restricted. Fortunately, moderate interactions in a generation trigger an optimal recovering process to encourage cooperation. The model developed in this paper outlines an explanation of the cohesion changes in the development process of an organization. Some suggestions for cooperative behavior improvement are given in the end.

  6. Multi-Sensor Detection with Particle Swarm Optimization for Time-Frequency Coded Cooperative WSNs Based on MC-CDMA for Underground Coal Mines

    Directory of Open Access Journals (Sweden)

    Jingjing Xu

    2015-08-01

    Full Text Available In this paper, a wireless sensor network (WSN technology adapted to underground channel conditions is developed, which has important theoretical and practical value for safety monitoring in underground coal mines. According to the characteristics that the space, time and frequency resources of underground tunnel are open, it is proposed to constitute wireless sensor nodes based on multicarrier code division multiple access (MC-CDMA to make full use of these resources. To improve the wireless transmission performance of source sensor nodes, it is also proposed to utilize cooperative sensors with good channel conditions from the sink node to assist source sensors with poor channel conditions. Moreover, the total power of the source sensor and its cooperative sensors is allocated on the basis of their channel conditions to increase the energy efficiency of the WSN. To solve the problem that multiple access interference (MAI arises when multiple source sensors transmit monitoring information simultaneously, a kind of multi-sensor detection (MSD algorithm with particle swarm optimization (PSO, namely D-PSO, is proposed for the time-frequency coded cooperative MC-CDMA WSN. Simulation results show that the average bit error rate (BER performance of the proposed WSN in an underground coal mine is improved significantly by using wireless sensor nodes based on MC-CDMA, adopting time-frequency coded cooperative transmission and D-PSO algorithm with particle swarm optimization.

  7. Multi-Sensor Detection with Particle Swarm Optimization for Time-Frequency Coded Cooperative WSNs Based on MC-CDMA for Underground Coal Mines.

    Science.gov (United States)

    Xu, Jingjing; Yang, Wei; Zhang, Linyuan; Han, Ruisong; Shao, Xiaotao

    2015-08-27

    In this paper, a wireless sensor network (WSN) technology adapted to underground channel conditions is developed, which has important theoretical and practical value for safety monitoring in underground coal mines. According to the characteristics that the space, time and frequency resources of underground tunnel are open, it is proposed to constitute wireless sensor nodes based on multicarrier code division multiple access (MC-CDMA) to make full use of these resources. To improve the wireless transmission performance of source sensor nodes, it is also proposed to utilize cooperative sensors with good channel conditions from the sink node to assist source sensors with poor channel conditions. Moreover, the total power of the source sensor and its cooperative sensors is allocated on the basis of their channel conditions to increase the energy efficiency of the WSN. To solve the problem that multiple access interference (MAI) arises when multiple source sensors transmit monitoring information simultaneously, a kind of multi-sensor detection (MSD) algorithm with particle swarm optimization (PSO), namely D-PSO, is proposed for the time-frequency coded cooperative MC-CDMA WSN. Simulation results show that the average bit error rate (BER) performance of the proposed WSN in an underground coal mine is improved significantly by using wireless sensor nodes based on MC-CDMA, adopting time-frequency coded cooperative transmission and D-PSO algorithm with particle swarm optimization.

  8. Probabilistic interconnection between interdependent networks promotes cooperation in the public goods game

    International Nuclear Information System (INIS)

    Wang, Baokui; Chen, Xiaojie; Wang, Long

    2012-01-01

    Most previous works study the evolution of cooperation in a structured population by commonly employing an isolated single network. However, realistic systems are composed of many interdependent networks coupled with each other, rather than an isolated single one. In this paper, we consider a system including two interacting networks with the same size, entangled with each other by the introduction of probabilistic interconnections. We introduce the public goods game into such a system, and study how the probabilistic interconnection influences the evolution of cooperation of the whole system and the coupling effect between two layers of interdependent networks. Simulation results show that there exists an intermediate region of interconnection probability leading to the maximum cooperation level in the whole system. Interestingly, we find that at the optimal interconnection probability the fraction of internal links between cooperators in two layers is maximal. Also, even if initially there are no cooperators in one layer of interdependent networks, cooperation can still be promoted by probabilistic interconnection, and the cooperation levels in both layers can more easily reach an agreement at the intermediate interconnection probability. Our results may be helpful in understanding cooperative behavior in some realistic interdependent networks and thus highlight the importance of probabilistic interconnection on the evolution of cooperation. (paper)

  9. A Denotational Semantics for Communicating Unstructured Code

    Directory of Open Access Journals (Sweden)

    Nils Jähnig

    2015-03-01

    Full Text Available An important property of programming language semantics is that they should be compositional. However, unstructured low-level code contains goto-like commands making it hard to define a semantics that is compositional. In this paper, we follow the ideas of Saabas and Uustalu to structure low-level code. This gives us the possibility to define a compositional denotational semantics based on least fixed points to allow for the use of inductive verification methods. We capture the semantics of communication using finite traces similar to the denotations of CSP. In addition, we examine properties of this semantics and give an example that demonstrates reasoning about communication and jumps. With this semantics, we lay the foundations for a proof calculus that captures both, the semantics of unstructured low-level code and communication.

  10. Cooperative epidemics on multiplex networks

    Science.gov (United States)

    Azimi-Tafreshi, N.

    2016-04-01

    The spread of one disease, in some cases, can stimulate the spreading of another infectious disease. Here, we treat analytically a symmetric coinfection model for spreading of two diseases on a two-layer multiplex network. We allow layer overlapping, but we assume that each layer is random and locally loopless. Infection with one of the diseases increases the probability of getting infected with the other. Using the generating function method, we calculate exactly the fraction of individuals infected with both diseases (so-called coinfected clusters) in the stationary state, as well as the epidemic spreading thresholds and the phase diagram of the model. With increasing cooperation, we observe a tricritical point and the type of transition changes from continuous to hybrid. Finally, we compare the coinfected clusters in the case of cooperating diseases with the so-called "viable" clusters in networks with dependencies.

  11. Game Theoretic Analysis of Cooperative Message Forwarding in Opportunistic Mobile Networks.

    Science.gov (United States)

    Pal, Sujata; Saha, Barun Kumar; Misra, Sudip

    2017-12-01

    In cooperative communication, a set of players forming a coalition ensures communal behavior among themselves by helping one another in message forwarding. Opportunistic mobile networks (OMNs) require multihop communications for transferring messages from the source to the destination nodes. However, noncooperative nodes only forward their own messages to others, and drop others' messages upon receiving them. So, the message delivery overhead increases in OMN. For minimizing the overhead and maximizing the delivery rate, we propose two coalition-based cooperative schemes: 1) simple coalition formation (SCF) and 2) overlapping coalition formation (OCF) game. In SCF, we consider the presence of a central information center, whereas OCF is a fully distributed scheme. In SCF, coalitions are disjoint, whereas in OCF, a node may be the member of multiple coalitions at the same time. All nodes in a coalition help each other cooperatively by forwarding group messages to the intermediate or destination nodes. The goal of the nodes is to achieve high success rate in delivering messages. The proposed SCF scheme is cohesive, in which disjoint coalitions always combine to form grand coalition. In OCF, a node reaches a stable grand coalition when all the nodes of the OMN are members of overlapping coalition of the node. No node gains by deviating from the grand coalition in SCF and OCF. Simulation results based on synthetic mobility model and real-life traces show that the message delivery ratio of OMNs increase by up to 67%, as compared to the noncooperative scenario. Moreover, the message overhead ratio using the proposed coalition-based schemes reduces by up to about (1/3)rd of that of the noncooperative communication scheme.

  12. Multi-way Communications: An Information Theoretic Perspective

    KAUST Repository

    Chaaban, Anas

    2015-09-15

    Multi-way communication is a means to significantly improve the spectral efficiency of wireless networks. For instance, in a bi-directional (or two-way) communication channel, two users can simultaneously use the transmission medium to exchange information, thus achieving up to twice the rate that would be achieved had each user transmitted separately. Multi-way communications provides an overview on the developments in this research area since it has been initiated by Shannon. The basic two-way communication channel is considered first, followed by the two-way relay channel obtained by the deployment of an additional cooperative relay node to improve the overall communication performance. This basic setup is then extended to multi-user systems. For all these setups, fundamental limits on the achievable rates are reviewed, thereby making use of a linear high-SNR deterministic channel model to provide valuable insights which are helpful when discussing the coding schemes for Gaussian channel models in detail. Several tools and communication strategies are used in the process, including (but not limited to) computation, signal-space alignment, and nested-lattice codes. Finally, extensions of multi-way communication channels to multiple antenna settings are discussed. © 2015 A. Chaaban and A. Sezgin.

  13. Performance analysis of best relay selection scheme for amplify-and-forward cooperative networks in identical Nakagami-m channels

    KAUST Repository

    Hussain, Syed Imtiaz

    2010-06-01

    In cooperative communication networks, the use of multiple relays between the source and the destination was proposed to increase the diversity gain. Since the source and all the relays must transmit on orthogonal channels, multiple relay cooperation is considered inefficient in terms of channel resources and bandwidth utilization. To overcome this problem, the concept of best relay selection was recently proposed. In this paper, we analyze the performance of the best relay selection scheme for a cooperative network with multiple relays operating in amplify-and-forward (AF) mode over identical Nakagami-m channels using exact source-relay-destination signal to noise ratio (SNR) expression. We derive accurate closed form expressions for various system parameters including probability density function (pdf) of end-to-end SNR, average output SNR, average probability of bit error and average channel capacity. T he analytical results are verified through extensive simulations. It is shown that the best relay selection scheme performs better than the regular all relay cooperation.

  14. Social dilemmas in an online social network: The structure and evolution of cooperation

    International Nuclear Information System (INIS)

    Fu Feng; Chen Xiaojie; Liu Lianghuan; Wang Long

    2007-01-01

    We investigate two paradigms for studying the evolution of cooperation-Prisoner's Dilemma and Snowdrift game in an online friendship network, obtained from a social networking site. By structural analysis, it is revealed that the empirical social network has small-world and scale-free properties. Besides, it exhibits assortative mixing pattern. Then, we study the evolutionary version of the two types of games on it. It is found that cooperation is substantially promoted with small values of game matrix parameters in both games. Whereas the competent cooperators induced by the underlying network of contacts will be dramatically inhibited with increasing values of the game parameters. Further, we explore the role of assortativity in evolution of cooperation by random edge rewiring. We find that increasing amount of assortativity will to a certain extent diminish the cooperation level. We also show that connected large hubs are capable of maintaining cooperation. The evolution of cooperation on empirical networks is influenced by various network effects in a combined manner, compared with that on model networks. Our results can help understand the cooperative behaviors in human groups and society

  15. Evolution of Cooperation in Social Dilemmas on Complex Networks

    Science.gov (United States)

    Iyer, Swami; Killingback, Timothy

    2016-01-01

    Cooperation in social dilemmas is essential for the functioning of systems at multiple levels of complexity, from the simplest biological organisms to the most sophisticated human societies. Cooperation, although widespread, is fundamentally challenging to explain evolutionarily, since natural selection typically favors selfish behavior which is not socially optimal. Here we study the evolution of cooperation in three exemplars of key social dilemmas, representing the prisoner’s dilemma, hawk-dove and coordination classes of games, in structured populations defined by complex networks. Using individual-based simulations of the games on model and empirical networks, we give a detailed comparative study of the effects of the structural properties of a network, such as its average degree, variance in degree distribution, clustering coefficient, and assortativity coefficient, on the promotion of cooperative behavior in all three classes of games. PMID:26928428

  16. Communication security in open health care networks.

    Science.gov (United States)

    Blobel, B; Pharow, P; Engel, K; Spiegel, V; Krohn, R

    1999-01-01

    Fulfilling the shared care paradigm, health care networks providing open systems' interoperability in health care are needed. Such communicating and co-operating health information systems, dealing with sensitive personal medical information across organisational, regional, national or even international boundaries, require appropriate security solutions. Based on the generic security model, within the European MEDSEC project an open approach for secure EDI like HL7, EDIFACT, XDT or XML has been developed. The consideration includes both securing the message in an unsecure network and the transport of the unprotected information via secure channels (SSL, TLS etc.). Regarding EDI, an open and widely usable security solution has been specified and practically implemented for the examples of secure mailing and secure file transfer (FTP) via wrapping the sensitive information expressed by the corresponding protocols. The results are currently prepared for standardisation.

  17. 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.

  18. 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....

  19. 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...

  20. SOCIAL NETWORKS AND INTERPERSONAL COMMUNICATION

    Directory of Open Access Journals (Sweden)

    Veronica GHEORGHIȚĂ

    2014-11-01

    Full Text Available Social networks visible influence people's ability to interact and communicate. Extending social circles by establishing virtual links involves a number of positive aspects such as: instant access to options for interaction, sharing of information to large communities of people, intensification of acts of communication, high levels of feedback and trust with people with whom we communicate. On the other hand, social networks adversely affects communication by decreasing the interaction face to face, by imposing superficial communications experiences, grammatical and spelling erosion of the language. Therefore, the study aims to capture the spread of social networks, their use and impact on interpersonal communication. More specifically, they look for the answer to the question: what is the nature of interpersonal communication that is found on social networking sites: personal, emotional, private or shared, informal, and public?

  1. Greed and Fear in Network Reciprocity: Implications for Cooperation among Organizations

    Science.gov (United States)

    Kitts, James A.; Leal, Diego F.; Felps, Will; Jones, Thomas M.; Berman, Shawn L.

    2016-01-01

    Extensive interdisciplinary literatures have built on the seminal spatial dilemmas model, which depicts the evolution of cooperation on regular lattices, with strategies propagating locally by relative fitness. In this model agents may cooperate with neighbors, paying an individual cost to enhance their collective welfare, or they may exploit cooperative neighbors and diminish collective welfare. Recent research has extended the model in numerous ways, incorporating behavioral noise, implementing other network topologies or adaptive networks, and employing alternative dynamics of replication. Although the underlying dilemma arises from two distinct dimensions—the gains for exploiting cooperative partners (Greed) and the cost of cooperating with exploitative partners (Fear)–most work following from the spatial dilemmas model has argued or assumed that the dilemma can be represented with a single parameter: This research has typically examined Greed or Fear in isolation, or a composite such as the K-index of Cooperation or the ratio of the benefit to cost of cooperation. We challenge this claim on theoretical grounds—showing that embedding interaction in networks generally leads Greed and Fear to have divergent, interactive, and highly nonlinear effects on cooperation at the macro level, even when individuals respond identically to Greed and Fear. Using computational experiments, we characterize both dynamic local behavior and long run outcomes across regions of this space. We also simulate interventions to investigate changes of Greed and Fear over time, showing how model behavior changes asymmetrically as boundaries in payoff space are crossed, leading some interventions to have irreversible effects on cooperation. We then replicate our experiments on inter-organizational network data derived from links through shared directors among 2,400 large US corporations, thus demonstrating our findings for Greed and Fear on a naturally-occurring network. In closing

  2. The cooperative game theory of networks and hierarchies

    CERN Document Server

    Gilles, Robert P

    2010-01-01

    This book details standard concepts in cooperative game theory with applications to the analysis of social networks and hierarchical authority organizations. It covers the multi-linear extension, the Core, the Shapley value, and the cooperative potential.

  3. Estimation of Distribution Algorithm for Resource Allocation in Green Cooperative Cognitive Radio Sensor Networks

    Directory of Open Access Journals (Sweden)

    Alagan Anpalagan

    2013-04-01

    Full Text Available Due to the rapid increase in the usage and demand of wireless sensor networks (WSN, the limited frequency spectrum available for WSN applications will be extremely crowded in the near future. More sensor devices also mean more recharging/replacement of batteries, which will cause significant impact on the global carbon footprint. In this paper, we propose a relay-assisted cognitive radio sensor network (CRSN that allocates communication resources in an environmentally friendly manner. We use shared band amplify and forward relaying for cooperative communication in the proposed CRSN. We present a multi-objective optimization architecture for resource allocation in a green cooperative cognitive radio sensor network (GC-CRSN. The proposed multi-objective framework jointly performs relay assignment and power allocation in GC-CRSN, while optimizing two conflicting objectives. The first objective is to maximize the total throughput, and the second objective is to minimize the total transmission power of CRSN. The proposed relay assignment and power allocation problem is a non-convex mixed-integer non-linear optimization problem (NC-MINLP, which is generally non-deterministic polynomial-time (NP-hard. We introduce a hybrid heuristic algorithm for this problem. The hybrid heuristic includes an estimation-of-distribution algorithm (EDA for performing power allocation and iterative greedy schemes for constraint satisfaction and relay assignment. We analyze the throughput and power consumption tradeoff in GC-CRSN. A detailed analysis of the performance of the proposed algorithm is presented with the simulation results.

  4. 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.

  5. Social dilemmas in an online social network: The structure and evolution of cooperation

    Energy Technology Data Exchange (ETDEWEB)

    Fu Feng [Center for Systems and Control, College of Engineering, Peking University, Beijing 100871 (China); Department of Industrial Engineering and Management, College of Engineering, Peking University, Beijing 100871 (China)], E-mail: fufeng@pku.edu.cn; Chen Xiaojie; Liu Lianghuan [Center for Systems and Control, College of Engineering, Peking University, Beijing 100871 (China); Department of Industrial Engineering and Management, College of Engineering, Peking University, Beijing 100871 (China); Wang Long [Center for Systems and Control, College of Engineering, Peking University, Beijing 100871 (China); Department of Industrial Engineering and Management, College of Engineering, Peking University, Beijing 100871 (China)], E-mail: longwang@pku.edu.cn

    2007-11-05

    We investigate two paradigms for studying the evolution of cooperation-Prisoner's Dilemma and Snowdrift game in an online friendship network, obtained from a social networking site. By structural analysis, it is revealed that the empirical social network has small-world and scale-free properties. Besides, it exhibits assortative mixing pattern. Then, we study the evolutionary version of the two types of games on it. It is found that cooperation is substantially promoted with small values of game matrix parameters in both games. Whereas the competent cooperators induced by the underlying network of contacts will be dramatically inhibited with increasing values of the game parameters. Further, we explore the role of assortativity in evolution of cooperation by random edge rewiring. We find that increasing amount of assortativity will to a certain extent diminish the cooperation level. We also show that connected large hubs are capable of maintaining cooperation. The evolution of cooperation on empirical networks is influenced by various network effects in a combined manner, compared with that on model networks. Our results can help understand the cooperative behaviors in human groups and society.

  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. An Issue of Boundary Value for Velocity and Training Overhead Using Cooperative MIMO Technique in Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    M. R. Islam

    2011-06-01

    Full Text Available A boundary value of velocity of data gathering node (DGN and a critical value for training overhead beyond which the cooperative communication in wireless sensor network will not be feasible is proposed in this paper. Multiple Input Multiple Outputs (MIMO cooperative communication is taken as an application. The performance in terms of energy efficiency and delay for a combination of two transmitting and two receiving antennas is analyzed. The results show that a set of critical value of velocity and training overhead pair is present for the long haul communication from the sensors to the data gathering node. Later a graphical relation between boundary value of training overhead and velocity is simulated. A mathematical relation between velocity and training overhead is also developed. The effects of several parameters on training overhead and velocity are analyzed.

  8. 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 ...

  9. 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...

  10. ACTS TDMA network control. [Advanced Communication Technology Satellite

    Science.gov (United States)

    Inukai, T.; Campanella, S. J.

    1984-01-01

    This paper presents basic network control concepts for the Advanced Communications Technology Satellite (ACTS) System. Two experimental systems, called the low-burst-rate and high-burst-rate systems, along with ACTS ground system features, are described. The network control issues addressed include frame structures, acquisition and synchronization procedures, coordinated station burst-time plan and satellite-time plan changes, on-board clock control based on ground drift measurements, rain fade control by means of adaptive forward-error-correction (FEC) coding and transmit power augmentation, and reassignment of channel capacities on demand. The NASA ground system, which includes a primary station, diversity station, and master control station, is also described.

  11. Configuration of Wireless Cooperative/Sensor Networks

    National Research Council Canada - National Science Library

    Shafiee, Hamid R; Maham, B; Vazifehdan, J

    2008-01-01

    .... When employing more than one antenna at each node of a wireless network is not applicable, cooperation diversity protocols exploit the inherent spatial diversity of relay channels by allowing mobile...

  12. Communication Delays in the Cooperative Control of Wide Area Search Munitions Via Iterative Network Flow

    National Research Council Canada - National Science Library

    Mitchell, Jason

    2003-01-01

    .... This model is used to study the effect of communication delays on the performance of an iteractive network flow optimization model that results in a sequence of linear programs for the optimal...

  13. Accuracy Enhancements for Positioning of Mobile Devices in Wireless Communication Networks

    DEFF Research Database (Denmark)

    Figueiras, Joao

    of the physical length of the communication links. Since these solutions do not require integration of additional hardware into the mobile nodes, they are cheap and simple to implement. As a price to pay, accuracy is typically lower in comparison to dedicated positioning systems. Thus, an important challenge...... communication among users, cooperative positioning strategies aim at localizing devices as a group and not as individuals. In order to reach this goal it is necessary to combine measurements from two domains: device-to-device links and cellular links. Since this combination of information......Positioning of mobile devices in wireless communication networks is nowadays being intensively investigated due to the combined benefit of location information and communication. Typical solutions for such scenario rely on robust algorithms that estimate position from indirect measurements...

  14. Error-correction coding for digital communications

    Science.gov (United States)

    Clark, G. C., Jr.; Cain, J. B.

    This book is written for the design engineer who must build the coding and decoding equipment and for the communication system engineer who must incorporate this equipment into a system. It is also suitable as a senior-level or first-year graduate text for an introductory one-semester course in coding theory. Fundamental concepts of coding are discussed along with group codes, taking into account basic principles, practical constraints, performance computations, coding bounds, generalized parity check codes, polynomial codes, and important classes of group codes. Other topics explored are related to simple nonalgebraic decoding techniques for group codes, soft decision decoding of block codes, algebraic techniques for multiple error correction, the convolutional code structure and Viterbi decoding, syndrome decoding techniques, and sequential decoding techniques. System applications are also considered, giving attention to concatenated codes, coding for the white Gaussian noise channel, interleaver structures for coded systems, and coding for burst noise channels.

  15. Protocol design and analysis for cooperative wireless networks

    CERN Document Server

    Song, Wei; Jin, A-Long

    2017-01-01

    This book focuses on the design and analysis of protocols for cooperative wireless networks, especially at the medium access control (MAC) layer and for crosslayer design between the MAC layer and the physical layer. It highlights two main points that are often neglected in other books: energy-efficiency and spatial random distribution of wireless devices. Effective methods in stochastic geometry for the design and analysis of wireless networks are also explored. After providing a comprehensive review of existing studies in the literature, the authors point out the challenges that are worth further investigation. Then, they introduce several novel solutions for cooperative wireless network protocols that reduce energy consumption and address spatial random distribution of wireless nodes. For each solution, the book offers a clear system model and problem formulation, details of the proposed cooperative schemes, comprehensive performance analysis, and extensive numerical and simulation results that validate th...

  16. Fifth International Conference on Networks & Communications

    CERN Document Server

    Nagamalai, Dhinaharan; Rajasekaran, Sanguthevar

    2014-01-01

    This book covers theory, methodology and applications of computer networks, network protocols and wireless networks, data communication technologies, and network security. The book is based on the proceedings from the Fifth International Conference on Networks & Communications (NetCom). The proceedings will feature peer-reviewed papers that illustrate research results, projects, surveys and industrial experiences that describe significant advances in the diverse areas of computer networks & communications.

  17. Information-Dispersion-Entropy-Based Blind Recognition of Binary BCH Codes in Soft Decision Situations

    Directory of Open Access Journals (Sweden)

    Yimeng Zhang

    2013-05-01

    Full Text Available A method of blind recognition of the coding parameters for binary Bose-Chaudhuri-Hocquenghem (BCH codes is proposed in this paper. We consider an intelligent communication receiver which can blindly recognize the coding parameters of the received data stream. The only knowledge is that the stream is encoded using binary BCH codes, while the coding parameters are unknown. The problem can be addressed on the context of the non-cooperative communications or adaptive coding and modulations (ACM for cognitive radio networks. The recognition processing includes two major procedures: code length estimation and generator polynomial reconstruction. A hard decision method has been proposed in a previous literature. In this paper we propose the recognition approach in soft decision situations with Binary-Phase-Shift-Key modulations and Additive-White-Gaussian-Noise (AWGN channels. The code length is estimated by maximizing the root information dispersion entropy function. And then we search for the code roots to reconstruct the primitive and generator polynomials. By utilizing the soft output of the channel, the recognition performance is improved and the simulations show the efficiency of the proposed algorithm.

  18. 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

  19. Green Communications and Networks : Proceedings of the International Conference on Green Communications and Networks

    CERN Document Server

    Ma, Maode

    2012-01-01

    Green Communications and Networks presents 95 papers chosen for publication from among 190 reviewed papers accepted for presentation to the International Conference on Green Communications and Networks (GCN 2011), held in Chongqing, China, July 15-17, 2011. GCN 2011 provided a venue for leading academic and industrial researchers to exchange their views, ideas and research results on innovative technologies and sustainable solutions leading to greener communications and networks. In addition to paper presentations, the conference featured keynote speakers and a panel discussion. Reflecting the broad scope of the conference, the contents are organized in these topical categories: Communication Systems Data Management and Database System Digital Image Processing Education and Informatics Enabling Technologies Forensics, Recognition Technologies and Applications Fuzzy System and Control Graphics and Visualizing Green Computing Internet Growth Modelling and Virtualized Networks Network Components and Application ...

  20. 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.

  1. For Cooperating Teachers Only: How to Avoid the Communication Gap.

    Science.gov (United States)

    Polivka, John B.

    1979-01-01

    Describes four approaches which cooperating teachers may take in maintaining close communication with student teachers: informal conferences, formal conferences, written comments on lesson plans, and subtle or subliminal communication. Journal availability: see SO 506 831. (AV)

  2. Cooperative multi-user detection and ranging based on pseudo-random codes

    Directory of Open Access Journals (Sweden)

    C. Morhart

    2009-05-01

    Full Text Available We present an improved approach for a Round Trip Time of Flight distance measurement system. The system is intended for the usage in a cooperative localisation system for automotive applications. Therefore, it is designed to address a large number of communication partners per measurement cycle. By using coded signals in a time divison multiple access order, we can detect a large number of pedestrian sensors with just one car sensor. We achieve this by using very short transmit bursts in combination with a real time correlation algorithm. Futhermore, the correlation approach offers real time data, concerning the time of arrival, that can serve as a trigger impulse for other comunication systems. The distance accuracy of the correlation result was further increased by adding a fourier interpolation filter. The system performance was checked with a prototype at 2.4 GHz. We reached a distance measurement accuracy of 12 cm at a range up to 450 m.

  3. Communication in Animal Social Networks

    NARCIS (Netherlands)

    Snijders, Lysanne; Naguib, Marc

    2017-01-01

    Animal social networks and animal communication networks are key disciplines for understanding animal social behavior, yet these disciplines remain poorly integrated. In this review, we show how communication and social networks are inherently linked, with social signals reflecting and affecting

  4. 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.

  5. A network traffic reduction method for cooperative positioning

    NARCIS (Netherlands)

    Das, Kallol; Wymeersch, Henk

    Cooperative positioning is suitable for applications where conventional positioning fails due to lack of connectivity with a sufficient number of reference nodes. In a dense network, as the number of cooperating devices increases, the number of packet exchanges also increases proportionally. This

  6. NCI’s Cooperative Human Tissue Network

    Science.gov (United States)

    Quality biospecimens are a foundational resource for cancer research. One of NCI’s longest running biospecimen programs is the Cooperative Human Tissue Network, a resource mainly for basic discovery and early translational research.

  7. Learning and innovative elements of strategy adoption rules expand cooperative network topologies.

    Science.gov (United States)

    Wang, Shijun; Szalay, Máté S; Zhang, Changshui; Csermely, Peter

    2008-04-09

    Cooperation plays a key role in the evolution of complex systems. However, the level of cooperation extensively varies with the topology of agent networks in the widely used models of repeated games. Here we show that cooperation remains rather stable by applying the reinforcement learning strategy adoption rule, Q-learning on a variety of random, regular, small-word, scale-free and modular network models in repeated, multi-agent Prisoner's Dilemma and Hawk-Dove games. Furthermore, we found that using the above model systems other long-term learning strategy adoption rules also promote cooperation, while introducing a low level of noise (as a model of innovation) to the strategy adoption rules makes the level of cooperation less dependent on the actual network topology. Our results demonstrate that long-term learning and random elements in the strategy adoption rules, when acting together, extend the range of network topologies enabling the development of cooperation at a wider range of costs and temptations. These results suggest that a balanced duo of learning and innovation may help to preserve cooperation during the re-organization of real-world networks, and may play a prominent role in the evolution of self-organizing, complex systems.

  8. NetCooperate: a network-based tool for inferring host-microbe and microbe-microbe cooperation.

    Science.gov (United States)

    Levy, Roie; Carr, Rogan; Kreimer, Anat; Freilich, Shiri; Borenstein, Elhanan

    2015-05-17

    Host-microbe and microbe-microbe interactions are often governed by the complex exchange of metabolites. Such interactions play a key role in determining the way pathogenic and commensal species impact their host and in the assembly of complex microbial communities. Recently, several studies have demonstrated how such interactions are reflected in the organization of the metabolic networks of the interacting species, and introduced various graph theory-based methods to predict host-microbe and microbe-microbe interactions directly from network topology. Using these methods, such studies have revealed evolutionary and ecological processes that shape species interactions and community assembly, highlighting the potential of this reverse-ecology research paradigm. NetCooperate is a web-based tool and a software package for determining host-microbe and microbe-microbe cooperative potential. It specifically calculates two previously developed and validated metrics for species interaction: the Biosynthetic Support Score which quantifies the ability of a host species to supply the nutritional requirements of a parasitic or a commensal species, and the Metabolic Complementarity Index which quantifies the complementarity of a pair of microbial organisms' niches. NetCooperate takes as input a pair of metabolic networks, and returns the pairwise metrics as well as a list of potential syntrophic metabolic compounds. The Biosynthetic Support Score and Metabolic Complementarity Index provide insight into host-microbe and microbe-microbe metabolic interactions. NetCooperate determines these interaction indices from metabolic network topology, and can be used for small- or large-scale analyses. NetCooperate is provided as both a web-based tool and an open-source Python module; both are freely available online at http://elbo.gs.washington.edu/software_netcooperate.html.

  9. A Cooperative Communication System for the Advancement of Safe, Effective, and Efficient Patient Care

    Science.gov (United States)

    2017-02-01

    the Cooperative Communication System (CCS) as an ecologically valid decision and communications support information technology (IT) prototype with...patients or by physician-patient dyads, or on end of life decisions and ethics . Ahmed et al. (2011) contend that the configuration of the standard ICU user...Abstract BACKGROUND: The Cooperative Communication System (CCS) project has developed an ecologically valid decision and communications support

  10. Distributed space-time coding

    CERN Document Server

    Jing, Yindi

    2014-01-01

    Distributed Space-Time Coding (DSTC) is a cooperative relaying scheme that enables high reliability in wireless networks. This brief presents the basic concept of DSTC, its achievable performance, generalizations, code design, and differential use. Recent results on training design and channel estimation for DSTC and the performance of training-based DSTC are also discussed.

  11. Principles of digital communication and coding

    CERN Document Server

    Viterbi, Andrew J

    2009-01-01

    This classic by two digital communications experts is geared toward students of communications theory and to designers of channels, links, terminals, modems, or networks used to transmit and receive digital messages. 1979 edition.

  12. Fiber-wireless convergence in next-generation communication networks systems, architectures, and management

    CERN Document Server

    Chang, Gee-Kung; Ellinas, Georgios

    2017-01-01

    This book investigates new enabling technologies for Fi-Wi convergence. The editors discuss Fi-Wi technologies at the three major network levels involved in the path towards convergence: system level, network architecture level, and network management level. The main topics will be: a. At system level: Radio over Fiber (digitalized vs. analogic, standardization, E-band and beyond) and 5G wireless technologies; b. Network architecture level: NGPON, WDM-PON, BBU Hotelling, Cloud Radio Access Networks (C-RANs), HetNets. c. Network management level: SDN for convergence, Next-generation Point-of-Presence, Wi-Fi LTE Handover, Cooperative MultiPoint. • Addresses the Fi-Wi convergence issues at three different levels, namely at the system level, network architecture level, and network management level • Provides approaches in communication systems, network architecture, and management that are expected to steer the evolution towards fiber-wireless convergence • Contributions from leading experts in the field of...

  13. 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.

  14. Software coding for reliable data communication in a reactor safety system

    International Nuclear Information System (INIS)

    Maghsoodi, R.

    1978-01-01

    A software coding method is proposed to improve the communication reliability of a microprocessor based fast-reactor safety system. This method which replaces the conventional coding circuitry, applies a program to code the data which is communicated between the processors via their data memories. The system requirements are studied and the suitable codes are suggested. The problems associated with hardware coders, and the advantages of software coding methods are discussed. The product code which proves a faster coding time over the cyclic code is chosen as the final code. Then the improvement of the communication reliability is derived for a processor and its data memory. The result is used to calculate the reliability improvement of the processing channel as the basic unit for the safety system. (author)

  15. Visual communication with retinex coding.

    Science.gov (United States)

    Huck, F O; Fales, C L; Davis, R E; Alter-Gartenberg, R

    2000-04-10

    Visual communication with retinex coding seeks to suppress the spatial variation of the irradiance (e.g., shadows) across natural scenes and preserve only the spatial detail and the reflectance (or the lightness) of the surface itself. The separation of reflectance from irradiance begins with nonlinear retinex coding that sharply and clearly enhances edges and preserves their contrast, and it ends with a Wiener filter that restores images from this edge and contrast information. An approximate small-signal model of image gathering with retinex coding is found to consist of the familiar difference-of-Gaussian bandpass filter and a locally adaptive automatic-gain control. A linear representation of this model is used to develop expressions within the small-signal constraint for the information rate and the theoretical minimum data rate of the retinex-coded signal and for the maximum-realizable fidelity of the images restored from this signal. Extensive computations and simulations demonstrate that predictions based on these figures of merit correlate closely with perceptual and measured performance. Hence these predictions can serve as a general guide for the design of visual communication channels that produce images with a visual quality that consistently approaches the best possible sharpness, clarity, and reflectance constancy, even for nonuniform irradiances. The suppression of shadows in the restored image is found to be constrained inherently more by the sharpness of their penumbra than by their depth.

  16. Visual Communication with Retinex Coding

    Science.gov (United States)

    Huck, Friedrich O.; Fales, Carl L.; Davis, Richard E.; Alter-Gartenberg, Rachel

    2000-04-01

    Visual communication with retinex coding seeks to suppress the spatial variation of the irradiance (e.g., shadows) across natural scenes and preserve only the spatial detail and the reflectance (or the lightness) of the surface itself. The separation of reflectance from irradiance begins with nonlinear retinex coding that sharply and clearly enhances edges and preserves their contrast, and it ends with a Wiener filter that restores images from this edge and contrast information. An approximate small-signal model of image gathering with retinex coding is found to consist of the familiar difference-of-Gaussian bandpass filter and a locally adaptive automatic-gain control. A linear representation of this model is used to develop expressions within the small-signal constraint for the information rate and the theoretical minimum data rate of the retinex-coded signal and for the maximum-realizable fidelity of the images restored from this signal. Extensive computations and simulations demonstrate that predictions based on these figures of merit correlate closely with perceptual and measured performance. Hence these predictions can serve as a general guide for the design of visual communication channels that produce images with a visual quality that consistently approaches the best possible sharpness, clarity, and reflectance constancy, even for nonuniform irradiances. The suppression of shadows in the restored image is found to be constrained inherently more by the sharpness of their penumbra than by their depth.

  17. Analysis of Trends in Cooperative Network Patterns for KAERI Researchers

    International Nuclear Information System (INIS)

    Chun, Young Choon; Lee, Hyun Soo

    2016-01-01

    There has been a trend toward faster results of research and accelerating inter-disciplinary convergence, under constraints in available resources. Under such reality, national and international cooperation with inter-sectoral research on science-technology-industry is becoming inevitable as a strategic approach for enhancing competitive edge on global dimension. This study gives an analysis on the cooperative network in nuclear research which bears multi-disciplinary technical feature. The study aims to visualize the cooperative network of KAERI(Korea Atomic Energy Research Institute) researchers, as the hub of the network, including academics and industry, with a view to provide insight on strengthening the cooperative network in nuclear research. This study accounted for the paper entries in SCI(E) in 2013 (538 papers) and 2015 (551 papers) with a view to identify cooperative research activities centered for KAERI. On international cooperation, the analysis showed a trend toward, first of all, diversification of partner countries. There were 118 entries of co-authorship with 22 countries in 2013 (41 with USA, 12 with Japan, 9 with India), which evolved to 121 entries in 2015 (34 for USA, 11 with China, 10 each with Japan and India). Secondly, there was a trend toward more number of countries evenly spread in 2015 compared to 2013, except a few major countries like USA, Japan, and India

  18. Analysis of Trends in Cooperative Network Patterns for KAERI Researchers

    Energy Technology Data Exchange (ETDEWEB)

    Chun, Young Choon; Lee, Hyun Soo [KAERI, Daejeon (Korea, Republic of)

    2016-05-15

    There has been a trend toward faster results of research and accelerating inter-disciplinary convergence, under constraints in available resources. Under such reality, national and international cooperation with inter-sectoral research on science-technology-industry is becoming inevitable as a strategic approach for enhancing competitive edge on global dimension. This study gives an analysis on the cooperative network in nuclear research which bears multi-disciplinary technical feature. The study aims to visualize the cooperative network of KAERI(Korea Atomic Energy Research Institute) researchers, as the hub of the network, including academics and industry, with a view to provide insight on strengthening the cooperative network in nuclear research. This study accounted for the paper entries in SCI(E) in 2013 (538 papers) and 2015 (551 papers) with a view to identify cooperative research activities centered for KAERI. On international cooperation, the analysis showed a trend toward, first of all, diversification of partner countries. There were 118 entries of co-authorship with 22 countries in 2013 (41 with USA, 12 with Japan, 9 with India), which evolved to 121 entries in 2015 (34 for USA, 11 with China, 10 each with Japan and India). Secondly, there was a trend toward more number of countries evenly spread in 2015 compared to 2013, except a few major countries like USA, Japan, and India.

  19. Impact of Social Punishment on Cooperative Behavior in Complex Networks

    Science.gov (United States)

    Wang, Zhen; Xia, Cheng-Yi; Meloni, Sandro; Zhou, Chang-Song; Moreno, Yamir

    2013-10-01

    Social punishment is a mechanism by which cooperative individuals spend part of their resources to penalize defectors. In this paper, we study the evolution of cooperation in 2-person evolutionary games on networks when a mechanism for social punishment is introduced. Specifically, we introduce a new kind of role, punisher, which is aimed at reducing the earnings of defectors by applying to them a social fee. Results from numerical simulations show that different equilibria allowing the three strategies to coexist are possible as well as that social punishment further enhance the robustness of cooperation. Our results are confirmed for different network topologies and two evolutionary games. In addition, we analyze the microscopic mechanisms that give rise to the observed macroscopic behaviors in both homogeneous and heterogeneous networks. Our conclusions might provide additional insights for understanding the roots of cooperation in social systems.

  20. The Practices of Student Network as Cooperative Learning in Ethiopia

    Science.gov (United States)

    Reda, Weldemariam Nigusse; Hagos, Girmay Tsegay

    2015-01-01

    Student network is a teaching strategy introduced as cooperative learning to all educational levels above the upper primary schools (grade 5 and above) in Ethiopia. The study was, therefore, aimed at investigating to what extent the student network in Ethiopia is actually practiced in line with the principles of cooperative learning. Consequently,…

  1. Mechanisms and dynamics of cooperation and competition emergence in complex networked systems

    Science.gov (United States)

    Gianetto, David A.

    Cooperative behavior is a pervasive phenomenon in human interactions and yet how it can evolve and become established, through the selfish process of natural selection, is an enduring puzzle. These behaviors emerge when agents interact in a structured manner; even so, the key structural factors that affect cooperation are not well understood. Moreover, the literature often considers cooperation a single attribute of primitive agents who do not react to environmental changes but real-world actors are more perceptive. The present work moves beyond these assumptions by evolving more realistic game participants, with memories of the past, on complex networks. Agents play repeated games with a three-part Markovian strategy that allows us to separate the cooperation phenomenon into trust, reciprocity, and forgiveness characteristics. Our results show that networks matter most when agents gain the most by acting in a selfish manner, irrespective of how much they may lose by cooperating; since the context provided by neighborhoods inhibits greedy impulses that agents otherwise succumb to in isolation. Network modularity is the most important driver of cooperation emergence in these high-stakes games. However, modularity fails to tell the complete story. Modular scale-free graphs impede cooperation when close coordination is required, partially due to the acyclic nature of scale-free network models. To achieve the highest cooperation in diverse social conditions, both high modularity, low connectivity within modules, and a rich network of long cycles become important. With these findings in hand, we study the influence of networks on coordination and competition within the federal health care insurance exchange. In this applied study, we show that systemic health care coordination is encouraged by the emergent insurance network. The network helps underpin the viability of the exchange and provides an environment of stronger competition once a critical-mass of insurers have

  2. Establishment of International Cooperative Network and Cooperative Research Strategy Between Korea and USA on Nuclear Thermal Hydraulics

    International Nuclear Information System (INIS)

    Baek, Won Pil; Song, Chul Hwa; Jeong, Jae Jun; Choi, Ki Yong; Kang, Kyoung Ho

    2004-07-01

    1. Scope and Objectives of the Project - Successful holding of the NURETH-10 - Analysis of the international trends in technology development and applications for nuclear thermal-hydraulics - Establishment of the international cooperative network and cooperative research strategy between Korea and USA on nuclear thermal-hydraulics 2. Research Results - Successful holding of the NURETH-10 - Analysis of the international trends in technology development and applications for nuclear thermal-hydraulics: - Establishment of international cooperative network and cooperative research strategy focused between Korea and USA on nuclear thermal-hydraulics: 3. Application Plan of the Research Results - Utilization as the basic data/information in establishing the domestic R and D directions and the international cooperative research strategy, - Application of the relevant experiences and data bases of NURETH-10 for holding future international conferences, - Promote more effective and productive research cooperation between Korea and USA

  3. COMMUNICATIVE ASPECTS OF MULTILINGUAL CODE SWITCHING IN COMPUTER-MEDIATED COMMUNICATION

    Directory of Open Access Journals (Sweden)

    Pilar Caparas

    2017-09-01

    Full Text Available The quintessential role of language has been punctiliously studied relative to intercultural communication, cultural heritage, social development, education, identity construction and many more domains. One forum wherein language is investigated is the Computer-mediated Communication (CMC which provides a fertile ground for linguistic and sociolinguistic analyses. The present study aims at investigating the preferred codes used in code switching (CS, functions of CS, and the motives of users for employing CS in CMC. The present study was based on the investigation of 200 status updates and 100 wall posts of 50 Facebook accounts of students who are enrolled in a leading state university in Mindanao and professionals who graduated from the same university. Besides English and Filipino, these Facebook users speak various regional languages such as Chavacano, Cebuano, and Tausug. Their posts were analyzed employing eclectic approaches in analyzing inter-sentential and intra-sentential code switching. The findings reveal that the preferred code in their online communication is Taglish. It implies that Taglish is an equalizer, non-privileging, non-discriminating, and more unifying. The primary reason for CS is because of real lexical need. Besides the given categories, the study determined four other reasons for CS, namely: to express ideas spontaneously, to retain native terminology, to express disappointment, and to promote relationship. The findings vouch for the viability of regional languages to co-exist with English and other languages in the gamut of human interactions in the internet.

  4. 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.

  5. A decomposition approach to analysis of competitive-cooperative neural networks with delay

    International Nuclear Information System (INIS)

    Chu Tianguang; Zhang Zongda; Wang Zhaolin

    2003-01-01

    Competitive-cooperative or inhibitory-excitatory configurations abound in neural networks. It is demonstrated here how such a configuration may be exploited to give a detailed characterization of the fixed point dynamics in general neural networks with time delay. The idea is to divide the connection weights into inhibitory and excitatory types and thereby to embed a competitive-cooperative delay neural network into an augmented cooperative delay system through a symmetric transformation. This allows for the use of the powerful monotone properties of cooperative systems. By the method, we derive several simple necessary and sufficient conditions on guaranteed trapping regions and guaranteed componentwise (exponential) convergence of the neural networks. The results relate specific decay rate and trajectory bounds to system parameters and are therefore of practical significance in designing a network with desired performance

  6. Is Cooperative Memory Special? The Role of Costly Errors, Context, and Social Network Size When Remembering Cooperative Actions

    Directory of Open Access Journals (Sweden)

    Tim Winke

    2017-10-01

    Full Text Available Theoretical studies of cooperative behavior have focused on decision strategies, such as tit-for-tat, that depend on remembering a partner’s last choices. Yet, an empirical study by Stevens et al. (2011 demonstrated that human memory may not meet the requirements that needed to use these strategies. When asked to recall the previous behavior of simulated partners in a cooperative memory task, participants performed poorly, making errors in 10–24% of the trials. However, we do not know the extent to which this task taps specialized cognition for cooperation. It may be possible to engage participants in more cooperative, strategic thinking, which may improve memory. On the other hand, compared with other situations, a cooperative context may already engage improved memory via cheater detection mechanisms. This study investigated the specificity of memory in cooperative contexts by varying (1 the costs of errors in memory by making forgetting defection more costly and (2 whether the recall situation is framed as a cooperative or neutral context. Also, we investigated whether variation in participants’ social network size could account for individual differences observed in memory accuracy. We found that neither including differential costs for misremembering defection nor removing the cooperative context influenced memory accuracy for cooperation. Combined, these results suggest that memory accuracy is robust to differences in the cooperative context: Adding more strategic components does not help accuracy, and removing cooperative components does not hurt accuracy. Social network size, however, did correlate with memory accuracy: People with larger networks remembered the events better. These findings suggest that cooperative memory does not seem to be special compared with other forms of memory, which aligns with previous work demonstrating the domain generality of memory. However, the demands of interacting in a large social network may

  7. Cooperative Secret Sharing Using QR Codes and Symmetric Keys

    Directory of Open Access Journals (Sweden)

    Yang-Wai Chow

    2018-04-01

    Full Text Available Secret sharing is an information security technique where a dealer divides a secret into a collection of shares and distributes these to members of a group. The secret will only be revealed when a predefined number of group members cooperate to recover the secret. The purpose of this study is to investigate a method of distributing shares by embedding them into cover Quick Response (QR codes in a secure manner using cryptographic keys. The advantage of this approach is that the shares can be disseminated over public channels, as anyone who scans the QR codes will only obtain public information. Only authorized individuals who are in possession of the required keys will be able to recover the shares. This also means that when group members cooperate to recover a secret, the group can determine the presence of an illegitimate participant if the person does not produce a valid share. This study proposes a protocol for accomplishing this and discusses the underlying security of the protocol.

  8. An Energy-Efficient Scheme for Multirelay Cooperative Networks with Energy Harvesting

    Directory of Open Access Journals (Sweden)

    Dingcheng Yang

    2016-01-01

    Full Text Available This study investigates an energy-efficient scheme in multirelay cooperative networks with energy harvesting where multiple sessions need to communicate with each other via the relay node. A two-step optimal method is proposed which maximizes the system energy efficiency, while taking into account the receiver circuit energy consumption. Firstly, the optimal power allocation for relay nodes is determined to maximize the system throughput; this is based on directional water-filling algorithm. Secondly, using quantum particle swarm optimization (QPSO, a joint relay node selection and session grouping optimization is proposed. With this algorithm, sessions can be classified into multiple groups that are assisted by the specific relay node with the maximum energy efficiency. This approach leads to a better global optimization in searching ability and efficiency. Simulation results show that the proposed scheme can improve the energy efficiency effectively compared with direct transmission and opportunistic relay-selected cooperative transmission.

  9. Topological Rankings in Communication Networks

    DEFF Research Database (Denmark)

    Aabrandt, Andreas; Hansen, Vagn Lundsgaard; Træholt, Chresten

    2015-01-01

    In the theory of communication the central problem is to study how agents exchange information. This problem may be studied using the theory of connected spaces in topology, since a communication network can be modelled as a topological space such that agents can communicate if and only...... if they belong to the same path connected component of that space. In order to study combinatorial properties of such a communication network, notions from algebraic topology are applied. This makes it possible to determine the shape of a network by concrete invariants, e.g. the number of connected components...

  10. 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.

  11. Network Approach in Political Communication Studies

    Directory of Open Access Journals (Sweden)

    Нина Васильевна Опанасенко

    2013-12-01

    Full Text Available The article is devoted to issues of network approach application in political communication studies. The author considers communication in online and offline areas and gives the definition of rhizome, its characteristics, identifies links between rhizome and network approach. The author also analyses conditions and possibilities of the network approach in modern political communication. Both positive and negative features of the network approach are emphasized.

  12. Ad-hoc networking towards seamless communications

    CERN Document Server

    Gavrilovska, Liljana

    2006-01-01

    Ad-Hoc Networking Towards Seamless Communications is dedicated to an area that attracts growing interest in academia and industry and concentrates on wireless ad hoc networking paradigm. The persistent efforts to acquire the ability to establish dynamic wireless connections from anywhere to anyone with any device without prerequisite imbedded infrastructure move the communications boundaries towards ad-hoc networks. Recently, ad hoc networking has attracted growing interest due to advances in wireless communications, and developed framework for running IP based protocols. The expected degree of penetration of these networks will depend on the successful resolution of the key features. Ad-hoc networks pose many complex and open problems for researchers. Ad-Hoc Networking Towards Seamless Communications reveals the state-of-the-art in wireless ad-hoc networking and discusses some of the key research topics that are expected to promote and accelerate the commercial applications of these networks (e.g., MAC, rout...

  13. CODE CHOICE WITHIN INTERCULTURAL COMMUNICATION AMONG ETHNIC MINORITY IN BRUNEI

    Directory of Open Access Journals (Sweden)

    Fatimah Chuchu

    2015-07-01

    Full Text Available The influences of globalisation and multilingualism have caused linguistic diversity and emergence of interesting and unique sociolinguistic phenomena, for instance, language contact in intercultural communication. As the study of intercultural communication has yet to be studied at large, this research takes the opportunity to embark on a descriptive study of code choice within intercultural communication, relating to the ethnic minorities in Brunei Darussalam. This investigation aims to identify these ethnics’ preferable code choice within intercultural communication, and their needs and motivations practising those codes in a shared multilingual setting. Involving empirical investigation, this study was conducted on 60 native Brunei ethnics in Mukim Ukong, Tutong District. Research found that study involving multilingual settings and intercultural communications are rather relatively complex sociolinguistic phenomena, where speakers would employ different dialects or languages at an episode of communication, but still mutually understood by each other. To some extent, some speakers also accommodate their speech styles or languages to ease communication process between parties. The hegemony of globalisation, local vernacular, speakers’ background and setting are among others influenced the selection of their everyday code choice.

  14. Advances and Challenges in Convergent Communication Networks

    DEFF Research Database (Denmark)

    Toral-Cruz, Homero; Mihovska, Albena

    2017-01-01

    Welcome to this special issue of Wireless Personal Communications on Advances and Challenges in Convergent Communication Networks. The main purpose of this special issue is to present new progresses and challenges in convergent networks. Communication networks play an important role in our daily...... life because they allow communicating and sharing contents between heterogeneous nodes around the globe. The emergence of multiple network architectures and emerging technologies have resulted in new applications and services over a heterogeneous network. This heterogeneous network has undergone...... significant challenges in recent years, such as the evolution to a converged network with the capability to support multiple services, while maintaining a satisfactory level of QoE/QoS, security, efficiency and trust. The special issue on Advances and Challenges in Convergent Communication Networks...

  15. Hybrid optical CDMA-FSO communications network under spatially correlated gamma-gamma scintillation.

    Science.gov (United States)

    Jurado-Navas, Antonio; Raddo, Thiago R; Garrido-Balsells, José María; Borges, Ben-Hur V; Olmos, Juan José Vegas; Monroy, Idelfonso Tafur

    2016-07-25

    In this paper, we propose a new hybrid network solution based on asynchronous optical code-division multiple-access (OCDMA) and free-space optical (FSO) technologies for last-mile access networks, where fiber deployment is impractical. The architecture of the proposed hybrid OCDMA-FSO network is thoroughly described. The users access the network in a fully asynchronous manner by means of assigned fast frequency hopping (FFH)-based codes. In the FSO receiver, an equal gain-combining technique is employed along with intensity modulation and direct detection. New analytical formalisms for evaluating the average bit error rate (ABER) performance are also proposed. These formalisms, based on the spatially correlated gamma-gamma statistical model, are derived considering three distinct scenarios, namely, uncorrelated, totally correlated, and partially correlated channels. Numerical results show that users can successfully achieve error-free ABER levels for the three scenarios considered as long as forward error correction (FEC) algorithms are employed. Therefore, OCDMA-FSO networks can be a prospective alternative to deliver high-speed communication services to access networks with deficient fiber infrastructure.

  16. 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...

  17. Cooperation in memory-based prisoner's dilemma game on interdependent networks

    Science.gov (United States)

    Luo, Chao; Zhang, Xiaolin; Liu, Hong; Shao, Rui

    2016-05-01

    Memory or so-called experience normally plays the important role to guide the human behaviors in real world, that is essential for rational decisions made by individuals. Hence, when the evolutionary behaviors of players with bounded rationality are investigated, it is reasonable to make an assumption that players in system are with limited memory. Besides, in order to unravel the intricate variability of complex systems in real world and make a highly integrative understanding of their dynamics, in recent years, interdependent networks as a comprehensive network structure have obtained more attention in this community. In this article, the evolution of cooperation in memory-based prisoner's dilemma game (PDG) on interdependent networks composed by two coupled square lattices is studied. Herein, all or part of players are endowed with finite memory ability, and we focus on the mutual influence of memory effect and interdependent network reciprocity on cooperation of spatial PDG. We show that the density of cooperation can be significantly promoted within an optimal region of memory length and interdependent strength. Furthermore, distinguished by whether having memory ability/external links or not, each kind of players on networks would have distinct evolutionary behaviors. Our work could be helpful to understand the emergence and maintenance of cooperation under the evolution of memory-based players on interdependent networks.

  18. 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 ...

  19. [Social network analysis of interdisciplinary cooperation and networking in early prevention and intervention. A pilot study].

    Science.gov (United States)

    Künster, A K; Knorr, C; Fegert, J M; Ziegenhain, U

    2010-11-01

    Child protection can only be successfully solved by interdisciplinary cooperation and networking. The individual, heterogeneous, and complex needs of families cannot be met sufficiently by one profession alone. To guarantee efficient interdisciplinary cooperation, there should not be any gaps in the network. In addition, each actor in the network should be placed at an optimal position regarding function, responsibilities, and skills. Actors that serve as allocators, such as pediatricians or youth welfare officers, should be in key player positions within the network. Furthermore, successful child protection is preventive and starts early. Social network analysis is an adequate technique to assess network structures and to plan interventions to improve networking. In addition, it is very useful to evaluate the effectiveness of interventions like round tables. We present data from our pilot project which was part of "Guter Start ins Kinderleben" ("a good start into a child's life"). Exemplary network data from one community show that networking is already quite effective with a satisfactory mean density throughout the network. There is potential for improvement in cooperation, especially at the interface between the child welfare and health systems.

  20. 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.

  1. Multiple effect of social influence on cooperation in interdependent network games

    Science.gov (United States)

    Jiang, Luo-Luo; Li, Wen-Jing; Wang, Zhen

    2015-10-01

    The social influence exists widely in the human society, where individual decision-making process (from congressional election to electronic commerce) may be affected by the attitude and behavior of others belonging to different social networks. Here, we couple the snowdrift (SD) game and the prisoner’s dilemma (PD) game on two interdependent networks, where strategies in both games are associated by social influence to mimick the majority rule. More accurately, individuals’ strategies updating refers to social learning (based on payoff difference) and above-mentioned social influence (related with environment of interdependent group), which is controlled by social influence strength s. Setting s = 0 decouples the networks and returns the traditional network game; while its increase involves the interactions between networks. By means of numerous Monte Carlo simulations, we find that such a mechanism brings multiple influence to the evolution of cooperation. Small s leads to unequal cooperation level in both games, because social learning is still the main updating rule for most players. Though intermediate and large s guarantees the synchronized evolution of strategy pairs, cooperation finally dies out and reaches a completely dominance in both cases. Interestingly, these observations are attributed to the expansion of cooperation clusters. Our work may provide a new understanding to the emergence of cooperation in intercorrelated social systems.

  2. Mesoscopic structure conditions the emergence of cooperation on social networks.

    Directory of Open Access Journals (Sweden)

    Sergi Lozano

    Full Text Available BACKGROUND: We study the evolutionary Prisoner's Dilemma on two social networks substrates obtained from actual relational data. METHODOLOGY/PRINCIPAL FINDINGS: We find very different cooperation levels on each of them that cannot be easily understood in terms of global statistical properties of both networks. We claim that the result can be understood at the mesoscopic scale, by studying the community structure of the networks. We explain the dependence of the cooperation level on the temptation parameter in terms of the internal structure of the communities and their interconnections. We then test our results on community-structured, specifically designed artificial networks, finding a good agreement with the observations in both real substrates. CONCLUSION: Our results support the conclusion that studies of evolutionary games on model networks and their interpretation in terms of global properties may not be sufficient to study specific, real social systems. Further, the study allows us to define new quantitative parameters that summarize the mesoscopic structure of any network. In addition, the community perspective may be helpful to interpret the origin and behavior of existing networks as well as to design structures that show resilient cooperative behavior.

  3. Mesoscopic structure conditions the emergence of cooperation on social networks

    Energy Technology Data Exchange (ETDEWEB)

    Lozano, S.; Arenas, A.; Sanchez, A.

    2008-12-01

    We study the evolutionary Prisoner's Dilemma on two social networks substrates obtained from actual relational data. We find very different cooperation levels on each of them that cannot be easily understood in terms of global statistical properties of both networks. We claim that the result can be understood at the mesoscopic scale, by studying the community structure of the networks. We explain the dependence of the cooperation level on the temptation parameter in terms of the internal structure of the communities and their interconnections. We then test our results on community-structured, specifically designed artificial networks, finding a good agreement with the observations in both real substrates. Our results support the conclusion that studies of evolutionary games on model networks and their interpretation in terms of global properties may not be sufficient to study specific, real social systems. Further, the study allows us to define new quantitative parameters that summarize the mesoscopic structure of any network. In addition, the community perspective may be helpful to interpret the origin and behavior of existing networks as well as to design structures that show resilient cooperative behavior.

  4. Establishment of a Nuclear Cooperation Network between Korea and Brazil

    Energy Technology Data Exchange (ETDEWEB)

    Kim, Kyoung Pyo; Sohn, Dong Seong; Song, Kee Chan (and others)

    2008-03-15

    The objective of this study is to establish a personnel network and to identify potential complementary areas for technical cooperation in the future to advance Korean-Brazilian nuclear cooperation activities. To this end, current status of the cooperation in the areas of economy, energy resources and S and T between the two countries was surveyed, and the history of the nuclear development program and the current nuclear R and D status in Brazil, as well as the bilateral nuclear cooperation activities of both countries were analyzed. In addition, areas of mutual interest were identified by both countries' focal points and a personnel network was established. Based on the aforementioned preliminary activities, bilateral joint seminars were held in Brazil. At the joint seminars, possible areas of cooperation were discussed and joint research collaboration areas were surveyed and identified while both sides made efforts to expand the information and experts exchanges in specific areas. Through this study, possible specific areas of cooperation in which both sides have a common interest were identified in such areas as radiation technology application, post irradiation examination, radioactive waste management, I and C, and advanced nuclear fuel, and also concrete implementation methods were proposed. These results will be effectively utilized in establishing a basic direction for expanding bilateral nuclear cooperation activities in the future. Consistent establishment of a foundation for promoting cooperation could be established and maintained through the operation of a focal point in charge of coordinating bilateral technical cooperation, and then a long-term and stable human network could be established.

  5. Establishment of a Nuclear Cooperation Network between Korea and Brazil

    International Nuclear Information System (INIS)

    Kim, Kyoung Pyo; Sohn, Dong Seong; Song, Kee Chan

    2008-03-01

    The objective of this study is to establish a personnel network and to identify potential complementary areas for technical cooperation in the future to advance Korean-Brazilian nuclear cooperation activities. To this end, current status of the cooperation in the areas of economy, energy resources and S and T between the two countries was surveyed, and the history of the nuclear development program and the current nuclear R and D status in Brazil, as well as the bilateral nuclear cooperation activities of both countries were analyzed. In addition, areas of mutual interest were identified by both countries' focal points and a personnel network was established. Based on the aforementioned preliminary activities, bilateral joint seminars were held in Brazil. At the joint seminars, possible areas of cooperation were discussed and joint research collaboration areas were surveyed and identified while both sides made efforts to expand the information and experts exchanges in specific areas. Through this study, possible specific areas of cooperation in which both sides have a common interest were identified in such areas as radiation technology application, post irradiation examination, radioactive waste management, I and C, and advanced nuclear fuel, and also concrete implementation methods were proposed. These results will be effectively utilized in establishing a basic direction for expanding bilateral nuclear cooperation activities in the future. Consistent establishment of a foundation for promoting cooperation could be established and maintained through the operation of a focal point in charge of coordinating bilateral technical cooperation, and then a long-term and stable human network could be established

  6. 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....

  7. Network Restoration for Next-Generation Communication and Computing Networks

    Directory of Open Access Journals (Sweden)

    B. S. Awoyemi

    2018-01-01

    Full Text Available Network failures are undesirable but inevitable occurrences for most modern communication and computing networks. A good network design must be robust enough to handle sudden failures, maintain traffic flow, and restore failed parts of the network within a permissible time frame, at the lowest cost achievable and with as little extra complexity in the network as possible. Emerging next-generation (xG communication and computing networks such as fifth-generation networks, software-defined networks, and internet-of-things networks have promises of fast speeds, impressive data rates, and remarkable reliability. To achieve these promises, these complex and dynamic xG networks must be built with low failure possibilities, high network restoration capacity, and quick failure recovery capabilities. Hence, improved network restoration models have to be developed and incorporated in their design. In this paper, a comprehensive study on network restoration mechanisms that are being developed for addressing network failures in current and emerging xG networks is carried out. Open-ended problems are identified, while invaluable ideas for better adaptation of network restoration to evolving xG communication and computing paradigms are discussed.

  8. Recent advances in coding theory for near error-free communications

    Science.gov (United States)

    Cheung, K.-M.; Deutsch, L. J.; Dolinar, S. J.; Mceliece, R. J.; Pollara, F.; Shahshahani, M.; Swanson, L.

    1991-01-01

    Channel and source coding theories are discussed. The following subject areas are covered: large constraint length convolutional codes (the Galileo code); decoder design (the big Viterbi decoder); Voyager's and Galileo's data compression scheme; current research in data compression for images; neural networks for soft decoding; neural networks for source decoding; finite-state codes; and fractals for data compression.

  9. 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.

  10. New Channel Coding Methods for Satellite Communication

    Directory of Open Access Journals (Sweden)

    J. Sebesta

    2010-04-01

    Full Text Available This paper deals with the new progressive channel coding methods for short message transmission via satellite transponder using predetermined length of frame. The key benefits of this contribution are modification and implementation of a new turbo code and utilization of unique features with applications of methods for bit error rate estimation and algorithm for output message reconstruction. The mentioned methods allow an error free communication with very low Eb/N0 ratio and they have been adopted for satellite communication, however they can be applied for other systems working with very low Eb/N0 ratio.

  11. Optimal interdependence between networks for the evolution of cooperation.

    Science.gov (United States)

    Wang, Zhen; Szolnoki, Attila; Perc, Matjaž

    2013-01-01

    Recent research has identified interactions between networks as crucial for the outcome of evolutionary games taking place on them. While the consensus is that interdependence does promote cooperation by means of organizational complexity and enhanced reciprocity that is out of reach on isolated networks, we here address the question just how much interdependence there should be. Intuitively, one might assume the more the better. However, we show that in fact only an intermediate density of sufficiently strong interactions between networks warrants an optimal resolution of social dilemmas. This is due to an intricate interplay between the heterogeneity that causes an asymmetric strategy flow because of the additional links between the networks, and the independent formation of cooperative patterns on each individual network. Presented results are robust to variations of the strategy updating rule, the topology of interdependent networks, and the governing social dilemma, thus suggesting a high degree of universality.

  12. Networked control of discrete-time linear systems over lossy digital communication channels

    Science.gov (United States)

    Jin, Fang; Zhao, Guang-Rong; Liu, Qing-Quan

    2013-12-01

    This article addresses networked control problems for linear time-invariant systems. The insertion of the digital communication network inevitably leads to packet dropout, time delay and quantisation error. Due to data rate limitations, quantisation error is not neglected. In particular, the case where the sensors and controllers are geographically separated and connected via noisy, bandwidth-limited digital communication channels is considered. A fundamental limitation on the data rate of the channel for mean-square stabilisation of the closed-loop system is established. Sufficient conditions for mean-square stabilisation are derived. It is shown that there exists a quantisation, coding and control scheme to stabilise the unstable system over packet dropout communication channels if the data rate is larger than the lower bound proposed in our result. An illustrative example is given to demonstrate the effectiveness of the proposed conditions.

  13. Capacity of Wireless Ad Hoc Networks with Opportunistic Collaborative Communications

    Directory of Open Access Journals (Sweden)

    Simeone O

    2007-01-01

    Full Text Available Optimal multihop routing in ad hoc networks requires the exchange of control messages at the MAC and network layer in order to set up the (centralized optimization problem. Distributed opportunistic space-time collaboration (OST is a valid alternative that avoids this drawback by enabling opportunistic cooperation with the source at the physical layer. In this paper, the performance of OST is investigated. It is shown analytically that opportunistic collaboration outperforms (centralized optimal multihop in case spatial reuse (i.e., the simultaneous transmission of more than one data stream is not allowed by the transmission protocol. Conversely, in case spatial reuse is possible, the relative performance between the two protocols has to be studied case by case in terms of the corresponding capacity regions, given the topology and the physical parameters of network at hand. Simulation results confirm that opportunistic collaborative communication is a promising paradigm for wireless ad hoc networks that deserves further investigation.

  14. Capacity of Wireless Ad Hoc Networks with Opportunistic Collaborative Communications

    Directory of Open Access Journals (Sweden)

    O. Simeone

    2007-03-01

    Full Text Available Optimal multihop routing in ad hoc networks requires the exchange of control messages at the MAC and network layer in order to set up the (centralized optimization problem. Distributed opportunistic space-time collaboration (OST is a valid alternative that avoids this drawback by enabling opportunistic cooperation with the source at the physical layer. In this paper, the performance of OST is investigated. It is shown analytically that opportunistic collaboration outperforms (centralized optimal multihop in case spatial reuse (i.e., the simultaneous transmission of more than one data stream is not allowed by the transmission protocol. Conversely, in case spatial reuse is possible, the relative performance between the two protocols has to be studied case by case in terms of the corresponding capacity regions, given the topology and the physical parameters of network at hand. Simulation results confirm that opportunistic collaborative communication is a promising paradigm for wireless ad hoc networks that deserves further investigation.

  15. LDPC-PPM Coding Scheme for Optical Communication

    Science.gov (United States)

    Barsoum, Maged; Moision, Bruce; Divsalar, Dariush; Fitz, Michael

    2009-01-01

    In a proposed coding-and-modulation/demodulation-and-decoding scheme for a free-space optical communication system, an error-correcting code of the low-density parity-check (LDPC) type would be concatenated with a modulation code that consists of a mapping of bits to pulse-position-modulation (PPM) symbols. Hence, the scheme is denoted LDPC-PPM. This scheme could be considered a competitor of a related prior scheme in which an outer convolutional error-correcting code is concatenated with an interleaving operation, a bit-accumulation operation, and a PPM inner code. Both the prior and present schemes can be characterized as serially concatenated pulse-position modulation (SCPPM) coding schemes. Figure 1 represents a free-space optical communication system based on either the present LDPC-PPM scheme or the prior SCPPM scheme. At the transmitting terminal, the original data (u) are processed by an encoder into blocks of bits (a), and the encoded data are mapped to PPM of an optical signal (c). For the purpose of design and analysis, the optical channel in which the PPM signal propagates is modeled as a Poisson point process. At the receiving terminal, the arriving optical signal (y) is demodulated to obtain an estimate (a^) of the coded data, which is then processed by a decoder to obtain an estimate (u^) of the original data.

  16. A simple model of bipartite cooperation for ecological and organizational networks.

    Science.gov (United States)

    Saavedra, Serguei; Reed-Tsochas, Felix; Uzzi, Brian

    2009-01-22

    In theoretical ecology, simple stochastic models that satisfy two basic conditions about the distribution of niche values and feeding ranges have proved successful in reproducing the overall structural properties of real food webs, using species richness and connectance as the only input parameters. Recently, more detailed models have incorporated higher levels of constraint in order to reproduce the actual links observed in real food webs. Here, building on previous stochastic models of consumer-resource interactions between species, we propose a highly parsimonious model that can reproduce the overall bipartite structure of cooperative partner-partner interactions, as exemplified by plant-animal mutualistic networks. Our stochastic model of bipartite cooperation uses simple specialization and interaction rules, and only requires three empirical input parameters. We test the bipartite cooperation model on ten large pollination data sets that have been compiled in the literature, and find that it successfully replicates the degree distribution, nestedness and modularity of the empirical networks. These properties are regarded as key to understanding cooperation in mutualistic networks. We also apply our model to an extensive data set of two classes of company engaged in joint production in the garment industry. Using the same metrics, we find that the network of manufacturer-contractor interactions exhibits similar structural patterns to plant-animal pollination networks. This surprising correspondence between ecological and organizational networks suggests that the simple rules of cooperation that generate bipartite networks may be generic, and could prove relevant in many different domains, ranging from biological systems to human society.

  17. Efficient data communication protocols for wireless networks

    Science.gov (United States)

    Zeydan, Engin

    In this dissertation, efficient decentralized algorithms are investigated for cost minimization problems in wireless networks. For wireless sensor networks, we investigate both the reduction in the energy consumption and throughput maximization problems separately using multi-hop data aggregation for correlated data in wireless sensor networks. The proposed algorithms exploit data redundancy using a game theoretic framework. For energy minimization, routes are chosen to minimize the total energy expended by the network using best response dynamics to local data. The cost function used in routing takes into account distance, interference and in-network data aggregation. The proposed energy-efficient correlation-aware routing algorithm significantly reduces the energy consumption in the network and converges in a finite number of steps iteratively. For throughput maximization, we consider both the interference distribution across the network and correlation between forwarded data when establishing routes. Nodes along each route are chosen to minimize the interference impact in their neighborhood and to maximize the in-network data aggregation. The resulting network topology maximizes the global network throughput and the algorithm is guaranteed to converge with a finite number of steps using best response dynamics. For multiple antenna wireless ad-hoc networks, we present distributed cooperative and regret-matching based learning schemes for joint transmit beanformer and power level selection problem for nodes operating in multi-user interference environment. Total network transmit power is minimized while ensuring a constant received signal-to-interference and noise ratio at each receiver. In cooperative and regret-matching based power minimization algorithms, transmit beanformers are selected from a predefined codebook to minimize the total power. By selecting transmit beamformers judiciously and performing power adaptation, the cooperative algorithm is shown to

  18. Cooperation and communication challenges in small-scale eHealth development projects.

    Science.gov (United States)

    Petersen, Lone Stub; Bertelsen, Pernille; Bjørnes, Charlotte

    2013-12-01

    In eHealth development there is an increasing focus on user participation inspired by the information systems field of practice and research. There are, however, many other challenges in developing information systems that fit healthcare practices. One of these is the challenge of cooperation and communication in development projects that are initiated and managed by clinicians e.g. cooperating with IT professionals in 'bottom up' health informatics projects that have been initiated and are managed by healthcare professional project managers. The analysis and results are drawn from a qualitative case study on a systems development project that was managed by a local, non-technical, healthcare professional and the complex blend and interactions with the IT professionals in the phases of ideas, design, development, implementation, maintenance and distribution. We analyze the challenges of cooperation and communication using perspectives from information systems research and the concepts of 'language-games' and 'shared design spaces', and thereby exploring the boundaries between the different communication, practice and culture of the IT professionals and the healthcare professionals. There is a need to (a) develop a better understanding of the development process from the point of view of the 'user' and (b) tools for making technical knowledge explicit in the development process. Cooperative and communicative methods are needed that support and develop the shared design spaces between IT professionals and the clinical context in order to strengthen small-scale health information systems projects. Copyright © 2013 Elsevier Ireland Ltd. All rights reserved.

  19. Optimization of potential field method parameters through networks for swarm cooperative manipulation tasks

    Directory of Open Access Journals (Sweden)

    Rocco Furferi

    2016-10-01

    Full Text Available An interesting current research field related to autonomous robots is mobile manipulation performed by cooperating robots (in terrestrial, aerial and underwater environments. Focusing on the underwater scenario, cooperative manipulation of Intervention-Autonomous Underwater Vehicles (I-AUVs is a complex and difficult application compared with the terrestrial or aerial ones because of many technical issues, such as underwater localization and limited communication. A decentralized approach for cooperative mobile manipulation of I-AUVs based on Artificial Neural Networks (ANNs is proposed in this article. This strategy exploits the potential field method; a multi-layer control structure is developed to manage the coordination of the swarm, the guidance and navigation of I-AUVs and the manipulation task. In the article, this new strategy has been implemented in the simulation environment, simulating the transportation of an object. This object is moved along a desired trajectory in an unknown environment and it is transported by four underwater mobile robots, each one provided with a seven-degrees-of-freedom robotic arm. The simulation results are optimized thanks to the ANNs used for the potentials tuning.

  20. Towards an International Code for administrative cooperation in tax matter and international tax governance

    Directory of Open Access Journals (Sweden)

    Eva Andrés Aucejo

    2017-12-01

    Full Text Available There is not a “Global Code” that encodes the duty of cooperation between tax authorities in the world, concerning the global tax system. This article addresses this issue by proposing a global Code of administrative cooperation in tax matters including both tax relations: between States, and between States, taxpayers and intermediary’s agents. It follows a wide concept of tax governance. The findings of this research have highlighted several practical applications for future practice. article analyses, firstly, the State of the question, starting with the legal sources (international and European sources of hard law and soft law reviewing the differences with the Code as here proposed. It also examines some important Agents who emit relevant normative in international administrative tax cooperation and the role that these agents are developing nowadays (sometimes international organizations but also States like the United States, which Congress enacted the Foreign Account Tax Compliance Act, FATCA. Overlapping and gaps between different regulations are underlined. Finally, the consequences of this “General Code” lack for the functioning of a good international governance, are described. Hence, the need to create an International Cooperation Code on tax matters and international fiscal governance is concluded. That Code could be proposed by any International Organization as the World Bank nature, for instance, or the International Monetary Fund or whichever International or European Organization. This instrument could be documented through a multilateral instrument (soft law, to be signed by the States to become an international legal source (hard law. Filling this Code as Articulated Text (form could be very useful for the International Community towards an International Tax Governance.

  1. MIMO Communication for Cellular Networks

    CERN Document Server

    Huang, Howard; Venkatesan, Sivarama

    2012-01-01

    As the theoretical foundations of multiple-antenna techniques evolve and as these multiple-input multiple-output (MIMO) techniques become essential for providing high data rates in wireless systems, there is a growing need to understand the performance limits of MIMO in practical networks. To address this need, MIMO Communication for Cellular Networks presents a systematic description of MIMO technology classes and a framework for MIMO system design that takes into account the essential physical-layer features of practical cellular networks. In contrast to works that focus on the theoretical performance of abstract MIMO channels, MIMO Communication for Cellular Networks emphasizes the practical performance of realistic MIMO systems. A unified set of system simulation results highlights relative performance gains of different MIMO techniques and provides insights into how best to use multiple antennas in cellular networks under various conditions. MIMO Communication for Cellular Networks describes single-user,...

  2. Emergence of super cooperation of prisoner's dilemma games on scale-free networks.

    Directory of Open Access Journals (Sweden)

    Angsheng Li

    Full Text Available Recently, the authors proposed a quantum prisoner's dilemma game based on the spatial game of Nowak and May, and showed that the game can be played classically. By using this idea, we proposed three generalized prisoner's dilemma (GPD, for short games based on the weak Prisoner's dilemma game, the full prisoner's dilemma game and the normalized Prisoner's dilemma game, written by GPDW, GPDF and GPDN respectively. Our games consist of two players, each of which has three strategies: cooperator (C, defector (D and super cooperator (denoted by Q, and have a parameter γ to measure the entangled relationship between the two players. We found that our generalised prisoner's dilemma games have new Nash equilibrium principles, that entanglement is the principle of emergence and convergence (i.e., guaranteed emergence of super cooperation in evolutions of our generalised prisoner's dilemma games on scale-free networks, that entanglement provides a threshold for a phase transition of super cooperation in evolutions of our generalised prisoner's dilemma games on scale-free networks, that the role of heterogeneity of the scale-free networks in cooperations and super cooperations is very limited, and that well-defined structures of scale-free networks allow coexistence of cooperators and super cooperators in the evolutions of the weak version of our generalised prisoner's dilemma games.

  3. Coding and decoding for code division multiple user communication systems

    Science.gov (United States)

    Healy, T. J.

    1985-01-01

    A new algorithm is introduced which decodes code division multiple user communication signals. The algorithm makes use of the distinctive form or pattern of each signal to separate it from the composite signal created by the multiple users. Although the algorithm is presented in terms of frequency-hopped signals, the actual transmitter modulator can use any of the existing digital modulation techniques. The algorithm is applicable to error-free codes or to codes where controlled interference is permitted. It can be used when block synchronization is assumed, and in some cases when it is not. The paper also discusses briefly some of the codes which can be used in connection with the algorithm, and relates the algorithm to past studies which use other approaches to the same problem.

  4. Stereo-vision-based cooperative-vehicle positioning using OCC and neural networks

    Science.gov (United States)

    Ifthekhar, Md. Shareef; Saha, Nirzhar; Jang, Yeong Min

    2015-10-01

    Vehicle positioning has been subjected to extensive research regarding driving safety measures and assistance as well as autonomous navigation. The most common positioning technique used in automotive positioning is the global positioning system (GPS). However, GPS is not reliably accurate because of signal blockage caused by high-rise buildings. In addition, GPS is error prone when a vehicle is inside a tunnel. Moreover, GPS and other radio-frequency-based approaches cannot provide orientation information or the position of neighboring vehicles. In this study, we propose a cooperative-vehicle positioning (CVP) technique by using the newly developed optical camera communications (OCC). The OCC technique utilizes image sensors and cameras to receive and decode light-modulated information from light-emitting diodes (LEDs). A vehicle equipped with an OCC transceiver can receive positioning and other information such as speed, lane change, driver's condition, etc., through optical wireless links of neighboring vehicles. Thus, the target vehicle position that is too far away to establish an OCC link can be determined by a computer-vision-based technique combined with the cooperation of neighboring vehicles. In addition, we have devised a back-propagation (BP) neural-network learning method for positioning and range estimation for CVP. The proposed neural-network-based technique can estimate target vehicle position from only two image points of target vehicles using stereo vision. For this, we use rear LEDs on target vehicles as image points. We show from simulation results that our neural-network-based method achieves better accuracy than that of the computer-vision method.

  5. 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.

  6. Performance Analysis of New Binary User Codes for DS-CDMA Communication

    Science.gov (United States)

    Usha, Kamle; Jaya Sankar, Kottareddygari

    2016-03-01

    This paper analyzes new binary spreading codes through correlation properties and also presents their performance over additive white Gaussian noise (AWGN) channel. The proposed codes are constructed using gray and inverse gray codes. In this paper, a n-bit gray code appended by its n-bit inverse gray code to construct the 2n-length binary user codes are discussed. Like Walsh codes, these binary user codes are available in sizes of power of two and additionally code sets of length 6 and their even multiples are also available. The simple construction technique and generation of code sets of different sizes are the salient features of the proposed codes. Walsh codes and gold codes are considered for comparison in this paper as these are popularly used for synchronous and asynchronous multi user communications respectively. In the current work the auto and cross correlation properties of the proposed codes are compared with those of Walsh codes and gold codes. Performance of the proposed binary user codes for both synchronous and asynchronous direct sequence CDMA communication over AWGN channel is also discussed in this paper. The proposed binary user codes are found to be suitable for both synchronous and asynchronous DS-CDMA communication.

  7. Quantum secure direct communication with high-dimension quantum superdense coding

    International Nuclear Information System (INIS)

    Wang Chuan; Li Yansong; Liu Xiaoshu; Deng Fuguo; Long Guilu

    2005-01-01

    A protocol for quantum secure direct communication with quantum superdense coding is proposed. It combines the ideas of block transmission, the ping-pong quantum secure direct communication protocol, and quantum superdense coding. It has the advantage of being secure and of high source capacity

  8. 10Gbps 2D MGC OCDMA Code over FSO Communication System

    Science.gov (United States)

    Professor Urmila Bhanja, Associate, Dr.; Khuntia, Arpita; Alamasety Swati, (Student

    2017-08-01

    Currently, wide bandwidth signal dissemination along with low latency is a leading requisite in various applications. Free space optical wireless communication has introduced as a realistic technology for bridging the gap in present high data transmission fiber connectivity and as a provisional backbone for rapidly deployable wireless communication infrastructure. The manuscript highlights on the implementation of 10Gbps SAC-OCDMA FSO communications using modified two dimensional Golomb code (2D MGC) that possesses better auto correlation, minimum cross correlation and high cardinality. A comparison based on pseudo orthogonal (PSO) matrix code and modified two dimensional Golomb code (2D MGC) is developed in the proposed SAC OCDMA-FSO communication module taking different parameters into account. The simulative outcome signifies that the communication radius is bounded by the multiple access interference (MAI). In this work, a comparison is made in terms of bit error rate (BER), and quality factor (Q) based on modified two dimensional Golomb code (2D MGC) and PSO matrix code. It is observed that the 2D MGC yields better results compared to the PSO matrix code. The simulation results are validated using optisystem version 14.

  9. 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

  10. Implementability of two-qubit unitary operations over the butterfly network and the ladder network with free classical communication

    Energy Technology Data Exchange (ETDEWEB)

    Akibue, Seiseki [Department of Physics, Graduate School of Science, The University of Tokyo, Tokyo (Japan); Murao, Mio [Department of Physics, Graduate School of Science, The University of Tokyo, Tokyo, Japan and NanoQuine, The University of Tokyo, Tokyo (Japan)

    2014-12-04

    We investigate distributed implementation of two-qubit unitary operations over two primitive networks, the butterfly network and the ladder network, as a first step to apply network coding for quantum computation. By classifying two-qubit unitary operations in terms of the Kraus-Cirac number, the number of non-zero parameters describing the global part of two-qubit unitary operations, we analyze which class of two-qubit unitary operations is implementable over these networks with free classical communication. For the butterfly network, we show that two classes of two-qubit unitary operations, which contain all Clifford, controlled-unitary and matchgate operations, are implementable over the network. For the ladder network, we show that two-qubit unitary operations are implementable over the network if and only if their Kraus-Cirac number do not exceed the number of the bridges of the ladder.

  11. Implementability of two-qubit unitary operations over the butterfly network and the ladder network with free classical communication

    International Nuclear Information System (INIS)

    Akibue, Seiseki; Murao, Mio

    2014-01-01

    We investigate distributed implementation of two-qubit unitary operations over two primitive networks, the butterfly network and the ladder network, as a first step to apply network coding for quantum computation. By classifying two-qubit unitary operations in terms of the Kraus-Cirac number, the number of non-zero parameters describing the global part of two-qubit unitary operations, we analyze which class of two-qubit unitary operations is implementable over these networks with free classical communication. For the butterfly network, we show that two classes of two-qubit unitary operations, which contain all Clifford, controlled-unitary and matchgate operations, are implementable over the network. For the ladder network, we show that two-qubit unitary operations are implementable over the network if and only if their Kraus-Cirac number do not exceed the number of the bridges of the ladder

  12. Delay efficient cooperation in public safety vehicular networks using LTE and IEEE 802.11p

    KAUST Repository

    Atat, Rachad

    2012-01-01

    Cooperative schemes for critical content distribution over vehicular networks are presented and analyzed. The first scheme is based on unicasting from the base station, whereas the second is based on threshold based multicasting. Long Term Evolution (LTE) is used for long range communications with the base station (BS) and 802.11p is considered for inter-vehicle collaboration on the short range. A high mobility environment with correlated shadowing is adopted. Both schemes are shown to outperform non-cooperative unicasting and multicasting, respectively, when the appropriate 802.11p power class is used. The first scheme achieves the best performance among the compared methods, and a practical approximation of that scheme is shown to be close to optimal performance. © 2012 IEEE.

  13. Robustness of cooperation in the evolutionary prisoner's dilemma on complex networks

    International Nuclear Information System (INIS)

    Poncela, J; Gomez-Gardenes, J; FlorIa, L M; Moreno, Y

    2007-01-01

    Recent studies on the evolutionary dynamics of the prisoner's dilemma game in scale-free networks have demonstrated that the heterogeneity of the network interconnections enhances the evolutionary success of cooperation. In this paper we address the issue of how the characterization of the asymptotic states of the evolutionary dynamics depends on the initial concentration of cooperators. We find that the measure and the connectedness properties of the set of nodes where cooperation reaches fixation is largely independent of initial conditions, in contrast with the behaviour of both the set of nodes where defection is fixed, and the fluctuating nodes. We also check for the robustness of these results when varying the degree heterogeneity along a one-parametric family of networks interpolating between the class of Erdos-Renyi graphs and the Barabasi-Albert networks

  14. SISL and SIRL: Two knowledge dissemination models with leader nodes on cooperative learning networks

    Science.gov (United States)

    Li, Jingjing; Zhang, Yumei; Man, Jiayu; Zhou, Yun; Wu, Xiaojun

    2017-02-01

    Cooperative learning is one of the most effective teaching methods, which has been widely used. Students' mutual contact forms a cooperative learning network in this process. Our previous research demonstrated that the cooperative learning network has complex characteristics. This study aims to investigating the dynamic spreading process of the knowledge in the cooperative learning network and the inspiration of leaders in this process. To this end, complex network transmission dynamics theory is utilized to construct the knowledge dissemination model of a cooperative learning network. Based on the existing epidemic models, we propose a new susceptible-infected-susceptible-leader (SISL) model that considers both students' forgetting and leaders' inspiration, and a susceptible-infected-removed-leader (SIRL) model that considers students' interest in spreading and leaders' inspiration. The spreading threshold λcand its impact factors are analyzed. Then, numerical simulation and analysis are delivered to reveal the dynamic transmission mechanism of knowledge and leaders' role. This work is of great significance to cooperative learning theory and teaching practice. It also enriches the theory of complex network transmission dynamics.

  15. Game-theoretic cooperativity in networks of self-interested units

    Science.gov (United States)

    Barto, Andrew G.

    1986-08-01

    The behavior of theoretical neural networks is often described in terms of competition and cooperation. I present an approach to network learning that is related to game and team problems in which competition and cooperation have more technical meanings. I briefly describe the application of stochastic learning automata to game and team problems and then present an adaptive element that is a synthesis of aspects of stochastic learning automata and typical neuron-like adaptive elements. These elements act as self-interested agents that work toward improving their performance with respect to their individual preference orderings. Networks of these elements can solve a variety of team decision problems, some of which take the form of layered networks in which the ``hidden units'' become appropriate functional components as they attempt to improve their own payoffs.

  16. Communication and Networking in Smart Grids

    CERN Document Server

    Xiao, Yang

    2012-01-01

    Appropriate for researchers, practitioners, and students alike, Communication and Networking in Smart Grids presents state-of-the-art approaches and novel technologies for communication networks in smart grids. It explains how contemporary grid networks are developed and deployed and presents a collection of cutting-edge advances to help improve current practice. Prominent researchers working on smart grids and in related fields around the world explain the fundamental aspects and applications of smart grids. Describing the role that communication and networking will play in future smart grids

  17. Fast QC-LDPC code for free space optical communication

    Science.gov (United States)

    Wang, Jin; Zhang, Qi; Udeh, Chinonso Paschal; Wu, Rangzhong

    2017-02-01

    Free Space Optical (FSO) Communication systems use the atmosphere as a propagation medium. Hence the atmospheric turbulence effects lead to multiplicative noise related with signal intensity. In order to suppress the signal fading induced by multiplicative noise, we propose a fast Quasi-Cyclic (QC) Low-Density Parity-Check (LDPC) code for FSO Communication systems. As a linear block code based on sparse matrix, the performances of QC-LDPC is extremely near to the Shannon limit. Currently, the studies on LDPC code in FSO Communications is mainly focused on Gauss-channel and Rayleigh-channel, respectively. In this study, the LDPC code design over atmospheric turbulence channel which is nether Gauss-channel nor Rayleigh-channel is closer to the practical situation. Based on the characteristics of atmospheric channel, which is modeled as logarithmic-normal distribution and K-distribution, we designed a special QC-LDPC code, and deduced the log-likelihood ratio (LLR). An irregular QC-LDPC code for fast coding, of which the rates are variable, is proposed in this paper. The proposed code achieves excellent performance of LDPC codes and can present the characteristics of high efficiency in low rate, stable in high rate and less number of iteration. The result of belief propagation (BP) decoding shows that the bit error rate (BER) obviously reduced as the Signal-to-Noise Ratio (SNR) increased. Therefore, the LDPC channel coding technology can effectively improve the performance of FSO. At the same time, the BER, after decoding reduces with the increase of SNR arbitrarily, and not having error limitation platform phenomenon with error rate slowing down.

  18. Cooperation, networks and emotions: Three essays in behavioral economics

    NARCIS (Netherlands)

    van Leeuwen, B.

    2015-01-01

    This thesis contains three essays that study how people behave in a social context. The first two essays are on cooperation and networks. Chapter 2 investigates a mechanism to facilitate public good provision in networks. It relies on the idea that people compete for attractive network positions (or

  19. 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.

  20. Design Considerations for Multi-Channel Picture Communication Networks

    OpenAIRE

    Scheibe, Paul O.

    1983-01-01

    Design of networks intended for communication of digitally-encoded pictures involves considerations different from those used in the design of text or voice communication networks. This paper provides an overview of the elements useful in the design of picture communication networks by relation and contrast with other communication networks. Particular emphasis is given to picture communication systems useful in medical applications.

  1. 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

  2. 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...

  3. ARIES API/industry communication network now spans the U.S

    International Nuclear Information System (INIS)

    Anon.

    1996-01-01

    The ATM Research and Industrial Enterprise Study (ARIES) is a joint development project of API member companies. It involves the cooperation of the vendor community, several DOE labs and NASA's Advanced Communications Technology Satellite (ACTS) Program to explore the ability of Asynchronous Transfer Mode (ATM) networking technology to revolutionize the process of energy exploration and production. One of the goals of this partnership is to implement real-time seismic exploration by providing high-data-rate communications from ships to data processing centers on land, all integrally coupled with interactive analysis by expert geoscientists. This paper reviews a demonstration project of this system transmitting seismic data from a ship in the Gulf of Mexico to the Houston offices of Amoco, Shell and the Institute of Biosciences and Technology in the Texas Medical Center

  4. Energy Aware Computing in Cooperative Wireless Networks

    DEFF Research Database (Denmark)

    Olsen, Anders Brødløs; Fitzek, Frank H. P.; Koch, Peter

    2005-01-01

    In this work the idea of cooperation is applied to wireless communication systems. It is generally accepted that energy consumption is a significant design constraint for mobile handheld systems. We propose a novel method of cooperative task computing by distributing tasks among terminals over...... the unreliable wireless link. Principles of multi–processor energy aware task scheduling are used exploiting performance scalable technologies such as Dynamic Voltage Scaling (DVS). We introduce a novel mechanism referred to as D2VS and here it is shown by means of simulation that savings of 40% can be achieved....

  5. NASA Communications Augmentation network

    Science.gov (United States)

    Omidyar, Guy C.; Butler, Thomas E.; Laios, Straton C.

    1990-01-01

    The NASA Communications (Nascom) Division of the Mission Operations and Data Systems Directorate (MO&DSD) is to undertake a major initiative to develop the Nascom Augmentation (NAUG) network to achieve its long-range service objectives for operational data transport to support the Space Station Freedom Program, the Earth Observing System (EOS), and other projects. The NAUG is the Nascom ground communications network being developed to accommodate the operational traffic of the mid-1990s and beyond. The NAUG network development will be based on the Open Systems Interconnection Reference Model (OSI-RM). This paper describes the NAUG network architecture, subsystems, topology, and services; addresses issues of internetworking the Nascom network with other elements of the Space Station Information System (SSIS); discusses the operations environment. This paper also notes the areas of related research and presents the current conception of how the network will provide broadband services in 1998.

  6. Cooperative robots and sensor networks 2015

    CERN Document Server

    Dios, JRamiro

    2015-01-01

    This book compiles some of the latest research in cooperation between robots and sensor networks. Structured in twelve chapters, this book addresses fundamental, theoretical, implementation and experimentation issues. The chapters are organized into four parts namely multi-robots systems, data fusion and localization, security and dependability, and mobility.

  7. Emerging trends in communication networks

    CERN Document Server

    Hasan, Syed Faraz

    2014-01-01

    This book covers the state of the art in communication networks with the help of illustrative diagrams and recent references published in reputed journals and magazines. The book gives readers a glimpse into the next generation of communication networks. It explores topics that are currently in the research phase and/or are expected to be deployed in recent future such as LTE networks and IPv6 networks. This book is written for students/researchers who wish to come up to date with the recent trends in telecommunications.

  8. 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.

  9. If you can't beat 'em, join 'em: Cooperative and non-cooperative games in network sharing

    NARCIS (Netherlands)

    Offergelt, F.H.S.; Berkers, F.T.H.M.; Hendrix, G.P.

    2011-01-01

    No Mobile Network Operator (MNO) will make the decision to share its network lightly. There are many financial and strategic considerations to this question. In this paper we outline a non-cooperative game which can be used to model the strategic decision of an MNO regarding mobile network sharing

  10. Combining evolutionary game theory and network theory to analyze human cooperation patterns

    International Nuclear Information System (INIS)

    Scatà, Marialisa; Di Stefano, Alessandro; La Corte, Aurelio; Liò, Pietro; Catania, Emanuele; Guardo, Ermanno; Pagano, Salvatore

    2016-01-01

    Highlights: • We investigate the evolutionary dynamics of human cooperation in a social network. • We introduce the concepts of “Critical Mass”, centrality measure and homophily. • The emergence of cooperation is affected by the spatial choice of the “Critical Mass”. • Our findings show that homophily speeds up the convergence towards cooperation. • Centrality and “Critical Mass” spatial choice partially offset the impact of homophily. - Abstract: As natural systems continuously evolve, the human cooperation dilemma represents an increasingly more challenging question. Humans cooperate in natural and social systems, but how it happens and what are the mechanisms which rule the emergence of cooperation, represent an open and fascinating issue. In this work, we investigate the evolution of cooperation through the analysis of the evolutionary dynamics of behaviours within the social network, where nodes can choose to cooperate or defect following the classical social dilemmas represented by Prisoner’s Dilemma and Snowdrift games. To this aim, we introduce a sociological concept and statistical estimator, “Critical Mass”, to detect the minimum initial seed of cooperators able to trigger the diffusion process, and the centrality measure to select within the social network. Selecting different spatial configurations of the Critical Mass nodes, we highlight how the emergence of cooperation can be influenced by this spatial choice of the initial core in the network. Moreover, we target to shed light how the concept of homophily, a social shaping factor for which “birds of a feather flock together”, can affect the evolutionary process. Our findings show that homophily allows speeding up the diffusion process and make quicker the convergence towards human cooperation, while centrality measure and thus the Critical Mass selection, play a key role in the evolution showing how the spatial configurations can create some hidden patterns, partially

  11. 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.

  12. A cooperative positioning with Kalman filters and handover mechanism for indoor microcellular visible light communication network

    Science.gov (United States)

    Xiong, Jieqing; Huang, Zhitong; Zhuang, Kaiyu; Ji, Yuefeng

    2016-08-01

    We propose a novel handover scheme for indoor microcellular visible light communication (VLC) network. With such a scheme, the room, which is fully coverage by light, is divided into several microcells according to the layout of light-emitting diodes (LEDs). However, the directionality of light arises new challenges in keeping the connectivity between the mobile devices and light source under the mobile circumstances. The simplest solution is that all LEDs broadcast data of every user simultaneously, but it wastes too much bandwidth resource, especially when the amount of users increases. To solve this key problem, we utilize the optical positioning assisting handover procedure in this paper. In the positioning stage, the network manager obtains the location information of user device via downlink and uplink signal strength information, which is white light and infrared, respectively. After that, a Kalman filter is utilized for improving the tracking performance of a mobile device. Then, the network manager decides how to initiate the handover process by the previous information. Results show that the proposed scheme can achieve low-cost, seamless data communication, and a high probability of successful handover.

  13. 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.

  14. 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.

  15. The physics of communicability in complex networks

    International Nuclear Information System (INIS)

    Estrada, Ernesto; Hatano, Naomichi; Benzi, Michele

    2012-01-01

    A fundamental problem in the study of complex networks is to provide quantitative measures of correlation and information flow between different parts of a system. To this end, several notions of communicability have been introduced and applied to a wide variety of real-world networks in recent years. Several such communicability functions are reviewed in this paper. It is emphasized that communication and correlation in networks can take place through many more routes than the shortest paths, a fact that may not have been sufficiently appreciated in previously proposed correlation measures. In contrast to these, the communicability measures reviewed in this paper are defined by taking into account all possible routes between two nodes, assigning smaller weights to longer ones. This point of view naturally leads to the definition of communicability in terms of matrix functions, such as the exponential, resolvent, and hyperbolic functions, in which the matrix argument is either the adjacency matrix or the graph Laplacian associated with the network. Considerable insight on communicability can be gained by modeling a network as a system of oscillators and deriving physical interpretations, both classical and quantum-mechanical, of various communicability functions. Applications of communicability measures to the analysis of complex systems are illustrated on a variety of biological, physical and social networks. The last part of the paper is devoted to a review of the notion of locality in complex networks and to computational aspects that by exploiting sparsity can greatly reduce the computational efforts for the calculation of communicability functions for large networks.

  16. Growth strategies and governance of horizontal business networks: the case of the biggest German cooperative food retail network

    Directory of Open Access Journals (Sweden)

    Douglas Wegner

    2011-08-01

    Full Text Available Several growth strategies may be adopted by cooperative retail networks, but these strategies create dilemmas about how to organize business networks with a large number of participants and the adjustments in the governance system that are necessary to facilitate growth. The article examines the relations between the growth strategies adopted by a horizontal business network and its governance system. We analyze the case of Edeka, a centennial cooperative network, leader in food retail in Germany, showing its growth strategies and implications for the network structure. The case study was based on various secondary data sources and focuses the whole network – and not the networked firms – as the unit of analysis. Results indicate that, in order to grow, the network changed its governance structure and the process of participation of members in decision making, creating a hierarchical structure with professional management. The paper contributes to the discussions on cooperative governance and demonstrates that governance systems are transient and adapt to the network strategies. From a management viewpoint, the results show the effects of the growth strategies adopted by business networks, regarding the role of network managers and entrepreneurs in network management.

  17. RELATION BETWEEN COOPERATION AND ORGANIZATIONAL LEARNING WITH THE COMPETITIVENESS IN AN INTERORGANIZATIONAL NETWORK

    Directory of Open Access Journals (Sweden)

    Paulo Cesar Zonta

    2015-05-01

    Full Text Available The study analyzed the relationship between cooperation and organizational learning with competitiveness in a small and medium enterprises (SME network, with business of the groups of the Commercial and Industrial Association of Chapecó (ACIC. The methodology used was quantitative, with the factorial analysis. Currently, ACIC has 14 groups and 236 SME´s nucleated, developing joint activities of economic and social sustainability in Chapecó. The theoretical study raised concepts already endorsed by the scientific community on interorganizational networks, competitiveness, cooperation and organizational learning. The results demonstrated that indicators related to cooperation and learning in horizontal networks are characterized as antecedents of competitiveness in organizational networks, and that there is a positive correlation between the constructs cooperation and organizational learning with competitiveness construct. The study confirms the belief that small businesses associated in networks can increase their competitiveness, thus contributing to regional development.

  18. Development of IT-based data communication network technology

    International Nuclear Information System (INIS)

    Hong, Seok Boong; Jeong, K. I.; Yoo, Y. R.

    2010-10-01

    - Developing broadband high-reliability real-time communications technology for NPP - Developing reliability and performance validation technology for communications network - Developing security technology for NPP communications network - Developing field communications network for harsh environment of NPP - International standard registration(Oct. 28, 2009, IEC 61500

  19. 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...

  20. 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.

  1. Secure Multiuser Communications in Wireless Sensor Networks with TAS and Cooperative Jamming

    Directory of Open Access Journals (Sweden)

    Maoqiang Yang

    2016-11-01

    Full Text Available In this paper, we investigate the secure transmission in wireless sensor networks (WSNs consisting of one multiple-antenna base station (BS, multiple single-antenna legitimate users, one single-antenna eavesdropper and one multiple-antenna cooperative jammer. In an effort to reduce the scheduling complexity and extend the battery lifetime of the sensor nodes, the switch-and-stay combining (SSC scheduling scheme is exploited over the sensor nodes. Meanwhile, transmit antenna selection (TAS is employed at the BS and cooperative jamming (CJ is adopted at the jammer node, aiming at achieving a satisfactory secrecy performance. Moreover, depending on whether the jammer node has the global channel state information (CSI of both the legitimate channel and the eavesdropper’s channel, it explores a zero-forcing beamforming (ZFB scheme or a null-space artificial noise (NAN scheme to confound the eavesdropper while avoiding the interference to the legitimate user. Building on this, we propose two novel hybrid secure transmission schemes, termed TAS-SSC-ZFB and TAS-SSC-NAN, for WSNs. We then derive the exact closed-form expressions for the secrecy outage probability and the effective secrecy throughput of both schemes to characterize the secrecy performance. Using these closed-form expressions, we further determine the optimal switching threshold and obtain the optimal power allocation factor between the BS and jammer node for both schemes to minimize the secrecy outage probability, while the optimal secrecy rate is decided to maximize the effective secrecy throughput for both schemes. Numerical results are provided to verify the theoretical analysis and illustrate the impact of key system parameters on the secrecy performance.

  2. Cooperative Networks: Altruism, Group Solidarity, Reciprocity, and Sanctioning in Ugandan Producer Organizations.

    Science.gov (United States)

    Baldassarri, Delia

    2015-09-01

    Repeated interaction and social networks are commonly considered viable solutions to collective action problems. This article identifies and systematically measures four general mechanisms--that is, generalized altruism, group solidarity, reciprocity, and the threat of sanctioning--and tests which of them brings about cooperation in the context of Ugandan producer organizations. Using an innovative methodological framework that combines "lab-in-the-field" experiments with survey interviews and complete social networks data, the article goes beyond the assessment of a relationship between social networks and collective outcomes to study the mechanisms that favor cooperative behavior. The article first establishes a positive relationship between position in the network structure and propensity to cooperate in the producer organization and then uses farmers' behavior in dictator and public goods games to test different mechanisms that may account for such a relationship. Results show that cooperation is induced by patterns of reciprocity that emerge through repeated interaction rather than other-regarding preferences like altruism or group solidarity.

  3. On cooperative and efficient overlay network evolution based on a group selection pattern.

    Science.gov (United States)

    Nakao, Akihiro; Wang, Yufeng

    2010-04-01

    In overlay networks, the interplay between network structure and dynamics remains largely unexplored. In this paper, we study dynamic coevolution between individual rational strategies (cooperative or defect) and the overlay network structure, that is, the interaction between peer's local rational behaviors and the emergence of the whole network structure. We propose an evolutionary game theory (EGT)-based overlay topology evolution scheme to drive a given overlay into the small-world structure (high global network efficiency and average clustering coefficient). Our contributions are the following threefold: From the viewpoint of peers' local interactions, we explicitly consider the peer's rational behavior and introduce a link-formation game to characterize the social dilemma of forming links in an overlay network. Furthermore, in the evolutionary link-formation phase, we adopt a simple economic process: Each peer keeps one link to a cooperative neighbor in its neighborhood, which can slightly speed up the convergence of cooperation and increase network efficiency; from the viewpoint of the whole network structure, our simulation results show that the EGT-based scheme can drive an arbitrary overlay network into a fully cooperative and efficient small-world structure. Moreover, we compare our scheme with a search-based economic model of network formation and illustrate that our scheme can achieve the experimental and analytical results in the latter model. In addition, we also graphically illustrate the final overlay network structure; finally, based on the group selection model and evolutionary set theory, we theoretically obtain the approximate threshold of cost and draw the conclusion that the small value of the average degree and the large number of the total peers in an overlay network facilitate the evolution of cooperation.

  4. 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...

  5. 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.

  6. 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 ...

  7. Social networks and cooperation: a bibliometric study

    Directory of Open Access Journals (Sweden)

    Ana Paula Lopes

    2013-05-01

    Full Text Available The social network analysis involves social and behavioral science. The decentralization of productive activities, such as the formation of "network organizations" as a result of downsizing of large corporate structures of the past, marked by outsoucing and formation of alliances, shows the importance of this theme. The main objective of this paper is to analyze the theory of cooperation and social networks over a period of 24 years. For this, was performed a bibliometric study with content analysis. The database chosen for the initial sample search was ISI Web of Science. The search topics were “social network” and “cooperation”. Were analyzed 97 articles and their references, through networks of citations. The main identified research groups dealing with issues related to trust, strategic alliances, natural cooperation, game theory, social capital, intensity of interaction, reciprocity and innovation. It was found that the publications occurred in a large number of journals, which indicates that the theme is multidisciplinary, and only five journals published at least three articles. Although the first publication has occurred in 1987, was from 2006 that the publications effectively increased. The areas most related to the theme of the research were performance, evolution, management, graphics, model and game theory.

  8. 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...

  9. 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.

  10. Coding and cryptography synergy for a robust communication

    CERN Document Server

    Zivic, Natasa

    2013-01-01

    This book presents the benefits of the synergetic effect of the combination of coding and cryptography. It introduces new directions for the interoperability between the components of a communication system. Coding and cryptography are standard components in today's distributed systems. The integration of cryptography into coding aspects is very interesting, as the usage of cryptography will be common use, even in industrial applications. The book is based on new developments of coding and cryptography, which use real numbers to express reliability values of bits instead of binary values 0 and 1. The presented methods are novel and designed for noisy communication, which doesn´t allow the successful use of cryptography. The rate of successful verifications is improved essentially not only for standard or "hard" verification, but even more after the introduction of "soft" verification. A security analysis shows the impact on the security. Information security and cryptography follow the late developments of c...

  11. A Fair Cooperative MAC Protocol in IEEE 802.11 WLAN

    Directory of Open Access Journals (Sweden)

    Seyed Davoud Mousavi

    2018-05-01

    Full Text Available Cooperative communication techniques have recently enabled wireless technologies to overcome their challenges. The main objective of these techniques is to improve resource allocation. In this paper, we propose a new protocol in medium access control (MAC of the IEEE 802.11 standard. In our new protocol, which is called Fair Cooperative MAC (FC-MAC, every relay node participates in cooperation proportionally to its provided cooperation gain. This technique improves network resource allocation by exploiting the potential capacity of all relay candidates. Simulation results demonstrate that the FC-MAC protocol presents better performance in terms of throughput, fairness, and network lifetime.

  12. Cooperative networks overcoming defectors by social influence

    Science.gov (United States)

    Gomez Portillo, Ignacio

    2014-01-01

    We address the cooperation problem in structured populations by considering the prisoner’s dilemma game as a metaphor of the social interactions between individuals with imitation capacity. We present a new strategy update rule called democratic weighted update where the individual’s behavior is socially influenced by each one of their neighbors. In particular, the capacity of an individual to socially influence other ones is proportional to its accumulated payoff. When in a neighborhood there are cooperators and defectors, the focal player is contradictorily influenced by them and, therefore, the effective social influence is given by the difference of the accumulated payoff of each strategy in its neighborhood. First, by considering the growing process of the network and neglecting mutations, we show the evolution of highly cooperative systems. Then, we broadly show that the social influence allows to overcome the emergence of defectors into highly cooperative systems. In this way, we conclude that in a structured system formed by a growing process, the cooperation evolves if the individuals have an imitation capacity socially influenced by each one of their neighbors. Therefore, here we present a theoretical solution of the cooperation problem among genetically unrelated individuals.

  13. Analysis of Relay Selection Game in a Cooperative Communication Scenario

    DEFF Research Database (Denmark)

    Craciunescu, Razvan; Mihovska, Albena; Halunga, Simona

    This paper analysis the performances of a proposed set of functions that model the relay selection process in a cooperative communication scenario. The behavior and influence proposed functions create a mechanism for selecting the best relays to be used to send certain types of data. The mechanism...... of comparison between the bit error rate of the proposed mechanism and the direct communication....

  14. Intrusion-Aware Alert Validation Algorithm for Cooperative Distributed Intrusion Detection Schemes of Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Young-Jae Song

    2009-07-01

    Full Text Available Existing anomaly and intrusion detection schemes of wireless sensor networks have mainly focused on the detection of intrusions. Once the intrusion is detected, an alerts or claims will be generated. However, any unidentified malicious nodes in the network could send faulty anomaly and intrusion claims about the legitimate nodes to the other nodes. Verifying the validity of such claims is a critical and challenging issue that is not considered in the existing cooperative-based distributed anomaly and intrusion detection schemes of wireless sensor networks. In this paper, we propose a validation algorithm that addresses this problem. This algorithm utilizes the concept of intrusion-aware reliability that helps to provide adequate reliability at a modest communication cost. In this paper, we also provide a security resiliency analysis of the proposed intrusion-aware alert validation algorithm.

  15. Periodic oscillatory solution in delayed competitive-cooperative neural networks: A decomposition approach

    International Nuclear Information System (INIS)

    Yuan Kun; Cao Jinde

    2006-01-01

    In this paper, the problems of exponential convergence and the exponential stability of the periodic solution for a general class of non-autonomous competitive-cooperative neural networks are analyzed via the decomposition approach. The idea is to divide the connection weights into inhibitory or excitatory types and thereby to embed a competitive-cooperative delayed neural network into an augmented cooperative delay system through a symmetric transformation. Some simple necessary and sufficient conditions are derived to ensure the componentwise exponential convergence and the exponential stability of the periodic solution of the considered neural networks. These results generalize and improve the previous works, and they are easy to check and apply in practice

  16. Communication and control for networked complex systems

    CERN Document Server

    Peng, Chen; Han, Qing-Long

    2015-01-01

    This book reports on the latest advances in the study of Networked Control Systems (NCSs). It highlights novel research concepts on NCSs; the analysis and synthesis of NCSs with special attention to their networked character; self- and event-triggered communication schemes for conserving limited network resources; and communication and control co-design for improving the efficiency of NCSs. The book will be of interest to university researchers, control and network engineers, and graduate students in the control engineering, communication and network sciences interested in learning the core principles, methods, algorithms and applications of NCSs.

  17. Implementing and evaluating e-communication to improve intersectoral cooperation between hospitals and local communities

    DEFF Research Database (Denmark)

    Nicolaisen, Anne; Qvist, Peter

    2015-01-01

    services for the patient. The Region of Southern Denmark has implemented e-communication to improve the cooperation across health care sectors. Communities and hospitals in the Region of Southern Denmark agreed to comply to specified quality standards for the content and timeliness of information exchange...... these will be presented at the conference. Keywords: e-communication, cooperation across health care sectors, audit, evaluation, practice...

  18. Centralized Cooperative Positioning and Tracking with Realistic Communications Constraints

    DEFF Research Database (Denmark)

    Mensing, Christian; Nielsen, Jimmy Jessen

    2010-01-01

    on the overall performance will be assessed. As we are considering a dynamic scenario, the cooperative positioning algorithms are based on extended Kalman filtering for position estimation and tracking. Simulation results for ultra-wideband based ranging information and WLAN based communications infrastructure...

  19. 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...

  20. Distributed and Cooperative Link Scheduling for Large-Scale Multihop Wireless Networks

    Directory of Open Access Journals (Sweden)

    Swami Ananthram

    2007-01-01

    Full Text Available A distributed and cooperative link-scheduling (DCLS algorithm is introduced for large-scale multihop wireless networks. With this algorithm, each and every active link in the network cooperatively calibrates its environment and converges to a desired link schedule for data transmissions within a time frame of multiple slots. This schedule is such that the entire network is partitioned into a set of interleaved subnetworks, where each subnetwork consists of concurrent cochannel links that are properly separated from each other. The desired spacing in each subnetwork can be controlled by a tuning parameter and the number of time slots specified for each frame. Following the DCLS algorithm, a distributed and cooperative power control (DCPC algorithm can be applied to each subnetwork to ensure a desired data rate for each link with minimum network transmission power. As shown consistently by simulations, the DCLS algorithm along with a DCPC algorithm yields significant power savings. The power savings also imply an increased feasible region of averaged link data rates for the entire network.

  1. Distributed and Cooperative Link Scheduling for Large-Scale Multihop Wireless Networks

    Directory of Open Access Journals (Sweden)

    Ananthram Swami

    2007-12-01

    Full Text Available A distributed and cooperative link-scheduling (DCLS algorithm is introduced for large-scale multihop wireless networks. With this algorithm, each and every active link in the network cooperatively calibrates its environment and converges to a desired link schedule for data transmissions within a time frame of multiple slots. This schedule is such that the entire network is partitioned into a set of interleaved subnetworks, where each subnetwork consists of concurrent cochannel links that are properly separated from each other. The desired spacing in each subnetwork can be controlled by a tuning parameter and the number of time slots specified for each frame. Following the DCLS algorithm, a distributed and cooperative power control (DCPC algorithm can be applied to each subnetwork to ensure a desired data rate for each link with minimum network transmission power. As shown consistently by simulations, the DCLS algorithm along with a DCPC algorithm yields significant power savings. The power savings also imply an increased feasible region of averaged link data rates for the entire network.

  2. Cooperative HARQ with Poisson Interference and Opportunistic Routing

    KAUST Repository

    Kaveh, Mostafa

    2014-01-06

    This presentation considers reliable transmission of data from a source to a destination, aided cooperatively by wireless relays selected opportunistically and utilizing hybrid forward error correction/detection, and automatic repeat request (Hybrid ARQ, or HARQ). Specifically, we present a performance analysis of the cooperative HARQ protocol in a wireless adhoc multihop network employing spatial ALOHA. We model the nodes in such a network by a homogeneous 2-D Poisson point process. We study the tradeoff between the per-hop rate, spatial density and range of transmissions inherent in the network by optimizing the transport capacity with respect to the network design parameters, HARQ coding rate and medium access probability. We obtain an approximate analytic expression for the expected progress of opportunistic routing and optimize the capacity approximation by convex optimization. By way of numerical results, we show that the network design parameters obtained by optimizing the analytic approximation of transport capacity closely follows that of Monte Carlo based exact transport capacity optimization. As a result of the analysis, we argue that the optimal HARQ coding rate and medium access probability are independent of the node density in the network.

  3. An Effect of the Co-Operative Network Model for Students' Quality in Thai Primary Schools

    Science.gov (United States)

    Khanthaphum, Udomsin; Tesaputa, Kowat; Weangsamoot, Visoot

    2016-01-01

    This research aimed: 1) to study the current and desirable states of the co-operative network in developing the learners' quality in Thai primary schools, 2) to develop a model of the co-operative network in developing the learners' quality, and 3) to examine the results of implementation of the co-operative network model in the primary school.…

  4. Understanding communication networks in the emergency department

    Directory of Open Access Journals (Sweden)

    Braithwaite Jeffrey

    2009-12-01

    Full Text Available Abstract Background Emergency departments (EDs are high pressure health care settings involving complex interactions between staff members in providing and organising patient care. Without good communication and cooperation amongst members of the ED team, quality of care is at risk. This study examined the problem-solving, medication advice-seeking and socialising networks of staff working in an Australian hospital ED. Methods A social network survey (Response Rate = 94% was administered to all ED staff (n = 109 including doctors, nurses, allied health professionals, administrative staff and ward assistants. Analysis of the network characteristics was carried out by applying measures of density (the extent participants are concentrated, connectedness (how related they are, isolates (how segregated, degree centrality (who has most connections measured in two ways, in-degree, the number of ties directed to an individual and out-degree, the number of ties directed from an individual, betweenness centrality (who is important or powerful, degree of separation (how many ties lie between people and reciprocity (how bi-directional are interactions. Results In all three networks, individuals were more closely connected to colleagues from within their respective professional groups. The problem-solving network was the most densely connected network, followed by the medication advice network, and the loosely connected socialising network. ED staff relied on each other for help to solve work-related problems, but some senior doctors, some junior doctors and a senior nurse were important sources of medication advice for their ED colleagues. Conclusions Network analyses provide useful ways to assess social structures in clinical settings by allowing us to understand how ED staff relate within their social and professional structures. This can provide insights of potential benefit to ED staff, their leaders, policymakers and researchers.

  5. ISOE: an international occupational exposure database and communications network for dose optimisation

    International Nuclear Information System (INIS)

    Robinson, I.F.; Lazo, E.

    1995-01-01

    The Information System on Occupational Exposure (ISOE) was launched by the Nuclear Energy Agency (NEA) of the Organisation for Economic Co-operation and Development (OECD) on 1 January 1992 to facilitate the communication of dosimetry and ALARA implementation data among nuclear facilities around the world. Members of ISOE include 51 utilities from 17 countries and regulators from 11 countries, with four regional technical centres administering the system and a Steering Group which manages the work. ISOE includes three databases and a communications network at several levels. The three databases NEA1, NEA2 and NEA3 include varying levels of details, with NEA3 being the most detailed giving task and site specific ALARA practices and experiences. Utility membership of ISOE gives full access to the databases whereas regulators have more limited access. This paper reviews the current status of participation, describes the three databases and the communications network. Some dose data showing trends in particular countries are presented as well as dose data relating to operation cycle length and outage length. The advantages of membership are described, and it is concluded that ISOE holds the potential for both dose and cost savings. (author)

  6. Centralized cooperative spectrum sensing for ad-hoc disaster relief network clusters

    DEFF Research Database (Denmark)

    Pratas, Nuno; Marchetti, Nicola; Prasad, Neeli R.

    2010-01-01

    Disaster relief networks have to be highly adaptable and resilient. Cognitive radio enhanced ad-hoc architecture have been put forward as a candidate to enable such networks. Spectrum sensing is the cornerstone of the cognitive radio paradigm, and it has been the target of intensive research....... The main common conclusion was that the achievable spectrum sensing accuracy can be greatly enhanced through the use of cooperative sensing schemes. When considering applying Cognitive Radio to ad-hoc disaster relief networks, spectrum sensing cooperative schemes are paramount. A centralized cluster...

  7. Auction-Based Resource Allocation for Cooperative Video Transmission Protocols over Wireless Networks

    Directory of Open Access Journals (Sweden)

    Zhu Han

    2009-01-01

    Full Text Available Cooperative transmission has been proposed as a novel transmission strategy that takes advantage of broadcast nature of wireless networks, forms virtual MIMO system, and provides diversity gains. In this paper, wireless video transmission protocols are proposed, in which the spectrum resources are first allocated for the source side to broadcast video packets to the relay and destination, and then for the relay side to transmit side information generated from the received packets. The proposed protocols are optimized to minimize the end-to-end expected distortion via choosing bandwidth/power allocation, configuration of side information, subject to bandwidth and power constraints. For multiuser cases, most of current resource allocation approaches cannot be naturally extended and applied to the networks with relay nodes for video transmission. This paper extends the share auction approach into the cooperative video communication scenarios and provides a near-optimal solution for resource allocation. Experimental results have demonstrated that the proposed approach has significant advantage of up to 4 dB gain in single user case and 1.3 dB gain in multiuser case over the reference systems in terms of peak-to-signal-noise ratio. In addition, it reduces the formidable computational complexity of the optimal solution to linear complexity with performance degradation of less than 0.3 dB.

  8. 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....

  9. Using networking and communications software in business

    CERN Document Server

    McBride, PK

    2014-01-01

    Using Networking and Communications Software in Business covers the importance of networks in a business firm, the benefits of computer communications within a firm, and the cost-benefit in putting up networks in businesses. The book is divided into six parts. Part I looks into the nature and varieties of networks, networking standards, and network software. Part II discusses the planning of a networked system, which includes analyzing the requirements for the network system, the hardware for the network, and network management. The installation of the network system and the network managemen

  10. Lattice Index Coding

    OpenAIRE

    Natarajan, Lakshmi; Hong, Yi; Viterbo, Emanuele

    2014-01-01

    The index coding problem involves a sender with K messages to be transmitted across a broadcast channel, and a set of receivers each of which demands a subset of the K messages while having prior knowledge of a different subset as side information. We consider the specific case of noisy index coding where the broadcast channel is Gaussian and every receiver demands all the messages from the source. Instances of this communication problem arise in wireless relay networks, sensor networks, and ...

  11. A Quantum Cryptography Communication Network Based on Software Defined Network

    Directory of Open Access Journals (Sweden)

    Zhang Hongliang

    2018-01-01

    Full Text Available With the development of the Internet, information security has attracted great attention in today’s society, and quantum cryptography communication network based on quantum key distribution (QKD is a very important part of this field, since the quantum key distribution combined with one-time-pad encryption scheme can guarantee the unconditional security of the information. The secret key generated by quantum key distribution protocols is a very valuable resource, so making full use of key resources is particularly important. Software definition network (SDN is a new type of network architecture, and it separates the control plane and the data plane of network devices through OpenFlow technology, thus it realizes the flexible control of the network resources. In this paper, a quantum cryptography communication network model based on SDN is proposed to realize the flexible control of quantum key resources in the whole cryptography communication network. Moreover, we propose a routing algorithm which takes into account both the hops and the end-to-end availible keys, so that the secret key generated by QKD can be used effectively. We also simulate this quantum cryptography communication network, and the result shows that based on SDN and the proposed routing algorithm the performance of this network is improved since the effective use of the quantum key resources.

  12. Improved Sparse Channel Estimation for Cooperative Communication Systems

    Directory of Open Access Journals (Sweden)

    Guan Gui

    2012-01-01

    Full Text Available Accurate channel state information (CSI is necessary at receiver for coherent detection in amplify-and-forward (AF cooperative communication systems. To estimate the channel, traditional methods, that is, least squares (LS and least absolute shrinkage and selection operator (LASSO, are based on assumptions of either dense channel or global sparse channel. However, LS-based linear method neglects the inherent sparse structure information while LASSO-based sparse channel method cannot take full advantage of the prior information. Based on the partial sparse assumption of the cooperative channel model, we propose an improved channel estimation method with partial sparse constraint. At first, by using sparse decomposition theory, channel estimation is formulated as a compressive sensing problem. Secondly, the cooperative channel is reconstructed by LASSO with partial sparse constraint. Finally, numerical simulations are carried out to confirm the superiority of proposed methods over global sparse channel estimation methods.

  13. Adaptive Modulation and Coding for LTE Wireless Communication

    Science.gov (United States)

    Hadi, S. S.; Tiong, T. C.

    2015-04-01

    Long Term Evolution (LTE) is the new upgrade path for carrier with both GSM/UMTS networks and CDMA2000 networks. The LTE is targeting to become the first global mobile phone standard regardless of the different LTE frequencies and bands use in other countries barrier. Adaptive Modulation and Coding (AMC) is used to increase the network capacity or downlink data rates. Various modulation types are discussed such as Quadrature Phase Shift Keying (QPSK), Quadrature Amplitude Modulation (QAM). Spatial multiplexing techniques for 4×4 MIMO antenna configuration is studied. With channel station information feedback from the mobile receiver to the base station transmitter, adaptive modulation and coding can be applied to adapt to the mobile wireless channels condition to increase spectral efficiencies without increasing bit error rate in noisy channels. In High-Speed Downlink Packet Access (HSDPA) in Universal Mobile Telecommunications System (UMTS), AMC can be used to choose modulation types and forward error correction (FEC) coding rate.

  14. A Power-Optimized Cooperative MAC Protocol for Lifetime Extension in Wireless Sensor Networks.

    Science.gov (United States)

    Liu, Kai; Wu, Shan; Huang, Bo; Liu, Feng; Xu, Zhen

    2016-10-01

    In wireless sensor networks, in order to satisfy the requirement of long working time of energy-limited nodes, we need to design an energy-efficient and lifetime-extended medium access control (MAC) protocol. In this paper, a node cooperation mechanism that one or multiple nodes with higher channel gain and sufficient residual energy help a sender relay its data packets to its recipient is employed to achieve this objective. We first propose a transmission power optimization algorithm to prolong network lifetime by optimizing the transmission powers of the sender and its cooperative nodes to maximize their minimum residual energy after their data packet transmissions. Based on it, we propose a corresponding power-optimized cooperative MAC protocol. A cooperative node contention mechanism is designed to ensure that the sender can effectively select a group of cooperative nodes with the lowest energy consumption and the best channel quality for cooperative transmissions, thus further improving the energy efficiency. Simulation results show that compared to typical MAC protocol with direct transmissions and energy-efficient cooperative MAC protocol, the proposed cooperative MAC protocol can efficiently improve the energy efficiency and extend the network lifetime.

  15. VLSI architectures for modern error-correcting codes

    CERN Document Server

    Zhang, Xinmiao

    2015-01-01

    Error-correcting codes are ubiquitous. They are adopted in almost every modern digital communication and storage system, such as wireless communications, optical communications, Flash memories, computer hard drives, sensor networks, and deep-space probing. New-generation and emerging applications demand codes with better error-correcting capability. On the other hand, the design and implementation of those high-gain error-correcting codes pose many challenges. They usually involve complex mathematical computations, and mapping them directly to hardware often leads to very high complexity. VLSI

  16. Communicating embedded systems networks applications

    CERN Document Server

    Krief, Francine

    2013-01-01

    Embedded systems become more and more complex and require having some knowledge in various disciplines such as electronics, data processing, telecommunications and networks. Without detailing all the aspects related to the design of embedded systems, this book, which was written by specialists in electronics, data processing and telecommunications and networks, gives an interesting point of view of communication techniques and problems in embedded systems. This choice is easily justified by the fact that embedded systems are today massively communicating and that telecommunications and network

  17. Scalable Optical-Fiber Communication Networks

    Science.gov (United States)

    Chow, Edward T.; Peterson, John C.

    1993-01-01

    Scalable arbitrary fiber extension network (SAFEnet) is conceptual fiber-optic communication network passing digital signals among variety of computers and input/output devices at rates from 200 Mb/s to more than 100 Gb/s. Intended for use with very-high-speed computers and other data-processing and communication systems in which message-passing delays must be kept short. Inherent flexibility makes it possible to match performance of network to computers by optimizing configuration of interconnections. In addition, interconnections made redundant to provide tolerance to faults.

  18. Cooperation as a Service in VANET: Implementation and Simulation Results

    Directory of Open Access Journals (Sweden)

    Hajar Mousannif

    2012-01-01

    Full Text Available The past decade has witnessed the emergence of Vehicular Ad-hoc Networks (VANET, specializing from the well-known Mobile Ad Hoc Networks (MANET to Vehicle-to-Vehicle (V2V and Vehicle-to-Infrastructure (V2I wireless communications. While the original motivation for Vehicular Networks was to promote traffic safety, recently it has become increasingly obvious that Vehicular Networks open new vistas for Internet access, providing weather or road condition, parking availability, distributed gaming, and advertisement. In previous papers [27,28], we introduced Cooperation as a Service (CaaS; a new service-oriented solution which enables improved and new services for the road users and an optimized use of the road network through vehicle's cooperation and vehicle-to-vehicle communications. The current paper is an extension of the first ones; it describes an improved version of CaaS and provides its full implementation details and simulation results. CaaS structures the network into clusters, and uses Content Based Routing (CBR for intra-cluster communications and DTN (Delay–and disruption-Tolerant Network routing for inter-cluster communications. To show the feasibility of our approach, we implemented and tested CaaS using Opnet modeler software package. Simulation results prove the correctness of our protocol and indicate that CaaS achieves higher performance as compared to an Epidemic approach.

  19. Cooperative robots and sensor networks 2014

    CERN Document Server

    Khelil, Abdelmajid

    2014-01-01

    This book is the second volume on Cooperative Robots and Sensor Networks. The primary objective of this book is to provide an up-to-date reference for cutting-edge studies and research trends related to mobile robots and wireless sensor networks, and in particular for the coupling between them. Indeed, mobile robots and wireless sensor networks have enabled great potentials and a large space for ubiquitous and pervasive applications. Robotics and wireless sensor networks have mostly been considered as separate research fields and little work has investigated the marriage between these two technologies. However, these two technologies share several features, enable common cyber-physical applications and provide complementary support to each other. The book consists of ten chapters, organized into four parts. The first part of the book presents three chapters related to localization of mobile robots using wireless sensor networks. Two chapters presented new solutions based Extended Kalman Filter and Particle Fi...

  20. 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)

  1. 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

  2. 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...

  3. Wireless Powered Cooperative Communications: Power-Splitting Relaying With Energy Accumulation (Author’s Manuscript)

    Science.gov (United States)

    2016-03-21

    decreasing power usage, while improving the transmission performance. A key concern of the energy harvesting enabled coop- erative relay communication is the...improving transmission performance via an efficient utiliza- tion of harvested power has been widely studied for conven- tional energy harvesting techniques...can be used as energy sources for cooperative nodes. Moreover, it has been illustrated in [6] that wireless -powered cooperative relay communications

  4. The Structure of Online Consumer Communication Networks

    NARCIS (Netherlands)

    B.G.C. Dellaert (Benedict); M.J.W. Harmsen-van Hout (Marjolein); P.J.J. Herings (Jean-Jacques)

    2006-01-01

    textabstractIn this paper we study the structure of the bilateral communication links within Online Consumer Communication Networks (OCCNs), such as virtual communities. Compared to the offline world, consumers in online networks are highly flexible to choose their communication partners and little

  5. Real-Time Communication Networks Onboard Ships

    DEFF Research Database (Denmark)

    Nielsen, Jens Frederik Dalsgaard; Nielsen, Kirsten Mølgaard; Jørgensen, N.

    1995-01-01

    This paper describes the ATOMOS communication network project carried out within the EU project ATOMOS, to be used for ISC purposes.......This paper describes the ATOMOS communication network project carried out within the EU project ATOMOS, to be used for ISC purposes....

  6. 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 ...

  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. Distributed cooperative guidance for multiple missiles with fixed and switching communication topologies

    Directory of Open Access Journals (Sweden)

    Qilun ZHAO

    2017-08-01

    Full Text Available This study investigates cooperative guidance problems for multiple missiles with fixed and switching directed communication topologies. A two-step guidance strategy is proposed to realize the simultaneous attack. In the first step, a distributed cooperative guidance law is designed using local neighboring information for multiple missiles to achieve consensus on range-to-go and leading angle. The second step begins when the consensus of multiple missiles is realized. During the second step, multiple missiles disconnect from each other and hit the target using the proportional navigation guidance law. First, based on the local neighboring communications, a sufficient condition for multiple missiles to realize simultaneous attack with a fixed communication topology is presented, where the topology is only required to have a directed spanning tree. Then, the results are extended to the case of switching communication topologies. Finally, numerical simulations are provided to validate the theoretical results.

  9. Expected Range of Cooperation Between Transmission System Operators and Distribution System Operators After Implementation of ENTSO-E Grid Codes

    Directory of Open Access Journals (Sweden)

    Tomasz Pakulski

    2015-06-01

    Full Text Available The authors present the prospects of cooperation between transmission system operators (TSO and distribution system operators (DSO after entry into force ENTSO-E (European Network of Transmission System Operators for Electricity grid codes. New areas of DSO activities, associated with offering TSO aggregated services for national power system regulation based on the regulation resources connected to the distribution grid, and services on the distribution system level as part of the creation of local balancing areas (LBA are presented. The paper also presents the possibilities of providing ancillary services by different types of distributed generation sources in the distribution network. The LBA concept, which involves integrated management of local regulation resources including generation, demand, and energy storage is described. The options of the renewable energy sources (RES using for voltage and reactive power control in the distribution network with the use of wind farms (WF connected to the distribution system are characterized.

  10. A fusion networking model for smart grid power distribution backbone communication network based on PTN

    Directory of Open Access Journals (Sweden)

    Wang Hao

    2016-01-01

    Full Text Available In current communication network for distribution in Chinese power grid systems, the fiber communication backbone network for distribution and TD-LTE power private wireless backhaul network of power grid are both bearing by the SDH optical transmission network, which also carries the communication network of transformer substation and main electric. As the data traffic of the distribution communication and TD-LTE power private wireless network grow rapidly in recent years, it will have a big impact with the SDH network’s bearing capacity which is mainly used for main electric communication in high security level. This paper presents a fusion networking model which use a multiple-layer PTN network as the unified bearing of the TD-LTE power private wireless backhaul network and fiber communication backbone network for distribution. Network dataflow analysis shows that this model can greatly reduce the capacity pressure of the traditional SDH network as well as ensure the reliability of the transmission of the communication network for distribution and TD-LTE power private wireless network.

  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. 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....

  13. Event-triggered cooperative target tracking in wireless sensor networks

    Directory of Open Access Journals (Sweden)

    Lu Kelin

    2016-10-01

    Full Text Available Since the issues of low communication bandwidth supply and limited battery capacity are very crucial for wireless sensor networks, this paper focuses on the problem of event-triggered cooperative target tracking based on set-membership information filtering. We study some fundamental properties of the set-membership information filter with multiple sensor measurements. First, a sufficient condition is derived for the set-membership information filter, under which the boundedness of the outer ellipsoidal approximation set of the estimation means is guaranteed. Second, the equivalence property between the parallel and sequential versions of the set-membership information filter is presented. Finally, the results are applied to a 1D event-triggered target tracking scenario in which the negative information is exploited in the sense that the measurements that do not satisfy the triggering conditions are modelled as set-membership measurements. The tracking performance of the proposed method is validated with extensive Monte Carlo simulations.

  14. 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.

  15. 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

  16. 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

  17. Cooperation among cancer cells as public goods games on Voronoi networks.

    Science.gov (United States)

    Archetti, Marco

    2016-05-07

    Cancer cells produce growth factors that diffuse and sustain tumour proliferation, a form of cooperation that can be studied using mathematical models of public goods in the framework of evolutionary game theory. Cell populations, however, form heterogeneous networks that cannot be described by regular lattices or scale-free networks, the types of graphs generally used in the study of cooperation. To describe the dynamics of growth factor production in populations of cancer cells, I study public goods games on Voronoi networks, using a range of non-linear benefits that account for the known properties of growth factors, and different types of diffusion gradients. The results are surprisingly similar to those obtained on regular graphs and different from results on scale-free networks, revealing that network heterogeneity per se does not promote cooperation when public goods diffuse beyond one-step neighbours. The exact shape of the diffusion gradient is not crucial, however, whereas the type of non-linear benefit is an essential determinant of the dynamics. Public goods games on Voronoi networks can shed light on intra-tumour heterogeneity, the evolution of resistance to therapies that target growth factors, and new types of cell therapy. Copyright © 2016 Elsevier Ltd. All rights reserved.

  18. 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.

  19. Visualising Actor Network for Cooperative Systems in Marine Technology

    DEFF Research Database (Denmark)

    Pan, Yushan; Finken, Sisse

    2016-01-01

    Awareness is a concept familiar to specialists within the field of Computer Supported Cooperative Work (CSCW). It is superior for analysing and describing some of the ad hoc work activities that unfold in cooperation. Such informal activities are outside the scope of engineers’ formal models, whi...... that shape computer systems. The aim, thus, is to portray cooperative work in a way that can be valuable for engineers implementing marine technology. We do so by way of presenting a transferring technique (2T) using insights from the CSCW field and Actor Network Theory (ANT)....

  20. Performance testing framework for smart grid communication network

    International Nuclear Information System (INIS)

    Quang, D N; See, O H; Chee, L L; Xuen, C Y; Karuppiah, S

    2013-01-01

    Smart grid communication network is comprised of different communication mediums and technologies. Performance evaluation is one of the main concerns in smart grid communication system. In any smart grid communication implementation, to determine the performance factor of the network, a testing of an end-to-end process flow is required. Therefore, an effective and coordinated testing procedure plays a crucial role in evaluating the performance of smart grid communications. In this paper, a testing framework is proposed as a guideline to analyze and assess the performance of smart grid communication network.

  1. 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

  2. Validation of network communicability metrics for the analysis of brain structural networks.

    Directory of Open Access Journals (Sweden)

    Jennifer Andreotti

    Full Text Available Computational network analysis provides new methods to analyze the brain's structural organization based on diffusion imaging tractography data. Networks are characterized by global and local metrics that have recently given promising insights into diagnosis and the further understanding of psychiatric and neurologic disorders. Most of these metrics are based on the idea that information in a network flows along the shortest paths. In contrast to this notion, communicability is a broader measure of connectivity which assumes that information could flow along all possible paths between two nodes. In our work, the features of network metrics related to communicability were explored for the first time in the healthy structural brain network. In addition, the sensitivity of such metrics was analysed using simulated lesions to specific nodes and network connections. Results showed advantages of communicability over conventional metrics in detecting densely connected nodes as well as subsets of nodes vulnerable to lesions. In addition, communicability centrality was shown to be widely affected by the lesions and the changes were negatively correlated with the distance from lesion site. In summary, our analysis suggests that communicability metrics that may provide an insight into the integrative properties of the structural brain network and that these metrics may be useful for the analysis of brain networks in the presence of lesions. Nevertheless, the interpretation of communicability is not straightforward; hence these metrics should be used as a supplement to the more standard connectivity network metrics.

  3. Challenges of Integrating NASA's Space Communications Networks

    Science.gov (United States)

    Reinert, Jessica; Barnes, Patrick

    2013-01-01

    The transition to new technology, innovative ideas, and resistance to change is something that every industry experiences. Recent examples of this shift are changing to using robots in the assembly line construction of automobiles or the increasing use of robotics for medical procedures. Most often this is done with cost-reduction in mind, though ease of use for the customer is also a driver. All industries experience the push to increase efficiency of their systems; National Aeronautics and Space Administration (NASA) and the commercial space industry are no different. NASA space communication services are provided by three separately designed, developed, maintained, and operated communications networks known as the Deep Space Network (DSN), Near Earth Network (NEN) and Space Network (SN). The Space Communications and Navigation (SCaN) Program is pursuing integration of these networks and has performed a variety of architecture trade studies to determine what integration options would be the most effective in achieving a unified user mission support organization, and increase the use of common operational equipment and processes. The integration of multiple, legacy organizations and existing systems has challenges ranging from technical to cultural. The existing networks are the progeny of the very first communication and tracking capabilities implemented by NASA and the Jet Propulsion Laboratory (JPL) more than 50 years ago and have been customized to the needs of their respective user mission base. The technical challenges to integrating the networks are many, though not impossible to overcome. The three distinct networks provide the same types of services, with customizable data rates, bandwidth, frequencies, and so forth. The differences across the networks have occurred in effort to satisfy their user missions' needs. Each new requirement has made the networks more unique and harder to integrate. The cultural challenges, however, have proven to be a

  4. Challenges of Integrating NASAs Space Communication Networks

    Science.gov (United States)

    Reinert, Jessica M.; Barnes, Patrick

    2013-01-01

    The transition to new technology, innovative ideas, and resistance to change is something that every industry experiences. Recent examples of this shift are changing to using robots in the assembly line construction of automobiles or the increasing use of robotics for medical procedures. Most often this is done with cost-reduction in mind, though ease of use for the customer is also a driver. All industries experience the push to increase efficiency of their systems; National Aeronautics and Space Administration (NASA) and the commercial space industry are no different. NASA space communication services are provided by three separately designed, developed, maintained, and operated communications networks known as the Deep Space Network (DSN), Near Earth Network (NEN) and Space Network (SN). The Space Communications and Navigation (SCaN) Program is pursuing integration of these networks and has performed a variety of architecture trade studies to determine what integration options would be the most effective in achieving a unified user mission support organization, and increase the use of common operational equipment and processes. The integration of multiple, legacy organizations and existing systems has challenges ranging from technical to cultural. The existing networks are the progeny of the very first communication and tracking capabilities implemented by NASA and the Jet Propulsion Laboratory (JPL) more than 50 years ago and have been customized to the needs of their respective user mission base. The technical challenges to integrating the networks are many, though not impossible to overcome. The three distinct networks provide the same types of services, with customizable data rates, bandwidth, frequencies, and so forth. The differences across the networks have occurred in effort to satisfy their user missions' needs. Each new requirement has made the networks more unique and harder to integrate. The cultural challenges, however, have proven to be a

  5. 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...

  6. 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.

  7. System Design for Nano-Network Communications

    Science.gov (United States)

    ShahMohammadian, Hoda

    The potential applications of nanotechnology in a wide range of areas necessities nano-networking research. Nano-networking is a new type of networking which has emerged by applying nanotechnology to communication theory. Therefore, this dissertation presents a framework for physical layer communications in a nano-network and addresses some of the pressing unsolved challenges in designing a molecular communication system. The contribution of this dissertation is proposing well-justified models for signal propagation, noise sources, optimum receiver design and synchronization in molecular communication channels. The design of any communication system is primarily based on the signal propagation channel and noise models. Using the Brownian motion and advection molecular statistics, separate signal propagation and noise models are presented for diffusion-based and flow-based molecular communication channels. It is shown that the corrupting noise of molecular channels is uncorrelated and non-stationary with a signal dependent magnitude. The next key component of any communication system is the reception and detection process. This dissertation provides a detailed analysis of the effect of the ligand-receptor binding mechanism on the received signal, and develops the first optimal receiver design for molecular communications. The bit error rate performance of the proposed receiver is evaluated and the impact of medium motion on the receiver performance is investigated. Another important feature of any communication system is synchronization. In this dissertation, the first blind synchronization algorithm is presented for the molecular communication channels. The proposed algorithm uses a non-decision directed maximum likelihood criterion for estimating the channel delay. The Cramer-Rao lower bound is also derived and the performance of the proposed synchronization algorithm is evaluated by investigating its mean square error.

  8. Networking for English Literature Class: Cooperative Learning in Chinese Context

    Science.gov (United States)

    Li, Huiyin

    2017-01-01

    This action research was conducted to investigate the efficacy of networking, an adjusted cooperative learning method employed in an English literature class for non-English majors in China. Questionnaire was administered online anonymously to college students after a 14-week cooperative learning in literature class in a Chinese university, aiming…

  9. 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...

  10. Nobelist TD LEE Scientist Cooperation Network and Scientist Innovation Ability Model

    OpenAIRE

    Fang, Jin-Qing; Liu, Qiang

    2013-01-01

    Nobelist TD Lee scientist cooperation network (TDLSCN) and their innovation ability are studied. It is found that the TDLSCN not only has the common topological properties both of scale-free and small-world for a general scientist cooperation networks, but also appears the creation multiple-peak phenomenon for number of published paper with year evolution, which become Nobelist TD Lee’s significant mark distinguished from other scientists. This new phenomenon has not been revealed in the scie...

  11. Communication, advice exchange and job satisfaction of nursing staff: a social network analyses of 35 long-term care units.

    Science.gov (United States)

    van Beek, Adriana P A; Wagner, Cordula; Spreeuwenberg, Peter P M; Frijters, Dinnus H M; Ribbe, Miel W; Groenewegen, Peter P

    2011-06-01

    The behaviour of individuals is affected by the social networks in which they are embedded. Networks are also important for the diffusion of information and the influence of employees in organisations. Yet, at the moment little is known about the social networks of nursing staff in healthcare settings. This is the first study that investigates informal communication and advice networks of nursing staff in long-term care. We examine the structure of the networks, how they are related to the size of units and characteristics of nursing staff, and their relationship with job satisfaction. We collected social network data of 380 nursing staff of 35 units in group projects and psychogeriatric units in nursing homes and residential homes in the Netherlands. Communication and advice networks were analyzed in a social network application (UCINET), focusing on the number of contacts (density) between nursing staff on the units. We then studied the correlation between the density of networks, size of the units and characteristics of nursing staff. We used multilevel analyses to investigate the relationship between social networks and job satisfaction of nursing staff, taking characteristics of units and nursing staff into account. Both communication and advice networks were negatively related to the number of residents and the number of nursing staff of the units. Communication and advice networks were more dense when more staff worked part-time. Furthermore, density of communication networks was positively related to the age of nursing staff of the units. Multilevel analyses showed that job satisfaction differed significantly between individual staff members and units and was influenced by the number of nursing staff of the units. However, this relationship disappeared when density of communication networks was added to the model. Overall, communication and advice networks of nursing staff in long-term care are relatively dense. This fits with the high level of cooperation

  12. Cooperative and cognitive satellite systems

    CERN Document Server

    Chatzinotas, Symeon; De Gaudenzi, Riccardo

    2015-01-01

    Cooperative and Cognitive Satellite Systems provides a solid overview of the current research in the field of cooperative and cognitive satellite systems, helping users understand how to incorporate state-of-the-art communication techniques in innovative satellite network architectures to enable the next generation of satellite systems. The book is edited and written by top researchers and practitioners in the field, providing a comprehensive explanation of current research that allows users to discover future technologies and their applications, integrate satellite and terrestrial systems

  13. Effects of Cooperative Learning STAD on Mathematical Communication Ability of Elementary School Student

    Science.gov (United States)

    Maelasari, E.; Wahyudin

    2017-09-01

    The aim of this study is to describe the increasing of mathematical communications capability, and difference between students who get STAD cooperative learning and students who receive Direct Instruction. This study is a quasi-experimental study with pretest posttest study design. Subjects in this study in one of the fifth grade elementary school located in Cibeureum District, Kuningan. The research instrument used was a written test mathematical communication skills. The results showed that the improvement of mathematical communication capabilities Direct Instruction students who scored significantly better than students who learned with STAD cooperative learning. By grouping according to the ability of students will show a positive impact on student achievement in the classroom.

  14. Topology design and performance analysis of an integrated communication network

    Science.gov (United States)

    Li, V. O. K.; Lam, Y. F.; Hou, T. C.; Yuen, J. H.

    1985-01-01

    A research study on the topology design and performance analysis for the Space Station Information System (SSIS) network is conducted. It is begun with a survey of existing research efforts in network topology design. Then a new approach for topology design is presented. It uses an efficient algorithm to generate candidate network designs (consisting of subsets of the set of all network components) in increasing order of their total costs, and checks each design to see if it forms an acceptable network. This technique gives the true cost-optimal network, and is particularly useful when the network has many constraints and not too many components. The algorithm for generating subsets is described in detail, and various aspects of the overall design procedure are discussed. Two more efficient versions of this algorithm (applicable in specific situations) are also given. Next, two important aspects of network performance analysis: network reliability and message delays are discussed. A new model is introduced to study the reliability of a network with dependent failures. For message delays, a collection of formulas from existing research results is given to compute or estimate the delays of messages in a communication network without making the independence assumption. The design algorithm coded in PASCAL is included as an appendix.

  15. 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.

  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. Wavelet-Coded OFDM for Next Generation Mobile Communications

    DEFF Research Database (Denmark)

    Cavalcante, Lucas Costa Pereira; Vegas Olmos, Juan José; Tafur Monroy, Idelfonso

    2016-01-01

    In this work, we evaluate the performance of Wavelet-Coding into offering robustness for OFDM signals against the combined effects of varying fading and noise bursts. Wavelet-Code enables high diversity gains with a low complex receiver, and, most notably, without compromising the system’s spectr......-wave frequencies in future generation mobile communication due to its robustness against multipath fading....

  18. Reliability Analysis Techniques for Communication Networks in Nuclear Power Plant

    International Nuclear Information System (INIS)

    Lim, T. J.; Jang, S. C.; Kang, H. G.; Kim, M. C.; Eom, H. S.; Lee, H. J.

    2006-09-01

    The objectives of this project is to investigate and study existing reliability analysis techniques for communication networks in order to develop reliability analysis models for nuclear power plant's safety-critical networks. It is necessary to make a comprehensive survey of current methodologies for communication network reliability. Major outputs of this study are design characteristics of safety-critical communication networks, efficient algorithms for quantifying reliability of communication networks, and preliminary models for assessing reliability of safety-critical communication networks

  19. Polar Cooperative Navigation Algorithm for Multi-Unmanned Underwater Vehicles Considering Communication Delays

    Directory of Open Access Journals (Sweden)

    Zheping Yan

    2018-03-01

    Full Text Available To solve the navigation accuracy problems of multi-Unmanned Underwater Vehicles (multi-UUVs in the polar region, a polar cooperative navigation algorithm for multi-UUVs considering communication delays is proposed in this paper. UUVs are important pieces of equipment in ocean engineering for marine development. For UUVs to complete missions, precise navigation is necessary. It is difficult for UUVs to establish true headings because of the rapid convergence of Earth meridians and the severe polar environment. Based on the polar grid navigation algorithm, UUV navigation in the polar region can be accomplished with the Strapdown Inertial Navigation System (SINS in the grid frame. To save costs, a leader-follower type of system is introduced in this paper. The leader UUV helps the follower UUVs to achieve high navigation accuracy. Follower UUVs correct their own states based on the information sent by the leader UUV and the relative position measured by ultra-short baseline (USBL acoustic positioning. The underwater acoustic communication delay is quantized by the model. In this paper, considering underwater acoustic communication delay, the conventional adaptive Kalman filter (AKF is modified to adapt to polar cooperative navigation. The results demonstrate that the polar cooperative navigation algorithm for multi-UUVs that considers communication delays can effectively navigate the sailing of multi-UUVs in the polar region.

  20. Relevant Factors for Establishing Inter-firm Cooperation Networks in Rio Grande do Sul

    Directory of Open Access Journals (Sweden)

    Jorge Renato Verschoore

    2008-10-01

    Full Text Available The cooperation among firms in a network form has been stressed as an alternative organizational configuration in response to recent economic transformation. The increased number of initiatives and the empirical research scarcity on the network formation in Brazil motivated the present study. The main objective of this paper is to comprehend the factors which effect the establishment of network cooperation in the Southern Brazilian context. In order to achieve this objective a quantitative research was carried out with 443 enterprise representatives, associated to 120 cooperation networks. The empirical data were collected by the researchers in 2005 and statistically processed through a conjoint analysis. The results confirmed the theoretical propositions built by the researchers,appointing the relevance of factors, such as learning and innovation, increased scale and market power, and access to solutions.