Amir-Hamed Mohsenian-Rad, Jianwei Huang, M. Chiang, V. Wong
{"title":"Simple, optimal, and robust random access","authors":"Amir-Hamed Mohsenian-Rad, Jianwei Huang, M. Chiang, V. Wong","doi":"10.1109/MILCOM.2008.4753315","DOIUrl":"https://doi.org/10.1109/MILCOM.2008.4753315","url":null,"abstract":"In this paper, we propose two distributed contention-based medium access control (MAC) algorithms to solve a network utility maximization (NUM) problem in wireless ad hoc networks. Most of the previous NUM-based random access algorithms have one or more of the following performance bottlenecks: (1) extensive signaling among nodes, (2) synchronous updates of contention probabilities, (3) small update stepsizes to ensure convergence but with typically slow speed, and (4) supporting a limited range of utility functions under which the NUM is shown to be convex. Our algorithms overcome these bottlenecks in all four aspects. First, only limited message passing among nodes is required. Second, fully asynchronous updates of contention probabilities are allowed. Furthermore, our algorithms are robust to arbitrary large message passing delays and message loss. Third, we do not utilize any stepsize during updates, thus our algorithms can achieve faster convergence. Finally, our algorithms have provable convergence, optimality, and robustness properties under a wider range of utility functions, even if the NUM problem is non-convex.","PeriodicalId":434891,"journal":{"name":"MILCOM 2008 - 2008 IEEE Military Communications Conference","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127930005","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}
{"title":"Directional antenna based time division scheduling in wireless ad hoc networks","authors":"Shaohua Li, D. Cho","doi":"10.1109/MILCOM.2008.4753581","DOIUrl":"https://doi.org/10.1109/MILCOM.2008.4753581","url":null,"abstract":"Conventional omni-antenna ad hoc MAC protocols, such as the IEEE 802.11, use RTS/CTS mechanism to avoid collision but waste much space by reserving the wireless media over a large area. Using directional antenna is a good solution to increase spatial reuse, however, packet collision caused by hidden nodes and deafness problem are serious. Recently, many schemes based on directional antenna in ad hoc networks have been proposed, however, most of the schemes have not solved the hidden node and deafness problem completely. In our paper, in order to solve these problem, a node self scheduling based MAC protocol is proposed. For guaranteeing the transmission of data, we let all the nodes overhear control messages at a fixed period periodically. Through utilizing these overhear periods, our proposed scheme can efficiently reduce hidden node problem and the deafness problems, which is a specific problem in directional antenna based network. Through simulation result, we have found that our scheme performs better than conventional protocol in the static Ad hoc network with respect to throughput and end to end delay. That is, our proposed scheme provides a good method to solve the hidden nodes, deafness problem and also reduce much interferences to guarantee the data transmission in wireless Ad hoc networks.","PeriodicalId":434891,"journal":{"name":"MILCOM 2008 - 2008 IEEE Military Communications Conference","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133987888","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}
{"title":"Superposition data transmission for cognitive radios: Performance and algorithms","authors":"Heejung Yu, Y. Sung, Y. Lee","doi":"10.1109/MILCOM.2008.4753558","DOIUrl":"https://doi.org/10.1109/MILCOM.2008.4753558","url":null,"abstract":"For improvement of achievable rate region in cognitive radio channels, a transmission method for secondary users is proposed. At first, the rate region of the sensing based cognitive radio scheme in which secondary users access the channel based on their channel sensing results with sensing error is analyzed. In the multiuser information theory, it is well-known that interference channel cases where both users transmit their own signal simultaneously achieve better rate region than the time-sharing method based on sensing outcomes. Based on this theoretical result, we propose the new transmission scheme in which a secondary transmitter relays primary userpsilas signal with a full-duplex amplify and forward (AF) manner while transmitting its own data at the same time. In the proposed method, we take account of practical implementation issues which are ignored in the theoretical method guaranteeing an upper bound of a rate region. With different geometric locations and power ratios between the relaying signal and the secondary userpsilas one, we evaluate the achievable rate region of the proposed method and compare with those of the conventional ones.","PeriodicalId":434891,"journal":{"name":"MILCOM 2008 - 2008 IEEE Military Communications Conference","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116305545","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}
{"title":"A new band AMC scheme for military use of indoor Mobile WiMAX system","authors":"Woo-Chan Kim, Soo-Yong Jeon, D. Cho","doi":"10.1109/MILCOM.2008.4753543","DOIUrl":"https://doi.org/10.1109/MILCOM.2008.4753543","url":null,"abstract":"Indoor wireless communication systems have been developed to improve cell coverage and throughput with low cost in indoor environment. Among several indoor wireless communication systems such as mobile WiMAX (worldwide interoperability for microwave access) system, WPAN (wireless personal area network) and WLAN (wireless local area network), the mobile WiMAX is one of the promising next-generation wireless communication systems and considered for military use by the U.S. Army. In indoor environment, a band AMC mode which is one of subchannel allocation modes in the mobile WiMAX system is mainly used since it is appropriate to the fixed or low mobility environments. However, the conventional band AMC mode is optimized for the outdoor environment, so it will cause many problems in the indoor environment. In this paper, we propose a new band AMC operation suited for the indoor environment. The proposed band AMC operation allocates the resource flexibly in indoor environment and it is compatible with the existing mobile WiMAX standard. The numerical analysis and simulation results show that a channel utilization of the proposed band AMC mode is higher than that of the conventional band AMC mode.","PeriodicalId":434891,"journal":{"name":"MILCOM 2008 - 2008 IEEE Military Communications Conference","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132894505","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}
{"title":"An enhanced multimode power loading algorithm applicable to large dimensional OFDM systems","authors":"E. Choi, Wan Choi, B. Womack","doi":"10.1109/MILCOM.2008.4753544","DOIUrl":"https://doi.org/10.1109/MILCOM.2008.4753544","url":null,"abstract":"Multi-mode power loading is an attractive power loading technique since it avoids iterative procedures and periodic updates of a threshold value in order to find the best power loading configuration. Simultaneously, multi-mode power loading achieves comparable spectral efficiency to optimal waterfilling with full channel state information (CSI) using only N feedback bits, where N is the number of subcarriers. The requirement of 2N - 1 brute-force searches, however, makes multi-mode power loading infeasible for large N. This paper proposes a new power loading technique to circumvent this limit of multi-mode power loading. Our analysis and numerical results show the proposed technique achieves the same spectral efficiency as multi-mode power loading only using N searches, thus working well even for large N.","PeriodicalId":434891,"journal":{"name":"MILCOM 2008 - 2008 IEEE Military Communications Conference","volume":"162 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134186898","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}
Sunghyun Kim, Youngwoo Yoon, Hyungsu Jeon, Minjae Kim, Hyuckjae Lee
{"title":"Selective discrete wavelet packet trnasform-based energy detector for cognitive radios","authors":"Sunghyun Kim, Youngwoo Yoon, Hyungsu Jeon, Minjae Kim, Hyuckjae Lee","doi":"10.1109/MILCOM.2008.4753628","DOIUrl":"https://doi.org/10.1109/MILCOM.2008.4753628","url":null,"abstract":"Spectrum sensing, a technique to recognize unused or idle spectrum, is a key function for cognitive radio (CR) and requires high precision and fast signal processing technique. To satisfy these requirements, two-stage sensing architecture that combines an energy detector and a feature detector was proposed by IEEE 802.22 working group (WG). For an energy detector, various techniques such as receive signal strength indicator (RSSI), multi resolution spectrum sensing (MRSS), fast Fourier transform (FFT) have been suggested and recently discrete wavelet packet transform (DWPT)-based method was proposed. In this paper, we propose a modified DWPT-based energy detector by using half-band elliptic IIR filters and double threshold method. Through simulation and complexity analysis, it is shown that the proposed scheme can reduce computational complexity and false detection probability compared to conventional DWPT-based energy detector for spectrum sensing in CR.","PeriodicalId":434891,"journal":{"name":"MILCOM 2008 - 2008 IEEE Military Communications Conference","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124055927","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}
Shirish S. Karande, Zheng Wang, H. Sadjadpour, J. Garcia-Luna-Aceves
{"title":"The optimal throughput order of wireless ad hoc networks and how to achieve it","authors":"Shirish S. Karande, Zheng Wang, H. Sadjadpour, J. Garcia-Luna-Aceves","doi":"10.1109/MILCOM.2008.4753142","DOIUrl":"https://doi.org/10.1109/MILCOM.2008.4753142","url":null,"abstract":"We show that, as the number of nodes in the network n tends to infinity, the maximum concurrent flow (MCF) and the minimum cut-capacity scale as Theta(n2r3(n)/k) for a random choice of k ges Theta(n) source-destination pairs, where r(n) is the communication range in the network. In addition, we show that it is possible to attain this optimal order throughput in interference-constrained networks if nodes are capable of multiple-packet transmission and reception. This result provides an improvement of Theta(nr2(n)) over the highest achieved capacity reported to date. Furthermore, in stark contrast to the conventional wisdom that has evolved from the Gupta-Kumar results, our results show that the capacity of ad-hoc networks can actually increase with n while the communication range tends to zero!","PeriodicalId":434891,"journal":{"name":"MILCOM 2008 - 2008 IEEE Military Communications Conference","volume":"429 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126091199","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}
Hyunchul Kim, Zheng Wang, H. Sadjadpour, J. Garcia-Luna-Aceves
{"title":"A general framework for the capacity analysis of wireless ad hoc networks","authors":"Hyunchul Kim, Zheng Wang, H. Sadjadpour, J. Garcia-Luna-Aceves","doi":"10.1109/MILCOM.2008.4753590","DOIUrl":"https://doi.org/10.1109/MILCOM.2008.4753590","url":null,"abstract":"In this paper, we introduce a general framework for computation of throughput capacity of wireless ad-hoc networks under all kinds of information modalities. We consider point-to-point communication for unicast, multicast, broadcast and any type of anycast routing and under physical model assumption. The general communication is denoted as (n, m, k)-cast where n is the number of nodes in the network, m+1 is the number of elements in (n, m, k)-cast group and k(klesm) is the number of destinations that receive packets from the source in each (n, m, k)-cast group. For example, (m=k=1) and (m=k=n) represent unicast and broadcast routings respectively. We demonstrate that the upper bound of throughput capacity is given by O(radicm(radic(nk))-1) bits/second. The lower bound of throughput capacity is computed as Omega(radicm((nkd)(n))-1), Omega((nkd2(n))-1) and Omega(n-1) bits/second when m=O(d-2(n)), Omega(k)=(d-2(n))=O(m) and Omega(d-2(n))=k respectively, where d(n) is a network parameter. The upper bound capacity is achieved based on (n, m, k)-cast tree constructed for routing and transport capacity while the lower bound capacity is achieved based on TDMA scheme and connected cell graph along (n, m, k)-cast tree.","PeriodicalId":434891,"journal":{"name":"MILCOM 2008 - 2008 IEEE Military Communications Conference","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133606703","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}
J. Niedzwiecki, B. Hombs, J. Farkas, Yiftach Eisenberg, J. Tranquilli
{"title":"Multiple-access capacity gains using multiuser detection under uniform linear power spacing","authors":"J. Niedzwiecki, B. Hombs, J. Farkas, Yiftach Eisenberg, J. Tranquilli","doi":"10.1109/MILCOM.2008.4753357","DOIUrl":"https://doi.org/10.1109/MILCOM.2008.4753357","url":null,"abstract":"This paper reviews the driving factors that affect performance gains in wireless networks when receivers are enabled by multiuser detection (MUD). Assuming the many-to-one, Gaussian multiple-access channel, we compare the capacity of a jointly optimal MUD receiver with the single user match filter using TDMA, FDMA and orthogonal CDMA access schemes. Comparisons are made under both equal power and unequal power conditions. Unequal power cases are constrained to uniform linear power spacing where the received powers are equally spaced over a given power spread. Motivation for this analysis is to better understand what multiple-access schemes will realize the highest potential improvements by incorporating MUD technology and under what system constraints those gains are maximized.","PeriodicalId":434891,"journal":{"name":"MILCOM 2008 - 2008 IEEE Military Communications Conference","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114980707","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}
{"title":"Analysis of adaptive WRED and CBWFQ algorithms on tactical edge","authors":"Ming-Jye Sheng, K.I. Park, T. Mak","doi":"10.1109/MILCOM.2008.4753371","DOIUrl":"https://doi.org/10.1109/MILCOM.2008.4753371","url":null,"abstract":"The military precedence-based assured service (PBAS) has been a prominent topic of discussion for the past several years. Whereas there are no official PBAS requirements for such converged services in the GIG, there is a general consensus that a PBAS capability is needed for the military operation under bandwidth constraint environment and that the associated functions and requirements should be clearly defined and documented. Each of network-centric projects also develops its own unique DSCP plan to support specific PBAS capability. One of the hardest challenges is to support the end-to-end QoS interoperability with different DSCP plans across these networks. This paper provides stochastic models for adaptive WRED and CBWFQ algorithms to analyze delay and throughput of each DSCP flow of a DSCP plan. It is time consuming for network-centric project engineer to use a packet level granularity simulator when investigating the performance and behavior of large and complex networks. This analytical model provides a simple tool to help network engineer understand and manage DSCP plan more effectively in support of various network deployment scenarios.","PeriodicalId":434891,"journal":{"name":"MILCOM 2008 - 2008 IEEE Military Communications Conference","volume":"216 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114982044","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}