Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userAuction-based Incentive Mechanisms for Dynamic Mobile Ad-Hoc Crowd Service
132
0
0.0
(
0
)
Added by
Honggang Zhang Dr.
Publication date
2015
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
We investigate a type of emerging user-assisted mobile applications or services, referred to as Dynamic Mobile Ad-hoc Crowd Service (DMACS), such as collaborative streaming via smartphones or location privacy protection through a crowd of smartphone users. Such services are provided and consumed by users carrying smart mobile devices (e.g., smartphones) who are in close proximity of each other (e.g., within Bluetooth range). Users in a DMACS system dynamically arrive and depart over time, and are divided into multiple possibly overlapping groups according to radio range constraints. Crucial to the success of such systems is a mechanism that incentivizes users participation and ensures fair trading. In this paper, we design a multi-market, dynamic double auction mechanism, referred to as M-CHAIN, and show that it is truthful, feasible, individual-rational, no-deficit, and computationally efficient. The novelty and significance of M-CHAIN is that it addresses and solves the fair trading problem in a multi-group or multi-market dynamic double auction problem which naturally occurs in a mobile wireless environment. We demonstrate its efficiency via simulations based on generated user patterns (stochastic arrivals, random market clustering of users) and real-world traces.
rate research
Read More
Crowd sensing is a new paradigm which leverages the pervasive smartphones to efficiently collect and upload sensing data, enabling numerous novel applications. To achieve good service quality for a crowd sensing application, incentive mechanisms are necessary for attracting more user participation. Most of existing mechanisms apply only for the budget-constraint scenario where the platform (the crowd sensing organizer) has a budget limit. On the contrary, we focus on a different scenario where the platform has a service limit. Based on the offline and online auction model, we consider a general problem: users submit their private profiles to the platform, and the platform aims at selecting a subset of users before a specified deadline for minimizing the total payment while a specific service can be completed. Specially, we design offline and online service-constraint incentive mechanisms for the case where the value function of selected users is monotone submodular. The mechanisms are individual rationality, task feasibility, computational efficiency, truthfulness, consumer sovereignty, constant frugality, and also performs well in practice. Finally, we use extensive simulations to demonstrate the theoretical properties of our mechanisms.
Mobile crowd sensing (MCS) is a new paradigm which leverages the ubiquity of sensor-equipped mobile devices such as smartphones, music players, and in-vehicle sensors at the edge of the Internet, to collect data. The new paradigm will fuel the evolution of the Internet of Things to three changes as follows: First, the terminal devices at the edge of the Internet change from PCs to mobile phones. Second, the interactive mode extends from the virtual space to the real physical world. Thirdly, the forwarding manner of sensing data are undergoing the transition from the priori to the opportunistic. To better meet the demands of MCS applications at a societal scale, incentive mechanisms are indispensable. In this paper, we will first overview three categories of MCS applications, and then propose a new architecture for MCS applications. Based on the architecture, we discuss various research challenges about incentive mechanism designs for MCS applications, followed by potential future work discussions. Finally, we present potential future works.
This paper reports experimental results on self-organizing wireless networks carried by small flying robots. Flying ad hoc networks (FANETs) composed of small unmanned aerial vehicles (UAVs) are flexible, inexpensive and fast to deploy. This makes them a very attractive technology for many civilian and military applications. Due to the high mobility of the nodes, maintaining a communication link between the UAVs is a challenging task. The topology of these networks is more dynamic than that of typical mobile ad hoc networks (MANETs) and of typical vehicle ad hoc networks (VANETs). As a consequence, the existing routing protocols designed for MANETs partly fail in tracking network topology changes. In this work, we compare two different routing algorithms for ad hoc networks: optimized link-state routing (OLSR), and predictive-OLSR (P-OLSR). The latter is an OLSR extension that we designed for FANETs; it takes advantage of the GPS information available on board. To the best of our knowledge, P-OLSR is currently the only FANET-specific routing technique that has an available Linux implementation. We present results obtained by both Media Access Control (MAC) layer emulations and real-world experiments. In the experiments, we used a testbed composed of two autonomous fixed-wing UAVs and a node on the ground. Our experiments evaluate the link performance and the communication range, as well as the routing performance. Our emulation and experimental results show that P-OLSR significantly outperforms OLSR in routing in the presence of frequent network topology changes.
Multicasting is effective when its group members are sparse and the speed is low. On the other hand, broadcasting is effective when the group members dense and the speed are high. Since mobile ad hoc networks are highly dynamic in nature, either of the above two strategies can be adopted at different scenarios. In this paper, we propose an ant agent based adaptive, multicast protocol that exploits group members desire to simplify multicast routing and invoke broadcast operations in appropriate localized regimes. By reducing the number of group members that participate in the construction of the multicast structure and by providing robustness to mobility by performing broadcasts in densely clustered local regions, the proposed protocol achieves packet delivery statistics that are comparable to that with a pure multicast protocol but with significantly lower overheads. By our simulation results, we show that our proposed protocol achieves increased Packet Delivery Fraction (PDF) with reduced overhead and routing load.
Ubiquitous computing based on small mobile devices using wireless communication links is becoming very attractive. The computational power and storage capacities provided allow the execution of sophisticated applications. Due to the fact that sharing of information is a central problem for distributed applications, the development of self organizing middleware services providing high level interfaces for information managing is essential. ADS is a directory service for mobile ad-hoc networks dealing with local and nearby information as well as providing access to distant information. The approach discussed throughout this paper is based upon the concept of information markets.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
