2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks最新文献_第2页

On the k-coverage of line segments by a non homogeneous Poisson-Boolean model 非齐次泊松-布尔模型下线段的k覆盖

2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks Pub Date : 2009-06-23 DOI: 10.1109/WIOPT.2009.5291571

S. T. Aditya, P. Manohar, D. Manjunath

引用次数: 0

Retransmission aware congestion control and distributed power allocation in MANETs 城域网中重传感知拥塞控制与分布式功率分配

2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks Pub Date : 2009-06-23 DOI: 10.1109/WIOPT.2009.5291588

A. Giovanidis, S. Stańczak

引用次数: 3

Optimal link scheduling and channel assignment for convergecast in linear WirelessHART networks 线性WirelessHART网络中最优链路调度和信道分配

2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks Pub Date : 2009-06-23 DOI: 10.1109/WIOPT.2009.5291641

Haibo Zhang, Pablo Soldati, M. Johansson

引用次数: 105

Gaming the jammer: Is frequency hopping effective? 利用干扰器:跳频有效吗?

2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks Pub Date : 2009-06-23 DOI: 10.1109/WIOPT.2009.5291621

K. Pelechrinis, Christos Koufogiannakis, S. Krishnamurthy

{"title":"Gaming the jammer: Is frequency hopping effective?","authors":"K. Pelechrinis, Christos Koufogiannakis, S. Krishnamurthy","doi":"10.1109/WIOPT.2009.5291621","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291621","url":null,"abstract":"Frequency hopping has been the most popularly considered approach for alleviating the effects of jamming attacks. In this paper, we provide a novel, measurement-driven, game theoretic framework that captures the interactions between a communication link and an adversarial jammer, possibly with multiple jamming devices, in a wireless network employing frequency hopping (FH). The framework can be used to quantify the efficacy of FH as a jamming countermeasure. Our model accounts for two important factors that affect the aforementioned interactions: (a) the number of orthogonal channels available for use and (b) the frequency separation between these orthogonal bands. If the latter is small, then the energy spill over between two adjacent channels (considered orthogonal) is high; as a result a jammer on an orthogonal band that is adjacent to that used by a legitimate communication, can be extremely effective. We account for both these factors and using our framework we provide bounds on the performance of proactive frequency hopping in alleviating the impact of a jammer. The main contributions of our work are: (a) Construction of a measurement driven game theoretic framework which models the interactions between a jammer and a communication link that employ FH. (b) Extensive experimentation on our indoor testbed in order to quantify the impact of a jammer in a 802.11a/g network. (c) Application of our framework to quantify the efficacy of proactive FH across a variety of 802.11 network configurations. (d) Formal derivation of the optimal strategies for both the link and the jammer in 802.11 networks. Our results demonstrate that frequency hopping is largely inadequate in coping with jamming attacks in current 802.11 networks. In particular, we show that if current systems were to support hundreds of additional channels, FH would form a robust jamming countermeasure1.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115721089","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}

引用次数: 49

Joint load balancing, scheduling, and interference mitigation in multi-cell and multi-carrier wireless data systems 多小区和多载波无线数据系统中的联合负载平衡、调度和干扰缓解

2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks Pub Date : 2009-06-23 DOI: 10.1109/WIOPT.2009.5291637

Honghai Zhang, S. Rangarajan

{"title":"Joint load balancing, scheduling, and interference mitigation in multi-cell and multi-carrier wireless data systems","authors":"Honghai Zhang, S. Rangarajan","doi":"10.1109/WIOPT.2009.5291637","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291637","url":null,"abstract":"We consider the problem of maximizing the weighted sum data rate in multi-cell and multi-carrier wireless data systems in the presence of interference. We present a scheme that jointly considers load balancing, user scheduling, and interference mitigation to improve the system performance. Our proposed scheme iteratively applies two processes. The first process solves the sub-problem of load balancing and user scheduling while fixing the power allocation of each BS (and thus fixing the interference). We prove that this sub-problem is NP-hard, and devise a 1/2-approximation algorithm to solve the problem. We also consider an extended model capturing finite queue size and propose a 1/2-approximation algorithm under this model. The second process solves the problem of interference mitigation assuming fixed load balancing and user scheduling. We develop a local-improvement based algorithm to solve this problem. Via simulations, we demonstrate that our joint scheme improves both average system throughput and fairness significantly. Compared to the scheme with fixed user-BS association and 1/3 frequency reuse, the lowest 10% cell-edge users obtain more than 60% performance improvement and 90%of users enjoy more than 30%throughput improvement.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114222408","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}

引用次数: 13

Transmission schedule optimization for half-duplex multiple-relay networks 半双工多中继网络的传输调度优化

2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks Pub Date : 2009-06-23 DOI: 10.1109/WIOPT.2009.5291631

Wen Wang, L. Ong, M. Motani

引用次数: 6

Quantization, channel compensation, and energy allocation for estimation in wireless sensor networks 无线传感器网络中估计的量化、信道补偿和能量分配

2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks Pub Date : 2009-06-23 DOI: 10.1109/WIOPT.2009.5291616

Xusheng Sun, E. Coyle

{"title":"Quantization, channel compensation, and energy allocation for estimation in wireless sensor networks","authors":"Xusheng Sun, E. Coyle","doi":"10.1109/WIOPT.2009.5291616","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291616","url":null,"abstract":"In clustered networks of wireless sensor motes, each mote collects noisy observations of the environment, quantizes these observations into a local estimate of finite length, and forwards them through one or more noisy wireless channels to the Cluster Head (CH). The measurement noise is assumed to be zero-mean and have finite variance. Each wireless hop is assumed to be a Binary Symmetric Channel (BSC) with a known crossover probability. We propose a novel scheme that uses dithered quantization and channel compensation to ensure that each motes' local estimate received by the CH is unbiased. The CH then fuses these unbiased local estimates into a global one using a Best Linear Unbiased Estimator (BLUE). The energy allocation problem at each mote and among different sensor motes are also discussed. Simulation results show that the proposed scheme can achieve much smaller mean square error (MSE) than two other common schemes while using the same amount of energy. The sensitivity of the proposed scheme to errors in estimates of the crossover probability of the BSC channel is studied by both analysis and simulation.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114279324","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}

引用次数: 7

Characterization of power consumption in thin clients due to protocol data transmission over IEEE 802.11 基于IEEE 802.11协议数据传输的瘦客户机功耗特性

2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks Pub Date : 2009-06-23 DOI: 10.1109/WIOPT.2009.5291601

P. Simoens, B. Vankeirsbilck, F. Ali, L. Deboosere, F. Turck, B. Dhoedt, P. Demeester, R. T. Duran, C. Desset

引用次数: 6

Low complexity cross-layer design for dense interference networks 密集干扰网络的低复杂度跨层设计

2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks Pub Date : 2009-06-23 DOI: 10.1109/WIOPT.2009.5291590

Sara Akbarzadeh, L. Cottatellucci, C. Bonnet

{"title":"Low complexity cross-layer design for dense interference networks","authors":"Sara Akbarzadeh, L. Cottatellucci, C. Bonnet","doi":"10.1109/WIOPT.2009.5291590","DOIUrl":"https://doi.org/10.1109/WIOPT.2009.5291590","url":null,"abstract":"We considered a dense interference network with a large number (K → ∞) of transmitter-receiver pairs. Each transmitter is endowed with a finite buffer and accepts packets from an arrival process. Each transmitter-receiver link is a fading vector channel with N diversity paths whose statistics are described by a Markov chain. We investigate distributed algorithms for joint admission control, rate and power allocation aiming at maximizing the individual throughput defined as the average information rate successfully received. The decisions are based on the statistical knowledge of the channel and buffer states of the other communication pairs and on the exact knowledge of their own channel and buffer states. In the case of a finite number of communication pairs this problem is computationally extremely intensive with an exponential complexity in the number of users. Assuming that K,N → ∞ with constant ratio the algorithm complexity becomes substantially independent of the number of active communications and grows with the groups of users having distinct asymptotic channel statistics. The cross-layer design is investigated for different kind of decoders at the receiver. The benefits of a cross layer approach compared to a resource allocation ignoring the states of the queues are assessed. The performance loss due to the use of policies designed for asymptotic conditions and applied to networks with a finite number of active communications is studied.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"163 8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129281679","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}

引用次数: 4

Emergence of algorithmically hard phases in transportation networks 交通网络中算法困难阶段的出现

2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks Pub Date : 2009-06-23 DOI: 10.1109/WIOPT.2009.5291593

C. Yeung, K. Y. Wong

引用次数: 0