DIALM-POMC '03Pub Date : 2003-09-19DOI: 10.1145/941079.941089
F. Kuhn, A. Zollinger
{"title":"Ad-hoc networks beyond unit disk graphs","authors":"F. Kuhn, A. Zollinger","doi":"10.1145/941079.941089","DOIUrl":"https://doi.org/10.1145/941079.941089","url":null,"abstract":"In this paper we study a model for ad-hoc networks close enough to reality as to represent existing networks, being at the same time concise enough to promote strong theoretical results. The Quasi Unit Disk Graph model contains all edges shorter than a parameter d between 0 and 1 and no edges longer than 1.We show that .in comparison to the cost known on Unit Disk Graphs .the complexity results in this model contain the additional factor 1 /d2. We prove that in Quasi Unit Disk Graphs flooding is an asymptotically message-optimal routing technique, provide a geometric routing algorithm being more efficient above all in dense networks, and show that classic geometric routing is possible with the same performance guarantees as for Unit Disk Graphs if d = 1/v2.","PeriodicalId":315744,"journal":{"name":"DIALM-POMC '03","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127505705","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
DIALM-POMC '03Pub Date : 2003-09-19DOI: 10.1145/941079.941087
P. Floréen, P. Kaski, J. Kohonen, P. Orponen
{"title":"Multicast time maximization in energy constrained wireless networks","authors":"P. Floréen, P. Kaski, J. Kohonen, P. Orponen","doi":"10.1145/941079.941087","DOIUrl":"https://doi.org/10.1145/941079.941087","url":null,"abstract":"We consider the problem of maximizing the lifetime of a given multicast connection in a wireless network of energy-constrained (e.g. battery-operated) nodes, by choosing ideal transmission power levels for the nodes relaying the connection. We distinguish between two basic operating modes: In a static assignment, the power levels of the nodes are set at the beginning and remain unchanged until the nodes are depleted of energy. In a dynamic assignment, the powers can be adjusted during operation.We show that lifetime-maximizing static power assignments can be found in polynomial time, whereas for dynamic assignments, a quantized-time version of the problem is NP-hard. We then study the approximability of the quantized dynamic case and conclude that no polynomial time approximation scheme (PTAS) exists for the problem unless Ptime = NP. Finally, by considering two approximation heuristics for the dynamic case, we show experimentally that the lifetime of a dynamically maintained multicast connection can be made several times longer than what can be achieved by the best possible static assignment.","PeriodicalId":315744,"journal":{"name":"DIALM-POMC '03","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129327619","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
DIALM-POMC '03Pub Date : 2003-09-19DOI: 10.1145/941079.941086
V. Syrotiuk, C. Colbourn, A. Ling
{"title":"Topology-transparent scheduling for MANETs using orthogonal arrays","authors":"V. Syrotiuk, C. Colbourn, A. Ling","doi":"10.1145/941079.941086","DOIUrl":"https://doi.org/10.1145/941079.941086","url":null,"abstract":"In this paper, we generalize the known topology-transparent medium access control protocols for mobile ad hoc networks by observing that their transmission schedule corresponds to an orthogonal array. Some new results on throughput are obtained as a consequence. We also show how to compute the probability of successful transmission if the actual node degree in the network exceeds the design parameter related to maximum node degree, showing the sensitivity of the schedule to this parameter. The selection of orthogonal array to provide the best throughput is also examined, and combinatorial generalizations are explored. Finally we outline schemes that combine the delay guarantees of current approaches to handle exceeding the stipulated maximum node degree.","PeriodicalId":315744,"journal":{"name":"DIALM-POMC '03","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130971813","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
DIALM-POMC '03Pub Date : 2003-09-19DOI: 10.1145/941079.941080
A. Bar-Noy
{"title":"Windows scheduling as a paradigm for pushing information in wireless networks","authors":"A. Bar-Noy","doi":"10.1145/941079.941080","DOIUrl":"https://doi.org/10.1145/941079.941080","url":null,"abstract":"Given are n positive integers w1, w2, ..., wn called windows. The windows are associated with n equal length information pages. In the windows scheduling problem, the goal is to schedule all the pages on minimum number of identical broadcasting channels such that the gap between two consecutive appearances of page i on any of the channels is at most wi time slots where a time slot is the broadcasting time of one page.Our main application for windows scheduling is the implementation of efficient push systems for cellular and satellite networks. In such systems, the window size associated with a page corresponds to the quality of service associated with the page. That is, the window size is the maximum number of time slots a client who is listening to all the broadcasting channels needs to wait until it receives a particular page. Push systems are crucial to such wireless systems due to their one-way communication nature in which mobile users cannot use (or it is too expensive for them to use) pull systems to receive information. Push systems are also desirable for very popular information pages that would create bottlenecks if provided only via pull systems.Windows scheduling belongs to the general class of periodic scheduling problems that has applications in many disciplines (e.g., operations research, networking). The pages can be viewed as jobs and the channels as machines. The traditional optimization goal in periodic scheduling is an \"average\" type goal in which a job should be scheduled 1/wi fraction of the time and the quality of an algorithm is determined by some fairness issues. On the other hand, the windows scheduling problem has a \"max\" type optimization goal in which the gap between two consecutive appearances of a request must be smaller than wi. Both optimization goals provide practical solutions to the many applications of periodic scheduling.We discuss recent results and open problems for windows scheduling and its variants in off-line and on-line settings.","PeriodicalId":315744,"journal":{"name":"DIALM-POMC '03","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125566765","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
DIALM-POMC '03Pub Date : 2003-09-19DOI: 10.1145/941079.941084
D. Estrin
{"title":"Embedded networked sensing systems: motivations and challenges","authors":"D. Estrin","doi":"10.1145/941079.941084","DOIUrl":"https://doi.org/10.1145/941079.941084","url":null,"abstract":"The emerging Embedded Internet will transform the way in which we understand and manage our physical world. Embedded Networked Sensing Systems combine the wireless technologies that have revolutionized communications with sensor technologies that have revolutionized medical and industrial technology. Like the Internet, these large-scale, distributed, systems, composed of smart sensors embedded in the physical world, will eventually infuse the planet, monitoring and collecting information on such diverse subjects as endangered species, soil & air contaminants, medical patients, and buildings, bridges and other man-made structures.This talk will describe several motivating science applications and outline the technical challenges posed by these long-lived, autonomous, massively distributed and physically coupled systems. I will describe several initial building block mechanisms that we and others in the community have implemented (such as time and location synchronization, data-centric routing, and in-network storage and processing), as well as experimental deployments currently underway at the Center for Embedded Networked Sensing (<http://cens.ucla.edu>).","PeriodicalId":315744,"journal":{"name":"DIALM-POMC '03","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132030577","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
