Summary
|
For Full-Text PDF, please login, if you are a member of IEICE, or go to Pay Per View on menu list, if you are a nonmember of IEICE. |
|
An Efficient and Privacy-Aware Meeting Scheduling Scheme Using Common Computational Space Md. Nurul HUDA Eiji KAMIOKA Shigeki YAMADA Publication IEICE TRANSACTIONS on Information and Systems Vol.E90-D No.3 pp.656-667 Publication Date: 2007/03/01 Online ISSN: 1745-1361 DOI: 10.1093/ietisy/e90-d.3.656 Print ISSN: 0916-8532 Type of Manuscript: PAPER Category: Distributed Cooperation and Agents Keyword: algorithm, constraint, distributed computing, mobile agent, privacy, Full Text: PDF(550.3KB)>>
Summary: Privacy is increasingly viewed as a key concern in multi-agent based algorithms for Distributed Constraint Satisfaction Problems (DCSP) such as the Meeting Scheduling (MS) problem. Many algorithms aim for a global objective function and as a result, incur performance penalties in computational complexity and personal privacy. This paper describes a mobile agent-based scheduling scheme called Efficient and Privacy-aware Meeting Scheduling (EPMS), which results in a tradeoff among complexity, privacy, and global utility. It also introduces a privacy loss model for collaborative computation, multiple criteria for evaluating privacy in the MS problem, and a privacy measurement metric called the Min privacy metric. We have utilized a common computational space in EPMS for reducing the complexity and the privacy loss in the MS problem. The analytical results show that EPMS has a polynomial time computational complexity. In addition, simulation results show that the obtained global utility for scheduling multiple meetings with EPMS is close to the optimal level and the resulting privacy loss is less than for those in existing algorithms. | ||||||||||
| ||||||||||
