Ncct Ieee Software Abstract Collection Volume 2 50+ Abst

1,239 views

Published on

final Year Projects, Final Year Projects in Chennai, Software Projects, Embedded Projects, Microcontrollers Projects, DSP Projects, VLSI Projects, Matlab Projects, Java Projects, .NET Projects, IEEE Projects, IEEE 2009 Projects, IEEE 2009 Projects, Software, IEEE 2009 Projects, Embedded, Software IEEE 2009 Projects, Embedded IEEE 2009 Projects, Final Year Project Titles, Final Year Project Reports, Final Year Project Review, Robotics Projects, Mechanical Projects, Electrical Projects, Power Electronics Projects, Power System Projects, Model Projects, Java Projects, J2EE Projects, Engineering Projects, Student Projects, Engineering College Projects, MCA Projects, BE Projects, BTech Projects, ME Projects, MTech Projects, Wireless Networks Projects, Network Security Projects, Networking Projects, final year projects, ieee projects, student projects, college projects, ieee projects in chennai, java projects, software ieee projects, embedded ieee projects, "ieee2009projects", "final year projects", "ieee projects", "Engineering Projects", "Final Year Projects in Chennai", "Final year Projects at Chennai", Java Projects, ASP.NET Projects, VB.NET Projects, C# Projects, Visual C++ Projects, Matlab Projects, NS2 Projects, C Projects, Microcontroller Projects, ATMEL Projects, PIC Projects, ARM Projects, DSP Projects, VLSI Projects, FPGA Projects, CPLD Projects, Power Electronics Projects, Electrical Projects, Robotics Projects, Solor Projects, MEMS Projects, J2EE Projects, J2ME Projects, AJAX Projects, Structs Projects, EJB Projects, Real Time Projects, Live Projects, Student Projects, Engineering Projects, MCA Projects, MBA Projects, College Projects, BE Projects, BTech Projects, ME Projects, MTech Projects, M.Sc Projects, Final Year Java Projects, Final Year ASP.NET Projects, Final Year VB.NET Projects, Final Year C# Projects, Final Year Visual C++ Projects, Final Year Matlab Projects, Final Year NS2 Projects, Final Year C Projects, Final Year Microcontroller Projects, Final Year ATMEL Projects, Final Year PIC Projects, Final Year ARM Projects, Final Year DSP Projects, Final Year VLSI Projects, Final Year FPGA Projects, Final Year CPLD Projects, Final Year Power Electronics Projects, Final Year Electrical Projects, Final Year Robotics Projects, Final Year Solor Projects, Final Year MEMS Projects, Final Year J2EE Projects, Final Year J2ME Projects, Final Year AJAX Projects, Final Year Structs Projects, Final Year EJB Projects, Final Year Real Time Projects, Final Year Live Projects, Final Year Student Projects, Final Year Engineering Projects, Final Year MCA Projects, Final Year MBA Projects, Final Year College Projects, Final Year BE Projects, Final Year BTech Projects, Final Year ME Projects, Final Year MTech Projects, Final Year M.Sc Projects, IEEE Java Projects, ASP.NET Projects, VB.NET Projects, C# Projects, Visual C++ Projects, Matlab Projects, NS2 Projects, C Projects, Microcontroller Projects, ATMEL Projects, PIC Projects, ARM Projects, DSP Projects, VLSI Projects, FPGA Projects, CPLD Projects, Power Electronics Projects, Electrical Projects, Robotics Projects, Solor Projects, MEMS Projects, J2EE Projects, J2ME Projects, AJAX Projects, Structs Projects, EJB Projects, Real Time Projects, Live Projects, Student Projects, Engineering Projects, MCA Projects, MBA Projects, College Projects, BE Projects, BTech Projects, ME Projects, MTech Projects, M.Sc Projects, IEEE 2009 Java Projects, IEEE 2009 ASP.NET Projects, IEEE 2009 VB.NET Projects, IEEE 2009 C# Projects, IEEE 2009 Visual C++ Projects, IEEE 2009 Matlab Projects, IEEE 2009 NS2 Projects, IEEE 2009 C Projects, IEEE 2009 Microcontroller Projects, IEEE 2009 ATMEL Projects, IEEE 2009 PIC Projects, IEEE 2009 ARM Projects, IEEE 2009 DSP Projects, IEEE 2009 VLSI Projects, IEEE 2009 FPGA Projects, IEEE 2009 CPLD Projects, IEEE 2009 Power Electronics Projects, IEEE 2009 Electrical Projects, IEEE 2009 Robotics Projects, IEEE 2009 Solor Projects, IEEE 2009 MEMS Projects, IEEE 2009 J2EE P

Published in: Technology, Business
  • Be the first to comment

  • Be the first to like this

Ncct Ieee Software Abstract Collection Volume 2 50+ Abst

  1. 1. IEEE BASED SOFTWARE PROJECTS LOCATION AIDED ROUTING An efficient location-aided routing protocol for mobile ad hoc networks Nen-Chung Wang Si-Ming Wang Dept. of Comput. Sci. & Inf. Eng., Chaoyang Univ. of Technol., Taichung, Taiwan This paper appears in: Parallel and Distributed Systems, 2005. Proceedings. 11th International Conference on Publication Date: 20-22 July 2005 Volume: 1 On page(s): 335 - 341 Vol. 1 Number of Pages: 2 vol. (xxi+712) ISSN: 1521-9097 Digital Object Identifier: 10.1109/ICPADS.2005.82 Posted online: 2005-11-14 10:13:01.0 Abstract A mobile ad hoc network (MANET) consists of a set of mobile hosts that do not need a base station. Due to the high mobility of nodes, the network topology of MANETs always changes. This makes it more difficult to find the routes that message packets use when they are routed. In this paper, we propose an improved location-aided routing (ILAR) scheme to improve the efficiency of location-aided routing (LAR) scheme by using the global positioning system (GPS). In this scheme, we first decide a baseline, which is the line between the source node and the destination node, for route discovery. The request packet is broadcasted in a request zone based on the baseline to determine the next broadcasting node. The neighboring node with the shortest distance to the baseline is chosen as the next broadcasting node. Thus, we can find a better routing path than LAR scheme to reduce the network overhead. We also propose a partial reconstruction process that maintains a routing path. When a node on a routing path finds that a link is broken, the node starts the process of routing maintenance. Finally, experimental results show that the proposed ILAR scheme outperforms LAR scheme. 28235816, ncctchennai@gmail.com, www.ncct.in
  2. 2. IEEE BASED SOFTWARE PROJECTS A geometric approach to improving active packet loss measurement Source IEEE/ACM Transactions on Networking (TON) archive Volume 16, Issue 2 (April 2008) table of contents Pages 307-320 Year of Publication: 2008 ISSN: 1063-6692 Authors Joel Sommers Department of Computer Science, Colgate University, Hamilton, NY Abstract Measurement and estimation of packet loss characteristics are challenging due to the relatively rare occurrence and typically short duration of packet loss episodes. While active probe tools are commonly used to measure packet loss on end-to-end paths, there has been little analysis of the accuracy of these tools or their impact on the network. The objective of our study is to understand how to measure packet loss episodes accurately with end-to-end probes. We begin by testing the capability of standard Poisson-modulated end-to-end measurements of loss in a controlled laboratory environment using IP routers and commodity end hosts. Our tests show that loss characteristics reported from such Poisson-modulated probe tools can be quite inaccurate over a range of traffic conditions. Motivated by these observations, we introduce a new algorithm for packet loss measurement that is designed to overcome the deficiencies in standard Poisson-based tools. Specifically, our method entails probe experiments that follow a geometric distribution to 1) enable an explicit trade-off between accuracy and impact on the network, and 2) enable more accurate measurements than standard Poisson probing at the same rate. We evaluate the capabilities of our methodology experimentally by developing and implementing a prototype tool, called BADABING. The experiments demonstrate the trade-offs between impact on the network and measurement accuracy. We show that BADABING reports loss characteristics far more accurately than traditional loss measurement tools. 28235816, ncctchennai@gmail.com, www.ncct.in
  3. 3. IEEE BASED SOFTWARE PROJECTS High-effect Location-Aided Routing Scheme for Ad Hoc Environment Shih Yang Lin Lin Yu Wu Chien-Ying Lai Ren-Song Ko Guang-Ming Wu Dept. of Inf. Manage., Nanhua Univ. This paper appears in: Advanced Communication Technology, The 9th International Conference on Publication Date: 12-14 Feb. 2007 Volume: 1 On page(s): 40 - 45 Number of Pages: 40 - 45 Location: Gangwon-Do ISSN: 1738-9445 Digital Object Identifier: 10.1109/ICACT.2007.358256 Posted online: 2007-05-07 11:28:19.0 Abstract ILAR routing protocol was proposed to improve the efficiency of location-aided routing (LAR) protocol. It had less packets and better performance than LAR. However, ILAR still can be improved on hop counts for speed up routing discovery. We found two drawbacks in the ILAR. There are some nodes around the borders of broadcast coverages that could move out easily, it lead to a broken routing path. Another problem in the ILAR protocol was choosing the next forwarding node based on VDIST distance, but it can't choose better nodes that causes the far node's VDIST to be greater than the forwarding node. Therefore we propose a high-effect location-aided routing protocol (HLAR) and it solves the problems above. The simulation results our scheme has better performance than the ILAR scheme. 28235816, ncctchennai@gmail.com, www.ncct.in
  4. 4. IEEE BASED SOFTWARE PROJECTS A Geometric Approach to Improving Active Packet Loss Measurement Sommers, J.; Barford, P.; Duffield, N.; Ron, A. Networking, IEEE/ACM Transactions on Volume 16, Issue 2, April 2008 Page(s):307 - 320 Digital Object Identifier 10.1109/TNET.2007.900412 Summary: Measurement and estimation of packet loss characteristics are challenging due to the relatively rare occurrence and typically short duration of packet loss episodes. While active probe tools are commonly used to measure packet loss on end-to-end paths, there has been little analysis of the accuracy of these tools or their impact on the network. The objective of our study is to understand how to measure packet loss episodes accurately with end-to-end probes. We begin by testing the capability of standard Poisson-modulated end-to-end measurements of loss in a controlled laboratory environment using IP routers and commodity end hosts. Our tests show that loss characteristics reported from such Poisson-modulated probe tools can be quite inaccurate over a range of traffic conditions. Motivated by these observations, we introduce a new algorithm for packet loss measurement that is designed to overcome the deficiencies in standard Poisson-based tools. Specifically, our method entails probe experiments that follow a geometric distribution to 1) enable an explicit trade-off between accuracy and impact on the network, and 2) enable more accurate measurements than standard Poisson probing at the same rate. We evaluate the capabilities of our methodology experimentally by developing and implementing a prototype tool, called BADABING. The experiments demonstrate the trade-offs between impact on the network and measurement accuracy. We show that BADABING reports loss characteristics far more accurately than traditional loss measurement tools. 28235816, ncctchennai@gmail.com, www.ncct.in
  5. 5. IEEE BASED SOFTWARE PROJECTS Velocity and location aided routing for mobile ad hoc networks Kai-Ten Feng Tse-En Lu Dept. of Commun. Eng., Nat. Chiao Tung Univ., Hsinchu, Taiwan This paper appears in: Vehicular Technology Conference, 2004. VTC2004-Fall. 2004 IEEE 60th Publication Date: 26-29 Sept. 2004 Volume: 4 On page(s): 2789 - 2793 Vol. 4 Number of Pages: 7 vol. (lxxxv+5334) ISSN: 1090-3038 Digital Object Identifier: 10.1109/VETECF.2004.1400566 Posted online: 2005-04-18 09:11:11.0 Abstract Many location-aware routing protocols have been proposed for mobile ad hoc networks in recent years. The efficiency of the routing protocols can be improved by considering the location information of the mobile nodes. However, the mobility characteristics of the mobile node have not been taken into account in most of the related work. In this paper, the proposed velocity aided routing (VAR) protocol determine its packet forwarding scheme based on the relative velocity between the intended forwarding node and the destination node. The routing performance can be further improved by the velocity and location aided routing (VLAR) protocol, which combines the location aided routing (LAR) protocol with the VAR algorithm. Two types of motion predictive models, the Gauss-Markov mobility model and the constant speed mobility model, are incorporated in the design of the VAR and VLAR algorithms. Simulation studies show that the proposed VLAR protocol outperforms other routing algorithms, especially for confined network topologies with higher mobility. 28235816, ncctchennai@gmail.com, www.ncct.in
  6. 6. IEEE BASED SOFTWARE PROJECTS A Fully Distributed Proactively Secure Threshold- Multisignature Scheme van der Merwe, J.; Dawoud, D.S.; McDonald, S. Parallel and Distributed Systems, IEEE Transactions on Volume 18, Issue 4, April 2007 Page(s):562 - 575 Digital Object Identifier 10.1109/TPDS.2007.1005 Summary: Threshold-multisignature schemes combine the properties of threshold group- oriented signature schemes and multisignature schemes to yield a signature scheme that allows a threshold (t) or more group members to collaboratively sign an arbitrary message. In contrast to threshold group signatures, the individual signers do not remain anonymous, but are publicly identifiable from the information contained in the valid threshold-multisignature. The main objective of this paper is to propose such a secure and efficient threshold-multisignature scheme. The paper uniquely defines the fundamental properties of threshold-multisignature schemes and shows that the proposed scheme satisfies these properties and eliminates the latest attacks to which other similar schemes are subject. The efficiency of the proposed scheme is analyzed and shown to be superior to its counterparts. The paper also proposes a discrete logarithm based distributed-key management infrastructure (DKMI), which consists of a round optimal, publicly verifiable, distributed-key generation (DKG) protocol and a one round, publicly verifiable, distributed-key redistribution/ updating (DKRU) protocol. The round optimal DKRU protocol solves a major problem with existing secret redistribution/updating schemes by giving group members a mechanism to identify malicious or faulty share holders in the first round, thus avoiding multiple protocol executions 28235816, ncctchennai@gmail.com, www.ncct.in
  7. 7. IEEE BASED SOFTWARE PROJECTS Hybrid Scheduling of Dynamic Task Graphs with Selective Duplication for Multiprocessors under Memory and Time Constraints Source IEEE Transactions on Parallel and Distributed Systems archive Volume 19, Issue 7 (July 2008) Year of Publication: 2008 ISSN: 1045-9219 ABSTRACT This paper presents a hybrid scheduling methodology for task graphs to multiprocessor embedded systems. The proposed methodology is designed for task graphs which are dynamic in nature due to the presence of conditional tasks as well as tasks whose execution times are unpredictable but bounded. We have presented the methodology as a three phase strategy in which task nodes are mapped to the processors in the first (static mapping) phase. In the second (selective duplication) phase some critical nodes are identified and duplicated for possible rescheduling at run-time depending on the code memory constraints of the processors. The third (online) phase is a run-time scheduling algorithm that performs list scheduling based on actual dynamics of the schedule up to the current time. We show that this technique provides better schedule length (up to 20%) compared to previous techniques which are predominantly static in nature with low overhead and comparable in complexity with existing online techniques. The effects of model parameters like number of processors, memory and various task graph parameters on performance are investigated in this paper. 28235816, ncctchennai@gmail.com, www.ncct.in
  8. 8. IEEE BASED SOFTWARE PROJECTS Location-Aided Multipath Routing Method for Mobile Ad Hoc Wireless Networks Ha Duyen Trung Benjapolakul, W. Dept. of Electr. Eng., Chulalongkorn Univ., Bangkok This paper appears in: Communications and Electronics, 2006. ICCE '06. First International Conference on Publication Date: 10-11 Oct. 2006 On page(s): 7 - 12 Number of Pages: 7 - 12 Location: Hanoi Digital Object Identifier: 10.1109/CCE.2006.350847 Posted online: 2007-04-23 10:14:40.0 Abstract In mobile ad hoc network (MANET), there are a number of routing schemes that have been proposed and several of these have been already extensively simulated or implemented as well. In this paper, we describe extension to routing algorithm based on location information to provide more efficient routing for mobile ad hoc networks. We propose replacing location-aided routing (LAR) with location-aided multipath routing (LAMR). We implemented LAMR through simulation using ns-2 and study its efficiency, and other properties. We use random waypoint mobility and compare LAMR approach versus ad hoc on- demand distant vector (AODV), ad hoc on-demand multipath distant vector (AOMDV) and LAR methods. Our simulation results demonstrate the performance benefits of LAMR over LAR and AODV in most movement scenarios. AOMDV does more frequent flooding of control packets and thus requires higher bandwidth usage than LAMR 28235816, ncctchennai@gmail.com, www.ncct.in
  9. 9. IEEE BASED SOFTWARE PROJECTS Provable Protection against Web Application Vulnerabilities Related to Session Data Dependencies Desmet, L.; Verbaeten, P.; Joosen, W.; Piessens, F. Software Engineering, IEEE Transactions on Volume 34, Issue 1, Jan.-Feb. 2008 Page(s):50 - 64 Digital Object Identifier 10.1109/TSE.2007.70742 Summary: Web applications are widely adopted and their correct functioning is mission critical for many businesses. At the same time, Web applications tend to be error prone and implementation vulnerabilities are readily and commonly exploited by attackers. The design of countermeasures that detect or prevent such vulnerabilities or protect against their exploitation is an important research challenge for the fields of software engineering and security engineering. In this paper, we focus on one specific type of implementation vulnerability, namely, broken dependencies on session data. This vulnerability can lead to a variety of erroneous behavior at runtime and can easily be triggered by a malicious user by applying attack techniques such as forceful browsing. This paper shows how to guarantee the absence of runtime errors due to broken dependencies on session data in Web applications. The proposed solution combines development-time program annotation, static verification, and runtime checking to provably protect against broken data dependencies. We have developed a prototype implementation of our approach, building on the JML annotation language and the existing static verification tool ESC/Java2, and we successfully applied our approach to a representative J2EE- based e-commerce application. We show that the annotation overhead is very small, that the performance of the fully automatic static verification is acceptable, and that the performance overhead of the runtime checking is limited. 28235816, ncctchennai@gmail.com, www.ncct.in
  10. 10. IEEE BASED SOFTWARE PROJECTS Mobile banking Assessment of today's mobile banking applications from the view of customer requirements Pousttchi, K. Schurig, M. Bus. Informatics & Syst. Eng., Augsburg Univ., Germany This paper appears in: System Sciences, 2004. Proceedings of the 37th Annual Hawaii International Conference on Publication Date: 5-8 Jan. 2004 On page(s): 10 pp. Number of Pages: lxxi+320 Digital Object Identifier: 10.1109/HICSS.2004.1265440 Posted online: 2004-02-26 10:51:06.0 Abstract Mobile banking is a subset of electronic banking which underlies not only the determinants of the banking business but also the special conditions of mobile commerce. This paper analyzes customer needs and expectations from the mobile applications' view and from the banking view in order to derive a defined set of requirements. Based on these results, existing mobile banking applications are assessed. Their major shortcomings are explained, opportunities for their improvement are shown and the impact of upcoming new technology is discussed. The outcome of the paper is a defined set of customer requirements to mobile banking applications, the identification and assessment of four standard types of current mobile banking applications and an explanation of major failure reasons along with opportunities for their improvement 28235816, ncctchennai@gmail.com, www.ncct.in
  11. 11. IEEE BASED SOFTWARE PROJECTS Performance of a speculative transmission scheme for scheduling-latency reduction Source IEEE/ACM Transactions on Networking (TON) archive Volume 16, Issue 1 (February 2008) Year of Publication: 2008 ISSN: 1063-6692 ABSTRACT Low latency is a critical requirement in some switching applications, specifically in parallel computer interconnection networks. The minimum latency in switches with centralized scheduling comprises two components, namely, the control-path latency and the data-path latency, which in a practical high-capacity, distributed switch implementation can be far greater than the cell duration. We introduce a speculative transmission scheme to significantly reduce the average control-path latency by allowing cells to proceed without waiting for a grant, under certain conditions. It operates in conjunction with any centralized matching algorithm to achieve a high maximum utilization and incorporates a reliable delivery mechanism to deal with failed speculations. An analytical model is presented to investigate the efficiency of the speculative transmission scheme employed in a non-blocking N × NR input-queued crossbar switch with R receivers per output. Using this model, performance measures such as the mean delay and the rate of successful speculative transmissions are derived. The results demonstrate that the control-path latency can be almost entirely eliminated for loads up to 50%. Our simulations confirm the analytical results 28235816, ncctchennai@gmail.com, www.ncct.in
  12. 12. IEEE BASED SOFTWARE PROJECTS Enabling Java-based VoIP backend platforms through JVM performance tuning Van Den Bossche, B. De Turck, F. Dhoedt, B. Demeester, P. Dept. of Inf. Technol., Ghent Univ., Belgium This paper appears in: VoIP Management and Security, 2006. 1st IEEE Workshop on Publication Date: 3 April 2006 On page(s): 41 - 46 Number of Pages: v+58 Digital Object Identifier: 10.1109/VOIPMS.2006.1638121 Posted online: 2006-06-05 09:18:12.0 Abstract Software backend platforms are increasingly important in voice over IP (VoIP) service offering. Java, currently the most popular language, and the J2EE platform have evolved toward one of the important software frameworks for designing and implementing business logic on a telecom backend platform. Considering the popularity of Java, the question arises whether Java-based backend platforms can meet the requirements imposed by VoIP applications. SIP is an important example of a signaling protocol often used for VoIP. The SIP Servlet technology was developed for building Java based VoIP services. Therefore, we evaluated both the functionality and performance of the SIP Servlet specification and implementations. The evaluation procedure and the obtained results are reported upon. The influence of the Java virtual machine (JVM) tuning has been investigated and will be detailed in this paper. Moreover, performance of techniques based on the obtained results to optimize the garbage collector tuning of the JVM in general, and more specifically for VoIP related applications, will be presented. 28235816, ncctchennai@gmail.com, www.ncct.in
  13. 13. IEEE BASED SOFTWARE PROJECTS Performance evaluation of hardware models of Advanced Encryption Standard (AES) algorithm Yenuguvanilanka, J.; Elkeelany, O. Southeastcon, 2008. IEEE Volume , Issue , 3-6 April 2008 Page(s):222 - 225 Digital Object Identifier 10.1109/SECON.2008.4494289 Summary: In today's world most of the communication is done using electronic media. Data Security plays a vital role in such communication. Hence, there is a need to protect data from malicious attacks. Advanced Encryption Standard (AES), also known as Rijndael, is an encryption standard used for securing information. AES is a block cipher algorithm that has been analyzed extensively and is now used widely. The hardware implementation of AES algorithm is faster and more secure than software implementation. There are different hardware models to implement the Rijndael Encryption core. This paper addresses the performance of Rijndael AES Encryption algorithm of key length 128 bits. Two hardware models based on HDL and IP core are used to evaluate the performance of the algorithm. The encryption time and also the performance metrics such as size, speed and memory utilization are evaluated, using these models. Results are compared to a reference model and have shown an increase in the throughput per slice measure. 28235816, ncctchennai@gmail.com, www.ncct.in
  14. 14. IEEE BASED SOFTWARE PROJECTS Consumer Value Segments in Mobile Bill Paying Laukkanen, T. Kantanen, T. University of Kuopio This paper appears in: Information Technology: New Generations, 2006. ITNG 2006. Third International Conference on Publication Date: 10-12 April 2006 On page(s): 314 - 319 Digital Object Identifier: 10.1109/ITNG.2006.42 Posted online: 2006-04-24 14:03:43.0 Abstract The purpose of the present study was to explore consumer value in mobile banking and in mobile bill paying especially. Today mobile communications technologies offer an opportunity for vast additional value for consumers’ banking actions due to their always-on functionality and the option to bank virtually any time and anywhere. However, consumer value differs between individuals. It was measured in the context with five items namely privacy, accuracy, convenience, control and efficiency. An Internet questionnaire was developed and 82 usable responses from the users of mobile bill paying were collected. K-Means Clustering was used and five different value segments were identified. The results indicate that privacy and efficiency are the most valued items in mobile bill paying in general while individuals differing in their valuations. The study provides academics and bank managers with better understanding to consumer value in mobile banking and offers indications for value-based consumer segmentation. 28235816, ncctchennai@gmail.com, www.ncct.in
  15. 15. IEEE BASED SOFTWARE PROJECTS Optimal State Allocation for Multicast Communications With Explicit Multicast Forwarding De-Nian Yang Wanjiun Liao Nat. Taiwan Univ., Taipei; This paper appears in: Parallel and Distributed Systems, IEEE Transactions on Publication Date: April 2008 Volume: 19, Issue: 4 ISSN: 1045-9219 INSPEC Accession Number: 9903084 Digital Object Identifier: 10.1109/TPDS.2007.70754 Date Published in Issue: 2008-03-03 08:13:41.0 Abstract In this paper, we propose a scalable and adaptive multicast forwarding mechanism based on explicit multicast (Xcast). This mechanism optimizes the allocation of forwarding states in routers and can be used to improve the scalability of traditional IP multicast and source- specific multicast. Compared with previous work, our mechanism needs fewer routers in a multicast tree to store forwarding states and therefore leads to a more balanced distribution of forwarding states among routers. We focus on two problems and formulate each of them as an optimization problem. The first problem, referred to as minstate, minimizes the total number of routers that store forwarding states in a multicast tree. The second problem, referred to as balancestate, minimizes the maximum number of forwarding states stored in a router for all multicast groups, which is proved to be an NP-hard problem. We design a distributed algorithm that obtains the optimal solution to the first problem and propose an approximation algorithm for the second problem. We also prove that the approach adopted by most existing works to allocate forwarding states in the branching routers of a multicast tree is a special case of our mechanism. The simulation results show that the forwarding state allocation provided by previous work is concentrated on the backbone routers in the Internet, which may cause the scalability problem. In contrast, our mechanism can balance forwarding states stored among routers and reduce the number of routers that store the forwarding states for a multicast tree. 28235816, ncctchennai@gmail.com, www.ncct.in
  16. 16. IEEE BASED SOFTWARE PROJECTS Online Index Recommendations for High-Dimensional Databases Using Query Workloads Source IEEE Transactions on Knowledge and Data Engineering archive Volume 20, Issue 2 (February 2008) Year of Publication: 2008 ISSN: 1041-4347 ABSTRACT High-dimensional databases pose a challenge withrespect to efficient access. High-dimensional indexes do notwork because of the oft-cited "curse of dimensionality'. However, users are usually interested in querying data over a relativelysmall subset of the entire attribute set at a time. A potential solution is to use lower dimensional indexes that accurately represent the user access patterns. Query response using physical database design developed based on a static snapshot of the query workload may significantly degrade if the query patterns change. To address these issues, we introduce a parameterizable technique to recommend indexes based on index types frequently used forhigh-dimensional data sets and to dynamically adjust indexesas the underlying query workload changes. We incorporate aquery pattern change detection mechanism to determine when the access patterns have changed enough to warrant change inthe physical database design. By adjusting analysis parameters,we trade off analysis speed against analysis resolution. We perform experiments with a number of data sets, query sets, and parameters to show the effect that varying these characteristics has on analysis results. 28235816, ncctchennai@gmail.com, www.ncct.in
  17. 17. IEEE BASED SOFTWARE PROJECTS On the performance benefits of multihoming route control Source IEEE/ACM Transactions on Networking (TON) archive Volume 16, Issue 1 (February 2008) Year of Publication: 2008 ISSN: 1063-6692 ABSTRACT Multihoming is increasingly being employed by large enterprises and data centers to extract good performance and reliability from their ISP connections. Multihomed end networks today can employ a variety of route control products to optimize their Internet access performance and reliability. However, little is known about the tangible benefits that such products can offer, the mechanisms they employ and their trade-offs. This paper makes two important contributions. First, we present a study of the potential improvements in Internet round-trip times (RTTs) and transfer speeds from employing multihoming route control. Our analysis shows that multihoming to three or more ISPs and cleverly scheduling traffic across the ISPs can improve Internet RTTs and throughputs by up to 25% and 20%, respectively. However, a careful selection of ISPs is important to realize the performance improvements. Second, focusing on large enterprises, we propose and evaluate a wide-range of route control mechanisms and evaluate their design trade-offs. We implement the proposed schemes on a Linux-based Web proxy and perform a trace-based evaluation of their performance. We show that both passive and active measurement-based techniques are equally effective and could improve the Web response times of enterprise networks by up to 25% on average, compared to using a single ISP. We also outline several "best common practices" for the design of route control products. 28235816, ncctchennai@gmail.com, www.ncct.in
  18. 18. IEEE BASED SOFTWARE PROJECTS OCGRR: A New Scheduling Algorithm for Differentiated Services Networks Rahbar, Akbar Ghaffar Pour; Yang, Oliver Parallel and Distributed Systems, IEEE Transactions on Volume 18, Issue 5, May 2007 Page(s):697 - 710 Digital Object Identifier 10.1109/TPDS.2007.351711 Summary: We propose a new fair scheduling technique, called OCGRR (Output Controlled Grant-based Round Robin), for the support of DiffServ traffic in a core router. We define a stream to be the same-class packets from a given immediate upstream router destined to an output port of the core router. At each output port, streams may be isolated in separate buffers before being scheduled in a frame. The sequence of traffic transmission in a frame starts from higher-priority traffic and goes down to lower-priority traffic. A frame may have a number of small rounds for each class. Each stream within a class can transmit a number of packets in the frame based on its available grant, but only one packet per small round, thus reducing the intertransmission time from the same stream and achieving a smaller jitter and startup latency. The grant can be adjusted in a way to prevent the starvation of lower priority classes. We also verify and demonstrate the good performance of our scheduler by simulation and comparison with other algorithms in terms of queuing delay, jitter, and start-up latency. 28235816, ncctchennai@gmail.com, www.ncct.in
  19. 19. IEEE BASED SOFTWARE PROJECTS Mining E-Commerce Data to Analyze the Target Customer Behavior Yuantao Jiang; Siqin Yu Knowledge Discovery and Data Mining, 2008. WKDD 2008. International Workshop on Volume , Issue , 23-24 Jan. 2008 Page(s):406 - 409 Digital Object Identifier 10.1109/WKDD.2008.90 Summary: In the advent of the information era, e-commerce has developed rapidly and has become significant for every business. With the advanced information technologies, firms are now able to collect and store mountains of data describing their myriad offerings and diverse customer profiles, from which they seek to derive information about their customers' needs and wants. Traditional forecasting methods are no longer suitable for these business situations. This research used the principles of data mining to cluster customer segments by using k-means algorithm and data from Web log of various e- commerce Websites. Consequently, the results showed that there was a clear distinction between the segments in terms of customer behavior. 28235816, ncctchennai@gmail.com, www.ncct.in
  20. 20. IEEE BASED SOFTWARE PROJECTS Designing Less-Structured P2P Systems for the Expected High Churn Bustamante, F.E.; Qiao, Y. Networking, IEEE/ACM Transactions on Volume 16, Issue 3, June 2008 Page(s):617 - 627 Digital Object Identifier 10.1109/TNET.2007.903986 Summary: We address the problem of highly transient populations in unstructured and loosely structured peer-to-peer (P2P) systems. We propose a number of illustrative query-related strategies and organizational protocols that, by taking into consideration the expected session times of peers (their lifespans), yield systems with performance characteristics more resilient to the natural instability of their environments. We first demonstrate the benefits of lifespan-based organizational protocols in terms of end-application performance and in the context of dynamic and heterogeneous Internet environments. We do this using a number of currently adopted and proposed query-related strategies, including methods for query distribution, caching, and replication. We then show, through trace-driven simulation and wide-area experimentation, the performance advantages of lifespan-based, query-related strategies when layered over currently employed and lifespan-based organizational protocols. While merely illustrative, the evaluated strategies and protocols clearly demonstrate the advantages of considering peers' session time in designing widely-deployed P2P systems. 28235816, ncctchennai@gmail.com, www.ncct.in
  21. 21. IEEE BASED SOFTWARE PROJECTS Location-Based Spatial Query Processing with Data Sharing in Wireless Broadcast Environments Ku, Wei-Shinn; Zimmermann, Roger; Wang, Haixun Mobile Computing, IEEE Transactions on Volume 7, Issue 6, June 2008 Page(s): 778 - 791 Digital Object Identifier 10.1109/TMC.2007.70791 Summary: Location-based spatial queries (LBSQs) refer to spatial queries whose answers rely on the location of the inquirer. Efficient processing of LBSQs is of critical importance with the ever-increasing deployment and use of mobile technologies. We show that LBSQs have certain unique characteristics that traditional spatial query processing in centralized databases does not address. For example, a significant challenge is presented by wireless broadcasting environments, which have excellent scalability but often exhibit high-latency database access. In this paper, we present a novel query processing technique that, while maintaining high scalability and accuracy, manages to reduce the latency considerably in answering location-based spatial queries. Our approach is based on peer-to-peer sharing, which enables us to process queries without delay at a mobile host by using query results cached in its neighboring mobile peers. We demonstrate the feasibility of our approach through a probabilistic analysis, and we illustrate the appeal of our technique through extensive simulation results 28235816, ncctchennai@gmail.com, www.ncct.in
  22. 22. IEEE BASED SOFTWARE PROJECTS KEEL: A data mining software tool integrating genetic fuzzy systems Alcala-Fdez, J.; Garcia, S.; Berlanga, F.J.; Fernandez, A.; Sanchez, L.; del Jesus, M.J.; Herrera, F. Genetic and Evolving Systems, 2008. GEFS 2008. 3rd International Workshop on Volume, Issue, 4-7 March 2008 Page(s): 83 - 88 Digital Object Identifier 10.1109/GEFS.2008.4484572 Summary: This work introduces the software tool KEEL to assess evolutionary algorithms for data mining problems including regression, classification, clustering, pattern mining and so on. It includes a big collection of genetic fuzzy system algorithms based on different approaches: Pittsburgh, Michigan, IRL and GCCL. It allows us to perform a complete analysis of any genetic fuzzy system in comparison to existing ones, including a statistical test module for comparison. The use of KEEL is illustrated through the analysis of one case study 28235816, ncctchennai@gmail.com, www.ncct.in
  23. 23. IEEE BASED SOFTWARE PROJECTS Intrusion Detection System Based on Data Mining Zhan Jiuhua Knowledge Discovery and Data Mining, 2008. WKDD 2008. International Workshop on Volume, Issue, 23-24 Jan. 2008 Page(s): 402 - 405 Digital Object Identifier 10.1109/WKDD.2008.12 Summary: Analyzed recent IDS models, the development of IDS (Intrusion Detection System), and the current and gives a brief introduction to DM (Data Mining) technology. Presented a framework of IDS based on data mining for resolving the current problems IDS is facing. The system that performs anomaly detection can detect intrusions known and unknown, reduce omissions and misstatements, improve accuracy and speed of intrusion detection and has good adaptive capacity and scalability 28235816, ncctchennai@gmail.com, www.ncct.in
  24. 24. IEEE BASED SOFTWARE PROJECTS Customer on the Move: Strategic Implications of Mobile Banking for Banks and Financial Enterprises Tiwari, R. Buse, S. Herstatt, C. Inst. of Technol. & Innovation Manage., Hamburg Univ. of Technol. This paper appears in: E-Commerce Technology, 2006. The 8th IEEE International Conference on and Enterprise Computing, E-Commerce, and E-Services, The 3rd IEEE International Conference on Publication Date: 2006 On page(s): 81 - 81 Number of Pages: 81 - 81 Location: San Francisco, CA Digital Object Identifier: 10.1109/CEC-EEE.2006.30 Posted online: 2006-07-10 09:49:00.0 Abstract The increased need/wish for mobility amongst various sections of the society, particularly amongst professionally active groups, is confronting credit institutions and other enterprises offering financial services, with challenges to adjust their service portfolio in a way to best suit the needs of their customers. On the other hand it also opens up a new arena of opportunities by making it possible to offer innovative, value-added services by actively inducing demand for new, mobility-centric services. This paper examines strategic implications of changes in customer behavior as perceived by the banks. It introduces the findings of a bank survey conducted by the authors in Germany. The survey discovered that banks expect mobile banking to gain greater strategic relevance in near future and are positioning themselves not to be left behind 28235816, ncctchennai@gmail.com, www.ncct.in
  25. 25. IEEE BASED SOFTWARE PROJECTS Intrusion Detection in Homogeneous and Heterogeneous Wireless Sensor Networks Yun Wang; Xiaodong Wang; Bin Xie; Demin Wang; Agrawal, D.P. Mobile Computing, IEEE Transactions on Volume 7, Issue 6, June 2008 Page(s): 698 - 711 Digital Object Identifier 10.1109/TMC.2008.19 Summary: Intrusion detection in Wireless Sensor Network (WSN) is of practical interest in many applications such as detecting an intruder in a battlefield. The intrusion detection is defined as a mechanism for a WSN to detect the existence of inappropriate, incorrect, or anomalous moving attackers. For this purpose, it is a fundamental issue to characterize the WSN parameters such as node density and sensing range in terms of a desirable detection probability. In this paper, we consider this issue according to two WSN models: homogeneous and heterogeneous WSN. Furthermore, we derive the detection probability by considering two sensing models: single-sensing detection and multiple-sensing detection. In addition, we discuss the network connectivity and broadcast reachability, which are necessary conditions to ensure the corresponding detection probability in a WSN. Our simulation results validate the analytical values for both homogeneous and heterogeneous WSNs 28235816, ncctchennai@gmail.com, www.ncct.in
  26. 26. IEEE BASED SOFTWARE PROJECTS iArgue: A Web-Based Argumentation System Supporting Collaboration Scripts with Adaptable Fading Bouyias, Y.N.; Demetriadis, S.N.; Tsoukalas, I.A. Advanced Learning Technologies, 2008. ICALT apos;08. Eighth IEEE International Conference on Volume , Issue , 1-5 July 2008 Page(s):477 - 479 Digital Object Identifier 10.1109/ICALT.2008.165 Summary: In this work we present the architecture of a Web-based system for argumentation (iArgue) that couples collaboration scripts with argumentation. The system takes into account latest research on collaboration scripts and implements script mechanisms for fading, rotation and repetition. The main goal of building this system is to investigate the fading mechanism and its impact on micro-script internalization and acquisition of argumentation skills. 28235816, ncctchennai@gmail.com, www.ncct.in
  27. 27. IEEE BASED SOFTWARE PROJECTS Secure Display and Secure Transactions Using a Handset Ghotra, Sandeep Singh Mandhan, Baldev Kumar Wei, Sam Shang Chun Song, Yi Steketee, Chris University of South Australia This paper appears in: Management of Mobile Business, 2007. ICMB 2007. International Conference on the Publication Date: 9-11 July 2007 On page(s): 51 - 51 Number of Pages: 51 - 51 Location: Toronto, ON, Canada Digital Object Identifier: 10.1109/ICMB.2007.56 Posted online: 2007-07-30 10:05:49.0 Abstract The security risks of using standard personal computers and operating systems for confidential transactions such as Internet banking are well-known. This is one reason for the interest in the mobile phone/ handset as a Personal Trusted Device (PTD). However, mobile phones have other shortcomings, for example the constraints of working with a small screen. This paper explores the use of a dedicated device ¿ a Secure Display Device (SDD) ¿ which, when used together with a mobile phone, combines the security of the phone as PTD with the characteristics, such as large display size, that can be offered by non-portable hardware. We describe three prototype SDD systems which we built in order to test these ideas. Two of them use a simulated SDD implemented entirely in software on a personal computer: a Mobile Banking system in which the SDD is used for its display capability, and a Payment System in which the SDD is an Automatic Teller Machine. In addition, we describe our work on a prototype hardware-based implementation of the Mobile Banking system that can be plugged into a standard computer monitor or TV. We conclude by analysing the lessons learnt and canvassing further use cases for SDD systems. 28235816, ncctchennai@gmail.com, www.ncct.in
  28. 28. IEEE BASED SOFTWARE PROJECTS Provably Secure Three-Party Authenticated Quantum Key Distribution Protocols DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TDSC.2007.13 January-March 2007 (vol. 4 no. 1) pp. 71-80 This work presents quantum key distribution protocols (QKDPs) to safeguard security in large networks, ushering in new directions in classical cryptography and quantum cryptography. Two three-party QKDPs, one with implicit user authentication and the other with explicit mutual authentication, are proposed to demonstrate the merits of the new combination, which include the following: 1) security against such attacks as man- in-the-middle, eavesdropping and replay, 2) efficiency is improved as the proposed protocols contain the fewest number of communication rounds among existing QKDPs, and 3) two parties can share and use a long-term secret (repeatedly). To prove the security of the proposed schemes, this work also presents a new primitive called the Unbiased-Chosen Basis (UCB) assumption. 28235816, ncctchennai@gmail.com, www.ncct.in
  29. 29. IEEE BASED SOFTWARE PROJECTS Web Usage Mining to Evaluate the Transfer of Learning in a Web-Based Learning Environment Chanchary, F.H. Haque, I. Khalid, S. Independent Univ., Dhaka; This paper appears in: Knowledge Discovery and Data Mining, 2008. WKDD 2008. International Workshop on Publication Date: 23-24 Jan. 2008 On page(s): 249-253 Location: Adelaide, SA, ISBN: 978-0-7695-3090-1 INSPEC Accession Number: 9905005 Digital Object Identifier: 10.1109/WKDD.2008.139 Current Version Published: 2008-03-12 Abstract Application of data mining for web log analysis has received significant attention in finding customers' behavioral pattern in e-commerce and learners' behavioral pattern in e- learning. While hit-counts indicate customers' interest in the product or purchasing behavior, a student's visits to a Learning Management System (LMS) do not necessarily involve transfer of learning. Addressing such complexity in e-learning, this study analyzed students' log of a Learning Management System (LMS) of two subjects at a university in Bangladesh, taught over six weeks duration. Data mining and statistical tools have been used to find relationships between students' LMS access behavior and overall performances. Results show that students having 'Low' access obtained poor grade, on campus access was higher than access from home. Background of students is very important for effective usage of web resources. Majority of the student considered LMS to be a quite helpful tool as teaching- learning method. Preparation and cleaning of the web-log files as well as application of data mining algorithms is important for learners' web usage analysis 28235816, ncctchennai@gmail.com, www.ncct.in
  30. 30. IEEE BASED SOFTWARE PROJECTS Mobile Banking Services Based On J2ME/J2EE Krol, Przemyslaw Nowak, Przemyslaw Sakowicz, Bartosz Department of Microelectronics and Computer Science, Technical University of Lodz, Poland. E-mail: sakowicz@dmcs.pl This paper appears in: CAD Systems in Microelectronics, 2007. CADSM '07. 9th International Conference - The Experience of Designing and Applications of Publication Date: 19-24 Feb. 2007 On page(s): 487 - 490 Number of Pages: 487 - 490 Location: Lviv, Ukraine Digital Object Identifier: 10.1109/CADSM.2007.4297626 Posted online: 2007-09-04 09:28:56.0 Abstract The article introduces alternative ways for providing mobile baking services aimed at J2ME enabled mobile devices. The scope of the discussed solution is the combination of J2EE and J2ME capabilities, means of overcoming the API and technical limitations, as well as security considerations. Additionally, proposals for further development are presented. 28235816, ncctchennai@gmail.com, www.ncct.in
  31. 31. IEEE BASED SOFTWARE PROJECTS Truth discovery with multiple conflicting information providers on the web Source Conference on Knowledge Discovery in Data archive Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining table of contents San Jose, California, USA SESSION: Industrial and government track short papers Year of Publication: 2007 ISBN: 978-1-59593-609-7 ABSTRACT The world-wide web has become the most important information source for most of us. Unfortunately, there is no guarantee for the correctness of information on the web. Moreover, different web sites often provide conflicting information on a subject, such as different specifications for the same product. In this paper we propose a new problem called Veracity, i.e., conformity to truth, which studies how to find true facts from a large amount of conflicting information on many subjects that is provided by various web sites. We design a general framework for the Veracity problem, and invent an algorithm called TruthFinder, which utilizes the relationships between web sites and their information, i.e., a web site is trustworthy if it provides many pieces of true information, and a piece of information is likely to be true if it is provided by many trustworthy web sites. Our experiments show that TruthFinder successfully finds true facts among conflicting information, and identifies trustworthy web sites better than the popular search engines. 28235816, ncctchennai@gmail.com, www.ncct.in
  32. 32. IEEE BASED SOFTWARE PROJECTS Truth discovery with multiple conflicting information providers on the web Source Conference on Knowledge Discovery in Data archive Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining table of contents San Jose, California, USA SESSION: Industrial and government track short papers Year of Publication: 2007 ISBN: 978-1-59593-609-7 ABSTRACT The world-wide web has become the most important information source for most of us. Unfortunately, there is no guarantee for the correctness of information on the web. Moreover, different web sites often provide conflicting information on a subject, such as different specifications for the same product. In this paper we propose a new problem called Veracity, i.e., conformity to truth, which studies how to find true facts from a large amount of conflicting information on many subjects that is provided by various web sites. We design a general framework for the Veracity problem, and invent an algorithm called TruthFinder, which utilizes the relationships between web sites and their information, i.e., a web site is trustworthy if it provides many pieces of true information, and a piece of information is likely to be true if it is provided by many trustworthy web sites. Our experiments show that TruthFinder successfully finds true facts among conflicting information, and identifies trustworthy web sites better than the popular search engines 28235816, ncctchennai@gmail.com, www.ncct.in
  33. 33. IEEE BASED SOFTWARE PROJECTS Bank Customers' Channel Preferences for Requesting Account Balances Laukkanen, T. Dept. of Bus. & Manage., Kuopio Univ. This paper appears in: System Sciences, 2007. HICSS 2007. 40th Annual Hawaii International Conference on Publication Date: Jan. 2007 On page(s): 148a - 148a E-ISBN: 0-7695-2755-8 Number of Pages: 148a - 148a Location: Waikoloa, HI ISSN: 1530-1605 Digital Object Identifier: 10.1109/HICSS.2007.101 Posted online: 2007-01-29 15:00:17.0 Abstract Electronic applications in banking have enhanced customers' ability to control the balances and latest transactions of their bank accounts. Many banks today offer this service also via mobile channel further improving customers' capability to use the service anytime anywhere. This paper analyses online bank customers', namely Internet and mobile users', diverse electronic channel preferences for requesting account balances. Conjoint analysis is used in order to measure the utility these two groups of customers attach to different attributes of electronic channels. The results show that the two groups of customers face different needs in consumption of the service. While mobile users put the greatest attention to flexible service access point, the Internet users value the screen size of a device the most. The results suggest Nokia communicator type of device as an optimal channel for current mobile users, while those currently without experience in mobile banking show no interest in devices smaller than personal computer 28235816, ncctchennai@gmail.com, www.ncct.in
  34. 34. IEEE BASED SOFTWARE PROJECTS The Server Reassignment Problem for Load Balancing in Structured P2P Systems Chyouhwa Chen; Kun-Cheng Tsai Parallel and Distributed Systems, IEEE Transactions on Volume 19, Issue 2, Feb. 2008 Page(s):234 - 246 Digital Object Identifier 10.1109/TPDS.2007.70735 Summary: Application-layer peer-to-peer (P2P) networks are considered to be the most important development for next-generation Internet infrastructure. For these systems to be effective, load balancing among the peers is critical. Most structured P2P systems rely on ID-space partitioning schemes to solve the load imbalance problem and have been known to result in an imbalance factor of ominus(logN) in the zone sizes. This paper makes two contributions. First, we propose addressing the virtual-server-based load balancing problem systematically using an optimization-based approach and derive an effective algorithm to rearrange loads among the peers. We demonstrate the superior performance of our proposal in general and its advantages over previous strategies in particular. We also explore other important issues vital to the performance in the virtual server framework, such as the effect of the number of directories employed in the system and the performance ramification of user registration strategies. Second, and perhaps more significantly, we systematically characterize the effect of heterogeneity on load balancing algorithm performance and the conditions in which heterogeneity may be easy or hard to deal with based on an extensive study of a wide spectrum of load and capacity scenarios. 28235816, ncctchennai@gmail.com, www.ncct.in
  35. 35. IEEE BASED SOFTWARE PROJECTS Statistical techniques for detecting traffic anomalies through packet header data Source IEEE/ACM Transactions on Networking (TON) archive Volume 16, Issue 3 (June 2008) table of contents Pages 562-575 Year of Publication: 2008 ISSN: 1063-6692 ABSTRACT This paper proposes a traffic anomaly detector, operated in postmortem and in real-time, by passively monitoring packet headers of traffic. The frequent attacks on network infrastructure, using various forms of denial of service attacks, have led to an increased need for developing techniques for analyzing network traffic. If efficient analysis tools were available, it could become possible to detect the attacks, anomalies and to take action to contain the attacks appropriately before they have had time to propagate across the network. In this paper, we suggest a technique for traffic anomaly detection based on analyzing correlation of destination IP addresses in outgoing traffic at an egress router. This address correlation data are transformed using discrete wavelet transform for effective detection of anomalies through statistical analysis. Results from trace- driven evaluation suggest that proposed approach could provide an effective means of detecting anomalies close to the source. We also present a multidimensional indicator using the correlation of port numbers and the number of flows as a means of detecting anomalies. 28235816, ncctchennai@gmail.com, www.ncct.in
  36. 36. IEEE BASED SOFTWARE PROJECTS Route Reservation in Ad Hoc Wireless Networks Source IEEE Transactions on Mobile Computing archive Volume 6, Issue 1 (January 2007) Year of Publication: 2007 ISSN: 1536-1233 ABSTRACT This paper investigates whether and when route reservation-based (RB) communication can yield better delay performance than non-reservation-based (NRB) communication in ad hoc wireless networks. In addition to posing this fundamental question, the requirements (in terms of route discovery, medium access control (MAC) protocol, and pipelining, etc.) for making RB switching superior to NRB switching are also identified. A novel analytical framework is developed and the network performance under both RB and NRB schemes is quantified. It is shown that if the aforementioned requirements are met, then RB schemes can indeed yield better delay performance than NRB schemes. This advantage, however, comes at the expense of lower throughput and goodput compared to NRB schemes. 28235816, ncctchennai@gmail.com, www.ncct.in
  37. 37. IEEE BASED SOFTWARE PROJECTS Rateless Forward Error Correction for Topology- Transparent Scheduling Syrotiuk, V.R.; Colbourn, C.J.; Yellamraju, S. Networking, IEEE/ACM Transactions on Volume 16, Issue 2, April 2008 Page(s):464 - 472 Digital Object Identifier 10.1109/TNET.2007.899018 Summary: Topology-transparent scheduling for mobile wireless ad hoc networks has been treated as a theoretical curiosity. This paper makes two contributions towards its practical deployment: (1) We generalize the combinatorial requirement on the schedules and show that the solution is a cover-free family. As a result, a much wider number and variety of constructions for schedules exist to match network conditions. (2) In simulation, we closely match the theoretical bound on expected throughput. The bound was derived assuming acknowledgments are available immediately. We use rate less forward error correction (RFEC) as an acknowledgment scheme with minimal computational overhead. Since the wireless medium is inherently unreliable, RFEC also offers some measure of automatic adaptation to channel load. These contributions renew interest in topology-transparent scheduling when delay is a principal objective. 28235816, ncctchennai@gmail.com, www.ncct.in
  38. 38. IEEE BASED SOFTWARE PROJECTS A mobile e-commerce solution Chi-Wei Lan Chun-Chou Chien Meng-Yen Hsieh Chen, I. Nat. Central Univ., Chung-Li, Taiwan ; This paper appears in: Multimedia Software Engineering, 2000. Proceedings. International Symposium on Publication Date: 11-13 Dec. 2000 On page(s): 215 - 222 Number of Pages: xiii+446 Meeting Date: 12/11/2000 - 12/13/2000 Location: Taipei Digital Object Identifier: 10.1109/MMSE.2000.897214 Posted online: 2002-08-06 23:26:08.0 Abstract With the popularity of WAP (Wireless Application Protocol), people can do mobile banking, mobile shopping and even access data on the Web via their cellular phones. In the future, there may be some other devices, such as PDAs (personal digital assistants) used by people to do mobile e-commerce, but different devices accept different data formats, and this means that we have to transform everything needed by these devices into many formats. In order to resolve this problem, we introduce an XML-based mobile e-commerce solution 28235816, ncctchennai@gmail.com, www.ncct.in
  39. 39. IEEE BASED SOFTWARE PROJECTS Rate and delay guarantees provided by Clos packet switches with load balancing Source IEEE/ACM Transactions on Networking (TON) archive Volume 16, Issue 1 (February 2008) Year of Publication: 2008 ISSN: 1063-6692 ABSTRACT The size of a single-hop cross-bar fabric is still limited by the technology, and the fabrics available on the market do not exceed the terabit capacity. A multihop fabric such as Clos network provides the higher capacity by using the smaller switching elements (SE). When the traffic load is balanced over the switches in a middle stage, all the traffic would get through the fabric, as long as the switch outputs are not overloaded. However, the delay that packets experience through the Clos switch depends on the granularity of flows that are balanced. We examine the maximum fabric utilization under which a tolerable delay is provided for various load balancing algorithms, and derive the general formula for this utilization in terms of the number of flows that are balanced. We show that the algorithms which balance flows with sufficiently coarse granularity provide both high fabric utilization and delay guarantees to the most sensitive applications. Since no admission control should be performed within the switch, the fast traffic- pattern changes can be accommodated in the proposed scalable architecture. 28235816, ncctchennai@gmail.com, www.ncct.in
  40. 40. IEEE BASED SOFTWARE PROJECTS J2ME end-to-end security for M-commerce Itani, W. Kayssi, A.I. Dept. of Electr. & Comput. Eng., American Univ. of Beirut, Lebanon This paper appears in: Wireless Communications and Networking, 2003. WCNC 2003. 2003 IEEE Publication Date: 16-20 March 2003 Volume: 3 On page(s): 2015 - 2020 vol.3 Number of Pages: 3 vol.xxxviii+2138 ISSN: 1525-3511 Digital Object Identifier: 10.1109/WCNC.2003.1200696 Posted online: 2003-05-28 14:06:04.0 Abstract This paper shows an end-to-end application-layer security solution for wireless enterprise applications using the Java 2 Platform Micro Edition (J2ME). The proposed solution uses pure Java components to provide end-to-end client authentication and data confidentiality between wireless J2ME based clients and J2EE based servers. This solution can be implemented with the available limited resources of a Java MIDP device, without any modification to the underlying protocols or wireless network infrastructure. A mobile banking application is used to illustrate the implementation of the proposed solution. 28235816, ncctchennai@gmail.com, www.ncct.in
  41. 41. IEEE BASED SOFTWARE PROJECTS Network Border Patrol Albuquerque, C. Vickers, B.J. Suda, T. Dept. of Inf. & Comput. Sci., California Univ., Irvine, CA, USA; This paper appears in: INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE Publication Date: 26-30 March 2000 Volume: 1 On page(s): 322 - 331 vol.1 Number of Pages: 3 vol.(xxvi+1826) Meeting Date: 03/26/2000 - 03/30/2000 Location: Tel Aviv Digital Object Identifier: 10.1109/INFCOM.2000.832202 Posted online: 2002-08-06 23:06:07.0 Abstract The end-to-end nature of Internet congestion control is an important factor in its scalability and robustness. However, end-to-end congestion control algorithms alone are incapable of preventing the congestion collapse and unfair bandwidth allocations created by applications which are unresponsive to network congestion. In this paper, we propose and investigate a new congestion avoidance mechanism called Network Border Patrol (NBP). NBP relies on the exchange of feedback between routers at the borders of a network in order to detect and restrict unresponsive traffic flows before they enter the network. The NBP mechanism is compliant with the Internet philosophy of pushing complexity toward the edges of the network whenever possible. Simulation results show that NBP effectively eliminates congestion collapse, and that, when combined with fair queueing, NBP achieves approximately max-min fair bandwidth allocations for competing network flows 28235816, ncctchennai@gmail.com, www.ncct.in
  42. 42. IEEE BASED SOFTWARE PROJECTS Rate allocation and network lifetime problems for wireless sensor networks Source IEEE/ACM Transactions on Networking (TON) archive Volume 16 , Issue 2 (April 2008) table of contents Year of Publication: 2008 ISSN:1063-6692 ABSTRACT An important performance consideration for wireless sensor networks is the amount of information collected by all the nodes in the network over the course of network lifetime. Since the objective of maximizing the sum of rates of all the nodes in the network can lead to a severe bias in rate allocation among the nodes, we advocate the use of lexicographical max-min (LMM) rate allocation. To calculate the LMM rate allocation vector, we develop a polynomial-time algorithm by exploiting the parametric analysis (PA) technique from linear program (LP), which we call serial LP with Parametric Analysis (SLP-PA). We show that the SLP-PA can be also employed to address the LMM node lifetime problem much more efficiently than a state-of-the-art algorithm proposed in the literature. More important, we show that there exists an elegant duality relationship between the LMM rate allocation problem and the LMM node lifetime problem. Therefore, it is sufficient to solve only one of the two problems. Important insights can be obtained by inferring duality results for the other problem 28235816, ncctchennai@gmail.com, www.ncct.in
  43. 43. IEEE BASED SOFTWARE PROJECTS Ranked Reverse Nearest Neighbor Search Lee, K.C.K.; Baihua Zheng; Wang-Chien Lee Knowledge and Data Engineering, IEEE Transactions on Volume 20, Issue 7, July 2008 Page(s):894 - 910 Digital Object Identifier 10.1109/TKDE.2008.36 Summary: Given a set of data points P and a query point q in a multidimensional space, reverse nearest neighbor (RNN) query finds data points in P whose nearest neighbors are q. Reverse k-nearest neighbor (RkNN) query (where k ges 1) generalizes RNN query to find data points whose kNNs include q. For RkNN query semantics, q is said to have influence to all those answer data points. The degree of q's influence on a data point p (isin P) is denoted by kappap where q is the kappap-th NN of p. We introduce a new variant of RNN query, namely, ranked reverse nearest neighbor (RRNN) query, that retrieves t data points most influenced by q, i.e., the t data points having the smallest kappa's with respect to q. To answer this RRNN query efficiently, we propose two novel algorithms, kappa- counting and kappa-browsing that are applicable to both monochromatic and bichromatic scenarios and are able to deliver results progressively. Through an extensive performance evaluation, we validate that the two proposed RRNN algorithms are superior to solutions derived from algorithms designed for RkNN query. 28235816, ncctchennai@gmail.com, www.ncct.in
  44. 44. IEEE BASED SOFTWARE PROJECTS Computation efficient multicast key distribution Lihao Xu Information Theory, 2003. Proceedings. IEEE International Symposium on Volume , Issue , 29 June-4 July 2003 Page(s): 425 - Digital Object Identifier 10.1109/ISIT.2003.1228442 Summary: In this paper, we adopt a common model where session keys are issued and distributed by a central group controller (GC). The resources needed for the GC to distribute session keys to group members include communication, storage and computation resources. A new dynamic group key distribution scheme, in which the rekeying process that reduces computation complexity and yet maintain at least the same security degree of using symmetric encryption algorithms is also discussed 28235816, ncctchennai@gmail.com, www.ncct.in
  45. 45. IEEE BASED SOFTWARE PROJECTS Network border patrol: preventing congestion collapse and promoting fairness in the Internet Albuquerque, C. Vickers, B.J. Suda, T. Dept. of Networking & Data Link Control, Magis Networks, San Diego, CA, USA This paper appears in: Networking, IEEE/ACM Transactions on Publication Date: Feb. 2004 Volume: 12, Issue: 1 On page(s): 173 - 186 ISSN: 1063-6692 Digital Object Identifier: 10.1109/TNET.2003.820248 Posted online: 2004-02-26 10:50:20.0 Abstract The Internet's excellent scalability and robustness result in part from the end-to- end nature of Internet congestion control. End-to-end congestion control algorithms alone, however, are unable to prevent the congestion collapse and unfairness created by applications that are unresponsive to network congestion. To address these maladies, we propose and investigate a novel congestion- avoidance mechanism called network border patrol (NBP). NBP entails the exchange of feedback between routers at the borders of a network in order to detect and restrict unresponsive traffic flows before they enter the network, thereby preventing congestion within the network. Moreover, NBP is complemented with the proposed enhanced core-stateless fair queueing (ECSFQ) mechanism, which provides fair bandwidth allocations to competing flows. Both NBP and ECSFQ are compliant with the Internet philosophy of pushing complexity toward the edges of the network whenever possible. Simulation results show that NBP effectively eliminates congestion collapse and that, when combined with ECSFQ, approximately max-min fair bandwidth allocations can be achieved for competing flows. 28235816, ncctchennai@gmail.com, www.ncct.in
  46. 46. IEEE BASED SOFTWARE PROJECTS Quiver: Consistent and Scalable Object Sharing for Edge Services Reiter, M.K.; Samar, A. Parallel and Distributed Systems, IEEE Transactions on Volume 19, Issue 7, July 2008 Page(s):878 - 889 Digital Object Identifier 10.1109/TPDS.2007.70790 Summary: We present Quiver, a system that coordinates service proxies placed at the "edge" of the Internet to serve distributed clients accessing a service involving mutable objects. Quiver enables these proxies to perform consistent accesses to shared objects by migrating the objects to proxies performing operations on those objects. These migrations dramatically improve performance when operations involving an object exhibit geographic locality, since migrating this object into the vicinity of proxies hosting these operations will benefit all such operations. Other workloads benefit from Quiver, dispersing the computation load across the proxies and saving the costs of sending operation parameters over the wide area when these are large. Quiver also supports optimizations for single-object reads that do not involve migrating the object. We detail the protocols for implementing object operations and for accommodating the addition, involuntary disconnection, and voluntary departure of proxies. We also evaluate Quiver through experiments on PlanetLab. Finally, we discuss the use of Quiver to build an e-commerce application and a distributed network traffic modeling service. 28235816, ncctchennai@gmail.com, www.ncct.in
  47. 47. IEEE BASED SOFTWARE PROJECTS A Fully Distributed Proactively Secure Threshold- Multisignature Scheme van der Merwe, J.; Dawoud, D.S.; McDonald, S. Parallel and Distributed Systems, IEEE Transactions on Volume 18, Issue 4, April 2007 Page(s):562 - 575 Digital Object Identifier 10.1109/TPDS.2007.1005 Summary: Threshold-multisignature schemes combine the properties of threshold group- oriented signature schemes and multisignature schemes to yield a signature scheme that allows a threshold (t) or more group members to collaboratively sign an arbitrary message. In contrast to threshold group signatures, the individual signers do not remain anonymous, but are publicly identifiable from the information contained in the valid threshold-multisignature. The main objective of this paper is to propose such a secure and efficient threshold-multisignature scheme. The paper uniquely defines the fundamental properties of threshold-multisignature schemes and shows that the proposed scheme satisfies these properties and eliminates the latest attacks to which other similar schemes are subject. The efficiency of the proposed scheme is analyzed and shown to be superior to its counterparts. The paper also proposes a discrete logarithm based distributed-key management infrastructure (DKMI), which consists of a round optimal, publicly verifiable, distributed-key generation (DKG) protocol and a one round, publicly verifiable, distributed-key redistribution/ updating (DKRU) protocol. The round optimal DKRU protocol solves a major problem with existing secret redistribution/updating schemes by giving group members a mechanism to identify malicious or faulty share holders in the first round, thus avoiding multiple protocol executions 28235816, ncctchennai@gmail.com, www.ncct.in
  48. 48. IEEE BASED SOFTWARE PROJECTS Towards Practical Network-to-Network Congestion Control Riihijarvi, J. Lili Wu Mahonen, P. RWTH Aachen University, Aachen, Germany This paper appears in: Networking, International Conference on Systems and International Conference on Mobile Communications and Learning Technologies, 2006. ICN/ICONS/MCL 2006. International Conference on Publication Date: 23-29 April 2006 On page(s): 53 - 53 Digital Object Identifier: 10.1109/ICNICONSMCL.2006.214 Posted online: 2006-05-08 09:30:21.0 Abstract We discuss the use of congestion control mechanisms at the network edges to complement traditional end-to-end congestion control. We argue that such mechanisms will be necessary in the future to deal with unresponsive and even misbehaving traffic flows. A flexible congestion control architecture is presented, together with concrete protocol designs building on the Network Border Patrol proposal. More precisely, we show how to integrate flexible flow aggregation and connection admission control mechanisms into the NBP framework, together with improvements to the original scheduling mechanism. Performance evaluation using the ns-2 simulator is presented, and possibilities for future enhancements and open issues are also discussed. 28235816, ncctchennai@gmail.com, www.ncct.in

×