{"title":"On the predictability of link lifetimes in urban MANETs","authors":"S. Bohacek, Andjela Ilic, V. Sridhara","doi":"10.1109/WIOPT.2005.34","DOIUrl":"https://doi.org/10.1109/WIOPT.2005.34","url":null,"abstract":"Link lifetime prediction is occurs frequently in MANET routing protocols. For example, in assigning cache timeout values and route durations, routing protocols make implicit predictions of link lifetime. Some protocols even make explicit predictions. In this paper the predictability of residual link lifetimes is examined. This investigation is performed via simulations that make use of detailed models of urban areas. Propagation is modeled using beam-tracing.","PeriodicalId":109366,"journal":{"name":"Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05)","volume":"15 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":"123772094","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 practical approach to QoS routing for wireless networks","authors":"Teresa Tung, Zhanfeng Jia, J. Walrand","doi":"10.1109/WIOPT.2005.6","DOIUrl":"https://doi.org/10.1109/WIOPT.2005.6","url":null,"abstract":"We study QoS routing in wireless networks. We impose a structure on the network to combat the far-reaching effects of interference. We observe that there is little difference between routes through shared interference domains; instead the choices exist between routes through different domains. Based on this observation, we suggest partitioning the network into non-overlapping clusters where each cluster represents an interference domain. Routing algorithms operate over the cluster-level topology and use shortest paths within the clusters. Clustering decouples the constraints allowing for estimates of the available capacity within a cluster via local measurements. We present a routing algorithm that chooses amongst cluster-level paths to accommodate a flow with certain QoS requirements. An admission control policy checks the feasibility of the suggested route and refines our estimates of available capacity.","PeriodicalId":109366,"journal":{"name":"Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05)","volume":"122 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":"129756792","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}
F. Dotti, Paulo Fernandes, Afonso Sales, O. M. Santos
{"title":"Modular analytical performance models for ad hoc wireless networks","authors":"F. Dotti, Paulo Fernandes, Afonso Sales, O. M. Santos","doi":"10.1109/WIOPT.2005.31","DOIUrl":"https://doi.org/10.1109/WIOPT.2005.31","url":null,"abstract":"Wireless ad hoc networks raised a series of challenging research tracks. In order to analyze and validate the research results achieved, thorough performance evaluation efforts are needed. In this context, the contribution of this paper is two fold: at one side we investigate the effect of forwarding in wireless ad hoc networks, drawing the throughput behavior under variation of connectivity, interference end number of sources; on the other side we propose stochastic automata networks (SAN) as a formalism well suited to the area because of its modularity, allowing model reuse and the structured stepwise representation of important aspects of the reality, and due to its ability to deal with models of considerable sizes, allowing the analytical evaluation of more complex situations.","PeriodicalId":109366,"journal":{"name":"Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05)","volume":"31 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":"134025163","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 hybrid scheduling framework for asymmetric wireless environments with request repetition","authors":"N. Saxena, M. C. Pinotti, K. Basu, Sajal K. Das","doi":"10.1109/WIOPT.2005.2","DOIUrl":"https://doi.org/10.1109/WIOPT.2005.2","url":null,"abstract":"The ever-increasing popularity of Web services, growing demand for wireless multimedia and introduction of new, feature-enhanced, hand-held devices has already given birth to a new set of data-centric applications. Providing such applications with enhanced data processing capability calls for an efficient scheduling and transmission technique. The goal of most scheduling strategy lies in reducing the average waiting time. However, in most practical systems the variation of waiting time often results in client's impatience, thus provoking the clients to send repeated requests for the particular data item(s). In this paper we have developed a new hybrid scheduling framework for heterogeneous, asymmetric environments, by exploring the advantages of broadcasting very popular (push) data and dissemination of less popular (pull) data. The data access probabilities and the cut-off point used to segregate push and pull sets are dynamically computed. Packet fair scheduling (PFS) and stretch-optimal scheduling principle is deployed to obtain the push and pull schedule respectively. The framework explicitly takes care of the repeated requests originating from the impatient clients and minimizes the overall expected access time by obtaining an optimal cut-off point. Extensive performance analysis and simulation experiments are performed to show the efficiency of the system in reducing the overall expected access time (delay).","PeriodicalId":109366,"journal":{"name":"Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05)","volume":"24 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":"114791027","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":"Towards an understanding of EASE and its properties","authors":"Stratis Ioannidis, P. Marbach","doi":"10.1109/WIOPT.2005.52","DOIUrl":"https://doi.org/10.1109/WIOPT.2005.52","url":null,"abstract":"We propose a model under which several inherent properties of the exponential age search routing protocol can be derived. By making simplifications on this model, we are able to address the issue of the optimality of a parameter of the protocol and to improve the existing upper bound on its performance.","PeriodicalId":109366,"journal":{"name":"Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05)","volume":"29 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133008187","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}
L. Badia, Cristiano Saturni, L. Brunetta, M. Zorzi
{"title":"An optimization framework for radio resource management based utility vs. price tradeoff in WCDMA systems","authors":"L. Badia, Cristiano Saturni, L. Brunetta, M. Zorzi","doi":"10.1109/WIOPT.2005.10","DOIUrl":"https://doi.org/10.1109/WIOPT.2005.10","url":null,"abstract":"In this paper we investigate radio resource management strategies for multimedia networks driven by economic aspects such as users' utility and service pricing. To this end, we discuss a framework in which the impact of both QoS and pricing is accounted for in the users' acceptance rate of the service. The model is general enough to be adapted to different situations and optimization goals. Thus, we discuss possible objectives for the network management under the constraints of meeting quality of service requirements, by satisfying at the same time technical conditions of feasibility. We employ utility functions, in order to account for the additional characteristic represented by the traffic elasticity, and consider the effect of price to have a realistic characterization of economic quantities. The resulting optimization problem is then discussed and analyzed, to derive general insight and identify possibilities for enhancement.","PeriodicalId":109366,"journal":{"name":"Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05)","volume":"18 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":"121826512","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":"Optimal controlled flooding search in a large wireless network","authors":"N. Chang, M. Liu","doi":"10.1109/WIOPT.2005.36","DOIUrl":"https://doi.org/10.1109/WIOPT.2005.36","url":null,"abstract":"In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large wireless network. We consider the class of controlled flooding search strategies where query/search packets are broadcast and propagated in the network until a preset TTL (time-to-live) value carried in the packet expires. Every unsuccessful search attempt results in an increased TTL value (i.e., larger search area) and the same process is repeated. We derive search strategies that minimize the search cost in the worst-case, via a performance measure in the form of the competitive ratio between the average search cost of a strategy and that of an omniscient observer. This ratio is shown in prior work to be lower bounded by 4 among all deterministic search strategies. In this paper we show that by using randomized strategies this ratio is lower bounded by e. We derive an optimal strategy that achieves this lower bound, and discuss its performance under other performance criteria.","PeriodicalId":109366,"journal":{"name":"Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05)","volume":"6 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":"125471888","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":"Closed and open loop optimal control of buffer and energy of a wireless device","authors":"V. Borkar, A. Kherani, B. Prabhu","doi":"10.1109/WIOPT.2005.15","DOIUrl":"https://doi.org/10.1109/WIOPT.2005.15","url":null,"abstract":"We study a decision problem faced by an energy limited wireless device that operates in discrete time. There is some external arrival to the device's transmit buffer. The possible decisions are: a) to serve some of the buffer content; b) to reorder a new battery after serving the maximum possible amount that it can; or c) to remain idle so that the battery charge can increase owing to diffusion process (which is possible in some commercially available batteries). We look at open and closed-loop controls of the system. The closed-loop control problem is a using the framework of Markov decision processes. We address both finite and infinite horizon discounted costs as well as average cost minimization problems. Without using any second order characteristics, we obtain results that include i) optimality of bang-bang control, ii) the optimality of threshold based policies, iii) parametric monotonicity of the threshold, and iv) uniqueness of the threshold. For the open-loop control setting we use recent advances in application of multimodular functions to establish optimality of bracket sequence based control.","PeriodicalId":109366,"journal":{"name":"Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05)","volume":"47 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":"121451486","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":"Preventing impersonation attacks in MANET with multi-factor authentication","authors":"Dimitris Glynos, P. Kotzanikolaou, C. Douligeris","doi":"10.1109/WIOPT.2005.42","DOIUrl":"https://doi.org/10.1109/WIOPT.2005.42","url":null,"abstract":"Existing MANET authentication schemes cannot fully protect nodes from well-known impersonation attacks. Although these schemes cryptographically link an entity to a claimed identity, the actual entity is never linked to the physical node device. However, the link is implicitly assumed. This shortcoming may be easily exploited within a MANET setting, due to the broadcast nature of the access medium. In this paper we propose a multifactor authentication framework that extends the cryptographic link, binding an entity to a physical node device. This is achieved by using two distinct authentication factors; certified keys and certified node characteristics. Although the proposed framework requires additional sensing capabilities from the MANET nodes, it provides the additional confidence level required for node authentication in critical applications.","PeriodicalId":109366,"journal":{"name":"Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05)","volume":"7 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":"131608272","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":"Performance measurements of the saturation throughput in IEEE 802.11 access points","authors":"Enrico Pelletta, H. Munoz","doi":"10.1109/WIOPT.2005.39","DOIUrl":"https://doi.org/10.1109/WIOPT.2005.39","url":null,"abstract":"Performance measurements of IEEE 802.11 access points provide important information for networking research and network management. In this paper, we present an active measurement method to determine the maximum saturation throughput of wireless LAN access points. The saturation throughput is achieved when there always is a frame ready to transmit, and it reaches the maximum for optimal transmission conditions. We use the proposed method to measure and analyze the performance of five IEEE 802.11b access points. The results show the strength of our method and identify performance characteristics of commercial access points. The analysis produces the following results. The maximum saturation throughput shows significant differences between models. Increasing the offered load to the access point's Ethernet interface does not always increase the throughput; a few access points present a downlink throughput reduction when the offered load exceeds their bridging capabilities. Some access points exhibit better performance in certain orientations.","PeriodicalId":109366,"journal":{"name":"Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05)","volume":"26 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":"114303461","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}