{"title":"Can mobile Internet be all pervasive (panel session) (title only)","authors":"K. Basu","doi":"10.1145/345867.347525","DOIUrl":"https://doi.org/10.1145/345867.347525","url":null,"abstract":"","PeriodicalId":91426,"journal":{"name":"World of wireless mobile and multimedia networks. IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks","volume":"1 1","pages":"108"},"PeriodicalIF":0.0,"publicationDate":"2000-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91318334","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":"Delay analysis of selective repeat ARQ for a Markovian source over a wireless channel","authors":"J. G. Kim, M. Krunz","doi":"10.1145/313256.313278","DOIUrl":"https://doi.org/10.1145/313256.313278","url":null,"abstract":"In this paper, we analyze the mean delay experienced by a Markovian source over a wireless channel with time-varying error characteristics. The wireless link implements the selective-repeat automatic repeat request (ARQ) scheme for retransmission of erroneous packets. We obtain good approximations of the total delay, which consists of transport and resequencing delays. The transport delay, in turn, consists of queueing and transmission delays. In contrast to previous studies, our analysis accommodates both the inherent correlations between packet interarrival times (i.e., traffic burstiness) and the time-varying nature of the channel error rate. The probability generating function (PGF) of the queue length under the \"ideal\" SR ARQ scheme is obtained and combined with the retransmission delay to obtain the mean transport delay. For the resequencing delay, the analysis is performed under the assumptions of heavy traffic and small window sizes (relative to the channel sojourn times). The inaccuracy due to these assumptions is observed to be negligible. We show that ignoring the autocorrelations in the arrival process or the time-varying nature of the channel state can lead to significant underestimation of the delay performance, particularly at high channel error rates. Some interesting effects of key system parameters on the delay performance are observed.","PeriodicalId":91426,"journal":{"name":"World of wireless mobile and multimedia networks. IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks","volume":"57 1","pages":"59-66"},"PeriodicalIF":0.0,"publicationDate":"1999-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87506906","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 fast handoff scheme for wireless networks","authors":"C. L. Tan, K. Lye, S. Pink","doi":"10.1145/313256.313284","DOIUrl":"https://doi.org/10.1145/313256.313284","url":null,"abstract":"In this paper, we propose a fast and efficient handoff scheme to handle the movements of mobile nodes among small wireless cells at the fringes of the Internet. Our scheme adopts a hierarchical mobility management architecture to restrict the handoff processing overheads within the vicinity of the mobile node, and uses multicast as the packet forwarding mechanism to deliver packets to multiple base stations within the vicinity of the mobile node to achieve fast handoff performance. Our scheme is based on the Internet Protocol (IP) and is compatible with Mobile IP and its route optimization option. We also present simulation results for our simulation using the Network Simulator (ns2). The simulations show that our handoff scheme is fast enough to meet the requirements of an interactive voice communication session. The first packet from the new base station arrives at the mobile node within 10 ms after the mobile node initiates a handoff. Hence our scheme is suitable for roaming mobile nodes which may encounter numerous handoffs while they are in the midst of an interactive voice communication session such as Internet telephony.","PeriodicalId":91426,"journal":{"name":"World of wireless mobile and multimedia networks. IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks","volume":"1 1","pages":"83-90"},"PeriodicalIF":0.0,"publicationDate":"1999-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91165640","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}
B. V. Houdt, C. Blondia, O. Casals, J. García-Vidal, D. Vazquez
{"title":"Performance evaluation of a MAC protocol for wireless ATM networks supporting the ATM service categories","authors":"B. V. Houdt, C. Blondia, O. Casals, J. García-Vidal, D. Vazquez","doi":"10.1145/313256.313268","DOIUrl":"https://doi.org/10.1145/313256.313268","url":null,"abstract":"This paper presents a Medium Access Control (MAC) protocol for broadband wireless LANs based on the ATM transfer mode, together with the evaluation of its performance in terms of throughput and access delay. Important characteristics of the MAC protocol are the way information between the Mobile Stations (MS) and Base Station (BS) is exchanged and the algorithm used to allocate the bandwidth in order to support the service categories. The performance is heavily influenced by the way the BS is informed about the bandwidth needs of the MSs. In order to obtain an efficient system, a contention resolution scheme based on an Identifier Splitting Algorithm combined with polling is proposed for that purpose, in case no piggybacking can be used. A detailed analytical evaluation, both on cell level and higher layer packet level, is performed, leading to an assessment of the efficiency and the access delay of the system.","PeriodicalId":91426,"journal":{"name":"World of wireless mobile and multimedia networks. IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks","volume":"30 1","pages":"10-17"},"PeriodicalIF":0.0,"publicationDate":"1999-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87585802","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 coarse-grained mobile QoS","authors":"R. Jain, B. Sadeghi, E. Knightly","doi":"10.1145/313256.313289","DOIUrl":"https://doi.org/10.1145/313256.313289","url":null,"abstract":"Supporting Quality of Service is an important objective for future mobile and wireless systems, and requires resource reservation and admission control to achieve. In this paper, we introduce a novel coarse grained approach to admission control termed Virtual Bottleneck Cell. Our approach is designed to scale to many users and handoffs, while simultaneously controlling “hot spots” and system bottlenecks. The key technique is to hierarchically control the virtual system, ensuring QoS objectives are satisfied without requiring models or accurate predictions of the users’ future locations. We develop a simple analytical model to study the system and illustrate several key components of the approach. Finally, we perform simulations in a two-dimensional network to compare the performance obtained with Virtual Bottleneck Cell with alternate schemes, including the optimal off line algorithm.","PeriodicalId":91426,"journal":{"name":"World of wireless mobile and multimedia networks. IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks","volume":"30 1","pages":"109-116"},"PeriodicalIF":0.0,"publicationDate":"1999-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87397987","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}
Marko Hännikäinen, T. Vanhatupa, Jussi Lemiläinen, T. Hämäläinen, J. Saarinen
{"title":"Windows NT software design and implementation for a wireless LAN base station","authors":"Marko Hännikäinen, T. Vanhatupa, Jussi Lemiläinen, T. Hämäläinen, J. Saarinen","doi":"10.1145/313256.313265","DOIUrl":"https://doi.org/10.1145/313256.313265","url":null,"abstract":"This paper introduces the architecture of a base station designed for a new Wireless Local Area Network (WLAN). The emphasis is on the software but also backgrounds for the design choices made are discussed. The main design objective has been to develop a simple and low-cost system while maintaining suitability for a large variety of applications, ranging from wireless sensors to multimedia workstations. A base station is implemented by attaching a custom WLAN adapter card into a PC. The network adapter consists of a custom wireless Medium Access Control (MAC) protocol and a standard low-power radio subsystem. The PC hosts other wireless network related functions, such as management of a wireless cell and bridging of data between the wireless network and a wired LAN. Currently, a demonstrator network is being implemented. Components implemented for a base station contain the network adapter card, a Windows NT device driver, and a management application that is a user mode program needed for configuring and managing the network interface hardware and the MAC protocol. In addition, a Windows NT protocol driver has been developed for implementing the data exchange between the device driver and the management application.","PeriodicalId":91426,"journal":{"name":"World of wireless mobile and multimedia networks. IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks","volume":"76 1","pages":"2-9"},"PeriodicalIF":0.0,"publicationDate":"1999-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86619364","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}
Taekyoung Kwon, Ilkyu Park, Yanghee Choi, Sajal K. Das
{"title":"Bandwidth adaption algorithms with multi-objectives for adaptive multimedia services in wireless/mobile networks","authors":"Taekyoung Kwon, Ilkyu Park, Yanghee Choi, Sajal K. Das","doi":"10.1145/313256.313276","DOIUrl":"https://doi.org/10.1145/313256.313276","url":null,"abstract":"There is a growing interest in adaptive multimedia services in wireless/mobile networks where the bandwidth of an ongoing call is variable dun’ng its lijetime. We analyze the diverse objectives of adaptive multimedia jramework and propose two bandwidth adaptation algorithms (BAAS) that can satisfy these objectives: BAA-RA and BAA-RF. The BAA-RA takes into consideration revenue and anti-adaptation where the anti-adaptation is formulated as negative cost. This algorithm achieves near optimal total revenue with much less complexity compared to optimal BAA. The BAA-RF considers revenue and fairness, which aims at the mazimum revenue while satisfying the fairness defined herein. Initial simulation results are presented, which indicates a conflicting relation between anti-adaptation and fairness.","PeriodicalId":91426,"journal":{"name":"World of wireless mobile and multimedia networks. IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks","volume":"253 1","pages":"51-59"},"PeriodicalIF":0.0,"publicationDate":"1999-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79443528","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":"Multiclass priority fair queuing for hybrid wired/wireless quality of service support","authors":"J. Moorman, J. Lockwood","doi":"10.1145/313256.313274","DOIUrl":"https://doi.org/10.1145/313256.313274","url":null,"abstract":"The widescale deployment of packetized wireless network services currently lacks 4 mechanism to provide QoS in the jmmework of existing backbone networks. This paper describes 4 wireless scheduling algorithm that can provide QoS bounds to ATM tmfic. It tmnsjorms the standard ATM trafFc classes into pammeters for 4 priority, fair queuing algorithm, implemented at the wireless MAC layer. By supporting existing ATM tmfic, the scheduler avoids the need to redefine QoS specifically for the packetized wireless channel. Bounds are derived for delay and throughput on the individual CBR and rt-VBR virtual connections. The scheduler maps ATM QoS pammeters into priorities and weights for the wireless MAC. The protocol supports CBR, rtVBR, nrt-VBR, ABR, and VBR trafic. Real-time data uses 4 wireless fair queuing model. Non-real-time data is processed by 4 weighted round robin scheduler and 4 recirculating service queue that guamntees minimum cell rate (MCR). Best-eflort trajfic is serviced using a simple FIFO mechanism. Buffers are shared across priorities to make more e&ient use of memory.","PeriodicalId":91426,"journal":{"name":"World of wireless mobile and multimedia networks. IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks","volume":"59 1","pages":"43-50"},"PeriodicalIF":0.0,"publicationDate":"1999-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85361762","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":"Factoring a mobile client's effective processing speeed into the image transcoding decision","authors":"Richard Han","doi":"10.1145/313256.313285","DOIUrl":"https://doi.org/10.1145/313256.313285","url":null,"abstract":"An image transcoding proxy decides whether to transcode an image fetched from the Web based either on the criterion of reducing the overall response time (store-and-forward proxies), or the criterion of avoiding buffer overflow (streamed proxies). In this paper, we introduce a new parameter, namely a mobile client’s effective processing speed, into the analytical formulation of both transcoding decisions, and study the practical importance of this parameter when transcoding is applied for standard PDA clients. CPU-intensive operations like image decompression, colorspace conversion and scaling can together add excessive delay to the perceived response time when performed on a mobile client that has severely limited processing capability. Under certain conditions, a transcoding proxy that sends GIF or JPEG images can incur greater delay due to decompression on a PDA client than a better informed transcoding proxy that chooses instead to send bit-mapped equivalents that incur little to no client-side decoding delay. We designed three experiments that partitioned image processing functions between a proxy and a standard PDA in order to assess the importance of a client’s CPU limitations on the image transcoding decision. First, images were fetched by a standard Web browser that decompressed GIF’s on the PDA. This browser also enforced scaling on every image to fit within the PDA’s small screen. Second, we added a transcoding proxy that pre-scaled images, thereby bypassing the browser’s scaling function but still requiring the browser to decompress the scaled GIF’s. Third, we migrated both scaling and decompression off of the PDA on to the proxy. The proxy pre-scaled as before, and also transcoded GIF’s to grayscale bitmaps that required no client-side decompression. We measured response times from each of these three experiments and quantified how much improvement in response time can be achieved when a proxy assists a CPU-limited PDA by performing some or all CPU-intensive image processing tasks on the transcoding proxy.","PeriodicalId":91426,"journal":{"name":"World of wireless mobile and multimedia networks. IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks","volume":"47 1","pages":"91-98"},"PeriodicalIF":0.0,"publicationDate":"1999-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87731893","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":"Multimedia Web services for mobile clients using quality aware transcoding","authors":"Surendar Chandra, C. Ellis, Amin Vahdat","doi":"10.1145/313256.313287","DOIUrl":"https://doi.org/10.1145/313256.313287","url":null,"abstract":"Mobile applications will increasingly depend upon multimedia information originating in the web and attempt to access this data over wireless networks that are more expensive and slower than typical wireline internet access from desktops. Transcoding is an important technique that can allow network proxy servers to offer differentiated service by customizing the delivered object size for the network bandwidth available on the “last hop” to the mobile client. We exploit technology that we had previously developed that characterized the quality versus size tradeoffs in transcoding JPEG images. This technology supplies more information for use in transcoding policy decision making. We evaluate the performance benefits of incrementally incorporating this information in a series of transcoding policies. The principal contribution of this work is the demonstration that it is possible to use informed transcoding techniques to balance the need for good quality of multimedia content while reducing consumed network bandwidth and server CPU overhead. We show that policies that aggressively transcode the larger images can produce images with Quality factor values that closely follow the un-transcoded base case while still saving as much as 150 KB. A transcoding policy that has knowledge of the characteristics of the link to the client can avoid as many as 40% of (unnecessary) transcodings.","PeriodicalId":91426,"journal":{"name":"World of wireless mobile and multimedia networks. IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks","volume":"20 1","pages":"99-108"},"PeriodicalIF":0.0,"publicationDate":"1999-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72568104","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}