In this paper, distributed relay selection in cooperative wireless networks is modeled as a Chinese restaurant game (CRG). Specifically, the CRG is used to model strategic relay selection decisions of source nodes, ta...
详细信息
In this paper, distributed relay selection in cooperative wireless networks is modeled as a Chinese restaurant game (CRG). Specifically, the CRG is used to model strategic relay selection decisions of source nodes, taking into account negative network externality due to the potential sharing of relay nodes among source nodes. In turn, a distributed relay selection algorithm is proposed and shown to converge to a Nash Equilibrium grouping. Simulation results verify the efficiency of the proposed distributed algorithm when compared with other relay selection schemes, and demonstrate that it yields a network sum-rate that is comparable with that of centralized relay selection.
In the paper, we consider the interference as a detriment to the performance of the relay enhanced cellular system. Then we build up the interference channel model based on amplify-and-forward protocol and decode-and-...
详细信息
In the paper, we consider the interference as a detriment to the performance of the relay enhanced cellular system. Then we build up the interference channel model based on amplify-and-forward protocol and decode-and-forward protocol, respectively. The interference comes not only from the adjacent cells, but also from the inner of the same cell. Moreover, proper power allocation can obtain a good tradeoff between the performance and the interference. Power allocation in interference relay channels based on non-cooperative game theory is proposed. Concretely, two stages constitute the game model, namely power allocation among the source nodes and among the relay nodes. The two utility functions are different from the different stations of the source nodes and relay nodes. But the two utility functions are designed to guarantee the target SINR. For the two-stage game, we prove the existence and uniqueness of Nash equilibriums, and the proposed distributed algorithm always converges to the unique Nash equilibrium from an arbitrary starting point. Meanwhile, simulation results show our allocation scheme has good convergence.
Existing research work towards the composition of complex federated services has assumed that service requests and deliveries flow through a particular service path or tree. Here, we extend such a service model to a d...
详细信息
Existing research work towards the composition of complex federated services has assumed that service requests and deliveries flow through a particular service path or tree. Here, we extend such a service model to a directed acyclic graph, allowing services to be delivered via parallel paths and interleaved with each other. Such an assumption of the service flow model has apparently introduced complexities towards the development of a distributed algorithm to federate existing services, as well as the provisioning of the required quality in the most resource-efficient fashion. To this end, we propose sFlow, a fully distributed algorithm to be executed on all service nodes, such that the federated service flow graph is resource efficient, performs well, and meets the demands of service consumers.
Wireless sensor network (WSN) has been considered to be the next generation paradigm of structural health monitoring (SHM) systems due to its low cost, high scalability and flexibility. However, some inherent limitati...
详细信息
ISBN:
(纸本)9781424435173;9781424435180
Wireless sensor network (WSN) has been considered to be the next generation paradigm of structural health monitoring (SHM) systems due to its low cost, high scalability and flexibility. However, some inherent limitations of WSN such as low-bandwidth wireless communication, limited resources on wireless sensor nodes, must be addressed to meet the generally high requirements of SHM. distributed in-network processing has been widely accepted as a solution to this problem. However, the drawbacks of existing distributed algorithms, such as the low sensitivity, the dependency on accurate structural model, the incapability of handling various environmental conditions, et al., greatly constrained their practical applications. In this paper, we propose a multi-scale strategy in WSNs for SHM applications. The approach, called the ACF-CCF, utilizes the autocorrelation function of individual sensor node to detect the existence of damage and the cross-correlation function of designated node pairs to obtain damage location. Through simulation and laboratory test, the effectiveness of the proposed approach is demonstrated. Compared with existing distributed SHM algorithms, the method is energy efficient, model free and is robust to various environmental conditions.
Node clustering is an effective solution for achieving good performance and high reliability for peer-to-peer (P2P) systems. To improve the performance of a clustered P2P system, it is important to balance the service...
详细信息
Node clustering is an effective solution for achieving good performance and high reliability for peer-to-peer (P2P) systems. To improve the performance of a clustered P2P system, it is important to balance the service load among the clusters in the system. In this paper, we describe a diffusive load balancing scheme for clustered P2P systems, which dynamically adjusts the size of the clusters, by moving nodes among the clusters, based on their service demands and node resource capacities. Our simulations show that the proposed load balancing scheme significantly improves the performance of a P2P system in terms of balanced available capacity.
Developing self-adaptive and self-organizing systems can be a difficult task, even for experts, because it has traditionally required programming individual devices in the hope that they exhibit the desired global beh...
详细信息
Developing self-adaptive and self-organizing systems can be a difficult task, even for experts, because it has traditionally required programming individual devices in the hope that they exhibit the desired global behavior. A new and better approach has been emerging: program the global behavior and derive the local behaviors-aggregate programming. This demonstration showcases our new WebProto software: a free and open-source web application that makes state-of-the-art advances in aggregate programming readily available to a broad community of students, teachers, system programmers, and researchers by alleviating the shortcomings associated with current aggregate programming toolkits.
Future cellular networks are expected to be heterogeneous with dense deployments of base transceiver stations and access points (wireless nodes). Energy consumption and interference management are two major issues in ...
详细信息
Future cellular networks are expected to be heterogeneous with dense deployments of base transceiver stations and access points (wireless nodes). Energy consumption and interference management are two major issues in such networks. The goal of this work is to develop a framework for deciding if particular nodes should be powered off to reduce interference and save energy. This is envisioned to occur over slow time-scales, i.e., on the order of minutes. The active nodes should provide a target quality of service (QoS) to all mobile users. A network utility maximization problem is formulated, which takes as input the network topology and aggregate demand information, and optimizes over the set of active nodes and the assignment of demands to the nodes. Centralized and distributed algorithms are presented that search for a local optimum, and numerical results are presented to illustrate the performance.
This paper proposes a remote monitoring and decision-making system for intelligent ships based on edge computing and distributed algorithms. Relying on the high bandwidth and low latency characteristics of 5 G communi...
详细信息
ISBN:
(数字)9798350389418
ISBN:
(纸本)9798350389425
This paper proposes a remote monitoring and decision-making system for intelligent ships based on edge computing and distributed algorithms. Relying on the high bandwidth and low latency characteristics of 5 G communication, real-time data processing and remote monitoring of ship operation status are realized. The system localizes a large amount of sensor data through edge computing, and combines distributed algorithms to improve data fusion and decisionmaking efficiency. Data transmission supported by 5G communication provides technical guarantee for seamless connection between ships and shore-based monitoring centers. Through real-time analysis of ship sensor data, the system can predict potential faults and optimize navigation strategies. Model simulation results show that the distributed algorithm based on edge computing has significant advantages in improving data processing speed, reducing decision response time by 15% and improving monitoring accuracy by 8.5%. This study provides technical support for remote monitoring and autonomous decision-making of intelligent ships, and verifies the broad application prospects of $\mathbf{5 G}$ communication in the field of maritime communications.
Wireless sensor networks have posed a number of challenging problems such as localization, deployment and tracking, etc. One of the interesting problems is the calculation of the coverage path for sensor networks. In ...
详细信息
Wireless sensor networks have posed a number of challenging problems such as localization, deployment and tracking, etc. One of the interesting problems is the calculation of the coverage path for sensor networks. In this paper, we design a localized algorithm to solve the worst coverage problem first introduced by Meguerdichian et al. All nodes cooperate to construct the worst coverage path with their one-hop neighbors’ information. Also, the correctness of the algorithm is proved under the diminishing model formally.
This paper studies a dominating set problem in heterogeneous wireless sensor networks, motivated by routing backbone design. In this problem, the goal is to find a bidirectional dominating set that preserves the hop d...
详细信息
This paper studies a dominating set problem in heterogeneous wireless sensor networks, motivated by routing backbone design. In this problem, the goal is to find a bidirectional dominating set that preserves the hop distance up to a factor of α. In recent work of Liu, Huang, Du and Jia (INFOCOM'16), they presented centralized and distributed algorithms for finding the solution to the problem when α ≥ 5 that uses at most 3/2 (8ρ+1) 2 (2ρ+1) 2 ·opt node, where ρ is the ratio between the maximum and the minimum transmission ranges and opt is the size of the optimal bidirectional dominating set. This paper presents a simple observation that can be applied to both centralized and distributed algorithms of Liu et al so that they use only 2(6ρ+1) 2 (2ρ+1) 2 ·opt nodes (at least 19% improvements). We also employ more aggressive heuristic to choose nodes into the dominating set in the centralized setting. Experimentally, this centralized algorithm improves over the previous algorithm of Liu et al approximately by 43.7%-52.0% (for dense instances) to 21.1%-38.1% (for sparse instances). Two key observations are the reasons for the improvements. First, to create connected dominating sets, the modified algorithm joins nodes one hop closer than the original algorithm. This first observation has theoretical justification and can be applied directly to both centralized and distributed algorithms of Liu et al to obtain some performance improvement. Secondly, by employing a more aggressive strategy when choosing nodes to include in the dominating set, the number of nodes used can be decreased. We provide only the centralized implementation of the second observation.
暂无评论