2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540)
DOI: 10.1109/wcnc.2000.903973
|View full text |Cite
|
Sign up to set email alerts
|

C-ICAMA, a centralized intelligent channel assigned multiple access for multi-layer ad-hoc wireless networks with UAVs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
16
0

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 27 publications
(16 citation statements)
references
References 6 publications
0
16
0
Order By: Relevance
“…Using this preference relation, every task can evaluate its preferences over the possible coalitions that the task can form. Consequently, the proposed task allocation model verifies both hedonic conditions, and hence, the problem is easily mapped into a (N , ≻) hedonic coalition formation game, with the preference relations given by (9) and (11) which are also dependent on the underlying TU coalitional game described in Section III-A. Having formulated the problem as a hedonic game, the final task is to provide a distributed algorithm, based on the defined preferences, for forming the coalitions.…”
Section: B Task Allocation As a Hedonic Coalition Formation Gamementioning
confidence: 99%
See 2 more Smart Citations
“…Using this preference relation, every task can evaluate its preferences over the possible coalitions that the task can form. Consequently, the proposed task allocation model verifies both hedonic conditions, and hence, the problem is easily mapped into a (N , ≻) hedonic coalition formation game, with the preference relations given by (9) and (11) which are also dependent on the underlying TU coalitional game described in Section III-A. Having formulated the problem as a hedonic game, the final task is to provide a distributed algorithm, based on the defined preferences, for forming the coalitions.…”
Section: B Task Allocation As a Hedonic Coalition Formation Gamementioning
confidence: 99%
“…In this context, every player (task or UAV) has a knowledge of the current structure (depending on the nature of the tasks, they may know the structure through the UAVs, without any need to communicate with other tasks). Given the current structure, each player investigates its top preference, and decides to perform a switch operation, if possible through (9) and (11) for the UAVs and tasks respectively. We consider that, the order in which the players make their switch operations is random, but sequential.…”
Section: Hedonic Coalition Formation Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…If every node in the network can reach any other node by either direct connection or routing via other nodes, then we say that the network is connected in the sense of (5). In this paper, we assume that the network is connected to begin with and concentrate on how to improve connectivity as the network evolves.…”
Section: Uav-assisted Network Modelmentioning
confidence: 99%
“…Gu et al [7] proposed a routing scheme for multi-layer ad hoc networks that use UAVs in their backbones. Gu et al [8] also presented a multiple access protocol for such type of network.…”
mentioning
confidence: 99%