{"title":"A New Adaptive Prediction-Based Tracking Scheme for Wireless Sensor Networks","authors":"H. J. Rad, B. Abolhassani, Mohammad Abdizadeh","doi":"10.1109/CNSR.2009.59","DOIUrl":"https://doi.org/10.1109/CNSR.2009.59","url":null,"abstract":"The accuracy of the object tracking is dependent on the tracking time interval. Smaller tracking time interval increases the accuracy of tracking a moving object. However, this increases the power consumption significantly. This paper proposes a new adaptive algorithm (AEC) to adapt tracking time interval such that it minimizes power consumption while keeping the required accuracy. Simulation results show that using the proposed algorithm, the tracking network has a good performance with the added advantage of reducing the power consumption significantly when compared with existing non-adaptive methods (like PATES). Moreover, simulation results show that the performance of the proposed algorithm is better than one of existing adaptive methods (PaM) with respect to power consumption (up to 12%) and tracking accuracy (up to 5%).","PeriodicalId":103090,"journal":{"name":"2009 Seventh Annual Communication Networks and Services Research Conference","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115467236","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}
Xingyang Chen, Lin Zhang, Yihua Huang, X. Shan, Yong Ren
{"title":"A Novel Scheme of Multi-node Cooperation in Wireless Networks","authors":"Xingyang Chen, Lin Zhang, Yihua Huang, X. Shan, Yong Ren","doi":"10.1109/CNSR.2009.60","DOIUrl":"https://doi.org/10.1109/CNSR.2009.60","url":null,"abstract":"Many previous schemes of multi-node cooperation mimic the behavior of the multiple-antenna system, and the imitation usually causes extra overheads. In this paper, we propose a novel multi-node cooperation scheme to avoid the imitation. The basic idea is to take the wireless broadcast advantage in the whole procedure. As a result, each source could maintain a multihop diversity route to the destination. Both theoretical analysis and simulation results confirm that the proposed scheme achieves full diversity. Furthermore, we compare the proposed scheme with DSTC and the selection cooperation in terms of outage probability through simulation. In the symmetric scenario, we prove that the proposed scheme outperforms the DSTC and has a comparable performance with the selection cooperation but without the overhead in choosing the best relay. While in the asymmetric scenario, the proposed scheme behaves better than the selection cooperation with the knowledge of the topology, through minimizing the performance gaps between different sources.","PeriodicalId":103090,"journal":{"name":"2009 Seventh Annual Communication Networks and Services Research Conference","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129772010","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":"Impact of Duplicates in Energy Consumption of Wireless Sensor Networks Using the GSP Protocol","authors":"Maria Calle, J. Kabara","doi":"10.1109/CNSR.2009.80","DOIUrl":"https://doi.org/10.1109/CNSR.2009.80","url":null,"abstract":"Wireless sensor networks which employ a routing protocol from the Flooding family are often assumed to waste a great amount of energy generating duplicate packets [1].Simulations were conducted showing that the assumption is not true for one member of the flooding family, the Gossip-based Sleep Protocol (GSP) [2]. Simulation results show that the performance of GSP in 100-node square grid networks eliminates the risk of packet explosion while retaining the benefits of a flooding protocol. The paper also presents a novel energy consumption analysis, revealing that the majority of energy is used for idle listen, when there are no packet transmissions.","PeriodicalId":103090,"journal":{"name":"2009 Seventh Annual Communication Networks and Services Research Conference","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128425555","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 High Capacity CI/MC-CDMA System for Reduction in PAPR","authors":"S. Maity, M. Mukherjee","doi":"10.1109/CNSR.2009.53","DOIUrl":"https://doi.org/10.1109/CNSR.2009.53","url":null,"abstract":"This paper proposes a high capacity Carrier Interferometry/Multicarrier Code Division Multiple Access (CI/MCCDMA)system to reduce PAPR (peak-to-average power)through the simultaneous support of high and low data rate transmission. The implementation is done by allocating all sub-carriers to the users who transmit high data rate and alternate odd and even subcarriers are assigned to the other set of users who wish to transmit low data rate. The usage of alternate sub-carriers suggests to split CI codes in odd and even parts leading to an increase in capacity. Reduction in PAPR values is achieved through the phase shift of even CI code using odd sub-carriers by an amount of π/2 and odd CI code using even sub-carriers by -π/2, all measured with respect to the orthogonal codes supporting high data rate transmission. Finally, CI code optimization is done for further reduction in PAPR values. The proposed method also improves BER performance compared to the conventiona lCI/MC-CDMA system. Simulation results duly support this claim.","PeriodicalId":103090,"journal":{"name":"2009 Seventh Annual Communication Networks and Services Research Conference","volume":"01 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126801556","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 Novel Isotropic Scatter Distribution Wideband MIMO M2M Fading Channel Model","authors":"Chen Wei, He Zhiyi, Xie Tao, Zhou Wei","doi":"10.1109/CNSR.2009.79","DOIUrl":"https://doi.org/10.1109/CNSR.2009.79","url":null,"abstract":"In this paper, a novel isotropic scatter distribution wideband fading channel model for MIMO mobile-to-mobile (M2M) is proposed. The starting point for the derivation of the model is a new T-intersection geometric street scattering model, where both single-, double-bounced scattering mechanisms are assumed. Our geometry-based channel model takes into account the exact relationship between angle of arrival (AoA) and angle of departure (AoD). Based on this relationship, the reference model, the stochastic and the deterministic simulation model are derived, and the properties of temporal auto-correlation and space-time-frequency cross-correlation are studied. Finally, simulation result shows excellent correspondence between PSD of channel simulator and measured data. We believe that this research work laid a foundation for further study of MIMO M2M communication system.","PeriodicalId":103090,"journal":{"name":"2009 Seventh Annual Communication Networks and Services Research Conference","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114092358","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":"Localized Probabilistic Routing for Data Gathering in Wireless Ad Hoc Networks","authors":"E. Sung, M. Potkonjak","doi":"10.1109/CNSR.2009.62","DOIUrl":"https://doi.org/10.1109/CNSR.2009.62","url":null,"abstract":"Longevity is a critical requirement for wireless sensor networks to application domains like environmental monitoring. Deterministic communication protocols that assume that packet loss implies congestion suffer due to the non-negligible probability of a wireless link being lossy even at very short distances. In this paper, we propose a localized probabilistic routing scheme aimed at extending network lifetime while coping with lossy links. The proposed protocol is informed by our study of the centralized algorithm that optimally computes paths. We obtain the most relevant properties from the centralized optimal routing algorithm and present their statistical models. The proposed routing scheme, based on the statistical models, is a promising step towards an optimal solution.","PeriodicalId":103090,"journal":{"name":"2009 Seventh Annual Communication Networks and Services Research Conference","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130077753","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":"WiMAX Network Optimization - Analyzing Effects of Adaptive Modulation and Coding Schemes Used in Conjunction with ARQ and HARQ","authors":"Abdul Qadir Ansari, A. Rajput, M. Hashmani","doi":"10.1109/CNSR.2009.12","DOIUrl":"https://doi.org/10.1109/CNSR.2009.12","url":null,"abstract":"The flexibility of WiMAX framework offers new dimensions for cross-layer optimization and can be exploited to optimize the application performance. This article focuses on identifiers that have direct impact on Quality of Service (QoS)and effect of such identifiers is evaluated through computer simulation using OPNET Modeler 14.5 Wireless Suite. In this paper we have used advanced WiMAX features such as Adaptive Modulation and Coding (AMC), Automatic Repeat Request(ARQ) and Hybrid-ARQ to tune the WiMAX network MAC Layer such that its adaptation improves both capacity and delay (thus optimize the performance). ARQ is treated as higher layer to HARQ. HARQ gives up after maximum retransmissions. HARQ performs fast retransmissions and ARQ takes over in cases HARQ fails after multiple retransmissions. This gives an added layer of protection to data. HARQ is proved to be most suitable (when used with aggressive modulation and coding) for WiMAX due to its hybrid nature as it takes into account both the MAC and link layer. Using ARQ in conjunction with HARQ gives slight improvement in BLER (Block Error Rate) but at the expense of high UL frame utilization.","PeriodicalId":103090,"journal":{"name":"2009 Seventh Annual Communication Networks and Services Research Conference","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127159683","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":"E-health Services with Secure Mobile Agent","authors":"R. Sulaiman, Xu Huang, D. Sharma","doi":"10.1109/CNSR.2009.49","DOIUrl":"https://doi.org/10.1109/CNSR.2009.49","url":null,"abstract":"This paper established a new security mechanism for online communications using mobile agents. E-health has been widely used as a communication system and information changes to deliver health services to the users through the Internet. However, the Internet imposes threats that will risk the information in transit. Therefore it is important to ensure that the communication is safe and the user’s privacy is protected. This paper extends our previous research results, Multilayer Communication (MLC) approach [1], and introduced mobile agents to MLC in e-health. The cryptographic protocols such as encryption/decryption, digital signature, and hash code are used as protection mechanisms. We focus on how Sender can securely transfer sensitive information to Recipient while still maintaining control over it. Sender keeps the key for decryption at his/her side until the agent needs it. A token is carried by the agent, which is used as a mean to call home platform to obtain the key for decryption processes. The significant of this new mechanism is that it gives Sender control over the transmitted data. Recipient can also avoid burden with the encryption details as long as he/she knows that the message is indeed comes from Recipient.","PeriodicalId":103090,"journal":{"name":"2009 Seventh Annual Communication Networks and Services Research Conference","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123278344","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":"Angle-of-Departure-Aided Opportunistic Space-Division Multiple Access","authors":"G. Dahman, R. Hafez","doi":"10.1109/CNSR.2009.31","DOIUrl":"https://doi.org/10.1109/CNSR.2009.31","url":null,"abstract":"In this paper, a novel transmission technique for the multiple-input multiple-output (MIMO) broadcasting directional channels is introduced. During the training period, the base station sends a set of mutually orthogonal signals which enables each user to estimate the angle-of-departure of the anticipated strongest beam and the corresponding SNR. Then, the base station uses the reported angles-of-departure and SNRs to select a subgroup of users for data transmission in such a way that the sum capacity is maximized. Compared to the opportunistic space-division multiple access with beam selection algorithm [12], the advantage of the proposed algorithm is that it provides throughput gains up to 95% with low to medium number of users, under the same number of feedback bits. In addition to our new proposed algorithm, we introduce a modified version of the opportunistic space-division multiple access with beam selection algorithm, which shows a significant throughput improvement when evaluated using directional channel models such as WINNER.","PeriodicalId":103090,"journal":{"name":"2009 Seventh Annual Communication Networks and Services Research Conference","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116605059","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 Data Dissemination Algorithm Based on Geographical Quorum System in Wireless Sensor Networks","authors":"Zijin Tao, Su Li, Zexin Lu, Xiaozhe Zhang","doi":"10.1109/CNSR.2009.90","DOIUrl":"https://doi.org/10.1109/CNSR.2009.90","url":null,"abstract":"A quorum system is formed by organizing nodes into subsets called quorums, where every two quorums intersect and no quorum includes another quorum. The quorum system reduces the access cost per operation, to balance the load, and to improve the system scalability. All of these properties make quorum systems particularly attractive for large-scale sensor applications involving data gathering and diffusion tasks. The task of data dissemination with a quorum system is the same as doing a match-making between quorums. But those pseudo quorum systems designed for wired networks fail to address the challenges introduced by sensor networks. In this paper, a novel data dissemination scheme (MM-GSQ) built on top of a new quorum system in wireless sensor network is proposed. The MM-GSQ uses a new quorum system named Spatial Neighbor Proxy Quorum (SNPQ) which is evolved from the pseudo quorum but much smaller. The SNPQ utilizes the geometric properties of the planar graph, e.g., GG or RNG graph, and reduces the quorum access cost greatly as opposed to the traditional pseudo quorum. The MM-GSQ improves energy consumption by reducing message transmissions and collisions, increases the match-making success rate and is easy to be implemented. Theoretical analyses and experimental results indicate that the new quorum system (SNPQ) with related data dissemination algorithm (MM-GSQ) has higher scalability, energy efficiency and match-making success rate than those of the original means. It is especially suitable for data dissemination in large-scale wireless sensor networks (WSNs).","PeriodicalId":103090,"journal":{"name":"2009 Seventh Annual Communication Networks and Services Research Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131565313","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}