8,230 research outputs found
Joint Head Selection and Airtime Allocation for Data Dissemination in Mobile Social Networks
Mobile social networks (MSNs) enable people with similar interests to
interact without Internet access. By forming a temporary group, users can
disseminate their data to other interested users in proximity with short-range
communication technologies. However, due to user mobility, airtime available
for users in the same group to disseminate data is limited. In addition, for
practical consideration, a star network topology among users in the group is
expected. For the former, unfair airtime allocation among the users will
undermine their willingness to participate in MSNs. For the latter, a group
head is required to connect other users. These two problems have to be properly
addressed to enable real implementation and adoption of MSNs. To this aim, we
propose a Nash bargaining-based joint head selection and airtime allocation
scheme for data dissemination within the group. Specifically, the bargaining
game of joint head selection and airtime allocation is first formulated. Then,
Nash bargaining solution (NBS) based optimization problems are proposed for a
homogeneous case and a more general heterogeneous case. For both cases, the
existence of solution to the optimization problem is proved, which guarantees
Pareto optimality and proportional fairness. Next, an algorithm, allowing
distributed implementation, for join head selection and airtime allocation is
introduced. Finally, numerical results are presented to evaluate the
performance, validate intuitions and derive insights of the proposed scheme
Distributed Relay Selection for Heterogeneous UAV Communication Networks Using A Many-to-Many Matching Game Without Substitutability
This paper proposes a distributed multiple relay selection scheme to maximize
the satisfaction experiences of unmanned aerial vehicles (UAV) communication
networks. The multi-radio and multi-channel (MRMC) UAV communication system is
considered in this paper. One source UAV can select one or more relay radios,
and each relay radio can be shared by multiple source UAVs equally. Without the
center controller, source UAVs with heterogeneous requirements compete for
channels dominated by relay radios. In order to optimize the global
satisfaction performance, we model the UAV communication network as a
many-to-many matching market without substitutability. We design a potential
matching approach to address the optimization problem, in which the optimizing
of local matching process will lead to the improvement of global matching
results. Simulation results show that the proposed distributed matching
approach yields good matching performance of satisfaction, which is close to
the global optimum result. Moreover, the many-to-many potential matching
approach outperforms existing schemes sufficiently in terms of global
satisfaction within a reasonable convergence time.Comment: 6 pages, 4 figures, conferenc
Byzantine Attack and Defense in Cognitive Radio Networks: A Survey
The Byzantine attack in cooperative spectrum sensing (CSS), also known as the
spectrum sensing data falsification (SSDF) attack in the literature, is one of
the key adversaries to the success of cognitive radio networks (CRNs). In the
past couple of years, the research on the Byzantine attack and defense
strategies has gained worldwide increasing attention. In this paper, we provide
a comprehensive survey and tutorial on the recent advances in the Byzantine
attack and defense for CSS in CRNs. Specifically, we first briefly present the
preliminaries of CSS for general readers, including signal detection
techniques, hypothesis testing, and data fusion. Second, we analyze the spear
and shield relation between Byzantine attack and defense from three aspects:
the vulnerability of CSS to attack, the obstacles in CSS to defense, and the
games between attack and defense. Then, we propose a taxonomy of the existing
Byzantine attack behaviors and elaborate on the corresponding attack
parameters, which determine where, who, how, and when to launch attacks. Next,
from the perspectives of homogeneous or heterogeneous scenarios, we classify
the existing defense algorithms, and provide an in-depth tutorial on the
state-of-the-art Byzantine defense schemes, commonly known as robust or secure
CSS in the literature. Furthermore, we highlight the unsolved research
challenges and depict the future research directions.Comment: Accepted by IEEE Communications Surveys and Tutoiral
- …