Workshop Proposal on Theoretical Aspects of Wireless Ad Hoc Networks

关于无线自组织网络理论方面的研讨会提案

• 批准号: 0342259
• 负责人: Xiang-Yang Li
• 金额: $ 2万
• 依托单位: Illinois Institute of Technology
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2003
• 资助国家: 美国
• 起止时间: 2003-08-01 至 2004-07-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0342259&HistoricalAwards=false
• 关键词: Workshop; Proposal; Theoretical; Aspects; Wireless

The term \emph{peer-to-peer}(P2P) came to the force very publicly with the rise and fall of Napster.Although there are prior systems in this evolutionary phase of distributed computing, P2P system first emerges as a significant social and technical phenomenon right after the deployment of Napster.Currently most of popular P2P systems are aiming at the file sharing applications, where files are stored at some end-users' machines rather than at a central server in the traditional client/server model.Wireless ad hoc networking is just a special case of P2P networking, where no infrastructure or celluar networking is needed for communication.Recent years saw a great amount of research in wireless ad hoc networks. Theseworks involve a number of theoretical aspects of computer science, includingapproximation algorithms, computational geometry, combinatorics, distributedalgorithms. However, there are still many challenges in wireless ad hocnetworks. Due to the limited capability of processing power, storage, andenergy supply, many conventional algorithms are too complicated to beimplemented in a wireless ad hoc networks. Some other algorithms did not takeadvantage of the geometry nature of the wireless networks. Additionally, mostof the currently developed algorithms for wireless networks assumed a preciseposition of each wireless node, which is impossible practically. Majority ofthe algorithms developed in this area also assume all nodes have uniformtransmission range. These algorithms will likely fail when nodes havedisparity transmission ranges.Furthermore, the wireless ad hoc networks requires efficient distributedalgorithms with low computation complexity and low communication complexity.These algorithms are expected to take advantage of the geometry nature of thewireless ad hoc networks. Several fundamental questions should be answered:can we improve the performance of traditional distributed algorithms underwireless ad hoc networks? Does the position information of wireless nodes makedifference in algorithms' performance?We propose to organize a workshop to solicit the recent research efforts onaddressing these challenges. Specific topics include but are not limited tothe following issues:Deployment for Connectivity,Deployment for Coverage, Throughput,Mobility,Channel Assignment,Power/Topology Control,Localized Routing,Cooperation Enforcement and Mechanism Design,Security.A number of junior faculty and graduate students from both domestic andinternational have been actively working on addressing some of thesechallenges. They will be the main component of potential attendees of this workshop.The workshop is intended to bring together researchers in mobile computing anddistributed algorithms to foster cooperation. It is intended to be a livelymeeting, covering many of the algorithmic and discrete aspects of this fieldgoing from operations research to radio engineering problems. It aims, inparticular, at fostering the cooperation among practitioners and theoreticiansof the field. We plan to hold this workshop on June 2nd, 2004 at Chicago,Illinois. Workshop papers will be published in workshop proceedings andselected papers will be published in a special issue of a journal.By organizing the workshop on the theoretic aspects of wireless ad hoc networks that addresses the a number of challenge and fundamental problems.The potential attendees of the workshop will be junior faculty and senir PhD students who had been actively working in the theoretic aspects of wireless ad hoc networks.Thus, a successful workshop will initiate more junior faculty and PhD students in the research of this area.Our own experiences in working with PhD students has been excellent.Our currently supported Ph.D. students have already contributed to considerable number of papers published in major theoretical and/or networking conferences.Exposure to this workshop organized by National Science Foundation will increase their productivity.Since the proposed research activities involve theoretical understanding and solving of practical questions from wireless networking, the proposed workshop will foster collaborations with faculties from other discipline, some researchers from industry to verify the developed theoretical methods in a more practical settings to see its practical performance.Additionally, since ad hoc networks support applications related to disaster relief, public event coordination, and military and law enforcement operations, the proposed research has vast societal impact.

P2P（peer-to-peer）一词是随着Napster的兴起和衰落而出现的，虽然在这个分布式计算的发展阶段已经有了较早的系统，但P2P系统是在Napster出现之后才作为一种重要的社会和技术现象出现的，目前流行的P2P系统大多是针对文件共享应用的，无线自组织网络是P2P网络的一个特例，它不需要任何基础设施或蜂窝网络来进行通信。这些工作涉及计算机科学的一些理论方面，包括近似算法，计算几何，组合数学，分布式算法。然而，无线广告网络仍然存在许多挑战。由于处理能力、存储能力和能量供应能力的限制，许多传统算法过于复杂，难以在无线自组织网络中实现。其他一些算法没有利用无线网络的几何特性。此外，目前开发的无线网络算法大多假设每个无线节点的精确位置，这在实际中是不可能的。在这一领域中开发的大多数算法还假设所有节点具有均匀的传输范围。此外，无线自组网需要低计算复杂度和低通信复杂度的高效分布式算法，这些算法有望充分利用无线自组网的几何特性.有几个基本的问题需要回答：我们能否提高传统分布式算法在无线adhoc网络中的性能？无线节点的位置信息是否会影响算法的性能？我们建议组织一次研讨会，征求最近在应对这些挑战方面的研究成果。具体课题包括但不限于以下问题：连接部署，覆盖部署，吞吐量，移动性，信道分配，功率/拓扑控制，本地化路由，合作实施和机制设计，安全性。来自国内和国际的一些初级教师和研究生一直在积极致力于解决这些挑战。他们将是本次研讨会潜在与会者的主要组成部分。研讨会旨在将移动的计算和分布式算法的研究人员聚集在一起，以促进合作。它的目的是成为一个生动的会议，涵盖了许多算法和离散方面的这一领域从运筹学无线电工程问题。它的目的特别是促进该领域从业者和理论家之间的合作。我们计划于2004年6月2日在伊利诺斯州的芝加哥举办这次研讨会。研讨会论文将发表在研讨会论文集上，精选论文将发表在期刊特刊上。通过组织关于无线ad hoc网络理论方面的研讨会，解决了一些挑战和基本问题。研讨会的潜在参与者将是在无线ad hoc网络理论方面积极工作的初级教师和高级博士生。因此，一个成功的研讨会将启动更多的初级教师和博士生在这一领域的研究。2我们自己的经验，在与博士生的工作一直很好。3我们目前支持的博士。学生已在多个重要的理论及/或网络会议上发表了不少论文。参加由美国国家科学基金会举办的工作坊，将有助提高学生的工作效率。由于拟议的研究活动涉及理论理解及解决无线网络的实际问题，拟议的工作坊将促进与其他学科的教师合作，此外，由于adhoc网络支持与灾难救援、公共事件协调、军事和执法行动相关的应用，因此所提出的研究具有广泛的社会影响。