{"title":"Evaluation of On/Off scheduling protocols for ad hoc and sensor networks","authors":"N. Ababneh","doi":"10.1109/WCINS.2010.5544122","DOIUrl":"https://doi.org/10.1109/WCINS.2010.5544122","url":null,"abstract":"In recent years, many topology control protocols have been developed for ad hoc and sensor networks environment. This paper presents the results of a detailed performance evaluation on three of these protocols: Optimized Topology Control protocol (OTC), Energy-efficient coordination protocol (Span) and Geographical Adaptive Fidelity protocol (GAF). Our main goal for the performance investigation is to study the load distribution and network lifetime of the evaluated protocols. Our performance investigation produced the following conclusions. First, adding location information to GAF increases both the network load and data packet delivery ratio; our results conclude that the increase in performance is worth the increase in cost. Lastly,","PeriodicalId":156036,"journal":{"name":"2010 IEEE International Conference on Wireless Communications, Networking and Information Security","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125543504","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":"Efficient and provably secure certificateless signcryption from bilinear maps","authors":"W. Xie, Zhang Zhang","doi":"10.1109/WCINS.2010.5541841","DOIUrl":"https://doi.org/10.1109/WCINS.2010.5541841","url":null,"abstract":"In 2008, Barbosa and Farshim introduced the notion of certificateless signcryption (CLSC) and proposed the first CLSC scheme [2], but which requires six pairing operations in the signcrypt and unsigncrypt phases. In this paper, aimed at designing an efficient CLSC scheme, we propose a new efficient CLSC scheme from bilinear maps, which requires only two pairing operations in the signcrypt and unsigncrypt phases and is more efficient than all the schemes available.","PeriodicalId":156036,"journal":{"name":"2010 IEEE International Conference on Wireless Communications, Networking and Information Security","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126946541","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 information reproduction method for HTTP in WLAN","authors":"Ming Wan, Nan Yao, Y. Liu, Hongke Zhang","doi":"10.1109/WCINS.2010.5541801","DOIUrl":"https://doi.org/10.1109/WCINS.2010.5541801","url":null,"abstract":"This paper presents a fast information reproduction method for the HTTP protocol in public wireless local area network (WLAN). Through the collection and analysis of the HTTP packets in WLAN, this method reclassifies and organizes the multiple conversations by means of the conversation reunion algorithm, and proposes a way which is a single conversation corresponding to multiple connections. After merging the HTTP information of the different connections in each conversation, this method uses the multi-threaded parallel processing technology to replay and reproduce the HTTP information fast. In conclusion, this paper gives the analysis of the implementation efficiency and the successful percentage of the HTTP information reproduction about the method.","PeriodicalId":156036,"journal":{"name":"2010 IEEE International Conference on Wireless Communications, Networking and Information Security","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116118362","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":"Self-adaptive algorithm for image transmission based on narrow and variable bandwidth","authors":"Gao-ping Liu, Zi-han Zheng","doi":"10.1109/WCINS.2010.5541773","DOIUrl":"https://doi.org/10.1109/WCINS.2010.5541773","url":null,"abstract":"With the development of networks, network bandwidth is increasing endlessly, but it appears narrow relative to the growing demand, and because of the environmental impact, the size of bandwidth is always changing. This paper presents a narrow bandwidth variable adaptive image transmission algorithm with an example of CDMA Network. Aiming at the environment variable and bandwidth allocation characters of CDMA Network, the transmitter terminal determines the network status through the TCP data packets feedback from the receiver, and adjusts UDP packets transmission time and packet size with the data frame length feature of CDMA network, thus adapts for the CDMA network bandwidth changes. Finally, the paper gives the test results of the algorithm. Test results show that the algorithm can quickly follow the changes of network bandwidth, and make full use of reliable bandwidth of CDMA network.","PeriodicalId":156036,"journal":{"name":"2010 IEEE International Conference on Wireless Communications, Networking and Information Security","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116162246","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 kind of transport layer attack in wireless Ad Hoc Networks","authors":"K. Vishnu","doi":"10.1109/WCINS.2010.5541733","DOIUrl":"https://doi.org/10.1109/WCINS.2010.5541733","url":null,"abstract":"Mobile Ad Hoc Networks are vulnerable to various types of Denial of Service (DoS) attacks for the absence of fixed network infrastructure. The dynamic nature of MANETs makes it susceptible to having their effective operation compromised by a variety of security attacks.. In this paper we present an alternate way to improve on the current Gray Hole/Worm Hole attack scenario and other Man in the Middle attacks to avoid detection and yet effectively drop the data packets.","PeriodicalId":156036,"journal":{"name":"2010 IEEE International Conference on Wireless Communications, Networking and Information Security","volume":"766 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116412023","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":"Network joint coding-aware routing for wireless ad hoc networks","authors":"Zhiheng Zhou, Liang Zhou","doi":"10.1109/WCINS.2010.5541877","DOIUrl":"https://doi.org/10.1109/WCINS.2010.5541877","url":null,"abstract":"It is proven that network coding can greatly improve network throughput in wireless networks (e.g. COPE [2]). Recently, there is a growing interest of applying routing protocols to network coding for wireless ad hoc networks aiming at exploiting the throughput and other performance. However, in all the proposed network coding schemes, the decoding procedure should be completed in one-node only, no matter how many hops the XORed packets traversed. Upon that, we introduce a novel network coding-aware routing mechanism called Network Joint Coding-Aware Routing (NJCAR), which aims to overcome this restriction. Our design has capability to explore the entire potential routes between a given source and destination to effectively seeks for the multiple hops decoding opportunities, while present wireless network routing protocols fail to do so. Simulation results in ns-2 show that NJCAR outperforms COPE in some scenarios.","PeriodicalId":156036,"journal":{"name":"2010 IEEE International Conference on Wireless Communications, Networking and Information Security","volume":"255 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122652145","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":"An improvement of energy efficient multi-hop time synchronization algorithm in wireless sensor network","authors":"Zhehan Ding, N. Yamauchi","doi":"10.1109/WCINS.2010.5541751","DOIUrl":"https://doi.org/10.1109/WCINS.2010.5541751","url":null,"abstract":"Time synchronization is a crucial component for wireless sensor network (WSN), because large populations of sensor nodes will collaborate in order to complete the data gathering, data fusion and localization. In a wireless sensor network with large scale of energy limited nodes, multi-hop time synchronization is necessarily applied. Some protocols such as RBS and TSPN can be used based on a spanning tree network for multi-hop. However most of the methods mainly focus on the precision of synchronization. In fact energy efficiency is also a challenge in a resource-limited WSN. In this paper an improved scheme of multi-hop time synchronization is proposed with the purpose of reducing energy consumption and lengthening sensor nodes' life. Performance analyses and simulations are also presented. First the proposed method has a better synchronization error performance. Second this proposed scheme consumes less energy than RBS and can decrease overhead.","PeriodicalId":156036,"journal":{"name":"2010 IEEE International Conference on Wireless Communications, Networking and Information Security","volume":"282 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114489686","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":"Steiner trees grid routing protocol in wireless sensor networks","authors":"Chiu-Kuo Liang, Chih-Hsuan Lee, J. Lin","doi":"10.1109/WCINS.2010.5544132","DOIUrl":"https://doi.org/10.1109/WCINS.2010.5544132","url":null,"abstract":"In a wireless sensor network, it is an important task to periodically collect data from an area of interest for time-sensitive applications. The sensed data must be gathered and transmitted to a base station for further processing to meet the end-user queries. Since the network consists of low-cost nodes with limited battery power, it is a challenging task to design an efficient routing scheme that can collect massive data and offer good performance in energy efficiency, and long network lifetimes. Grid structure was proposed for energy efficient data routing. Instead of propagating query messages from sink to all sensors to set up data forwarding information, the grid structure uses only sensors located at the grid points needed to acquire the forwarding information. In this paper, we propose an energy-efficient routing technique, called Steiner Trees Grid Routing (STGR) protocol, to improve the performance of previous grid routing protocols. Simulation results show that STGR achieves a better solution in data delivery and therefore ensures more energy efficient of data transmission in wireless sensor networks.","PeriodicalId":156036,"journal":{"name":"2010 IEEE International Conference on Wireless Communications, Networking and Information Security","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129772667","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":"An scheme improved on iterative detection algorithm for V-BLAST","authors":"Wenbai Chen, Xiaoqin Zhang, Wei Li","doi":"10.1109/WCINS.2010.5541743","DOIUrl":"https://doi.org/10.1109/WCINS.2010.5541743","url":null,"abstract":"Traditional detection algorithm for V-BLAST is based on Order Successive Interference Cancellation (OSIC). Using iterative algorithm, the low-diversity substreams are decoded by decisions form of high-diversity substreams, the performance is highly improved at a cost of too much iterative repetition. To decrease computational complexity, an improved scheme for iterative detection method was proposed in this paper. Improving the performance of the first substream greatly and reducing iterative repetition, the improved scheme achieves the balance of performance and computation complexity. Simulation results show that the improve scheme obtains nearly the same performance with that of normal iterative OSIC algorithm, but the computational complexity is low comparatively.","PeriodicalId":156036,"journal":{"name":"2010 IEEE International Conference on Wireless Communications, Networking and Information Security","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128574673","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":"Exploitation of known short and long symbols for carrier frequency offset estimation in OFDM wireless LAN systems","authors":"Qi Cheng","doi":"10.1109/WCINS.2010.5541909","DOIUrl":"https://doi.org/10.1109/WCINS.2010.5541909","url":null,"abstract":"In this paper, a new data model is developed based on known long and short symbols in OFDM WLAN systems. A maximum-likelihood method using this new model is developed. Its performance was investigated with comparison to some existing methods. The new method is shown to be able to provide improved performance.","PeriodicalId":156036,"journal":{"name":"2010 IEEE International Conference on Wireless Communications, Networking and Information Security","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123730626","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}