Ncct - Ieee Software Abstract Collection 2

8/14/2019 Ncct - Ieee Software Abstract Collection 2

http://slidepdf.com/reader/full/ncct-ieee-software-abstract-collection-2 1/48

IEEE BASED

SOFTWARE PROJECTS

LOCATION AIDED ROUTING

An efficient location-aided routing protocol for mobile ad

hoc networks

Nen-Chung Wang Si-Ming WangDept. of Comput. Sci. & Inf. Eng., Chaoyang Univ. of Technol., Taichung, TaiwanThis paper appears in: Parallel and Distributed Systems, 2005. Proceedings. 11th InternationalConference onPublication Date: 20-22 July 2005

Volume: 1On page(s): 335 - 341 Vol. 1Number of Pages: 2 vol. (xxi+712)ISSN: 1521-9097Digital Object Identifier: 10.1109/ICPADS.2005.82Posted online: 2005-11-14 10:13:01.0

Abstract

A mobile ad hoc network (MANET) consists of a set of mobile hosts that do notneed 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 thatmessage packets use when they are routed. In this paper, we propose animproved 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 sourcenode and the destination node, for route discovery. The request packet isbroadcasted in a request zone based on the baseline to determine the nextbroadcasting node. The neighboring node with the shortest distance to thebaseline 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 theprocess of routing maintenance. Finally, experimental results show that theproposed ILAR scheme outperforms LAR scheme.

28235816, [email protected], www.ncct.in



IEEE BASED

SOFTWARE PROJECTS

A geometric approach to improving active packet loss

measurement

Source IEEE/ACM Transactions on Networking (TON) archiveVolume 16, Issue 2 (April 2008) table of contentsPages 307-320Year of Publication: 2008ISSN: 1063-6692Authors Joel Sommers Department of Computer Science, Colgate University, Hamilton, NY

Abstract

Measurement and estimation of packet loss characteristics are challenging due tothe 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-endpaths, there has been little analysis of the accuracy of these tools or their impacton the network.

The objective of our study is to understand how to measure packet loss episodesaccurately with end-to-end probes. We begin by testing the capability of standard

Poisson-modulated end-to-end measurements of loss in a controlled laboratoryenvironment using IP routers and commodity end hosts.

Our tests show that loss characteristics reported from such Poisson-modulatedprobe tools can be quite inaccurate over a range of traffic conditions. Motivated bythese observations, we introduce a new algorithm for packet loss measurementthat is designed to overcome the deficiencies in standard Poisson-based tools.

Specifically, our method entails probe experiments that follow a geometricdistribution to 1) enable an explicit trade-off between accuracy and impact on thenetwork, and 2) enable more accurate measurements than standard Poissonprobing at the same rate.

We evaluate the capabilities of our methodology experimentally by developing andimplementing a prototype tool, called BADABING. The experiments demonstratethe trade-offs between impact on the network and measurement accuracy. Weshow that BADABING reports loss characteristics far more accurately thantraditional loss measurement tools.






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 onVolume 16, Issue 2, April 2008 Page(s):307 - 320Digital Object Identifier 10.1109/TNET.2007.900412

Summary:

Measurement and estimation of packet loss characteristics are challenging due tothe 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-endpaths, there has been little analysis of the accuracy of these tools or their impacton the network.

The objective of our study is to understand how to measure packet loss episodesaccurately with end-to-end probes. We begin by testing the capability of standardPoisson-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-modulatedprobe tools can be quite inaccurate over a range of traffic conditions. Motivated bythese observations, we introduce a new algorithm for packet loss measurementthat is designed to overcome the deficiencies in standard Poisson-based tools.

Specifically, our method entails probe experiments that follow a geometricdistribution to 1) enable an explicit trade-off between accuracy and impact on thenetwork, and 2) enable more accurate measurements than standard Poissonprobing at the same rate. We evaluate the capabilities of our methodologyexperimentally by developing and implementing a prototype tool, calledBADABING. The experiments demonstrate the trade-offs between impact on thenetwork and measurement accuracy. We show that BADABING reports losscharacteristics far more accurately than traditional loss measurement tools.




IEEE BASED

SOFTWARE PROJECTS

Velocity and location aided routing

for mobile ad hoc networks

Kai-Ten Feng Tse-En LuDept. of Commun. Eng., Nat. Chiao Tung Univ., Hsinchu, TaiwanThis paper appears in: Vehicular Technology Conference, 2004. VTC2004-Fall.2004 IEEE 60thPublication Date: 26-29 Sept. 2004Volume: 4On page(s): 2789 - 2793 Vol. 4Number of Pages: 7 vol. (lxxxv+5334)ISSN: 1090-3038Digital Object Identifier: 10.1109/VETECF.2004.1400566Posted online: 2005-04-18 09:11:11.0

Abstract

Many location-aware routing protocols have been proposed for mobile ad hocnetworks 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 intoaccount in most of the related work. In this paper, the proposed velocity aidedrouting (VAR) protocol determine its packet forwarding scheme based on therelative velocity between the intended forwarding node and the destination node.

The routing performance can be further improved by the velocity and locationaided routing (VLAR) protocol, which combines the location aided routing (LAR)

protocol with the VAR algorithm. Two types of motion predictive models, theGauss-Markov mobility model and the constant speed mobility model, areincorporated 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.




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 onVolume 18, Issue 4, April 2007 Page(s):562 - 575Digital 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 signaturescheme that allows a threshold (t) or more group members to collaboratively signan arbitrary message.

In contrast to threshold group signatures, the individual signers do not remainanonymous, but are publicly identifiable from the information contained in the validthreshold-multisignature. The main objective of this paper is to propose such asecure and efficient threshold-multisignature scheme.

The paper uniquely defines the fundamental properties of threshold-multisignatureschemes and shows that the proposed scheme satisfies these properties andeliminates the latest attacks to which other similar schemes are subject. Theefficiency of the proposed scheme is analyzed and shown to be superior to itscounterparts.

The paper also proposes a discrete logarithm based distributed-key managementinfrastructure (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 secretredistribution/updating schemes by giving group members a mechanism to identifymalicious or faulty share holders in the first round, thus avoiding multiple protocolexecutions




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 archiveVolume 19, Issue 7 (July 2008)Year of Publication: 2008ISSN: 1045-9219

ABSTRACT

This paper presents a hybrid scheduling methodology for task graphs tomultiprocessor embedded systems. The proposed methodology is designed for task graphs which are dynamic in nature due to the presence of conditional tasksas well as tasks whose execution times are unpredictable but bounded.

We have presented the methodology as a three phase strategy in which tasknodes are mapped to the processors in the first (static mapping) phase. In the

second (selective duplication) phase some critical nodes are identified andduplicated for possible rescheduling at run-time depending on the code memoryconstraints of the processors.

The third (online) phase is a run-time scheduling algorithm that performs listscheduling based on actual dynamics of the schedule up to the current time. Weshow that this technique provides better schedule length (up to 20%) compared toprevious techniques which are predominantly static in nature with low overheadand comparable in complexity with existing online techniques.

The effects of model parameters like number of processors, memory and varioustask graph parameters on performance are investigated in this paper.




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., BangkokThis paper appears in: Communications and Electronics, 2006. ICCE '06. FirstInternational Conference onPublication Date: 10-11 Oct. 2006On page(s): 7 - 12

Number of Pages: 7 - 12Location: HanoiDigital Object Identifier: 10.1109/CCE.2006.350847Posted online: 2007-04-23 10:14:40.0

Abstract

In mobile ad hoc network (MANET), there are a number of routing schemes thathave been proposed and several of these have been already extensively simulatedor implemented as well. In this paper, we describe extension to routing algorithm

based on location information to provide more efficient routing for mobile ad hocnetworks.

We propose replacing location-aided routing (LAR) with location-aided multipathrouting (LAMR). We implemented LAMR through simulation using ns-2 and studyits 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




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 onVolume 34, Issue 1, Jan.-Feb. 2008 Page(s):50 - 64Digital Object Identifier 10.1109/TSE.2007.70742

Summary:

Web applications are widely adopted and their correct functioning is mission criticalfor many businesses. At the same time, Web applications tend to be error proneand implementation vulnerabilities are readily and commonly exploited byattackers.

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 onespecific type of implementation vulnerability, namely, broken dependencies onsession data.

This vulnerability can lead to a variety of erroneous behavior at runtime and caneasily be triggered by a malicious user by applying attack techniques such asforceful browsing. This paper shows how to guarantee the absence of runtimeerrors due to broken dependencies on session data in Web applications.

The proposed solution combines development-time program annotation, staticverification, and runtime checking to provably protect against broken datadependencies. We have developed a prototype implementation of our approach,

building on the JML annotation language and the existing static verification toolESC/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 thefully automatic static verification is acceptable, and that the performance overhead

of the runtime checking is limited.




IEEE BASED

SOFTWARE PROJECTS

Mobile banking Assessment of today's mobile bankingapplications from the view of customer requirements

Pousttchi, K. Schurig, M.Bus. Informatics & Syst. Eng., Augsburg Univ., GermanyThis paper appears in: System Sciences, 2004. Proceedings of the 37th AnnualHawaii International Conference onPublication Date: 5-8 Jan. 2004On page(s): 10 pp.

Number of Pages: lxxi+320Digital Object Identifier: 10.1109/HICSS.2004.1265440Posted online: 2004-02-26 10:51:06.0

Abstract

Mobile banking is a subset of electronic banking which underlies not only thedeterminants of the banking business but also the special conditions of mobilecommerce. This paper analyzes customer needs and expectations from the mobileapplications' 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 shownand the impact of upcoming new technology is discussed.

The outcome of the paper is a defined set of customer requirements to mobilebanking applications, the identification and assessment of four standard types of current mobile banking applications and an explanation of major failure reasonsalong with opportunities for their improvement




IEEE BASED

SOFTWARE PROJECTS

Performance of a speculative transmission scheme for

scheduling-latency reduction

Source IEEE/ACM Transactions on Networking (TON) archiveVolume 16, Issue 1 (February 2008)Year of Publication: 2008ISSN: 1063-6692

ABSTRACT

Low latency is a critical requirement in some switching applications, specifically inparallel computer interconnection networks. The minimum latency in switches withcentralized scheduling comprises two components, namely, the control-pathlatency and the data-path latency, which in a practical high-capacity, distributedswitch implementation can be far greater than the cell duration.

We introduce a speculative transmission scheme to significantly reduce theaverage control-path latency by allowing cells to proceed without waiting for agrant, under certain conditions. It operates in conjunction with any centralized

matching algorithm to achieve a high maximum utilization and incorporates areliable delivery mechanism to deal with failed speculations.

An analytical model is presented to investigate the efficiency of the speculativetransmission scheme employed in a non-blocking N × NR input-queued crossbar switch with R receivers per output. Using this model, performance measures suchas the mean delay and the rate of successful speculative transmissions arederived.

The results demonstrate that the control-path latency can be almost entirelyeliminated for loads up to 50%. Our simulations confirm the analytical results






IEEE BASED

SOFTWARE PROJECTS

Performance evaluation of hardware models of Advanced

Encryption Standard (AES) algorithm

Yenuguvanilanka, J.; Elkeelany, O.Southeastcon, 2008. IEEEVolume , Issue , 3-6 April 2008 Page(s):222 - 225Digital Object Identifier 10.1109/SECON.2008.4494289

Summary:

In today's world most of the communication is done using electronic media. DataSecurity plays a vital role in such communication. Hence, there is a need to protectdata from malicious attacks.

Advanced Encryption Standard (AES), also known as Rijndael, is an encryptionstandard used for securing information. AES is a block cipher algorithm that hasbeen analyzed extensively and is now used widely. The hardware implementationof 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 keylength 128 bits. Two hardware models based on HDL and IP core are used toevaluate the performance of the algorithm.

The encryption time and also the performance metrics such as size, speed andmemory utilization are evaluated, using these models. Results are compared to areference model and have shown an increase in the throughput per slice measure.




IEEE BASED

SOFTWARE PROJECTS

Consumer Value Segments in Mobile Bill Paying

Laukkanen, T. Kantanen, T.University of KuopioThis paper appears in: Information Technology: New Generations, 2006. ITNG2006. Third International Conference onPublication Date: 10-12 April 2006On page(s): 314 - 319Digital 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 bankingand in mobile bill paying especially. Today mobile communications technologiesoffer an opportunity for vast additional value for consumers’ banking actions due totheir always-on functionality and the option to bank virtually any time andanywhere.

However, consumer value differs between individuals. It was measured in thecontext with five items namely privacy, accuracy, convenience, control andefficiency. An Internet questionnaire was developed and 82 usable responses fromthe users of mobile bill paying were collected. K-Means Clustering was used andfive different value segments were identified.

The results indicate that privacy and efficiency are the most valued items in mobilebill paying in general while individuals differing in their valuations. The studyprovides academics and bank managers with better understanding to consumer value in mobile banking and offers indications for value-based consumer

segmentation.




IEEE BASED

SOFTWARE PROJECTS

Optimal State Allocation for Multicast Communications

With Explicit Multicast Forwarding

De-Nian Yang Wanjiun LiaoNat. Taiwan Univ., Taipei;This paper appears in: Parallel and Distributed Systems, IEEE Transactions onPublication Date: April 2008Volume: 19, Issue: 4ISSN: 1045-9219INSPEC Accession Number: 9903084Digital Object Identifier: 10.1109/TPDS.2007.70754Date Published in Issue: 2008-03-03 08:13:41.0

Abstract

In this paper, we propose a scalable and adaptive multicast forwarding mechanism basedon explicit multicast (Xcast). This mechanism optimizes the allocation of forwarding statesin 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 forwardingstates among routers. We focus on two problems and formulate each of them as anoptimization problem.

The first problem, referred to as minstate, minimizes the total number of routers that storeforwarding 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 multicastgroups, 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 theapproach adopted by most existing works to allocate forwarding states in the branchingrouters of a multicast tree is a special case of our mechanism.

The simulation results show that the forwarding state allocation provided by previous workis concentrated on the backbone routers in the Internet, which may cause the scalabilityproblem. In contrast, our mechanism can balance forwarding states stored among routersand reduce the number of routers that store the forwarding states for a multicast tree.




IEEE BASED

SOFTWARE PROJECTS

Online Index Recommendations for High-Dimensional

Databases Using Query Workloads

Source IEEE Transactions on Knowledge and Data Engineering archiveVolume 20, Issue 2 (February 2008)Year of Publication: 2008ISSN: 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 relativelysmallsubset 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 patternschange. To address these issues, we introduce a parameterizable technique torecommend indexes based on index types frequently used forhigh-dimensionaldata sets and to dynamically adjust indexesas the underlying query workloadchanges.

We incorporate aquery pattern change detection mechanism to determine whenthe access patterns have changed enough to warrant change inthe physicaldatabase design. By adjusting analysis parameters,we trade off analysis speedagainst analysis resolution.

We perform experiments with a number of data sets, query sets, and parameters toshow the effect that varying these characteristics has on analysis results.




IEEE BASED

SOFTWARE PROJECTS

On the performance benefits of multihoming route control


ABSTRACT

Multihoming is increasingly being employed by large enterprises and data centersto extract good performance and reliability from their ISP connections. Multihomedend 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 importantcontributions. First, we present a study of the potential improvements in Internetround-trip times (RTTs) and transfer speeds from employing multihoming route

control. Our analysis shows that multihoming to three or more ISPs and cleverlyscheduling traffic across the ISPs can improve Internet RTTs and throughputs byup to 25% and 20%, respectively.

However, a careful selection of ISPs is important to realize the performanceimprovements. Second, focusing on large enterprises, we propose and evaluate awide-range of route control mechanisms and evaluate their design trade-offs.

We implement the proposed schemes on a Linux-based Web proxy and perform atrace-based evaluation of their performance. We show that both passive and active

measurement-based techniques are equally effective and could improve the Webresponse times of enterprise networks by up to 25% on average, compared tousing a single ISP. We also outline several "best common practices" for the designof route control products.




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 onVolume 18, Issue 5, May 2007 Page(s):697 - 710Digital Object Identifier 10.1109/TPDS.2007.351711

Summary:

We propose a new fair scheduling technique, called OCGRR (Output ControlledGrant-based Round Robin), for the support of DiffServ traffic in a core router. Wedefine a stream to be the same-class packets from a given immediate upstreamrouter destined to an output port of the core router.

At each output port, streams may be isolated in separate buffers before beingscheduled in a frame. The sequence of traffic transmission in a frame starts fromhigher-priority traffic and goes down to lower-priority traffic.

A frame may have a number of small rounds for each class. Each stream within aclass 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 fromthe same stream and achieving a smaller jitter and startup latency.

The grant can be adjusted in a way to prevent the starvation of lower priorityclasses. 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.








IEEE BASED

SOFTWARE PROJECTS

Location-Based Spatial Query Processing with Data

Sharing in Wireless Broadcast Environments

Ku, Wei-Shinn; Zimmermann, Roger; Wang, HaixunMobile Computing, IEEE Transactions onVolume 7, Issue 6, June 2008 Page(s): 778 - 791Digital Object Identifier 10.1109/TMC.2007.70791

Summary:

Location-based spatial queries (LBSQs) refer to spatial queries whose answersrely on the location of the inquirer. Efficient processing of LBSQs is of criticalimportance with the ever-increasing deployment and use of mobile technologies.

We show that LBSQs have certain unique characteristics that traditional spatialquery processing in centralized databases does not address. For example, asignificant challenge is presented by wireless broadcasting environments, whichhave excellent scalability but often exhibit high-latency database access.

In this paper, we present a novel query processing technique that, whilemaintaining high scalability and accuracy, manages to reduce the latencyconsiderably in answering location-based spatial queries. Our approach is basedon peer-to-peer sharing, which enables us to process queries without delay at amobile 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




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 onVolume, Issue, 4-7 March 2008 Page(s): 83 - 88Digital 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 miningand so on.

It includes a big collection of genetic fuzzy system algorithms based on differentapproaches: Pittsburgh, Michigan, IRL and GCCL.

It allows us to perform a complete analysis of any genetic fuzzy system incomparison to existing ones, including a statistical test module for comparison. Theuse of KEEL is illustrated through the analysis of one case study




IEEE BASED

SOFTWARE PROJECTS

Intrusion Detection System Based on Data Mining

Zhan JiuhuaKnowledge Discovery and Data Mining, 2008. WKDD 2008. International WorkshoponVolume, Issue, 23-24 Jan. 2008 Page(s): 402 - 405Digital 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 currentproblems IDS is facing.

The system that performs anomaly detection can detect intrusions known andunknown, reduce omissions and misstatements, improve accuracy and speed of

intrusion detection and has good adaptive capacity and scalability




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 InternationalConference on and Enterprise Computing, E-Commerce, and E-Services, The 3rdIEEE International Conference onPublication Date: 2006On page(s): 81 - 81Number of Pages: 81 - 81Location: San Francisco, CADigital Object Identifier: 10.1109/CEC-EEE.2006.30Posted 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 itpossible 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 asperceived by the banks. It introduces the findings of a bank survey conducted bythe authors in Germany.

The survey discovered that banks expect mobile banking to gain greater strategicrelevance in near future and are positioning themselves not to be left behind




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 onVolume 7, Issue 6, June 2008 Page(s): 698 - 711Digital Object Identifier 10.1109/TMC.2008.19

Summary:

Intrusion detection in Wireless Sensor Network (WSN) is of practical interest inmany applications such as detecting an intruder in a battlefield. The intrusiondetection 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 parameterssuch as node density and sensing range in terms of a desirable detectionprobability.

In this paper, we consider this issue according to two WSN models:homogeneous and heterogeneous WSN. Furthermore, we derive the detectionprobability by considering two sensing models: single-sensing detection andmultiple-sensing detection.

In addition, we discuss the network connectivity and broadcast reachability, whichare necessary conditions to ensure the corresponding detection probability in aWSN. Our simulation results validate the analytical values for both homogeneousand heterogeneous WSNs




IEEE BASED

SOFTWARE PROJECTS

iArgue: A Web-Based Argumentation System SupportingCollaboration Scripts with Adaptable Fading

Bouyias, Y.N.; Demetriadis, S.N.; Tsoukalas, I.A.Advanced Learning Technologies, 2008. ICALT apos;08. Eighth IEEE InternationalConference onVolume , Issue , 1-5 July 2008 Page(s):477 - 479Digital 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 takesinto account latest research on collaboration scripts and implements scriptmechanisms 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.




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,ChrisUniversity of South AustraliaThis paper appears in: Management of Mobile Business, 2007. ICMB 2007. InternationalConference on thePublication Date: 9-11 July 2007On page(s): 51 - 51Number of Pages: 51 - 51

Location: Toronto, ON, CanadaDigital Object Identifier: 10.1109/ICMB.2007.56Posted 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 onereason for the interest in the mobile phone/ handset as a Personal Trusted Device(PTD). However, mobile phones have other shortcomings, for example theconstraints 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 securityof the phone as PTD with the characteristics, such as large display size, that canbe offered by non-portable hardware.

We describe three prototype SDD systems which we built in order to test theseideas. Two of them use a simulated SDD implemented entirely in software on apersonal computer: a Mobile Banking system in which the SDD is used for itsdisplay 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 implementationof 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.




IEEE BASED

SOFTWARE PROJECTS

Provably Secure Three-Party Authenticated Quantum Key

Distribution Protocols

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TDSC.2007.13January-March 2007 (vol. 4 no. 1) pp. 71-80

This work presents quantum key distribution protocols (QKDPs) to safeguardsecurity in large networks, ushering in new directions in classical cryptography andquantum cryptography.

Two three-party QKDPs, one with implicit user authentication and the other withexplicit mutual authentication, are proposed to demonstrate the merits of the newcombination, which include the following: 1) security against such attacks as man-in-the-middle, eavesdropping and replay, 2) efficiency is improved as the proposedprotocols contain the fewest number of communication rounds among existingQKDPs, 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.






IEEE BASED

SOFTWARE PROJECTS

Mobile Banking Services Based On J2ME/J2EE

Krol, Przemyslaw Nowak, Przemyslaw Sakowicz, BartoszDepartment of Microelectronics and Computer Science, Technical University of Lodz, Poland. E-mail: [email protected] paper appears in: CAD Systems in Microelectronics, 2007. CADSM '07. 9thInternational Conference - The Experience of Designing and Applications of Publication Date: 19-24 Feb. 2007On page(s): 487 - 490

Number of Pages: 487 - 490Location: Lviv, UkraineDigital Object Identifier: 10.1109/CADSM.2007.4297626Posted online: 2007-09-04 09:28:56.0

Abstract

The article introduces alternative ways for providing mobile baking services aimedat J2ME enabled mobile devices. The scope of the discussed solution is thecombination 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.




IEEE BASED

SOFTWARE PROJECTS

Truth discovery with multiple conflicting information

providers on the web

Source Conference on Knowledge Discovery in Data archiveProceedings of the 13th ACM SIGKDD international conference on Knowledgediscovery and data mining table of contentsSan Jose, California, USASESSION: Industrial and government track short papersYear of Publication: 2007ISBN: 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 theweb. Moreover, different web sites often provide conflicting information on asubject, 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 informationon many subjects that is provided by various web sites.

We design a general framework for the Veracity problem, and invent an algorithmcalled TruthFinder, which utilizes the relationships between web sites and their information, i.e., a web site is trustworthy if it provides many pieces of trueinformation, and a piece of information is likely to be true if it is provided by manytrustworthy web sites.

Our experiments show that TruthFinder successfully finds true facts amongconflicting information, and identifies trustworthy web sites better than the popular search engines.




IEEE BASED

SOFTWARE PROJECTS

Truth discovery with multiple conflicting information

providers on the web

Source Conference on Knowledge Discovery in Data archiveProceedings of the 13th ACM SIGKDD international conference on Knowledgediscovery and data mining table of contentsSan Jose, California, USASESSION: Industrial and government track short papersYear of Publication: 2007ISBN: 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 theweb. Moreover, different web sites often provide conflicting information on asubject, 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 informationon many subjects that is provided by various web sites.

We design a general framework for the Veracity problem, and invent an algorithmcalled TruthFinder, which utilizes the relationships between web sites and their information, i.e., a web site is trustworthy if it provides many pieces of trueinformation, and a piece of information is likely to be true if it is provided by manytrustworthy web sites.

Our experiments show that TruthFinder successfully finds true facts amongconflicting information, and identifies trustworthy web sites better than the popular search engines




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 HawaiiInternational Conference onPublication Date: Jan. 2007On page(s): 148a - 148aE-ISBN: 0-7695-2755-8Number of Pages: 148a - 148aLocation: Waikoloa, HIISSN: 1530-1605Digital Object Identifier: 10.1109/HICSS.2007.101Posted 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 usethe service anytime anywhere.

This paper analyses online bank customers', namely Internet and mobile users',diverse electronic channel preferences for requesting account balances. Conjointanalysis is used in order to measure the utility these two groups of customersattach to different attributes of electronic channels.

The results show that the two groups of customers face different needs inconsumption of the service. While mobile users put the greatest attention toflexible service access point, the Internet users value the screen size of a devicethe most.

The results suggest Nokia communicator type of device as an optimal channel for current mobile users, while those currently without experience in mobile bankingshow no interest in devices smaller than personal computer






IEEE BASED

SOFTWARE PROJECTS

Statistical techniques for detecting traffic anomalies

through packet header data

Source IEEE/ACM Transactions on Networking (TON) archiveVolume 16, Issue 3 (June 2008) table of contentsPages 562-575Year of Publication: 2008ISSN: 1063-6692

ABSTRACT

This paper proposes a traffic anomaly detector, operated in postmortem and inreal-time, by passively monitoring packet headers of traffic. The frequent attackson network infrastructure, using various forms of denial of service attacks, have ledto an increased need for developing techniques for analyzing network traffic.

If efficient analysis tools were available, it could become possible to detect theattacks, anomalies and to take action to contain the attacks appropriately beforethey 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 effectivemeans of detecting anomalies close to the source.

We also present a multidimensional indicator using the correlation of port numbersand the number of flows as a means of detecting anomalies.




IEEE BASED

SOFTWARE PROJECTS

Route Reservation in Ad Hoc Wireless Networks

Source IEEE Transactions on Mobile Computing archiveVolume 6, Issue 1 (January 2007)Year of Publication: 2007ISSN: 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 routediscovery, medium access control (MAC) protocol, and pipelining, etc.) for makingRB 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 delayperformance than NRB schemes.

This advantage, however, comes at the expense of lower throughput and goodputcompared to NRB schemes.




IEEE BASED

SOFTWARE PROJECTS

Rateless Forward Error Correction for Topology-

Transparent Scheduling

Syrotiuk, V.R.; Colbourn, C.J.; Yellamraju, S.Networking, IEEE/ACM Transactions onVolume 16, Issue 2, April 2008 Page(s):464 - 472Digital Object Identifier 10.1109/TNET.2007.899018

Summary:

Topology-transparent scheduling for mobile wireless ad hoc networks has beentreated as a theoretical curiosity. This paper makes two contributions towards itspractical deployment: (1) We generalize the combinatorial requirement on theschedules and show that the solution is a cover-free family.

As a result, a much wider number and variety of constructions for schedules existto match network conditions. (2) In simulation, we closely match the theoreticalbound on expected throughput.

The bound was derived assuming acknowledgments are available immediately. Weuse rate less forward error correction (RFEC) as an acknowledgment scheme withminimal computational overhead.

Since the wireless medium is inherently unreliable, RFEC also offers somemeasure of automatic adaptation to channel load. These contributions renewinterest in topology-transparent scheduling when delay is a principal objective.




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 onPublication Date: 11-13 Dec. 2000On page(s): 215 - 222Number of Pages: xiii+446

Meeting Date: 12/11/2000 - 12/13/2000Location: TaipeiDigital Object Identifier: 10.1109/MMSE.2000.897214Posted online: 2002-08-06 23:26:08.0

Abstract

With the popularity of WAP (Wireless Application Protocol), people can do mobilebanking, 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 digitalassistants) used by people to do mobile e-commerce, but different devices acceptdifferent data formats, and this means that we have to transform everythingneeded by these devices into many formats.

In order to resolve this problem, we introduce an XML-based mobile e-commercesolution




IEEE BASED

SOFTWARE PROJECTS

Rate and delay guarantees provided by Clos packet

switches with load balancing


ABSTRACT

The size of a single-hop cross-bar fabric is still limited by the technology, and thefabrics available on the market do not exceed the terabit capacity. A multihop fabricsuch as Clos network provides the higher capacity by using the smaller switchingelements (SE).

When the traffic load is balanced over the switches in a middle stage, all the trafficwould get through the fabric, as long as the switch outputs are not overloaded.However, the delay that packets experience through the Clos switch depends onthe granularity of flows that are balanced.

We examine the maximum fabric utilization under which a tolerable delay isprovided 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 coarsegranularity provide both high fabric utilization and delay guarantees to the mostsensitive applications.

Since no admission control should be performed within the switch, the fast traffic-pattern changes can be accommodated in the proposed scalable architecture.




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, LebanonThis paper appears in: Wireless Communications and Networking, 2003. WCNC2003. 2003 IEEEPublication Date: 16-20 March 2003Volume: 3On page(s): 2015 - 2020 vol.3

Number of Pages: 3 vol.xxxviii+2138ISSN: 1525-3511Digital Object Identifier: 10.1109/WCNC.2003.1200696Posted online: 2003-05-28 14:06:04.0

Abstract

This paper shows an end-to-end application-layer security solution for wirelessenterprise applications using the Java 2 Platform Micro Edition (J2ME). Theproposed solution uses pure Java components to provide end-to-end client

authentication and data confidentiality between wireless J2ME based clients andJ2EE based servers.

This solution can be implemented with the available limited resources of a JavaMIDP device, without any modification to the underlying protocols or wirelessnetwork infrastructure. A mobile banking application is used to illustrate theimplementation of the proposed solution.




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 theIEEE Computer and Communications Societies. Proceedings. IEEEPublication Date: 26-30 March 2000Volume: 1On page(s): 322 - 331 vol.1

Number of Pages: 3 vol.(xxvi+1826)Meeting Date: 03/26/2000 - 03/30/2000Location: Tel AvivDigital Object Identifier: 10.1109/INFCOM.2000.832202Posted online: 2002-08-06 23:06:07.0

Abstract

The end-to-end nature of Internet congestion control is an important factor in itsscalability and robustness. However, end-to-end congestion control algorithms

alone are incapable of preventing the congestion collapse and unfair bandwidthallocations created by applications which are unresponsive to network congestion.

In this paper, we propose and investigate a new congestion avoidance mechanismcalled Network Border Patrol (NBP). NBP relies on the exchange of feedbackbetween routers at the borders of a network in order to detect and restrictunresponsive traffic flows before they enter the network.

The NBP mechanism is compliant with the Internet philosophy of pushingcomplexity toward the edges of the network whenever possible. Simulation resultsshow that NBP effectively eliminates congestion collapse, and that, whencombined with fair queueing, NBP achieves approximately max-min fair bandwidthallocations for competing network flows






IEEE BASED

SOFTWARE PROJECTS

Ranked Reverse Nearest Neighbor Search

Lee, K.C.K.; Baihua Zheng; Wang-Chien LeeKnowledge and Data Engineering, IEEE Transactions onVolume 20, Issue 7, July 2008 Page(s):894 - 910Digital 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 nearestneighbors 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 querysemantics, 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 whereq 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 mostinfluenced by q, i.e., the t data points having the smallest kappa's with respect toq. To answer this RRNN query efficiently, we propose two novel algorithms, kappa-counting and kappa-browsing that are applicable to both monochromatic andbichromatic scenarios and are able to deliver results progressively.

Through an extensive performance evaluation, we validate that the two proposedRRNN algorithms are superior to solutions derived from algorithms designed for RkNN query.




IEEE BASED

SOFTWARE PROJECTS

Computation efficient multicast key distribution

Lihao XuInformation Theory, 2003. Proceedings. IEEE International Symposium onVolume , 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 areissued 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 yetmaintain at least the same security degree of using symmetric encryptionalgorithms is also discussed




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, USAThis paper appears in: Networking, IEEE/ACM Transactions onPublication Date: Feb. 2004Volume: 12, Issue: 1On page(s): 173 - 186ISSN: 1063-6692Digital Object Identif ier: 10.1109/TNET.2003.820248Posted 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 algorithmsalone, however, are unable to prevent the congestion collapse and unfairnesscreated 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 theexchange of feedback between routers at the borders of a network in order todetect and restrict unresponsive traffic flows before they enter the network, therebypreventing congestion within the network.

Moreover, NBP is complemented with the proposed enhanced core-stateless fair queueing (ECSFQ) mechanism, which provides fair bandwidth allocations tocompeting flows. Both NBP and ECSFQ are compliant with the Internet philosophyof pushing complexity toward the edges of the network whenever possible.

Simulation results show that NBP effectively eliminates congestion collapse andthat, when combined with ECSFQ, approximately max-min fair bandwidthallocations can be achieved for competing flows.




IEEE BASED

SOFTWARE PROJECTS

Quiver: Consistent and Scalable Object Sharing for Edge

Services

Reiter, M.K.; Samar, A.Parallel and Distributed Systems, IEEE Transactions onVolume 19, Issue 7, July 2008 Page(s):878 - 889Digital 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 mutableobjects. Quiver enables these proxies to perform consistent accesses to sharedobjects by migrating the objects to proxies performing operations on those objects.

These migrations dramatically improve performance when operations involving anobject 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 theproxies and saving the costs of sending operation parameters over the wide areawhen these are large. Quiver also supports optimizations for single-object readsthat do not involve migrating the object.

We detail the protocols for implementing object operations and for accommodatingthe addition, involuntary disconnection, and voluntary departure of proxies. Wealso evaluate Quiver through experiments on PlanetLab. Finally, we discuss theuse of Quiver to build an e-commerce application and a distributed network trafficmodeling service.




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 onVolume 18, Issue 4, April 2007 Page(s):562 - 575Digital 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 signaturescheme that allows a threshold (t) or more group members to collaboratively signan arbitrary message.In contrast to threshold group signatures, the individual signers do not remainanonymous, but are publicly identifiable from the information contained in the validthreshold-multisignature.

The main objective of this paper is to propose such a secure and efficient

threshold-multisignature scheme. The paper uniquely defines the fundamentalproperties of threshold-multisignature schemes and shows that the proposedscheme 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 itscounterparts. The paper also proposes a discrete logarithm based distributed-keymanagement infrastructure (DKMI), which consists of a round optimal, publiclyverifiable, distributed-key generation (DKG) protocol and a one round, publiclyverifiable, distributed-key redistribution/ updating (DKRU) protocol.

The round optimal DKRU protocol solves a major problem with existing secretredistribution/updating schemes by giving group members a mechanism to identifymalicious or faulty share holders in the first round, thus avoiding multiple protocol

executions




IEEE BASED

SOFTWARE PROJECTS

Towards Practical Network-to-Network Congestion Control

Riihijarvi, J. Lili Wu Mahonen, P.RWTH Aachen University, Aachen, GermanyThis paper appears in: Networking, International Conference on Systems andInternational Conference on Mobile Communications and Learning Technologies,2006. ICN/ICONS/MCL 2006. International Conference onPublication Date: 23-29 April 2006On page(s): 53 - 53

Digital Object Identifier: 10.1109/ICNICONSMCL.2006.214Posted online: 2006-05-08 09:30:21.0

Abstract

We discuss the use of congestion control mechanisms at the network edges tocomplement traditional end-to-end congestion control. We argue that suchmechanisms will be necessary in the future to deal with unresponsive and evenmisbehaving traffic flows.

A flexible congestion control architecture is presented, together with concreteprotocol designs building on the Network Border Patrol proposal.

More precisely, we show how to integrate flexible flow aggregation and connectionadmission control mechanisms into the NBP framework, together withimprovements to the original scheduling mechanism. Performance evaluation usingthe ns-2 simulator is presented, and possibilities for future enhancements andopen issues are also discussed.

Ncct - Ieee Software Abstract Collection 2

Documents