{"title":"Tighter bounds for the minimum energy broadcasting problem","authors":"A. Navarra","doi":"10.1109/WIOPT.2005.51","DOIUrl":"https://doi.org/10.1109/WIOPT.2005.51","url":null,"abstract":"In this paper we present a new upper bound on the approximation ratio of the minimum spanning tree heuristic for the basic problem on ad-hoc networks given by the minimum-energy broadcast routing (MEBR) problem. We introduce a new analysis allowing to establish a 6.33-approximation ratio in the 2-dimensional case, thus decreasing the previously known 7.6 upper bound (M. Flammini et al., 2004).","PeriodicalId":109366,"journal":{"name":"Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05)","volume":"23 4 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":"125705734","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":"Ordered statistics based rate allocation scheme for closed loop MIMO-OFDM system","authors":"Le Zhang, Xiang He, Han-wen Luo, Xiaoying Gan","doi":"10.1093/ietcom/e89-b.12.3274","DOIUrl":"https://doi.org/10.1093/ietcom/e89-b.12.3274","url":null,"abstract":"We propose a new rate allocation algorithm for closed loop MIMO-OFDM system. The new scheme utilizes ordered statistics of channel matrix's singular value and is significantly simpler than ideal scheme which uses water-filling in both frequency and space domain. The proposed scheme is more flexible in that it does not force the use of large antenna array as \"conventional frequency flat constraint\" scheme does [J.R.B. Joon Hyun Sung, January 2003]. It also outperforms FFC algorithm under equal hardware complexity.","PeriodicalId":109366,"journal":{"name":"Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05)","volume":"39 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":"124150103","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":"Computing optimal or near-optimal trees for minimum-energy in wireless networks","authors":"D. Yuan","doi":"10.1109/WIOPT.2005.16","DOIUrl":"https://doi.org/10.1109/WIOPT.2005.16","url":null,"abstract":"We study minimum-energy broadcast routing in all-wireless networks. Up to now, a number of heuristics have been proposed for this NP-hard problem. Among them, the broadcast incremental power (BIP) algorithm, presented by Wieselthier et al., is most known. The contribution of our work consists of a refinement of the BIP algorithm and a novel integer programming formulation. The refined version of BIP is a natural extension of the original algorithm. The integer programming formulation allows us to compute optimal broadcast trees for networks of small size. For large-sized networks, the formulation admits the computation of a sharp lower bound to the optimal tree. We are thus able to efficiently assess the numerical performance of any heuristic algorithm for the problem. In our computational study, we compare the performance of our refined BlP algorithm to that of its original version, and examine the numerical performance of the two algorithms in terms of optimality using our integer programming model.","PeriodicalId":109366,"journal":{"name":"Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05)","volume":"32 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":"128703092","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}
E. Vicente, V.E. Mujica, D. Sisalem, R. Popescu-Zeletin
{"title":"NEURAL: a self-organizing routing algorithm for ad hoc networks","authors":"E. Vicente, V.E. Mujica, D. Sisalem, R. Popescu-Zeletin","doi":"10.1109/WIOPT.2005.32","DOIUrl":"https://doi.org/10.1109/WIOPT.2005.32","url":null,"abstract":"This paper evaluates a self-organizing routing protocol for ad hoc network, called the neuron routing algorithm (NEURAL). NEURAL has been designed taking into account the learning and self-organizing abilities of the brain. More precisely, it was inspired by the synapses process between neurons, when a signal is propagated. Basically, the most significant characteristic of NEURAL is the uniform distribution of the information around the node's location based on the current changes in its neighborhood. Using a 2-hop acknowledgment mechanism, local information is monitored in order to be used for route selection method, classification procedures and learning algorithms.","PeriodicalId":109366,"journal":{"name":"Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05)","volume":"84 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":"116271941","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":"Finite state Markov model for effective bandwidth calculation in wireless packet networks","authors":"Sumantra R. Kundu, K. Basu, Sajal K. Das","doi":"10.1109/WIOPT.2005.22","DOIUrl":"https://doi.org/10.1109/WIOPT.2005.22","url":null,"abstract":"In this paper we study the causal behavior of Rayleigh fading wireless channel and a single queue system buffer using the finite state Markov chain (FSMC) and the finite buffer fluid flow model. In the process, we propose a state partitioning scheme for capturing the wireless channel realities based on the combined effect of level crossing rate (LCR), average fade duration (AFD) and the average value of the signal SNR observed at the output of the matched filter or correlation demodulator. Relevant system parameters captured using such a scheme is linked with the fluid flow traffic model to create a modulated Markov process (MMP) that is used to calculate the packet loss rate and effective bandwidth of the system.","PeriodicalId":109366,"journal":{"name":"Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05)","volume":"28 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":"117013188","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}