NCCT-2011 Java IEEE Software Project Abstracts, 2011-2012

NCCT
Promise for the Best Projects
IEEE PROJECTS 2011-12 JAVA Projects
IEEE TR ANSAC TION S ON MOBILE C OMPUTIN G, A PR IL 2011
DYNAMIC TIME SLOT PARTITIONING FOR MULTIMEDIA TRANSMISSION IN TWO-HOP CELLULAR NETWORKS
ABSTRACT In recen t years , there has been an e xponen tial i ncrease i n the number o f mobile phone users. In addition, a signi fican t grow th in the demand for high -ra te multimedia services o ve r wire less networks , such as video con fere ncing , multimedia streaming , etc., was no ted . Differen t solutions were p roposed to support high -quali ty high da ta rate de li very to mobile users, including resource allo ca tion techniques for packe t-radio-based ne xt gene ra tion cellula r n etwo rks. In this paper, an effi cien t time slot allocation method D ynamic Time Slot Partiti oning (D TSP) alg ori thm based on statisti cal multiple xing is proposed fo r a two-hop cel lular arch ite cture . In D TSP, the a vailable bandwid th resources a re increased b y partitioning each time slot into seve ral minislots wherein differen t numbers of minislots are allo ca ted to di fferen t users. The D TSP algori thm is based on asynchro nous time-di vision multipl e xing , wherein users with variab le number of packe ts in their bu ffe rs can tra nsmit data sequentiall y wi thou t an y loss in the o ve rall a vail able resources . The ke y ad van tage o f D TSP is tha t i t can fle xibl y adap t to di ffe ren t quali ty o f servi ce requirements , especiall y when combined wi th adap ti ve modulati on. It has been observed tha t th e sys tem capaci ty a chie ve d b y the D TSP algorithm in the downlink mode using adapti ve modulation is up to 41 pe rcen t highe r tha n when existing solutions a re emplo yed . In addi tion , DTSP results in significan tl y lo wer time for da ta transmission than the state-o f-the -art regi on an d time pa rtitio ning te chniques.
INDEX TERMS Ad apti ve modula tion , cluster-based design , d yn amic time slot parti tioning , statisti cal mul tiple xi ng, time-di vision multiple access, two-hop.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

www.ncct.in, www.ieeeprojects.net, ncctchennai@gmail.com
#109, 2nd Floor, Nungambakkam High Road, Nungambakkam, Chennai 600 034 Near Ganpat Hotel, Above IOB, Next to ICICI
NCCT
IEEE TR ANSAC TION S ON MOBILE C OMPUTIN G, MARCH 2011
EFFICIENT LOCATION TRAINING PROTOCOLS FOR HETEROGENEOUS SENSOR AND ACTOR NETWORKS
ABSTRACT In this work, we co nsider a large-scale geog raphic a rea popula ted b y tin y sensors and some more powerful de vi ces called a cto rs, au tho ri zed to organi ze the sensors in their vi cini ty into short-li ved , acto r-centric sensor networks. The tin y sensors run on miniatu re n onrechargeable ba tteries, are anon ymous, and a re unaware of their lo ca tion. The sensors diffe r in thei r abil ity to d ynamicall y al ter thei r sleep times. Indeed , the p eriodi c sensors ha ve sleep periods o f prede fined leng ths, established a t fabri ca tion time; b y con trast, the free sensors can dynamicall y alte r thei r sleep periods, under p rogram con trol . The main con trib ution of this work is to p ropose an energ y-e fficien t lo ca tion trainin g pro tocol fo r hete rogeneous actor-cen tri c sensor netwo rks where the sensors acquire coarse-grain lo ca tion aware ness with respect to the acto r in thei r vi cini ty. Our theoreti cal anal ysis, confi rmed b y e xpe rimental e valua tion , shows that the proposed pro tocol ou tperforms the best p re viousl y known loca tion tra ining proto cols in terms of the number o f sleep/awa ke transitions, o verall sensor awake time, and energ y consumption . INDEX TERMS Sensor and acto r ne tworks , hete rogeneous sensors, coarse-grain locali za tion , locatio n tra ining pro tocols , lo cali zatio n p ro tocols.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
IEEE TR ANSAC TION S ON MOBILE C OMPUTIN G, JUN E 2011
CROSS-LAYER OPTIMIZATION FOR MULTIMEDIA TRANSPORT OVER MULTICODE CDMA NETWORKS

ABSTRACT Mos t pre vious work on code di vision multiple access (CD MA) considers the bit error ra tio (BER) at th e ph ysical la ye r and the frame d rop ratio (FDR) a t the medium access control la yer separa tel y. Howe ve r, a be tte r system performance , e.g ., i n te rms of a lower o verall frame loss ratio (FLR), can be achi e ved i f BER and FDR are join tl y op timi zed . In this paper, we propose a cross-la yer optimiza tion scheme called trafficadapti ve scheme for multicod e CD MA ope ra ting o ve r a time di vision multiple access (TD MA) channel . Based on the tra ffic condi tion and bu ffer s tatus , th is scheme employs a Marko v Decision Process (MD P) to de termine the op timal value o f the ma ximum number of simultaneous da ta frames tha t can be transmitted in each time slot o f a TD MA frame so as to minimi ze th e o verall FLR o f the s ystem. To faci lita te implementati on, we also p ropose an a ppro ximation scheme named the ra te adap ti ve scheme to reduce the computa tion cos t. Simula tion and anal yti cal resul ts show that bo th the tra ffic-adap ti ve scheme and ra te-ad apti ve scheme can significan tl y redu ce FLR , increase th e s ystem th roughpu t, and optimi ze the pa cke t access dela y of the s ystem. Furthermore , the ra te-adap ti ve scheme can a chie ve a perfo rmance close to the tra ffic-adap ti ve scheme when the tra ffi c load in the s ystem is hi gh. INDEX TERMS Mu ltimedia communication, wi reless, multi code code di vision multi ple a ccess.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
EFFECTIVE SCHEDULING IN INFRASTRUCTURE-BASED COGNITIVE RADIO NETWORKS

ABSTRACT In this paper, we in vestiga te a joint scheduling and powe r con trol for an infrastructu re-based cogni ti ve rad io netwo rk (CRN ) in coe xisten ce with a cellula r primary radio ne two rk (PRN). The PRN uses a set of li censed nono verla pping orthogo nal frequency channels fo r transmission. This set o f chann els is also accessed in an opportunistic manner b y a set o f cogniti ve radio base stati ons (CR-BSs) to support seconda ry users (SUs). The problem is fo rmulated to ma ximi ze the spectrum uti li za tion of SUs wi thou t causing e xcessive in te rfe rence to a cti ve primary users (PUs) of the PRN . In addition , all the serviced SUs must meet a ce rtain Quali ty o f Servi ce (Qo S), such as satisfying a prede fined signal to in te rfe rence noise ra tio (SINR ). A cen trali zed solution for join t schedu ling and pow er control is deri ved to make the glo bal a ccessing decision for all unserved SUs. Wi th the assumption tha t the knowledge o f all subscribers is a vailable , a coo rdina tor o f the CRN can use the joint schedul ing and power con trol algori thm to ma ximi ze the spectrum utili za tion of serviced SUs b y sol ving a mixed -in teger linea r programming (MILP) wi th an NP-hard comple xity. To a void the NP-hard comple xi ty, we propose a subop timal heuristi c greed y algorithm tha t can be ob tained a t a much lo wer comple xi ty based on the colo ring interfe rence graph among unserved SUs e ffe cted b y servi ced SUs and a cti ve PUs. Its superior pe rfo rmance o ve r the e xis ting algorithms is demonstrated through simulations. INDEX TERMS Cogniti ve radio , opportunistic spectrum alloca tion , scheduling, powe r con trol , interfe rence gra ph.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
DESIGN AND PERFORMANCE ANALYSIS OF MOBILITY MANAGEMENT SCHEMES BASED ON POINTER FORWARDING FOR WIRELESS MESH NETWORKS
ABSTRACT We p ropose effi cien t mobility management schemes based on poin te r forwa rding for wi reless mesh networks (WMNs) wi th th e objecti ve to redu ce the o ve rall network traffi c i ncurred b y mobility managemen t an d pa cke t deli ve ry. The proposed schemes are per-user-based , i.e ., the op timal th reshold of the forwa rding chain leng th tha t minimi zes the o veral l ne twork tra ffic is d ynamicall y determined fo r each indi vidu al mobile user, based on the users specific mobility and servi ce patte rns. We de velop anal yti cal models based on stochastic Petri nets to e valu ate the perfo rmance o f the p roposed schemes. We demonstra te that the re e xists an optimal threshold of the forw arding chain leng th , gi ven a set of parameters characte ri zing the specifi c mobility and servi ce pa tte rns o f a mobile user. We also demonstrate that ou r schemes yield significa ntl y bette r performance than schemes that appl y a sta ti c threshold to all mobile users. A compara ti ve an al ysis shows that our poin ter forwa rding schemes outperform rou ting-b ased mobility management protocols for WMNs, especiall y for mobile In terne t applications characte ri zed b y la rge traffic as ymmetry fo r whi ch the downl ink pa cke t a rri val rate is much highe r than the uplink pa cke t arri val ra te . INDEX TERMS Mo bility management, poin te r forwa rding , wireless mesh networks, pe rfo rmance anal ysis, sto chastic Petri net.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
A COOPERATIVE CLUSTERING PROTOCOL FOR ENERGY SAVING OF MOBILE DEVICES WITH WLAN AND BLUETOOTH INTERFACES
ABSTRACT One o f the most widel y used wireless communication standards is a Wi reless Local Area Ne two rk (WL AN) (IEEE 802 .11). Howe ver, WL AN has a serious power consumption problem . In this paper, we p ropose a no vel ene rg y sa ving approa ch tha t e xpl oits the multi radio fea ture o f re cen t mobile de vi ces equipped w ith WL AN and Blu etoo th in terfa ces. Unlike pre vious approaches, ou r work is based on clustering . In ou r work, a cluster is a Bluetoo th Personal Area Ne twork (PAN ), whi ch consists of one cluster head and seve ral regular nodes. The cluster head acts as a gatewa y between the PAN and the WL AN , enabling the regula r nodes to access the WL AN infrastructu re via low-pow er Blue too th . We present a distri buted clusterin g protocol , Coopera ti ve Netwo rking proto col (CON ET), which d ynamicall y re fo rms clusters acco rding to ea ch nodes bandwidth requiremen t, e nerg y use , and appli catio n type . CON ET d oes not require modifi ca tions of e xisting wi reless infrastru ctures because clusteri ng is perfo rmed indepe ndentl y of WL AN a ccess poin ts. We implemented the C ONET proto type with four wea rable compu ting de vi ces to evaluate the performance on real hardwa re . We also simulated CONET fo r large networks of more than 100 mobile nodes. Both results demonstra te that ou r approach is e ffecti ve in reducing the power consumption o f WL AN . INDEX TERMS Wireless communication , pro tocol a rchi te ctu re , multiradi o, ene rg y e fficien cy, clustering .
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
AUTONOMOUS DEPLOYMENT OF HETEROGENEOUS MOBILE SENSORS

ABSTRACT In this pape r, we add ress the p roblem o f deplo ying hete rogeneous mobile sensors over a targe t area . Tradi tional approa ches to mobile sensor deployment are specificall y designed for homogeneous netwo rks. Ne vertheless, netwo rk and de vice homogenei ty is an unreal istic assumption in most p ractical scenarios, and pre vious ap proaches fail w hen adopted in he te rogeneous ope ra ti ve settings. For this reason, w e introduce VorL ag, a generali za tion o f th e Voronoi-based approach whi ch e xp loits the Laguerre geometry. We theore tical l y pro ve the appropria teness o f ou r proposal to the management of he tero geneous ne tworks. In addi tion , we demonstra te tha t Vo rLag can be e xtend ed to deal wi th dynamicall y gene rate d e ven ts or une ven ene rg y deple tion due to communications. Finall y, b y means of simulations, we show tha t Vo rLag pro vides a very s table sensor beha vior, wi th fast and guaran teed te rmination and moderate energ y consumption. We also show that VorLag perfo rms better than its traditional counte rpart and o ther methods based on vi rtua l forces. INDEX TERMS De vice he terogen eity, self-deplo ymen t, Vorono i-Lague rre diag rams.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
A CONTROL-THEORETIC APPROACH TO DISTRIBUTED OPTIMAL CONFIGURATION OF 802.11 WLANS

ABSTRACT The op timal config ura tion o f the con ten tion pa ramete rs of a WL AN depends on the ne twork conditions in te rms of number o f sta tions and the tra ffic the y generate. Following this observation, a considerable e ffo rt in the li tera ture has been de vote d to the design of distribu ted algo ri thms that optimall y con figure the WL AN pa rameters based on cu rren t condi tions. In this paper, we propose a no vel algo rithm th at, in con tras t to pre vious proposals which are mostl y based on heu ristics, is sustained b y mathematical found ations from multi variable con trol theory. A ke y ad van tage o f the algorithm o ver e xisting approaches is that it is compliant with the 802 .11 sta ndard a nd can be implemented with curre nt wi reless cards withou t in trod ucing an y chang es into the hardware or firmware . We stud y the pe rfo rmance of o ur prop osal by means of theore ti cal anal ysis, simulations, and a real implementa tion . Results show tha t the algo rithm substantiall y ou tperfo rms pre vious a pproa ches in terms of throug hput and dela y. INDEX TERMS Wireless L AN , IEEE 80 2.11 , DCF, ad apti ve multi variabl e con trol theory.
MAC , distribu ted algo ri thm,
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
ADAPTIVE LOCATION-ORIENTED CONTENT DELIVERY IN DELAY-SENSITIVE PERVASIVE APPLICATIONS

ABSTRACT In this paper, we in trod uce a del a y-sensiti ve service th at i n vol ves transmitting large amounts of loca tion-based data to nodes at multiple loca tions. Gi ven a limited amount o f access points (APs) and an ab undance o f service re quests tha t result from the n odes moving a round , a typi cal con ten t deli very service would ine vita bl y in trodu ce considerable dela y. To solve this problem, we anal yze the movemen t pattern o f mobile nodes and appro ximate it as a semi-Ma rko v pro cess. Based on this model, we e xplo re differen t componen ts of the unde rl ying service dela y an d propose tha t APs should use a multicas t stra teg y to minimi ze th e qu euing dela y componen t. Furthermore , we demonstra te the feasibility o f emplo ying nodes, which alread y ha ve thei r own local copies of loca tion -rele van t data , to rela y such data to othe r nodes b y emplo ying one or multiple communication chann els. Lastl y, we e xamine the resulting algo ri thms and stud y thei r performance re lati ve to baseline content-deli ve ry schemes th rough simulations. INDEX TERMS Locatio n-depende nt networks.
and
sensiti ve,
pervasi ve
computing ,
wireless
sensor
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
A DISTRIBUTED AND SCALABLE TIME SLOT ALLOCATION PROTOCOL FOR WIRELESS SENSOR NETWORKS
ABSTRACT There are performance de ficien cies tha t hamper the deplo ymen t of Wi reless Sensor Ne tworks (WSNs) in critical monitorin g appli ca tions. Such applications are characte ri zed b y considera ble netwo rk load genera ted as a result of sensing some characteristics o f th e moni tored s ystem. Excessi ve packet collisions lead to packe t losses and retransmissions, resulting in significan t o verhead costs and laten cy. In order to address this issue, we introdu ce a distribu ted and scalable scheduling access scheme that mitigates high data loss in data-in tensi ve sensor ne tworks and can also handle some mobility. Our approa ch alle via tes tra nsmission collisions by emplo yi ng vi rtual grids tha t adopt La tin Squares cha racteristics to time slot assignments. We show tha t ou r algorithm deri ves confli ctfree time slot alloca tion schedules withou t incurring global o verhead in scheduling . Furthermore , we veri fy the e ffe cti veness of our protocol b y simulation experiments. The resul ts demonstrate that ou r te chnique can e fficien tl y h andle sensor mobility wi th accep table da ta loss, lo w pa cke t dela y, and low o ve rhead . INDEX TERMS Access scheduling, wireless topolog y changes.
sensor netwo rks, d ata -in tensi ve appli ca tions,
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
IEEE TR ANSAC TION S ON MOBILE C OMPUTIN G, MAY 2011
DESIGN AND PERFORMANCE OF AN OPTIMAL INERTIAL POWER HARVESTER FOR HUMAN-POWERED DEVICES
ABSTRACT We present an empirical stud y o f the long-te rm practi cali ty of using human motion to genera te op era ting powe r for bo d ymounted consumer electronics and health sensors. We ha ve collected a large con tinuous acceleratio n data set from eight e xpe rimental subjects going about the ir normal dail y rou tine for three da ys each. Each subject is instrumented wi th a d ata collection ap para tus tha t simultaneousl y logs 3-axis, 80 H z accelera tion da ta from si x bod y locations . We use th is data set to optimi ze a fi rstprin ciples ph ysical model of the commonly used velo city damped resonant genera to r (VDRG) b y selecting ph ysi cal parame ters such as resonant frequen cy and damping coeffi cien t to ma ximi ze the ha rvested powe r. Our results show that with reasonable assumptions on size, mass, placement, and effi ciency o f VDR G ha rveste rs, most b od y-moun ted wi reless sensors and even some consumer electronics de vices can be powered con tinuousl y and indefini tel y from e ve ryda y moti on. We ha ve op timi zed the p ower ha rvesters fo r ea ch indi vidual an d for ea ch bod y locatio n. In addi tion, we present the po ten tial o f designing a damping- and frequen cy-tunable pow er ha rvester tha t could mi tigate the powe r reduction of a generator genera li zed for a verage subjects. We presen t the full de tails on the colle ction of the a ccele ra tion da ta sets, the de velopment o f the VDR G model, and a numerical simulator, and discuss some of the fu ture ch allenges tha t remain in this p romising field o f research. INDEX TERMS Human power harvesting , inertial gene ra tor, op timal design, tunable gene ra tor, human-powered de vi ce.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
ENDPOINT-BASED CALL ADMISSION CONTROL AND RESOURCE MANAGEMENT FOR VOWLAN

ABSTRACT This paper e xamines two specifi c aspects of resource management in Wi reless Local Area Ne two rks (WL ANs)Call Admission Control (C AC ) and handling o f Link Ad apta tion (L A) e ven ts. A self-consisten t s ystem to manage these for Voi ce over In te rne t Pro toco l (Vo IP) o ver an IEEE 802 .11 WL AN is presen ted. The p roposed C AC scheme is based on the Endpoin t Admission Control (EAC ) paradigm, where th e endpoints probe the ne twork to dete rmine if the call can be supported wi th a ccep table Quali ty o f Service (Qo S). The prop osed scheme was evalua ted on an e xp erimental testb ed and test results show that correct admission decisions were made under various network configu ra tions. The scheme also de termines i f L A has resulted in the s ystem becoming congested and , if so, the voi ce code c of the handset which has undergone L A is adapte d so as to restore the s ystem to its ea rlier sta te , thereb y alle via ting the congestion . The proposed scheme was evalua ted on the e xpe rimental testbed and test results show tha t the code c adap ta tion scheme was very e ffecti ve at o ve rcoming the effe cts of L A for VoIP o ver WL AN . INDEX TERMS Call admission con trol , IEEE 80 2.11 , lin k ada pta tion , Vo IP
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
OPTIMAL STOCHASTIC LOCATION UPDATES IN MOBILE AD HOC NETWORKS

ABSTRACT
We consider the loc ation serv ice in a mobile ad-hoc netw ork ( MA NET) , w here each node needs to maintain its loc ation infor mation by 1) fr equently updating its loc ation infor mation w ithin its neighbor ing r egion, w hich is called neighbor hood update ( NU) , and 2) occas ionally updating its location infor mation to cer tain dis tr ibuted location s erver in the netw ork, w hich is called location s erver update ( LSU). The trade off betw een the oper ation c osts in location updates and the perfor manc e loss es of the target application due to loc ation inacc urac ies ( i.e., application c osts) impos es a cr uc ial question for nodes to dec ide the optimal str ategy to update their loc ation infor mation, w here the optimality is in the sense of minimiz ing the ov erall costs . In this paper, w e dev elop a stochastic s equential dec is ion framew ork to analyz e this problem. Under a Mar kovian mobility model, the loc ation update decis ion problem is modeled as a Mar kov Dec ision Pr ocess ( MDP). We firs t inves tigate the monotonicity pr oper ties of optimal NU and LSU operations w ith res pec t to location inaccurac ies under a gener al cost s etting. Then, giv en a separable cos t struc tur e, w e show that the loc ation update decis ions of NU and LSU can be independently carr ied out w ithout loss of optimality, i.e., a separation pr operty . Fr om the discov ered separation pr operty of the pr oblem str ucture and the monotonicity proper ties of optimal actions, w e find that 1) there alw ays exists a s imple optimal thr eshold-based update r ule for LSU operations ; 2) for NU oper ations, an optimal thr eshold-based update rule exis ts in a low -mobility scenar io. In the c ase that no a pr iori know ledge of the MDP model is available, w e also introduc e a practic al model-free learning appr oac h to find a near- optimal solution for the problem.
INDEX TERMS Locatio n upda te , mobile ad hoc networks , Ma rko v decision pro cesses, leastsquares policy i tera tion
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
MOBILE SAMPLING OF SENSOR FIELD DATA USING CONTROLLED BROADCAST

ABSTRACT Mo bile obje cts can be used to gathe r samples from a sensor field . Ci vilian ve hicles or e ven human beings equipped with proper wireless communication de vices can be used as mobile sinks tha t re trie ve sensor-data from sampling points wi thin a large sensor field . A ke y challenge is how to ga the r the sensor data in a manner tha t is energ y efficien t wi th respect to the sensor nodes that serve as sources of the sensor data . In this paper, an a lgori thmic techni que call ed Band -based Dire ctional Broadcas t is introduce d to con trol the direction of b roadcasts tha t ori ginate from sensor nodes. The goal is to direct each broad cast of sensor data towa rd the mobile sink, thus reducing costl y forwa rding of sensor data pa cke ts. The te chnique is studied b y simulations tha t consider energ y consumption and da ta deli ve rabili ty. INDEX TERMS Sensor da ta sampling, mobile obje ct, directional broad cast, sensor ne tworks .
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
FAST DETECTION OF MOBILE REPLICA NODE ATTACKS IN WIRELESS SENSOR NETWORKS USING SEQUENTIAL HYPOTHESIS TESTING
ABSTRACT Due to the unattende d nature o f wireless sensor networks, an ad ve rsary can captu re and compromise sensor nodes, make replicas of them, and then moun t a va rie ty o f attacks with th ese replicas. These replica node a tta cks are dangerous because the y allo w the a ttacker to le ve rage the compromise of a few nodes to exert con trol o ver much o f the netwo rk. Se veral replica node de tection schemes have been p roposed in th e lite ra ture to defend against such a tta cks in stati c sensor networks . Howe ver, these schemes rel y o n fi xed sensor loca tions and hence do not work in mobile sensor ne tworks, where sensors are e xpected to mo ve . In this work, we p ropose a fast and e ffe cti ve mobile repli ca node detection scheme using the Sequential Prob abili ty Ra tio Test. To the best o f our knowledge , this is the first wo rk to ta ckle the p roblem of repli ca node a ttacks in mobile sensor ne tworks . We show analytica ll y and through simulation exp eriments tha t our scheme detects mobile repli cas in an e ffi cien t and robust manner a t the cost o f reasonable o verheads. INDEX TERMS Replica detection , sequen tial anal ysis, mobile sensor n etwo rks, security.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
MINIMUM BANDWIDTH RESERVATIONS FOR PERIODIC STREAMS IN WIRELESS REAL-TIME SYSTEMS

Reserva tion -based (as opposed to con tention-based) channel a ccess in WL ANs pro vides predi ctabl e and dete rministic transmission and is therefore able to pro vide timeliness guarantees for wireless and embedded real -time applica tions. Also , reserva tion-b ased channel access is energy-effi cien t since a wireless adaptor is powered on onl y during its e xclusi ve chan nel access times. While scheduling for Quali ty o f Se rvi ce at the cen tral autho ri ty (e .g ., base station) has recei ve d e xtensi ve a tten tion , the p roblem of de termining the a ctual resource requirements o f an indi vi dual node in a wireless real-time s ystem has been largel y igno red. This work aims at finding the minimum channel bandwid th reserva tion tha t meets the real-time constrain ts of all periodic s treams of a gi ven node . Keep ing the bandwidth reserva tion of a node to a minimum leads to reduced energ y and resource re quirements and lea ves more bandwid th for fu ture reserva tions b y other nodes . To obtain a solution to the minimum bandwidth reserva tion pro blem, we transform it to a generi c unip rocessor task schedulabili ty pro blem, whi ch is then add ressed using a generic algori thm. This algorithm works fo r a subclass of p riori ty-dri ven packe t scheduling poli cies, includ ing th ree common ones: fi xed-priori ty, ED F, and FIFO. Mo reo ve r, we then speciali ze the generi c algo ri thm to these three policies accordi ng to their speci fic cha racteristics. Their computation comple xiti es and bandwidth reservatio n e fficien cies are e valua ted and guidelines for choosing scheduling poli cies and stream parame ters a re presented . INDEX TERMS Bandwid th reserva tion , schedulabili ty tes t, earl iest deadline fi rst, fi xe d-pri ori ty, first-in-firs t-ou t, medium a ccess con trol , rea l time, wi reless.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
IEEE TR ANSAC TION S ON MOBILE C OMPUTIN G APRIL 2011
ON THE INFORMATION FLOW REQUIRED FOR TRACKING CONTROL IN NETWORKS OF MOBILE SENSING AGENTS
ABSTRACT We design controllers that permit mobile agents with distributed or networked sensing capabilities to track (follow) desired trajectories, identify what trajectory information must be distributed to each agent for tracking, and develop methods to minimize the communication needed for the trajectory information distribution.
INDEX TERMS Cooperative control, dynamical networks, tracking
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
MULTICAST THROUGHPUT FOR HYBRID WIRELESS NETWORKS UNDER GAUSSIAN CHANNEL MODEL
ABSTRACT
We study the multicas t capac ity for hy brid w ireless netw orks cons is ting of ordinary ad hoc nodes and base s tations under Gaussian Channel model, w hich gener aliz es both the unicas t and broadc ast c apac ities for hybr id w ireless netw orks. Assume that all ordinary ad hoc nodes tr ans mit at a constant pow er P, and the pow er decays along the path, w ith attenuation exponent > 2. The data r ate of a trans miss ion is deter mined by the Signal to Interference plus Nois e Ratio ( SINR) at the receiv er as Blog1 SINR. The ordinary ad hoc nodes ar e plac ed in the squar e region Aa of ar ea a acc ording to a Poisson point pr ocess of intens ity n=a. Then, m additional base stations ( BSs) acting as the relaying c ommunication gatew ays are placed regular ly in the region Aa, and are connected by a high- bandw idth w ired netw ork. Let a n and a 1, w e construc t the hy br id ex tended netw ork ( HEN) and hy brid dense netw ork ( HDN), res pec tiv ely. We choos e randomly and independently ns ordinary ad hoc nodes to be the sources of multic ast s ess ions. We assume that eac h multicast sess ion has nd randomly chos en ter minals . Thr ee br oad categor ies of multicast s trategies ar e pr oposed. The f irst one is the hybr id strategy, i.e., the multihop scheme w ith BS-supported, w hich further consis ts of tw o types of strategies c alled connectiv ity s trategy and perc olation str ategy , r espectively. The sec ond one is the or dinary ad hoc strategy, i.e., the multihop scheme w ithout any BS-supported. The third one is the classic al BS-based strategy under w hich any communic ation betw een tw o ordinary ad hoc nodes is r elayed by some spec ific BSs . According to the different scenar ios in ter ms of m, n, and nd, w e select the optimal scheme from the thr ee categories of str ategies, and deriv e the achievable multicas t thr oughput bas ed on the optimal decis ion.
INDEX TERMS Wireless h ybrid ne tworks, wi reless ad hoc ne two rks, mul ticast throughpu t, random ne tworks, multicast capaci ty, Gaussian channel mode
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
ON THE DESIGN OF OPPORTUNISTIC MAC PROTOCOLS FOR MULTIHOP WIRELESS NETWORKS WITH BEAMFORMING ANTENNAS
ABSTRACT
Beamfor ming antennas promise a signif icant increase in the s patial reuse of the w ireless medium w hen deployed in multihop w ireless netw orks. How ever, ex isting direc tional Medium Access Control ( MA C) protocols w ith the default binary ex ponential backoff mechanis m are not capable of fully exploiting the offered potential. In this paper, w e discuss var ious issues involved in the des ign of MA C protoc ols spec ific for beamf or ming antennas . Based on our discuss ion, w e argue that the tr aditional binary exponential backoff mechanis m limits the poss ible spatial r eus e and aggrav ates some beamfor ming-related pr oblems s uch as deafness and headof- line blocking. To gras p the trans miss ion oppor tunities offered by beamf or ming antennas , w e design an Opportunistic Direc tional MA C ( OPDMA C) pr otocol for multihop w ireless netw orks. The OPDMA C protocol employs a novel bac koff mechanis m in w hic h the node is not forced to undergo idle bac koff after a tr ans mission failur e but can rather take the oppor tunity of trans mitting other outstanding pac kets in other dir ections. This mechanis m minimizes the idle w aiting time and increases the channel utiliz ation significantly and ther eby enables OPDMA C to enhance the spatial r eusability of the w ireless medium and reduc e the impac t of the deafness problem w ithout additional over head. Thr ough ex tensiv e s imulations, w e demonstr ate that OPDMA C enhances the perfor mance in ter ms of throughput, delay, packet delivery r atio, and fairness. To further improv e its perfor mance, w e disc uss and evaluate the benef its of carefully choos ing s ome protoc ol parameters instead of using the default v alues commonly used by other direc tional MA C pr otocols.
INDEX TERMS Beamforming an tennas, medium access control , multihop wi reless networks, spatial reuse.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
INTERFERENCE-AWARE ROUTING IN WIRELESS MULTIHOP NETWORKS

ABSTRACT In terferen ce is an inheren t cha racte ristic o f wi reless (multihop) communica tions. Ad ding in terfe rence -awareness to importan t con trol fun ctions, e .g ., rou ting , could significan tl y enhan ce the o ve rall netw ork perfo rmance. Despite some initial efforts, i t is not ye t clea rl y und erstood h ow to best cap tu re the e ffe cts of interfe rence in rou ting proto col design. Mos t e xis ting pro posals aim at inferrin g i ts effect b y acti vel y p robing the link. Howe ver, acti ve p robe measurements impose an overh ead and may o ften misrepresent the link quality due to thei r inte raction with o ther ne tworking functions. There fo re, in this pape r we follow a di fferen t approa ch and : 1) propose a simple yet accura te a nal ytical model for the effect of in terferen ce on data re cep tion pro babili ty, based onl y on passive measurements and informa tion locall y a vailable a t the nod e; 2) use this model to design an efficient inte rferen ce-awa re rou ting p ro tocol tha t perfo rms as well as probing-based protocols, ye t a voids all pitfalls rela ted to acti ve probe measurements. To valida te ou r proposal , we ha ve pe rformed e xperimen ts in a real tes tbed , setup in our indoo r o ffice en vironmen t. We show tha t the anal ytical predi ctions of ou r interfe rence model e xhibi t good match wi th both e xperimental resul ts as well as more complica ted anal yti cal models proposed i n rela ted lite ra ture . Furthermore , we demonstra te tha t a simple probeless routing pro tocol based on our model perfo rms at least as good as well-known probe-based rou ting pro tocols in a large set o f e xpe riments in cluding bo th intra flow and inte rflow inte rferen ce. INDEX TERMS Wireless ne tworks, interferen ce model, in terferen ce-awa re rou ting , rou ting metric.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
MAC LAYER THROUGHPUT ESTIMATION IN IMPULSE-RADIO UWB NETWORKS

ABSTRACT The inhe ren t channel characteristi cs of impulse-based UWB ne tworks affect the MAC la yer perfo rmance significan tl y. Most pre vious studies on evaluating MAC proto cols are based on p rolonged simulations and do no t a ccoun t for the mul tiple access inte rferen ce d ue to multipa th dela y spread . In th is work, we de velop C TU, an ana l ytical framework fo r Capturing the Through put dependen cies in U WB networks , while ta king in to account the PH Y la yer e ffe cts . The ke y a ttribu tes o f C TU are : 1) It is modular; i t can b e easil y modified to p ro vide a b asis for e valua ting a wide range of MAC pro tocols fo r impulse-based UWB networks. Th e onl y requirements are tha t the MAC pro to col under stud y be based on timehopping and the modulation scheme be pulse position modula tion ; these are common design decisions in U WB ne tworks. 2) It considers the channel chara cteristi cs in addition to MAC la yer effe cts; C TU correla tes pro babilisticall y the mul tipa th dela y pro file of th e chann el wi th the packe t error ra te . We emplo y C TU to e valua te the performance o f di fferen t generic medium access procedu re . We compare the results wi th those from e xtensi ve simulations and show the high accura cy o f C TU . We use C TU to assess the impact o f va rious system parameters on the MAC la yer pe rformance ; we make se veral in teresting observa tions tha t are discussed in dep th . INDEX TERMS Ultrawi de band (UWB), wireless modulation.
communications, multipath dela y spread ,
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
TRAFFIC-DIFFERENTIATION-BASED MODULAR QOS LOCALIZED ROUTING FOR WIRELESS SENSOR NETWORKS

ABSTRACT A new lo cali zed quali ty o f service (Qo S) rou ting p ro tocol for wi reless sensor networks (WSN ) is proposed in this paper. The proposed p roto col ta rgets WSNs applica tions ha ving di fferen t types o f da ta tra ffic. It is based on di ffe ren tia ting QoS requirements acco rding to the da ta type , wh ich enab les to p ro vide se ve ral and cus tomized Qo S me trics fo r each tra ffic ca tego ry. Wi th each packe t, the pro to col attempts to ful fill the required data -rela ted Qo S metric(s) while considering p ower e ffici ency. It is modular and uses geographi cal informa tion, which eliminates the nee d o f propaga ting routin g in formati on. Fo r link quali ty estimatio n, the pro to col emplo ys distribu ted , memory and computa tion efficien t mechanisms. It uses a multisink single-path approa ch to increase reliabil ity. To our knowledge , this pro tocol is the fi rst tha t makes use of the di versi ty in da ta traffic while considering la tency, reliabili ty, residual energ y in sensor nodes, and transmission power b etwe en no des to cast Qo S metri cs as a multiobje cti ve prob lem. The proposed pro tocol can opera te with an y medium access control (MAC ) proto col , p ro vid ed tha t it emplo ys a n a cknowl edgment (ACK) mechanism. Extensi ve simulation stud y wi th scena rios of 900 nodes shows the proposed proto col ou tpe rfo rms all comparable s tate -o f-the-a rt QoS and local i zed rou ting proto cols. Mo reo ve r, the pro to col has been implemented on sensor motes and tested in a sensor ne twork testbed . INDEX TERMS Wireless sensor networks, quali ty o f service , geog raphical routi ng, distribu ted proto cols.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
QOS-AWARE ROUTING AND ADMISSION CONTROL IN SHADOW-FADING ENVIRONMENTS FOR MULTIRATE MANETS
ABSTRACT Pro vidi ng quali ty o f service (Qo S) assurances in a mobile ad h oc ne twork (MAN ET) is difficul t due to node mobili ty, con ten tion for ch annel access, a lack o f centrali zed co-o rdina tion, and the unrel iable nature o f the wire less channel . A QoS-aware rou ting (QAR ) p roto col and an admission control (AC) pro to col a re two o f the most importan t components of a s ystem attempting to pro vide Qo S guarantees in the face of the abo ve mentioned di ffi cul ties faced . Man y QAR and AC -based solutions ha ve been proposed , but such ne twork la ye r solutions are often d esigned and studie d wi th ideali zed lower la yer models in mind . This means tha t e xisting solutions are no t designed fo r dea ling wi th pra cti cal phenomena such as shadow fading and the link quali ty-dependen t fluctua tion o f link tra nsmission rates. This paper proposes and evalua tes new solutions for improvi ng the pe rfo rmance of QAR and AC p roto cols in the fa ce o f mobility, shadowing, and varying link SINR . It is fou nd tha t pro acti vel y main taining ba ckup ro utes fo r acti ve sessions, adapting transmission rates, and routi ng arou nd temporaril y low-SINR lin ks can noticea bl y impro ve the reliabil ity o f assured thro ughpu t services. INDEX TERMS Mu lti ra te mobile ad hoc ne tworks, quali ty o f service aware rou ting , admission control , shadowing /shadow fadi ng, gua ran teed th roughpu t.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
PROCESSING CONTINUOUS RANGE QUERIES WITH SPATIOTEMPORAL TOLERANCE

ABSTRACT Continuous queri es are often emplo yed to monitor the lo ca tions of mobile obje cts (MOs), which a re dete rmined b y sensing de vices like GPS recei vers. In this paper, w e tackl e two ch allenges in p rocessing con tinuous range queries (CRQs): coping wi th d ata unce rta inty inhe ren tl y associa ted wi th lo ca tion da ta , and reducing the ene rg y consumption of ba ttery-powe red MOs. We prop ose the concep t o f spatio temporal tole rance fo r CR Q to rela x a que rys accuracy requirements in terms of a maximal accep table erro r. Unlike pre vious works, our defini tion considers to leran ce in b oth th e spatial and temporal d imensions, which offers applica tions more fle xibili ty in specifying their indi vidu al accuracy requirements . As we will show , these toleran ce bounds can p ro vide well-de fined query semantics in spite of diffe rent sources of da ta unce rta inty. In addi tion , we present efficien t al gori thms tha t ca re full y con trol when a n MO should sense or repo rt a locatio n, while satis fying these toleran ces. Thereb y, we particularl y reduce the number of position sensing operations substantiall y, whi ch consti tu te a considerable source o f en erg y consumption . Extensi ve simulations con firm that the proposed algo ri thms result in larg e energ y savings compared to non tole ran t que ry processing. INDEX TERMS Tra cking mobile objects, contin uous uncertain ty, energ y consumption .
queries, distrib uted p rocessing, da ta
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
SCALABLE LOCALIZATION WITH MOBILITY PREDICTION FOR UNDERWATER SENSOR NETWORKS

ABSTRACT Due to harsh aqueous environmen ts, non-negligibl e node mobility and large network scale, lo cali zation fo r large -scale mobile underwa ter sensor netwo rks is ve ry challenging . In this paper, b y u tili zing th e predi ctab le mobility patte rns of underwa ter obje cts, w e propose a scheme, called Scalable L ocali zatio n scheme with Mobili ty Predi cti on (SL MP), for unde rwate r sensor ne tworks. In SL MP, locali za tion is perfo rmed in a hiera rchi cal wa y, and the whole locali za tion p rocess is divided into two parts: anchor node l ocali zatio n and ordinary node locali za tion . During th e locali za tion pro cess, eve ry node predi cts its futu re mobility pa ttern according to its past known locati on info rmation , and it can estimate its fu tu re lo ca tion based on the predi cte d mobili ty pa ttern . An chor nodes with known loca tions in the ne two rk will con trol the locali za tion process in order to balance the trade-off be tween locali zation accura cy, locali za tion co verage , and communica tion cost. We co nduct e xtensi ve simulations , and ou r resul ts show tha t SL MP can g reatl y reduce loca li za tion communication cost while maintain ing rela ti vel y high locali za tion co verage and lo cali za tion a ccura cy. INDEX TERMS Network arch ite cture and design, ne twork communications , netwo rk pro to cols, applica tions, miscellaneous, lo cali zatio n, unde rwa ter sensor ne tworks.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
SECURE HIGH-THROUGHPUT MULTICAST ROUTING IN WIRELESS MESH NETWORKS

ABSTRACT Recent wo rk in multi cast rou ting for wirel ess mesh networks has focused on metrics tha t estima te link qua lity to maximi ze th roughpu t. Nodes must collabora te in order to compu te the pa th metri c and forwa rd data . The assumption that all nodes are honest and beha ve correctl y during me tri c computa tion , p ropaga tion , and aggrega tion , as well as during da ta forwa rding , leads to une xp ected consequences in adve rsarial ne tworks where compromised nodes act maliciously. In this work, we iden ti fy no vel a ttacks against high throu ghput multicast pro tocols in wireless mesh networks. The atta cks e xploi t the lo cal estimatio n and global aggrega tion o f the metri c to all ow a ttackers to a ttract a large amount o f tra ffic. We show tha t these a tta cks are ve ry e ffe cti ve against mul ticast p roto cols based on high -th roughpu t metri cs. We con clude that a ggressive pa th selection is a double-edg ed sword: While i t maximi zes throu ghput, i t also increases attack e ffecti veness in the absence of defense mechanisms. Our approa ch to de fend against the identi fied a ttacks combines measurement-based dete ctio n and accusation-based re action techniq ues. The solu tion a ccommodates transient ne twork varia tions and is resilient against a ttempts to e xploi t th e de fense mecha nism itself. A de tailed secu rity anal ysis of our de fense scheme establishes bounds on the impact of atta cks. We demonstrate bo th the a tta cks and our defense using OD MR P, a representa ti ve multicast p rotocol for wire less mesh networks, and SPP, an adap tati on o f the well-known ETX unicast me tric to the mul ticast setting . INDEX TERMS Wireless mesh networks, high -throughpu t metrics, secu re multicast rou ting , metric manipulati on a ttacks, Byzan tine atta cks.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
THROUGHPUT OPTIMIZATION IN MOBILE BACKBONE NETWORKS

ABSTRACT This paper describes new algori thms for throughpu t op timi zati on in a mobile backbone ne twork. This hiera rchi cal communication framework combines mobile backbone nodes, whi ch ha ve superior mobili ty and communication capabili ty, wi th regular nodes, whi ch are constrained in mobility a nd communication ca pabili ty. An important quan tity o f in teres t in mobile ba ckbone netw orks is th e number o f regular nodes tha t can be successfull y assigned to mobile backbone nodes at a gi ven th roughpu t le vel . This paper de velops a no vel tech nique fo r ma ximi zing this quanti ty in ne tworks of fi xed regula r nodes using mixed-in teger linea r programming (MIL P). The MILP-based algori thm pro vides a significan t reduction in computa tion time compared to e xis ting methods and is computationall y tractable for problems of moderate si ze. An appro ximation algo rithm is also developed tha t is appropria te for largescale p roblems. This paper presents a theore tical performance gua rantee for the appro xima tion algorithm and also demonstrates its empirical performance . Finall y, the mobile backbone ne two rk problem is e xtend ed to in clude mobile regula r nodes, and exact a nd a ppro ximate solution algo rithms are p resented for this e xtension . INDEX TERMS Wireless sensor ne two rks, mobile communication s ystems.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
SUPPORTING EFFICIENT AND SCALABLE MULTICASTING OVER MOBILE AD HOC NETWORKS

ABSTRACT
Gr oup communications are important in Mobile Ad hoc Netw orks ( MA NETs) . Multicast is an effic ient method for implementing group communic ations. How ever, it is challenging to implement efficient and scalable multic ast in MA NET due to the difficulty in gr oup membership management and multicas t pac ket forw arding over a dy namic topology. We propos e a nov el Effic ient Geogr aphic Multicast Pr otocol ( EGMP). EG MP uses a virtual-z one-based str ucture to implement sc alable and efficient group membership management. A netw orkw ide zone-based bidir ectional tr ee is constr ucted to achiev e mor e efficient membership management and multicas t delivery . The pos ition infor mation is us ed to guide the zone s truc tur e building, multicast tree constr uction, and multicast pac ket forw arding, w hich effic iently reduces the over head for route searching and tree str uctur e maintenance. Sever al s trategies have been pr oposed to fur ther improv e the efficiency of the pr otocol, for ex ample, introduc ing the c onc ept of zone depth for building an optimal tr ee str ucture and integrating the location search of group members w ith the hier archical gr oup members hip management. Finally, w e design a scheme to handle empty zone pr oblem faced by most r outing protocols us ing a z one str ucture. The scalability and the effic iency of EGMP ar e evaluated through s imulations and quantitative analys is. Our simulation res ults demonstr ate that EGMP has high pac ket deliv ery ratio, and low contr ol over head and multicas t group joining delay under all test scenar ios , and is scalable to both gr oup siz e and netw ork s ize. Compared to Scalable Position-Based Multic ast ( SPBM) [20], EGMP has signif icantly low er control over head, data trans miss ion over head, and multic ast gr oup joining delay .
INDEX TERMS Routing , wireless ne tworks, mobile ad hoc ne two rks, multi cast, p ro tocol
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
SPATIAL-TEMPORAL COVERAGE OPTIMIZATION IN WIRELESS SENSOR NETWORKS

ABSTRACT Mission-dri ven sensor ne two rks usuall y ha ve special li fetime requiremen ts. Howe ver, the densi ty o f the sensors may not be large enough to satisfy the co verag e requiremen t while meeting the life time constrai nt a t the same time. Sometimes, co verage has to b e traded fo r ne twork li fe time. In this pape r, we stud y how to sched ule sensors to ma ximi ze thei r co verage during a speci fied network life time. Unlike sensor deplo ymen t, whe re the goal is to ma ximi ze the spatial co ve rage , our objecti ve is to ma ximi ze the spatial temporal co vera ge b y sched uling sensors acti vity a fter the y ha ve been deplo yed . Sin ce the op timi za tion problem is NPhard, we fi rst present a cen trali zed heuris tic whose appro ximation factor is pro ved to be 1 2 , and then , propose a distribu ted pa rallel op timi za tion proto col (POP). In POP, nodes optimi ze their schedules on thei r own but con ve rge to lo cal optimality w itho ut co nfli ct wi th one ano ther. Theore ti cal and simulation results show that POP substan tiall y ou tperforms othe r schemes in terms of ne two rk li fe time, co verage redundan cy, con ve rgence time, and e vent de tection p robabili ty. INDEX TERMS Wireless sensor network, co verage, sensor scheduling, distributed pro tocol , parallel algori thm
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
THE HIDENETS HOLISTIC APPROACH FOR THE ANALYSIS OF LARGE CRITICAL MOBILE SYSTEMS
ABSTRACT Dealing with la rge , cri ti cal mobile systems and infrastructures where ongoing changes and resilience are paramount leads to ve ry comple x and di fficul t challenges for s ystem e valua tion . These challenges call for appro aches tha t are able to in tegra te se veral e valua tion methods for the quan ti tati ve assessment of QoS indi cators which ha ve been applied so far onl y to a l imited e xtent. In this paper, w e propose th e holisti c evaluation framework de velo ped during the recen tl y conclu ded FP6-H IDEN ETS project. It is based on abstracti on and decomposition, and i t e xploi ts the in tera ctions among diffe rent e valua tion te chniques including ana l ytical , simulati ve , and experimenta l measurement approa ches, to manage s ystem comple xity. The fe asibility o f th e holistic app roach for the anal ysis of a complete end-to -end scenario is first i llustra ted p resenting two e xamples where mobility simulation is used in combination wi th s tochasti c anal yti cal modeling , and then th rough the de velopment and implementati on o f an e va luation workflow in tegra ting se ve ral tools and model transforma tion s teps. INDEX TERMS Computer systems organi za tion , communication /ne tworking and informa tion technol og y, mobile computing, mobile communication s ystems, compu ting methodologies, simulation , modeling , and visuali za tion , model de velopment, modeling methodologies, compute r applications , mobile appli catio ns, pervasi ve computing .
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
IEEE/ACM TRANSAC TIONS ON N ETWORK IN G, A PRIL 2011
LICKLIDER TRANSMISSION PROTOCOL (LTP)-BASED DTN FOR CISLUNAR COMMUNICATIONS

ABSTRACT
Delay /disruption- tolerant netw orking ( DTN) technology offers a new solution to highly stressed communic ations in s pac e envir onments , es pec ially those w ith long link delay and frequent link disruptions in deep-space miss ions . To date, little w ork has been done in ev aluating the perfor mance of the available c onv ergenc e layer pr otocols of DTN, espec ially the Lic klider Tr ans miss ion Pr otoc ol (LTP) , w hen they are applied to an inter planetary Internet ( IPN) . In this paper, w e pres ent an ex per imental evaluation of the Bundle Pr otocol ( BP) running over v ar ious conver gence lay er protoc ols in a s imulated cis lunar communic ations env ironment charac ter iz ed by vary ing degr ees of signal propagation delay and data loss. We foc us on the LTP c onv ergenc e layer (LTPCL) adapter r unning on top of UDP/IP (i.e.,BP/LTPCL/UDP/IP) . The perfor manc e of BP/LTPCL/UDP/IP in r ealistic ?le transfers over a PC- bas ed netw ork test bed is c ompared to that of tw o other DTN pr otocol s tac k options , BP/TCPCL/TCP/IP and BP/UDPCL/UDP/IP. A s tatistical method of -test is als o used for analysis of the exper imental r esults. The exper iment res ults s how that LTPCL has a s ignificant perfor manc e advantage ov er Tr ans miss ion Contr ol Protoc ol conver gence layer ( TC PCL) for link delays longer than 4000 ms r egardless of the bit err or r ate ( BER). For a v ery lossy c hannel w ith a BER of around 10, LTPCL has a s ignif icant good put advantage over TCPCL at all the link delay lev els studied, w ith an adv antage of ar ound 3000 B/s for delays longer than 1500 ms . LTPCL has a cons is tently signific ant goodput advantage over UDPCL, around 2500 3000 B/s, at all levels of link delays and BERs.
INDEX TERMSBundle Pro tocol (BP), dela y-toleran t ne tworking (D TN), interpl anetary Inte rne t (IPN), Li cklide r Transmission Proto col con ve rgence la ye r (LTPCL), satelli te communications, Transmission Control Pro to col con vergen ce la yer (TCPCL ).
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
IEEE/ACM TRANSAC TIONS ON N ETWORK IN G, FEBRU ARY 2011
FORWARD CORRECTION AND FOUNTAIN CODES IN DELAY-TOLERANT NETWORKS

ABSTRACT Dela y-tolera nt ad ho c ne two rks le verage the mobility o f rela y nodes to compensate for lack o f pe rmanent conne cti vi ty and thus enable communica tion between nodes tha t are ou t of range of ea ch othe r. To decrease deli ve ry dela y, the info rmation to be deli ve red is replicated in the network. Ou r obje cti ve in this paper is to stud y a class of replica tion mech anisms tha t include coding in o rder to impro ve the p robabili ty of successful deli very within a gi ven time limit. We propose an anal ytical app roach tha t allows to quan tify tradeo ffs between resources and pe rfo rmance measures (energ y and dela y). We stud y the e ffect o f coding on the perfo rmance of the netw ork while op timi zing parame ters tha t go vern routing. Ou r results , based on ?uid app ro ximati ons, are compared to simulations tha t valida te the model . INDEX TERMS Dela y-tolera nt ne tworks (DTNs), fo rward correction , foun tain codes, mobile ad hoc ne two rks.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
FAST SIMULATION OF SERVICE AVAILABILITY IN MESH NETWORKS WITH DYNAMIC PATH RESTORATION
ABSTRACT A fas t simulation tech nique based on importan ce sampling is de veloped fo r the anal ysis of pa th servi ce a vailabili ty in mesh ne tworks with d yn amic pa th restora tion . The method combines the simulation o f the pa th rerou ting algo rithm with a d ynamic path failu re importan ce sampling (DPFS) scheme to estimate path a vaila bilities e ffi cien tl y. In DPFS, the failu re ra tes of ne two rk elemen ts are biased at i ncre ased rates un til path failu res are observed unde r re routing. Th e simulated model uses failu re equi valence groups , wi th fini te /in fini te sources o f failu re e vents and fini te /in fini te pools of repair pe rsonnel, to fa cili tate the modeling o f bi-directional link failu res, multiple in-series lin k cu ts, op ti cal amplifi er failu res along links , node failu res, and more general geog raphi call y distribu ted failu re scenarios. The ana l ysis of a larg e mesh netwo rk e xample demonstra tes the p ractical ity o f the te chnique . INDEX TERMS Availabili ty, biasing, failu re , importance , mesh, model , ne two rk, pa th , res tora tion , risk, sampling, simulation .
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
EFFICIENT MULTIPATH COMMUNICATION FOR TIME-CRITICAL APPLICATIONS IN UNDERWATER ACOUSTIC SENSOR NETWORKS
ABSTRACT Due to the lon g propaga tion dela y an d high erro r ra te of a coustic channels, i t is ve ry challen ging to p ro vide reliab le da ta tra nsfer fo r time-criti cal appl ica tions in an energ y-e fficien t wa y. On the one hand, tradi tional re transmission upon failure usually in trodu ces ve ry large end-to -end dela y and is thus not proper fo r timecri tical servi ces. On the o the r hand, common approaches withou t re transmission consume lots of energ y. In this paper, we propose a new mul tipa th power-con trol transmission (MPT) scheme, whi ch can gua ran tee certain end-to-en d pa cke t e rror ra te while achie ving a goo d balance be tween the o verall ene rg y e fficien cy and the end -to end pa cke t dela y. MPT smartl y combines power con trol wi th multipa th rou ting and pa cke t combining at the destina tion . Wi th ca re full y d esigned power-con trol s tra tegies, MPT consumes much less energy than the con ventional one-pa th transmission scheme withou t re transmission. Besides, since no hop-by-hop re transmission is allowed, MPT in trodu ces much shorter d ela ys than the tradi tiona l one-p ath scheme with re transmission. We conduct e xtensi ve simulations to e valua te the performance of MPT. Our results show tha t MPT is high l y energ y-e fficien t wi th low end-to-end pa cke t dela ys . INDEX TERMS Ap plica tions, ene rg y e ffi ciency, ne two rk communica tions, underwa te r sensor networks.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
IEEE/ACM TRANSAC TIONS ON N ETWORK IN G, A PRIL 2011
ENERGY-EFFICIENT PROTOCOL FOR COOPERATIVE NETWORKS

ABSTRACT In coop era ti ve ne two rks, transmitting and recei ving nodes recrui t neighbo ring nodes to assist in communication . We model a coope rati ve transmission link in wireless netwo rks as a tra nsmitter cluster and a re cei ve r cluster. We then p ropose a coopera ti ve communication pro to col for establishment o f these clusters and fo r coopera ti ve transmission of da ta . We de ri ve the uppe r bound o f the capaci ty of the proto col , and we anal yze the end-to -end robustness of the pro to col to da ta-pa cke t loss, along with the tradeo ff be tween energ y consumption and e rror rate . The anal ysis resul ts are used to compare the ene rg y sa vin gs and th e end-to -end robustness of our pro tocol with two non-coopera ti ve schemes, as well as to another coopera ti ve pro tocol published in th e te chnical li tera tu re. The comparison results show that, when nodes are positioned on a grid , there is a reduction in the probabili ty of packet deli very failure b y two orde rs of magnitude for the values o f parameters considered . Up to 80% in energ y sa vings can be achie ved fo r a grid topo log y, while fo r random node placement our coopera ti ve pro tocol can save up to 40% in energ y consumption rela ti ve to the o the r pro to cols. The reduction in e rro r ra te and the energ y sa vings transla te i nto in creased life time o f coo pera ti ve sensor ne two rks. INDEX TERMS Clustering , coop era ti ve n etwo rks transmission, sensor ne tworks.
energ y-e fficien t
p ro tocols,
coope rati ve
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
DELAY ANALYSIS AND OPTIMALITY OF SCHEDULING POLICIES FOR MULTIHOP WIRELESS NETWORKS
ABSTRACT We anal yze the dela y performance o f a multihop wireless network with a xed rou te between each source destina tion pair. We de velop a new queue grouping techniq ue to handle the comple x co rrela tions of the service process resulting from the multihop nature o f the rows. A gene ral set-based in terfere nce model is assumed that imposes constraints on links that ca n be served simultaneously a t an y gi ven time . These inte rfe rence co nstrain ts are used to obtain a fundamen tal lower bound on the dela y performance of an y sched uling poli cy for th e s ystem. We presen t a sys tematic me thodolog y to de ri ve such low er bounds. Fo r a special wireless system, namel y the clique , we design a poli cy tha t is sample-path dela yoptimal. Fo r th e tan dem queue network, whe re the dela y-op timal policy is known , the e xpected dela y o f the op timal policy numericall y coincides with the lower bound. We conduct e xtensi ve numerical stud ies to suggest tha t the a ve rage dela y o f the ba ck-pressure scheduling pol icy can b e made close to the lowe r bound b y using approp ria te fun ctions o f queue leng th. INDEX TERMS Dela y, d ynamic con trol , low con trol , L yapuno v anal ysis, Marko v chains, optimi za tion , qu eueing anal ysis, scheduling , wireless mesh netwo rk.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
CROSSTALK-PREVENTING SCHEDULING IN SINGLE-AND TWO-STAGE AWG-BASED CELL SWITCHES

ABSTRACT Arra y wa veguide g rating (AWG)-based op tical switch ing fabri cs are recei ving increasing atten tion due to their simplicity and good perfo rmance. Howe ver, AWGs are affected b y cohe rent crosstalk tha t can signifi can tl y impair system operati on when the same wave length is used simultaneously on se vera l inpu t ports. To permit la rge port coun ts in a AWG, a possible solution is to schedule data transmissions across the AWG pre ven ting switch co nfigu ra tions tha t genera te large crosstalk. We s tud y the pro perties and the e xisten ce condi tions o f switch configu ra tions able to con trol coheren t crosstalk. The presented results show that, b y running a properl y constrained scheduling algorithm to a void or minimize crosstalk, i t is possible to op era te an AWG-based switch with la rge port coun ts wi thou t significant pe rfo rmance degrada tion . INDEX TERMS Arra yed wa veguide gra ting (AWG), cohe ren t crosstalk, inpu t-queued switches, optical switchings, scheduling algo ri thms.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
JAMMING-AWARE TRAFFIC ALLOCATION FOR MULTIPLE-PATH ROUTING USING PORTFOLIO SELECTION

ABSTRACT Mu ltipl e-pa th source rou ting p roto cols allow a data source node to distribu te the to tal tra ffic among a vail able pa ths. In this paper, we consider the problem o f jamming-aware source rou ting in which the source node pe rfo rms tra ffi c allocation based on empirical jamming sta tisti cs a t ind i vidual ne twork nodes. We fo rmulate this traffic al loca tion as a lossy netwo rk flow op timi za tion problem using portfolio selection theory from financi al statistics. We show that in multisource netwo rks, this centrali zed op timi za tion problem can be solve d using a dis tribu ted a lgori thm based on de composition in network u tility maximi za tion (NU M). We demonstra te the ne two rks ability to estimate the impact o f jamming and incorpo rate these estima tes into the tra ffic alloca tion p roblem. Finall y, we simulate the ach ie vable th roughpu t using our p roposed traffi c alloca tion me thod in se veral scena rios. INDEX TERMS Jamming, multiple-path rou ting , ne two rk u tili ty ma ximi zati on (NU M), op timi za tion , portfolio selection theory.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
CONTINUOUS NEIGHBOR DISCOVERY IN ASYNCHRONOUS SENSOR NETWORKS

ABSTRACT In most sensor netwo rks, the nodes are static. Ne ve rtheless, node conne cti vi ty is subject to changes because o f disrup tions in w ireless communication , transmission power changes, o r loss of s ynch roni za tion b etwe en neighbo ring nodes. Hence, e ven afte r a sensor is aware of its immediate neighbors, i t must continu ousl y main tain its view , a p rocess we call conti nuous neighbo r disco very. In this work, we distinguish between neighbor disco ve ry durin g sensor network initiali zati on and continuo us neighbor discove ry. We fo cus on the latter and view it as a join t task of all the nodes in e very connected segment. Each sensor employs a simple protocol in a coordi nate e ffort to reduce powe r consumption wi thou t increasing the time requi red to de te ct hidde n sensors. INDEX TERMS Neighbor disco ve ry, sensor netw orks.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
LIVE STREAMING WITH RECEIVER-BASED PEERDIVISION MULTIPLEXING

ABSTRACT A number o f commercial peer-to -peer (P2P) sys tems for li ve streaming ha ve been introdu ced in recen t yea rs. The beha vior o f these popular s ystems has been e xtensi vel y s tudied in several measurement pa pers. Due to the p roprie ta ry natu re o f these commercial s ystems, howe ver, these studies have to rel y on a bla ck-bo x approa ch, whe re packe t traces are coll ected from a single or a limited n umber of measurement poin ts, to in fer various properties o f tra f?c on th e con trol and da ta planes. Al thoug h such studies are useful to compare di fferen t s ystems from the end users perspecti ve , it is dif? cul t to in tui ti vel y understa nd the observed prope rties withou t full y re verse-eng ineering the unde r-l ying s ystems. In this paper, we describe the ne twork architecture o f Za ttoo , one o f the la rgest p roduction li ve streaming pro viders in Europe at the time of wri ting , and present a large-scale measurement stud y o f Za ttoo using da ta coll ected b y the p ro vid er. To highligh t, we found tha t e ven when the Zattoo s ystem was hea vil y l oaded wi th as high as 20 000 con curren t users on a single o verla y, the median channel join dela y remained less than 2 5 s, and tha t, fo r a majori ty of users, th e streamed signal lags o ve r-the-air broad cast signal b y no more than 3 s .
Index Terms Li ve streaming, ne two rk archite cture , peer-to -peer (P2P) sys tem.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
TOPOLOGICAL TRANSFORMATION APPROACHES TO TCAM-BASED PACKET CLASSIFICATION

ABSTRACT Se veral range reencoding schemes have been p ro-posed to mitiga te the e ffect o f range e xpansion and the limita tions of small capacity, la rge power consumption , and high heat genera tion o f te rnary con ten t addressable memory (TC AM)-based packe t classifica tion s ystems. Howe ver, the y all disregard the semantics of classifiers and there fo re miss significan t opportuni ties for space compression. In this paper, we propose new approaches to ra nge reencoding b y taking in to account classifier semantics. Fundamental l y diffe rent from prior work, we view reen coding as a topological transfo rmation p rocess from one colo red h yperre ct- angle to ano the r, wh ere the color is the decision associate d wi th a gi ven packe t. Sta ted ano the r wa y, we reencode the enti re classifier b y considering th e classifiers decisions rathe r than reencode onl y ranges in the classifier igno ring the classifie rs decisions as prior work does. We p resent two o rthogonal , yet composable, reen-coding a pproa ches: domain compression and prefi x alig nment. Ou r te chniques significa ntl y ou tperform all pre vious reencod ing te chniques. In comparison to p rior art, ou r e xperimenta l resul ts show that our techniques achie ve a t least fi ve times more space reductio n in terms of TC AM space for an encoded classifier and at least th ree times more space reduction in te rms of TC AM space for a reencoded classifier and i ts transfo rmers. This , in tu rn, leads to impro ved throughpu t and decreased pow er consumption .
Index Terms Hardware -based packe t classifica tion , addressable memory (TC AM). range en-cod ing, terna ry con ten t
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
Promise for the Best Projects CLOUD COMPUTING
PERFORMANCE ANALYSIS OF CLOUD COMPUTING SERVICES FOR MANY-TASKS SCIENTIFIC COMPUTING

Paralle l and D istr ibute d System s, IEEE Tr ansa ctions June 201 1 ABSTRACT Cloud computing is an emerging commercial in frastru ctu re paradigm tha t promises to eliminate the need fo r maintaining e xpe nsive computing facili ties b y companies and institu tes alike . Throug h th e use of virtuali zatio n and resource time sharing, clouds serve wi th a single set of ph ysical resources a large user base with di fferen t needs. Thus, clouds ha ve the poten tial to p ro vide to their owne rs the bene fi ts of an economy o f scale and , at the same time, become an alte rna ti ve for scien tists to clusters, g rids, and parallel p roduction en vironments . Howe ve r, the cu rren t commercial clouds ha ve been built to support web and small database workloads, which a re ve ry di ffe ren t from typica l scien ti fic compu ting workloads. Mo reo ve r, the use of virtuali za tion and resource time-sharing may in trodu ce significan t pe rfo rmance pe nalti es for the demanding scie nti fi c compu ting workloads. In this work, we anal yze the pe rfo rmance o f cloud computin g services for scienti fi c computing w orklo ads. We q uanti fy the p resence in real scien tifi c computing workloads of Ma n y-Task Computing (MTC) users, tha t is, o f users who employ loosel y coupled appli cati ons comprising many tasks to achie ve thei r scienti fic goals. Then , we perfo rm an empirical evalua tion of the performance of four commercial cloud computing services in cluding Ama zon EC2 , which is curren tl y th e la rgest commercial cloud. Last, we compare through trace-based simulation the perfo rmance chara cteristi cs and cost models of clouds and other scientifi c computing pla tfo rms, for gene ral and MTC-based scienti fi c computing wo rkloads. Our resul ts indicate tha t the cu rren t clouds need an order o f magnitude in perfo rmance impro vement to be useful to the scien tifi c community, and show which impro vements should be considered fi rst to address this discrepancy between o ffer and demand.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
EXPLOIT ING DYN AM IC RESOURCE ALLOCAT ION FOR EFFICIENT PAR ALLEL DAT A PROCESSING IN THE CLOUD
Paralle l and D istr ibute d System s, IEEE Tr ansa ctions June 201 1
In recen t yea rs ad hoc parallel data pro cessing has emerged to be one of the killer appli cati ons for Infrastru cture-as-a -Se rvice (IaaS) clouds. Majo r Cloud computing companies have started to in tegra te frameworks fo r parallel da ta processing in their p roduct po rtfolio , making i t eas y fo r customers to a ccess these servi ces and to deplo y their p rograms. Howe ver, the pro cessing frameworks which are curren tl y used ha ve been designed for sta tic, homogeneous cluster se tups and disregard the particula r nature of a cloud. Consequentl y, the allo ca ted compu te resources may be inadequate fo r big pa rts of the submitted job and unnecessaril y in crease processing time and cost. In this paper, we discuss the opportuni ties and challenges fo r efficie nt pa rallel data pro cessing in clouds and present our research proje ct Neph ele. Neph ele is the fi rst da ta processing framework to e xp lici tl y e xploit the d ynamic resource allocation offered b y toda y's IaaS clouds fo r both , task scheduli ng a nd e xecu tion . Particula r tasks of a p rocessing job can be assigned to di ffe ren t types of virtual machines which are au tomatica ll y ins tantiated and te rminated d uring the job execu tion . Based on this new framework, we perfo rm e xten ded e valu atio ns of Ma pReduce -inspired pro cessing jobs on an IaaS cloud system and compare the results to the popula r data p rocessing framework H adoop .
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
ENABLING PUBLIC AUDITABILITY AND DATA DYNAMICS FOR STORAGE SECURITY IN CLOUD COMPUTING
Paralle l and D istr ibute d System s, IEEE Tr ansa ctions May 2011
ABSTRACT
Cloud Computing has been envisioned a s the next-gene ration architec ture of IT Enterp ri se. It moves the application so ftwa re and databa se s to the cent ralized large data cente rs, whe re the management of the data and se rvice s ma y not be fully t ru stwo rthy . This unique paradigm brings about many ne w se curity challenges, which have not been well understood. Thi s wo rk studie s the problem of en su ring the integrity of data storage in Cloud Computing. In particular, we con sider the ta sk of allowing a third party audito r (TPA), on behalf of the cloud client, to ve rify the integrity of the d ynamic data sto red in the cloud. The introduction of TPA eliminates the involvement of the client through the auditing of whether his da ta stored in the cloud are indeed intact, which can be important in achieving e conomies of scale for Cloud Computing. The suppo rt fo r data d ynamic s via the mo st gene ral form s of data ope ration, su ch a s bloc k modification, insertion, and deletion, is also a significant step to ward p racticality, since se rvice s in Cloud Computing are not limited to archive o r bac kup data only. While prio r wo rks on en suring remote data integrity often lac ks the support of either public auditability or d ynamic data operation s, thi s pape r a chieve s both. We first identify the difficultie s and potential se curit y problem s of dire ct exten sion s with fully dynamic data update s f rom prio r wo rks and then show ho w to con st ruct an elegant verification scheme fo r the seamle ss integration of the se t wo salient feature s in our p roto col de sign. In particular, to achieve ef ficient data dynamic s, we impro ve the e xi sting proof of sto rage model s by manipulating the classic Me rkle Ha sh Tree con st ru ction for bloc k tag authentica tion. To support efficient handling of multiple auditing tasks, we fu rthe r explore the technique of bilinear aggregate signature to extend our main re sult into a multiu ser setting, where TPA can perfo rm multiple auditing tasks simultaneously . Exten sive se curity and perfo rmance analy si s sho w that the p ropo sed scheme s a re highly efficient and pro vably se cure .
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
HEURISTICS BASED QUERY PROCESSING FOR LARGE RDF GRAPHS USING CLOUD COMPUTING
Knowle dge a nd Data Engineer ing, IEEE Transactions on
ABSTRACT Semantic Web is an emerging area to augment human reasoning fo r whi ch va rious technol ogies are being develop ed. These technologi es have been standardi ze d b y W3C . One such standa rd is the RDF. Wi th the e xplosion of semanti c web technol ogies, large RDF gra phs are common place. Curren t frameworks do not scale for la rge RDF grap hs and as a result does not add ress these challenges. In this paper, we describe a framework tha t we buil t using Hadoop to store and retrie ve la rge numbers of RD F triples b y e xploi ting the cloud computin g pa radigm. We describe a scheme to sto re RD F da ta in Had oop Distribute d Fi le Sys tem. Mo re than one Hadoop job ma y be needed to answer a qu ery because a triple pattern in a query canno t ta ke part in more than one join in a H adoop job . To de te rmine the jobs, we p resent an algo rithm to g enera te qu ery plan , whose worst case cost is bounded , based on a greed y app roach to answer a SPAR QL query. We use Ha doop's MapRedu ce framework to answer the que ries. Our resul ts show that we can store large RDF g raphs in Hadoop clusters built with ch eap commodity class hardware . Furthermore , we show tha t our framework is scalable and efficient and ca n handle la rge amoun ts of RD F da ta , unli ke tradi tional app roaches .
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
OPTIMIZATION OF RESOURCE PROVISIONING COST IN CLOUD COMPUTING

IEEE Tr ansa ctions on Services C om puting ABSTRACT In cloud computing , cloud pro viders can o ffer cloud consumers two pro visioning plans for computing resources, namel y reserva tion an d on-demand pl ans. In general , cost o f u tili zing computing resources pro visioned b y reserva tion plan is cheaper than that p ro visioned b y on -demand plan , since cloud consumer has to pa y to pro vider in ad vance . Wi th the reserva tion plan , the consumer can red uce the total resource pro visioning cost. Howe ver, the best ad vance reservation o f resources is di fficul t to be achie ve d due to unce rtain ty o f consumers futu re demand and pro viders resource pri ces. To ad dress this problem, a n op timal clo ud resource pro visioning (OCRP) algorithm is proposed b y fo rmulating a stochas tic p rogramming model. The OCRP al gori thm can pro vision computing resources for being used in multiple pro visioning stages as well as a long-term plan, e.g ., fou r stages in a quarte r plan and tw el ve stages in a yea rl y plan . The demand and p rice unce rtain ty is considered in OCR P. In this paper, di fferen t approa ches to ob tain the solution o f OCR P algori thm are considered in cluding d ete rministic eq ui valen t fo rmulation , sample-a ve rage appro ximati on, and Bende rs decomposition. Numerical studies are e xtensi vel y perfo rmed in which the results clearl y show th at wi th the OCRP algo rithm , cloud consumer can successfull y minimi ze total cost o f resource p ro visioning in cloud computing en vi ronments.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
CLOUD COMPUTING
TOWARDS SECURE AND DEPENDABLE STORAGE SERVICES IN CLOUD COMPUTING

Servic es C om puting, IEEE Tra nsac tions on ABSTRACT As one o f the emerging servi ces in cloud paradigm, clou d sto rage ena bles users to remote l y store thei r data into the cloud so as to enjo y the o n-demand high quality appli ca tions and services from a shared pool of configurable compu ting resources. While cloud sto rage relie ves users from the burden o f local storag e management and maintenance , i t is also relinquishing users’ ul timate con trol o ver the fa te o f their da ta , w hich ma y p ut the co rrectness o f ou tsourced data in to risks. In orde r to regai n the assurances of cloud da ta inte gri ty and a vail abili ty and enforce the quali ty of cloud stora ge servi ce fo r users, we propose a highl y efficien t and fl e xible distribu ted storage ve ri fica tion scheme with two salient fea tures, opposing to i ts p redecessors. By utili zing th e homomorphic token wi th distribu ted erasure -coded da ta , our scheme achie ves th e in tegra tion of stora ge co rre ctn ess insurance and da ta erro r locali za tion , i.e., the id enti fi cati on o f misbehaving server(s). Unlike most prior works , the new scheme further supports secure and efficien t dynamic opera tions on ou tsourced da ta , includ ing: block modifi cation, dele tion and append. Exte nsive secu rity and performance anal ysis shows the proposed scheme is highly e fficien t and resilien t against Byzanti ne failure , malicious da ta modifica tion atta ck, and e ven server colluding a ttacks.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
CLOUDTPS: SCALABLE TRANSACTIONS FOR WEB APPLICATIONS IN THE CLOUD

Servic es C om puting, IEEE Tra nsac tions on
ABSTRACT NoSQL Cloud data sto res pro vi de scalabili ty and high a vailabili ty prop erties fo r web applica tions, bu t a t the same time the y sacri fice data consisten cy. Howe ver, many applications canno t a ffo rd an y da ta inconsistency. CloudTPS is a scalable transaction manager, whi ch gua ran tees full AC ID properties for mul ti-i tem transactions issued b y Web appl ica tions, e ven in the presence o f serve r failu res and ne twork parti tions. We implement this approa ch on top o f the two main families of scalable da ta la yers: Bi gtabl e and SimpleDB. Perfo rmance e valua tion on top o f HBase (an open-source ve rsion of Big table ) in our local cluste r and Ama zon SimpleDB in the Ama zon cloud shows th at our s ystem scales linearl y a t least up to 40 nodes in our lo cal cluste r and 80 n odes in the Ama zon cloud .
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
MINING CLUSTER-BASED TEMPORAL MOBILE SEQUENTIAL PATTERNS IN LOCATION-BASED SERVICE ENVIRONMENTS

Knowle dge a nd Data Engineer ing, IEEE Transactions June 2 011
ABSTRACT Researches on Loca tion-Based Service (LBS) ha ve been emerging in recen t ye ars due to a wide rang e of po ten tial appli catio ns. One o f the acti ve topics is the mining and predi ction o f mobile mo vements and associated transactions. Most o f existing studies focus on disco verin g mobile pa tte rns from the whole logs. Howe ver, this kind of pa tte rns may no t be p recise enough fo r p redictions since the di fferen tia ted mobile beha vio rs among users and temporal periods are no t considered. In this paper, we p ropose a no vel al gori thm, namel y, Cluste r-based Temporal Mobile Sequen tial Pa ttern Mi ne (C TMSP-Mine), to disco ver the Clusterbased Temporal Mobile Sequen tial Pa tterns (C TMSPs). Moreo ver, a pred iction strateg y is prop osed to p redict the subsequen t mobile beha viors. In CTMSP-Mi ne, user clus ters are constructed b y a no vel algori thm named Cluster-Obje ct-based Smart Clus ter Affini ty Se arch Technique (C O-Smart-C AST) and similarities between users are e valu ated b y the proposed measure, Location Based Se rvice Alignment (L BS-Alignmen t). Me anwhile , a time segmentation a pproa ch is presented to find segmenting time intervals where similar mobile characteristics e xist. To ou r best knowle dge, this is the first work on mining and p rediction o f mobile beha viors wi th consideratio ns of user relati ons and temporal prope rty simultaneousl y. Through e xperimen tal evaluation under vari ous simulated condi tions, the prop osed methods are shown to deli ve r e xcel lent pe rfo rmance .
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
COSDES: A COLLABORATIVE SPAM DETECTION SYSTEM WITH A NOVEL E-MAIL ABSTRACTION SCHEME
Knowle dge a nd Data Engineer ing, IEEE Transactions May 20 11 ABSTRACT E-mail communication is indispensable nowada ys, bu t the e -mail spam problem continu es growing drasticall y. In recen t yea rs, the no tion of colla bora ti ve spam fil tering wi th nea r-dupli ca te similarity matching scheme has been widel y discussed. The primary i dea of the similarity matching scheme fo r spam detection is to maintain a kno wn spam database, fo rmed b y user feedback, to block subsequent near-dupli ca te spams. On purpose of achie ving efficie nt similarity matching and reducing sto rage utili za tion , prior works mainly rep resent ea ch e -mail b y a succinct Abstraction deri ved from e-mail con ten t te xt. H owe ve r, these Abstractions of e-mails canno t full y catch th e e vol vi ng natu re of spams, and are thus no t effecti ve enough in near-dupli ca te d ete ction. In this paper, w e prop ose a no vel e-mail Abs traction scheme, whi ch considers email la yout stru cture to rep resent e-mails. We p resent a procedu re to gen era te the e-mail Abstraction using HTML co nten t in e-mail , and this newl y de vised Abs traction can more e ffecti vel y capture the near-duplica te phenomenon o f spams. Mo reo ve r, we design a comple te spam detection s ystem Cosdes (standing fo r COllabo rati ve Spam DEtection System), w hich p ossesses an effi cient nearduplica te ma tching scheme and a pro gressive upda te scheme. The p rogressi ve upda te scheme enables system Cosdes to kee p the most up -to date in fo rmation fo r nea r-dupli ca te de tection . We e valua te Cosdes on a li ve da ta set colle cted from a real e-mail serve r and show tha t our sys tem outpe rforms the prior appro aches in de tection results and is appli cable to the real w orld .
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
A LINK ANALYSIS EXTENSION OF CORRESPONDENCE ANALYSIS FOR MINING RELATIONAL DATABASES

Knowle dge a nd Data Engineer ing, IEEE Transactions A pr il 2011 ABSTRACT This work in tro duces a link anal ysis proce dure for disco vering rela tionships in a relatio nal da tabase or a gra ph, g enerali zing bo th simple and multiple corresponden ce anal ysis. It is based on a random walk model through the database defining a Marko v chain ha ving as many states as elements in the database. Suppose we are inte rested in anal yzing the rela tionships between some elements (or records) con tained in two di fferen t tables o f the re lati onal da tabase. To this end, in a first step , a reduced , much smaller, Marko v chain conta ining onl y the elements of in terest a nd preserving th e main chara cte risti cs of the ini tial cha in, is extracted b y sto chastic complementa tion . This redu ced chain is then anal yzed b y p rojecting join tl y the elements o f in te rest in the diffusion map subspace and visualizin g the resul ts. This two -step procedu re redu ces to simple corresponden ce anal ysis when onl y two tables are defined , and to multiple co rrespondence anal ysis when the data base takes the form o f a simple star-schema . On the o the r hand , a kernel ve rsion o f the di ffusion map distance , ge nerali zing the basic di ffusion map distance to di rected graphs, is also in trodu ced an d the links with spectral cl ustering are discussed. Seve ral data sets are analyzed b y using the pro posed methodolog y, showing the use fulness of the technique fo r extracting rela tionships in rel ation al d atabases o r g raphs.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
A PERSONALIZED ONTOLOGY MODEL FOR WEB INFORMATION GATHERING

Knowle dge a nd Data Engineer ing, IEEE Transactions on A pr il 20 11
ABSTRACT As a model fo r knowledg e descrip tion and formali za tion , on tologies are widel y used to rep resent user pro files in pe rsonali zed web information ga the ring. Howe ver, wh en re presentin g user p ro files, man y models ha ve u tili zed onl y knowledge from either a global kno wledge base or a user local informati on. In this paper, a personali zed on tolog y model is proposed for know ledge representa tion and re asoning o ver user p ro files. This model learns ontological user pro files from both a wo rld knowledge base and user local instan ce re positories . Th e on tolog y model is e val uate d b y comparing i t against ben chmark models in web in fo rmation g athe ring . The results show tha t this on tolog y model is successful .
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
A MACHINE LEARNING APPROACH FOR IDENTIFYING DISEASE-TREATMENT RELATIONS IN SHORT TEXTS

Knowle dge a nd Data Engineer ing, IEEE Transactions June 2 011
ABSTRACT The Machine L earning (ML ) field has gained i ts momentum in almost an y domain of research and just recen tl y has become a reliable tool in the medical d omain. The empiri cal domain o f automa tic learning is used in tasks such as medical decision support, medical imaging , protein -pro tein in tera ctio n, e xtra ction o f medical know ledge , an d for o verall pa tien t management care . ML is en visioned as a tool b y which compu ter-based systems can be integra ted in the heal th care field in orde r to ge t a be tter, more e fficie nt medical ca re. This paper describes a ML-based meth odolog y for b uilding an appli ca tion tha t is capable of iden ti fyin g and disseminating heal thca re in fo rmation . It e xtra cts sente nces from published medical pape rs tha t menti on diseases and trea tments, and iden ti fies semantic relati ons that e xist betwe en diseases and trea tments. Our e valu ation results for these tasks show that the pro posed methodolog y obtains reliab le ou tcomes tha t could be in teg ra ted in an applica tion to be used in the medical care domain. The po ten tial value of this paper stands in the ML settings th at w e propose and in the fa ct th at we outperform pre vious results on the same data set.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
DESIGN AND IMPLEMENTATION OF AN INTRUSION RESPONSE SYSTEM FOR RELATIONAL DATABASES

Knowle dge a nd Data Engineer ing, IEEE Transactions June 2 011 ABSTRACT The intrusion response component of an overa ll intrusion de tection system is responsible for issuing a suitable response to an anomalous request. We propose the no tion o f da tabase response policies to support our in trusion response system tailo red fo r a D BMS. Our in te racti ve response policy langua ge makes it ve ry eas y for the da tabase administrato rs to specify approp ria te response acti ons for di fferen t ci rcumstances depending upon the natu re o f the anomalous request. The tw o main issues that we address in conte xt o f such response poli cies are tha t o f poli cy matching , and policy administra tion . For the policy matching problem, we pro pose two algori thms that efficientl y search the policy da tabase fo r policies tha t match an anomalous request. We also extend the Postgre SQL DBMS with our policy matching mechanism, and report e xpe rimental resul ts. The e xperimen tal e valua tion shows that ou r techniq ues are very e fficien t. The other issue that we address is that of administra tion o f response policies to pre ven t malicious modifi ca tions to policy obje cts from legi timate users. We propose a no vel Join t Threshold Administra tion Model (JTAM) th at is based on the prin ciple of separa tion o f duty. The ke y id ea in JTAM is tha t a policy object is jointl y administe red b y a t least k database administrator (D BAs), tha t is, an y modifi ca tion made to a policy object will be in va lid unless it has been au tho ri zed b y a t least k DBAs . We present design de tails of JTAM whi ch is based on a cryp tographic threshold signature scheme, and show how JTAM pre ven ts malicious modifications to policy obje cts from autho ri zed users. We also implement JTAM in the Postgre SQL DBMS, and rep ort e xperimental results on the effi ciency o f ou r techniq ues.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
CLASSIFICATION AND NOVEL CLASS DETECTION IN CONCEPT-DRIFTING DATA STREAMS UNDER TIME CONSTRAINTS
Knowle dge a nd Data Engineer ing, IEEE Transactions June 2 011 ABSTRACT Mos t e xisti ng da ta stre am classifica tion techniqu es ignore one importan t aspect of stream data : arri val o f a no vel class. We add ress this issue and propose a data stream classificatio n te chnique tha t integ ra tes a no vel class detection mechanism into tradi tional classifiers, enablin g automati c dete ction of no vel cl asses before the true labels o f th e no vel class instan ces arri ve . No vel class detection prob lem becomes more challenging in the presence o f concep t-d rift, when the underl ying data distribu tions e vol ve in streams. In order to determine w hethe r an instan ce belo ngs to a no vel class, the classifica tion model sometimes needs to wait for more test instances to disco ve r similarities among those insta nces. A ma ximum allowable wai t time Tc is imposed as a time constrain t to classify a test instan ce. Furthe rmore, most e xisting stream classification app roaches assume that th e true label o f a da ta poin t can be accessed immediately afte r the data poin t is classified . In reali ty, a time del a y Tl is in vol ve d in obtai ning the true label o f a data poin t since manual labeling is time consuming. We show how to make fas t and correct classificati on decisions under these constrain ts and appl y them to real benchmark da ta . Comparison wi th sta te-o f-the -art stream classifica tion techniq ues pro ve the superio rity of ou r approa ch.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
ANOM ALY DETECTION IN NET WORK TRAFFIC BASED ON ST ATISTICAL INFERENCE AND ALPHA-ST ABLE MODELING
Depe nda ble a nd Se cure C om puting, IEEE Tra nsactions: July -A ug. 2011
ABSTRACT This paper proposes a no vel method to detect anomalies in network traffi c, based on a nonrestricted -stable first-orde r model and sta tisti cal h ypo thesis testing . To this end, we gi ve statis tical e vidence tha t th e marginal distribu tion o f rea l traffi c is adequatel y modeled with -stabl e fun ctions and classify tra ffic pa tterns b y means of a Gene rali zed Li kelihood Ra tio Test (GLRT). The method au tomatica ll y chooses tra ffic windows used as a reference , which the tra ffic window und er test is compared wi th , wi th no e xpert in terven tion nee ded to tha t end . We fo cus on dete cting two anomal y types, namel y floods and flashcrowds, which ha ve been frequen tl y studi ed in the li tera ture. Performance o f our dete ction method has been measured through Recei ve r Opera ting Cha racteris tic (R OC) curves and results indica te that ou r method outperfo rms the closel y-rela ted sta te-o f-the -art con tri butio n described in . Al l e xperiments use traffi c data colle cte d from two rou ters at our uni ve rsity-a 25,000 studen ts institu tion-w hich pro vide two di fferen t le vels of tra ffi c aggrega tion fo r our tests (tra ffic a t a p articula r school an d the whole uni versity). In addi tion , the tra ffic model is tested with publicl y a vailable tra ffic traces. Due to the comple xi ty o f -sta ble distribu tions, care has been taken in designing appropria te numerical algo ri thms to deal wi th the model .
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
ELMO: ENERGY AWARE LOCAL MONITORING IN SENSOR NETWORKS

ABSTRACT Ove r the past de cade , loca l monitoring has been shown to be a po werful techniq ue fo r impro ving securi ty in multiho p wireless sensor networks (WSNs). Indeed , lo cal monito ring-based securi ty algo ri thms are becoming the most popular too l for p ro viding secu rity in WSNs. Howe ver, local monitoring as it is currentl y pra cti ced is costl y in terms of energ y consumption, a major d rawback fo r energ y-constrain ed systems such as WSNs. In WSN en vi ronments, the sca rce power resources are typical l y add ressed through sleep-wa ke scheduling o f the nodes. Howe ver, sleep-wake schedul ing te chniques in WSNs are vulnera ble e ven to simple attacks. In this paper, a ne w technique is proposed th at promises to allow operati on o f WSNs in a manner tha t is bo th ene rg y-e ffi cien t and secure . The proposed te chnique combines local moni toring wi th a n o vel , more secu re form o f sleep-wake sched uling . The la tte r is a new methodolog y dubbed Elmo (Energ y Awa re Local MOni to ring in Sensor Ne tworks), which enables sleep-wa ke management in a secure manner even in th e fa ce o f ad ve rsarial nodes tha t choose no t to awaken nodes responsible fo r moni toring thei r tra ffic. An a nal ytical p roo f is gi ven showing tha t securi ty co ve rage is not wea kened under Elmo. Moreo ver, ns-2 simulation results show tha t the performance o f lo cal monitoring is practi call y unchan ged, while energ y sa vings o f 20 to 100 times are achie ved , depending on the scenario .
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
EFFICIENT FAULT DETECTION AND DIAGNOSIS IN COMPLEX SOFTWARE SYSTEMS WITH INFORMATIONTHEORETIC MONITORING
Depe nda ble a nd Se cure C om puting, IEEE Tra nsactions on
ABSTRACT Ma nagement metrics o f comple x software sys tems exhibi t stable co rrel ations which can enab le faul t de te ctio n and diagnosis. Cu rren t approa ches use specifi c anal yti c fo rms, typi call y linea r, for modeling correla tions. In practice , more complex nonline ar rela tionships exist be tween metrics . Moreo ver, most interme tric corre latio ns form clusters ra ther than simple pa irwise correlations. These clusters pro vi de additi onal info rmation and o ffer the possibility fo r optimi za tion . In this pape r, we address these issues b y using No rmali zed Mu tual In formation (N MI) as a similarity measure to iden ti fy clusters o f correla ted metrics, wi thou t assuming any speci fic form fo r the me tric rela tionships. We show how to ap pl y the Wilco xon Ran k-Sum test o n the en trop y measures to de tect errors in the s ystem. We also present th ree diagnosis algorithms to loca te faul ty componen ts: RatioScore , based on th e Ja cca rd coe fficie nt, SigScore , whi ch in corpo rates knowledge o f componen t dependen cies, and Ba yesianScore , whi ch uses Ba yesian in fe rence to assign a faul t probabil ity to ea ch component. We e valu ate ou r approach in the conte xt of a comple x en terp rise applica tion , and show that 1 ) stable , nonlinea r correla tions e xist and can be cap tured w ith ou r approach ; 2 ) we can de tect a l arge fra ction o f faul ts with a low false positi ve ra te (we dete ct u p to 18 o f the 22 faul ts we injected); and 3 ) we impro ve the diagnosis with our new diagnosis algo rithms.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
PRIVACY-PRESERVING UPDATES TO ANONYMOUS AND CONFIDENTIAL DATABASES

Depe nda ble a nd Se cure C om puting, IEEE Tra nsactions on Issue Date : Jul y-Aug. 2011
ABSTRACT
Suppose Alice owns a k-anon ymous da tabase and needs to de termine wh ethe r her datab ase, when inserted with a tuple ow ned b y Bob , is still k-anon ymous. Also , suppose that a ccess to the da tabase is strictl y con trolled , because fo r example data are used for certain e xpe riments tha t need to be maintained confide ntia l. Clearl y, allowing Alice to directl y read the con ten ts of the tuple b reaks the p ri vacy of Bob (e .g., a pa tien t's medical record); on the o the r hand , the con fiden tiali ty o f the datab ase managed by Al ice is viola ted once Bob has access to the con tents of the da tabase. Thus, the problem is to che ck whe ther the datab ase inserted wi th the tuple is still k-anon ymous, with out le ttin g Ali ce and Bob know the con ten ts o f the tuple and the da tabase, respecti vel y. In this paper, we p ropose two pro tocols solving this problem on suppression-based and generaliza tion -based k-anon ymous and confide ntia l da tabases. The pro toco ls rel y on well-known cryptographi c assumptions, and we pro vide theore ti cal anal yses to p roo f their soundness and e xpe rimental results to illustra te thei r effi ciency.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
DYNAMICS OF MALWARE SPREAD IN DECENTRALIZED PEER-TO-PEER NETWORKS

ABSTRACT In this pape r, we fo rmulate an anal yti cal model to cha racteri ze the spread o f malware in de centrali zed, Gnute lla type peer-to-pee r (P2P) ne tworks and stud y the d ynamics associated with the spread of malware . Using a compartmental model, we deri ve the s ystem paramete rs or netw ork condi tions under whi ch the P2P network ma y rea ch a malware free equ ilibrium. The model also e valua tes the e ffect o f con trol stra tegies like node quaran tine on stifling the spread o f malware. The model is then e xtended to consider the impact of P2P ne two rks on the malware spre ad in ne two rks o f smart cell phones.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
LOW-ENERGY SYMMETRIC KEY DISTRIBUTION IN WIRELESS SENSOR NETWORKS

Depe nda ble and Sec ure Com puting, IEEE Tra nsactions on Iss ue Date: MayJune 20 11
ABSTRACT In this work, a scheme for ke y distri butio n and netw ork access in a Wi reless Sensor Netw ork (WSN) tha t u tili zes Iden ti ty-Based Cryp tog raph y (IBC) is presented . The scheme is anal yzed on the AR M92 0T p rocessor and measurements were taken fo r the run time and ene rg y o f i ts componen ts. It was found tha t the Ta te pairing componen t o f the scheme consumes significan t amounts of energ y, and so should be ported to ha rdware. An a ccele rato r was implemented in 65 nm Complementary Me tal Oxide Sili con (C MOS) technolo g y a nd a rea, timing, and ene rg y figures ha ve been ob tained fo r the design . Results indica te tha t a ha rdware implementati on o f IBC would meet the stri ct ene rg y cons train t requi red of a wireless sensor netwo rk node .
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
REPLICA PLACEMENT FOR ROUTE DIVERSITY IN TREE-BASED ROUTING DISTRIBUTED HASH TABLES
Depe nda ble and Sec ure Com puting, IEEE Tra nsactions on Iss ue Date: MayJune 20 11
ABSTRACT Distribu ted hash tables (DH Ts) share storage and rou ting responsibility among all nodes in a peer-to-p eer ne twork. Th ese netwo rks ha ve bound ed pa th leng th unlike unstructu red ne two rks. Unfo rtunatel y, nodes can den y a ccess to ke ys o r misroute loo kups. We address both o f these problems throu gh repli ca placement. We cha racteri ze tree -based routing DHTs and de fine Ma xDisjoint, a repli ca placement tha t creates route di versity for these DHTs. We pro ve tha t this placement cre ates disjoint routes and find the replication deg ree ne cessary to produce a desired number o f disjoint rou tes. Using simulations of Pastry (a tree-b ased routi ng DHT), we e valua te the impact of Ma xDisjoin t on routing rob ustness compared to other placements when nodes are compromised at ra ndom or in a con tiguous run . Furthermore , we co nsider ano ther rou te di ve rsity mecha nism that we call neighbor set rou ting a nd show that, w hen used wi th ou r repl ica pla cement, i t can successfully rou te messages to a correct re plica e ven wi th a quarte r of the nodes in the s ystem compromised a t random. Finall y, we demonstra te a famil y o f repl ica que ry stra tegies tha t can trade o ff response time and sys tem load. We p resent a h ybrid query strateg y tha t keeps response time lo w wi thou t produ cing too high a loa d.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
ROBUST CORRELATION OF ENCRYPTED ATT ACK TRAFFIC THROUGH STEPPING STONES BY FLOW WAT ERM ARKING
Depe nda ble a nd Se cure C om puting, IEEE Tra nsactions May-June 2011 ABSTRACT
Netwo rk-ba sed intrude rs seldom attac k their victims direc tly f rom their o wn compute r. O ften, they stage their attac ks th rough intermediate stepping stone s in orde r to conceal their identity and origin. To identify the source of the at tac k behind the stepping stone (s), it i s ne ce ssa ry to correlate the incoming and outgoing flows o r conne ction s of a stepping stone. To re si st attempt s a t co rrelation, the atta c ke r may enc rypt or otherwi se manipulate the connection t raffic. Timing-ba sed co rrelation approache s have been shown to be quite effe ctive in correlating encryp ted connection s. Ho weve r, timing-ba sed co rrelation approache s a re subject to timing perturbation s tha t may be deliberately int roduced b y the atta c ke r at stepping stone s. In this paper, we p ropo se a novel wate rmark-ba sed -co rrelation scheme that i s de signed spe cifically to be robu st again st timing perturba tion s. Unlike mo st p reviou s timing-ba sed correlation approache s, ou r wa terma rk-ba sed app roach i s a ctive in that it embeds a unique waterma rk into the enc rypted flows b y slightly adju sting the timing of selected pac ket s. The unique watermark that i s embedded in the encrypted flow give s us a number of advantage s over pa ssi ve timing-ba sed correlation in re si sting timing perturbation s by the atta c ke r. In contra st to the exi sting passi ve co rrelation approache s, ou r ac tive wate rmark-ba sed co rrelation does not ma ke any limiting assumption s about the distribution or random pro ce ss of the original interpac ket timing of the pac ket flow. In theory, ou r wate rmark-ba sed correlation can achieve arbitra rily clo se to 100 percent correlation true po sitive rate (TPR), and a rbitra rily clo se to 0 percent fal se po sitive rate (FP R) at the same time for sufficiently long flows, de spite arbit ra rily large (but bounded) timing pertu rbation s of any di stribution by the attac ker. Our paper i s the first that identifies 1 ) accu rate quantitative tradeoff s bet ween the achievable correlation effectivene ss a - - nd the defining characte ri stic s of the timing perturbation; and 2) a provable upper bound on the number of pac ke t s needed to achieve a de si red co rrelation effectivene ss, given the amount of timing perturbation. Experimental re sult s show that our a ctive waterma rk-ba sed correlation perfo rm s bette r and require s fe we r pac ket s than exi sting, pa ssive timing-ba sed correlation methods in the pre sence of random timing pertu rbation s.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
LOW-OVERHEAD END-TO-END PERFORMANCE MEASUREMENT FOR NEXT GENERATION NETWORKS

Network a nd Service Ma nage ment, IEEE Transactions on Issue Date : Ma rch 2011
ABSTRACT In terne t performance measurement is commonly percei ved as a high-cost control-pla ne acti vi ty and un til now it has tended to be implemented on top o f the network's forwa rding ope ratio n. Consequen tl y, measurement mechanisms have often had to trade rel e vance and accu racy o ver non-i ntrusi veness and cost effecti veness. In this pape r, we p resent the software implementation o f an in-l ine measurement mechanism that uses nati ve structures o f the In te rnet Proto col version 6 (IPv6 ) stack to pigg yback measurement in formation on da ta-carrying tra ffic as this is routed be tween two poin ts in the ne two rk. We care full y e xamine the o verhea d associated with bo th the measurement process and the measurement da ta , and w e demonstra te tha t dire ct two -poin t measurement has minimal impact on throug hput and on s ystem p rocessing load . The results of this paper show tha t adequatel y engineered measurement mechanisms that e xploi t selecti ve pro cessing do not compromise the network's forwa rding e fficie ncy, a nd can be depl o yed in an alwa ys -on manner to re veal the true pe rfo rmance of ne twork tra ffi c o ver small timescales.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
ON THE IMPACT OF SECURITY PROTOCOLS ON THE PERFORMANCE OF SNMP

Network a nd Service Ma nage ment, IEEE Transactions March 2011
ABSTRACT Since th e earl y 1990s, there ha ve been se veral a ttempts to secure the Simple Network Man agement Pro tocol (SN MP). The thi rd ve rsion of the p ro tocol , published as full standard in 2002 , i ntroduced the User-based Secu rity Model (USM), whi ch comes with i ts own user and ke y-management in frastructure . Since then , ne twork opera to rs ha ve repo rte d tha t depl o ying ano the r user and ke y management infrastru ctu re to secure SN MP is e xpensi ve and a reason to no t deplo y SN MPv3 . This paper describes how e xisting securi ty p ro tocols ope rating abo ve the transport la yer and b elow appli catio n pro toco ls can be used to secu re SN MP. These pro tocols can take ad van tage o f alre ad y d eplo yed ke y management infrastructu res tha t are used for o the r ne twork management in terfaces and hen ce their use can redu ce the ope ra tional costs associa ted with securing SN MP. Our main con tribu tion is a deta iled performance anal ysis of a p rototype implementation , comparing the pe rfo rmance o f SN MPv3 o ver SSH , TLS, and DTLS with oth er versions of SN MP. We a lso discuss the differe nces between the va rious op tions to secure SN MP and pro vide gui delines fo r choosing solutions to implement or deplo y.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
LOCATING EQUIVALENT SERVANTS OVER P2P NETWORKS

ABSTRACT While pee r-to-pe er ne tworks are mainl y used to loca te uni que resources across the In te rnet, new interesting deplo ymen t scenarios are emerging. Pa rticula rl y, some applications (e.g ., VoIP) are proposing the crea tion o f o verla ys for the locali za tion o f services b ased on equi va lent serva nts (e .g., voi ce rela ys). This paper e xplores th e possible ove rla y a rchi te ctu res tha t ca n be adop ted to pro vide such servi ces, showing how an u nstru ctu red solution based on a scalefree o verla y topolog y is an effe cti ve op tion to deplo y in this con te xt. Consequentl y, we propose EQU ATOR (EQUi valen t servAn t loca TOR), an unstructure d o verla y implementing th e abo ve mentioned op era ting principles, based on an overla y cons truction algo ri thm tha t well appro ximates an ideal scalefree construction model. We present bo th anal yti cal an d simulation results whi ch support our o ve rla y topolog y selection and va lidate the pro posed archi tecture .
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
COOPERATIVE CHANNELIZATION IN WIRELESS NETWORKS WITH NETWORK CODING

Paralle l and D istr ibute d System s, IEEE Tr ansa ctions July 201 1 ABSTRACT In th is paper, we add ress congestion of multi cast tra ffic in multihop wi reless networks thro ugh a combina tion o f ne twork coding and resource reserva tion . Network coding reduces the number o f tra nsmissions required in mul ticast flows, thus allowing a netwo rk to approach i ts multicast capa ci ty. In add ition , i t efficien tl y repairs errors in multicast flows b y combining pa cke ts lost at di fferen t destinations . Howe ver, unde r condi tions of e xtremel y h igh con gestion the repair capab ility o f network coding is seriousl y degraded . In this paper, we p ropose coope rati ve channeli za tion , in whi ch po rti ons of th e transmission media are alloca ted to links tha t are congested a t the poin t wh ere ne twork cod ing canno t e fficien tl y repai r loss. A health metric is proposed to allow comparison of need for channeli za tion of diffe ren t mul ticast lin ks. Coopera ti ve channeli za tion considers the impact of channel i za tion on o ve rall network perfo rmance be fore resource reserva tion is trigge red . Ou r resul ts show tha t coopera ti ve channeli za tion impro ves o verall ne twork performance while being well suite d for wi reless netwo rks using ne twork coding .
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
THROUGHPUT OPTIMIZATION IN MULTIHOP WIRELESS NET WORKS WITH MULT IPACKET RECEPTION AND DIRECTIONAL ANTENN AS
Paralle l and D istr ibute d System s, IEEE Tr ansa ctions July 201 1
ABSTRACT Recent ad vances in the ph ysical la yer ha ve e nabled the simultaneous recep tion of multipl e packets b y a node in wire less networks . We address the th roughpu t optimi za tion problem in wireless networks that support multipacket re cep tion (MPR ) capab ility. Th e problem is modeled as a joint rou ting and sched uling problem, which is known to be N P-hard. The scheduling subproblem deals with finding the optimal schedulable sets, which a re de fined as subsets of lin ks tha t can be scheduled o r a cti va ted simultaneously. We demonstrate tha t an y soluti on of the scheduling subproblem can be bui lt with |E| + 1 or fewe r schedulable sets, whe re |E| is the number o f links o f the ne twork. This result is in contras t with p re vious works tha t sta ted that a soluti on of the scheduling subproblem is composed of a n e xpo nenti al number o f schedu lable sets. Due to the hardness of the problem , we p ropose a pol ynomial time scheme based on a combination of linear programming and appro ximation algo rithm paradigms. We ill ustra te the use o f the scheme to s tud y the impact o f design paramete rs on the pe rfo rmance o f MPR-capable ne two rks, including th e number o f transmit interfa ces, the beamwid th, and the re cei ve r range o f the an tennas.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
ATTRIBUTE-BASED ACCESS CONTROL WITH EFFICIENT REVOCATION IN DATA OUTSOURCING SYSTEMS

Paralle l and D istr ibute d System s, IEEE Tr ansa ctions on ABSTRACT Some of the most challengin g issues in data outsourcing scenario a re the enforcement o f au tho ri za tion p olicies and the support o f po licy upda tes. Cipherte xt-poli cy attribute -based encryp tion is a promising cryp tograph ic solu tion to these issues for enforcing a ccess control poli cies defined b y a da ta owner on outsourced da ta . Howe ver, the problem of appl ying the attri bute -based encryption in an outsourced archi tecture in trodu ces se veral challen ges with rega rd to the a ttribu te and user re voca tion . In this paper, we p ropose an a ccess con trol mechanism using cipherte xt-p olicy a ttribu te-based en crypti on to en fo rce a ccess con trol policies with effi cien t a ttrib ute and user re voca tion capab ility. The fine-g rained access control can be achi e ved b y d ual encryp tion mechanism which takes ad van tage o f th e a ttribu te-b ased encryp tion a nd selecti ve grou p ke y distribu tion in ea ch a ttribu te group. We d emonstrate how to appl y th e proposed mechanism to secu rel y manage the ou tsourced da ta . The an al ysis results indi cate tha t the p roposed scheme is e ffi cien t and secure in the data ou tsourcing s ystems.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
NETWORK IMMUNIZATION WITH DISTRIBUTED AUTONOMY-ORIENTED ENTITIES

Paralle l and D istr ibute d System s, IEEE Tr ansa ctions July 201 1
ABSTRACT Ma n y communica tion s ystems, networks. For such netwo rks, pre ven ting malicious atta cks or neighboring nodes followin g thei r e.g ., in tern et, can be modeled as comple x immuni zation stra tegies are necessary fo r vi ruses being percolated from a node to its connecti vities.
In re cen t years , various immunizatio n stra tegies ha ve been p roposed and demonstrated , most of which rest on the assumptions that the stra tegies can be execu ted in a cen tra li zed manner and /or tha t the comple x ne twork a t hand is reasonabl y s table (i ts topolog y will no t chan ge o vertime). In o the r wo rds, i t would be di fficul t to appl y them in a de centrali ze d ne twork en vironment, as often fou nd in th e rea l wo rld. In this paper, we p ropose a decentrali zed and scalable immuniza tion stra teg y based on a self-organi zed computing approa ch called au tonom y-o riented computing (AOC ) [1 ], [2 ]. In this strateg y, au tonomous behavior-b ased entities are deplo yed in a decen trali zed network, and a re ca pable o f collecti vel y finding those nodes wi th high degrees o f conducti vi ties (i .e., those tha t can readil y sprea d viruses). Through e xpe riments in vol ving bo th s yn the tic an d real -world networks , we demonstrate tha t this stra teg y can e ffecti vel y and e fficien tl y lo ca te highl yconnected nodes in dece ntrali zed comple x ne twork en vi ronments of various topologies, and i t is also scalable in handli ng la rge-scale de cen trali zed netw orks. We ha ve compared our stra teg y w ith some of the well -know n stra tegies, incl uding acquain tance and co vering stra tegies on bo th s yn the tic and real-wo rld networks .
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
OPTIMIZATION OF RATE ALLOCATION WITH DISTORTION GUARANTEE IN SENSOR NETWORKS

Paralle l and D istr ibute d System s, IEEE Tr ansa ctions on Issue Date : Jul y 2011 ABSTRACT Lossy compression te chniques a re commonl y used b y long -term da ta-ga the ring applica tions tha t attempt to identi fy tre nds or other in teres ting patte rns in an entire system since a data packe t ne ed no t alwa ys be completel y and immediately transmitted to the sink. In these appli cati ons, a non te rminal sensor node jointl y encodes its own sensed data and the da ta re cei ved from i ts nearb y nodes. The tendency for these nodes to ha ve a high spatial correla tion means that these data pa cke ts can be effi cien tl y compressed toge ther using a ra te-distortion strateg y. This paper add resses the optimal ra te-dis tortion allo ca tion problem, which dete rmines an optimal bit ra te o f each sensor based on the targe t o ve rall distortion to minimize the ne twork tra nsmission cost. We propose an anal yticall y optimal ra te-distortion alloca tion scheme , and w e also e xtend it to a distribu ted ve rsion. Based on the presented allo cati on schemes, a greed y heu ristic algo rithm is proposed to build the most e fficien t da ta transmission structure to further redu ce the transmission cost. The proposed methods were evalu ated using simulations with real-world da ta sets. The simulation results indi cate that the op timal allo cation strate g y can reduce the transmission cost to 6 ~15% of tha t fo r the uni fo rm alloca tion scheme.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
A DATA THROUGHPUT PREDICTION AND OPTIMIZATION SERVICE FOR WIDELY DISTRIBUTED MANY-TASK COMPUTING
Paralle l and D istr ibute d System s, IEEE Tr ansa ctions June 201 1 ABSTRACT In this paper, we p resent the design and implementa tion of a n applica tion -la ye r data th roughpu t p rediction and optimi za tion servi ce for man y-task computing in widel y distribu ted en vi ronments. This service uses multiple parallel TCP streams to impro ve the e nd-to-end throu ghpu t o f da ta transfers . A n o vel mathema tical model is de veloped to de te rmine the number o f pa rallel streams, requi red to achie ve the best ne twork pe rfo rmance . This model can predict the optimal number of paral lel streams with as few as th ree pred iction points. We implement this new service in the Stork Data Scheduler, where the prediction poin ts can be ob tained using Ipe rf and Grid FTP samplings. Our results show tha t the predi ction cost plus the op timi zed trans fer time is much less than the nonop timi zed transfer time in most cases. As a resul t, Stork da ta transfe r jo bs with op timi zation servi ce can be completed much earlier, compared to nonop timi zed data trans fer jobs.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
TOWARD EFFICIENT AND SIMPLIFIED DISTRIBUTED DATA INTENSIVE COMPUTING

Paralle l and D istr ibute d System s, IEEE Tr ansa ctions June 201 1
ABSTRACT While the cap abili ty o f computing sys tems has been increasing at Moo re 's Law, the amoun t o f digi tal da ta has been increasing e ven fas ter. There is a growing need for s ystems tha t can manage and ana l yze very large da ta sets , pre ferabl y on shared-n othin g commodity sys tems due to th eir low e xpense . In this paper, we describe the design and implementa tion of a distributed file system calle d Se ctor an d an associated p rogramming framework called Sphe re tha t processes the data managed by Sector in paralle l. Sph ere is designed so tha t the p rocessing of da ta can be done in place o ver the da ta whene ve r possible. Sometimes, this is called data locality. We describ e the dire cti ves Sphere supports to impro ve da ta lo cali ty. In our e xpe rimental studies, the Se ctor/Sphe re system has consistentl y pe rformed abou t 2 -4 times faster than Hadoop , the most popular system for pro cessing very l arge da ta sets.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
NONLOCAL PDES-BASED MORPHOLOGY ON WEIGHTED GRAPHS FOR IMAGE AND DATA PROCESSING
Ima ge Pr ocess ing, IEEE Tra nsactions on Is sue Da te: June 2011
ABSTRACT Ma thema tical morpholog y (MM) offe rs a wide range o f opera tors to a ddress va rious image processing problems. These operators can be defined in te rms of algebraic (discre te ) sets or as partial di fferen tial equa tions (PD Es). In this paper, we introduce a nonl ocal PDEs-based morphologi cal framework de fined on weighted graphs. We present and anal yze a set of opera tors tha t leads to a famil y o f discreti zed morphological PDEs on weighte d graphs. Ou r fo rmulation in trodu ces nonlocal patch -based con figu ra tions fo r image p rocessing and e xtends PDEs-based approach to the p rocessing of arbi tra ry da ta such as nonuniform high dimensional data . Finall y, we show the p oten tiali ties of ou r methodolog y in orde r to p rocess, segment and classify images and arbi tra ry da ta .
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
IMAGE SEGMENTATION USING FUZZY REGION COMPETITION AND SPATIAL/FREQUENCY INFORMATION

This pa per a ppears in: Ima ge Pr ocess ing, IEEE Trans actions : June 2011 Abstrac t This paper presents a multiphase fu zzy region competi tion model tha t ta kes into accoun t spatia l and fre quency in formatio n for image segmenta tion . In the proposed energ y functional , ea ch region is rep resented b y a fu zzy membership function and a data fideli ty term tha t measures the confo rmity o f spatial and frequen cy da ta wi thin each regi on to (ge nerali zed) Gaussian densities whose parameters a re de termined jointl y wi th the segmenta tion process. Compared wi th the classical region compe titi on model, our approach gi ves soft segmentation results via th e fu zzy membership functions, and moreo ver, the use of fre quency da ta pro vides addi tional region in formation that ca n impro ve the overall segmenta tion result. To e ffi cien tl y sol ve the minimi zati on of the en erg y fun ctional , we adop t an alterna te minimiza tion p rocedu re and make use o f Chambolle's fast d uality projection algorithm. We appl y the p roposed method to syn the tic and natu ral te xtures as well as realworld na tural images. Exp erimental results show that our p roposed method has ve ry promising segmentation pe rfo rmance compared wi th the curren t sta te-o f-the art app roaches.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
PERCEPTUAL SEGMENTATION: COMBINING IMAGE SEGMENTATION WITH OBJECT TAGGING

Abstrac t Human observers understand the con tent o f an image i ntui ti vel y. Based upon image conten t, the y pe rfo rm many image-rela ted tasks, such as crea ting slide shows and photo albums, and organi zing their image archi ves. Fo r e xample , to select photos fo r an album, people assess image quality based upon the main objects in the image. The y modify colo rs in an image based upon the color o f importan t objects, such as sky, grass or skin. Serious pho tog raphers might modify each object separatel y. Pho to appl ica tions, in con trast, use low-le vel descrip to rs to guide similar tasks. Typical descrip tors, such as color histog rams, noise level , JPEG arti facts and o verall sharpness, can guide an imaging applica tion and safegua rd against blu nders. Howe ver, th ere is a gap between the outcome of such opera tions and the same task pe rfo rmed b y a pe rson. We belie ve that the gap can be b ridged b y automati call y unde rstanding the con ten t of the image. This paper presents algorithms for automa tic ta gging of percep tual objects in images, including sky, skin , and foliage , whi ch constitu tes an important step toward this goal .
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
VIBE: A UNIVERSAL BACKGROUND SUBTRACTION ALGORITHM FOR VIDEO SEQUENCES

Ima ge Pr ocess ing, IEEE Tra nsactions on Is sue Da te : June 2011
ABSTRACT This paper presents a techn ique fo r motion dete ction tha t inco rpora tes seve ral inno vati ve mechanisms. For e xample , our proposed techni que stores, for ea ch pi xel, a set o f values taken in the past a t th e same location o r in the neighborhood . It then compares this set to the current pi xel value in orde r to determine whe ther tha t pi xel belongs to the background , and adap ts the model b y choosing ra ndoml y whi ch values to substi tute from the ba ckground model. This approa ch di ffe rs from those based upon the classical belie f that the oldest va lues should be replaced first. Finall y, when the pi xel is found to be part of the backgro und, i ts value is propagated in to the background model of a neighbo ring pi xel. We descri be our method in ful l de tails (incl uding pseudo-code and the paramete r va lues used) and compare i t to o ther background subtra ction techni ques. Efficie ncy figures show that our method ou tperforms recen t and pro ven sta te -ofthe-a rt meth ods in te rms of bo th computa tion speed and dete ction ra te . We also anal yze the p erformance o f a downscaled version o f our alg ori thm to the absolute minimum of one comparison and on e b yte of memory per pi xel . It appears tha t e ven such a simplified version o f ou r algorithm perfo rms bette r than mainstream te chniques.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
CONTEXTUAL KERNEL AND SPECTRAL METHODS FOR LEARNING THE SEMANTICS OF IMAGES
Abstrac t This paper p resents con te xtual kern el and spectral methods fo r lea rning the semantics of images that allow us to automaticall y ann ota te an image with ke ywords . Fi rst, to e xploi t the conte xt of visual words wi thin images for au tomati c image annota tion , we de fine a n o vel spatial strin g ke rnel to quan ti fy the similarity between images. Speci ficall y, we represen t each image as a 2-D sequence of visual words and measure the similarity be tween two 2 -D sequences using the shared o ccurrences of s -length 1-D subsequences by decomposing each 2-D sequence into two orthogo nal 1-D sequences. Based on ou r p roposed spatial string kernel, we further fo rmulate automa tic image ann ota tion as a con te xtual ke ywo rd propaga tion problem, whi ch can be sol ved very effi cientl y b y linea r p rogramming. Unlike the traditi onal rele vance models tha t trea t each ke yword inde penden tl y, the p roposed conte xtual kernel method for ke ywo rd propaga tion takes in to accoun t the semantic con te xt o f ann ota tion ke yw ords and p ropaga tes multiple ke ywords simultaneousl y. Signifi can tl y, this type o f semantic con te xt can also be in corpo ra ted in to spectral embedding for refining the anno ta tions of images predicted b y ke ywo rd propaga tion . Expe riments on th ree standa rd image datasets demonstra te that ou r conte xtual ke rnel and spectral methods can a chie ve significa ntl y be tte r results than th e state o f the a rt.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
DISTRIBUTED MULTIPLE DESCRIPTION VIDEO CODING ON PACKET LOSS CHANNELS

Ima ge Pr ocess ing, IEEE Tra nsactions June 2011 ABSTRACT In this paper, we are to sol ve the d ri ft p roblem of multiple descrip tion video coding on p acke t loss channels b y using sta te -of-the-art distribu ted te chniques. We first present an as ympto tica ll y op timal co de design o f multiple descrip tions in the Wyner-Zi v (MDWZ) setting . Then we prop ose a distributed mul tiple description vide o co ding (D MD VC) scheme , whi ch pe rforms MDWZ coding on each n onintra coded frame. Instead o f the predi ction loops used in traditional multiple descri ptio n video coding, Slepian-Wol f based coding is used to e xplo it in terframe co rrela tions. A bi tplane e xtraction scheme is proposed to improve the balance between two descriptions , so that side informations can be inte rchanged be tween the side decoders of D MD VC wi th negl igible quali ty de grada tion , which is crucial to robust transmission over packe t loss channels. Experimen t results demonstrate the robustness of ou r scheme, especiall y at high pa cke t loss rates.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
SIZE-CONTROLLABLE REGION-OF-INTEREST IN SCALABLE IMAGE REPRESENTATION

Ima ge Pr ocess ing, IEEE Tra nsactions May 2011 ABSTRACT Differen tia ting region-o f-inte rest (ROI) from non-R OI in an image in terms of relati ve si ze as well as fidelity be comes an important fun ctionali ty for future visual communication en vi ronment wi th a varie ty o f displa y de vi ces. In this paper, we propose a scalable image representa tion wi th the R OI functionali ty in the spatial domain , which al lows us to genera te a hie rarch y o f images with arbi tra ry si zes. The R OI functionali ty o f ou r scalable represen ta tion is a result o f a nonuni form grid transformation in the spatial domain, wh ere onl y the cen te r o f R OI and an expansion paramete r are to be known . Our g rid transfo rmation guaran tees no loss of in fo rmation wi thin the a rea of R OI.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
GRAPH REGULARIZED SPARSE CODING FOR IMAGE REPRESENTATION

Ima ge Pr ocess ing, IEEE Tra nsactions on May 2011 ABSTRACT Sparse coding has re cei ved an incre asing amount of i nte rest in recen t yea rs. It is an unsupervised learning al gori thm, whi ch finds a basis set capturing high-le vel semantics in the da ta and learns sparse coord inates in te rms of the b asis set. Origina ll y applied to modeling the human visual corte x, sparse coding has been shown useful fo r man y applica tions . Howe ve r, most of the e xisting app roach es to sparse coding fa il to consider the geometrical structure o f the da ta space . In many real applica tions, the da ta is more likely to reside on a low-dimensional submanifold embedded in the high -dimensional ambient space. It has been shown tha t the g eometri cal info rmation o f the da ta is importan t fo r d iscrimination . In this paper, we propose a graph based algori thm, called graph regulari zed sparse coding, to learn the sparse representa tions tha t e xplici tl y take in to accoun t the lo cal manifold stru cture o f the da ta . By using g raph Lapl acian as a smooth opera to r, th e ob tained sparse representa tions vary smoothl y al ong the geodesics of the data manifol d. The extensi ve e xperimental results on image classifica tion an d cluste ring ha ve demonstrated the effe cti veness of ou r p roposed alg ori thm.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
DYNAMIC CONFLICT-FREE TRANSMISSION SCHEDULING FOR SENSOR NETWORK QUERIES

Mobile C om puting, IEEE Tra nsactions May 2011
ABSTRACT Wi th the emergence o f high da ta ra te sensor network appli cations, the re is an increasing demand for high-perfo rmance query services. To meet this challenge , we propose D ynamic Conflict-free Qu ery Sch eduling (DCQS), a no vel sched uling techniq ue fo r qu eries in wi reless sensor netw orks. In con tras t to ea rlier TD MA p ro tocols designed for gen eral -purpose workl oads, DCQS is speci ficall y designed for que ry services in wirel ess sensor networks. DCQS has se ve ral unique fe atu res. First, i t op timizes the query performance thro ugh con flict-free transmission scheduling based on the temporal p roperties o f queries in wireless sensor networks. Seco nd, i t can adap t to workload changes withou t e xpli citl y reconstructing the transmission schedule. Furthermore , DC QS also pro vides predictable perfo rmance in terms of the maximum achie va ble que ry ra te . We p ro vid e an anal yti cal capaci ty bound fo r DCQS tha t e nables DC QS to handle o ve rload th rough ra te con trol. NS2 simulations demonstrate tha t DC QS significan tl y ou tpe rforms a representa ti ve TD MA pro tocol (DR AND) and 802 .11b in te rms of query la tency and through put.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
COOPERATING WITH SMARTNESS: USING HETEROGENEOUS SMART ANTENNAS IN MULTI-HOP WIRELESS NETWORKS
Mobile C om puting, IEEE Tra nsactions Fe br uary 2011 ABSTRACT The use o f smart an tennas in multi-h op wi reless netwo rks (MWNs) has garne red significan t atten tion o ver the last few yea rs. While homogeneous MWNs wi th all nodes havi ng the same antenna capabili ties will ha ve ce rtai n applica tions , we argue that MWNs with nodes ha ving he te rogeneous an tenna ca pabili ties are more likel y to be the norm due to a vari ety o f moti vati ng fa cto rs. In the con te xt o f such heterogeneous smart ante nna ne tworks (HSANs), we in vestiga te and moti va te the need for a simple form o f node coope ra tion called retransmit diversity. We show that while such a simple form of node coopera tion cannot bring significan t bene fi ts to homogeneous omni-directional an tenna networks, th e y can bring g rea t gains to hete rogeneous smart an tenna ne two rks. We then p resent se ve ral ke y pro perties pertaining to n ode coop era tion in HSANs along with anal yti cal reasoning. In th e process, we identi fy a fundamental trade off be tween e xploiting smart an tenna gai n and co opera tion gai n, tha t unde rmines the abili ty o f H SANs to le verage node co opera tion to thei r ma ximum po ten tial . To address this tra deoff, we then present a n adapti ve coo pera tion mechanism and incorp ora te this mechanism through the design o f a simple but e ffi cien t MAC proto col . The perfo rmance o f th e MAC pro tocol is e valua ted through ns2 simulations along with a realisti c ph ysical la ye r channel model fo r smart an tenna en vironmen ts.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
CACAO: DISTRIBUTED CLIENT-ASSISTED CHANNEL ASSIGNMENT OPTIMIZATION FOR UNCOORDINATED WLANS

Paralle l and D istr ibute d System s, IEEE Tr ansa ctions February 2011
ABSTRACT IEEE 802 .11 WL ANs are becoming more and more popular in homes and urban areas. As compared to tradi tional WL AN se tups (such as in campuses) where knowledgeable ne twork administra to rs can make cen trali zed decisions on channel selection , access points (APs) in these networks are o ften deplo yed b y network non-specia lists in an uncoordin ated manner, leadin g to unpl anned topolog y, in terfe rence and there fore unsa tisfactory th roughpu t performance . We consider i n this pape r a distrib uted channel uncoordina ted WL ANs, where APs can self-con figure minimize interfe rence wi th adjacen t APs. We fi rst problem on channel assignment which o vercomes encoun tered b y un coordina ted WL ANs. assignment algori thm fo r their ope rating channels to fo rmulate the op timi za tion some of the weaknesses
We show tha t th e problem is NP-hard , and propose an efficien t, simple and distribu ted algori thm termed C AC AO (Cli ent-Assisted Channel Assignment Op timization ). In C AC AO, the clien ts feed back thei r tra ffi c info rmation to thei r APs. Th is leads to bette r knowledg e about ne twork en vi ronment and be tte r channel assignment decisions a t the APs. We condu ct e xtensi ve simulation stud y a nd comparisons using Network Simulato r 2 (NS2). Ou r results show that C AC AO ou t-pe rfo rms other trad ition al and recen t schemes in terms of TC P and UD P throug hputs wi th a similar le vel o f fairness. Furthermore , i t con verges qui te fas t and redu ces co-cha nnel in terferen ce significan tl y.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
SCHEDUL ABILITY AN ALYSIS FOR H ARD NET WORK LIFETIM E WIRELESS SENSOR NET WORKS WITH HIGH ENERGY FIRST CLUSTERING
Reliability , IEEE Tra nsactions Apr il 2011
ABSTRACT Network li fetime pred ictabili ty is an essential system requi rement for the type o f wireless sensor network (WSN) used in safe ty-cri ti cal and highl y-rel iable applica tions. Al l sensor nodes in these time-cri tical WSNs should meet the li fetime cons train t at an y time instance , else i t may cause seve re consequen ces tha t in vol ve economic losses, or even fa tali ties. In the lite ra ture , cluste ring sensors into groups is a popular strateg y to maximi ze the ne twork li fe time, bu t none of the clustering algo ri thms address the predictabili ty issue for time-cri tical WSNs. In this paper, the High Energ y First (H EF) cluste ring algori thm is chosen as a design refe rence model, whi ch is pro ved in this pape r to be a n op timal cluste ring policy u nder certain ideal condi tions. To address netwo rk life time p redictabili ty in practice , the ne twork life time bounds and feasibili ty test for the H EF a re de veloped via the worst case energ y consumption anal ysis. The ne twork simulator 2 (NS2 ) is used to veri fy the prop osed network li fetime predictabili ty model, and the resul ts show that the de ri ved bounds of the predictabili ty pro vide accura te estimatio ns o f the s ystem li fe time.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
ANOMALY DETECTION IN NETWORK TRAFFIC BASED ON STATISTICAL INFERENCE AND ALPHA-STABLE MODELING
Depe nda ble a nd Se cure C om puting, IEEE Tra nsactions July-Aug. 2011 ABSTRACT This paper proposes a no vel method to detect anomalies in network traffi c, based on a nonrestricted -stable first-orde r model and sta tisti cal h ypo thesis testing . To this end, we gi ve statis tical e vidence tha t th e marginal distribu tion o f rea l traffi c is adequatel y modeled with -stabl e fun ctions and classify tra ffic pa tterns b y means of a Gene rali zed Li kelihood Ra tio Test (GLRT). The method au tomatica ll y chooses tra ffic windows used as a reference , which the tra ffic window und er test is compared wi th , wi th no e xpert in terven tion nee ded to tha t end . We fo cus on dete cting two anomal y types, namel y floods and flashcrowds, which ha ve been frequen tl y studi ed in the li tera ture. Performance o f our dete ction method has been measured through Recei ve r Opera ting Cha racteris tic (R OC) curves and results indica te that ou r method outperfo rms the closel y-rela ted sta te-o f-the -art con tri butio n described in . Al l e xperiments use traffi c data colle cte d from two rou ters at our uni ve rsity-a 25,000 studen ts institu tion-w hich pro vide two di fferen t le vels of tra ffi c aggrega tion fo r our tests (tra ffic a t a p articula r school an d the whole uni versity). In addi tion , the tra ffic model is tested with publicl y a vailable tra ffic traces. Due to the comple xi ty o f -sta ble distribu tions, care has been taken in designing appropria te numerical algo ri thms to deal wi th the model .
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
ELMO: ENERGY AW ARE LOCAL MONITORING IN SENSOR NETWORKS

Depe nda ble a nd Se cure C om puting, IEEE Tra nsactions July-Aug. 2011 ABSTRACT Ove r the past de cade , loca l monitoring has been shown to be a po werful techniq ue fo r impro ving securi ty in multihop wi reless sensor netw orks (WSNs). Indeed , lo cal monito ring-based securi ty algo ri thms are becoming the most popular to ol fo r pro viding securi ty in WSNs. How e ver, lo cal monitorin g as it is curren tl y practiced is costl y in te rms of en erg y consumption , a major d rawback for ene rg y-constrained s ystems such as WSNs. In WSN en vironments , the scarce power resources are typi call y add ressed through sleep-wake schedulin g of the nodes. Howe ver, sleep-wake schedul ing te chniques in WSNs are vulnera ble e ven to simple attacks. In this paper, a ne w technique is proposed th at promises to allow operati on o f WSNs in a manner tha t is bo th ene rg y-e ffi cien t and secure . The proposed te chnique combines local moni toring wi th a n o vel , more secu re form o f sleep-wake sched uling . The la tte r is a new methodolog y dubbed Elmo (Energ y Awa re Local MOni to ring in Sensor Ne tworks), which enables sleep-wa ke management in a secure manner even in th e fa ce o f ad ve rsarial nodes tha t choose no t to awaken nodes responsible fo r moni toring thei r tra ffic. An a nal ytical p roo f is gi ven showing tha t securi ty co ve rage is not wea kened under Elmo. Moreo ver, ns-2 simulation results show tha t the performance o f lo cal monitoring is practi call y unchan ged, while energ y sa vings o f 20 to 100 times are achie ved , depending on the scenario .
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
EFFICIENT FAULT DETECTION AND DIAGNOSIS IN COMPLEX SOFTWARE SYSTEMS WITH INFORMATIONTHEORETIC MONITORING
Depe nda ble a nd Se cure C om puting, IEEE Tra nsactions on ABSTRACT Ma nagement metrics o f comple x software sys tems exhibi t stable co rrel ations which can enab le faul t de te ctio n and diagnosis. Cu rren t approa ches use specifi c anal yti c fo rms, typi call y linea r, for modeling correla tions. In practice , more complex non linear rel ationships e xist be tween metri cs. Mo reo ve r, most in te rmetri c correl ations fo rm cluste rs ra ther th an simple pairwise correla tions . Th ese clusters pro vide addi tional information and o ffe r the possibility for op timi za tion . In this pape r, we add ress these issues by using Normali zed Mu tual Information (N MI) as a similarity measure to iden ti fy clusters of co rrela ted metrics, wi thou t assuming any speci fic form for the metri c relatio nships. We show how to appl y the Wilco xon Rank-Sum test on the en trop y measures to detect e rro rs in the s ystem. We also present th ree diagn osis algorithms to l oca te faul ty components: Rati oSco re , based on the Ja cca rd coe ffici ent, SigScore , which incorpora tes knowledge o f component depe ndencies, and Ba yesianScore , which uses Ba yesian i nfe rence to assign a faul t probab ility to ea ch component. We e valu ate ou r approach in the conte xt of a comple x en terp rise applica tion , and show that 1 ) stable , nonlinea r correla tions e xist and can be cap tured w ith ou r approach ; 2 ) we can de tect a l arge fra ction o f faul ts with a low false positi ve ra te (we dete ct u p to 18 o f the 22 faul ts we injected); and 3 ) we impro ve the diagnosis with our new diagnosis algo rithms.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
PRIVACY-PRESERVING UPDATES TO ANONYMOUS AND CONFIDENTIAL DATABASES

Depe nda ble a nd Se cure C om puting, IEEE Tra nsactions on ABSTRACT Suppose Alice owns a k-anon ymous da tabase and needs to de termine wh ethe r her da tabase , wh en inserted wi th a tuple owne d b y Bob , is still k-anon ymous. Also , suppose that a ccess to the da tabase is strictl y con trolled , because fo r example data are used for certain e xpe riments tha t need to be maintained confide ntia l. Cle arl y, allo wing Ali ce to dire ctl y rea d the con ten ts of the tuple breaks th e pri vacy o f Bo b (e .g ., a pa tien t's medical re cord ); on the o the r hand , the con fiden tiali ty o f th e database managed b y Alice is viola ted once Bo b has access to the con ten ts o f the da tabase. Thus, the problem is to che ck whe ther the datab ase inserted wi th the tuple is still k-anon ymous, with out le ttin g Ali ce and Bob know the con ten ts o f the tuple and the da tabase, respecti vel y. In this paper, we p ropose two pro tocols solving this problem on suppression-based and generaliza tion -based k-anon ymous and confide ntia l da tabases. The pro toco ls rel y on well-known cryptographi c assumptions, and we pro vide theore ti cal anal yses to p roo f their soundness and e xpe rimental results to illustra te thei r effi ciency.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
DYNAMICS OF MALWARE SPREAD IN DECENTRALIZED PEER-TO-PEER NETWORKS

Depe nda ble a nd Se cure C om puting, IEEE Tra nsactions July-Aug. 2011 Abstrac t In this pape r, we fo rmulate an anal yti cal model to cha racteri ze the spread o f malware in de centrali zed, Gnute lla type peer-to-pee r (P2P) ne tworks and stud y the d ynamics associated wi th the spread of malware . Using a compartmen tal model , we de ri ve the sys tem paramete rs or ne twork conditi ons under whi ch the P2P ne twork ma y re ach a malware free equilibrium . The model also e valua tes the e ffect o f con trol stra tegies like node quaran tine on stifling the spread o f malware. The model is then e xtended to consider the impact of P2P ne two rks on the malware spre ad in ne two rks o f smart cell phones.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
LOW-ENERGY SYMMETRIC KEY DISTRIBUTION IN WIRELESS SENSOR NETWORKS

Depe nda ble a nd Se cure C om puting, IEEE Tra nsactions May-June 2011
ABSTRACT In this work, a scheme for ke y distri butio n and netw ork access in a Wi reless Sensor Netw ork (WSN) tha t u tili zes Iden ti ty-Based Cryp tog raph y (IBC) is presented . The scheme is anal yzed on the AR M92 0T p rocessor and measurements were taken fo r the run time and ene rg y o f i ts componen ts. It was found tha t the Ta te pairing componen t o f the scheme consumes significan t amounts of energ y, and so should be ported to ha rdware. An a ccele rato r was implemented in 65 nm Complementary Me tal Oxide Sili con (C MOS) technolo g y a nd a rea, timing, and ene rg y figures ha ve been ob tained fo r the design. Results indica te tha t a hardwa re implementa tion of IBC w ould meet the strict energ y cons train t requi red of a wire less sensor netwo rk node .
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
REPLICA PLACEMENT FOR ROUTE DIVERSITY IN TREEBASED ROUTING DISTRIBUTED HASH TABLES
Depe nda ble a nd Se cure C om puting, IEEE Tra nsactions May-June 2011 ABSTRACT Distribu ted hash tables (DH Ts) share storage and rou ting responsibility among all nodes in a peer-to-p eer ne twork. Th ese netwo rks ha ve bound ed pa th leng th unlike unstructu red ne two rks. Unfo rtunatel y, nodes can den y a ccess to ke ys o r misroute loo kups. We add ress both o f these problems through replica pla cement. We cha racteri ze tree -based rou ting DH Ts and define Ma xDisjoin t, a repli ca placement tha t crea tes rou te di versity for these DH Ts. We p ro ve that this placement crea tes disjoint rou tes and find the repli ca tion deg ree necessary to produce a desired number o f disjoin t rou tes. Using simulations of Pastry (a tree-b ased routi ng DHT), we e valua te the impact of Ma xDisjoin t on routing rob ustness compared to other placements when nodes are compromised at ra ndom or in a con tiguous run . Furthermore , we co nsider ano ther rou te di ve rsity mecha nism that we call neighbor set rou ting a nd show that, w hen used wi th ou r repl ica pla cement, i t can successfully rou te messages to a correct re plica e ven wi th a quarte r of the nodes in the s ystem compromised a t random. Finall y, we demonstra te a famil y o f repl ica que ry stra tegies tha t can trade o ff response time and sys tem load. We p resent a h ybrid query strateg y tha t keeps response time lo w wi thou t produ cing too high a loa d.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
ROBUST CORRELATION OF ENCRYPTED ATTACK TRAFFIC THROUGH STEPPING STONES BY FLOW WATERMARKING
Depe nda ble a nd Se cure C om puting, IEEE Tra nsactions May-June 2011 ABSTRACT
Netwo rk-ba sed intrude rs seldom attac k their victims direc tly f rom their o wn compute r. O ften, they stage their attac ks th rough intermediate stepping stone s in orde r to conceal their identity and origin. To identify the source of the at tac k behind the stepping stone (s), it i s ne ce ssa ry to correlate the incoming and outgoing flows o r conne ction s of a stepping stone. To re si st attempt s a t co rrelation, the atta c ke r may enc rypt or otherwi se manipulate the connection t raffic. Timing-ba sed co rrelation approache s have been shown to be quite effe ctive in correlating encryp ted connection s. Ho weve r, timing-ba sed co rrelation approache s a re subject to timing pertu rbation s that may be deliberately introdu ced by the atta c ke r at stepping stone s. In this pape r, we p ropo se a novel wate rmark-ba sed -co rrelation scheme that is de signed spe cifically to be robu st again st timing perturbation s. Unlike mo st p reviou s timing-ba sed correlation approa che s, ou r wate rmark-ba sed approa ch i s active in that it embed s a unique wa terma rk into the enc rypted flows by slightly adju sting the timing of selected pac ket s. The unique waterma rk that i s embedded in the encrypted flow give s us a number of ad vantage s ove r pa ssi ve timing-ba sed co rrelation in re si sting timing pertu rbation s by the attac ker. In cont ra st to the exi sting pa ssive correlation approache s, ou r active wate rmark-ba sed correlation does not ma ke any limiting assumption s about the distribution or random proce ss of the original interpac ket timing of the pac ke t flow. In theory, ou r wate rmark-ba sed co rrelation can achieve arbitra rily clo se to 100 percent co rrelation true po sitive ra te (TPR), and arbitra rily clo se to 0 percent fal se po sitive rate (FP R) at the same time for sufficiently long flows, de spite arbitra rily large (but bounded ) timing pertu rbation s of any di stribution by the attac ke r. Our pape r i s the fi rst that identifies 1) accura te quantitative t radeoff s between the achievable co rrelation effectivene ss a - - nd the defining characte ri stic s of the timing perturbation; and 2) a provable upper bound on the number o f pac ke t s needed to achieve a de si red correlation effectivene ss, given the amount of timing pertu rbation. Experimental re sult s show that our a ctive waterma rk-ba sed correlation perfo rm s bette r and require s fe we r pac ket s than exi sting, pa ssive timing-ba sed correlation methods in the pre sence of random timing pertu rbation s.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
LOW-OVERHEAD END-TO-END PERFORMANCE MEASUREMENT FOR NEXT GENERATION NETWORKS

Network a nd Service Ma nage ment, IEEE Transactions on ABSTRACT In terne t performance measurement is commonly percei ved as a high-cost control-pla ne acti vi ty and un til now it has tended to be implemented on top o f the network's fo rward ing o pera tion . Consequentl y, measurement mechanisms have often had to trade rele vance and accura cy o ver non-intrusi veness and cost effecti ven ess. In this paper, we present the software implementa tion o f an in-line measurement mechanism that uses nati ve structures of the In te rnet Pro tocol ve rsion 6 (IPv6) sta ck to pigg yback measurement information on data -carrying tra ffic as this is routed between two points in the ne twork. We care full y e xamine the o verhea d associated with bo th the measurement process and the measurement da ta , and w e demonstra te tha t dire ct two -poin t measurement has minimal impact on throug hput and on s ystem p rocessing load . The results of this paper show tha t adequatel y engineered measurement mechanisms that e xploi t selecti ve pro cessing do not compromise the network's forwa rding e fficie ncy, a nd can be depl o yed in an alwa ys -on manner to re veal the true pe rfo rmance of ne twork tra ffi c o ver small timescales.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
ON THE IMPACT OF SECURITY PROTOCOLS ON THE PERFORMANCE OF SNMP

Network a nd Service Ma nage ment, IEEE Transactions March 2011 ABSTRACT Since th e earl y 1990s, there ha ve been se veral a ttempts to secure the Simple Network Man agement Pro tocol (SN MP). The thi rd ve rsion of the p ro tocol , published as full standard in 2002 , i ntroduced the User-based Secu rity Model (USM), whi ch comes with i ts own user and ke y-management in frastructure . Since then , ne twork opera to rs ha ve repo rte d tha t depl o ying ano the r user and ke y management infrastru ctu re to secure SN MP is e xpensi ve and a reason to no t deplo y SN MPv3. This paper describes how e xisting secu rity pro to cols opera ting abo ve the transport la yer and below applica tion pro tocols can be used to secure SN MP. These pro tocols can take ad van tage o f alre ad y d eplo yed ke y management infrastructu res tha t are used for o the r ne twork management in terfaces and hen ce their use can redu ce the ope ra tional costs associa ted with securing SN MP. Our main con tribu tion is a deta iled performance anal ysis of a p rototype implementation , comparing the pe rfo rmance o f SN MPv3 o ver SSH , TLS, and DTLS wi th other ve rsions of SN MP. We also discuss the diffe rences be tween the va rious options to secu re SN MP and pro vide guidelines fo r choosing solutions to implement or deplo y.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
LOCATING EQUIVALENT SERVANTS OVER P2P NETWORKS

ABSTRACT While pee r-to-pe er ne tworks are mainl y used to loca te uni que resources across the In te rnet, new interesting deplo ymen t scenarios are emerging. Pa rticula rl y, some applications (e.g ., VoIP) are proposing the crea tion o f o verla ys for the locali za tion o f services b ased on equi va lent serva nts (e .g., voi ce rela ys). This paper e xplores th e possible ove rla y a rchi te ctu res tha t ca n be adop ted to pro vide such servi ces, showing how an u nstru ctu red solution based on a scalefree o verla y topolog y is an effe cti ve op tion to deplo y in this con te xt. Consequentl y, we propose EQU ATOR (EQUi valen t servAn t loca TOR), an unstructure d o verla y implementing th e abo ve mentioned op era ting principles, based on an overla y cons truction algo ri thm tha t well appro ximates an ideal scalefree co nstru ctio n model . We p resent bo th ana l ytical and simulation results which support our o verla y topolog y selection and val idate the prop osed archi tecture .
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
COOPERATIVE CHANNELIZATION IN WIRELESS NETWORKS WITH NETWORK CODING

Paralle l and D istr ibute d System s, IEEE Tr ansa ctions July 201 1 ABSTRACT In th is paper, we add ress congestion of multi cast tra ffic in multihop wi reless networks through a combina tion o f n etwo rk cod ing a nd resource reserva tion. Network coding reduces the number o f tra nsmissions required in mul ticast flows, thus allowing a netwo rk to approach i ts multicast capa ci ty. In add ition , i t efficien tl y repairs errors in multicast flows b y combining pa cke ts lost at di fferen t destinations . Howe ver, unde r condi tions of e xtremel y h igh con gestion the repair capab ility o f network coding is seriousl y degraded . In this paper, we p ropose coope rati ve channeli za tion , in whi ch po rti ons of th e transmission media are alloca ted to links tha t are congested a t the poin t wh ere ne twork cod ing canno t e fficien tl y repai r loss. A he alth me tric is proposed to allow comparison o f need fo r chan neli za tion o f differen t multi cast lin ks. Coop era ti ve channeli za tion considers the impact o f channeli za tion on o verall ne two rk pe rfo rmance be fore resource reservation is trigge red . Our results show that coope rati ve chan neli za tion impro ves ove rall ne twork perfo rmance while being well suited for wirel ess networks using n etwo rk co ding.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
THROUGHPUT OPTIMIZATION IN MULTIHOP WIRELESS NETWORKS WITH MULTIPACKET RECEPTION AND DIRECTIONAL ANTENNAS
Paralle l and D istr ibute d System s, IEEE Tr ansa ctions July 201 1 ABSTRACT Recent ad vances in the ph ysical la yer ha ve e nabled the simultaneous recep tion of multipl e packets b y a node in wire less networks . We address the th roughpu t optimi za tion problem in wireless networks that support multipacket re cep tion (MPR ) capabili ty. The problem is modeled as a joint routin g and scheduling problem, whi ch is known to be NP-hard . The scheduling subproblem deals with finding the optimal schedulable sets, w hich a re de fined as subsets of lin ks tha t can be scheduled o r acti vated simultaneously. We demonstra te tha t an y solution o f the scheduling subproblem can be built with |E| + 1 or fe wer schedulable sets, whe re |E| is the number o f li nks o f th e ne two rk. This result is in contras t with p re vious works tha t sta ted that a soluti on of the scheduling subproblem is composed of a n e xpo nenti al number o f schedu lable sets. Due to the hardness of the problem , we p ropose a pol ynomial time scheme based on a combination of linear programming and appro ximation algo rithm paradigms. We ill ustra te the use o f the scheme to s tud y the impact o f design paramete rs on the pe rfo rmance o f MPR-capable ne two rks, including th e number o f transmit interfa ces, the beamwid th, and the re cei ve r range o f the an tennas.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
ATTRIBUTE-BASED ACCESS CONTROL WITH EFFICIENT REVOCATION IN DATA OUTSOURCING SYSTEMS

Paralle l and D istr ibute d System s, IEEE Tr ansa ctions on ABSTRACT Some of the most challengin g issues in data outsourcing scenario a re the enforcement o f au tho ri za tion p olicies and the support o f po licy upda tes. Cipherte xt-poli cy attribute -based encryp tion is a promising cryp tograph ic solu tion to these issues for enforcing a ccess control poli cies defined b y a da ta owner on outsourced da ta . Howe ver, the problem of appl ying the attri bute -based encryption in an outsourced archi tecture in trodu ces se veral challen ges with rega rd to the a ttribu te and user re voca tion . In this pape r, we p ropose an access con trol mechanism using cipherte xt-policy attribu te-b ased encryp tion to enforce access control policies with e fficien t attribu te and user re vo cation capabili ty. The fine-g rained access control can be achi e ved b y d ual encryp tion mechanism which takes ad van tage o f th e a ttribu te-b ased encryp tion a nd selecti ve grou p ke y distribu tion in ea ch a ttribu te group. We d emonstrate how to appl y th e proposed mechanism to secu rel y manage the ou tsourced da ta . The an al ysis results indi cate tha t the p roposed scheme is e ffi cien t and secure in the data ou tsourcing s ystems.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
NETWORK IMMUNIZATION WITH DISTRIBUTED AUTONOMY-ORIENTED ENTITIES

Paralle l and D istr ibute d System s, IEEE Tr ansa ctions July 201 1 ABSTRACT Ma n y communica tion s ystems, networks. For such netwo rks, pre ven ting malicious atta cks or neighboring nodes followin g thei r e.g ., in tern et, can be modeled as comple x immuni zation stra tegies are necessary fo r vi ruses being percolated from a node to its connecti vities.
In re cen t years , various immunizatio n stra tegies ha ve been p roposed and demonstrated , most of which rest on the assumptions that the stra tegies can be execu ted in a cen tra li zed manner and /or tha t the comple x ne twork a t hand is reasonabl y stable (i ts topolog y will no t change o ve rtime). In o the r words, it would be diffi cul t to appl y them in a decentra li zed ne twork en vironment, as often found in the real worl d. In this paper, we propose a d ecen trali zed and scalable immuni zation strateg y based on a self-organi ze d computing app roach called au tonom y-o rien ted computing (AOC) [1 ], [2 ]. In this stra teg y, au tonomous beha vio r-based en tities are deplo yed in a de cen trali zed ne twork, and a re capab le o f colle cti vel y fi nding those nodes wi th high degrees o f conducti vities (i.e ., those tha t can readil y spread vi ruses). Through e xpe riments in vol ving bo th s yn the tic an d real -world networks , we demonstrate tha t this stra teg y can e ffecti vel y and e fficien tl y lo ca te highl yconnected nodes in dece ntrali zed comple x ne twork en vi ronments of various topologies, and i t is also scalable in handli ng la rge-scale de cen trali zed netw orks. We ha ve compared our stra teg y w ith some of the well -know n stra tegies, incl uding acquain tance and co vering stra tegies on bo th s yn the tic and real-wo rld networks .
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
OPTIMIZATION OF RATE ALLOCATION WITH DISTORTION GUARANTEE IN SENSOR NETWORKS

Paralle l and D istr ibute d System s, IEEE Tr ansa ctions on July 2011 Abstrac t Lossy compression te chniques a re commonl y used b y long -term da ta-ga the ring applica tions tha t attempt to identi fy tre nds or other in teres ting patte rns in an entire system since a data packe t ne ed no t alwa ys be completel y and immediately transmitted to the sink. In these appli cati ons, a non te rminal sensor node jointl y encodes its own sensed data and the da ta re cei ved from i ts nearb y nodes. The tendency for these nodes to ha ve a high spatial correla tion means that these data pa cke ts can be effi cien tl y compressed toge ther using a ra te-distortion strateg y. This paper addresses the op timal ra te-distortion allo ca tion p roblem, whi ch determines an optimal bi t ra te o f each sensor based on the ta rge t o ve rall distortion to minimize the ne twork tra nsmission cost. We propose an anal yticall y optimal ra te-distortion alloca tion scheme , and w e also e xtend it to a distribu ted ve rsion. Based on the presented allo cati on schemes, a greed y heu ristic algo rithm is proposed to build the most e fficien t da ta transmission structure to further redu ce the transmission cost. The proposed metho ds were e val uated using simulations with real -world da ta sets. The simulation resul ts indica te th at the op timal alloca tion s tra teg y can redu ce the transmission cost to 6~15% o f that for the uni form allo ca tion scheme.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
A DATA THROUGHPUT PREDICTION AND OPTIMIZATION SERVICE FOR WIDELY DISTRIBUTED MANY-TASK COMPUTING
Paralle l and D istr ibute d System s, IEEE Tr ansa ctions June 201 1 Abstrac t In this paper, we p resent the design and implementa tion of a n applica tion -la ye r data th roughpu t p rediction and optimi za tion servi ce for man y-task computing in widel y distribu ted en vi ronments. This service uses multiple parallel TCP streams to impro ve the e nd-to-end throu ghpu t o f da ta transfers . A n o vel mathema tical model is de veloped to de te rmine the number o f pa rallel streams, requi red to achie ve the best ne twork pe rfo rmance . This model can predict the optimal number of paral lel streams with as few as th ree pred iction points. We implement this new service i n th e Stork Da ta Scheduler, whe re the pred iction points can be obta ined using Ip erf and Grid FTP samplings. Our results show tha t the prediction cost plus th e op timized transfe r time is much less than the nonoptimi zed transfe r time in most cases. As a resul t, Stork da ta tra nsfer jobs wi th optimization service can be comple ted much earlie r, compared to nonop timi zed da ta transfe r jo bs.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
TOWARD EFFICIENT AND SIMPLIFIED DISTRIBUTED DATA INTENSIVE COMPUTING

Paralle l and D istr ibute d System s, IEEE Tr ansa ctions June 201 1 ABSTRACT While the cap abili ty o f computing sys tems has been increasing at Moo re 's Law, the amoun t o f digi tal da ta has been increasing e ven fas ter. There is a growing need for s ystems tha t can manage and ana l yze very large da ta sets , pre ferabl y on shared-n othin g commodity sys tems due to th eir low e xpense . In this paper, we describe the design and implementa tion of a distributed file system calle d Se ctor an d an associated p rogramming framework called Sphe re tha t processes the data managed by Sector in paralle l. Sph ere is designed so tha t the p rocessing of da ta can be done in place o ver the da ta whene ve r possible. Sometimes, this is ca lled data lo cali ty. We describe the directi ves Sphe re supports to impro ve da ta lo cali ty. In ou r experimenta l studies, the Sector/Sp here s ystem has consistentl y performed about 2 -4 times faster than Hadoop , the most popula r s ystem for processing very large d ata sets.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
NONLOCAL PDES-BASED MORPHOLOGY ON WEIGHTED GRAPHS FOR IMAGE AND DATA PROCESSING
Ima ge Pr ocess ing, IEEE Tra nsactions June 2011 ABSTRACT Ma thema tical morpholog y (MM) offe rs a wide range o f opera tors to a ddress va rious image processing problems. These operators can be defined in te rms of algebraic (discre te) sets o r as partial di ffe ren tial equa tions (PDEs). In this paper, we in trodu ce a nonlo cal PD Es-based morphological framework defined on wei ghted gra phs. We present and a nal yze a set o f opera tors tha t leads to a famil y o f discre ti ze d morpholo gical PD Es on weigh ted graphs . Our fo rmulation in trodu ces nonloca l pa tch -based con figu rations fo r image processing and e xtends PD Es-based approach to the pro cessing of arbi tra ry da ta such as nonuniform high dimensional data. Finall y, we show the po ten tiali ties of our methodolog y in order to process, segment and classify images and arbitrary data .
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
IMAGE SEGMENTATION USING FUZZY REGION COMPETITION AND SPATIAL/FREQUENCY INFORMATION

Ima ge Pr ocess ing, IEEE Tra nsactions June 2011 ABSTRACT This paper presents a multiphase fu zzy region competi tion model tha t ta kes into accoun t spatia l and fre quency in formatio n for image segmenta tion . In the proposed energ y functional , ea ch region is rep resented b y a fu zzy membership function and a data fideli ty term tha t measures the confo rmity o f spatial and frequen cy da ta wi thin each regi on to (ge nerali zed) Gaussian densities whose parameters a re de termined jointl y wi th the segmenta tion process. Compared wi th the classical region compe titi on model, our approach gi ves soft segmentation results via th e fu zzy membership functions, and moreo ver, the use of fre quency da ta pro vides addi tional region in formation that ca n impro ve the overall segmenta tion result. To e ffi cien tl y sol ve the minimi zati on of the en erg y fun ctional , we adop t an alterna te minimiza tion p rocedu re and make use o f Chambolle's fast d uality projection algorithm. We appl y the pro posed method to synthe ti c and natu ral te xtures as well as real-wo rld natu ral images. Experimen tal results show that our p roposed method has very p romising segmentation performance compared with the cu rren t sta te-o f-the -art approaches.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
PERCEPTUAL SEGMENTATION: COMBINING IMAGE SEGMENTATION WITH OBJECT TAGGING

Ima ge Pr ocess ing, IEEE Tra nsactions June 2011 ABSTRACT Human observers understand the con tent o f an image i ntui ti vel y. Based upon image conten t, the y pe rfo rm many image-rela ted tasks, such as crea ting slide shows and photo albums, and organi zing their image archi ves. Fo r e xample , to select photos fo r an album, people assess image quality based upon the main objects in the image. The y modify colo rs in an image based upon the color o f importan t objects, such as sky, grass or skin. Serious pho tog raphers might modify each object separatel y. Pho to appl ica tions, in con trast, use low-le vel descrip to rs to guide similar tasks. Typi cal descri pto rs, such as color his tograms, noise le vel, JPEG arti facts and overall sharpness, ca n guide an imaging appl ica tion and sa feguard a gainst blunders. Howe ver, the re is a gap between the ou tcome of such opera tions and the same task performed b y a person. We belie ve tha t the gap can be b ridged b y au tomati call y u nderstand ing the conten t o f the image . This paper presen ts algori thms for au tomati c tagging o f percep tual obj ects in images, includin g sky, skin , and foliage , whi ch consti tutes an importan t ste p towa rd this g oal.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
VIBE: A UNIVERSAL BACKGROUND SUBTRACTION ALGORITHM FOR VIDEO SEQUENCES

Ima ge Pr ocess ing, IEEE Tra nsactions June 2011 ABSTRACT This paper presents a techn ique fo r motion dete ction tha t inco rpora tes seve ral inno vati ve mechanisms. For e xample , our proposed techni que stores, for ea ch pi xel, a set o f values taken in the past a t th e same location o r in the neighborhood . It then compares this set to the cu rren t pi xel value in orde r to de termine wh ethe r tha t pi xel belongs to the background , and adap ts the model b y choosing randoml y which values to substitu te from the backgroun d model. This approa ch differs from those based upon the classical belief that the oldest values should be replaced first. Finall y, when the pi xel is found to be part of the background , i ts val ue is propaga ted in to the backgroun d model o f a neighbo ring pi xel . We describe ou r method in full de tails (includi ng pseudo-code and the parame ter val ues used) and compare i t to o the r b ackg round subtraction te chniques. Efficie ncy figures show that our method ou tperforms recen t and pro ven sta te -ofthe-a rt metho ds in terms of both computati on speed and detecti on rate . We also anal yze the performance o f a downscaled ve rsion of our algo ri thm to the absolu te minimum of one comparison and o ne b yte o f memory p er pi xel . It appea rs tha t e ven such a simplified version of our algo rithm performs bette r than mainstream techn iques.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
CONTEXTUAL KERNEL AND SPECTRAL M ETHODS FOR LEARNING THE SEM ANTICS OF IM AGES
Ima ge Pr ocess ing, IEEE Tra nsactions June 2011 ABSTRACT This paper p resents con te xtual kern el and spectral methods fo r lea rning the semantics of images that allow us to automaticall y ann ota te an image with ke ywords . Fi rst, to e xploi t the conte xt of visual words wi thin images for au tomati c image annota tion , we de fine a n o vel spatial strin g ke rnel to quan ti fy the similarity between images. Speci ficall y, we represen t each image as a 2-D sequence of visual words and measure the similarity be tween two 2 -D sequences using the shared o ccurrences of s -length 1-D subsequences by decomposing each 2-D sequence into two orthogo nal 1-D sequences. Based on our proposed spati al string ke rnel , we fu rther fo rmulate au tomati c image annotation as a conte xtual ke yword p ropaga tion probl em, which can be solved ve ry e ffi cien tl y b y linea r prog ramming. Unlike the tradi tiona l rele van ce models that trea t each ke ywo rd independen tl y, the pro posed conte xtual ke rnel method for ke yword propaga tion takes into account the semantic conte xt o f annota tion ke ywords a nd p ropaga tes multi ple ke ywo rds simultaneousl y. Signifi can tl y, this type o f semantic con te xt can also be in corpo ra ted in to spectral embedding for refining the anno ta tions of images predicted b y ke ywo rd propaga tion . Expe riments on th ree standa rd image datasets demonstra te that ou r conte xtual ke rnel and spectral methods can a chie ve significa ntl y be tte r results than th e state o f the a rt.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
DECISION TREES FOR UNCERTAIN DATA

ABSTRACT
Traditional decision tree classiers work with data whose values are known and precise. We extend such classiers to handle data with uncertain information, which originates from measurement/quantisation errors, data staleness, multiple repeated measurements, etc. The value uncertainty is represented by multiple values forming a probability distribution function (pdf). We discover that the accuracy of a decision tree classier can be much improved if the whole pdf, rather than a simple statistic, is taken into account. We extend classical decision tree building algorithms to handle data tuples with uncertain values. Since processing pdfs is computationally more costly, we propose a series of pruning techniques that can greatly improve the efficiency of the construction of decision trees.
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

NCCT
EXPLORING APPLICATION-LEVEL SEMANTICS FOR DATA COMPRESSION
Knowledge and Data Engineering, IEEE Transactions on

ABSTRACT Natural phenomena show that many creatures form large social groups and move in regular patterns. However, previous works focus on finding the movement patterns of each single object or all objects. In this paper, we first propose an efficient distributed mining algorithm to jointly identify a group of moving objects and discover their movement patterns in wireless sensor networks. Afterward, we propose a compression algorithm, called 2P2D, which exploits the obtained group movement patterns to reduce the amount of delivered data. The compression algorithm includes a sequence merge and an entropy reduction phases. In the sequence merge phase, we propose a Merge algorithm to merge and compress the location data of a group of moving objects. In the entropy reduction phase, we formulate a Hit Item Replacement (HIR) problem and propose a Replace algorithm that obtains the optimal solution. Moreover, we devise three replacement rules and derive the maximum compression ratio. The experimental results show that the proposed compression algorithm leverages the group movement patterns to reduce the amount of delivered data effectively and efficiently
NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4


NCCT-2011 Java IEEE Software Project Abstracts, 2011-2012

Enviado por

Dados do documento

Direitos autorais

Formatos disponíveis

Compartilhar este documento

Compartilhar ou incorporar documento

Opções de compartilhamento

Você considera este documento útil?

Este conteúdo é inapropriado?

Direitos autorais:

Formatos disponíveis

NCCT-2011 Java IEEE Software Project Abstracts, 2011-2012

Enviado por

Direitos autorais:

Formatos disponíveis

NCCT

Promise for the Best Projects

IEEE PROJECTS 2011-12 JAVA Projects

IEEE TR ANSAC TION S ON MOBILE C OMPUTIN G, A PR IL 2011

NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

IEEE PROJECTS 2011-12 JAVA Projects

IEEE TR ANSAC TION S ON MOBILE C OMPUTIN G, MARCH 2011

NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

IEEE PROJECTS 2011-12 JAVA Projects

IEEE TR ANSAC TION S ON MOBILE C OMPUTIN G, JUN E 2011

CROSS-LAYER OPTIMIZATION FOR MULTIMEDIA TRANSPORT OVER MULTICODE CDMA NETWORKS

NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

IEEE PROJECTS 2011-12 JAVA Projects

IEEE TR ANSAC TION S ON MOBILE C OMPUTIN G, JUN E 2011

EFFECTIVE SCHEDULING IN INFRASTRUCTURE-BASED COGNITIVE RADIO NETWORKS

NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

IEEE PROJECTS 2011-12 JAVA Projects

IEEE TR ANSAC TION S ON MOBILE C OMPUTIN G, MARCH 2011

NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

IEEE PROJECTS 2011-12 JAVA Projects

IEEE TR ANSAC TION S ON MOBILE C OMPUTIN G, A PR IL 2011

NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

IEEE PROJECTS 2011-12 JAVA Projects

IEEE TR ANSAC TION S ON MOBILE C OMPUTIN G, JUN E 2011

AUTONOMOUS DEPLOYMENT OF HETEROGENEOUS MOBILE SENSORS

NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

IEEE PROJECTS 2011-12 JAVA Projects

IEEE TR ANSAC TION S ON MOBILE C OMPUTIN G, JUN E 2011

A CONTROL-THEORETIC APPROACH TO DISTRIBUTED OPTIMAL CONFIGURATION OF 802.11 WLANS

MAC , distribu ted algo ri thm,

NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

IEEE PROJECTS 2011-12 JAVA Projects

IEEE TR ANSAC TION S ON MOBILE C OMPUTIN G, MARCH 2011

ADAPTIVE LOCATION-ORIENTED CONTENT DELIVERY IN DELAY-SENSITIVE PERVASIVE APPLICATIONS

NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

IEEE PROJECTS 2011-12 JAVA Projects

IEEE TR ANSAC TION S ON MOBILE C OMPUTIN G, A PR IL 2011

sensor netwo rks, d ata -in tensi ve appli ca tions,

NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

IEEE PROJECTS 2011-12 JAVA Projects

IEEE TR ANSAC TION S ON MOBILE C OMPUTIN G, MAY 2011

NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

IEEE PROJECTS 2011-12 JAVA Projects

IEEE TR ANSAC TION S ON MOBILE C OMPUTIN G, MAY 2011

ENDPOINT-BASED CALL ADMISSION CONTROL AND RESOURCE MANAGEMENT FOR VOWLAN

NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

IEEE PROJECTS 2011-12 JAVA Projects

IEEE TR ANSAC TION S ON MOBILE C OMPUTIN G, MAY 2011

OPTIMAL STOCHASTIC LOCATION UPDATES IN MOBILE AD HOC NETWORKS

NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

IEEE PROJECTS 2011-12 JAVA Projects

IEEE TR ANSAC TION S ON MOBILE C OMPUTIN G, JUN E 2011

MOBILE SAMPLING OF SENSOR FIELD DATA USING CONTROLLED BROADCAST

NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

IEEE PROJECTS 2011-12 JAVA Projects

IEEE TR ANSAC TION S ON MOBILE C OMPUTIN G, JUN E 2011

NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

IEEE PROJECTS 2011-12 JAVA Projects

IEEE TR ANSAC TION S ON MOBILE C OMPUTIN G, A PR IL 2011

MINIMUM BANDWIDTH RESERVATIONS FOR PERIODIC STREAMS IN WIRELESS REAL-TIME SYSTEMS

NCCT, 2823 5816, 93801 02 89 1, 9 8411 9 322 4

IEEE PROJECTS 2011-12 JAVA Projects

IEEE TR ANSAC TION S ON MOBILE C OMPUTIN G APRIL 2011

INDEX TERMS Cooperative control, dynamical networks, tracking