{"title":"Allocation of channels in wireless tree topologies","authors":"D. Niculescu, S. Bhatnagar, S. Ganguly","doi":"10.1109/ISWPC.2011.5751304","DOIUrl":"https://doi.org/10.1109/ISWPC.2011.5751304","url":null,"abstract":"Judiciously assigning channels to a wireless mesh network can substantially enhance capacity of the network. One particular flavor of mesh network is that with a tree topology, which has the property that all traffic passes through one central point. Usually the allocation problem is linked to problems of routing, load, and measurements of interference. In this paper we take advantage of the restrictions on the routing, and on potential load imposed by the topology, to present an allocation algorithm that is tailored for wireless trees. Using the connection characteristics of the topology, we define a conflict graph over which a coloring heuristic can provide better performance by not having to focus on connectivity/routing/interference. We show that the algorithm has a low complexity (quadratic in the number of nodes), and in simulation shows significant gains in performance when compared to simpler solutions.","PeriodicalId":403972,"journal":{"name":"International Symposium on Wireless and Pervasive Computing","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126589979","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 frame rate allocation for unicast and multicast wireless video communication","authors":"Nitin Khanna, A. Jagannatham","doi":"10.1109/ISWPC.2011.5751330","DOIUrl":"https://doi.org/10.1109/ISWPC.2011.5751330","url":null,"abstract":"In this paper we consider a paradigm for sum perceptual quality maximization in the context of unicast and multicast video transmission to heterogeneous multimedia wireless clients. The multimedia server is constrained by the processing overheads required for tasks such as video encoding, bit-stream extraction, packetisation etc. We demonstrate that the above problem of perceptual quality maximization is well represented by a constrained optimization framework. Further, this model can be readily extended to include QoS considerations in multicast transmission. Based on the system model, we present a closed form solution for frame rate allocation and a comprehensive algorithm for sum quality maximization. We compare the results obtained using the above mentioned frame rate allocation with the results obtained using a content agnostic equal frame rate allocation scheme and demonstrate the superiority of the proposed algorithm in both unicast and multicast scenarios.","PeriodicalId":403972,"journal":{"name":"International Symposium on Wireless and Pervasive Computing","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121692320","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":"Improving throughput of WLANs by scheduling random access","authors":"X. Tian, T. Ideguchi, T. Okuda, N. Okazaki","doi":"10.1109/ISWPC.2011.5751314","DOIUrl":"https://doi.org/10.1109/ISWPC.2011.5751314","url":null,"abstract":"The MAC protocol is important, especially for wireless LAN because of limited bandwidth. A great deal of research has been carried out and some of proposed schemes are effective. Specifically, considerable effort has been devoted to improving the IEEE 802.11 standard which is utilized widely. Previous theoretical analysis gave the upper bound of IEEE 802.11 DCF throughput which is far below the channel capacity and corresponding algorithm was proposed, which can achieve the throughput close to the upper bound. It seems that we cannot expect to enhance the throughput much more in a usual way. In the meantime, besides throughput, there are some other issues for DCF such as fairness and QoS support. However, except for several hybrid protocols, most proposals were either based on contention mode or schedule mode and neither of the two modes has possessed the good characters of the other. In this paper, we propose a new MAC scheme used for DCF (with no control node) that dynamically adapts to traffic changes without degradation of delay in the case of low traffic load and achieves high throughput which is close to transmission capacity in saturated case. The key idea is to divide the virtual frame into two parts, i.e., schedule part and contention part, and to enable each node to reserve a slot in schedule part. Unlike conventional hybrid protocols, every node does not have to intentionally reset any parameter according to the changing traffic load except its queue length. A distinguishing feature of this scheme is the novel way of allowing WLANs to work with low delay as in the contention-based mode and achieve high throughput as in the schedule-based mode without complicated on-line estimation required in previous schemes. This makes our scheme simpler and more reliable. Through an analysis of simulation results, we show that our scheme can greatly improve the throughput with low delay.","PeriodicalId":403972,"journal":{"name":"International Symposium on Wireless and Pervasive Computing","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129647436","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}
Jian Li, J. Chung, Jin Xiao, J. W. Hong, R. Boutaba
{"title":"On the design and implementation of a home energy management system","authors":"Jian Li, J. Chung, Jin Xiao, J. W. Hong, R. Boutaba","doi":"10.1109/ISWPC.2011.5751338","DOIUrl":"https://doi.org/10.1109/ISWPC.2011.5751338","url":null,"abstract":"To reduce energy consumption and wastage, effective energy management at home is key and an integral part of the future Smart Grid. In this paper, we present the design and implementation of Green Home Service (GHS) for home energy management. Our approach addresses the key issues of home energy management in Smart Grid: a holistic management solution, improved device manageability, and an enabler of Demand-Response. We also present the scheduling algorithms in GHS for smart energy management and show the results in simulation studies.","PeriodicalId":403972,"journal":{"name":"International Symposium on Wireless and Pervasive Computing","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121144590","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":"Decentralized block diagonalization algorithms for distributed MIMO systems","authors":"Mauricio Morato, Yifan Chen, C. Yuen, Z. Lei","doi":"10.1109/ISWPC.2011.5751334","DOIUrl":"https://doi.org/10.1109/ISWPC.2011.5751334","url":null,"abstract":"In a distributed MIMO system (D-MIMO), multiple base stations work in cooperation manner to enhance system throughput by suppressing inter-cell and inter-user interference. In this paper, we propose two practical distributed algorithms that are based on block diagonalization technique. The proposed schemes eliminate the need of iterative computations, and hence can be implemented without information exchange between multiple base stations. We also construct a suboptimal solution that requires only partial channel state information to be available at each base station. The sensitivity of system throughput versus number of users for various algorithms was demonstrated.","PeriodicalId":403972,"journal":{"name":"International Symposium on Wireless and Pervasive Computing","volume":"149 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121395471","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":"Channel shortening and equalization of OFDM/CDMA systems over doubly selective fading channels","authors":"Jui-Chi Chang, Fang-Biau Ueng, Jiun-Cheng Ning","doi":"10.1109/ISWPC.2011.5751329","DOIUrl":"https://doi.org/10.1109/ISWPC.2011.5751329","url":null,"abstract":"The performance of orthogonal frequency division multiplexing/code-division multiple-access (OFDM/CDMA) system is featured by the resistance to frequency selective fading and the support of multiple user access. However, OFDM/CDMA system suffers from multiple-access interference (MAI) and doubly selective fading in highly mobile channel. Based on basis expansion model (BEM), this paper proposes a receiver with time domain channel shortening filter cascaded with one-tap frequency domain equalizer for down-link multiple-input multiple-output (MIMO) OFDM/CDMA system over doubly selective fading channel. Simulation results show that the proposed receiver not only suppresses multiple-access interference but also equalizes the time and frequency selectivity.","PeriodicalId":403972,"journal":{"name":"International Symposium on Wireless and Pervasive Computing","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129167361","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":"Energy efficient signal acquisition via compressive sensing in wireless sensor networks","authors":"Wei Chen, I. Wassell","doi":"10.1109/ISWPC.2011.5751335","DOIUrl":"https://doi.org/10.1109/ISWPC.2011.5751335","url":null,"abstract":"This paper presents a novel approach based on the compressive sensing (CS) framework to monitor 1-D environmental information using a wireless sensor network (WSN). The proposed method exploits the compressibility of the signal to reduce the number of samples required to recover the sampled signal at the fusion center (FC) and so reduce the energy consumption of the sensors. An innovative feature of our approach is a new random sampling scheme that considers the causality of sampling, hardware limitations and the trade-off between the randomization scheme and computational complexity. In addition, a sampling rate indicator (SRI) feedback scheme is proposed to enable the sensor to adjust its sampling rate to maintain an acceptable reconstruction performance while minimizing the energy consumption. A significant reduction in the number of samples required to achieve acceptable reconstruction error is demonstrated using real data gathered by a WSN located in the Hessle Anchorage of the Humber Bridge.","PeriodicalId":403972,"journal":{"name":"International Symposium on Wireless and Pervasive Computing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125384317","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 semantic traffic management scheme for public safety applications in Mobile Ad Hoc Networks","authors":"N. A. Surobhi, Yaozhou Ma, A. Jamalipour","doi":"10.1109/ISWPC.2011.5751332","DOIUrl":"https://doi.org/10.1109/ISWPC.2011.5751332","url":null,"abstract":"Efficient management of network traffic is one of the most challenging research areas in Mobile Ad Hoc Networks (MANETs). It becomes even more challenging for human involved and information sensitive MANET applications (e.g., public safety applications). For example, in a MANET-assisted road safety system, witnesses of a road accident may introduce numerous redundant information over the network through their hand-held mobile devices. However, sometimes these generated information are not exactly identical but they can be syntactically or conceptually similar. Therefore, in order to reduce the traffic load in the network, this paper proposes a novel semantic scheme. This semantic scheme identifies the aforementioned semantic similarity and accordingly remove the information redundancy. The proposed scheme is facilitated by employing the well-known Latent Semantic Indexing (LSI) algorithm. Simulation results confirm the usefulness of the proposed technique in reduction of similar traffic in the network.","PeriodicalId":403972,"journal":{"name":"International Symposium on Wireless and Pervasive Computing","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125102480","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":"Vehicular traffic information dissemination for WAVE/DSRC networks","authors":"T. Hsieh, Y. Tseng","doi":"10.1109/ISWPC.2011.5751316","DOIUrl":"https://doi.org/10.1109/ISWPC.2011.5751316","url":null,"abstract":"In WAVE/DSRC networks, traffic information dissemination is a critical application. Whenever a piece of information needs to be broadcast to vehicles within a specified range, not only RSUs in the range, but also most OBUs in the range, need to help broadcast/relay the information. In this paper, we identify out two problems in WAVE/DSRC networks. The first one is the interval mismatch problem. The second is the session-driven disappearing problem. Then we propose the dissemination algorithms to solve these problems. Furthermore, we also improve the backoff timer mechanism and then take the vehicular characteristics into considerations, including automobile types, relative speeds of vehicles, and traffic density. Finally, we verify our results by simulations and make conclusions.","PeriodicalId":403972,"journal":{"name":"International Symposium on Wireless and Pervasive Computing","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131401892","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":"Data Rate-Aware Channel Assignment algorithm for multi-rate multi-channel wireless mesh networks","authors":"Sook-Chin Yip, Su-Wei Tan, T. Chuah","doi":"10.1109/ISWPC.2011.5751308","DOIUrl":"https://doi.org/10.1109/ISWPC.2011.5751308","url":null,"abstract":"Multi-rate multi-channel multi-radio wireless mesh networks (WMNs) have emerged as the next generation wireless mesh communications due to the availability of cheap, off-the-shelf IEEE 802.11 hardware. However, in a multi-rate IEEE 802.11 network, transmission over low rate links consumes disproportionally more time and resources as compared to that of high rate links. This performance anomaly occurs as a result of interference between low and high rate links as the overall throughput is reduced by the low rate links. Multiple non-overlapping channels can be used to reduce interference by using nodes (mesh routers) to communicate over distinct channels based on their respective data rates. In this paper, a Mesh-based Data Rate-Aware Channel Assignment (MesDRCA) algorithm is introduced to improve network capacity in IEEE 802.11 based multi-rate WMNs. The main idea of MesDRCA is to assign links having identical or comparable data rates on a common channel in order to minimize usage of channel resources. This reduces interference due to multi-rate links, thus improving throughput performance. Results obtained through extensive simulations show that MesDRCA gives better performance in terms of packet delivery ratio and aggregate network throughput over an existing channel assignment scheme.","PeriodicalId":403972,"journal":{"name":"International Symposium on Wireless and Pervasive Computing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133807958","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}