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.

对等网络(Peer-to-Peer，简称P2P)这一术语是随着Napster的兴起和衰落而出现的。虽然已经有一些系统处于分布式计算的演进阶段，但P2P系统是在Napster部署之后才作为一个重要的社会和技术现象出现的。目前大多数流行的P2P系统都是针对文件共享应用，即文件存储在一些最终用户的机器上，而不是传统的客户/服务器模式中的中央服务器。无线自组网只是P2P网络的一个特例，通信不需要基础设施或蜂窝网络。近年来，人们对无线自组织网络进行了大量的研究。这些工作涉及计算机科学的许多理论方面，包括近似算法、计算几何、组合学、分布式算法。然而，无线广告网络仍然面临着许多挑战。由于有限的处理能力、存储能力和能量供应能力，许多传统的算法过于复杂，无法在无线自组织网络中实现。其他一些算法没有利用无线网络的几何性质。此外，目前开发的大多数无线网络算法都假设了每个无线节点的精确位置，这在实际中是不可能的。该领域发展的大多数算法还假设所有节点都具有统一的传输范围。当节点具有视差传输范围时，这些算法很可能会失效，此外，无线自组网需要高效的分布式算法，这些算法需要低计算复杂度和低通信复杂度，这些算法有望利用无线自组网的几何性质。需要回答的几个基本问题是：在无线自组织网络下，我们能否提高传统分布式算法的性能？无线节点的位置信息对算法的性能有影响吗？我们建议组织一次研讨会，征集解决这些挑战的最新研究成果。具体主题包括但不限于以下问题：连接部署、覆盖部署、吞吐量、移动性、信道分配、功率/拓扑控制、本地化路由、协作执行和机制设计、安全。来自国内和国际的一些初级教师和研究生一直在积极致力于解决一些挑战。他们将是这个研讨会的潜在参与者的主要组成部分。研讨会旨在将移动计算和分布式算法的研究人员聚集在一起，以促进合作。这是一次生动活泼的会议，涵盖了从运筹学到无线电工程问题这一领域的许多算法和离散方面。它的目的尤其是促进该领域的实践者和理论家之间的合作。我们计划于2004年6月2日在伊利诺伊州的芝加哥举办这次研讨会。研讨会论文将在研讨会会议记录中发表，选定的论文将发表在一本杂志的特刊上。通过组织无线自组织网络理论方面的研讨会，解决一些挑战和基本问题。研讨会的潜在参与者将是积极从事无线自组织网络理论方面工作的初级教师和高级博士生。因此，一个成功的研讨会将鼓励更多的初级教师和博士生参与这一领域的研究。我们自己与博士生合作的经验一直很出色。我们目前支持的博士生已经在主要的理论和/或网络会议上发表了相当多的论文。参加这个由国家科学基金会组织的研讨会将提高他们的生产力。由于拟议的研究活动涉及到对无线网络的理论理解和实际问题的解决，拟议的研讨会将促进与其他学科的教师的合作，来自行业的一些研究人员在更实际的环境中验证所开发的理论方法，以了解其实际性能。此外，由于自组织网络支持与救灾、公共事件协调以及军事和执法行动相关的应用程序，因此拟议的研究具有巨大的社会影响。