Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userCOUSTIC: Combinatorial Double auction for Task Assignment in Device-to-Device Clouds
114
0
0.0
(
0
)
Added by
Long Chen
Publication date
2018
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
With the emerging technologies of Internet of Things (IOTs), the capabilities of mobile devices have increased tremendously. However, in the big data era, to complete tasks on one device is still challenging. As an emerging technology, crowdsourcing utilizing crowds of devices to facilitate large scale sensing tasks has gaining more and more research attention. Most of existing works either assume devices are willing to cooperate utilizing centralized mechanisms or design incentive algorithms using double auctions. Which is not practical to deal with the case when there is a lack of centralized controller for the former, and not suitable to the case when the seller device is also resource constrained for the later. In this paper, we propose a truthful incentive mechanism with combinatorial double auction for crowd sensing task assignment in device-to-device (D2D) clouds, where a single mobile device with intensive sensing task can hire a group of idle neighboring devices. With this new mechanism, time critical sensing tasks can be handled in time with a distributed nature. We prove that the proposed mechanism is truthful, individual rational, budget balance and computational efficient. Our simulation results demonstrate that combinatorial double auction mechanism gets a 26.3% and 15.8% gains in comparison to existing double auction scheme and the centralized maximum matching based algorithm respectively.
rate research
Read More
Considering the energy-efficient emergency response, subject to a given set of constraints on emergency communication networks (ECN), this article proposes a hybrid device-to-device (D2D) and device-to-vehicle (D2V) network for collecting and transmitting emergency information. First, we establish the D2D network from the perspective of complex networks by jointly determining the optimal network partition (ONP) and the temporary data caching centers (TDCC), and thus emergency data can be forwarded and cached in TDCCs. Second, based on the distribution of TDCCs, the D2V network is established by unmanned aerial vehicles (UAV)-based waypoint and motion planning, which saves the time for wireless transmission and aerial moving. Finally, the amount of time for emergency response and the total energy consumption are simultaneously minimized by a multiobjective evolutionary algorithm based on decomposition (MOEA/D), subject to a given set of minimum signal-to-interference-plus-noise ratio (SINR), number of UAVs, transmit power, and energy constraints. Simulation results show that the proposed method significantly improves response efficiency and reasonably controls the energy, thus overcoming limitations of existing ECNs. Therefore, this network effectively solves the key problem in the rescue system and makes great contributions to post-disaster decision-making.
A constant need to increase the network capacity for meeting the growing demands of the subscribers has led to the evolution of cellular communication networks from the first generation (1G) to the fifth generation (5G). There will be billions of connected devices in the near future. Such a large number of connections are expected to be heterogeneous in nature, demanding higher data rates, lesser delays, enhanced system capacity and superior throughput. The available spectrum resources are limited and need to be flexibly used by the mobile network operators (MNOs) to cope with the rising demands. An emerging facilitator of the upcoming high data rate demanding next generation networks (NGNs) is device-to-device (D2D) communication. An extensive survey on device-to-device (D2D) communication has been presented in this paper, including the plus points it offers, the key open issues associated with it like peer discovery, resource allocation etc, demanding special attention of the research community, some of its integrant technologies like millimeter wave D2D (mmWave), ultra dense networks (UDNs), cognitive D2D, handover procedure in D2D and its numerous use cases. Architecture is suggested aiming to fulfill all the subscriber demands in an optimal manner. The Appendix mentions some ongoing standardization activities and research projects of D2D communication.
We provide a novel solution for Resource Discovery (RD) in mobile device clouds consisting of selfish nodes. Mobile device clouds (MDCs) refer to cooperative arrangement of communication-capable devices formed with resource-sharing goal in mind. Our work is motivated by the observation that with ever-growing applications of MDCs, it is essential to quickly locate resources offered in such clouds, where the resources could be content, computing resources, or communication resources. The current approaches for RD can be categorized into two models: decentralized model, where RD is handled by each node individually; and centralized model, where RD is assisted by centralized entities like cellular network. However, we propose LORD, a Leader-based framewOrk for RD in MDCs which is not only self-organized and not prone to having a single point of failure like the centralized model, but also is able to balance the energy consumption among MDC participants better than the decentralized model. Moreover, we provide a credit-based incentive to motivate participation of selfish nodes in the leader selection process, and present the first energy-aware leader selection mechanism for credit-based models. The simulation results demonstrate that LORD balances energy consumption among nodes and prolongs overall network lifetime compared to decentralized model.
In this paper, we develop a comprehensive analytical framework for cache enabled cellular networks overlaid with coordinated device-to-device (D2D) communication. We follow an approach similar to LTE Direct, where the base station (BS) is responsible for establishing D2D links. We consider that an arbitrary requesting user is offloaded to D2D mode to communicate with one of its k closest D2D helpers within the macrocell subject to content availability and helper selection scheme. We consider two different D2D helper selection schemes: 1) uniform selection (US), where the D2D helper is selected uniformly and 2) nearest selection (NS), where the nearest helper possessing the content is selected. Employing tools from stochastic geometry, we model the locations of BSs and D2D helpers using independent homogeneous Poisson point processes (HPPPs). We characterize the D2D mode probability of an arbitrary user for both the NS and US schemes. The distribution of the distance between an arbitrary user and its ith neighboring D2D helper within the macrocell is derived using disk approximation for the Voronoi cell, which is shown to be reasonably accurate. We fully characterize the overall coverage probability and the average ergodic rate of an arbitrary user requesting a particular content. We show that significant performance gains can be achieved compared to conventional cellular communication under both the NS and US schemes when popular contents are requested and NS scheme always outperforms the US scheme. Our analysis reveals an interesting trade off between the performance metrics and the number of candidate D2D helpers k. We conclude that enhancing D2D opportunities for the users does not always result in better performance and the network parameters have to be carefully tuned to harness maximum gains.
Mobile users in future wireless networks face limited wireless resources such as data plan, computation capacity and energy storage. Given that some of these users may not be utilizing fully their wireless resources, device-to-device (D2D) resource sharing is a promising approach to exploit users diversity in resource use and for pooling their resources locally. In this paper, we propose a novel two-sided D2D trading market model that enables a large number of locally connected users to trade resources. Traditional resource allocation solutions are mostly centralized without considering users local D2D connectivity constraints, becoming unscalable for large-scale trading. In addition, there may be market failure since selfish users will not truthfully report their actual valuations and quantities for buying or selling resources. To address these two key challenges, we first investigate the distributed resource allocation problem with D2D assignment constraints. Based on the greedy idea of maximum weighted matching, we propose a fast algorithm to achieve near-optimal average allocative efficiency. Then, we combine it with a new pricing mechanism that adjusts the final trading prices for buying and selling resources in a way that buyers and sellers are incentivized to truthfully report their valuations and available resource quantities. Unlike traditional double auctions with a central controller, this pricing mechanism is fully distributed in the sense that the final trading prices between each matched pair of users only depend on their own declarations and hence can be calculated locally. Finally, we analyze the repeated execution of the proposed D2D trading mechanism in multiple rounds and determine the best trading frequency.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
