Device-Relaying in Cellular D2D Networks: A Fairness Perspective

KAUST Repository

Chaaban, Anas; Sezgin, Aydin

2015-01-01

Device-to-Device (D2D) communication is envisioned to play a key role in 5G networks as a technique for meeting the demand for high data rates. In a cellular network, D2D allows not only direct communication between users, but also device relaying. In this paper, a simple instance of device-relaying is investigated, and its impact on fairness among users is studied. Namely, a cellular network consisting of two D2D-enabled users and a base-station (BS) is considered. Thus, the users who want to establish communication with the BS can act as relays for each other’s signals. While this problem is traditionally considered in the literature as a multiple-access channel with cooperation in the uplink, and a broadcast channel with cooperation in the downlink, we propose a different treatment of the problem as a multi-way channel. A simple communication scheme is proposed, and is shown to achieve significant gain in terms of fairness (measured by the symmetric rate supported) in comparison to the aforementioned traditional treatment.

Dynamic spectrum management in green cognitive radio cellular networks

KAUST Repository

Sboui, Lokman

2018-02-15

In this paper, we propose a new cellular network operation scheme fulfilling the 5G requirements related to spectrum management and green communications. We focus on cognitive radio cellular networks in which both the primary network (PN) and the secondary network (SN) are maximizing their operational profits. The PN and the SN are required to respect a CO emissions threshold by switching off one or more lightly loaded base stations (BSs). In addition, the PN accepts to cooperate with the SN by leasing its spectrum in the cells where the PN is turned off. In return, the corresponding SN BSs host the PN users and impose extra roaming fees to the PN. We propose a low-complexity algorithm that maximizes the profit per CO emissions metric while switching on/off the BSs. In the simulations, we show that our proposed algorithm achieves performances close to the exhaustive search method. In addition, we find that the roaming price is a key parameter that affects both PN and SN profits.

Radio resource management for mobile traffic offloading in heterogeneous cellular networks

CERN Document Server

Wu, Yuan; Huang, Jianwei; Shen, Xuemin (Sherman)

2017-01-01

This SpringerBrief offers two concrete design examples for traffic offloading. The first is an optimal resource allocation for small-cell based traffic offloading that aims at minimizing mobile users’ data cost. The second is an optimal resource allocation for device-to-device assisted traffic offloading that also minimizes the total energy consumption and cellular link usage (while providing an overview of the challenging issues). Both examples illustrate the importance of proper resource allocation to the success of traffic offloading, show the consequent performance advantages of executing optimal resource allocation, and present the methodologies to achieve the corresponding optimal offloading solution for traffic offloading in heterogeneous cellular networks. The authors also include an overview of heterogeneous cellular networks and explain different traffic offloading paradigms ranging from uplink traffic offloading through small cells to downlink traffic offloading via mobile device-to-device cooper...

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

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

Outage analysis of selective cooperation in underlay cognitive networks with fixed gain relays and primary interference modeling

KAUST Repository

Hussain, Syed Imtiaz

2012-09-01

Selective cooperation is a well investigated technique in non-cognitive networks for efficient spectrum utilization and performance improvement. However, it is still a nascent topic for underlay cognitive networks. Recently, it was investigated for underlay networks where the secondary nodes were able to adapt their transmit power to always satisfy the interference threshold to the primary users. This is a valid assumption for cellular networks but many non-cellular devices have fixed transmit powers. In this situation, selective cooperation poses a more challenging problem and performs entirely differently. In this paper, we extend our previous work of selective cooperation based on either hop\\'s signal to noise ratio (SNR) with fixed gain and fixed transmit power relays in an underlay cognitive network. This work lacked in considering the primary interference over the cognitive network and presented a rather idealistic analysis. This paper deals with a more realistic system model and includes the effects of primary interference on the secondary transmission. We first derive end-to-end signal to interference and noise ratio (SINR) expression and the related statistics for a dual-hop relay link using asymptotic and approximate approaches. We then derive the statistics of the selected relay link based on maximum end-to-end SINR among the relays satisfying the interference threshold to the primary user. Using this statistics, we derive closed form asymptotic and approximate expressions for the outage probability of the system. Analytical results are verified through simulations. It is concluded that selective cooperation in underlay cognitive networks performs better only in low to medium SNR regions. © 2012 IEEE.

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

Estimating cellular network performance during hurricanes

International Nuclear Information System (INIS)

Booker, Graham; Torres, Jacob; Guikema, Seth; Sprintson, Alex; Brumbelow, Kelly

2010-01-01

Cellular networks serve a critical role during and immediately after a hurricane, allowing citizens to contact emergency services when land-line communication is lost and serving as a backup communication channel for emergency responders. However, due to their ubiquitous deployment and limited design for extreme loading events, basic network elements, such as cellular towers and antennas are prone to failures during adverse weather conditions such as hurricanes. Accordingly, a systematic and computationally feasible approach is required for assessing and improving the reliability of cellular networks during hurricanes. In this paper we develop a new multi-disciplinary approach to efficiently and accurately assess cellular network reliability during hurricanes. We show how the performance of a cellular network during and immediately after future hurricanes can be estimated based on a combination of hurricane wind field models, structural reliability analysis, Monte Carlo simulation, and cellular network models and simulation tools. We then demonstrate the use of this approach for assessing the improvement in system reliability that can be achieved with discrete topological changes in the system. Our results suggest that adding redundancy, particularly through a mesh topology or through the addition of an optical fiber ring around the perimeter of the system can be an effective way to significantly increase the reliability of some cellular systems during hurricanes.

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.

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

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

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

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

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

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.

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)

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.

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.

Differential and Cooperative Cell Adhesion Regulates Cellular Pattern in Sensory Epithelia.

Science.gov (United States)

Togashi, Hideru

2016-01-01

Animal tissues are composed of multiple cell types arranged in complex and elaborate patterns. In sensory epithelia, including the auditory epithelium and olfactory epithelium, different types of cells are arranged in unique mosaic patterns. These mosaic patterns are evolutionarily conserved, and are thought to be important for hearing and olfaction. Recent progress has provided accumulating evidence that the cellular pattern formation in epithelia involves cell rearrangements, movements, and shape changes. These morphogenetic processes are largely mediated by intercellular adhesion systems. Differential adhesion and cortical tension have been proposed to promote cell rearrangements. Many different types of cells in tissues express various types of cell adhesion molecules. Although cooperative mechanisms between multiple adhesive systems are likely to contribute to the production of complex cell patterns, our current understanding of the cooperative roles between multiple adhesion systems is insufficient to entirely explain the complex mechanisms underlying cellular patterning. Recent studies have revealed that nectins, in cooperation with cadherins, are crucial for the mosaic cellular patterning in sensory organs. The nectin and cadherin systems are interacted with one another, and these interactions provide cells with differential adhesive affinities for complex cellular pattern formations in sensory epithelia, which cannot be achieved by a single mechanism.

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.

Virtualized cognitive network architecture for 5G cellular networks

KAUST Repository

Elsawy, Hesham

2015-07-17

Cellular networks have preserved an application agnostic and base station (BS) centric architecture1 for decades. Network functionalities (e.g. user association) are decided and performed regardless of the underlying application (e.g. automation, tactile Internet, online gaming, multimedia). Such an ossified architecture imposes several hurdles against achieving the ambitious metrics of next generation cellular systems. This article first highlights the features and drawbacks of such architectural ossification. Then the article proposes a virtualized and cognitive network architecture, wherein network functionalities are implemented via software instances in the cloud, and the underlying architecture can adapt to the application of interest as well as to changes in channels and traffic conditions. The adaptation is done in terms of the network topology by manipulating connectivities and steering traffic via different paths, so as to attain the applications\\' requirements and network design objectives. The article presents cognitive strategies to implement some of the classical network functionalities, along with their related implementation challenges. The article further presents a case study illustrating the performance improvement of the proposed architecture as compared to conventional cellular networks, both in terms of outage probability and handover rate.

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.

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.

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

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.

Decentralized Cooperation Strategies in Two-Dimensional Traffic of Cellular Automata

International Nuclear Information System (INIS)

Fang Jun; Qin Zheng; Xu Zhaohui; Chen Xiqun; Leng Biao; Jiang Zineng

2012-01-01

We study the two-dimensional traffic of cellular automata using computer simulation. We propose two type of decentralized cooperation strategies, which are called stepping aside (CS-SA) and choosing alternative routes (CS-CAR) respectively. We introduce them into an existing two-dimensional cellular automata (CA) model. CS-SA is designed to prohibit a kind of ping-pong jump when two objects standing together try to move in opposite directions. CS-CAR is designed to change the solution of conflict in parallel update. CS-CAR encourages the objects involved in parallel conflicts choose their alternative routes instead of waiting. We also combine the two cooperation strategies (CS-SA-CAR) to test their combined effects. It is found that the system keeps on a partial jam phase with nonzero velocity and flow until the density reaches one. The ratios of the ping-pong jump and the waiting objects involved in conflict are decreased obviously, especially at the free phase. And the average flow is improved by the three cooperation strategies. Although the average travel time is lengthened a bit by CS-CAR, it is shorten by CS-SA and CS-SA-CAR. In addition, we discuss the advantage and applicability of decentralized cooperation modeling.

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.

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

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

Performance Evaluation Of Mobile Cellular Networks In Nigeria

OpenAIRE

Shoewu, O.O

2018-01-01

The aim of this paper is to evaluate the performance of mobile networks such as MTN, GLO, and ETISALAT in Nigeria and suggest ways the performance of digital cellular networks can improve to minimize some of its present short comings or limitations. This paper discusses the performance improvement of digital cellular networks. A non- CDMA cellular network is use in an overall wireless environment for the purpose of this paper. This paper also discusses the performance assessment of three mobi...

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…

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.

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.

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

Optimizing Cellular Networks Enabled with Renewal Energy via Strategic Learning.

Science.gov (United States)

Sohn, Insoo; Liu, Huaping; Ansari, Nirwan

2015-01-01

An important issue in the cellular industry is the rising energy cost and carbon footprint due to the rapid expansion of the cellular infrastructure. Greening cellular networks has thus attracted attention. Among the promising green cellular network techniques, the renewable energy-powered cellular network has drawn increasing attention as a critical element towards reducing carbon emissions due to massive energy consumption in the base stations deployed in cellular networks. Game theory is a branch of mathematics that is used to evaluate and optimize systems with multiple players with conflicting objectives and has been successfully used to solve various problems in cellular networks. In this paper, we model the green energy utilization and power consumption optimization problem of a green cellular network as a pilot power selection strategic game and propose a novel distributed algorithm based on a strategic learning method. The simulation results indicate that the proposed algorithm achieves correlated equilibrium of the pilot power selection game, resulting in optimum green energy utilization and power consumption reduction.

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.

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.

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.

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

Improving Energy Efficiency of Cooperative Femtocell Networks via Base Station Switching Off

Directory of Open Access Journals (Sweden)

Woongsup Lee

2016-01-01

Full Text Available Recently, energy efficiency (EE of cellular networks has become an important performance metric, and several techniques have been proposed to increase the EE. Among them, turning off base stations (BSs when not needed is considered as one of the most powerful techniques due to its simple operation and effectiveness. Herein, we propose a novel BS switching-off technique for cooperative femtocell networks where multiple femtocell BSs (FBSs simultaneously send packets to the same mobile station (MS. Unlike conventional schemes, cooperative operation of FBSs, also known as coordinated multipoint (CoMP transmission, is considered to determine which BSs are turned off in the proposed technique. We first formulate the optimization problem to find the optimal set of FBSs to be turned off. Then, we propose a suboptimal scheme operating in a distributed manner in order to reduce the computational complexity of the optimal scheme. The suboptimal scheme is based on throughput ratio (TR which specifies the importance of a particular FBS for the cooperative transmission. Through simulations, we show that the energy consumption can be greatly reduced with the proposed technique, compared with conventional schemes. Moreover, we show that the suboptimal scheme also achieves the near-optimal performance even without the excessive computations.

Dynamic spectrum management in green cognitive radio cellular networks

KAUST Repository

Sboui, Lokman; Ghazzai, Hakim; Rezki, Zouheir; Alouini, Mohamed-Slim

2018-01-01

In this paper, we propose a new cellular network operation scheme fulfilling the 5G requirements related to spectrum management and green communications. We focus on cognitive radio cellular networks in which both the primary network (PN

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.

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.

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.

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)

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

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

MSAT and cellular hybrid networking

Science.gov (United States)

Baranowsky, Patrick W., II

Westinghouse Electric Corporation is developing both the Communications Ground Segment and the Series 1000 Mobile Phone for American Mobile Satellite Corporation's (AMSC's) Mobile Satellite (MSAT) system. The success of the voice services portion of this system depends, to some extent, upon the interoperability of the cellular network and the satellite communication circuit switched communication channels. This paper will describe the set of user-selectable cellular interoperable modes (cellular first/satellite second, etc.) provided by the Mobile Phone and described how they are implemented with the ground segment. Topics including roaming registration and cellular-to-satellite 'seamless' call handoff will be discussed, along with the relevant Interim Standard IS-41 Revision B Cellular Radiotelecommunications Intersystem Operations and IOS-553 Mobile Station - Land Station Compatibility Specification.

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.

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.

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.

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.

Handover management in dense cellular networks: A stochastic geometry approach

KAUST Repository

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

2016-01-01

Cellular operators are continuously densifying their networks to cope with the ever-increasing capacity demand. Furthermore, an extreme densification phase for cellular networks is foreseen to fulfill the ambitious fifth generation (5G) performance requirements. Network densification improves spectrum utilization and network capacity by shrinking base stations' (BSs) footprints and reusing the same spectrum more frequently over the spatial domain. However, network densification also increases the handover (HO) rate, which may diminish the capacity gains for mobile users due to HO delays. In highly dense 5G cellular networks, HO delays may neutralize or even negate the gains offered by network densification. In this paper, we present an analytical paradigm, based on stochastic geometry, to quantify the effect of HO delay on the average user rate in cellular networks. To this end, we propose a flexible handover scheme to reduce HO delay in case of highly dense cellular networks. This scheme allows skipping the HO procedure with some BSs along users' trajectories. The performance evaluation and testing of this scheme for only single HO skipping shows considerable gains in many practical scenarios. © 2016 IEEE.

Handover management in dense cellular networks: A stochastic geometry approach

KAUST Repository

Arshad, Rabe

2016-07-26

Cellular operators are continuously densifying their networks to cope with the ever-increasing capacity demand. Furthermore, an extreme densification phase for cellular networks is foreseen to fulfill the ambitious fifth generation (5G) performance requirements. Network densification improves spectrum utilization and network capacity by shrinking base stations\\' (BSs) footprints and reusing the same spectrum more frequently over the spatial domain. However, network densification also increases the handover (HO) rate, which may diminish the capacity gains for mobile users due to HO delays. In highly dense 5G cellular networks, HO delays may neutralize or even negate the gains offered by network densification. In this paper, we present an analytical paradigm, based on stochastic geometry, to quantify the effect of HO delay on the average user rate in cellular networks. To this end, we propose a flexible handover scheme to reduce HO delay in case of highly dense cellular networks. This scheme allows skipping the HO procedure with some BSs along users\\' trajectories. The performance evaluation and testing of this scheme for only single HO skipping shows considerable gains in many practical scenarios. © 2016 IEEE.

Error performance analysis in downlink cellular networks with interference management

KAUST Repository

Afify, Laila H.; Elsawy, Hesham; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim

2015-01-01

Modeling aggregate network interference in cellular networks has recently gained immense attention both in academia and industry. While stochastic geometry based models have succeeded to account for the cellular network geometry, they mostly

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.

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.

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.

Impact of Base Station Cooperation on Cell Planning

Directory of Open Access Journals (Sweden)

Ian Dexter Garcia

2010-01-01

Full Text Available Base station cooperation (BSC has been identified as a key radio access technology for next-generation cellular networks such as LTE-Advanced. BSC impacts cell planning, which is the methodical selection of base station (BS sites, and BS equipment configuration for cost-effective cellular networks. In this paper, the impact of BSC on cell plan parameters (coverage, traffic, handover, and cost, as well as additional cell planning steps required for BSC are discussed. Results show that BSC maximizes its gains over noncooperation (NC in a network wherein interference from cooperating BSs is the main limitation. Locations exist where NC may produce higher throughputs, therefore dynamic or semistatic switching between BSC and NC, called fractional BSC, is recommended. Because of interference from noncooperating BSs, the gains of BSC over NC are upper bounded, and diminishes at greater intersite distances because of noise. This encourages smaller cell sizes, higher transmit powers, and dynamic clustering of cooperative BSs.

Image Encryption and Chaotic Cellular Neural Network

Science.gov (United States)

Peng, Jun; Zhang, Du

Machine learning has been playing an increasingly important role in information security and assurance. One of the areas of new applications is to design cryptographic systems by using chaotic neural network due to the fact that chaotic systems have several appealing features for information security applications. In this chapter, we describe a novel image encryption algorithm that is based on a chaotic cellular neural network. We start by giving an introduction to the concept of image encryption and its main technologies, and an overview of the chaotic cellular neural network. We then discuss the proposed image encryption algorithm in details, which is followed by a number of security analyses (key space analysis, sensitivity analysis, information entropy analysis and statistical analysis). The comparison with the most recently reported chaos-based image encryption algorithms indicates that the algorithm proposed in this chapter has a better security performance. Finally, we conclude the chapter with possible future work and application prospects of the chaotic cellular neural network in other information assurance and security areas.

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.

Fashion, Cooperation, and Social Interactions

Science.gov (United States)

Cao, Zhigang; Gao, Haoyu; Qu, Xinglong; Yang, Mingmin; Yang, Xiaoguang

2013-01-01

Fashion plays such a crucial rule in the evolution of culture and society that it is regarded as a second nature to the human being. Also, its impact on economy is quite nontrivial. On what is fashionable, interestingly, there are two viewpoints that are both extremely widespread but almost opposite: conformists think that what is popular is fashionable, while rebels believe that being different is the essence. Fashion color is fashionable in the first sense, and Lady Gaga in the second. We investigate a model where the population consists of the afore-mentioned two groups of people that are located on social networks (a spatial cellular automata network and small-world networks). This model captures two fundamental kinds of social interactions (coordination and anti-coordination) simultaneously, and also has its own interest to game theory: it is a hybrid model of pure competition and pure cooperation. This is true because when a conformist meets a rebel, they play the zero sum matching pennies game, which is pure competition. When two conformists (rebels) meet, they play the (anti-) coordination game, which is pure cooperation. Simulation shows that simple social interactions greatly promote cooperation: in most cases people can reach an extraordinarily high level of cooperation, through a selfish, myopic, naive, and local interacting dynamic (the best response dynamic). We find that degree of synchronization also plays a critical role, but mostly on the negative side. Four indices, namely cooperation degree, average satisfaction degree, equilibrium ratio and complete ratio, are defined and applied to measure people’s cooperation levels from various angles. Phase transition, as well as emergence of many interesting geographic patterns in the cellular automata network, is also observed. PMID:23382799

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.

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.

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)

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.

Cooperative beamforming for dual-hop amplify-and-forward multi-antenna relaying cellular networks

KAUST Repository

Xing, Chengwen; Ma, Shaodan; Xia, Minghua; Wu, Yikchung

2012-01-01

In this paper, linear beamforming design for amplify-and-forward relaying cellular networks is considered, in which base station, relay station and mobile terminals are all equipped with multiple antennas. The design is based on minimum mean-square-error criterion, and both uplink and downlink scenarios are considered. It is found that the downlink and uplink beamforming design problems are in the same form, and iterative algorithms with the same structure can be used to solve the design problems. For the specific cases of fully loaded or overloaded uplink systems, a novel algorithm is derived and its relationships with several existing beamforming design algorithms for conventional MIMO or multiuser systems are revealed. Simulation results are presented to demonstrate the performance advantage of the proposed design algorithms. © 2012 Published by Elsevier B.V. All rights reserved.

Cooperative beamforming for dual-hop amplify-and-forward multi-antenna relaying cellular networks

KAUST Repository

Xing, Chengwen

2012-11-01

In this paper, linear beamforming design for amplify-and-forward relaying cellular networks is considered, in which base station, relay station and mobile terminals are all equipped with multiple antennas. The design is based on minimum mean-square-error criterion, and both uplink and downlink scenarios are considered. It is found that the downlink and uplink beamforming design problems are in the same form, and iterative algorithms with the same structure can be used to solve the design problems. For the specific cases of fully loaded or overloaded uplink systems, a novel algorithm is derived and its relationships with several existing beamforming design algorithms for conventional MIMO or multiuser systems are revealed. Simulation results are presented to demonstrate the performance advantage of the proposed design algorithms. © 2012 Published by Elsevier B.V. All rights reserved.

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

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

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.

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

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

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

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

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.

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.

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

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

Modeling and Analysis of Cellular Networks using Stochastic Geometry: A Tutorial

KAUST Repository

Elsawy, Hesham; Salem, Ahmed Sultan; Alouini, Mohamed-Slim; Win, Moe Z.

2016-01-01

This paper presents a tutorial on stochastic geometry (SG) based analysis for cellular networks. This tutorial is distinguished by its depth with respect to wireless communication details and its focus on cellular networks. The paper starts by modeling and analyzing the baseband interference in a baseline single-tier downlink cellular network with single antenna base stations and universal frequency reuse. Then, it characterizes signal-to-interference-plus-noise-ratio (SINR) and its related performance metrics. In particular, a unified approach to conduct error probability, outage probability, and transmission rate analysis is presented. Although the main focus of the paper is on cellular networks, the presented unified approach applies for other types of wireless networks that impose interference protection around receivers. The paper then extends the unified approach to capture cellular network characteristics (e.g., frequency reuse, multiple antenna, power control, etc.). It also presents numerical examples associated with demonstrations and discussions. To this end, the paper highlights the state-of-the- art research and points out future research directions.

Modeling and Analysis of Cellular Networks using Stochastic Geometry: A Tutorial

KAUST Repository

Elsawy, Hesham

2016-11-03

This paper presents a tutorial on stochastic geometry (SG) based analysis for cellular networks. This tutorial is distinguished by its depth with respect to wireless communication details and its focus on cellular networks. The paper starts by modeling and analyzing the baseband interference in a baseline single-tier downlink cellular network with single antenna base stations and universal frequency reuse. Then, it characterizes signal-to-interference-plus-noise-ratio (SINR) and its related performance metrics. In particular, a unified approach to conduct error probability, outage probability, and transmission rate analysis is presented. Although the main focus of the paper is on cellular networks, the presented unified approach applies for other types of wireless networks that impose interference protection around receivers. The paper then extends the unified approach to capture cellular network characteristics (e.g., frequency reuse, multiple antenna, power control, etc.). It also presents numerical examples associated with demonstrations and discussions. To this end, the paper highlights the state-of-the- art research and points out future research directions.

Tension and robustness in multitasking cellular networks.

Directory of Open Access Journals (Sweden)

Jeffrey V Wong

Full Text Available Cellular networks multitask by exhibiting distinct, context-dependent dynamics. However, network states (parameters that generate a particular dynamic are often sub-optimal for others, defining a source of "tension" between them. Though multitasking is pervasive, it is not clear where tension arises, what consequences it has, and how it is resolved. We developed a generic computational framework to examine the source and consequences of tension between pairs of dynamics exhibited by the well-studied RB-E2F switch regulating cell cycle entry. We found that tension arose from task-dependent shifts in parameters associated with network modules. Although parameter sets common to distinct dynamics did exist, tension reduced both their accessibility and resilience to perturbation, indicating a trade-off between "one-size-fits-all" solutions and robustness. With high tension, robustness can be preserved by dynamic shifting of modules, enabling the network to toggle between tasks, and by increasing network complexity, in this case by gene duplication. We propose that tension is a general constraint on the architecture and operation of multitasking biological networks. To this end, our work provides a framework to quantify the extent of tension between any network dynamics and how it affects network robustness. Such analysis would suggest new ways to interfere with network elements to elucidate the design principles of cellular networks.

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.

Modeling integrated cellular machinery using hybrid Petri-Boolean networks.

Directory of Open Access Journals (Sweden)

Natalie Berestovsky

Full Text Available The behavior and phenotypic changes of cells are governed by a cellular circuitry that represents a set of biochemical reactions. Based on biological functions, this circuitry is divided into three types of networks, each encoding for a major biological process: signal transduction, transcription regulation, and metabolism. This division has generally enabled taming computational complexity dealing with the entire system, allowed for using modeling techniques that are specific to each of the components, and achieved separation of the different time scales at which reactions in each of the three networks occur. Nonetheless, with this division comes loss of information and power needed to elucidate certain cellular phenomena. Within the cell, these three types of networks work in tandem, and each produces signals and/or substances that are used by the others to process information and operate normally. Therefore, computational techniques for modeling integrated cellular machinery are needed. In this work, we propose an integrated hybrid model (IHM that combines Petri nets and Boolean networks to model integrated cellular networks. Coupled with a stochastic simulation mechanism, the model simulates the dynamics of the integrated network, and can be perturbed to generate testable hypotheses. Our model is qualitative and is mostly built upon knowledge from the literature and requires fine-tuning of very few parameters. We validated our model on two systems: the transcriptional regulation of glucose metabolism in human cells, and cellular osmoregulation in S. cerevisiae. The model produced results that are in very good agreement with experimental data, and produces valid hypotheses. The abstract nature of our model and the ease of its construction makes it a very good candidate for modeling integrated networks from qualitative data. The results it produces can guide the practitioner to zoom into components and interconnections and investigate them

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

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.

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.

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.

Increasing cellular coverage within integrated terrestrial/satellite mobile networks

Science.gov (United States)

Castro, Jonathan P.

1995-01-01

When applying the hierarchical cellular concept, the satellite acts as giant umbrella cell covering a region with some terrestrial cells. If a mobile terminal traversing the region arrives to the border-line or limits of a regular cellular ground service, network transition occurs and the satellite system continues the mobile coverage. To adequately assess the boundaries of service of a mobile satellite system an a cellular network within an integrated environment, this paper provides an optimized scheme to predict when a network transition may be necessary. Under the assumption of a classified propagation phenomenon and Lognormal shadowing, the study applies an analytical approach to estimate the location of a mobile terminal based on a reception of the signal strength emitted by a base station.

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.

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

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.

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.

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,…

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

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

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

Cooperative decoding in femtocell networks: Performance-complexity tradeoff

KAUST Repository

Benkhelifa, Fatma

2012-06-01

Femtocells, which are low cost low power, stand alone cellular access points, are a potential solution to provide good indoor coverage with high data rate. However, the femtocell deployment may also increase the co-channel interference (CCI) by reducing the distance reuse of the spectrum. In this paper, we introduce methods to cancel out the interference among the femtocells while considering that macrocells operate orthogonally to the femtocells. The femtocells may also cooperate through joint detection of the received signal and improve the overall error performance at the expense of an increased computational complexity. In this paper, the performance-complexity tradeoff of cooperative detection is investigated for uplink transmissions. Numerical results show that the cooperative detection gain may reach 10 dB at a Bit-Error Rate (BER) of 10 -2 when compared to the case without cooperation. © 2012 IEEE.

Cooperative decoding in femtocell networks: Performance-complexity tradeoff

KAUST Repository

Benkhelifa, Fatma; Rezki, Zouheir; Alouini, Mohamed-Slim

2012-01-01

Femtocells, which are low cost low power, stand alone cellular access points, are a potential solution to provide good indoor coverage with high data rate. However, the femtocell deployment may also increase the co-channel interference (CCI) by reducing the distance reuse of the spectrum. In this paper, we introduce methods to cancel out the interference among the femtocells while considering that macrocells operate orthogonally to the femtocells. The femtocells may also cooperate through joint detection of the received signal and improve the overall error performance at the expense of an increased computational complexity. In this paper, the performance-complexity tradeoff of cooperative detection is investigated for uplink transmissions. Numerical results show that the cooperative detection gain may reach 10 dB at a Bit-Error Rate (BER) of 10 -2 when compared to the case without cooperation. © 2012 IEEE.

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

Methods for the Analysis of Protein Phosphorylation-Mediated Cellular Signaling Networks

Science.gov (United States)

White, Forest M.; Wolf-Yadlin, Alejandro

2016-06-01

Protein phosphorylation-mediated cellular signaling networks regulate almost all aspects of cell biology, including the responses to cellular stimulation and environmental alterations. These networks are highly complex and comprise hundreds of proteins and potentially thousands of phosphorylation sites. Multiple analytical methods have been developed over the past several decades to identify proteins and protein phosphorylation sites regulating cellular signaling, and to quantify the dynamic response of these sites to different cellular stimulation. Here we provide an overview of these methods, including the fundamental principles governing each method, their relative strengths and weaknesses, and some examples of how each method has been applied to the analysis of complex signaling networks. When applied correctly, each of these techniques can provide insight into the topology, dynamics, and regulation of protein phosphorylation signaling networks.

Full-Duplex Communications in Large-Scale Cellular Networks

KAUST Repository

Alammouri, Ahmad

2016-01-01

/downlink interference. This thesis presents a tractable framework, based on stochastic geometry, to study FD communications in multi-tier cellular networks. Particularly, we assess the FD communications effect on the network performance and quantify the associated gains

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.

Cellular image segmentation using n-agent cooperative game theory

Science.gov (United States)

Dimock, Ian B.; Wan, Justin W. L.

2016-03-01

Image segmentation is an important problem in computer vision and has significant applications in the segmentation of cellular images. Many different imaging techniques exist and produce a variety of image properties which pose difficulties to image segmentation routines. Bright-field images are particularly challenging because of the non-uniform shape of the cells, the low contrast between cells and background, and imaging artifacts such as halos and broken edges. Classical segmentation techniques often produce poor results on these challenging images. Previous attempts at bright-field imaging are often limited in scope to the images that they segment. In this paper, we introduce a new algorithm for automatically segmenting cellular images. The algorithm incorporates two game theoretic models which allow each pixel to act as an independent agent with the goal of selecting their best labelling strategy. In the non-cooperative model, the pixels choose strategies greedily based only on local information. In the cooperative model, the pixels can form coalitions, which select labelling strategies that benefit the entire group. Combining these two models produces a method which allows the pixels to balance both local and global information when selecting their label. With the addition of k-means and active contour techniques for initialization and post-processing purposes, we achieve a robust segmentation routine. The algorithm is applied to several cell image datasets including bright-field images, fluorescent images and simulated images. Experiments show that the algorithm produces good segmentation results across the variety of datasets which differ in cell density, cell shape, contrast, and noise levels.

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.

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.

Energy management in wireless cellular and ad-hoc networks

CERN Document Server

Imran, Muhammad; Qaraqe, Khalid; Alouini, Mohamed-Slim; Vasilakos, Athanasios

2016-01-01

This book investigates energy management approaches for energy efficient or energy-centric system design and architecture and presents end-to-end energy management in the recent heterogeneous-type wireless network medium. It also considers energy management in wireless sensor and mesh networks by exploiting energy efficient transmission techniques and protocols. and explores energy management in emerging applications, services and engineering to be facilitated with 5G networks such as WBANs, VANETS and Cognitive networks. A special focus of the book is on the examination of the energy management practices in emerging wireless cellular and ad hoc networks. Considering the broad scope of energy management in wireless cellular and ad hoc networks, this book is organized into six sections covering range of Energy efficient systems and architectures; Energy efficient transmission and techniques; Energy efficient applications and services. .

Discrete dynamic modeling of cellular signaling networks.

Science.gov (United States)

Albert, Réka; Wang, Rui-Sheng

2009-01-01

Understanding signal transduction in cellular systems is a central issue in systems biology. Numerous experiments from different laboratories generate an abundance of individual components and causal interactions mediating environmental and developmental signals. However, for many signal transduction systems there is insufficient information on the overall structure and the molecular mechanisms involved in the signaling network. Moreover, lack of kinetic and temporal information makes it difficult to construct quantitative models of signal transduction pathways. Discrete dynamic modeling, combined with network analysis, provides an effective way to integrate fragmentary knowledge of regulatory interactions into a predictive mathematical model which is able to describe the time evolution of the system without the requirement for kinetic parameters. This chapter introduces the fundamental concepts of discrete dynamic modeling, particularly focusing on Boolean dynamic models. We describe this method step-by-step in the context of cellular signaling networks. Several variants of Boolean dynamic models including threshold Boolean networks and piecewise linear systems are also covered, followed by two examples of successful application of discrete dynamic modeling in cell biology.

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

Optimized Energy Procurement for Cellular Networks with Uncertain Renewable Energy Generation

KAUST Repository

Rached, Nadhir B.; Ghazzai, Hakim; Kadri, Abdullah; Alouini, Mohamed-Slim

2017-01-01

Renewable energy (RE) is an emerging solution for reducing carbon dioxide (CO2) emissions from cellular networks. One of the challenges of using RE sources is to handle its inherent uncertainty. In this paper, a RE powered cellular network

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.

Velocity-Aware Handover Management in Two-Tier Cellular Networks

KAUST Repository

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

2017-01-01

by network densification. Hence, user mobility imposes a nontrivial challenge to harvest capacity gains via network densification. In this paper, we propose a velocity-aware HO management scheme for two-tier downlink cellular network to mitigate the HO effect

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.

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.

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

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.

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

Error performance analysis in downlink cellular networks with interference management

KAUST Repository

Afify, Laila H.

2015-05-01

Modeling aggregate network interference in cellular networks has recently gained immense attention both in academia and industry. While stochastic geometry based models have succeeded to account for the cellular network geometry, they mostly abstract many important wireless communication system aspects (e.g., modulation techniques, signal recovery techniques). Recently, a novel stochastic geometry model, based on the Equivalent-in-Distribution (EiD) approach, succeeded to capture the aforementioned communication system aspects and extend the analysis to averaged error performance, however, on the expense of increasing the modeling complexity. Inspired by the EiD approach, the analysis developed in [1] takes into consideration the key system parameters, while providing a simple tractable analysis. In this paper, we extend this framework to study the effect of different interference management techniques in downlink cellular network. The accuracy of the proposed analysis is verified via Monte Carlo simulations.

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.

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.

Assessing the implications of cellular network performance on mobile content access

DEFF Research Database (Denmark)

Kaup, Fabian; Michelinakis, Foivos; Bui, Nicola

2016-01-01

Mobile applications such as VoIP, (live) gaming, or video streaming have diverse QoS requirements ranging from low delay to high throughput. The optimization of the network quality experienced by end-users requires detailed knowledge of the expected network performance. Also, the achieved service...... of cellular network measurements, focused on analyzing root causes of mobile network performance variability. Measurements conducted on a 4G cellular network in Germany show that management and configuration decisions have a substantial impact on the performance. Specifically, it is observed...

Spectral and Energy Efficiencies in mmWave Cellular Networks for Optimal Utilization

Directory of Open Access Journals (Sweden)

Abdulbaset M. Hamed

2018-01-01

Full Text Available Millimeter wave (mmWave spectrum has been proposed for use in commercial cellular networks to relieve the already severely congested microwave spectrum. Thus, the design of an efficient mmWave cellular network has gained considerable importance and has to take into account regulations imposed by government agencies with regard to global warming and sustainable development. In this paper, a dense mmWave hexagonal cellular network with each cell consisting of a number of smaller cells with their own Base Stations (BSs is presented as a solution to meet the increasing demand for a variety of high data rate services and growing number of users of cellular networks. Since spectrum and power are critical resources in the design of such a network, a framework is presented that addresses efficient utilization of these resources in mmWave cellular networks in the 28 and 73 GHz bands. These bands are already an integral part of well-known standards such as IEEE 802.15.3c, IEEE 802.11ad, and IEEE 802.16.1. In the analysis, a well-known accurate mmWave channel model for Line of Sight (LOS and Non-Line of Sight (NLOS links is used. The cellular network is analyzed in terms of spectral efficiency, bit/s, energy efficiency, bit/J, area spectral efficiency, bit/s/m2, area energy efficiency, bit/J/m2, and network latency, s/bit. These efficiency metrics are illustrated, using Monte Carlo simulation, as a function of Signal-to-Noise Ratio (SNR, channel model parameters, user distance from BS, and BS transmission power. The efficiency metrics for optimum deployment of cellular networks in 28 and 73 GHz bands are identified. Results show that 73 GHz band achieves better spectrum efficiency and the 28 GHz band is superior in terms of energy efficiency. It is observed that while the latter band is expedient for indoor networks, the former band is appropriate for outdoor networks.

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.

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.

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

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

Selfish cellular networks and the evolution of complex organisms.

Science.gov (United States)

Kourilsky, Philippe

2012-03-01

Human gametogenesis takes years and involves many cellular divisions, particularly in males. Consequently, gametogenesis provides the opportunity to acquire multiple de novo mutations. A significant portion of these is likely to impact the cellular networks linking genes, proteins, RNA and metabolites, which constitute the functional units of cells. A wealth of literature shows that these individual cellular networks are complex, robust and evolvable. To some extent, they are able to monitor their own performance, and display sufficient autonomy to be termed "selfish". Their robustness is linked to quality control mechanisms which are embedded in and act upon the individual networks, thereby providing a basis for selection during gametogenesis. These selective processes are equally likely to affect cellular functions that are not gamete-specific, and the evolution of the most complex organisms, including man, is therefore likely to occur via two pathways: essential housekeeping functions would be regulated and evolve during gametogenesis within the parents before being transmitted to their progeny, while classical selection would operate on other traits of the organisms that shape their fitness with respect to the environment. Copyright © 2012 Académie des sciences. Published by Elsevier SAS. All rights reserved.

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.

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.

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

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

Various cellular stress components change as the rat ages: An insight into the putative overall age-related cellular stress network.

Science.gov (United States)

Cueno, Marni E; Imai, Kenichi

2018-02-01

Cellular stress is mainly comprised of oxidative, nitrosative, and endoplasmic reticulum stresses and has long been correlated to the ageing process. Surprisingly, the age-related difference among the various components in each independent stress pathway and the possible significance of these components in relation to the overall cellular stress network remain to be clearly elucidated. In this study, we obtained blood from ageing rats upon reaching 20-, 40-, and 72-wk.-old. Subsequently, we measured representative cellular stress-linked biomolecules (H 2 O 2 , glutathione reductase, heme, NADPH, NADP, nitric oxide, GADD153) and cell signals [substance P (SP), free fatty acid, calcium, NF-κB] in either or both blood serum and cytosol. Subsequently, network analysis of the overall cellular stress network was performed. Our results show that there are changes affecting stress-linked biomolecules and cell signals as the rat ages. Additionally, based on our network analysis data, we postulate that NADPH, H 2 O 2 , GADD153, and SP are the key components and the interactions between these components are central to the overall age-related cellular stress network in the rat blood. Thus, we propose that the main pathway affecting the overall age-related cellular stress network in the rat blood would entail NADPH-related oxidative stress (involving H 2 O 2 ) triggering GADD153 activation leading to SP induction which in-turn affects other cell signals. Copyright © 2017 Elsevier Inc. All rights reserved.

Path searching in switching networks using cellular algorithm

Energy Technology Data Exchange (ETDEWEB)

Koczy, L T; Langer, J; Legendi, T

1981-01-01

After a survey of the important statements in the paper A Mathematical Model of Path Searching in General Type Switching Networks (see IBID., vol.25, no.1, p.31-43, 1981) the authors consider the possible implementation for cellular automata of the algorithm introduced there. The cellular field used consists of 5 neighbour 8 state cells. Running times required by a traditional serial processor and by the cellular field, respectively, are compared. By parallel processing this running time can be reduced. 5 references.

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.

Modeling virtualized downlink cellular networks with ultra-dense small cells

KAUST Repository

Ibrahim, Hazem

2015-09-11

The unrelenting increase in the mobile users\\' populations and traffic demand drive cellular network operators to densify their infrastructure. Network densification increases the spatial frequency reuse efficiency while maintaining the signal-to-interference-plus-noise-ratio (SINR) performance, hence, increases the spatial spectral efficiency and improves the overall network performance. However, control signaling in such dense networks consumes considerable bandwidth and limits the densification gain. Radio access network (RAN) virtualization via control plane (C-plane) and user plane (U-plane) splitting has been recently proposed to lighten the control signaling burden and improve the network throughput. In this paper, we present a tractable analytical model for virtualized downlink cellular networks, using tools from stochastic geometry. We then apply the developed modeling framework to obtain design insights for virtualized RANs and quantify associated performance improvement. © 2015 IEEE.

Prediction Based Energy Balancing Forwarding in Cellular Networks

Directory of Open Access Journals (Sweden)

Yang Jian-Jun

2017-01-01

Full Text Available In the recent cellular network technologies, relay stations extend cell coverage and enhance signal strength for mobile users. However, busy traffic makes the relay stations in hot area run out of energy quickly. Energy is a very important factor in the forwarding of cellular network since mobile users(cell phones in hot cells often suffer from low throughput due to energy lack problems. In many situations, the energy lack problems take place because the energy loading is not balanced. In this paper, we present a prediction based forwarding algorithm to let a mobile node dynamically select the next relay station with highest potential energy capacity to resume communication. Key to this strategy is that a relay station only maintains three past status, and then it is able to predict the potential energy capacity. Then, the node selects the next hop with potential maximal energy. Moreover, a location based algorithm is developed to let the mobile node figure out the target region in order to avoid flooding. Simulations demonstrate that our approach significantly increase the aggregate throughput and decrease the delay in cellular network environment.

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.

Cellular network entropy as the energy potential in Waddington's differentiation landscape

Science.gov (United States)

Banerji, Christopher R. S.; Miranda-Saavedra, Diego; Severini, Simone; Widschwendter, Martin; Enver, Tariq; Zhou, Joseph X.; Teschendorff, Andrew E.

2013-01-01

Differentiation is a key cellular process in normal tissue development that is significantly altered in cancer. Although molecular signatures characterising pluripotency and multipotency exist, there is, as yet, no single quantitative mark of a cellular sample's position in the global differentiation hierarchy. Here we adopt a systems view and consider the sample's network entropy, a measure of signaling pathway promiscuity, computable from a sample's genome-wide expression profile. We demonstrate that network entropy provides a quantitative, in-silico, readout of the average undifferentiated state of the profiled cells, recapitulating the known hierarchy of pluripotent, multipotent and differentiated cell types. Network entropy further exhibits dynamic changes in time course differentiation data, and in line with a sample's differentiation stage. In disease, network entropy predicts a higher level of cellular plasticity in cancer stem cell populations compared to ordinary cancer cells. Importantly, network entropy also allows identification of key differentiation pathways. Our results are consistent with the view that pluripotency is a statistical property defined at the cellular population level, correlating with intra-sample heterogeneity, and driven by the degree of signaling promiscuity in cells. In summary, network entropy provides a quantitative measure of a cell's undifferentiated state, defining its elevation in Waddington's landscape. PMID:24154593

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

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

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

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.

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.

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.

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.

Resource allocation for phantom cellular networks: Energy efficiency vs spectral efficiency

KAUST Repository

Abdelhady, Amr Mohamed Abdelaziz; Amin, Osama; Alouini, Mohamed-Slim

2016-01-01

Multi-tier heterogeneous networks have become an essential constituent for next generation cellular networks. Mean-while, energy efficiency (EE) has been considered a critical design criterion along with the traditional spectral efficiency (SE) metric. In this context, we study power and spectrum allocation for the recently proposed two-tier network architecture known as phantom cellular networks. The optimization framework includes both EE and SE, where we propose an algorithm that finds the SE and EE resource allocation strategies for phantom cellular networks. Then, we compare the performance of both design strategies versus the number of users, and phantom cells share of the total number of available resource blocks. We aim to investigate the effect of some system parameters to achieve improved SE performance at a non-significant loss in EE performance, or vice versa. It was found that increasing phantom cells share of resource blocks decreases the SE performance loss due to EE optimization when compared with the optimized SE performance. © 2016 IEEE.

Resource allocation for phantom cellular networks: Energy efficiency vs spectral efficiency

KAUST Repository

Abdelhady, Amr M.

2016-07-26

Multi-tier heterogeneous networks have become an essential constituent for next generation cellular networks. Mean-while, energy efficiency (EE) has been considered a critical design criterion along with the traditional spectral efficiency (SE) metric. In this context, we study power and spectrum allocation for the recently proposed two-tier network architecture known as phantom cellular networks. The optimization framework includes both EE and SE, where we propose an algorithm that finds the SE and EE resource allocation strategies for phantom cellular networks. Then, we compare the performance of both design strategies versus the number of users, and phantom cells share of the total number of available resource blocks. We aim to investigate the effect of some system parameters to achieve improved SE performance at a non-significant loss in EE performance, or vice versa. It was found that increasing phantom cells share of resource blocks decreases the SE performance loss due to EE optimization when compared with the optimized SE performance. © 2016 IEEE.

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.

Uncovering the footprints of malicious traffic in cellular data networks

OpenAIRE

Raghuramu, A; Zang, H; Chuah, CN

2015-01-01

© Springer International Publishing Switzerland 2015. In this paper, we present a comprehensive characterization of malicious traffic generated by mobile devices using Deep Packet Inspection (DPI) records and security event logs from a large US based cellular provider network. Our analysis reveals that 0.17% of mobile devices in the cellular network are affected by security threats. This proportion, while small, is orders of magnitude higher than the last reported (in 2013) infection rate of ...

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.

Design and Evaluation of IP Header Compression for Cellular-Controlled P2P Networks

DEFF Research Database (Denmark)

Madsen, T.K.; Zhang, Qi; Fitzek, F.H.P.

2007-01-01

In this paper we advocate to exploit terminal cooperation to stabilize IP communication using header compression. The terminal cooperation is based on direct communication between terminals using short range communication and simultaneously being connected to the cellular service access point....... The short range link is than used to provide first aid information to heal the decompressor state of the neighboring node in case of a packet loss on the cellular link. IP header compression schemes are used to increase the spectral and power efficiency loosing robustness of the communication compared...

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.

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

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

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

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.

Design mobile satellite system architecture as an integral part of the cellular access digital network

Science.gov (United States)

Chien, E. S. K.; Marinho, J. A.; Russell, J. E., Sr.

1988-01-01

The Cellular Access Digital Network (CADN) is the access vehicle through which cellular technology is brought into the mainstream of the evolving integrated telecommunications network. Beyond the integrated end-to-end digital access and per call network services provisioning of the Integrated Services Digital Network (ISDN), the CADN engenders the added capability of mobility freedom via wireless access. One key element of the CADN network architecture is the standard user to network interface that is independent of RF transmission technology. Since the Mobile Satellite System (MSS) is envisioned to not only complement but also enhance the capabilities of the terrestrial cellular telecommunications network, compatibility and interoperability between terrestrial cellular and mobile satellite systems are vitally important to provide an integrated moving telecommunications network of the future. From a network standpoint, there exist very strong commonalities between the terrestrial cellular system and the mobile satellite system. Therefore, the MSS architecture should be designed as an integral part of the CADN. This paper describes the concept of the CADN, the functional architecture of the MSS, and the user-network interface signaling protocols.

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.

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.

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.

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

Capacity Enhancement of Uni‐directional In‐band Full‐Duplex Cellular Networks through Co‐channel Interference Cancellation

Directory of Open Access Journals (Sweden)

Hyungsik Ju

2018-03-01

Full Text Available As implementation of the in‐band full duplex (IFD transceiver becomes feasible, research interest is growing with respect to using IFD communication with cellular networks. However, the cellular network in which the IFD communication is applied inevitably suffers from an increase of the co‐channel interference (CCI due to IFD simultaneous transmission and reception. In this paper, we analyze the performance of a cellular network based on uni‐directional IFD (UD‐IFD communication, wherein an IFD base station simultaneously supports downlink and uplink transmissions of half‐duplex (HD users. In addition, a multi‐pair CCI cancellation (MP‐CCIC method combining CCIC and user pairing is proposed to improve the performance of the UD‐IFD network. Simulation results showed that, compared to a conventional HD cellular network without using CCIC, capacity gain was not obtained in the UD‐IFD cellular network. On the other hand, when applying the proposed MP‐CCIC, the capacity of the UD‐IFD cellular network greatly improved compared to that of an HD cellular network.

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

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.

Spatiotemporal Stochastic Modeling of IoT Enabled Cellular Networks: Scalability and Stability Analysis

KAUST Repository

Gharbieh, Mohammad; Elsawy, Hesham; Bader, Ahmed; Alouini, Mohamed-Slim

2017-01-01

The Internet of Things (IoT) is large-scale by nature, which is manifested by the massive number of connected devices as well as their vast spatial existence. Cellular networks, which provide ubiquitous, reliable, and efficient wireless access, will play fundamental rule in delivering the first-mile access for the data tsunami to be generated by the IoT. However, cellular networks may have scalability problems to provide uplink connectivity to massive numbers of connected things. To characterize the scalability of cellular uplink in the context of IoT networks, this paper develops a traffic-aware spatiotemporal mathematical model for IoT devices supported by cellular uplink connectivity. The developed model is based on stochastic geometry and queueing theory to account for the traffic requirement per IoT device, the different transmission strategies, and the mutual interference between the IoT devices. To this end, the developed model is utilized to characterize the extent to which cellular networks can accommodate IoT traffic as well as to assess and compare three different transmission strategies that incorporate a combination of transmission persistency, backoff, and power-ramping. The analysis and the results clearly illustrate the scalability problem imposed by IoT on cellular network and offer insights into effective scenarios for each transmission strategy.

Spatiotemporal Stochastic Modeling of IoT Enabled Cellular Networks: Scalability and Stability Analysis

KAUST Repository

Gharbieh, Mohammad

2017-05-02

The Internet of Things (IoT) is large-scale by nature, which is manifested by the massive number of connected devices as well as their vast spatial existence. Cellular networks, which provide ubiquitous, reliable, and efficient wireless access, will play fundamental rule in delivering the first-mile access for the data tsunami to be generated by the IoT. However, cellular networks may have scalability problems to provide uplink connectivity to massive numbers of connected things. To characterize the scalability of cellular uplink in the context of IoT networks, this paper develops a traffic-aware spatiotemporal mathematical model for IoT devices supported by cellular uplink connectivity. The developed model is based on stochastic geometry and queueing theory to account for the traffic requirement per IoT device, the different transmission strategies, and the mutual interference between the IoT devices. To this end, the developed model is utilized to characterize the extent to which cellular networks can accommodate IoT traffic as well as to assess and compare three different transmission strategies that incorporate a combination of transmission persistency, backoff, and power-ramping. The analysis and the results clearly illustrate the scalability problem imposed by IoT on cellular network and offer insights into effective scenarios for each transmission strategy.

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

Image processing with a cellular nonlinear network

International Nuclear Information System (INIS)

Morfu, S.

2005-01-01

A cellular nonlinear network (CNN) based on uncoupled nonlinear oscillators is proposed for image processing purposes. It is shown theoretically and numerically that the contrast of an image loaded at the nodes of the CNN is strongly enhanced, even if this one is initially weak. An image inversion can be also obtained without reconfiguration of the network whereas a gray levels extraction can be performed with an additional threshold filtering. Lastly, an electronic implementation of this CNN is presented

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.

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

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.

Proportional fair scheduling with superposition coding in a cellular cooperative relay system

DEFF Research Database (Denmark)

Kaneko, Megumi; Hayashi, Kazunori; Popovski, Petar

2013-01-01

Many works have tackled on the problem of throughput and fairness optimization in cellular cooperative relaying systems. Considering firstly a two-user relay broadcast channel, we design a scheme based on superposition coding (SC) which maximizes the achievable sum-rate under a proportional...... fairness constraint. Unlike most relaying schemes where users are allocated orthogonally, our scheme serves the two users simultaneously on the same time-frequency resource unit by superposing their messages into three SC layers. The optimal power allocation parameters of each SC layer are derived...... by analysis. Next, we consider the general multi-user case in a cellular relay system, for which we design resource allocation algorithms based on proportional fair scheduling exploiting the proposed SC-based scheme. Numerical results show that the proposed algorithms allowing simultaneous user allocation...

Cognitive resource management for heterogeneous cellular networks

CERN Document Server

Liu, Yongkang

2014-01-01

This Springer Brief focuses on cognitive resource management in heterogeneous cellular networks (Het Net) with small cell deployment for the LTE-Advanced system. It introduces the Het Net features, presents practical approaches using cognitive radio technology in accommodating small cell data relay and optimizing resource allocation and examines the effectiveness of resource management among small cells given limited coordination bandwidth and wireless channel uncertainty. The authors introduce different network characteristics of small cell, investigate the mesh of small cell access points in

Frequency Resource Sharing and Allocation Scheme Based on Coalition Formation Game in Hybrid D2D-Cellular Network

Directory of Open Access Journals (Sweden)

Qing Ou

2015-01-01

Full Text Available A distributed cooperation scheme on frequency resource sharing is proposed to improve the quality of service (QoS in device-to-device (D2D communications underlaying cellular networks. Specifically, we formulate the resource allocation problem as a coalition formation game with transferable utility, in which all users have the incentive to cooperate with some others and form a competitive group to maximize the probability of obtaining their favorite spectrum resources. Taking the cost for coalition formation into account, such as the path loss for data sharing, we prove that the core of the proposed game is empty, which shows the impossibility of grand coalition. Hence, we propose a distributed merge-and-split based coalition formation algorithm based on a new defined Max-Coalition order to effectively solve the coalition game. Compared with the exhaustive search, our algorithm has much lower computer complexity. In addition, we prove that stability and convergence of the proposed algorithm using the concept of a defection function. Finally, the simulation results show that the proposed scheme achieves a suboptimal performance in terms of network sum rate compared with the centralized optimal resource allocation scheme obtained via exhaustive search.

Radio Channel Modelling for UAV Communication over Cellular Networks

DEFF Research Database (Denmark)

Amorim, Rafhael Medeiros de; Nguyen, Huan Cong; Mogensen, Preben Elgaard

2017-01-01

The main goal of this paper is to obtain models for path loss exponents and shadowing for the radio channel between airborne Unmanned Aerial Vehicles (UAVs) and cellular networks. In this pursuit, field measurements were conducted in live LTE networks at the 800 MHz frequency band, using a commer...

Optimal Design of Gravitational Sewer Networks with General Cellular Automata

Directory of Open Access Journals (Sweden)

Mohammad Hadi Afshar

2014-05-01

Full Text Available In this paper, a Cellular Automata method is applied for the optimal design of sewer networks. The solution of sewer network optimization problems requires the determination of pipe diameters and average pipe cover depths, minimizing the total cost of the sewer network subject to operational constraints. In this paper, the network nodes and upstream and downstream pipe cover depths are considered as CA cells and cell states, respectively, and the links around each cell are taken into account as neighborhood. The proposed method is a general and flexible method for the optimization of sewer networks as it can be used to optimally design both gravity and pumped network due to the use of pipe nodal cover depths as the decision variables. The proposed method is tested against two  gravitational sewer networks and the  comparison of results with other methods such as  Genetic algorithm, Cellular Automata, Ant Colony Optimization Algorithm and Particle Swarm Optimization show the efficiency and effectiveness of the proposed method.

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.

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

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

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

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…

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

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.

Energy-Efficient Resource Allocation for Phantom Cellular Networks with Imperfect CSI

KAUST Repository

Abdelhady, Amr Mohamed Abdelaziz

2017-03-28

Multi-tier heterogeneous networks have become an essential constituent for next generation cellular networks. Meanwhile, energy efficiency (EE) has been considered a critical design criterion along with the traditional spectral efficiency (SE) metric. In this context, we study power and spectrum allocation for a two-tier phantom cellular network, The optimization framework includes both EE and SE. We consider densely deployed phantom cellular networks and model the EE optimization problem taking into consideration the inevitable interference in this setup and imperfect channel estimation impairments. To this end, we propose three resource allocation strategies aiming at optimizing this network EE performance metric. Furthermore, we investigate the effect of changing some system parameters on the performance of these strategies, such as phantom cells resource units share, number of deployed phantom cells within a macro cell , number of pilots, and the phantom cells transmission power budget. It is found that increasing the number of pilots will deteriorate the EE performance of the whole setup, while increasing phantom cells transmission power budget will not affect the EE of the whole setup significantly. In addition, we observed that it is always useful to allocate most of the network resource units to the phantom cells tier.

Energy-Efficient Resource Allocation for Phantom Cellular Networks with Imperfect CSI

KAUST Repository

Abdelhady, Amr Mohamed Abdelaziz; Amin, Osama; Alouini, Mohamed-Slim

2017-01-01

Multi-tier heterogeneous networks have become an essential constituent for next generation cellular networks. Meanwhile, energy efficiency (EE) has been considered a critical design criterion along with the traditional spectral efficiency (SE) metric. In this context, we study power and spectrum allocation for a two-tier phantom cellular network, The optimization framework includes both EE and SE. We consider densely deployed phantom cellular networks and model the EE optimization problem taking into consideration the inevitable interference in this setup and imperfect channel estimation impairments. To this end, we propose three resource allocation strategies aiming at optimizing this network EE performance metric. Furthermore, we investigate the effect of changing some system parameters on the performance of these strategies, such as phantom cells resource units share, number of deployed phantom cells within a macro cell , number of pilots, and the phantom cells transmission power budget. It is found that increasing the number of pilots will deteriorate the EE performance of the whole setup, while increasing phantom cells transmission power budget will not affect the EE of the whole setup significantly. In addition, we observed that it is always useful to allocate most of the network resource units to the phantom cells tier.

Energy Efficient Resource Allocation for Phantom Cellular Networks

KAUST Repository

Abdelhady, Amr

2016-04-01

Multi-tier heterogeneous networks have become an essential constituent for next generation cellular networks. Meanwhile, energy efficiency (EE) has been considered a critical design criterion along with the traditional spectral efficiency (SE) metric. In this context, we study power and spectrum allocation for the recently proposed two-tier network architecture known as phantom cellular networks. The optimization framework includes both EE and SE. First, we consider sparsely deployed cells experiencing negligible interference and assume perfect channel state information (CSI). For this setting, we propose an algorithm that finds the SE and EE resource allocation strategies. Then, we compare the performance of both design strategies versus number of users, and phantom cells share of the total available resource units (RUs). We aim to investigate the effect of some system parameters to achieve improved SE performance at a non-significant loss in EE performance, or vice versa. It is found that increasing phantom cells share of RUs decreases the SE performance loss due to EE optimization when compared with the optimized SE performance. Second, we consider the densely deployed phantom cellular networks and model the EE optimization problem having into consideration the inevitable interference and imperfect channel estimation. To this end, we propose three resource allocation strategies aiming at optimizing the EE performance metric of this network. Furthermore, we investigate the effect of changing some of the system parameters on the performance of the proposed strategies, such as phantom cells share of RUs, number of deployed phantom cells within a macro cell coverage, number of pilots and the maximum power available for transmission by the phantom cells BSs. It is found that increasing the number of pilots deteriorates the EE performance of the whole setup, while increasing maximum power available for phantom cells transmissions reduces the EE of the whole setup in a

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

OpenAIRE

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

2016-01-01

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

Network reliability assessment using a cellular automata approach

International Nuclear Information System (INIS)

Rocco S, Claudio M.; Moreno, Jose Ali

2002-01-01

Two cellular automata (CA) models that evaluate the s-t connectedness and shortest path in a network are presented. CA based algorithms enhance the performance of classical algorithms, since they allow a more reliable and straightforward parallel implementation resulting in a dynamic network evaluation, where changes in the connectivity and/or link costs can readily be incorporated avoiding recalculation from scratch. The paper also demonstrates how these algorithms can be applied for network reliability evaluation (based on Monte-Carlo approach) and for finding s-t path with maximal reliability

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

A Fluid Model for Performance Analysis in Cellular Networks

Directory of Open Access Journals (Sweden)

Coupechoux Marceau

2010-01-01

Full Text Available We propose a new framework to study the performance of cellular networks using a fluid model and we derive from this model analytical formulas for interference, outage probability, and spatial outage probability. The key idea of the fluid model is to consider the discrete base station (BS entities as a continuum of transmitters that are spatially distributed in the network. This model allows us to obtain simple analytical expressions to reveal main characteristics of the network. In this paper, we focus on the downlink other-cell interference factor (OCIF, which is defined for a given user as the ratio of its outer cell received power to its inner cell received power. A closed-form formula of the OCIF is provided in this paper. From this formula, we are able to obtain the global outage probability as well as the spatial outage probability, which depends on the location of a mobile station (MS initiating a new call. Our analytical results are compared to Monte Carlo simulations performed in a traditional hexagonal network. Furthermore, we demonstrate an application of the outage probability related to cell breathing and densification of cellular networks.

Comparison of neural network applications for channel assignment in cellular TDMA networks and dynamically sectored PCS networks

Science.gov (United States)

Hortos, William S.

1997-04-01

The use of artificial neural networks (NNs) to address the channel assignment problem (CAP) for cellular time-division multiple access and code-division multiple access networks has previously been investigated by this author and many others. The investigations to date have been based on a hexagonal cell structure established by omnidirectional antennas at the base stations. No account was taken of the use of spatial isolation enabled by directional antennas to reduce interference between mobiles. Any reduction in interference translates into increased capacity and consequently alters the performance of the NNs. Previous studies have sought to improve the performance of Hopfield- Tank network algorithms and self-organizing feature map algorithms applied primarily to static channel assignment (SCA) for cellular networks that handle uniformly distributed, stationary traffic in each cell for a single type of service. The resulting algorithms minimize energy functions representing interference constraint and ad hoc conditions that promote convergence to optimal solutions. While the structures of the derived neural network algorithms (NNAs) offer the potential advantages of inherent parallelism and adaptability to changing system conditions, this potential has yet to be fulfilled the CAP for emerging mobile networks. The next-generation communication infrastructures must accommodate dynamic operating conditions. Macrocell topologies are being refined to microcells and picocells that can be dynamically sectored by adaptively controlled, directional antennas and programmable transceivers. These networks must support the time-varying demands for personal communication services (PCS) that simultaneously carry voice, data and video and, thus, require new dynamic channel assignment (DCA) algorithms. This paper examines the impact of dynamic cell sectoring and geometric conditioning on NNAs developed for SCA in omnicell networks with stationary traffic to improve the metrics

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

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.

Multiuser Radio Resource Allocation for Multiservice Transmission in OFDMA-Based Cooperative Relay Networks

Directory of Open Access Journals (Sweden)

Zhang Xing

2009-01-01

Full Text Available Abstract The problem of multiservice transmission in OFDMA-based cooperative relay networks is studied comprehensively. We propose a framework to adaptively allocate power, subcarriers, and data rate in OFDMA system to maximize spectral efficiency under the constraints of satisfying multiuser multiservices' QoS requirements. Specifically, first we concentrate on the single-user scenario which considers multiservice transmission in point-to-point cooperative relay network. Based on the analysis of single-user scenario, we extend the multiservice transmission to multiuser point-to-multipoint scenario. Next, based on the framework, we propose several suboptimal radio resource allocation algorithms for multiservice transmissions in OFDMA-based cooperative relay networks to further reduce the computational complexity. Simulation results show that the proposed algorithms yield much higher spectral efficiency and much lower outage probability, which are flexible and efficient for the OFDMA-based cooperative relay system.

Participatory sensing as an enabler for self-organisation in future cellular networks

International Nuclear Information System (INIS)

Imran, Muhammad Ali; Onireti, Oluwakayode; Imran, Ali

2013-01-01

In this short review paper we summarise the emerging challenges in the field of participatory sensing for the self-organisation of the next generation of wireless cellular networks. We identify the potential of participatory sensing in enabling the self-organisation, deployment optimisation and radio resource management of wireless cellular networks. We also highlight how this approach can meet the future goals for the next generation of cellular system in terms of infrastructure sharing, management of multiple radio access techniques, flexible usage of spectrum and efficient management of very small data cells

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.

Trust and Its Impact on Cooperation in Alliance Networks:Theory and Practice

Directory of Open Access Journals (Sweden)

Wlodzimierz SROKA

2011-11-01

Full Text Available At present we can observe the increasing role of cooperation among companies all around the world. Cooperation includes many forms, such as alliances, joint ventures, networks, clusters, outsourcing and others. Trust is one of the most important factors of success of any cooperation activity, because it can lower transaction costs, increase productivity and innovativeness, facilitate inter-organizational relationships and resolve conflicts. Therefore the paper discusses the basic problems of trust in alliance networks. The text consists of theoretical deliberations devoted to alliance networks and trust. The practical case of the company from machine industry that formed a portfolio of alliances based on trust is also an important part of the text. The conclusion of the paper is that portfolio of alliances based on trust is worth pursuing.

Cooperative Detection for Primary User in Cognitive Radio Networks

Directory of Open Access Journals (Sweden)

Zhu Jia

2009-01-01

Full Text Available We propose two novel cooperative detection schemes based on the AF (Amplify and Forward and DF (Decode and Forward protocols to achieve spatial diversity gains for cognitive radio networks, which are referred to as the AF-CDS, (AF-based Cooperative Detection Scheme and DF-CDS (DF-based Cooperative Detection Scheme, respectively. Closed-form expressions of detection probabilities for the noncooperation scheme, AND-CDS (AND-based Cooperative Detection Scheme, AF-CDS and DF-CDS, are derived over Rayleigh fading channels. Also, we analyze the overall agility for the proposed cooperative detection schemes and show that our schemes can further reduce the detection time. In addition, we compare the DF-CDS with the AF-CDS in terms of detection probability and agility gain, depicting the advantage of DF-CDS at low SNR region and high false alarm probability region.

Promoting cooperation by preventing exploitation: The role of network structure

Science.gov (United States)

Utkovski, Zoran; Stojkoski, Viktor; Basnarkov, Lasko; Kocarev, Ljupco

2017-08-01

A growing body of empirical evidence indicates that social and cooperative behavior can be affected by cognitive and neurological factors, suggesting the existence of state-based decision-making mechanisms that may have emerged by evolution. Motivated by these observations, we propose a simple mechanism of anonymous network interactions identified as a form of generalized reciprocity—a concept organized around the premise "help anyone if helped by someone'—and study its dynamics on random graphs. In the presence of such a mechanism, the evolution of cooperation is related to the dynamics of the levels of investments (i.e., probabilities of cooperation) of the individual nodes engaging in interactions. We demonstrate that the propensity for cooperation is determined by a network centrality measure here referred to as neighborhood importance index and discuss relevant implications to natural and artificial systems. To address the robustness of the state-based strategies to an invasion of defectors, we additionally provide an analysis which redefines the results for the case when a fraction of the nodes behave as unconditional defectors.

Unified Stochastic Geometry Model for MIMO Cellular Networks with Retransmissions

KAUST Repository

Afify, Laila H.

2016-10-11

This paper presents a unified mathematical paradigm, based on stochastic geometry, for downlink cellular networks with multiple-input-multiple-output (MIMO) base stations (BSs). The developed paradigm accounts for signal retransmission upon decoding errors, in which the temporal correlation among the signal-to-interference-plus-noise-ratio (SINR) of the original and retransmitted signals is captured. In addition to modeling the effect of retransmission on the network performance, the developed mathematical model presents twofold analysis unification for MIMO cellular networks literature. First, it integrates the tangible decoding error probability and the abstracted (i.e., modulation scheme and receiver type agnostic) outage probability analysis, which are largely disjoint in the literature. Second, it unifies the analysis for different MIMO configurations. The unified MIMO analysis is achieved by abstracting unnecessary information conveyed within the interfering signals by Gaussian signaling approximation along with an equivalent SISO representation for the per-data stream SINR in MIMO cellular networks. We show that the proposed unification simplifies the analysis without sacrificing the model accuracy. To this end, we discuss the diversity-multiplexing tradeoff imposed by different MIMO schemes and shed light on the diversity loss due to the temporal correlation among the SINRs of the original and retransmitted signals. Finally, several design insights are highlighted.

Unified Stochastic Geometry Model for MIMO Cellular Networks with Retransmissions

KAUST Repository

Afify, Laila H.; Elsawy, Hesham; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim

2016-01-01

This paper presents a unified mathematical paradigm, based on stochastic geometry, for downlink cellular networks with multiple-input-multiple-output (MIMO) base stations (BSs). The developed paradigm accounts for signal retransmission upon decoding errors, in which the temporal correlation among the signal-to-interference-plus-noise-ratio (SINR) of the original and retransmitted signals is captured. In addition to modeling the effect of retransmission on the network performance, the developed mathematical model presents twofold analysis unification for MIMO cellular networks literature. First, it integrates the tangible decoding error probability and the abstracted (i.e., modulation scheme and receiver type agnostic) outage probability analysis, which are largely disjoint in the literature. Second, it unifies the analysis for different MIMO configurations. The unified MIMO analysis is achieved by abstracting unnecessary information conveyed within the interfering signals by Gaussian signaling approximation along with an equivalent SISO representation for the per-data stream SINR in MIMO cellular networks. We show that the proposed unification simplifies the analysis without sacrificing the model accuracy. To this end, we discuss the diversity-multiplexing tradeoff imposed by different MIMO schemes and shed light on the diversity loss due to the temporal correlation among the SINRs of the original and retransmitted signals. Finally, several design insights are highlighted.

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

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

Nobelist TD LEE Scientist Cooperation Network and Scientist Innovation Ability Model

Directory of Open Access Journals (Sweden)

Jin-Qing Fang

2013-01-01

Full Text Available 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 scientist cooperation networks before. To demonstrate and explain this new finding, we propose a theoretical model for a nature scientist and his/her team innovation ability. The theoretical results are consistent with the empirical studies very well. This research demonstrates that the model has a certain universality and can be extended to estimate innovation ability for any nature scientist and his/her team. It is a better method for evaluating scientist innovation ability and his/her team for the academic profession and is of application potential.

Network-Assisted Distributed Fairness-Aware Interference Coordination for Device-to-Device Communication Underlaid Cellular Networks

Directory of Open Access Journals (Sweden)

Francis Boabang

2017-01-01

Full Text Available Device-to-device (D2D communication underlaid cellular network is considered a key integration feature in future cellular network. However, without properly designed interference management, the interference from D2D transmission tends to degrade the performance of cellular users and D2D pairs. In this work, we proposed a network-assisted distributed interference mitigation scheme to address this issue. Specifically, the base station (BS acts as a control agent that coordinates the cross-tier interference from D2D transmission through a taxation scheme. The cotier interference is controlled by noncooperative game amongst D2D pairs. In general, the outcome of noncooperative game is inefficient due to the selfishness of each player. In our game formulation, reference user who is the victim of cotier interference is factored into the payoff function of each player to obtain fair and efficient outcome. The existence, uniqueness of the Nash Equilibrium (NE, and the convergence of the proposed algorithm are characterized using Variational Inequality theory. Finally, we provide simulation results to evaluate the efficiency of the proposed algorithm.

QoE-Driven D2D Media Services Distribution Scheme in Cellular Networks

Directory of Open Access Journals (Sweden)

Mingkai Chen

2017-01-01

Full Text Available Device-to-device (D2D communication has been widely studied to improve network performance and considered as a potential technological component for the next generation communication. Considering the diverse users’ demand, Quality of Experience (QoE is recognized as a new degree of user’s satisfaction for media service transmissions in the wireless communication. Furthermore, we aim at promoting user’s Mean of Score (MOS value to quantify and analyze user’s QoE in the dynamic cellular networks. In this paper, we explore the heterogeneous media service distribution in D2D communications underlaying cellular networks to improve the total users’ QoE. We propose a novel media service scheme based on different QoE models that jointly solve the massive media content dissemination issue for cellular networks. Moreover, we also investigate the so-called Media Service Adaptive Update Scheme (MSAUS framework to maximize users’ QoE satisfaction and we derive the popularity and priority function of different media service QoE expression. Then, we further design Media Service Resource Allocation (MSRA algorithm to schedule limited cellular networks resource, which is based on the popularity function to optimize the total users’ QoE satisfaction and avoid D2D interference. In addition, numerical simulation results indicate that the proposed scheme is more effective in cellular network content delivery, which makes it suitable for various media service propagation.

Cross-border Co-operation and Policy Networks in West Africa

DEFF Research Database (Denmark)

Trémolières, Marie; Walther, Olivier

This publication examines how policy actors involved in cross-border co-operation contribute to the regional integration process in West Africa. It uses a pioneering methodology, known as social network analysis, to visualise the formal and informal relationships between actors involved in cross...... West Africa to develop cross-border initiatives in a number of ways. Combining these two analyses with the perceptions of regional policy makers as to which border areas they consider as priorities for regional integration, the publication concludes with the analytical foundations for more effective......-border policy networks, showing that borders have notable and diverse impacts on exchanges of information and the relative power of networks. The report then analyses a range of regional indicators of co-operation potential, visually demonstrating that borders can also affect the ability of sub-regions within...

Analysis of Blocking Rate and Bandwidth Usage of Mobile IPTV Services in Wireless Cellular Networks

Directory of Open Access Journals (Sweden)

Mingfu Li

2014-01-01

Full Text Available Mobile IPTV services over wireless cellular networks become more and more popular, owing to the significant growth in access bandwidth of wireless cellular networks such as 3G/4G and WiMAX. However, the spectrum resources of wireless cellular networks is rare. How to enhance the spectral efficiency of mobile networks becomes an important issue. Unicast, broadcast, and multicast are the most important transport schemes for offering mobile IPTV services over wireless cellular networks. Therefore, bandwidth usages and blocking rates of unicast, broadcast, and multicast IPTV services were analyzed and compared in this paper. Simulations were also conducted to validate the analytical results. Numerical results demonstrate that the presented analysis is correct, and multicast scheme achieves the best bandwidth usage and blocking rate performance, relative to the other two schemes.

Analysis of blocking rate and bandwidth usage of mobile IPTV services in wireless cellular networks.

Science.gov (United States)

Li, Mingfu

2014-01-01

Mobile IPTV services over wireless cellular networks become more and more popular, owing to the significant growth in access bandwidth of wireless cellular networks such as 3G/4G and WiMAX. However, the spectrum resources of wireless cellular networks is rare. How to enhance the spectral efficiency of mobile networks becomes an important issue. Unicast, broadcast, and multicast are the most important transport schemes for offering mobile IPTV services over wireless cellular networks. Therefore, bandwidth usages and blocking rates of unicast, broadcast, and multicast IPTV services were analyzed and compared in this paper. Simulations were also conducted to validate the analytical results. Numerical results demonstrate that the presented analysis is correct, and multicast scheme achieves the best bandwidth usage and blocking rate performance, relative to the other two schemes.

Cellular neural networks for the stereo matching problem

International Nuclear Information System (INIS)

Taraglio, S.; Zanela, A.

1997-03-01

The applicability of the Cellular Neural Network (CNN) paradigm to the problem of recovering information on the tridimensional structure of the environment is investigated. The approach proposed is the stereo matching of video images. The starting point of this work is the Zhou-Chellappa neural network implementation for the same problem. The CNN based system we present here yields the same results as the previous approach, but without the many existing drawbacks

Inter-organizational relationships: promoters and restrictive factors in the formation of cooperation network

Directory of Open Access Journals (Sweden)

Marcos Antonio Gaspar

2014-04-01

Full Text Available The present paper had as aim to identify factors of inter-organizational relationships which promotes and restricts the formation of companies’ cooperation network, from two levels of analysis (organizational and inter-organizational. To achieve this goal, it was developed a descriptive-qualitative study, with prospecting for primary and secondary data on a cooperation network. The universe was composed by 41 participating companies associated to the analyzed network. The sampling procedure was for researcher’s accessibility and convenience. As a result, it was identified that the network is guided by goals of cooperation among the participating companies, in addition to representing the sector and provide services in the interests of the associates. The main factors influencing the formation of the network were: business center, marketing and training; but only training has been achieved satisfactorily. The business center and marketing factors have not yet been fully developed, being both identified as restrictive factors.

Channel Access and Power Control for Mobile Crowdsourcing in Device-to-Device Underlaid Cellular Networks

Directory of Open Access Journals (Sweden)

Yue Ma

2018-01-01

Full Text Available With the access of a myriad of smart handheld devices in cellular networks, mobile crowdsourcing becomes increasingly popular, which can leverage omnipresent mobile devices to promote the complicated crowdsourcing tasks. Device-to-device (D2D communication is highly desired in mobile crowdsourcing when cellular communications are costly. The D2D cellular network is more preferable for mobile crowdsourcing than conventional cellular network. Therefore, this paper addresses the channel access and power control problem in the D2D underlaid cellular networks. We propose a novel semidistributed network-assisted power and a channel access control scheme for D2D user equipment (DUE pieces. It can control the interference from DUE pieces to the cellular user accurately and has low information feedback overhead. For the proposed scheme, the stochastic geometry tool is employed and analytic expressions are derived for the coverage probabilities of both the cellular link and D2D links. We analyze the impact of key system parameters on the proposed scheme. The Pareto optimal access threshold maximizing the total area spectral efficiency is obtained. Unlike the existing works, the performances of the cellular link and D2D links are both considered. Simulation results show that the proposed method can improve the total area spectral efficiency significantly compared to existing schemes.

Moran-evolution of cooperation: From well-mixed to heterogeneous complex networks

Science.gov (United States)

Sarkar, Bijan

2018-05-01

Configurational arrangement of network architecture and interaction character of individuals are two most influential factors on the mechanisms underlying the evolutionary outcome of cooperation, which is explained by the well-established framework of evolutionary game theory. In the current study, not only qualitatively but also quantitatively, we measure Moran-evolution of cooperation to support an analytical agreement based on the consequences of the replicator equation in a finite population. The validity of the measurement has been double-checked in the well-mixed network by the Langevin stochastic differential equation and the Gillespie-algorithmic version of Moran-evolution, while in a structured network, the measurement of accuracy is verified by the standard numerical simulation. Considering the Birth-Death and Death-Birth updating rules through diffusion of individuals, the investigation is carried out in the wide range of game environments those relate to the various social dilemmas where we are able to draw a new rigorous mathematical track to tackle the heterogeneity of complex networks. The set of modified criteria reveals the exact fact about the emergence and maintenance of cooperation in the structured population. We find that in general, nature promotes the environment of coexistent traits.

Wireless traffic steering for green cellular networks

CERN Document Server

Zhang, Shan; Zhou, Sheng; Niu, Zhisheng; Shen, Xuemin (Sherman)

2016-01-01

This book introduces wireless traffic steering as a paradigm to realize green communication in multi-tier heterogeneous cellular networks. By matching network resources and dynamic mobile traffic demand, traffic steering helps to reduce on-grid power consumption with on-demand services provided. This book reviews existing solutions from the perspectives of energy consumption reduction and renewable energy harvesting. Specifically, it explains how traffic steering can improve energy efficiency through intelligent traffic-resource matching. Several promising traffic steering approaches for dynamic network planning and renewable energy demand-supply balancing are discussed. This book presents an energy-aware traffic steering method for networks with energy harvesting, which optimizes the traffic allocated to each cell based on the renewable energy status. Renewable energy demand-supply balancing is a key factor in energy dynamics, aimed at enhancing renewable energy sustainability to reduce on-grid energy consum...

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

KAUST Repository

Moubayed, Abdallah J.

2015-05-01

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

Detection of silent cells, synchronization and modulatory activity in developing cellular networks.

Science.gov (United States)

Hjorth, Johannes J J; Dawitz, Julia; Kroon, Tim; Pires, Johny; Dassen, Valerie J; Berkhout, Janna A; Emperador Melero, Javier; Nadadhur, Aish G; Alevra, Mihai; Toonen, Ruud F; Heine, Vivi M; Mansvelder, Huibert D; Meredith, Rhiannon M

2016-04-01

Developing networks in the immature nervous system and in cellular cultures are characterized by waves of synchronous activity in restricted clusters of cells. Synchronized activity in immature networks is proposed to regulate many different developmental processes, from neuron growth and cell migration, to the refinement of synapses, topographic maps, and the mature composition of ion channels. These emergent activity patterns are not present in all cells simultaneously within the network and more immature "silent" cells, potentially correlated with the presence of silent synapses, are prominent in different networks during early developmental periods. Many current network analyses for detection of synchronous cellular activity utilize activity-based pixel correlations to identify cellular-based regions of interest (ROIs) and coincident cell activity. However, using activity-based correlations, these methods first underestimate or ignore the inactive silent cells within the developing network and second, are difficult to apply within cell-dense regions commonly found in developing brain networks. In addition, previous methods may ignore ROIs within a network that shows transient activity patterns comprising both inactive and active periods. We developed analysis software to semi-automatically detect cells within developing neuronal networks that were imaged using calcium-sensitive reporter dyes. Using an iterative threshold, modulation of activity was tracked within individual cells across the network. The distribution pattern of both inactive and active, including synchronous cells, could be determined based on distance measures to neighboring cells and according to different anatomical layers. © 2015 Wiley Periodicals, Inc.

Energy Cost Minimization in Heterogeneous Cellular Networks with Hybrid Energy Supplies

Directory of Open Access Journals (Sweden)

Bang Wang

2016-01-01

Full Text Available The ever increasing data demand has led to the significant increase of energy consumption in cellular mobile networks. Recent advancements in heterogeneous cellular networks and green energy supplied base stations provide promising solutions for cellular communications industry. In this article, we first review the motivations and challenges as well as approaches to address the energy cost minimization problem for such green heterogeneous networks. Owing to the diversities of mobile traffic and renewable energy, the energy cost minimization problem involves both temporal and spatial optimization of resource allocation. We next present a new solution to illustrate how to combine the optimization of the temporal green energy allocation and spatial mobile traffic distribution. The whole optimization problem is decomposed into four subproblems, and correspondingly our proposed solution is divided into four parts: energy consumption estimation, green energy allocation, user association, and green energy reallocation. Simulation results demonstrate that our proposed algorithm can significantly reduce the total energy cost.

Optimized Energy Procurement for Cellular Networks with Uncertain Renewable Energy Generation

KAUST Repository

Rached, Nadhir B.

2017-02-07

Renewable energy (RE) is an emerging solution for reducing carbon dioxide (CO2) emissions from cellular networks. One of the challenges of using RE sources is to handle its inherent uncertainty. In this paper, a RE powered cellular network is investigated. For a one-day operation cycle, the cellular network aims to reduce energy procurement costs from the smart grid by optimizing the amounts of energy procured from their locally deployed RE sources as well as from the smart grid. In addition to that, it aims to determine the extra amount of energy to be sold to the electrical grid at each time period. Chance constrained optimization is first proposed to deal with the randomness in the RE generation. Then, to make the optimization problem tractable, two well- know convex approximation methods, namely; Chernoff and Chebyshev based-approaches, are analyzed in details. Numerical results investigate the optimized energy procurement for various daily scenarios and compare between the performances of the employed convex approximation approaches.

Cooperative Opportunistic Pressure Based Routing for Underwater Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Nadeem Javaid

2017-03-01

Full Text Available In this paper, three opportunistic pressure based routing techniques for underwater wireless sensor networks (UWSNs are proposed. The first one is the cooperative opportunistic pressure based routing protocol (Co-Hydrocast, second technique is the improved Hydrocast (improved-Hydrocast, and third one is the cooperative improved Hydrocast (Co-improved Hydrocast. In order to minimize lengthy routing paths between the source and the destination and to avoid void holes at the sparse networks, sensor nodes are deployed at different strategic locations. The deployment of sensor nodes at strategic locations assure the maximum monitoring of the network field. To conserve the energy consumption and minimize the number of hops, greedy algorithm is used to transmit data packets from the source to the destination. Moreover, the opportunistic routing is also exploited to avoid void regions by making backward transmissions to find reliable path towards the destination in the network. The relay cooperation mechanism is used for reliable data packet delivery, when signal to noise ratio (SNR of the received signal is not within the predefined threshold then the maximal ratio combining (MRC is used as a diversity technique to improve the SNR of the received signals at the destination. Extensive simulations validate that our schemes perform better in terms of packet delivery ratio and energy consumption than the existing technique; Hydrocast.

Cooperative Opportunistic Pressure Based Routing for Underwater Wireless Sensor Networks.

Science.gov (United States)

Javaid, Nadeem; Muhammad; Sher, Arshad; Abdul, Wadood; Niaz, Iftikhar Azim; Almogren, Ahmad; Alamri, Atif

2017-03-19

In this paper, three opportunistic pressure based routing techniques for underwater wireless sensor networks (UWSNs) are proposed. The first one is the cooperative opportunistic pressure based routing protocol (Co-Hydrocast), second technique is the improved Hydrocast (improved-Hydrocast), and third one is the cooperative improved Hydrocast (Co-improved Hydrocast). In order to minimize lengthy routing paths between the source and the destination and to avoid void holes at the sparse networks, sensor nodes are deployed at different strategic locations. The deployment of sensor nodes at strategic locations assure the maximum monitoring of the network field. To conserve the energy consumption and minimize the number of hops, greedy algorithm is used to transmit data packets from the source to the destination. Moreover, the opportunistic routing is also exploited to avoid void regions by making backward transmissions to find reliable path towards the destination in the network. The relay cooperation mechanism is used for reliable data packet delivery, when signal to noise ratio (SNR) of the received signal is not within the predefined threshold then the maximal ratio combining (MRC) is used as a diversity technique to improve the SNR of the received signals at the destination. Extensive simulations validate that our schemes perform better in terms of packet delivery ratio and energy consumption than the existing technique; Hydrocast.

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.

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.

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

A Cross-Layer Cooperation Mechanism of Wireless Networks Based on Game Theory

OpenAIRE

Chunsheng, Cui; Yongjian, Yang; Liping, Huang

2014-01-01

To meet the wireless network congestion control problem, we give a definition of congestion degree classification and propose a mechanism of directed cooperative path net, guided by the wireless network’s cross-layer design methods and node cooperation principles. Considering the virtual collision and “starved” phenomenon in congested networks, the QRD mechanism and channel competition mechanism QPCG are proposed, with introducing the game theory into the cross-layer design. Simulation result...

On Optimal Geographical Caching in Heterogeneous Cellular Networks

NARCIS (Netherlands)

Serbetci, Berksan; Goseling, Jasper

2017-01-01

In this work we investigate optimal geographical caching in heterogeneous cellular networks where different types of base stations (BSs) have different cache capacities. Users request files from a content library according to a known probability distribution. The performance metric is the total hit

Innovative Improvement and Intensification of Business Relationships Supported by Cooperative Networks

Science.gov (United States)

Vančová, Viera; Čambál, Miloš; Cagáňová, Dagmar

2012-12-01

Nowadays, the opportunity for companies to be involved in cluster initiatives and international business associations is a major factor that contributes to the increase of their innovative potential. Companies organized in technological clusters have greater access to mutual business contacts, faster information transfer and deployment of advanced technologies. These companies cooperate more frequently with universities and research - development institutions on innovative projects. An important benefit of cluster associations is that they create a suitable environment for innovation and the transfer of knowledge by means of international cooperation and networking. This supportive environment is not easy to access for different small and mediumsized companies, who are not members of any clusters or networks. Supplier-customer business channels expand by means of transnational networks and exchanges of experience. Knowledge potential is broadened and joint innovative projects are developed. Reflecting the growing importance of clusters as driving forces of economic and regional development, a number of cluster policies and initiatives have emerged in the last few decades, oriented to encourage the establishment of new clusters, to support existing clusters, or to assist the development of transnational cooperation. To achieve the goals of the Europe 2020 Strategy, European countries should have an interest in building strong clusters and developing cluster cooperation by sharing specialized research infrastructures and testing facilities and facilitating knowledge transfer for crossborder cooperation. This requires developing a long term joint strategy in order to facilitate the development of open global clusters and innovative small and medium entrepreneurs.

[Cellular adhesion signal transduction network of tumor necrosis factor-alpha induced hepatocellular carcinoma cells].

Science.gov (United States)

Zheng, Yongchang; Du, Shunda; Xu, Haifeng; Xu, Yiyao; Zhao, Haitao; Chi, Tianyi; Lu, Xin; Sang, Xinting; Mao, Yilei

2014-11-18

To systemically explore the cellular adhesion signal transduction network of tumor necrosis factor-alpha (TNF-α)-induced hepatocellular carcinoma cells with bioinformatics tools. Published microarray dataset of TNF-α-induced HepG2, human transcription factor database HTRI and human protein-protein interaction database HPRD were used to construct and analyze the signal transduction network. In the signal transduction network, MYC and SP1 were the key nodes of signaling transduction. Several genes from the network were closely related with cellular adhesion.Epidermal growth factor receptor (EGFR) is a possible key gene of effectively regulating cellular adhesion during the induction of TNF-α. EGFR is a possible key gene for TNF-α-induced metastasis of hepatocellular carcinoma.

Emergent behaviors of the Schrödinger-Lohe model on cooperative-competitive networks

Science.gov (United States)

Huh, Hyungjin; Ha, Seung-Yeal; Kim, Dohyun

2017-12-01

We present several sufficient frameworks leading to the emergent behaviors of the coupled Schrödinger-Lohe (S-L) model under the same one-body external potential on cooperative-competitive networks. The S-L model was first introduced as a possible phenomenological model exhibiting quantum synchronization and its emergent dynamics on all-to-all cooperative networks has been treated via two distinct approaches, Lyapunov functional approach and the finite-dimensional reduction based on pairwise correlations. In this paper, we further generalize the finite-dimensional dynamical systems approach for pairwise correlation functions on cooperative-competitive networks and provide several sufficient frameworks leading to the collective exponential synchronization. For small systems consisting of three and four quantum subsystem, we also show that the system for pairwise correlations can be reduced to the Lotka-Volterra model with cooperative and competitive interactions, in which lots of interesting dynamical patterns appear, e.g., existence of closed orbits and limit-cycles.

Boltzmann learning of parameters in cellular neural networks

DEFF Research Database (Denmark)

Hansen, Lars Kai

1992-01-01

The use of Bayesian methods to design cellular neural networks for signal processing tasks and the Boltzmann machine learning rule for parameter estimation is discussed. The learning rule can be used for models with hidden units, or for completely unsupervised learning. The latter is exemplified...

Green Networking in Cellular HetNets: A Unified Radio Resource Management Framework with Base Station ON/OFF Switching

KAUST Repository

Ghazzai, Hakim

2016-12-07

In this paper, the problem of energy efficiency in cellular heterogeneous networks (HetNets) is investigated using radio resource and power management combined with the base station (BS) ON/OFF switching. The objective is to minimize the total power consumption of the network while satisfying the quality of service (QoS) requirements of each connected user. We consider the case of co-existing macrocell BS, small cell BSs, and private femtocell access points (FAPs). Three different network scenarios are investigated, depending on the status of the FAPs, i.e., HetNets without FAPs, HetNets with closed FAPs, and HetNets with semi-closed FAPs. A unified framework is proposed to simultaneously allocate spectrum resources to users in an energy efficient manner and switch off redundant small cell BSs. The high complexity dual decomposition technique is employed to achieve optimal solutions for the problem. A low complexity iterative algorithm is also proposed and its performances are compared to those of the optimal technique. The particularly interesting case of semi-closed FAPs, in which the FAPs accept to serve external users, achieves the highest energy efficiency due to increased degrees of freedom. In this paper, a cooperation scheme between FAPs and mobile operator is also investigated. The incentives for FAPs, e.g., renewable energy sharing and roaming prices, enabling cooperation are discussed to be considered as a useful guideline for inter-operator agreements.

Green Networking in Cellular HetNets: A Unified Radio Resource Management Framework with Base Station ON/OFF Switching

KAUST Repository

Ghazzai, Hakim; Farooq, Muhammad Junaid; Alsharoa, Ahmad; Yaacoub, Elias; Kadri, Abdullah; Alouini, Mohamed-Slim

2016-01-01

In this paper, the problem of energy efficiency in cellular heterogeneous networks (HetNets) is investigated using radio resource and power management combined with the base station (BS) ON/OFF switching. The objective is to minimize the total power consumption of the network while satisfying the quality of service (QoS) requirements of each connected user. We consider the case of co-existing macrocell BS, small cell BSs, and private femtocell access points (FAPs). Three different network scenarios are investigated, depending on the status of the FAPs, i.e., HetNets without FAPs, HetNets with closed FAPs, and HetNets with semi-closed FAPs. A unified framework is proposed to simultaneously allocate spectrum resources to users in an energy efficient manner and switch off redundant small cell BSs. The high complexity dual decomposition technique is employed to achieve optimal solutions for the problem. A low complexity iterative algorithm is also proposed and its performances are compared to those of the optimal technique. The particularly interesting case of semi-closed FAPs, in which the FAPs accept to serve external users, achieves the highest energy efficiency due to increased degrees of freedom. In this paper, a cooperation scheme between FAPs and mobile operator is also investigated. The incentives for FAPs, e.g., renewable energy sharing and roaming prices, enabling cooperation are discussed to be considered as a useful guideline for inter-operator agreements.

Cooperative robots and sensor networks

CERN Document Server

Khelil, Abdelmajid

2014-01-01

Mobile robots and Wireless Sensor Networks (WSNs) have enabled great potentials and a large space for ubiquitous and pervasive applications. Robotics and WSNs 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 primary objective of book is to provide a reference for cutting-edge studies and research trends pertaining to robotics and sensor networks, and in particular for the coupling between them. The book consists of five chapters. The first chapter presents a cooperation strategy for teams of multiple autonomous vehicles to solve the rendezvous problem. The second chapter is motivated by the need to improve existing solutions that deal with connectivity prediction, and proposed a genetic machine learning approach for link-quality prediction. The third chapter presents an arch...

Power Control for D2D Underlay Cellular Networks With Channel Uncertainty

KAUST Repository

Memmi, Amen; Rezki, Zouheir; Alouini, Mohamed-Slim

2016-01-01

Device-to-device (D2D) communications underlying the cellular infrastructure are a technology that have been proposed recently as a promising solution to enhance cellular network capabilities. It improves spectrum utilization, overall throughput

Stability analysis for cellular neural networks with variable delays

International Nuclear Information System (INIS)

Zhang Qiang; Wei Xiaopeng; Xu Jin

2006-01-01

Some sufficient conditions for the global exponential stability of cellular neural networks with variable delay are obtained by means of a method based on delay differential inequality. The method, which does not make use of Lyapunov functionals, is simple and effective for the stability analysis of neural networks with delay. Some previously established results in the literature are shown to be special cases of the presented result

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.

Impact of interaction style and degree on the evolution of cooperation on Barabási-Albert scale-free network.

Directory of Open Access Journals (Sweden)

Fengjie Xie

Full Text Available In this work, we study an evolutionary prisoner's dilemma game (PDG on Barabási-Albert scale-free networks with limited player interactions, and explore the effect of interaction style and degree on cooperation. The results show that high-degree preference interaction, namely the most applicable interaction in the real world, is less beneficial for emergence of cooperation on scale-free networks than random interaction. Besides, cooperation on scale-free networks is enhanced with the increase of interaction degree regardless whether the interaction is high-degree preference or random. If the interaction degree is very low, the cooperation level on scale-free networks is much lower than that on regular ring networks, which is against the common belief that scale-free networks must be more beneficial for cooperation. Our analysis indicates that the interaction relations, the strategy and the game payoff of high-connectivity players play important roles in the evolution of cooperation on scale-free networks. A certain number of interactions are necessary for scale-free networks to exhibit strong capability of facilitating cooperation. Our work provides important insight for members on how to interact with others in a social organization.

Conformity-based cooperation in online social networks: The effect of heterogeneous social influence

International Nuclear Information System (INIS)

Xu, Bo; Wang, Jianwei; Zhang, Xuejun

2015-01-01

This paper extends the conformity model by introducing heterogeneous social influence into the analysis. We associate the influence of a player in the network with its degree centrality assuming that players of higher degree exhibit more social influence on its neighbors. The results show that the equilibrium level of cooperators can be dramatically enhanced if the conformity-driven players are preferentially influenced by neighbors of higher degree. We attribute this finding to two elementary mechanisms in the evolutionary process: (1) degree-based social influence facilitates the formation of strategic clusters around hubs; and (2) payoff-heterogeneity between cooperative clusters and defective clusters contributes to the promotion of cooperation. This research reveals the important role of heterogeneous social influence on the emergence of cooperation in social networks.

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.

Performance analysis of selective cooperation in underlay cognitive networks over Rayleigh channels

KAUST Repository

Hussain, Syed Imtiaz

2011-06-01

Underlay cognitive networks should follow strict interference thresholds to operate in parallel with primary networks. This constraint limits their transmission power and eventually the area of coverage. Therefore, it is very likely that the underlay networks will make use of relays to transmit signals to the distant secondary users. In this paper, we propose a secondary relay selection scheme which maximizes the end-to-end signal to noise ratio (SNR) for the secondary link while keeping the interference levels to the primary network below a certain threshold. We derive closed form expressions for the probability density function (PDF) of the SNR at the secondary destination, average bit error probability and outage probability. Analytical results are verified through simulations which also give insight about the benefits and tradeoffs of the selective cooperation in underlay cognitive networks. It is shown that, in contrast to non-cognitive selective cooperation, this scheme performs better in low SNR region for cognitive networks. © 2011 IEEE.

Organized network for supporting the amateur-scientist co-operation in Finland

Science.gov (United States)

Mäkelä, V.; Haukka, H.; Oksanen, A.; Hentunen, V.-P.

2014-04-01

PROAM network is a working group of Ursa Astronomical Association [1] for supporting Finnish amateur astronomers participating to co-operation projects between professional and amateur astronomers. The network relays the information on projects, maintains professional contacts and arranges training on technical skills for research work.

A Biologically-Inspired Power Control Algorithm for Energy-Efficient Cellular Networks

Directory of Open Access Journals (Sweden)

Hyun-Ho Choi

2016-03-01

Full Text Available Most of the energy used to operate a cellular network is consumed by a base station (BS, and reducing the transmission power of a BS can therefore afford a substantial reduction in the amount of energy used in a network. In this paper, we propose a distributed transmit power control (TPC algorithm inspired by bird flocking behavior as a means of improving the energy efficiency of a cellular network. Just as each bird in a flock attempts to match its velocity with the average velocity of adjacent birds, in the proposed algorithm, each mobile station (MS in a cell matches its rate with the average rate of the co-channel MSs in adjacent cells by controlling the transmit power of its serving BS. We verify that this bio-inspired TPC algorithm using a local rate-average process achieves an exponential convergence and maximizes the minimum rate of the MSs concerned. Simulation results show that the proposed TPC algorithm follows the same convergence properties as the flocking algorithm and also effectively reduces the power consumption at the BSs while maintaining a low outage probability as the inter-cell interference increases; in so doing, it significantly improves the energy efficiency of a cellular network.

Persistent RCSMA: A MAC Protocol for a Distributed Cooperative ARQ Scheme in Wireless Networks

Directory of Open Access Journals (Sweden)

J. Alonso-Zárate

2008-05-01

Full Text Available The persistent relay carrier sensing multiple access (PRCSMA protocol is presented in this paper as a novel medium access control (MAC protocol that allows for the execution of a distributed cooperative automatic retransmission request (ARQ scheme in IEEE 802.11 wireless networks. The underlying idea of the PRCSMA protocol is to modify the basic rules of the IEEE 802.11 MAC protocol to execute a distributed cooperative ARQ scheme in wireless networks in order to enhance their performance and to extend coverage. A closed formulation of the distributed cooperative ARQ average packet transmission delay in a saturated network is derived in the paper. The analytical equations are then used to evaluate the performance of the protocol under different network configurations. Both the accuracy of the analysis and the performance evaluation of the protocol are supported and validated through computer simulations.

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.

Influence of different initial distributions on robust cooperation in scale-free networks: A comparative study

International Nuclear Information System (INIS)

Chen Xiaojie; Fu Feng; Wang Long

2008-01-01

We study the evolutionary Prisoner's dilemma game on scale-free networks, focusing on the influence of different initial distributions for cooperators and defectors on the evolution of cooperation. To address this issue, we consider three types of initial distributions for defectors: uniform distribution at random, occupying the most connected nodes, and occupying the lowest-degree nodes, respectively. It is shown that initial configurations for defectors can crucially influence the cooperation level and the evolution speed of cooperation. Interestingly, the situation where defectors initially occupy the lowest-degree vertices can exhibit the most robust cooperation, compared with two other distributions. That is, the cooperation level is least affected by the initial percentage of defectors. Moreover, in this situation, the whole system evolves fastest to the prevalent cooperation. Besides, we obtain the critical values of initial frequency of defectors above which the extinction of cooperators occurs for the respective initial distributions. Our results might be helpful in explaining the maintenance of high cooperation in scale-free networks

Analytical modeling of mode selection and power control for underlay D2D communication in cellular networks

KAUST Repository

Elsawy, Hesham

2014-11-01

Device-to-device (D2D) communication enables the user equipments (UEs) located in close proximity to bypass the cellular base stations (BSs) and directly connect to each other, and thereby, offload traffic from the cellular infrastructure. D2D communication can improve spatial frequency reuse and energy efficiency in cellular networks. This paper presents a comprehensive and tractable analytical framework for D2D-enabled uplink cellular networks with a flexible mode selection scheme along with truncated channel inversion power control. The developed framework is used to analyze and understand how the underlaying D2D communication affects the cellular network performance. Through comprehensive numerical analysis, we investigate the expected performance gains and provide guidelines for selecting the network parameters.

Global exponential stability for nonautonomous cellular neural networks with delays

International Nuclear Information System (INIS)

Zhang Qiang; Wei Xiaopeng; Xu Jin

2006-01-01

In this Letter, by utilizing Lyapunov functional method and Halanay inequalities, we analyze global exponential stability of nonautonomous cellular neural networks with delay. Several new sufficient conditions ensuring global exponential stability of the network are obtained. The results given here extend and improve the earlier publications. An example is given to demonstrate the effectiveness of the obtained results

Fundamental Tradeoffs among Reliability, Latency and Throughput in Cellular Networks

DEFF Research Database (Denmark)

Soret, Beatriz; Mogensen, Preben; Pedersen, Klaus I.

2014-01-01

We address the fundamental tradeoffs among latency, reliability and throughput in a cellular network. The most important elements influencing the KPIs in a 4G network are identified, and the inter-relationships among them is discussed. We use the effective bandwidth and the effective capacity......, in which latency and reliability will be two of the principal KPIs....

Distributed Velocity-Dependent Protocol for Multihop Cellular Sensor Networks

Directory of Open Access Journals (Sweden)

Deepthi Chander

2009-01-01

Full Text Available Cell phones are embedded with sensors form a Cellular Sensor Network which can be used to localize a moving event. The inherent mobility of the application and of the cell phone users warrants distributed structure-free data aggregation and on-the-fly routing. We propose a Distributed Velocity-Dependent (DVD protocol to localize a moving event using a Multihop Cellular Sensor Network (MCSN. DVD is based on a novel form of connectivity determined by the waiting time of nodes for a Random Waypoint (RWP distribution of cell phone users. This paper analyzes the time-stationary and spatial distribution of the proposed waiting time to explain the superior event localization and delay performances of DVD over the existing Randomized Waiting (RW protocol. A sensitivity analysis is also performed to compare the performance of DVD with RW and the existing Centralized approach.

Optimized Energy Efficiency and Spectral Efficiency Resource Allocation Strategies for Phantom Cellular Networks

KAUST Repository

Abdelhady, Amr, M.; Amin, Osama; Alouini, Mohamed-Slim

2016-01-01

Multi-teir hetrogeneous networks have become an essential constituent for next generation cellular networks. Meanwhile, energy efficiency (EE) has been considered a critical design criterion along with the traditional spectral efficiency (SE) metric. In this context, we study power and spectrum allocation for the recently proposed two-teir architecture known as Phantom cellular networks. The optimization framework includes both EE and SE, where we propose an algorithm that computes the SE and EE resource allocation for Phantom cellular networks. Then, we compare the performance of both design strategies versus the number of users, and the ration of Phantom cellresource blocks to the total number or resource blocks. We aim to investigate the effect of some system parameters to acheive improved SE or EE performance at a non-significant loss in EE or SE performance, respectively. It was found that the system parameters can be tuned so that the EE solution does not yield a significant loss in the SE performance.

Optimized Energy Efficiency and Spectral Efficiency Resource Allocation Strategies for Phantom Cellular Networks

KAUST Repository

Abdelhady, Amr, M.

2016-01-06

Multi-teir hetrogeneous networks have become an essential constituent for next generation cellular networks. Meanwhile, energy efficiency (EE) has been considered a critical design criterion along with the traditional spectral efficiency (SE) metric. In this context, we study power and spectrum allocation for the recently proposed two-teir architecture known as Phantom cellular networks. The optimization framework includes both EE and SE, where we propose an algorithm that computes the SE and EE resource allocation for Phantom cellular networks. Then, we compare the performance of both design strategies versus the number of users, and the ration of Phantom cellresource blocks to the total number or resource blocks. We aim to investigate the effect of some system parameters to acheive improved SE or EE performance at a non-significant loss in EE or SE performance, respectively. It was found that the system parameters can be tuned so that the EE solution does not yield a significant loss in the SE performance.

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.

TNF-α inhibits trophoblast integration into endothelial cellular networks.

Science.gov (United States)

Xu, B; Nakhla, S; Makris, A; Hennessy, A

2011-03-01

Preeclampsia has been linked to shallow trophoblast invasion and failure of uterine spiral artery transformation. Interaction between trophoblast cells and maternal uterine endothelium is critically important for this remodelling. The aim of our study was to investigate the effect of TNF-α on the interactions of trophoblast-derived JEG-3 cells into capillary-like cellular networks. We have employed an in vitro trophoblast-endothelial cell co-culture model to quantify trophoblast integration into endothelial cellular networks and to investigate the effects of TNF-α. Controlled co-cultures were also treated with anti-TNF-α antibody (5 μg/ml) to specifically block the effect of TNF-α. The invasion was evaluated by performing quantitative PCR (Q-PCR) to analyse gene expression of matrix metalloproteinases-2 (MMP-2), MMP-9, tissue inhibitor of matrix metalloproteinase (TIMP)-1, integrins (α(1)β(1) and α(6)β(4)), plasminogen activator inhibitor (PAI)-1, E-cadherin and VE-cadherin. JEG-3 cell integration into endothelial networks was significantly inhibited by exogenous TNF-α. The inhibition was observed in the range of 0.2-5 ng/ml, to a maximum 56% inhibition at the highest concentration. This inhibition was reversed by anti-TNF-α antibody. Q-PCR analysis showed that mRNA expression of integrins α(1)β(1) and MMP-2 was significantly decreased. VE-cadherin mRNA expression was significantly up-regulated (32-80%, p integration into maternal endothelial cellular networks, and this process involves the inhibition of MMP-2 and a failure of integrins switch from α(6)β(4) to α(1)β(1.) These molecular correlations reflect the changes identified in human preeclampsia. Copyright © 2011 Elsevier Ltd. All rights reserved.

Next-Generation Environment-Aware Cellular Networks: Modern Green Techniques and Implementation Challenges

KAUST Repository

Ghazzai, Hakim

2016-09-16

Over the last decade, mobile communications have been witnessing a noteworthy increase of data traffic demand that is causing an enormous energy consumption in cellular networks. The reduction of their fossil fuel consumption in addition to the huge energy bills paid by mobile operators is considered as the most important challenges for the next-generation cellular networks. Although most of the proposed studies were focusing on individual physical layer power optimizations, there is a growing necessity to meet the green objective of fifth-generation cellular networks while respecting the user\\'s quality of service. This paper investigates four important techniques that could be exploited separately or together in order to enable wireless operators achieve significant economic benefits and environmental savings: 1) the base station sleeping strategy; 2) the optimized energy procurement from the smart grid; 3) the base station energy sharing; and 4) the green networking collaboration between competitive mobile operators. The presented simulation results measure the gain that could be obtained using these techniques compared with that of traditional scenarios. Finally, this paper discusses the issues and challenges related to the implementations of these techniques in real environments. © 2016 IEEE.

Neural networks and cellular automata in experimental high energy physics

Energy Technology Data Exchange (ETDEWEB)

Denby, B

1988-06-01

Within the past few years, two novel computing techniques, cellular automata and neural networks, have shown considerable promise in the solution of problems of a very high degree of complexity, such as turbulent fluid flow, image processing, and pattern recognition. Many of the problems faced in experimental high energy physics are also of this nature. Track reconstruction in wire chambers and cluster finding in cellular calorimeters, for instance, involve pattern recognition and high combinatorial complexity since many combinations of hits or cells must be considered in order to arrive at the final tracks or clusters. Here we examine in what way connective network methods can be applied to some of the problems of experimental high energy physics. It is found that such problems as track and cluster finding adapt naturally to these approaches. When large scale hard-wired connective networks become available, it will be possible to realize solutions to such problems in a fraction of the time required by traditional methods. For certain types of problems, faster solutions are already possible using model networks implemented on vector or other massively parallel machines. It should also be possible, using existing technology, to build simplified networks that will allow detailed reconstructed event information to be used in fast trigger decisions.

Neural networks and cellular automata in experimental high energy physics

International Nuclear Information System (INIS)

Denby, B.

1987-11-01

Within the past few years, two novel computing techniques, cellular automata and neural networks, have shown considerable promise in the solution of problems of a very high degree of complexity, such as turbulent fluid flow, image processing, and pattern recognition. Many of the problems faced in experimental high energy physics are also of this nature. Track reconstruction in wire chambers and cluster finding in cellular calorimeters, for instance, involve pattern recognition and high combinatorial complexity since many combinations of hits or cells must be considered in order to arrive at the final tracks or clusters. Here we examine in what way connective network methods can be applied to some of the problems of experimental high physics. It is found that such problems as track and cluster finding adapt naturally to these approaches. When large scale hardwired connective networks become available, it will be possible to realize solutions to such problems in a fraction of the time required by traditional methods. For certain types of problems, faster solutions are already possible using model networks implemented on vector or other massively parallel machines. It should also be possible, using existing technology, to build simplified networks that will allow detailed reconstructed event information to be used in fast trigger decisions

Neural networks and cellular automata in experimental high energy physics

International Nuclear Information System (INIS)

Denby, B.

1988-01-01

Within the past few years, two novel computing techniques, cellular automata and neural networks, have shown considerable promise in the solution of problems of a very high degree of complexity, such as turbulent fluid flow, image processing, and pattern recognition. Many of the problems faced in experimental high energy physics are also of this nature. Track reconstruction in wire chambers and cluster finding in cellular calorimeters, for instance, involve pattern recognition and high combinatorial complexity since many combinations of hits or cells must be considered in order to arrive at the final tracks or clusters. Here we examine in what way connective network methods can be applied to some of the problems of experimental high energy physics. It is found that such problems as track and cluster finding adapt naturally to these approaches. When large scale hard-wired connective networks become available, it will be possible to realize solutions to such problems in a fraction of the time required by traditional methods. For certain types of problems, faster solutions are already possible using model networks implemented on vector or other massively parallel machines. It should also be possible, using existing technology, to build simplified networks that will allow detailed reconstructed event information to be used in fast trigger decisions. (orig.)

Limits on the Capacity of In-Band Full Duplex Communication in Uplink Cellular Networks

KAUST Repository

Randrianantenaina, Itsikiantsoa

2016-02-26

Simultaneous co-channel transmission and reception, denoted as in-band full duplex (FD) communication, has been promoted as an attractive solution to improve the spectral efficiency of cellular networks. However, in addition to the selfinterference problem, cross-mode interference (i.e., between uplink and downlink) imposes a major obstacle for the deployment of FD communication in cellular networks. More specifically, the downlink to uplink interference represents the performance bottleneck for FD operation due to the uplink limited transmission power and venerable operation when compared to the downlink counterpart. While the positive impact of FD communication to the downlink performance has been proved in the literature, its effect on the uplink transmission has been neglected. This paper focuses on the effect of downlink interference on the uplink transmission in FD cellular networks in order to see whether FD communication is beneficial for the uplink transmission or not, and if yes for which type of network. To quantify the expected performance gains, we derive a closed form expression of the maximum achievable uplink capacity in FD cellular networks. In contrast to the downlink capacity which always improves with FD communication, our results show that the uplink performance may improves or degrades depending on the associated network parameters. Particularly, we show that the intensity of base stations (BSs) has a more prominent effect on the uplink performance than their transmission power.

Limits on the Capacity of In-Band Full Duplex Communication in Uplink Cellular Networks

KAUST Repository

Randrianantenaina, Itsikiantsoa; Elsawy, Hesham; Alouini, Mohamed-Slim

2016-01-01

Simultaneous co-channel transmission and reception, denoted as in-band full duplex (FD) communication, has been promoted as an attractive solution to improve the spectral efficiency of cellular networks. However, in addition to the selfinterference problem, cross-mode interference (i.e., between uplink and downlink) imposes a major obstacle for the deployment of FD communication in cellular networks. More specifically, the downlink to uplink interference represents the performance bottleneck for FD operation due to the uplink limited transmission power and venerable operation when compared to the downlink counterpart. While the positive impact of FD communication to the downlink performance has been proved in the literature, its effect on the uplink transmission has been neglected. This paper focuses on the effect of downlink interference on the uplink transmission in FD cellular networks in order to see whether FD communication is beneficial for the uplink transmission or not, and if yes for which type of network. To quantify the expected performance gains, we derive a closed form expression of the maximum achievable uplink capacity in FD cellular networks. In contrast to the downlink capacity which always improves with FD communication, our results show that the uplink performance may improves or degrades depending on the associated network parameters. Particularly, we show that the intensity of base stations (BSs) has a more prominent effect on the uplink performance than their transmission power.

Area Green Efficiency (AGE) of Two Tier Heterogeneous Cellular Networks

KAUST Repository

Tabassum, Hina

2012-10-03

Small cell networks are becoming standard part of the future heterogeneous networks. In this paper, we consider a two tier heterogeneous network which promises energy savings by integrating the femto and macro cellular networks and thereby reducing CO2 emissions, operational and capital expenditures (OPEX and CAPEX) whilst enhancing the area spectral efficiency (ASE) of the network. In this context, we define a performance metric which characterize the aggregate energy savings per unit macrocell area and is referred to as area green efficiency (AGE) of the two tier heterogeneous network where the femto base stations are arranged around the edge of the reference macrocell such that the configuration is referred to as femto-on-edge (FOE). The mobile users in macro and femto cellular networks are transmitting with the adaptive power while maintaining the desired link quality such that the energy aware FOE configuration mandates to (i) save energy, and (ii) reduce the co-channel interference. We present a mathematical analysis to incorporate the uplink power control mechanism adopted by the mobile users and calibrate the uplink ASE and AGE of the energy aware FOE configuration. Next, we derive analytical expressions to compute the bounds on the uplink ASE of energy aware FOE configuration and demonstrate that the derived bounds are useful in evaluating the ASE under worst and best case interference scenarios. Simulation results are produced to demonstrate the ASE and AGE improvements in comparison to macro-only and macro-femto configuration with uniformly distributed femtocells.

Towards the Robotic “Avatar”: An Extensive Survey of the Cooperation between and within Networked Mobile Sensors

Directory of Open Access Journals (Sweden)

Aydan M. Erkmen

2010-09-01

Full Text Available Cooperation between networked mobile sensors, wearable and sycophant sensor networks with parasitically sticking agents, and also having human beings involved in the loop is the “Avatarization” within the robotic research community, where all networks are connected and where you can connect/disconnect at any time to acquire data from a vast unstructured world. This paper extensively surveys the networked robotic foundations of this robotic biological “Avatar” that awaits us in the future. Cooperation between networked mobile sensors as well as cooperation of nodes within a network are becoming more robust, fault tolerant and enable adaptation of the networks to changing environment conditions. In this paper, we survey and comparatively discuss the current state of networked robotics via their critical application areas and their design characteristics. We conclude by discussing future challenges.

Distributed Velocity-Dependent Protocol for Multihop Cellular Sensor Networks

Directory of Open Access Journals (Sweden)

Jagyasi Bhushan

2009-01-01

Full Text Available Abstract Cell phones are embedded with sensors form a Cellular Sensor Network which can be used to localize a moving event. The inherent mobility of the application and of the cell phone users warrants distributed structure-free data aggregation and on-the-fly routing. We propose a Distributed Velocity-Dependent (DVD protocol to localize a moving event using a Multihop Cellular Sensor Network (MCSN. DVD is based on a novel form of connectivity determined by the waiting time of nodes for a Random Waypoint (RWP distribution of cell phone users. This paper analyzes the time-stationary and spatial distribution of the proposed waiting time to explain the superior event localization and delay performances of DVD over the existing Randomized Waiting (RW protocol. A sensitivity analysis is also performed to compare the performance of DVD with RW and the existing Centralized approach.

Evolution of Positioning Techniques in Cellular Networks, from 2G to 4G

Directory of Open Access Journals (Sweden)

Rafael Saraiva Campos

2017-01-01

Full Text Available This review paper presents within a common framework the mobile station positioning methods applied in 2G, 3G, and 4G cellular networks, as well as the structure of the related 3GPP technical specifications. The evolution path through the generations is explored in three steps at each level: first, the new network elements supporting localization features are introduced; then, the standard localization methods are described; finally, the protocols providing specific support to mobile station positioning are studied. To allow a better understanding, this paper also brings a brief review of the cellular networks evolution paths.

The dynamic consequences of cooperation and competition in small-world networks.

Directory of Open Access Journals (Sweden)

Iván Y Fernández-Rosales

Full Text Available We present a study of the social dynamics among cooperative and competitive actors interacting on a complex network that has a small-world topology. In this model, the state of each actor depends on its previous state in time, its inertia to change, and the influence of its neighboring actors. Using numerical simulations, we determine how the distribution of final states of the actors and measures of the distances between the values of the actors at local and global levels, depend on the number of cooperative to competitive actors and the connectivity of the actors in the network. We find that similar numbers of cooperative and competitive actors yield the lowest values for the local and global measures of the distances between the values of the actors. On the other hand, when the number of either cooperative or competitive actors dominate the system, then the divergence is largest between the values of the actors. Our findings make new testable predictions on how the dynamics of a conflict depends on the strategies chosen by groups of actors and also have implications for the evolution of behaviors.

Dependency links can hinder the evolution of cooperation in the prisoner's dilemma game on lattices and networks.

Directory of Open Access Journals (Sweden)

Xuwen Wang

Full Text Available Networks with dependency links are more vulnerable when facing the attacks. Recent research also has demonstrated that the interdependent groups support the spreading of cooperation. We study the prisoner's dilemma games on spatial networks with dependency links, in which a fraction of individual pairs is selected to depend on each other. The dependency individuals can gain an extra payoff whose value is between the payoff of mutual cooperation and the value of temptation to defect. Thus, this mechanism reflects that the dependency relation is stronger than the relation of ordinary mutual cooperation, but it is not large enough to cause the defection of the dependency pair. We show that the dependence of individuals hinders, promotes and never affects the cooperation on regular ring networks, square lattice, random and scale-free networks, respectively. The results for the square lattice and regular ring networks are demonstrated by the pair approximation.

Green collaboration in cognitive radio cellular networks with roaming and spectrum trading

KAUST Repository

Sboui, Lokman; Ghazzai, Hakim; Rezki, Zouheir; Alouini, Mohamed-Slim

2015-01-01

In this paper, we propose a new cognitive cellular network architecture based on the coexistence of primary and secondary networks, (PN) and (SN), respectively. The PN aims to minimize its energy consumption by switching off the maximum number

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

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.

Cooperative Content Distribution over Wireless Networks for Energy and Delay Minimization

KAUST Repository

Atat, Rachad

2012-06-01

Content distribution with mobile-to-mobile cooperation is studied. Data is sent to mobile terminals on a long range link then the terminals exchange the content using an appropriate short range wireless technology. Unicasting and multicasting are investigated, both on the long range and short range links. Energy minimization is formulated as an optimization problem for each scenario, and the optimal solutions are determined in closed form. Moreover, the schemes are applied in public safety vehicular networks, where Long Term Evolution (LTE) network is used for the long range link, while IEEE 802.11 p is considered for inter-vehicle collaboration on the short range links. Finally, relay-based multicasting is applied in high speed trains for energy and delay minimization. Results show that cooperative schemes outperform non-cooperative ones and other previous related work in terms of energy and delay savings. Furthermore, practical implementation aspects of the proposed methods are also discussed.

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

An active cooperation-aware spectrum allocation mechanism for body sensor networks.

Science.gov (United States)

Jiang, Fu; Guo, Ying; Peng, Jun; Hu, Jiankun

2015-01-28

A cognitive radio-based spectrum allocation scheme using an active cooperative-aware mechanism is proposed in this paper. The scheme ensures that the primary user and secondary users cooperate actively for their own benefits. The primary user releases some spectrum resources to secondary users to actively stimulate them to actively join the cooperative transmission of the primary user, and secondary users help the primary user to relay data in return, as well as its self-data transmission at the same time. The Stackelberg game is used to evenly and jointly optimize the utilities of both the primary and secondary users. Simulation results show that the proposed active cooperation-aware mechanism could improve the body sensor network performance.

Cognitive strategies take advantage of the cooperative potential of heterogeneous networks

International Nuclear Information System (INIS)

Vukov, Jeromos; Santos, Francisco C; Pacheco, Jorge M

2012-01-01

Understanding the emergence and maintenance of cooperation is one of the most challenging topics of our time. Evolutionary game theory offers a very flexible framework within which to address this challenge. Here we use the prisoner's dilemma game to investigate the performance of individuals who are capable of adopting reactive strategies in communities structurally organized by means of Barabási-Albert scale-free networks. We find that basic cognitive abilities, such as the capability to distinguish their partners and act according to their previous actions, enable cooperation to thrive. This result is particularly significant whenever fear is the leading social tension, as this fosters retaliation, thus enforcing and sustaining cooperation. Being able to simultaneously reward fellow cooperators and punish defectors proves instrumental in achieving cooperation and the welfare of the community. As a result, central individuals can successfully lead the community and turn defective players into cooperative ones. Finally, even when participation costs—known to be detrimental to cooperation in scale-free networks—are explicitly included, we find that basic cognitive abilities have enough potential to help cooperation to prevail. (paper)

PV-Powered CoMP-Based Green Cellular Networks with a Standby Grid Supply

Directory of Open Access Journals (Sweden)

Abu Jahid

2017-01-01

Full Text Available This paper proposes a novel framework for PV-powered cellular networks with a standby grid supply and an essential energy management technique for achieving envisaged green networks. The proposal considers an emerging cellular network architecture employing two types of coordinated multipoint (CoMP transmission techniques for serving the subscribers. Under the proposed framework, each base station (BS is powered by an individual PV solar energy module having an independent storage device. BSs are also connected to the conventional grid supply for meeting additional energy demand. We also propose a dynamic inter-BS solar energy sharing policy through a transmission line for further greening the proposed network by minimizing the consumption from the grid supply. An extensive simulation-based study in the downlink of a Long-Term Evolution (LTE cellular system is carried out for evaluating the energy efficiency performance of the proposed framework. System performance is also investigated for identifying the impact of various system parameters including storage factor, storage capacity, solar generation capacity, transmission line loss, and different CoMP techniques.

Cognitive Relay Networks: A Comprehensive Survey

Directory of Open Access Journals (Sweden)

Ayesha Naeem

2015-07-01

Full Text Available Cognitive radio is an emerging technology to deal with the scarcity and requirement of radio spectrum by dynamically assigning spectrum to unlicensed user . This revolutionary technology shifts the paradigm in the wireless system design by all owing unlicensed user the ability to sense, adapt and share the dynamic spectrum. Cognitive radio technology have been applied to different networks and applications ranging from wireless to public saf ety, smart grid, medical, rela y and cellular applications to increase the throughput and spectrum efficiency of the network. Among these applications, cognitive relay networks is one of the application where cognitive radio technology has been applied. Cognitiv e rela y network increases the network throughput by reducing the complete pa th loss and also by ensuring cooper ation among secondary users and cooperation among primary and secondary users. In this paper , our aim is to provide a survey on cognitive relay network. We also provide a detailed review on existing schemes in cognitive relay networks on the basis of relaying protocol, relay cooperation and channel model.

Detection of silent cells, synchronization and modulatory activity in developing cellular networks.

NARCIS (Netherlands)

Hjorth, J.J.J.; Dawitz, J.; Kroon, T.; da Silva Dias Pires, J.H.; Dassen, V.J.; Berkhout, J.A.; Emperador Melero, J.; Nadadhur, A.G.; Alevra, M.; Toonen, R.F.G.; Heine, V.M.; Mansvelder, H.D.; Meredith, R.M.

2016-01-01

Developing networks in the immature nervous system and in cellular cultures are characterized by waves of synchronous activity in restricted clusters of cells. Synchronized activity in immature networks is proposed to regulate many different developmental processes, from neuron growth and cell

Cooperative driving in mixed traffic networks - Optimizing for performance

NARCIS (Netherlands)

Calvert, S.C.; Broek, T.H.A. van den; Noort, M. van

2012-01-01

This paper discusses a cooperative adaptive cruise control application and its effects on the traffic system. In previous work this application has been tested on the road, and traffic simulation has been used to scale up the results of the field test to larger networks and more vehicles. The

On the holistic approach in cellular and cancer biology: nonlinearity, complexity, and quasi-determinism of the dynamic cellular network.

Science.gov (United States)

Waliszewski, P; Molski, M; Konarski, J

1998-06-01

A keystone of the molecular reductionist approach to cellular biology is a specific deductive strategy relating genotype to phenotype-two distinct categories. This relationship is based on the assumption that the intermediary cellular network of actively transcribed genes and their regulatory elements is deterministic (i.e., a link between expression of a gene and a phenotypic trait can always be identified, and evolution of the network in time is predetermined). However, experimental data suggest that the relationship between genotype and phenotype is nonbijective (i.e., a gene can contribute to the emergence of more than just one phenotypic trait or a phenotypic trait can be determined by expression of several genes). This implies nonlinearity (i.e., lack of the proportional relationship between input and the outcome), complexity (i.e. emergence of the hierarchical network of multiple cross-interacting elements that is sensitive to initial conditions, possesses multiple equilibria, organizes spontaneously into different morphological patterns, and is controlled in dispersed rather than centralized manner), and quasi-determinism (i.e., coexistence of deterministic and nondeterministic events) of the network. Nonlinearity within the space of the cellular molecular events underlies the existence of a fractal structure within a number of metabolic processes, and patterns of tissue growth, which is measured experimentally as a fractal dimension. Because of its complexity, the same phenotype can be associated with a number of alternative sequences of cellular events. Moreover, the primary cause initiating phenotypic evolution of cells such as malignant transformation can be favored probabilistically, but not identified unequivocally. Thermodynamic fluctuations of energy rather than gene mutations, the material traits of the fluctuations alter both the molecular and informational structure of the network. Then, the interplay between deterministic chaos, complexity, self

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.

Conceptual Considerations for Reducing the Computational Complexity in Software Defined Radio using Cooperative Wireless Networks

DEFF Research Database (Denmark)

Kristensen, Jesper Michael; Fitzek, Frank H. P.; Koch, Peter

2005-01-01

the expected increase in complexity leading to a decrease in energy efficiency, cooperative wireless networks are introduced. Cooperative wireless networks enables the concept of resource sharing. Resource sharing is interpreted as collaborative signal processing. This interpretation leads to the concept...... of a distributed signal processor. OFDM and the principle of FFT is described as an example of collaborative signal processing....

Exponential stability of delayed fuzzy cellular neural networks with diffusion

International Nuclear Information System (INIS)

Huang Tingwen

2007-01-01

The exponential stability of delayed fuzzy cellular neural networks (FCNN) with diffusion is investigated. Exponential stability, significant for applications of neural networks, is obtained under conditions that are easily verified by a new approach. Earlier results on the exponential stability of FCNN with time-dependent delay, a special case of the model studied in this paper, are improved without using the time-varying term condition: dτ(t)/dt < μ

Multihop Capability Analysis in Wireless Information and Power Transfer Multirelay Cooperative Networks

Directory of Open Access Journals (Sweden)

Qilin Wu

2018-01-01

Full Text Available We study simultaneous wireless information and power transfer (SWIPT in multihop wireless cooperative networks, where the multihop capability that denotes the largest number of transmission hops is investigated. By utilizing the broadcast nature of multihop wireless networks, we first propose a cooperative forwarding power (CFP scheme. In CFP scheme, the multiple relays and receiver have distinctly different tasks. Specifically, multiple relays close to the transmitter harvest power from the transmitter first and then cooperatively forward the power (not the information towards the receiver. The receiver receives the information (not the power from the transmitter first, and then it harvests the power from the relays and is taken as the transmitter of the next hop. Furthermore, for performance comparison, we suggest two schemes: cooperative forwarding information and power (CFIP and direct receiving information and power (DFIP. Also, we construct an analysis model to investigate the multihop capabilities of CFP, CFIP, and DFIP schemes under the given targeted throughput requirement. Finally, simulation results validate the analysis model and show that the multihop capability of CFP is better than CFIP and DFIP, and for improving the multihop capabilities, it is best effective to increase the average number of relay nodes in cooperative set.

An Active Cooperation-Aware Spectrum Allocation Mechanism for Body Sensor Networks

Directory of Open Access Journals (Sweden)

Fu Jiang

2015-01-01

Full Text Available A cognitive radio-based spectrum allocation scheme using an active cooperative-aware mechanism is proposed in this paper. The scheme ensures that the primary user and secondary users cooperate actively for their own benefits. The primary user releases some spectrum resources to secondary users to actively stimulate them to actively join the cooperative transmission of the primary user, and secondary users help the primary user to relay data in return, as well as its self-data transmission at the same time. The Stackelberg game is used to evenly and jointly optimize the utilities of both the primary and secondary users. Simulation results show that the proposed active cooperation-aware mechanism could improve the body sensor network performance.

LTE-A cellular networks multi-hop relay for coverage, capacity and performance enhancement

CERN Document Server

Yahya, Abid

2017-01-01

In this book, three different methods are presented to enhance the capacity and coverage area in LTE-A cellular networks. The scope involves the evaluation of the effect of the RN location in terms of capacity and the determination of the optimum location of the relay that provides maximum achievable data rate for users with limited interference at the cell boundaries. This book presents a new model to enhance both capacity and coverage area in LTE-A cellular network by determining the optimum location for the RN with limited interference. The new model is designed to enhance the capacity of the relay link by employing two antennas in RN. This design enables the relay link to absorb more users at cell edge regions. An algorithm called the Balance Power Algorithm (BPA) is developed to reduce MR power consumption. The book pertains to postgraduate students and researchers in wireless & mobile communications. Provides a variety of methods for enhancing capacity and coverage in LTE-A cellular networks Develop...

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.

A learning algorithm for oscillatory cellular neural networks.

Science.gov (United States)

Ho, C Y.; Kurokawa, H

1999-07-01

We present a cellular type oscillatory neural network for temporal segregation of stationary input patterns. The model comprises an array of locally connected neural oscillators with connections limited to a 4-connected neighborhood. The architecture is reminiscent of the well-known cellular neural network that consists of local connection for feature extraction. By means of a novel learning rule and an initialization scheme, global synchronization can be accomplished without incurring any erroneous synchrony among uncorrelated objects. Each oscillator comprises two mutually coupled neurons, and neurons share a piecewise-linear activation function characteristic. The dynamics of traditional oscillatory models is simplified by using only one plastic synapse, and the overall complexity for hardware implementation is reduced. Based on the connectedness of image segments, it is shown that global synchronization and desynchronization can be achieved by means of locally connected synapses, and this opens up a tremendous application potential for the proposed architecture. Furthermore, by using special grouping synapses it is demonstrated that temporal segregation of overlapping gray-level and color segments can also be achieved. Finally, simulation results show that the learning rule proposed circumvents the problem of component mismatches, and hence facilitates a large-scale integration.

On mode selection and power control for uplink D2D communication in cellular networks

KAUST Repository

Ali, Konpal S.

2015-06-08

Device-to-device (D2D) communication enables users lying in close proximity to bypass the cellular base station (BS) and transmit to one another directly. This offloads traffic from the cellular network, improves spatial frequency reuse and energy efficiency in the network. We present a comprehensive and tractable analytical framework for D2D-enabled uplink cellular networks with two different flexible mode-selection schemes. The power-control cutoff thresholds of the two communication modes have been decoupled unlike past work on the subject. We find that for a given network, an optimal value exists not only for the biased mode selection criterion, but also for r, the ratio of the power-control cutoff thresholds of the two communication modes, which maximizes spatial spectral efficiency. Also, r turns out to be a more robust parameter for optimizing network performance. Further, it is shown that the second scheme, which prioritizes spatial frequency reuse over the per-user achievable performance compared to the first scheme, achieves almost the same overall network performance; thereby trading per user performance to serve a larger number of users.

On mode selection and power control for uplink D2D communication in cellular networks

KAUST Repository

Ali, Konpal S.; Elsawy, Hesham; Alouini, Mohamed-Slim

2015-01-01

Device-to-device (D2D) communication enables users lying in close proximity to bypass the cellular base station (BS) and transmit to one another directly. This offloads traffic from the cellular network, improves spatial frequency reuse and energy efficiency in the network. We present a comprehensive and tractable analytical framework for D2D-enabled uplink cellular networks with two different flexible mode-selection schemes. The power-control cutoff thresholds of the two communication modes have been decoupled unlike past work on the subject. We find that for a given network, an optimal value exists not only for the biased mode selection criterion, but also for r, the ratio of the power-control cutoff thresholds of the two communication modes, which maximizes spatial spectral efficiency. Also, r turns out to be a more robust parameter for optimizing network performance. Further, it is shown that the second scheme, which prioritizes spatial frequency reuse over the per-user achievable performance compared to the first scheme, achieves almost the same overall network performance; thereby trading per user performance to serve a larger number of users.

A dynamically coupled allosteric network underlies binding cooperativity in Src kinase.

Science.gov (United States)

Foda, Zachariah H; Shan, Yibing; Kim, Eric T; Shaw, David E; Seeliger, Markus A

2015-01-20

Protein tyrosine kinases are attractive drug targets because many human diseases are associated with the deregulation of kinase activity. However, how the catalytic kinase domain integrates different signals and switches from an active to an inactive conformation remains incompletely understood. Here we identify an allosteric network of dynamically coupled amino acids in Src kinase that connects regulatory sites to the ATP- and substrate-binding sites. Surprisingly, reactants (ATP and peptide substrates) bind with negative cooperativity to Src kinase while products (ADP and phosphopeptide) bind with positive cooperativity. We confirm the molecular details of the signal relay through the allosteric network by biochemical studies. Experiments on two additional protein tyrosine kinases indicate that the allosteric network may be largely conserved among these enzymes. Our work provides new insights into the regulation of protein tyrosine kinases and establishes a potential conduit by which resistance mutations to ATP-competitive kinase inhibitors can affect their activity.

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.

Modeling the cooperative and competitive contagions in online social networks

Science.gov (United States)

Zhuang, Yun-Bei; Chen, J. J.; Li, Zhi-hong

2017-10-01

The wide adoption of social media has increased the interaction among different pieces of information, and this interaction includes cooperation and competition for our finite attention. While previous research focus on fully competition, this paper extends the interaction to be both "cooperation" and "competition", by employing an IS1S2 R model. To explore how two different pieces of information interact with each other, the IS1S2 R model splits the agents into four parts-(Ignorant-Spreader I-Spreader II-Stifler), based on SIR epidemic spreading model. Using real data from Weibo.com, a social network site similar to Twitter, we find some parameters, like decaying rates, can both influence the cooperative diffusion process and the competitive process, while other parameters, like infectious rates only have influence on the competitive diffusion process. Besides, the parameters' effect are more significant in the competitive diffusion than in the cooperative diffusion.

Cooperative HARQ Assisted NOMA Scheme in Large-scale D2D Networks

KAUST Repository

Shi, Zheng; Ma, Shaodan; Elsawy, Hesham; Yang, Guanghua; Alouini, Mohamed-Slim

2017-01-01

spatial and temporal correlation in interference, highly overestimates the NOMA performance and produces misleading design insights. An interference oblivious selection for the power and/or transmission rates leads to violating the network outage constraints. To this end, the results demonstrate the effectiveness of NOMA transmission and manifest the importance of the cooperative HARQ to combat the negative effect of the network aggregate interference. For instance, comparing to the non-cooperative HARQ assisted NOMA, the proposed scheme can yield an outage probability reduction by $32$%. Furthermore, an interference aware optimal design that maximizes the LTAT given outage constraints leads to $47$% throughput improvement over HARQ-assisted orthogonal multiple access (OMA) scheme.

A model for the emergence of cooperation, interdependence, and structure in evolving networks

Science.gov (United States)

Jain, Sanjay; Krishna, Sandeep

2001-01-01

Evolution produces complex and structured networks of interacting components in chemical, biological, and social systems. We describe a simple mathematical model for the evolution of an idealized chemical system to study how a network of cooperative molecular species arises and evolves to become more complex and structured. The network is modeled by a directed weighted graph whose positive and negative links represent "catalytic" and "inhibitory" interactions among the molecular species, and which evolves as the least populated species (typically those that go extinct) are replaced by new ones. A small autocatalytic set, appearing by chance, provides the seed for the spontaneous growth of connectivity and cooperation in the graph. A highly structured chemical organization arises inevitably as the autocatalytic set enlarges and percolates through the network in a short analytically determined timescale. This self organization does not require the presence of self-replicating species. The network also exhibits catastrophes over long timescales triggered by the chance elimination of "keystone" species, followed by recoveries.

Networks and RegionalCompetitiveness: Towards a Transaction Cost Approach of Small-Scale Cooperation

Directory of Open Access Journals (Sweden)

Daniel Friel

2005-06-01

Full Text Available A preoccupation with competition often dominates the study of governance. A focus on competition often unnecessarily precludes the possibility that regional institutions can suspend competition in certain areas and facilitate cooperation among potential rivals, thereby potentially contributing to their mutual success. In many ways companies cooperating through these types of networks have a greater degree of flexibility than firms which are forced to rely solely on hierarchies or markets for solutions to their problems. In order to fully understand how such networks work, this article first parses out differences in definitions of networks in order to understand how the type of network mentioned above actually differs from other uses of this term. Then it develops a theory of governance that goes beyond hierarchies and markets by demonstrating how this type of network can lead to reductions in transaction costs. This claim is illustrated on hand from examples of alternative forms of organization in Germany and Italy.

Modeling cellular networks in fading environments with dominant specular components

KAUST Repository

Alammouri, Ahmad; Elsawy, Hesham; Salem, Ahmed Sultan; Di Renzo, Marco; Alouini, Mohamed-Slim

2016-01-01

to the Nakagami-m fading in some special cases. However, neither the Rayleigh nor the Nakagami-m accounts for dominant specular components (DSCs) which may appear in realistic fading channels. In this paper, we present a tractable model for cellular networks

Global exponential stability of fuzzy cellular neural networks with delays and reaction-diffusion terms

International Nuclear Information System (INIS)

Wang Jian; Lu Junguo

2008-01-01

In this paper, we study the global exponential stability of fuzzy cellular neural networks with delays and reaction-diffusion terms. By constructing a suitable Lyapunov functional and utilizing some inequality techniques, we obtain a sufficient condition for the uniqueness and global exponential stability of the equilibrium solution for a class of fuzzy cellular neural networks with delays and reaction-diffusion terms. The result imposes constraint conditions on the network parameters independently of the delay parameter. The result is also easy to check and plays an important role in the design and application of globally exponentially stable fuzzy neural circuits

Device-to-Device Underlay Cellular Networks with Uncertain Channel State Information

KAUST Repository

Memmi, Amen

2016-01-06

Device-to-Device (D2D) communications underlying the cellular infrastructure is a technology that has recently been proposed as a promising solution to enhance cellular network capabilities: It improves spectrum utilization, overall throughput and energy efficiency while enabling new peer-to-peer and location-based applications and services. However, interference is the major challenge since the same resources are shared by both systems. Therefore, interference management techniques are required to keep the interference under control. In this work, in order to mitigate interference, we consider centralized and distributed power control algorithms in a one-cell random network model. Differently from previous works, we are assuming that the channel state information (CSI) may be imperfect and include estimation errors. We evaluate how this uncertainty impacts performances.

Dry Ports-Seaports Sustainable Logistics Network Optimization: Considering the Environment Constraints and the Concession Cooperation Relationships

Directory of Open Access Journals (Sweden)

Wei Hairui

2017-11-01

Full Text Available In China dry ports enter into a rapid development period now, however for many Chinese dry ports, the operation faces difficulties duo to inefficient logistics networks and cooperation relationship between dry ports and seaports. Focusing on the concession cooperation mechanism of seaports and dry ports, and the environmental constraints (carbon emissions and congestion cost, a bi-objective location-allocation MILP model for the sustainable hinterland-dry ports-seaports logistics network optimization is formulated, aiming at the system logistics costs and carbon emissions to be minimized. Moreover, for the cooperation mechanism of seaports to dry ports, a parameter called cooperation cost concession coefficient is proposed for the optimization model, and a new evaluation method based on the ordered weighted averaging (OWA operator is used to evaluate it. Then a location-allocation decision-making framework for the hinterland-dry port-seaport logistics network is proposed. The innovative aspect of the model is that it can proposes a effective and environment friendly dry ports location strategic and also give insights into the connective cooperation relationships, and cargo flows of the network. A case study involving configuration of dry ports in Henan Province is conducted, and the model is successfully applied.

Phase transitions in cooperative coinfections: Simulation results for networks and lattices

Science.gov (United States)

Grassberger, Peter; Chen, Li; Ghanbarnejad, Fakhteh; Cai, Weiran

2016-04-01

We study the spreading of two mutually cooperative diseases on different network topologies, and with two microscopic realizations, both of which are stochastic versions of a susceptible-infected-removed type model studied by us recently in mean field approximation. There it had been found that cooperativity can lead to first order transitions from spreading to extinction. However, due to the rapid mixing implied by the mean field assumption, first order transitions required nonzero initial densities of sick individuals. For the stochastic model studied here the results depend strongly on the underlying network. First order transitions are found when there are few short but many long loops: (i) No first order transitions exist on trees and on 2-d lattices with local contacts. (ii) They do exist on Erdős-Rényi (ER) networks, on d -dimensional lattices with d ≥4 , and on 2-d lattices with sufficiently long-ranged contacts. (iii) On 3-d lattices with local contacts the results depend on the microscopic details of the implementation. (iv) While single infected seeds can always lead to infinite epidemics on regular lattices, on ER networks one sometimes needs finite initial densities of infected nodes. (v) In all cases the first order transitions are actually "hybrid"; i.e., they display also power law scaling usually associated with second order transitions. On regular lattices, our model can also be interpreted as the growth of an interface due to cooperative attachment of two species of particles. Critically pinned interfaces in this model seem to be in different universality classes than standard critically pinned interfaces in models with forbidden overhangs. Finally, the detailed results mentioned above hold only when both diseases propagate along the same network of links. If they use different links, results can be rather different in detail, but are similar overall.

Analyzing the impact of relay station characteristics on uplink performance in cellular network

NARCIS (Netherlands)

Dimitrova, D.C.; van den Berg, Hans Leo; Heijenk, Geert

2009-01-01

Uplink users in cellular networks, such as UMTS/ HSPA, located at the edge of the cell generally suffer from poor channel conditions. Deploying intermediate relay nodes is seen as a promising approach towards extending cell coverage. This paper focuses on the role of packet scheduling in cellular

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

Power Control for D2D Underlay Cellular Networks with Imperfect CSI

KAUST Repository

Memmi, Amen

2017-02-09

Device-to-Device communications underlying the cellular infrastructure is a technology that has recently been proposed as a promising solution to enhance cellular network capabilities. However, interference is the major challenge since the same resources are shared by both systems. Therefore, interference management techniques are required to keep the interference under control. In this work, in order to mitigate interference, we consider centralized and distributed power control algorithms in a one-cell random network model. Differently from previous works, we are assuming that the channel state information may be imperfect and include estimation errors. We evaluate how this uncertainty impacts performances. In the centralized approach, we derive the optimal powers that maximize the coverage probability and the rate of the cellular user while scheduling as many D2D links as possible. These powers are computed at the base station (BS) and then delivered to the users, and hence the name

An Asynchronous Recurrent Network of Cellular Automaton-Based Neurons and Its Reproduction of Spiking Neural Network Activities.

Science.gov (United States)

Matsubara, Takashi; Torikai, Hiroyuki

2016-04-01

Modeling and implementation approaches for the reproduction of input-output relationships in biological nervous tissues contribute to the development of engineering and clinical applications. However, because of high nonlinearity, the traditional modeling and implementation approaches encounter difficulties in terms of generalization ability (i.e., performance when reproducing an unknown data set) and computational resources (i.e., computation time and circuit elements). To overcome these difficulties, asynchronous cellular automaton-based neuron (ACAN) models, which are described as special kinds of cellular automata that can be implemented as small asynchronous sequential logic circuits have been proposed. This paper presents a novel type of such ACAN and a theoretical analysis of its excitability. This paper also presents a novel network of such neurons, which can mimic input-output relationships of biological and nonlinear ordinary differential equation model neural networks. Numerical analyses confirm that the presented network has a higher generalization ability than other major modeling and implementation approaches. In addition, Field-Programmable Gate Array-implementations confirm that the presented network requires lower computational resources.

Network-Coded Content Delivery in Femtocaching-Assisted Cellular Networks

KAUST Repository

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

2015-01-01

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

Network-Coded Content Delivery in Femtocaching-Assisted Cellular Networks

KAUST Repository

Shnaiwer, Yousef N.

2015-12-06

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

Modeling cellular networks in fading environments with dominant specular components

KAUST Repository

AlAmmouri, Ahmad

2016-07-26

Stochastic geometry (SG) has been widely accepted as a fundamental tool for modeling and analyzing cellular networks. However, the fading models used with SG analysis are mainly confined to the simplistic Rayleigh fading, which is extended to the Nakagami-m fading in some special cases. However, neither the Rayleigh nor the Nakagami-m accounts for dominant specular components (DSCs) which may appear in realistic fading channels. In this paper, we present a tractable model for cellular networks with generalized two-ray (GTR) fading channel. The GTR fading explicitly accounts for two DSCs in addition to the diffuse components and offers high flexibility to capture diverse fading channels that appear in realistic outdoor/indoor wireless communication scenarios. It also encompasses the famous Rayleigh and Rician fading as special cases. To this end, the prominent effect of DSCs is highlighted in terms of average spectral efficiency. © 2016 IEEE.

Team Cooperation in a Network of Multi-Vehicle Unmanned Systems Synthesis of Consensus Algorithms

CERN Document Server

Semsar-Kazerooni, Elham

2013-01-01

Team Cooperation in a Network of Multi-Vehicle Unmanned Systems develops a framework for modeling and control of a network of multi-agent unmanned systems in a cooperative manner and with consideration of non-ideal and practical considerations. The main focus of this book is the development of “synthesis-based” algorithms rather than on conventional “analysis-based” approaches to the team cooperation, specifically the team consensus problems. The authors provide a set of modified “design-based” consensus algorithms whose optimality is verified through introduction of performance indices. This book also: Provides synthesis-based methodology for team cooperation Introduces a consensus-protocol optimized performance index  Offers comparisons for use of proper indices in measuring team performance Analyzes and predicts  performance of  previously designed consensus algorithms Analyses and predicts team behavior in the presence of non-ideal considerations such as actuator anomalies and faults as wel...

Universal Intelligent Small Cell (UnISCell for next generation cellular networks

Directory of Open Access Journals (Sweden)

Mohammad Patwary

2016-11-01

Full Text Available Exploring innovative cellular architectures to achieve enhanced system capacity and good coverage has become a critical issue towards realizing the next generation of wireless communications. In this context, this paper proposes a novel concept of Universal Intelligent Small Cell (UnISCell for enabling the densification of the next generation of cellular networks. The proposed novel concept envisions an integrated platform of providing a strong linkage between different stakeholders such as street lighting networks, landline telephone networks and future wireless networks, and is universal in nature being independent of the operating frequency bands and traffic types. The main motivating factors for the proposed small cell concept are the need of public infrastructure re-engineering, and the recent advances in several enabling technologies. First, we highlight the main concepts of the proposed UnISCell platform. Subsequently, we present two deployment scenarios for the proposed UnISCell concept considering infrastructure sharing and service sharing as important aspects. We then describe the key future technologies for enabling the proposed UnISCell concept and present a use case example with the help of numerical results. Finally, we conclude this article by providing some interesting future recommendations.

Towards the prediction of essential genes by integration of network topology, cellular localization and biological process information

Directory of Open Access Journals (Sweden)

Lemke Ney

2009-09-01

Full Text Available Abstract Background The identification of essential genes is important for the understanding of the minimal requirements for cellular life and for practical purposes, such as drug design. However, the experimental techniques for essential genes discovery are labor-intensive and time-consuming. Considering these experimental constraints, a computational approach capable of accurately predicting essential genes would be of great value. We therefore present here a machine learning-based computational approach relying on network topological features, cellular localization and biological process information for prediction of essential genes. Results We constructed a decision tree-based meta-classifier and trained it on datasets with individual and grouped attributes-network topological features, cellular compartments and biological processes-to generate various predictors of essential genes. We showed that the predictors with better performances are those generated by datasets with integrated attributes. Using the predictor with all attributes, i.e., network topological features, cellular compartments and biological processes, we obtained the best predictor of essential genes that was then used to classify yeast genes with unknown essentiality status. Finally, we generated decision trees by training the J48 algorithm on datasets with all network topological features, cellular localization and biological process information to discover cellular rules for essentiality. We found that the number of protein physical interactions, the nuclear localization of proteins and the number of regulating transcription factors are the most important factors determining gene essentiality. Conclusion We were able to demonstrate that network topological features, cellular localization and biological process information are reliable predictors of essential genes. Moreover, by constructing decision trees based on these data, we could discover cellular rules governing

Geostrategic Context of Networking of National Minority Communities in Territorial Cooperation Programmes of the EU

Directory of Open Access Journals (Sweden)

Márton Péti

2016-12-01

Full Text Available The participation of Hungary and Hungarian regions outside of Hungary in transnational and interregional programmes within the framework of the third objective (European Territorial Cooperation of the European Union's Cohesion Policy 2007-2013 is an indicator suitable for analysing the international networking activity of Central European national minorities. These programme areas are very well in alignment with the settlement areas of Hungarians and thus it provides a great opportunity for cooperation in the field of regional developments. The study on the participation of Hungarian organizations in and outside of Hungary in the programming period of 2007-2013 shows; however, that Hungarian organizations outside of Hungary only partly utilize their networking potential and they worked with organisations of the mother country in only a few projects. Policies on cooperation may contribute to further utilize this networking potential.

Cooperative joint precoding in a downlink cellular system with shared relay: Design and performance evaluation

KAUST Repository

Kwon, JaeWoo; Park, Kihong; Ko, Youngchai; Yang, Hongchuan

2012-01-01

In this paper, we investigate a relay enhanced cellular system, where a relay station is located in the overlap area served by two base stations. We propose cooperative joint precoding schemes for the downlink transmission of such relay enhanced cellular system to maximize the system capacity while minimizing the interference at both the relay station and the mobile stations. We formulate the optimization problems to maximize the system capacity and design the multiuser precoding vectors at each base station and the relay station. We quantify the ergodic rate performance of the proposed multiuser precoding schemes through statistical analysis. The extensively derived ergodic expressions will facilitate the accurate performance evaluation of the proposed transmission schemes. Numerical results show that the proposed schemes can effectively cancel the interference and improve the sum rate and the outage performance for cell edge users. © 2002-2012 IEEE.

Cooperative joint precoding in a downlink cellular system with shared relay: Design and performance evaluation

KAUST Repository

Kwon, JaeWoo

2012-10-01

In this paper, we investigate a relay enhanced cellular system, where a relay station is located in the overlap area served by two base stations. We propose cooperative joint precoding schemes for the downlink transmission of such relay enhanced cellular system to maximize the system capacity while minimizing the interference at both the relay station and the mobile stations. We formulate the optimization problems to maximize the system capacity and design the multiuser precoding vectors at each base station and the relay station. We quantify the ergodic rate performance of the proposed multiuser precoding schemes through statistical analysis. The extensively derived ergodic expressions will facilitate the accurate performance evaluation of the proposed transmission schemes. Numerical results show that the proposed schemes can effectively cancel the interference and improve the sum rate and the outage performance for cell edge users. © 2002-2012 IEEE.

Almost sure exponential stability of stochastic fuzzy cellular neural networks with delays

International Nuclear Information System (INIS)

Zhao Hongyong; Ding Nan; Chen Ling

2009-01-01

This paper is concerned with the problem of exponential stability analysis for fuzzy cellular neural network with delays. By constructing suitable Lyapunov functional and using stochastic analysis we present some sufficient conditions ensuring almost sure exponential stability for the network. Moreover, an example is given to demonstrate the advantages of our method.

Cooperative HARQ Assisted NOMA Scheme in Large-scale D2D Networks

KAUST Repository

Shi, Zheng

2017-07-13

This paper develops an interference aware design for cooperative hybrid automatic repeat request (HARQ) assisted non-orthogonal multiple access (NOMA) scheme for large-scale device-to-device (D2D) networks. Specifically, interference aware rate selection and power allocation are considered to maximize long term average throughput (LTAT) and area spectral efficiency (ASE). The design framework is based on stochastic geometry that jointly accounts for the spatial interference correlation at the NOMA receivers as well as the temporal interference correlation across HARQ transmissions. It is found that ignoring the effect of the aggregate interference, or overlooking the spatial and temporal correlation in interference, highly overestimates the NOMA performance and produces misleading design insights. An interference oblivious selection for the power and/or transmission rates leads to violating the network outage constraints. To this end, the results demonstrate the effectiveness of NOMA transmission and manifest the importance of the cooperative HARQ to combat the negative effect of the network aggregate interference. For instance, comparing to the non-cooperative HARQ assisted NOMA, the proposed scheme can yield an outage probability reduction by $32$%. Furthermore, an interference aware optimal design that maximizes the LTAT given outage constraints leads to $47$% throughput improvement over HARQ-assisted orthogonal multiple access (OMA) scheme.

Coevolution of Synchronization and Cooperation in Costly Networked Interactions

Science.gov (United States)

Antonioni, Alberto; Cardillo, Alessio

2017-06-01

Despite the large number of studies on synchronization, the hypothesis that interactions bear a cost for involved individuals has seldom been considered. The introduction of costly interactions leads, instead, to the formulation of a dichotomous scenario in which an individual may decide to cooperate and pay the cost in order to get synchronized with the rest of the population. Alternatively, the same individual can decide to free ride, without incurring any cost, waiting for others to get synchronized to his or her state. Thus, the emergence of synchronization may be seen as the byproduct of an evolutionary game in which individuals decide their behavior according to the benefit-to-cost ratio they accrued in the past. We study the onset of cooperation and synchronization in networked populations of Kuramoto oscillators and report how topology is essential in order for cooperation to thrive. We also display how different classes of topology foster synchronization differently both at microscopic and macroscopic levels.

On the area spectral efficiency improvement of heterogeneous network by exploiting the integration of macro-femto cellular networks

KAUST Repository

Shakir, Muhammad

2012-06-01

Heterogeneous networks are an attractive means of expanding mobile network capacity. A heterogeneous network is typically composed of multiple radio access technologies (RATs) where the base stations are transmitting with variable power. In this paper, we consider a Heterogeneous network where we complement the macrocell network with low-power low-cost user deployed nodes, such as femtocell base stations to increase the mean achievable capacity of the system. In this context, we integrate macro-femto cellular networks and derive the area spectral efficiency of the proposed two tier Heterogeneous network. We consider the deployment of femtocell base stations around the edge of the macrocell such that this configuration is referred to as femto-on-edge (FOE) configuration. Moreover, FOE configuration mandates reduction in intercell interference due to the mobile users which are located around the edge of the macrocell since these femtocell base stations are low-power nodes which has significantly lower transmission power than macrocell base stations. We present a mathematical analysis to calculate the instantaneous carrier to interference ratio (CIR) of the desired mobile user in macro and femto cellular networks and determine the total area spectral efficiency of the Heterogeneous network. Details of the simulation processes are included to support the analysis and show the efficacy of the proposed deployment. It has been shown that the proposed setup of the Heterogeneous network offers higher area spectral efficiency which aims to fulfill the expected demand of the future mobile users. © 2012 IEEE.

Ageing as a price of cooperation and complexity: self-organization of complex systems causes the gradual deterioration of constituent networks.

Science.gov (United States)

Kiss, Huba J M; Mihalik, Agoston; Nánási, Tibor; Ory, Bálint; Spiró, Zoltán; Soti, Csaba; Csermely, Peter

2009-06-01

The network concept is increasingly used for the description of complex systems. Here, we summarize key aspects of the evolvability and robustness of the hierarchical network set of macromolecules, cells, organisms and ecosystems. Listing the costs and benefits of cooperation as a necessary behaviour to build this network hierarchy, we outline the major hypothesis of the paper: the emergence of hierarchical complexity needs cooperation leading to the ageing (i.e. gradual deterioration) of the constituent networks. A stable environment develops cooperation leading to over-optimization, and forming an 'always-old' network, which accumulates damage, and dies in an apoptosis-like process. A rapidly changing environment develops competition forming a 'forever-young' network, which may suffer an occasional over-perturbation exhausting system resources, and causing death in a necrosis-like process. Giving a number of examples we demonstrate how cooperation evokes the gradual accumulation of damage typical to ageing. Finally, we show how various forms of cooperation and consequent ageing emerge as key elements in all major steps of evolution from the formation of protocells to the establishment of the globalized, modern human society.

Cooperative Mobile Web Browsing

DEFF Research Database (Denmark)

Perrucci, GP; Fitzek, FHP; Zhang, Qi

2009-01-01

This paper advocates a novel approach for mobile web browsing based on cooperation among wireless devices within close proximity operating in a cellular environment. In the actual state of the art, mobile phones can access the web using different cellular technologies. However, the supported data......-range links can then be used for cooperative mobile web browsing. By implementing the cooperative web browsing on commercial mobile phones, it will be shown that better performance is achieved in terms of increased data rate and therefore reduced access times, resulting in a significantly enhanced web...

Linear matrix inequality approach for synchronization control of fuzzy cellular neural networks with mixed time delays

International Nuclear Information System (INIS)

Balasubramaniam, P.; Kalpana, M.; Rakkiyappan, R.

2012-01-01

Fuzzy cellular neural networks (FCNNs) are special kinds of cellular neural networks (CNNs). Each cell in an FCNN contains fuzzy operating abilities. The entire network is governed by cellular computing laws. The design of FCNNs is based on fuzzy local rules. In this paper, a linear matrix inequality (LMI) approach for synchronization control of FCNNs with mixed delays is investigated. Mixed delays include discrete time-varying delays and unbounded distributed delays. A dynamic control scheme is proposed to achieve the synchronization between a drive network and a response network. By constructing the Lyapunov—Krasovskii functional which contains a triple-integral term and the free-weighting matrices method an improved delay-dependent stability criterion is derived in terms of LMIs. The controller can be easily obtained by solving the derived LMIs. A numerical example and its simulations are presented to illustrate the effectiveness of the proposed method. (interdisciplinary physics and related areas of science and technology)

Assessing the weather monitoring capabilities of cellular microwave link networks

Science.gov (United States)

Fencl, Martin; Vrzba, Miroslav; Rieckermann, Jörg; Bareš, Vojtěch

2016-04-01

Using of microwave links for rainfall monitoring was suggested already by (Atlas and Ulbrich, 1977). However, this technique attracted broader attention of scientific community only in the recent decade, with the extensive growth of cellular microwave link (CML) networks, which form the backbone of today's cellular telecommunication infrastructure. Several studies have already shown that CMLs can be conveniently used as weather sensors and have potential to provide near-ground path-integrated observations of rainfall but also humidity or fog. However, although research is still focusing on algorithms to improve the weather sensing capabilities (Fencl et al., 2015), it is not clear how to convince cellular operators to provide the power levels of their network. One step in this direction is to show in which regions or municipalities the networks are sufficiently dense to provide/develop good services. In this contribution we suggest a standardized approach to evaluate CML networks in terms of rainfall observation and to identify suitable regions for CML rainfall monitoring. We estimate precision of single CML based on its sensitivity to rainfall, i.e. as a function of frequency, polarization and path length. Capability of a network to capture rainfall spatial patterns is estimated from the CML coverage and path lengths considering that single CML provides path-integrated rain rates. We also search for suitable predictors for regions where no network topologies are available. We test our approach on several European networks and discuss the results. Our results show that CMLs are very dense in urban areas (> 1 CML/km2), but less in rural areas (online tool. In summary, our results demonstrate that CML represent promising environmental observation network, suitable especially for urban rainfall monitoring. The developed approach integrated into an open source online tool can be conveniently used e.g. by local operators or authorities to evaluate the suitability of

Mobility-Aware Modeling and Analysis of Dense Cellular Networks With $C$ -Plane/ $U$ -Plane Split Architecture

KAUST Repository

Ibrahim, Hazem

2016-09-19

The unrelenting increase in the population of mobile users and their traffic demands drive cellular network operators to densify their network infrastructure. Network densification shrinks the footprint of base stations (BSs) and reduces the number of users associated with each BS, leading to an improved spatial frequency reuse and spectral efficiency, and thus, higher network capacity. However, the densification gain comes at the expense of higher handover rates and network control overhead. Hence, user’s mobility can diminish or even nullifies the foreseen densification gain. In this context, splitting the control plane ( C -plane) and user plane ( U -plane) is proposed as a potential solution to harvest densification gain with reduced cost in terms of handover rate and network control overhead. In this paper, we use stochastic geometry to develop a tractable mobility-aware model for a two-tier downlink cellular network with ultra-dense small cells and C -plane/ U -plane split architecture. The developed model is then used to quantify the effect of mobility on the foreseen densification gain with and without C -plane/ U -plane split. To this end, we shed light on the handover problem in dense cellular environments, show scenarios where the network fails to support certain mobility profiles, and obtain network design insights.

The Influence of Gaussian Signaling Approximation on Error Performance in Cellular Networks

KAUST Repository

Afify, Laila H.; Elsawy, Hesham; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim

2015-01-01

Stochastic geometry analysis for cellular networks is mostly limited to outage probability and ergodic rate, which abstracts many important wireless communication aspects. Recently, a novel technique based on the Equivalent-in-Distribution (EiD) approach is proposed to extend the analysis to capture these metrics and analyze bit error probability (BEP) and symbol error probability (SEP). However, the EiD approach considerably increases the complexity of the analysis. In this paper, we propose an approximate yet accurate framework, that is also able to capture fine wireless communication details similar to the EiD approach, but with simpler analysis. The proposed methodology is verified against the exact EiD analysis in both downlink and uplink cellular networks scenarios.

The Influence of Gaussian Signaling Approximation on Error Performance in Cellular Networks

KAUST Repository

Afify, Laila H.

2015-08-18

Stochastic geometry analysis for cellular networks is mostly limited to outage probability and ergodic rate, which abstracts many important wireless communication aspects. Recently, a novel technique based on the Equivalent-in-Distribution (EiD) approach is proposed to extend the analysis to capture these metrics and analyze bit error probability (BEP) and symbol error probability (SEP). However, the EiD approach considerably increases the complexity of the analysis. In this paper, we propose an approximate yet accurate framework, that is also able to capture fine wireless communication details similar to the EiD approach, but with simpler analysis. The proposed methodology is verified against the exact EiD analysis in both downlink and uplink cellular networks scenarios.

5G and Cellular Networks in the Smart Grid

DEFF Research Database (Denmark)

Nielsen, Jimmy Jessen; Jorguseski, Ljupco; Zhang, Haibin

2018-01-01

grid. In the present chapter, we present the main features of both the non-3GPP technologies, IEEE 802.11ah, SigFox and LoRa, and the main features of past, current and future 3GPP technologies, namely releases High rate), 12-14 (IoT extensions) and 15-16 (5G). Additionally, we present......Wireless cellular networks will help Distribution System Operators (DSOs) to achieve observability below the substation level, which is needed to ensure stable operation in the smart grid. Both existing and upcoming cellular technologies are considered as candidates for helping to enable the smart...... the challenges and possible solutions for ensuring end-to-end security in smart grid systems....

Video over cognitive radio networks when quality of service meets spectrum

CERN Document Server

Mao, Shiwen

2014-01-01

This book focuses on the problem of video streaming over emerging cognitive radio (CR) networks. The book discusses the problems and techniques for scalable video streaming over cellular cognitive radio networks, ad hoc CR networks, cooperative CR networks, and femtocell CR networks. The author formulates these problems and proposes optimal algorithms to solve these problems. Also, the book analyzes the proposed algorithms and validates the algorithms with simulations.

Global Business Networks and Cooperation within Supply Chain as a Strategy of High-Tech Companies’ Growth

Directory of Open Access Journals (Sweden)

Milena Ratajczak-Mrozek

2012-01-01

Full Text Available Abstract The specificity of the operation profile of high-tech companies, including the necessity of operating at the international scale may account for the fact that these companies may find in network relationships, business networks and cooperation an essential determinant for growth and competitiveness. Foreign entities should be especially interesting business partners for high- tech companies, as they are often seen as representing more advanced knowledge, resources and experience. The aim of the article is to point out to global business networks (i.e. including both local and foreign entities, and especially to cooperation within supply chain, as an important basis for a growth strategy of a high-tech company. The article adopts assumptions of the network approach as a concept of companies cooperation. An analysis of the author’s own as well as secondary empirical research, with the focus on high- tech companies located in Poland is presented. In particular, the data from own research of 62 high-tech companies in Poland conducted in the first half of 2011 is analysed. It shows that the high-tech companies placing great importance on cooperation within supply chain demonstrate a higher growth and level of competitiveness than the companies which do not ascribe such importance (bearing in mind that supply chain forms an important part of a business network.

A game theoretical approach for cooperative environmentally friendly cellular networks powered by the smart grid

KAUST Repository

Ghazzai, Hakim; Yaacoub, Elias; Alouini, Mohamed-Slim

2014-01-01

to the daily green energy availability. Our simulation results show a significant saving in terms of CO2 emissions compared to the non-collaboration case and that cooperative mobile operators exploiting renewables are more awarded than traditional operators

Cooperative games and network structures

NARCIS (Netherlands)

Musegaas, Marieke

2017-01-01

This thesis covers various research topics involving cooperative game theory, a mathematical tool to analyze the cooperative behavior within a group of players. The focus is mainly on interrelations between operations research and cooperative game theory by analyzing specific types of cooperative

Identification of driving network of cellular differentiation from single sample time course gene expression data

Science.gov (United States)

Chen, Ye; Wolanyk, Nathaniel; Ilker, Tunc; Gao, Shouguo; Wang, Xujing

Methods developed based on bifurcation theory have demonstrated their potential in driving network identification for complex human diseases, including the work by Chen, et al. Recently bifurcation theory has been successfully applied to model cellular differentiation. However, there one often faces a technical challenge in driving network prediction: time course cellular differentiation study often only contains one sample at each time point, while driving network prediction typically require multiple samples at each time point to infer the variation and interaction structures of candidate genes for the driving network. In this study, we investigate several methods to identify both the critical time point and the driving network through examination of how each time point affects the autocorrelation and phase locking. We apply these methods to a high-throughput sequencing (RNA-Seq) dataset of 42 subsets of thymocytes and mature peripheral T cells at multiple time points during their differentiation (GSE48138 from GEO). We compare the predicted driving genes with known transcription regulators of cellular differentiation. We will discuss the advantages and limitations of our proposed methods, as well as potential further improvements of our methods.

Valuing spectrum at mm wavelengths for cellular networks

OpenAIRE

Shaw, B. A.; Beltrán, H. F.; Sowerby, K. W.

2017-01-01

This paper investigates the economic value of spectrum at mm wavelengths. The analysis uses four techniques to value spectrum, namely a benchmarking comparison, a discounted cash flow analysis, a real options approach and a deprival method. The methods to calculate spectrum value presented in this paper can be used for any spectrum band and in any country. However, to determine the value of mm wavelengths for cellular networks, we have used data from New Zealand, specifically for the existing...

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

A Comparative Study on Cooperative Learning in Multimedia and Network Environment Used by English Majors between China Mainland and Taiwan

Directory of Open Access Journals (Sweden)

Gong Xue

2018-02-01

Full Text Available This paper first based on the theory of cooperative learning research. It analyses the characteristics and advantages of cooperative learning under the multimedia network environment.And then take China Three Gorges University and Taiwan I-Shou University English major students for example, using questionnaires and interviews to investigate the students's cooperative learning in the network environment. Survey results showed that cooperative learning teaching mode has been widely used in English classrooms across the Taiwan Strait. Students think highly of cooperative learning in the multimedia-aided, and it can have a positive effect on learning; but on cooperative learning ability and the specific learning process, students still have some problems.Nowadays,cooperative learning in the network environment has various ways, but there exist certain differences in the learning styles across the Strait. Taiwan students rely more on teachers’ help and teachers feedback, while students in mainland depend mainly on networking and panel discussion. On qualitative analysis of interview is a supplement to the questionnaire and further explore its deeper causes, which provide valuable evidence for the study and learning practice. Finally, according to the comparative analysis ,the author puts forward some constructive suggestions.

Stochastic Geometric Coverage Analysis in mmWave Cellular Networks with a Realistic Channel Model

DEFF Research Database (Denmark)

Rebato, Mattia; Park, Jihong; Popovski, Petar

2017-01-01

Millimeter-wave (mmWave) bands have been attracting growing attention as a possible candidate for next-generation cellular networks, since the available spectrum is orders of magnitude larger than in current cellular allocations. To precisely design mmWave systems, it is important to examine mmWa...

Flexible Design for α-Duplex Communications in Multi-Tier Cellular Networks

KAUST Repository

Alammouri, Ahmad; Elsawy, Hesham; Alouini, Mohamed-Slim

2016-01-01

the foreseen FD gains. This paper presents flexible and tractable modeling framework for multi-tier cellular networks with FD BSs and FD/HD UEs. The presented model is based on stochastic geometry and accounts for the intrinsic vulnerability of uplink

The facilitation of groups and networks: capabilities to shape creative cooperation

DEFF Research Database (Denmark)

Rasmussen, Lauge Baungaard

2003-01-01

The facilitator, defined as a process guide of creative cooperation, is becoming more and more in focus to assist groups,teams and networks to meet these challenges. The author defines and exemplifies different levels of creative coorperation. Core capabilities of facilitation are defined...

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.

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.

Cooperative Spatial Reuse with Transmit Beamforming in Multi-rate Wireless Networks

DEFF Research Database (Denmark)

Lu, Chenguang; Fitzek, Frank; Eggers, Patrick Claus F.

2009-01-01

We present a cooperative spatial reuse (CSR) scheme as a cooperative extension of the current TDMA-based MAC to enable spatial reuse in multi-rate wireless networks. We model spatial reuse as a cooperation problem on utilizing the time slots obtained from the TDMA-based MAC. In CSR, there are two...... operation modes. One is TDMA mode while the other is spatial reuse mode in which links transmit simultaneously. Links contribute their own time slots to form a cooperative group to do spatial reuse. Each link joins the group only if it can benefit in capacity or energy efficiency. Otherwise, the link...... will leave spatial reuse mode and switch back to TDMA. In this work, we focus on the transmit beamforming techniques to enable CSR by interference cancellation on MISO (Multiple Input Single Output) links. We compare the CSR scheme using zero-forcing (ZF) transmit beamforming, namely ZF-CSR, to the TDMA...

Base Station Ordering for Emergency Call Localization in Ultra-dense Cellular Networks

KAUST Repository

Elsawy, Hesham

2017-10-04

This paper proposes the base station ordering localization technique (BoLT) for emergency call localization in cellular networks. Exploiting the foreseen ultra-densification of the next-generation (5G and beyond) cellular networks, we utilize higher-order Voronoi tessellations to provide ubiquitous localization services that are in compliance to the public safety standards in cellular networks. The proposed localization algorithm runs at the base stations (BSs) and requires minimal operation from agents (i.e., mobile users). Particularly, BoLT requires each agent to feedback a neighbor cell list (NCL) that contains the order of neighboring BSs based on the received signal power in the pilots sent from these BSs. Moreover, this paper utilizes stochastic geometry to develop a tractable mathematical model to assess the performance of BoLT in a general network setting. The goal of this paper is to answer the following two fundamental questions: i) how many BSs should be ordered and reported by the agent to achieve a desirable localization accuracy? and ii) what is the localization error probability given that the pilot signals are subject to shadowing? Assuming that the BSs are deployed according to a Poisson point process (PPP), we answer these two questions via characterizing the tradeoff between the area of location region (ALR) and the localization error probability in terms of the number of BSs ordered by the agent. The results show that reporting the order of six neighboring BSs is sufficient to localize the agent within 10% of the cell area. Increasing the number of reported BSs to ten confines the location region to 1% of the cell area. This would translate to the range of a few meters to decimeters in the foreseen ultra-dense 5G networks.

Base Station Ordering for Emergency Call Localization in Ultra-dense Cellular Networks

KAUST Repository

Elsawy, Hesham; Dai, Wenhan; Alouini, Mohamed-Slim; Win, Moe Z.

2017-01-01

This paper proposes the base station ordering localization technique (BoLT) for emergency call localization in cellular networks. Exploiting the foreseen ultra-densification of the next-generation (5G and beyond) cellular networks, we utilize higher-order Voronoi tessellations to provide ubiquitous localization services that are in compliance to the public safety standards in cellular networks. The proposed localization algorithm runs at the base stations (BSs) and requires minimal operation from agents (i.e., mobile users). Particularly, BoLT requires each agent to feedback a neighbor cell list (NCL) that contains the order of neighboring BSs based on the received signal power in the pilots sent from these BSs. Moreover, this paper utilizes stochastic geometry to develop a tractable mathematical model to assess the performance of BoLT in a general network setting. The goal of this paper is to answer the following two fundamental questions: i) how many BSs should be ordered and reported by the agent to achieve a desirable localization accuracy? and ii) what is the localization error probability given that the pilot signals are subject to shadowing? Assuming that the BSs are deployed according to a Poisson point process (PPP), we answer these two questions via characterizing the tradeoff between the area of location region (ALR) and the localization error probability in terms of the number of BSs ordered by the agent. The results show that reporting the order of six neighboring BSs is sufficient to localize the agent within 10% of the cell area. Increasing the number of reported BSs to ten confines the location region to 1% of the cell area. This would translate to the range of a few meters to decimeters in the foreseen ultra-dense 5G networks.

Mobility-Aware User Association in Uplink Cellular Networks

KAUST Repository

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

2017-01-01

This letter studies the mobility aware user-to-BS association policies, within a stochastic geometry framework, in two tier uplink cellular networks with fractional channel inversion power control. Particularly, we model the base stations’ locations using the widely accepted poisson point process and obtain the coverage probability and handover cost expressions for the coupled and decoupled uplink and downlink associations. To this end, we compute the average throughput for the mobile users and study the merits and demerits of each association strategy.

Mobility-Aware User Association in Uplink Cellular Networks

KAUST Repository

Arshad, Rabe

2017-07-20

This letter studies the mobility aware user-to-BS association policies, within a stochastic geometry framework, in two tier uplink cellular networks with fractional channel inversion power control. Particularly, we model the base stations’ locations using the widely accepted poisson point process and obtain the coverage probability and handover cost expressions for the coupled and decoupled uplink and downlink associations. To this end, we compute the average throughput for the mobile users and study the merits and demerits of each association strategy.

Cellular telephone-based wide-area radiation detection network

Science.gov (United States)

Craig, William W [Pittsburg, CA; Labov, Simon E [Berkeley, CA

2009-06-09

A network of radiation detection instruments, each having a small solid state radiation sensor module integrated into a cellular phone for providing radiation detection data and analysis directly to a user. The sensor module includes a solid-state crystal bonded to an ASIC readout providing a low cost, low power, light weight compact instrument to detect and measure radiation energies in the local ambient radiation field. In particular, the photon energy, time of event, and location of the detection instrument at the time of detection is recorded for real time transmission to a central data collection/analysis system. The collected data from the entire network of radiation detection instruments are combined by intelligent correlation/analysis algorithms which map the background radiation and detect, identify and track radiation anomalies in the region.

Mobility-Aware Modeling and Analysis of Dense Cellular Networks With $C$ -Plane/ $U$ -Plane Split Architecture

KAUST Repository

Ibrahim, Hazem; Elsawy, Hesham; Nguyen, Uyen Trang; Alouini, Mohamed-Slim

2016-01-01

The unrelenting increase in the population of mobile users and their traffic demands drive cellular network operators to densify their network infrastructure. Network densification shrinks the footprint of base stations (BSs) and reduces the number

Effect of local information within network layers on the evolution of cooperation in duplex public goods games

International Nuclear Information System (INIS)

Zhou, Yifeng; Zheng, Xiaoming; Wu, Weiwei

2015-01-01

Traditional works of public goods game (PGG) are often studied in simplex networks where agents play games through the same type of social interactions. In order to promote cooperation against the defection in PGGs in simplex network environment, many mechanisms have been proposed from different perspectives, such as the volunteering mechanisms, and the punishment and reward approaches. However, due to diverse types of interactions between agents in reality, the study of PGG should also consider the characteristic of multiplexity of networks. Hence, we firstly model the public goods game in the duplex network (for simplification of analysis, the duplex network is considered), in which agents have two types of social interactions, and thus the network is modeled as two network layers. This type of PGG is naturally named as duplex public goods game (D-PGG), in which agents can select one of the network layers to allocate their limited resources. Then for the new game environment (D-PGG), we propose a novel perspective to promote cooperation: degrading the information integrity, i.e., agents get information just from one network layer (local information) rather than from the whole duplex network (global information) in the evolution process. Finally, through theoretical analyses and simulations, we find that if agents imitate based on the local information of the payoff in the evolution, cooperation can be generally promoted; and the extent of promotion depends on both the network structure and the similarity of the network layers

A Neural Network based Approach for Predicting Customer Churn in Cellular Network Services

OpenAIRE

Sharma, Anuj; Panigrahi, Dr. Prabin Kumar

2013-01-01

Marketing literature states that it is more costly to engage a new customer than to retain an existing loyal customer. Churn prediction models are developed by academics and practitioners to effectively manage and control customer churn in order to retain existing customers. As churn management is an important activity for companies to retain loyal customers, the ability to correctly predict customer churn is necessary. As the cellular network services market becoming more competitive, custom...

Exponential convergence for a class of delayed cellular neural networks with time-varying coefficients

International Nuclear Information System (INIS)

Liu Bingwen

2008-01-01

In this Letter, we consider a class of delayed cellular neural networks with time-varying coefficients. By applying Lyapunov functional method and differential inequality techniques, we establish new results to ensure that all solutions of the networks converge exponentially to zero point

The Role of Delay and Connectivity in Throughput Reduction of Cooperative Decentralized Wireless Networks

Directory of Open Access Journals (Sweden)

Ahmed Alkhayyat

2015-01-01

Full Text Available We proposed a multiple relay selection protocol for decentralized wireless networks. The proposed relays selection protocol aims to address three issues: (1 selecting relays within the coverage area of the source and destination to ensure that the relays are positioned one hop away from the destination, (2 ensuring that the best node (best relays with less distance and attenuation from the destination access the channel first, and (3 ensuring that the proposed relays selection is collision-free. Our analysis also considers three important characteristics of decentralized wireless networks that are directly affected by cooperation: delay, connectivity, and throughput. The main goal of this paper is to demonstrate that improving connectivity and increasing number of relays reduce the throughput of cooperative decentralized wireless networks; consequently, a trade-off equation has been derived.

Energy Efficiency Analysis of a Two Dimensional Cooperative Wireless Sensor Network with Relay Selection

Directory of Open Access Journals (Sweden)

M. Kakitani

2013-06-01

Full Text Available The energy efficiency of non-cooperative and cooperative transmissions are investigated in a two-dimensional wireless sensor network, considering a target outage probability and the same end-to-end throughput for all transmission schemes. The impact of the relay selection method in the cooperative schemes is also analyzed. We show that under non line-of-sight conditions the relay selection method has a greater impact in the energy efficiency than the availability of a return channel. By its turn, under line-of-sight conditions a return channel is more valuable to the energy efficiency of cooperative transmission than the specific relay selection method. Finally, we demonstrate that the energy efficiency advantage of the cooperative over the non-cooperative transmission increases with the distance among nodes and with the nodes density.

Throughput of Cellular Systems with Conferencing Mobiles and Cooperative Base Stations

Directory of Open Access Journals (Sweden)

Somekh O

2008-01-01

Full Text Available This paper considers an enhancement to multicell processing for the uplink of a cellular system, whereby the mobile stations are allowed to exchange messages on orthogonal channels of fixed capacity (conferencing. Both conferencing among mobile stations in different cells and in the same cell (inter- and intracell conferencing, resp. are studied. For both cases, it is shown that a rate-splitting transmission strategy, where part of the message is exchanged on the conferencing channels and then transmitted cooperatively to the base stations, is capacity achieving for sufficiently large conferencing capacity. In case of intercell conferencing, this strategy performs convolutional pre-equalization of the signal encoding the common messages in the spatial domain, where the number of taps of the finite-impulse response equalizer depends on the number of conferencing rounds. Analysis in the low signal-to-noise ratio regime and numerical results validate the advantages of conferencing as a complementary technology to multicell processing.

Design and Profit Allocation in Two-Echelon Heterogeneous Cooperative Logistics Network Optimization

Directory of Open Access Journals (Sweden)

Yong Wang

2018-01-01

Full Text Available In modern supply chain, logistics companies usually operate individually and optimization researches often concentrate on solving problems related to separate networks. Consequences like the complexity of urban transportation networks and long distance deliveries or pickups and pollution are leading problems to more expenses and more complaints from environment protection organizations. A solution approach to these issues is proposed in this article and consists in the adoption of two-echelon heterogeneous cooperative logistics networks (THCLN. The optimization methodology includes the formation of cooperative coalitions, the reallocation of customers to appropriate logistics facilities, and the determination of the best profit allocation scheme. First, a mixed integer linear programing model is introduced to minimize the total operating cost of nonempty coalitions. Thus, the Genetic Algorithm (GA and the Particle Swarm Optimization (PSO algorithm are hybridized to propose GA-PSO heuristics. GA-PSO is employed to provide good solutions to customer clustering units’ reallocation problem. In addition, a negotiation process is established based on logistics centers as coordinators. The case study of Chongqing city is conducted to verify the feasibility of THCLN in practice. The grand coalition and two heterogeneous subcoalitions are designed, and the collective profit is distributed based on cooperative game theory. The Minimum Cost Remaining Savings (MCRS model is used to determine good allocation schemes and strictly monotonic path principles are considered to evaluate and decide the most appropriate coalition sequence. Comparisons proved the combination of GA-PSO and MCRS better as results are found closest to the core center. Therefore, the proposed approach can be implemented in real world environment, increase the reliability of urban logistics network, and allow decision makers to improve service efficiency.

Cellular Neural Network-Based Methods for Distributed Network Intrusion Detection

Directory of Open Access Journals (Sweden)

Kang Xie

2015-01-01

Full Text Available According to the problems of current distributed architecture intrusion detection systems (DIDS, a new online distributed intrusion detection model based on cellular neural network (CNN was proposed, in which discrete-time CNN (DTCNN was used as weak classifier in each local node and state-controlled CNN (SCCNN was used as global detection method, respectively. We further proposed a new method for design template parameters of SCCNN via solving Linear Matrix Inequality. Experimental results based on KDD CUP 99 dataset show its feasibility and effectiveness. Emerging evidence has indicated that this new approach is affordable to parallelism and analog very large scale integration (VLSI implementation which allows the distributed intrusion detection to be performed better.

Exploiting Outage and Error Probability of Cooperative Incremental Relaying in Underwater Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Hina Nasir

2016-07-01

Full Text Available This paper embeds a bi-fold contribution for Underwater Wireless Sensor Networks (UWSNs; performance analysis of incremental relaying in terms of outage and error probability, and based on the analysis proposition of two new cooperative routing protocols. Subject to the first contribution, a three step procedure is carried out; a system model is presented, the number of available relays are determined, and based on cooperative incremental retransmission methodology, closed-form expressions for outage and error probability are derived. Subject to the second contribution, Adaptive Cooperation in Energy (ACE efficient depth based routing and Enhanced-ACE (E-ACE are presented. In the proposed model, feedback mechanism indicates success or failure of data transmission. If direct transmission is successful, there is no need for relaying by cooperative relay nodes. In case of failure, all the available relays retransmit the data one by one till the desired signal quality is achieved at destination. Simulation results show that the ACE and E-ACE significantly improves network performance, i.e., throughput, when compared with other incremental relaying protocols like Cooperative Automatic Repeat reQuest (CARQ. E-ACE and ACE achieve 69% and 63% more throughput respectively as compared to CARQ in hard underwater environment.

Design of special purpose database for credit cooperation bank business processing network system

Science.gov (United States)

Yu, Yongling; Zong, Sisheng; Shi, Jinfa

2011-12-01

With the popularization of e-finance in the city, the construction of e-finance is transfering to the vast rural market, and quickly to develop in depth. Developing the business processing network system suitable for the rural credit cooperative Banks can make business processing conveniently, and have a good application prospect. In this paper, We analyse the necessity of adopting special purpose distributed database in Credit Cooperation Band System, give corresponding distributed database system structure , design the specical purpose database and interface technology . The application in Tongbai Rural Credit Cooperatives has shown that system has better performance and higher efficiency.

Capturing cooperative interactions with the PSI-MI format.

Science.gov (United States)

Van Roey, Kim; Orchard, Sandra; Kerrien, Samuel; Dumousseau, Marine; Ricard-Blum, Sylvie; Hermjakob, Henning; Gibson, Toby J

2013-01-01

The complex biological processes that control cellular function are mediated by intricate networks of molecular interactions. Accumulating evidence indicates that these interactions are often interdependent, thus acting cooperatively. Cooperative interactions are prevalent in and indispensible for reliable and robust control of cell regulation, as they underlie the conditional decision-making capability of large regulatory complexes. Despite an increased focus on experimental elucidation of the molecular details of cooperative binding events, as evidenced by their growing occurrence in literature, they are currently lacking from the main bioinformatics resources. One of the contributing factors to this deficiency is the lack of a computer-readable standard representation and exchange format for cooperative interaction data. To tackle this shortcoming, we added functionality to the widely used PSI-MI interchange format for molecular interaction data by defining new controlled vocabulary terms that allow annotation of different aspects of cooperativity without making structural changes to the underlying XML schema. As a result, we are able to capture cooperative interaction data in a structured format that is backward compatible with PSI-MI-based data and applications. This will facilitate the storage, exchange and analysis of cooperative interaction data, which in turn will advance experimental research on this fundamental principle in biology.

In-Band α-Duplex Scheme for Cellular Networks: A Stochastic Geometry Approach

KAUST Repository

Alammouri, Ahmad; Elsawy, Hesham; Amin, Osama; Alouini, Mohamed-Slim

2016-01-01

In-band full-duplex (FD) communications have been optimistically promoted to improve the spectrum utilization and efficiency. However, the penetration of FD communications to the cellular networks domain is challenging due to the imposed uplink

Cooperative Technique Based on Sensor Selection in Wireless Sensor Network

Directory of Open Access Journals (Sweden)

ISLAM, M. R.

2009-02-01

Full Text Available An energy efficient cooperative technique is proposed for the IEEE 1451 based Wireless Sensor Networks. Selected numbers of Wireless Transducer Interface Modules (WTIMs are used to form a Multiple Input Single Output (MISO structure wirelessly connected with a Network Capable Application Processor (NCAP. Energy efficiency and delay of the proposed architecture are derived for different combination of cluster size and selected number of WTIMs. Optimized constellation parameters are used for evaluating derived parameters. The results show that the selected MISO structure outperforms the unselected MISO structure and it shows energy efficient performance than SISO structure after a certain distance.

Protein-protein interaction networks identify targets which rescue the MPP+ cellular model of Parkinson’s disease

Science.gov (United States)

Keane, Harriet; Ryan, Brent J.; Jackson, Brendan; Whitmore, Alan; Wade-Martins, Richard

2015-11-01

Neurodegenerative diseases are complex multifactorial disorders characterised by the interplay of many dysregulated physiological processes. As an exemplar, Parkinson’s disease (PD) involves multiple perturbed cellular functions, including mitochondrial dysfunction and autophagic dysregulation in preferentially-sensitive dopamine neurons, a selective pathophysiology recapitulated in vitro using the neurotoxin MPP+. Here we explore a network science approach for the selection of therapeutic protein targets in the cellular MPP+ model. We hypothesised that analysis of protein-protein interaction networks modelling MPP+ toxicity could identify proteins critical for mediating MPP+ toxicity. Analysis of protein-protein interaction networks constructed to model the interplay of mitochondrial dysfunction and autophagic dysregulation (key aspects of MPP+ toxicity) enabled us to identify four proteins predicted to be key for MPP+ toxicity (P62, GABARAP, GBRL1 and GBRL2). Combined, but not individual, knockdown of these proteins increased cellular susceptibility to MPP+ toxicity. Conversely, combined, but not individual, over-expression of the network targets provided rescue of MPP+ toxicity associated with the formation of autophagosome-like structures. We also found that modulation of two distinct proteins in the protein-protein interaction network was necessary and sufficient to mitigate neurotoxicity. Together, these findings validate our network science approach to multi-target identification in complex neurological diseases.

Network-Coded Macrocell Offloading in Femtocaching-Assisted Cellular Networks

KAUST Repository

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

2017-01-01

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

Network-Coded Macrocell Offloading in Femtocaching-Assisted Cellular Networks

KAUST Repository

Shnaiwer, Yousef

2017-11-08

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

Power Control for D2D Underlay Cellular Networks With Channel Uncertainty

KAUST Repository

Memmi, Amen

2016-12-26

Device-to-device (D2D) communications underlying the cellular infrastructure are a technology that have been proposed recently as a promising solution to enhance cellular network capabilities. It improves spectrum utilization, overall throughput, and energy efficiency while enabling new peer-to-peer and location-based applications and services. However, interference is the major challenge, since the same resources are shared by both systems. Therefore, interference management techniques are required to keep the interference under control. In this paper, in order to mitigate interference, we consider centralized and distributed power control algorithms in a one-cell random network model. Existing results on D2D underlay networks assume perfect channel state information (CSI). This assumption is usually unrealistic in practice due to the dynamic nature of wireless channels. Thus, it is of great interest to study and evaluate achievable performances under channel uncertainty. Differently from previous works, we are assuming that the CSI may be imperfect and include estimation errors. In the centralized approach, we derive the optimal powers that maximize the coverage probability and the rate of the cellular user while scheduling as many D2D links as possible. These powers are computed at the base station (BS) and then delivered to the users, and hence the name “centralized”. For the distributed method, the ON–OFF power control and the truncated channel inversion are proposed. Expressions of coverage probabilities are established in the function of D2D links intensity, pathloss exponent, and estimation error variance. Results show the important influence of CSI error on achievable performances and thus how crucial it is to consider it while designing networks and evaluating performances.

Channel Asymmetry in Cellular OFDMA-TDD Networks

Directory of Open Access Journals (Sweden)

Agyapong Patrick

2008-01-01

Full Text Available Abstract This paper studies time division duplex- (TDD- specific interference issues in orthogonal frequency division multiple access- (OFDMA- TDD cellular networks arising from various uplink (UL/downlink (DL traffic asymmetries, considering both line-of-sight (LOS and non-LOS (NLOS conditions among base stations (BSs. The study explores aspects both of channel allocation and user scheduling. In particular, a comparison is drawn between the fixed slot allocation (FSA technique and a dynamic channel allocation (DCA technique for different UL/DL loads. For the latter, random time slot opposing (RTSO is assumed due to its simplicity and its low signaling overhead. Both channel allocation techniques do not obviate the need for user scheduling algorithms, therefore, a greedy and a fair scheduling approach are applied to both the RTSO and the FSA. The systems are evaluated based on spectral efficiency, subcarrier utilization, and user outage. The results show that RTSO networks with DL-favored traffic asymmetries outperform FSA networks for all considered metrics and are robust to LOS between BSs. In addition, it is demonstrated that the greedy scheduling algorithm only offers a marginal increase in spectral efficiency as compared to the fair scheduling algorithm, while the latter exhibits up to 20% lower outage.

Innovations in the Baltic Sea Region and Network Cooperation between Russia and the EU

Directory of Open Access Journals (Sweden)

Fedorov Gennady

2013-03-01

Full Text Available Transnational (involving countries and cross-border (involving adjacent regions of different countries cooperation and integration are rapidly developing in the Baltic Sea region. Russia lags behind the Nordic countries and Germany as far as innovative development is concerned; yet our national pace here is comparable to that of Poland and the three Baltic States. At the same time, the features of innovative cooperation vary a great deal depending on the group of countries involved in cooperation processes. Independent of its type, however, international cooperation is beneficial for all parties concerned and should therefore be more actively encouraged. Northwestern Federal District traditionally plays a special role in the development of EU-Russia cooperation, since a number of its regions border on the EU countries. The district participates in the development of network innovative structures within the Baltic Sea region. It takes an active part in cross-border cooperation — activities that involve the formation of transborder innovative clusters. There are high expectations associated with the formation of such territorially localised innovative networks, as the Helsinki — Saint Petersburg — Tallinn and Tricity (Gdansk, Gdynia, Sopot — Kaliningrad — Klaipeda transborder innovative clusters. The city of Saint Petersburg and the adjacent Leningrad region, as well as the Kaliningrad region can become innovative development corridors between Russia and the EU and, eventually, develop into the ‘economic growth poles’ of the Russian Federation.

Perturbation Biology: Inferring Signaling Networks in Cellular Systems

Science.gov (United States)

Miller, Martin L.; Gauthier, Nicholas P.; Jing, Xiaohong; Kaushik, Poorvi; He, Qin; Mills, Gordon; Solit, David B.; Pratilas, Christine A.; Weigt, Martin; Braunstein, Alfredo; Pagnani, Andrea; Zecchina, Riccardo; Sander, Chris

2013-01-01

We present a powerful experimental-computational technology for inferring network models that predict the response of cells to perturbations, and that may be useful in the design of combinatorial therapy against cancer. The experiments are systematic series of perturbations of cancer cell lines by targeted drugs, singly or in combination. The response to perturbation is quantified in terms of relative changes in the measured levels of proteins, phospho-proteins and cellular phenotypes such as viability. Computational network models are derived de novo, i.e., without prior knowledge of signaling pathways, and are based on simple non-linear differential equations. The prohibitively large solution space of all possible network models is explored efficiently using a probabilistic algorithm, Belief Propagation (BP), which is three orders of magnitude faster than standard Monte Carlo methods. Explicit executable models are derived for a set of perturbation experiments in SKMEL-133 melanoma cell lines, which are resistant to the therapeutically important inhibitor of RAF kinase. The resulting network models reproduce and extend known pathway biology. They empower potential discoveries of new molecular interactions and predict efficacious novel drug perturbations, such as the inhibition of PLK1, which is verified experimentally. This technology is suitable for application to larger systems in diverse areas of molecular biology. PMID:24367245

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.

Load-aware modeling for uplink cellular networks in a multi-channel environment

KAUST Repository

Alammouri, Ahmad; Elsawy, Hesham; Alouini, Mohamed-Slim

2014-01-01

We exploit tools from stochastic geometry to develop a tractable analytical approach for modeling uplink cellular networks. The developed model is load aware and accounts for per-user power control as well as the limited transmit power constraint

Sequential Uniformly Reweighted Sum-Product Algorithm for Cooperative Localization in Wireless Networks

OpenAIRE

Li, Wei; Yang, Zhen; Hu, Haifeng

2014-01-01

Graphical models have been widely applied in solving distributed inference problems in wireless networks. In this paper, we formulate the cooperative localization problem in a mobile network as an inference problem on a factor graph. Using a sequential schedule of message updates, a sequential uniformly reweighted sum-product algorithm (SURW-SPA) is developed for mobile localization problems. The proposed algorithm combines the distributed nature of belief propagation (BP) with the improved p...

Stability analysis of impulsive fuzzy cellular neural networks with distributed delays and reaction-diffusion terms

International Nuclear Information System (INIS)

Li Zuoan; Li Kelin

2009-01-01

In this paper, we investigate a class of impulsive fuzzy cellular neural networks with distributed delays and reaction-diffusion terms. By employing the delay differential inequality with impulsive initial conditions and M-matrix theory, we find some sufficient conditions ensuring the existence, uniqueness and global exponential stability of equilibrium point for impulsive fuzzy cellular neural networks with distributed delays and reaction-diffusion terms. In particular, the estimate of the exponential converging index is also provided, which depends on the system parameters. An example is given to show the effectiveness of the results obtained here.

Joint Secrecy for D2D Communications Underlying Cellular Networks

KAUST Repository

Hyadi, Amal

2018-01-15

In this work, we investigate the ergodic secrecy rate region of a block-fading spectrum-sharing system, where a D2D communication is underlying a cellular channel. We consider that both the primary and the secondary transmissions require their respective transmitted messages to be kept secret from a common eavesdropper under a joint secrecy constraint. The presented results are for three different scenarios, each corresponding to a particular requirement of the cellular system. First, we consider the case of a fair cellular system, and we show that the impact of jointly securing the transmissions can be balanced between the primary and the secondary systems. The second scenario examines the case when the primary network is demanding and requires the secondary transmission to be at a rate that is decodable by the primary receiver, while the last scenario assumes a joint transmission of artificial noise by the primary and the secondary transmitters. For each scenario, we present an achievable ergodic secrecy rate region that can be used as an indicator for the cellular and the D2D systems to agree under which terms the spectrum will be shared.

In-Band α-Duplex Scheme for Cellular Networks: A Stochastic Geometry Approach

KAUST Repository

Alammouri, Ahmad

2016-07-13

In-band full-duplex (FD) communications have been optimistically promoted to improve the spectrum utilization and efficiency. However, the penetration of FD communications to the cellular networks domain is challenging due to the imposed uplink/downlink interference. This paper presents a tractable framework, based on stochastic geometry, to study FD communications in cellular networks. Particularly, we assess the FD communications effect on the network performance and quantify the associated gains. The study proves the vulnerability of the uplink to the downlink interference and shows that FD rate gains harvested in the downlink (up to 97%) come at the expense of a significant degradation in the uplink rate (up to 94%). Therefore, we propose a novel fine-grained duplexing scheme, denoted as -duplex scheme, which allows a partial overlap between the uplink and the downlink frequency bands. We derive the required conditions to harvest rate gains from the -duplex scheme and show its superiority to both the FD and half-duplex (HD) schemes. In particular, we show that the -duplex scheme provides a simultaneous improvement of 28% for the downlink rate and 56% for the uplink rate. Finally, we show that the amount of the overlap can be optimized based on the network design objective.

Game-Theoretic Social-Aware Resource Allocation for Device-to-Device Communications Underlaying Cellular Network

Directory of Open Access Journals (Sweden)

Lei Wang

2018-01-01

Full Text Available Device-to-Device communication underlaying cellular network can increase the spectrum efficiency due to direct proximity communication and frequency reuse. However, such performance improvement is influenced by the power interference caused by spectrum sharing and social characteristics in each social community jointly. In this investigation, we present a dynamic game theory with complete information based D2D resource allocation scheme for D2D communication underlaying cellular network. In this resource allocation method, we quantify both the rate influence from the power interference caused by the D2D transmitter to cellular users and rate enhancement brought by the social relationships between mobile users. Then, the utility function maximization game is formulated to optimize the overall transmission rate performance of the network, which synthetically measures the final influence from both power interference and sociality enhancement. Simultaneously, we discuss the Nash Equilibrium of the proposed utility function maximization game from a theoretical point of view and further put forward a utility priority searching algorithm based resource allocation scheme. Simulation results show that our proposed scheme attains better performance compared with the other two advanced proposals.

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.

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.

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.

Unified tractable model for downlink MIMO cellular networks using stochastic geometry

KAUST Repository

Afify, Laila H.

2016-07-26

Several research efforts are invested to develop stochastic geometry models for cellular networks with multiple antenna transmission and reception (MIMO). On one hand, there are models that target abstract outage probability and ergodic rate for simplicity. On the other hand, there are models that sacrifice simplicity to target more tangible performance metrics such as the error probability. Both types of models are completely disjoint in terms of the analytic steps to obtain the performance measures, which makes it challenging to conduct studies that account for different performance metrics. This paper unifies both techniques and proposes a unified stochastic-geometry based mathematical paradigm to account for error probability, outage probability, and ergodic rates in MIMO cellular networks. The proposed model is also unified in terms of the antenna configurations and leads to simpler error probability analysis compared to existing state-of-the-art models. The core part of the analysis is based on abstracting unnecessary information conveyed within the interfering signals by assuming Gaussian signaling. To this end, the accuracy of the proposed framework is verified against state-of-the-art models as well as system level simulations. We provide via this unified study insights on network design by reflecting system parameters effect on different performance metrics. © 2016 IEEE.

Full-Duplex Communications in Large-Scale Cellular Networks

KAUST Repository

AlAmmouri, Ahmad

2016-04-01

In-band full-duplex (FD) communications have been optimistically promoted to improve the spectrum utilization and efficiency. However, the penetration of FD communications to the cellular networks domain is challenging due to the imposed uplink/downlink interference. This thesis presents a tractable framework, based on stochastic geometry, to study FD communications in multi-tier cellular networks. Particularly, we assess the FD communications effect on the network performance and quantify the associated gains. The study proves the vulnerability of the uplink to the downlink interference and shows that the improved FD rate gains harvested in the downlink (up to 97%) comes at the expense of a significant degradation in the uplink rate (up to 94%). Therefore, we propose a novel fine-grained duplexing scheme, denoted as α-duplex scheme, which allows a partial overlap between the uplink and the downlink frequency bands. We derive the required conditions to harvest rate gains from the α-duplex scheme and show its superiority to both the FD and half-duplex (HD) schemes. In particular, we show that the α-duplex scheme provides a simultaneous improvement of 28% for the downlink rate and 56% for the uplink rate. We also show that the amount of the overlap can be optimized based on the network design objective. Moreover, backward compatibility is an essential ingredient for the success of new technologies. In the context of in-band FD communication, FD base stations (BSs) should support HD users\\' equipment (UEs) without sacrificing the foreseen FD gains. The results show that FD-UEs are not necessarily required to harvest rate gains from FD-BSs. In particular, the results show that adding FD-UEs to FD-BSs offers a maximum of 5% rate gain over FD-BSs and HD-UEs case, which is a marginal gain compared to the burden required to implement FD transceivers at the UEs\\' side. To this end, we shed light on practical scenarios where HD-UEs operation with FD-BSs outperforms the

Energy Efficient Cooperative Spectrum Sensing in Cognitive Radio Networks Using Distributed Dynamic Load Balanced Clustering Scheme

Directory of Open Access Journals (Sweden)

Muthukkumar R.

2017-04-01

Full Text Available Cognitive Radio (CR is a promising and potential technique to enable secondary users (SUs or unlicenced users to exploit the unused spectrum resources effectively possessed by primary users (PUs or licenced users. The proven clustering approach is used to organize nodes in the network into the logical groups to attain energy efficiency, network scalability, and stability for improving the sensing accuracy in CR through cooperative spectrum sensing (CSS. In this paper, a distributed dynamic load balanced clustering (DDLBC algorithm is proposed. In this algorithm, each member in the cluster is to calculate the cooperative gain, residual energy, distance, and sensing cost from the neighboring clusters to perform the optimal decision. Each member in a cluster participates in selecting a cluster head (CH through cooperative gain, and residual energy that minimises network energy consumption and enhances the channel sensing. First, we form the number of clusters using the Markov decision process (MDP model to reduce the energy consumption in a network. In this algorithm, CR users effectively utilize the PUs reporting time slots of unavailability. The simulation results reveal that the clusters convergence, energy efficiency, and accuracy of channel sensing increased considerably by using the proposed algorithm.

Energy Efficient Cooperative Spectrum Sensing in Cognitive Radio Networks Using Distributed Dynamic Load Balanced Clustering Scheme