Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05)最新文献_第3页

Analysis of a distributed algorithm to determine multiple routes with path diversity in ad hoc networks ad hoc网络中具有路径分集的多路由的分布式算法分析

Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05) Pub Date : 2005-04-04 DOI: 10.1109/WIOPT.2005.12

Stephen Mueller, D. Ghosal

引用次数: 35

A novel call admission control in multi-service wireless LANs 一种新的多业务无线局域网呼叫接纳控制

Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05) Pub Date : 2005-04-04 DOI: 10.1109/WIOPT.2005.4

Danyan Chen, A. Elhakeem, Xiaofeng Wang

{"title":"A novel call admission control in multi-service wireless LANs","authors":"Danyan Chen, A. Elhakeem, Xiaofeng Wang","doi":"10.1109/WIOPT.2005.4","DOIUrl":"https://doi.org/10.1109/WIOPT.2005.4","url":null,"abstract":"A call admission control algorithm must try to admit as many calls as possible provided that their quality of service (QoS) requirements can be met without violating those of previously admitted calls. In this paper, we propose a simple and effective call admission control algorithm and its associated resource allocation mechanism ,referred to as the flexible call admission control, for recently proposed multi-pattern (MP) wireless local area networks (WLANs). The proposed flexible call admission control effectively takes the advantages of flexible pattern assignment in MP WLANs and the rate-adaptive feature of multimedia services to support multiple classes of traffic with diverse QoS requirements and priority levels. With the use of an innovative performance estimation mechanism, the proposed flexible call admission control and resource allocation algorithm has considerably lower complexity than that of the existing schemes. Simulation results have demonstrated that the use of MP FAC provides much higher system throughput and lower call blocking probability. It should be emphasized that the proposed FAC, although designed for MP WLANs, also works well with existing standard WLANs.","PeriodicalId":109366,"journal":{"name":"Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126150061","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}

引用次数: 8

Mobility prediction's influence on QoS in wireless networks: a study on a call admission algorithm 移动预测对无线网络QoS的影响:一种呼叫接纳算法的研究

Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05) Pub Date : 2005-04-04 DOI: 10.1109/WIOPT.2005.29

J. François, G. Leduc

引用次数: 16

k-server optimal task scheduling problem with convex cost function 具有凸代价函数的k-服务器最优任务调度问题

Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05) Pub Date : 2005-04-04 DOI: 10.1109/WIOPT.2005.25

Mingjie Lin, Yaling Ma

{"title":"k-server optimal task scheduling problem with convex cost function","authors":"Mingjie Lin, Yaling Ma","doi":"10.1109/WIOPT.2005.25","DOIUrl":"https://doi.org/10.1109/WIOPT.2005.25","url":null,"abstract":"We consider a class of k-server optimal task scheduling problems partitioning and scheduling N tasks with various real-time constrains and work loads on k servers with convex task processing cost function so as to minimize the total task processing cost while still guaranteeing satisfaction of all time constraints. This class has broad expressing power for practical scheduling problems in several areas such as real-time multimedia wireless transmission , CPU energy conservation, and warehouse order processing management, et. al. Our formulation is quite general such that most previous works can be readily reduced to a special case of the presented k-server optimal task scheduling problem. We show that, when k = 1, optimal solution can be obtained in computational complexity of O(N) and the corresponding optimal scheduling problem is equivalent to finding the shortest 2D Euclidean distance between two vertices inside a well-defined 2D polygon. However, when k 2, the optimal scheduling problem can be demonstrated to be NP-hard by reducing it to a well-known NP-complete bin-packing problem. Therefore, we conclude no polynomial time algorithm exists for a general k-server optimal task scheduling problem. We then construct approximation algorithms to solve the presented k-server problem in a practical way and illustrate its performance by simulation results and analysis.","PeriodicalId":109366,"journal":{"name":"Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127124588","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}

引用次数: 3

Power control and multiuser diversity in multiple access channels with two time-scale fading 双时标衰落下多址信道的功率控制与多用户分集

Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05) Pub Date : 2005-04-04 DOI: 10.1109/WIOPT.2005.40

Alex S. C. Leong, J. Evans, S. Dey

引用次数: 3

On range matrices and wireless networks in d dimensions d维范围矩阵与无线网络

Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05) Pub Date : 2005-04-04 DOI: 10.1109/WIOPT.2005.33

M. Desai, D. Manjunath

引用次数: 9

Iterated local optimization for minimum energy broadcast 最小能量广播迭代局部优化

Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05) Pub Date : 2005-04-04 DOI: 10.1109/WIOPT.2005.24

I. Kang, R. Poovendran

引用次数: 29

A novel framework for radio resource management in IEEE 802.11 wireless LANs 一种新的IEEE 802.11无线局域网无线资源管理框架

Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05) Pub Date : 2005-04-04 DOI: 10.1109/WIOPT.2005.5

M. Davis, Tristan Raimondi

引用次数: 20

Securing route optimisation in NEMO 确保NEMO中的航线优化

Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05) Pub Date : 2005-04-04 DOI: 10.1109/WIOPT.2005.45

M. Calderón, C. Bernardos, M. Bagnulo, I. Soto

引用次数: 21

A simulated annealing algorithm for energy-efficient sensor network design 节能传感器网络设计的模拟退火算法

Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05) Pub Date : 2005-04-04 DOI: 10.1109/WIOPT.2005.7

F. Lin, P. Chiu

引用次数: 36