Energy-Efficient Decentralized Routing with Localized Cooperation Suitable for Fast Fading

Wireless networks transmit information from a source to a destination via multiple hops in order to save energy and, thus, increase the lifetime of battery-operated nodes. The energy savings can be especially significant in cooperative transmission schemes, where several nodes cooperate during one hop to forward the information to the next node along a route to the destination. Finding the best multi-hop transmission policy in such a network which determines nodes that are involved in each hop, is a very important problem, but also a very difficult one especially when the physical wireless channel behavior is to be accounted for and exploited. We model the above optimization problem for randomly fading channels as a decentralized control problem – the channel observations available at each node define the information structure, while the control policy is defined by the power and phase of the signal transmitted by each node.In particular, we consider the problem of computing an energy-optimal cooperative transmission scheme in a wireless network for two different channel fading models: (i) slow fading channels, where the channel gains of the links remain the same for a large number of transmissions, and (ii) fast fading channels,where the channel gains of the links change quickly from one transmission to another. For slow fading, we consider a factored class of policies (corresponding to local cooperation between nodes), and show that the computation of an optimal policy in this class is equivalent to a shortest path computation on an induced graph, whose edge costs can be computed in a decentralized manner using only locally available channel state information(CSI). For fast fading, both CSI acquisition and data transmission consume energy. Hence, we need to jointly optimize over both these; we cast this optimization problem as a large stochastic optimization problem. We then jointly optimize over a set of CSI functions of the local channel states, and a corresponding factored class of control policies corresponding to local cooperation between nodes with a local outage constraint. The resulting optimal scheme in this class can again be computed efficiently in a decentralized manner. We demonstrate significant energy savings for both slow and fast fading channels through numerical simulations of randomly distributed networks.

A resource based game theoretical model for military conflicts

A resource interaction based game theoretical model for military conflicts is presented in this paper. The model includes both the spatial decision capability of adversaries (decision regarding movement and subsequent distribution of resources) as well as their temporal decision capability (decision regarding level of allocation of resources for conflict with adversary’s resources). Attrition is decided at present by simple deterministic models. An additional feature of this model is the inclusion of the possibility of a given resource interacting with several resources of the adversary.The decisions of the adversaries is determined by solving for the equilibrium Nash strategies given that the objectives of the adversaries may not be in direct conflict. Examples are given to show the applicability of these models and solution concepts.

Self Assessment-Based Decision Making for Multiagent Cooperative Search

This paper addresses a search problem with multiple limited capability search agents in a partially connected dynamical networked environment under different information structures. A self assessment-based decision-making scheme for multiple agents is proposed that uses a modified negotiation scheme with low communication overheads. The scheme has attractive features of fast decision-making and scalability to large number of agents without increasing the complexity of the algorithm. Two models of the self assessment schemes are developed to study the effect of increase in information exchange during decision-making. Some analytical results on the maximum number of self assessment cycles, effect of increasing communication range, completeness of the algorithm, lower bound and upper bound on the search time are also obtained. The performance of the various self assessment schemes in terms of total uncertainty reduction in the search region, using different information structures is studied. It is shown that the communication requirement for self assessment scheme is almost half of the negotiation schemes and its performance is close to the optimal solution. Comparisons with different sequential search schemes are also carried out. Note to Practitioners-In the futuristic military and civilian applications such as search and rescue, surveillance, patrol, oil spill, etc., a swarm of UAVs can be deployed to carry out the mission for information collection. These UAVs have limited sensor and communication ranges. In order to enhance the performance of the mission and to complete the mission quickly, cooperation between UAVs is important. Designing cooperative search strategies for multiple UAVs with these constraints is a difficult task. Apart from this, another requirement in the hostile territory is to minimize communication while making decisions. This adds further complexity to the decision-making algorithms. In this paper, a self-assessment-based decision-making scheme, for multiple UAVs performing a search mission, is proposed. The agents make their decisions based on the information acquired through their sensors and by cooperation with neighbors. The complexity of the decision-making scheme is very low. It can arrive at decisions fast with low communication overheads, while accommodating various information structures used for increasing the fidelity of the uncertainty maps. Theoretical results proving completeness of the algorithm and the lower and upper bounds on the search time are also provided.

Accurate performance analysis of single and opportunistic AF relay cooperation with imperfect cascaded channel estimates

Given the significant gains that relay-based cooperation promises, the practical problems of acquisition of channel state information (CSI) and the characterization and optimization of performance with imperfect CSI are receiving increasing attention. We develop novel and accurate expressions for the symbol error probability (SEP) for fixed-gain amplify-and-forward relaying when the destination acquires CSI using the time-efficient cascaded channel estimation (CCE) protocol. The CCE protocol saves time by making the destination directly estimate the product of the source-relay and relay-destination channel gains. For a single relay system, we first develop a novel SEP expression and a tight SEP upper bound. We then similarly analyze an opportunistic multi-relay system, in which both selection and coherent demodulation use imperfect estimates. A distinctive aspect of our approach is the use of as few simplifying approximations as possible, which results in new results that are accurate at signal-to-noise-ratios as low as 1 dB for single and multi-relay systems. Using insights gleaned from an asymptotic analysis, we also present a simple, closed-form, nearly-optimal solution for allocation of energy between pilot and data symbols at the source and relay(s).

Sustaining cooperation on networks: an analytical study based on evolutionary game theory

We analytically study the role played by the network topology in sustaining cooperation in a society of myopic agents in an evolutionary setting. In our model, each agent plays the Prisoner's Dilemma (PD) game with its neighbors, as specified by a network. Cooperation is the incumbent strategy, whereas defectors are the mutants. Starting with a population of cooperators, some agents are switched to defection. The agents then play the PD game with their neighbors and compute their fitness. After this, an evolutionary rule, or imitation dynamic is used to update the agent strategy. A defector switches back to cooperation if it has a cooperator neighbor with higher fitness. The network is said to sustain cooperation if almost all defectors switch to cooperation. Earlier work on the sustenance of cooperation has largely consisted of simulation studies, and we seek to complement this body of work by providing analytical insight for the same. We find that in order to sustain cooperation, a network should satisfy some properties such as small average diameter, densification, and irregularity. Real-world networks have been empirically shown to exhibit these properties, and are thus candidates for the sustenance of cooperation. We also analyze some specific graphs to determine whether or not they sustain cooperation. In particular, we find that scale-free graphs belonging to a certain family sustain cooperation, whereas Erdos-Renyi random graphs do not. To the best of our knowledge, ours is the first analytical attempt to determine which networks sustain cooperation in a population of myopic agents in an evolutionary setting.

Secrecy in the 2-User Symmetric Deterministic Interference Channel with Transmitter Cooperation

This work presents novel achievable schemes for the 2-user symmetric linear deterministic interference channel with limited-rate transmitter cooperation and perfect secrecy constraints at the receivers. The proposed achievable scheme consists of a combination of interference cancelation, relaying of the other user's data bits, time sharing, and transmission of random bits, depending on the rate of the cooperative link and the relative strengths of the signal and the interference. The results show, for example, that the proposed scheme achieves the same rate as the capacity without the secrecy constraints, in the initial part of the weak interference regime. Also, sharing random bits through the cooperative link can achieve a higher secrecy rate compared to sharing data bits, in the very high interference regime. The results highlight the importance of limited transmitter cooperation in facilitating secure communications over 2-user interference channels.

Outer Bounds on the Secrecy Rate of the 2-User Symmetric Deterministic Interference Channel with Transmitter Cooperation

This paper derives outer bounds for the 2-user symmetric linear deterministic interference channel (SLDIC) with limited-rate transmitter cooperation and perfect secrecy constraints at the receivers. Five outer bounds are derived, under different assumptions of providing side information to receivers and partitioning the encoded message/output depending on the relative strength of the signal and the interference. The usefulness of these outer bounds is shown by comparing the bounds with the inner bound on the achievable secrecy rate derived by the authors in a previous work. Also, the outer bounds help to establish that sharing random bits through the cooperative link can achieve the optimal rate in the very high interference regime.

Financing And Cooperation For Sustainable Development In The Mediterranean, Sophia Antipolis, France, 3-4 June 2004: Volume II: Technical Report of the Workshop

(263 page document)

Keys to success in an example of inter-competitor cooperation: The case of the "Big Seven" basque chefs

The case of the top chefs relates the two areas that are apparently most distant, nutrition and health technology. It is the element that binds[3] the four, making them into a single whole. The results achieved by our chefs, in terms of their individual and collective success and their international projection of the image of the Basque Country comprise a goal to which other industries in the region should aspire. It is therefore our plan to apply the keys to this successful inter-competitor cooperation to development of the health technology industry. At the same time, we want to fulfil one of the aims that have been established for the food area: to make use of the country’s gastronomy-related assets.

Evolution of Cooperation in the Snowdrift Game with Incomplete Information and Heterogeneous Population

Differently from previous studies of tag-based cooperation, we assume that individuals fail to recognize their own tag. Due to such incomplete information, the action taken against the opponent cannot be based on similarity, although it is still motivated by the tag displayed by the opponent. We present stability conditions for the case when individuals play unconditional cooperation, unconditional defection or conditional cooperation. We then consider the removal of one or two strategies. Results show that conditional cooperators are the most resilient agents against extinction and that the removal of unconditional cooperators may lead to the extinction of unconditional defectors.

Emergence of Cooperation in Heterogeneous Population: A Discrete-Time Replicator Dynamics Analysis

The emergence of cooperation is analyzed in heterogeneous populations where individuals can be classified in two groups according to their phenotypic appearance. Phenotype recognition is assumed for all individuals: individuals are able to identify the type of every other individual, but fail to recognize their own type, and thus behave under partial information conditions. The interactions between individuals are described by 2 × 2 symmetric games where individuals can either cooperate or defect. The evolution of such populations is studied in the framework of evolutionary game by means of the replicator dynamics. Overlapping generations are considered, so the replicator equations are formulated in discrete-time form. The well-posedness conditions of the system are derived. Depending on the parameters of the game, a restriction may exist for the generation length. The stability analysis of the dynamical system is carried out and a detailed description of the behavior of trajectories starting from the interior of the state-space is given. We find that, provided the conditions of well-posedness are verified, the linear stability of monomorphic states in the discrete-time replicator coincides with the one of the continuous case. Specific from the discrete-time case, a relaxed restriction for the generation length is derived, for which larger time-steps can be used without compromising the well-posedness of the replicator system.

Soviet-American Cooperative Research on Marine Mammals. Volume 1- Pinnipeds: Under Project V.6. Marine Mammals, of the US-USSR Agreement on Cooperation in the Field of Environmental Protection

Some 25 to 30 yr ago, when we as students were beginning our respective careers and were developing for the first time our awareness of marine mammals in the waters separating western North America from eastern Asia, we had visions of eventually bridging the communication gap which existed between our two countries at that time. Each of us was anxious to obtain information on the distribution, biology, and ecological relations of "our" seals and walruses on "the other side," beyond our respective political boundari~s where we were not permitted to go to study them. We were concerned that the resource management practices on the other side of the Bering and Chukchi Seas, implemented in isolation, on a purely unilateral basis, might endanger the species which we had come to know and were striving to conserve. At once apparent to both of us was the need for free exchange of biological information between our two countries and, ultimately, joint management of our shared resources. In a small way, we and others made some initial efforts to generate that exchange by personal correspondence and through vocal interchange at the annual meetings of the North Pacific Fur Seal Commission. By the enabling Agreement on Cooperation in the Field of Environmental Protection, reached between our two countries in 1972, our earlier visions at last came true. Since that time, within the framework of the Marine Mammal Project under Area V of that Agreement, we and our colleagues have forged a strong bond of professional accord and respect, in an atmosphere of free intercommunication and mutual understanding. The strength and utility of this arrangement from the beginning of our joint research are reflected in the reports contained in this, the first compendium of our work. The need for a series of such a compendia became apparent to us in 1976, and its implementation was agreed on by the regular meeting of the Project in La Jolla, Calif., in January 1977. Obviously, the preparation and publication of this first volume has been excessively delayed, in part by continuing political distrust between our governments but mainly by increasing demands placed on the time of the contributors. In this period of growing environmental concern in both countries, we and our colleagues have been totally immersed in other tasks and have experienced great difficulty in drawing together the works presented here. Much of the support for doing so was provided by the State of Alaska, through funding for Organized Research at the University of Alaska-Fairbanks. For its ultimate completion in publishable form we wish to thank Helen Stockholm, Director of Publications, Institute of Marine Science, University of Alaska, and her staff, especially Ruth Hand, and the numerous referees narned herein who gave willingly oftheir time to review each ofthe manuscripts critically and to provide a high measure of professionalism to the final product. (PDF file contains 110 pages.)