Paper Info
Title
Optimal power allocation and joint source-channel coding for wireless DS-CDMA visual sensor networks using the Nash Bargaining Solution.
Abstract
We consider the problem of resource allocation for a Direct Sequence Code Division Multiple Access (DS-CDMA) wireless visual sensor network (VSN). We use the Nash Bargaining Solution (NBS) from game theory in order to determine the transmission power and source and channel coding rate for each node. The NBS assumes that the nodes negotiate (using the help of a centralized control unit) in order to jointly determine their transmission parameters. The transmission powers are allowed to take continuous values, whereas the source and channel coding rate combination can only assume discrete values. Thus, the resulting optimization problem is a mixed-integer optimization task and is solved using Particle Swarm Optimization (PSO). Experimental results are provided and conclusions are drawn.
Year
DOI
Venue
2011
10.1109/ICASSP.2011.5946952
ICASSP
Keywords
Field
DocType
code division multiple access,combined source-channel coding,game theory,integer programming,particle swarm optimisation,resource allocation,spread spectrum communication,wireless sensor networks,DS-CDMA,Nash bargaining solution,PSO,direct sequence code division multiple access,game theory,joint source-channel coding,mixed-integer optimization,optimal power allocation,particle swarm optimization,resource allocation,wireless DS-CDMA visual sensor networks,Nash Bargaining Solution,Particle Swarm Optimization,Visual sensor network,cross-layer optimization,game theory
Particle swarm optimization,Mathematical optimization,Cross-layer optimization,Computer science,Visual sensor network,Resource allocation,Code division multiple access,Wireless sensor network,Optimization problem,Bargaining problem
Conference
ISSN
Citations 
PageRank 
1520-6149
9
0.53
References 
Authors
5
3
Name
Order
Citations
PageRank
Katerina Pandremmenou1232.93
Lisimachos P. Kondi230528.99
Konstantinos E. Parsopoulos319916.50