{"title":"Network Security Scheme for Wireless Sensor Networks using Efficient CSMA MAC Layer Protocol","authors":"P. Shukla, S. Silakari, Sarita Singh Bhadoriya","doi":"10.1109/ITNG.2009.231","DOIUrl":"https://doi.org/10.1109/ITNG.2009.231","url":null,"abstract":"Modern wireless communication system based on wireless sensor network is strictly depends on medium access mechanism to improve its performance. CSMA is modifying here in its CSMA/CA format and trying to enhancing its performance same as CSMA/CD has for wired network. The aim of the paper is to inform how optimization of CSMA based sensor network is possible and how we can deploy it for monitoring of different areas like deployment of bomb plantation by terrorists etc. Security requirement like confidentiality, integrity and authentication can be achieved by CBC-X that facilitates encryption/decryption and authentication of packets on a one pass operation for link layer security.","PeriodicalId":347761,"journal":{"name":"2009 Sixth International Conference on Information Technology: New Generations","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127964432","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 Modified Linear Scan Register Allocation Algorithm","authors":"S. Subha","doi":"10.1109/ITNG.2009.90","DOIUrl":"https://doi.org/10.1109/ITNG.2009.90","url":null,"abstract":"This paper proposes a global register allocation algorithm that makes decisions on register allocation based on the cost of spilling variables in linear scan allocation. The algorithm assumes registers are initially allocated based on linear scan algorithm. When there is a need to spill variables, either the allocated or the new variable is spilled based on the cost incurred in allocation. The cost is calculated as a function of number of definitions and uses of a variable for the rest of its live range. A mathematical model for determining the cost is proposed which decides register allocation. Given the live ranges of the variables the time complexity of the algorithm is derived. Simulations on an arbitrary program showed an improvement when compared to linear scan algorithm.","PeriodicalId":347761,"journal":{"name":"2009 Sixth International Conference on Information Technology: New Generations","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133880378","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":"Multi-slot Channel Allocation for Priority Packet Transmission in the GPRS Network","authors":"Jun Zheng, Mengyu Qiao, E. Regentova","doi":"10.1109/ITNG.2009.170","DOIUrl":"https://doi.org/10.1109/ITNG.2009.170","url":null,"abstract":"In the General Packet Radio Service (GPRS) network, data packets from services like mobility management and “push-to-talk” (PTT) are sensitive to delay. During the channel allocation process, the delay-sensitive packets should have higher priority than other packets. Previously priority queue and Uplink State Flag Channel Allocation (USFCA) have been used to reduce the transmission delay of priority packets. In this paper, we study the performance of channel allocation for priority packet in the GPRS network with multi-slot capability. The results show that the transmission delay of priority packet can be further reduced by assigning multiple channels to priority packet in addition to the use of priority queue and USFCA.","PeriodicalId":347761,"journal":{"name":"2009 Sixth International Conference on Information Technology: New Generations","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131702273","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 Further Improvement on a Genetic Algorithm","authors":"Ian Stewart, Wenying Feng, S. Akl","doi":"10.1109/ITNG.2009.240","DOIUrl":"https://doi.org/10.1109/ITNG.2009.240","url":null,"abstract":"In this paper, a new genetic algorithm is developed based on a pre-existing implementation. The new algorithm requires less human interaction through the use of dynamically selected weight and acceptance probability parameters. The algorithm is implemented and tested using six benchmark functions. Results show that the new algorithm significantly outperforms other genetic algorithms in less time and with less human interaction.","PeriodicalId":347761,"journal":{"name":"2009 Sixth International Conference on Information Technology: New Generations","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125227245","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 Online Multipath Routing Algorithm for Maximizing Lifetime in Wireless Sensor Networks","authors":"M. Minhas, S. Gopalakrishnan, Victor C. M. Leung","doi":"10.1109/ITNG.2009.255","DOIUrl":"https://doi.org/10.1109/ITNG.2009.255","url":null,"abstract":"We address the maximum lifetime routing problem in wireless sensor networks, and present an online multipath routing algorithm. The proposed algorithm strives to maximize the network lifetime metric by distributing the source-to-sink traffic for a given routing request along a set of paths. Fuzzy membership function is used for designing the edge weight function. Simulation results obtained under a variety of network scenarios show that the proposed multipath scheme is able to achieve better lifetime results than those obtained by its predecessor single-path fuzzy routing scheme as well as by another well-known online routing scheme, namely the Online Maximum Lifetime heuristic.","PeriodicalId":347761,"journal":{"name":"2009 Sixth International Conference on Information Technology: New Generations","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125237618","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}
T. B. Viana, Hugo Imperiano Nobrega, Thiago Vinicius Freire de Araujo Ribeiro, Glêdson Elias da Silveira
{"title":"A Search Service for Software Components Based on a Semi-Structured Data Representation Model","authors":"T. B. Viana, Hugo Imperiano Nobrega, Thiago Vinicius Freire de Araujo Ribeiro, Glêdson Elias da Silveira","doi":"10.1109/ITNG.2009.138","DOIUrl":"https://doi.org/10.1109/ITNG.2009.138","url":null,"abstract":"In order to make reuse practices effective, developers must find required components easily. In such a direction, representation models based on semi-structured data have been adopted to facilitate the discovery of required components. Following such a trend, this paper presents the architecture, functionalities and implementation of a search service that adopts techniques for indexing semistructured data, making possible the discovery of software assets through regular path expression queries.","PeriodicalId":347761,"journal":{"name":"2009 Sixth International Conference on Information Technology: New Generations","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133434506","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":"Bus-Based and NoC Infrastructure Performance Emulation and Comparison","authors":"Ling Wang, Jianye Hao, Feixuan Wang","doi":"10.1109/ITNG.2009.186","DOIUrl":"https://doi.org/10.1109/ITNG.2009.186","url":null,"abstract":"In this paper, we study and compare the performance of bus-based and Mesh-based with Spidernet NoC-based infrastructure in Altera’s FPGA. We first analysis the inner latency performance of the NoC infrastructure among routers, and we provide two modes to emulate the specific application on those infrastructures for the purpose of performance comparison. It is shown that NoC-based infrastructure performs better than bus-based one in terms of latency when the number of flits contained in the packets exceeds certain threshold. In addition, Spidernet-based infrastructure outperforms Mesh-based one under the same condition, which verifies the correctness of the theoretical performance analysis.","PeriodicalId":347761,"journal":{"name":"2009 Sixth International Conference on Information Technology: New Generations","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133673257","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 Analysis of Business Models of Web 2.0 Application","authors":"Shari S. C. Shang, Ya-Ling Wu, O. Hou","doi":"10.1109/ITNG.2009.227","DOIUrl":"https://doi.org/10.1109/ITNG.2009.227","url":null,"abstract":"Web 2.0 is the network on which individuals contribute to the development and distribution of tools, contents, and software applications over the Internet. This concept enables a huge increase in the complexity of e-commerce development. For example, various innovative business models have emerged from the largely spread-out technological concept, providing different values to customers as well as service providers. The objectives of the study are to explore and exploit Web 2.0 services in knowledge management for businesses. We adopt a KM perspective to explore the Web 2.0 challenges that service providers face in harnessing knowledge. More than one thousand sites of Web 2.0 applications were analyzed and classified and five types of business models were identified: exchanger, organizer, aggregator, collaborator, and liberator. These different types of Web 2.0 applications reveal the diversity of existing Web 2.0 applications as well as the risks and benefits associated with knowledge management of Web 2.0, and they provide a better understanding of the operating patterns and value propositions of the technology.","PeriodicalId":347761,"journal":{"name":"2009 Sixth International Conference on Information Technology: New Generations","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127811218","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":"Mitagation against MAI in a Space Time Spreading Software Defined Radio Test Bed","authors":"Shinhan Wee, M. Ros, P. Vial","doi":"10.1109/ITNG.2009.117","DOIUrl":"https://doi.org/10.1109/ITNG.2009.117","url":null,"abstract":"A Software Defined Radio test bed using the Gnu Radio project was installed on Unix boxes and modified so that estimates of the channel state coefficients were taken for a Multiple Input Multiple output (MIMO) system to take advantage of space time transmission at a frequency of 2.4GHz. This system was modified to provide a Space Time Spreading test bed. The test bed was modified so that multiple access interference was experienced by offsetting different users data streams. The Walsh-Hadamard and Wysocki (low correlation) spreading sequences were deployed in the test bed to compare their Bit Error Rate performance. We confirmed that the low cross correlation spreading sequences experienced an improved Bit Error Rate compared to that obtained when using the Walsh-Hadamard Spreading sequence for high signal to noise ratios.","PeriodicalId":347761,"journal":{"name":"2009 Sixth International Conference on Information Technology: New Generations","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133722991","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 Proactive Approach to Preventing Phishing Attacks Using Pshark","authors":"Ripan Shah, Jarrod Trevathan, W. Read, H. Ghodosi","doi":"10.1109/ITNG.2009.302","DOIUrl":"https://doi.org/10.1109/ITNG.2009.302","url":null,"abstract":"Phishing is an online scam used to dupe people out of their personal information for the purpose of defrauding them. This paper presents a conceptual design for removing phishing pages that have been uploaded on a website, potentially without knowledge of the website owner or host server. Initially the system is alerted to the presence of a phishing page upon receiving the Phisher’s solicitation e-mail. Next the system retrieves the location, IP address and contact information of the host server using a tracking program. Finally, the system sends notification to the Administrator about the phishing page on its server. It is then up to the host server Administrator to remove the phishing page from its server, or face the possibility of criminals continuing to use their site. This approach acts as the basis for further development into proactively (or aggressively) attacking Phishers directly, rather than being a reactionary approach that is common to most email filters and anti-virus software.","PeriodicalId":347761,"journal":{"name":"2009 Sixth International Conference on Information Technology: New Generations","volume":"37 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133733576","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}