{"title":"Effective analysis framework of cooperative multi-relaying over fading environments","authors":"J. An, Hsin-Yin Huang","doi":"10.1109/ISWPC.2013.6707425","DOIUrl":"https://doi.org/10.1109/ISWPC.2013.6707425","url":null,"abstract":"Until now performance analyses about using the Rayleigh plus log-normal (composite) fading effect for relaying systems are still incomplete because it is generally accepted that underlying statistics do not lead to a closed-form expression. In this paper, we refine the analytical framework for cooperative relaying (dual-hop multi-relaying and direct links) based on a relaying power constraint scenario. We focus on overcoming the limitations of non-closed form problems of log-normal statistics and simplifying the tremendous complications for the analytical derivations of outage probability and bit-error-rate (BER) performance respectively. Both analytical deviations are closed-form expressions, and corroborated by the accurate expressions (integral non-closed form) respectively, with an excellent agreement results. As a consequence, we refine a generalized performance analysis framework, which provides a simple and effective approach for evaluating the impact of the shadowing effects, cooperative diversity gain and determining the cooperation power constraint for cooperative multi-relaying.","PeriodicalId":301015,"journal":{"name":"International Symposium on Wireless and pervasive Computing (ISWPC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129171691","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}
M. Pellenz, Edgard Jamhour, M. H. Pereira, R. Souza
{"title":"An outage-based method for planning wireless sensor mesh networks","authors":"M. Pellenz, Edgard Jamhour, M. H. Pereira, R. Souza","doi":"10.1109/ISWPC.2013.6707438","DOIUrl":"https://doi.org/10.1109/ISWPC.2013.6707438","url":null,"abstract":"The coverage area of wireless sensor networks (WSN) can be extended using the mesh topology, where intermediate nodes can act as routers to create a multi-hop path between a sensor node and the gateway. The mesh topology is specially useful to deploy WSN over large areas, to support the demand for novel applications to smart grid and smart cities. Multi-hop paths can significantly reduce the overall network capacity, because a same packet is re-transmitted stealing transmission time of the wireless channel of all nodes that are in the same contention domain. Thus, to improve the network capacity, short paths in terms of hops are desirable. However, when the number of hops is reduced, packets have to traverse longer distances without regeneration, increasing the probability of packet loss due to large and small scale propagation effects of the wireless channel. Lost packets need to be retransmitted also stealing time of the wireless channel. In this paper, we formulate a wireless capacity model for WSN that uses a Nakagami-m fading model, to evaluate retransmissions due to packet outage, and a contention model required to evaluate multi-hop paths in WSN. Using our model, we propose a method to the optimal planning of routes in WSN mesh topologies with or without outage constraints.","PeriodicalId":301015,"journal":{"name":"International Symposium on Wireless and pervasive Computing (ISWPC)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129467478","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":"Wireless access using MIMO subarrays at mm-wave bands","authors":"T. Cella, P. Orten, T. Ekman","doi":"10.1109/ISWPC.2013.6707430","DOIUrl":"https://doi.org/10.1109/ISWPC.2013.6707430","url":null,"abstract":"This paper shows a way to get high capacity outdoor radio link for a line-of-sight (LOS) system in the 70 GHz portion of the E-band (71-76 GHz). We consider a short range application with a maximum distance equal to 200 m. We design and evaluate the performance of a MIMO system with equal element spacing at the transmitter and the receiver. Each node of the MIMO system consists of a uniform rectangular array (URA), where the single element is a patch antenna, in order to achieve higher gains and narrow beams. Such configuration is much more compact compared to the antennas currently applied for the same bandwidth. We optimize the inter-element distances at the transmitter and the receiver. We evaluate the capacity achievable with different array sizes. The results show that, for the proposed link budget, capacity up to 34 bit/s/Hz is achievable at a range of 200 m, with practical dimensions.","PeriodicalId":301015,"journal":{"name":"International Symposium on Wireless and pervasive Computing (ISWPC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115243444","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":"The novel concept of single path multiple access (SPMA) using new advanced antenna technology","authors":"Muhammad Usman Sheikh, Jukka Lempiäinen","doi":"10.1109/ISWPC.2013.6707437","DOIUrl":"https://doi.org/10.1109/ISWPC.2013.6707437","url":null,"abstract":"The aim of this paper is to introduce a novel frequency reuse concept especially for macro cellular networks to substantially increase mobile network capacity, and simultaneously to avoid the implementation of low efficient small cells. Single path multiple access (SPMA) utilizes the characteristics of independent propagation paths for particular geographical location in the coverage area of mobile network. In SPMA concept, a communication between base station and mobile station happens through single independent propagation path, and the frequency resources can be reused in 5m × 5m areas, or even more often in 1m × 1m areas. Thus, the capacity of the network will be increased dramatically, and it can be managed in centralized manner at certain macro site locations. In already deployed cellular networks, these macro sites are mostly easily available, and that would help to implement SPMA to enhance the network capacity. Simulation results provided in this paper show the applicability of single path multiple access technique, by limiting the radiation of signal as single path propagation between base station and mobile station.","PeriodicalId":301015,"journal":{"name":"International Symposium on Wireless and pervasive Computing (ISWPC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132554509","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 grid-based energy efficient routing protocol in Wireless Sensor Networks","authors":"Cunxiang Chen, Zunwen He, Hongmei Sun, Jingming Kuang, De-meng Bai, Chenxi Yang","doi":"10.1109/ISWPC.2013.6707444","DOIUrl":"https://doi.org/10.1109/ISWPC.2013.6707444","url":null,"abstract":"Due to limited energy of Wireless Sensor Networks (WSNs), routing plays a crucial role in improving energy efficiency. The low-energy adaptive clustering hierarchy (LEACH) protocol is a classical solution to cut down energy cost, but it neglects residual energy of sensor nodes and long-range communication which causes low network coverage and high energy consumption. To avoid these shortcomings, we put forward a grid-based energy efficient routing protocol (GEERP) which focuses on three improvements: energy consumption, energy efficiency and network coverage. In GEERP, WSNs are divided into two levels: one is called secondary level grid (SG), which is formed by one cluster head (CH) and several cluster members (CMs); the other one is premier level grid (PG), which consists of nine adjacent SGs. In each round, CH is selected based on residual energy level of sensor nodes in a cluster. Then fused data of CH will be transmitted to sink node through multi-hop routing which is determined by minimum weight. Simulation results demonstrate that GEERP can not only balance network energy consumption of network but also can highly improve the network coverage.","PeriodicalId":301015,"journal":{"name":"International Symposium on Wireless and pervasive Computing (ISWPC)","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131427621","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 secure temporal-credential-based mutual authentication and key agreement scheme for wireless sensor networks","authors":"D. He, Neeraj Kumar, N. Chilamkurti","doi":"10.1109/ISWPC.2013.6707446","DOIUrl":"https://doi.org/10.1109/ISWPC.2013.6707446","url":null,"abstract":"With the development of wireless communication technology and sensor technology, the wireless sensor network (WSN) has been widely used in various applications, such as military surveillance, environment monitoring industry control, medical monitoring, and so on. In most of the cases, WSNs are deployed in unattended environment. So, these are more vulnerable to various attacks than traditional networks. To protect communications in WSNs, mutual authentication and key agreement schemes for WSNs have been studied widely. Recently, Xue et al. proposed a temporal-credential-based mutual authentication and key agreement scheme for WSNs and claimed their scheme could withstand various attacks. However, in this paper, we will point out that their scheme is vulnerable to the off-line password guessing attack, the user impersonation attack, the sensor node impersonation attack and the modification attack. To overcome weaknesses in Xue et al.'s scheme, we also propose a new temporal-credential-based mutual authentication and key agreement scheme for WSNs. Security analysis shows our scheme could overcome weaknesses in Xue et al.'s scheme. Performance analysis shows our scheme also has better performance. Therefore, our scheme is more suitable for providing secure communication in WSNs.","PeriodicalId":301015,"journal":{"name":"International Symposium on Wireless and pervasive Computing (ISWPC)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124352525","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":"Theoretic approach to BP-based WBF decoding algorithm of LDPC codes","authors":"E. Lu, Tso-Cho Chen, Pen-Yao Lu","doi":"10.1109/ISWPC.2013.6707424","DOIUrl":"https://doi.org/10.1109/ISWPC.2013.6707424","url":null,"abstract":"A theoretic approach to the belief-propagation - based weighted bit-flipping (BP-based WBF) algorithm is proposed for decoding low-density parity-check codes. The decoding algorithm can be easily simplified to IMWBF, MWBF, WBF or BF decoding algorithms by setting different parameters; hence it could offer a high flexible performance/complexity trade-off for hybrid decoding.","PeriodicalId":301015,"journal":{"name":"International Symposium on Wireless and pervasive Computing (ISWPC)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126192399","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}
Y. Sun, C. Phillips, Jingwen Bai, Liumeng Song, Rina Wu
{"title":"QoS enabled routing protocol for CR MANET","authors":"Y. Sun, C. Phillips, Jingwen Bai, Liumeng Song, Rina Wu","doi":"10.1109/ISWPC.2013.6707423","DOIUrl":"https://doi.org/10.1109/ISWPC.2013.6707423","url":null,"abstract":"This paper proposes a cross layer routing protocol which operates with Cognitive Radio (CR) Mobile Ad Hoc Networks. In the near future, with the rapid development of hardware and chipset functionality, devices with CR capability will offer promising opportunities within future mobile networks. The new routing protocol exploits the transfer of CR performance data from the Physical/MAC layers up to Network layer as contributing factors within the route selection algorithms, which is the first time that available channel condition is considered within the Network layer. The performance of the proposed protocol is investigated via simulations and the results confirm its favorable operation within ad hoc network environments.","PeriodicalId":301015,"journal":{"name":"International Symposium on Wireless and pervasive Computing (ISWPC)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133970178","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}
Murilo K. do Amaral, M. Pellenz, M. Penna, R. Souza, Henry Medeiros
{"title":"Performance evaluation of gossip algorithms in WSNs using outage probability","authors":"Murilo K. do Amaral, M. Pellenz, M. Penna, R. Souza, Henry Medeiros","doi":"10.1109/ISWPC.2013.6707434","DOIUrl":"https://doi.org/10.1109/ISWPC.2013.6707434","url":null,"abstract":"This paper studies the performance of asynchronous consensus algorithms in wireless sensors networks (WSNs). The application of such distributed consensus algorithms for the estimation of parameters or detection of events in WSNs has attracted increased attention recently. In this work the reliability of the wireless links between nodes is modeled by the outage probability. The outage probability formulation embeds the effect of small and large scale channel fading and allows a more precise performance evaluation of consensus algorithms for wireless applications. We investigate the performance of the following algorithms: pairwise, neighborhood, geographic and broadcasting. Simulation results show which algorithm minimizes the number of exchanged messages and/or obtains a faster convergence for different scenarios. The best strategy depends both on the wireless channel characteristics and the network topology.","PeriodicalId":301015,"journal":{"name":"International Symposium on Wireless and pervasive Computing (ISWPC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132130499","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}
S. Huang, C. Shieh, Syue-Ru Lyu, Tzu-Chi Huang, Chien-Sheng Chen, Ping-Fan Ho, Ming-Fong Tsai
{"title":"A simple cluster-scaling policy for MapReduce clouds","authors":"S. Huang, C. Shieh, Syue-Ru Lyu, Tzu-Chi Huang, Chien-Sheng Chen, Ping-Fan Ho, Ming-Fong Tsai","doi":"10.1109/ISWPC.2013.6707441","DOIUrl":"https://doi.org/10.1109/ISWPC.2013.6707441","url":null,"abstract":"Due to the rise of cloud computing, many cloud services have been developed. Google proposed a programming model called MapReduce for processing large amounts of data. After YAHOO! proposed Hadoop, many companies and enterprises have started using this programming model to establish their own cluster for handling large amounts of data. Computing resources within a cluster are often not all be used. Therefore, many researches about cluster-scaling are presented. These studies were proposed to reduce the size of the cluster to achieve power saving or to add more computing nodes in order to obtain better performance. However, there is always a trade-off between performance and power saving. Therefore, taking both performance and energy saving into account, we propose a simple policy which can effectively identify how many computing nodes can be inactivated from a cluster without affecting the execution time. We evaluate our policy in many cases to prove that it is well-performed in different configurations and achieves performance and power saving both.","PeriodicalId":301015,"journal":{"name":"International Symposium on Wireless and pervasive Computing (ISWPC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124908848","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}