2010 IEEE 6th International Conference on Wireless and ...IEEE 6th International Conference on Wireless and Mobile Computing, Networking ... 18th workshop on Selected Areas in Cryptography

2010IEEE6thInternationalConferenceon

WirelessandMobileComputing,NetworkingandCommunications

2010IEEE6thInternationalConferenceonWirelessandMobileComputing,NetworkingandCommunications

1

Welcome

WiMob’2010

WelcomeMessagefromtheGeneralChairs

On behalf of the Organizing Committee, we would like welcome you to the Sixth Annual IEEEInternational Conference on Wireless and Mobile Computing, Networking and Communications(WiMob). The tremendousadvances inwirelesscommunicationsandmobilecomputing,combinedwith the rapid evolution in smart appliances and devices have generated new challenges and


2

problems requiring solutions that rely on interactions between different network layers andapplications in order to offer advancedmobile services.WiMob’2010 addresses threemain areas:WirelessCommunications,MobileNetworking,UbiquitousComputingandApplications.IEEEWiMobhasgrowntobecomeoneof themajorevents in theseareas,and itaims tostimulate interactionsamong participants and enable them to exchange new ideas and practical experiences in theirrespectiveareas.

This year conference is being held in the Sheraton on the Falls hotel, Niagara Falls, Canada, fromOctober11to13,2010.Theconferencereceivedsubmissionsfrom50differentcountries,withthemaintrackreceiving228submissionsoutofwhich66paperswereselectedfororalpresentation.Inadditiontothemainprogram,theconferenceisco‐hostingthefollowingsixworkshops:

‐ Third IEEE International Workshop on Selected Topics in Mobile and Wireless Computing(STMWC'10),

‐ Second International Workshop on Network Assurance and Security Services in UbiquitousEnvironments(NASSUE2010),

‐ FirstWorkshoponCooperativeMobileProtocolsandApplications(CMPA2010),‐ FirstInternationalWorkshoponVEhicularCOmmunicationsandNetworking(VECON2010),‐ FirstInternationalWorkshoponAdvancesinWirelessSensorandActuatorNetworks(AWSAN

2010),‐ FirstInternationalWorkshoponPerformanceEnhancementsinMIMO‐OFDMSystems(PEMOS

2010).

Wewould like to thank theTPCCo‐Chairs,TPCmembersandall the reviewers, theWorkshopCo‐Chairs, the Publicity Co‐Chairs and the Publication Chair and all the members of the organizingcommitteefortheirassistanceinmakingthisconferenceasuccess.Wewouldalsotothankourtwodistinguished keynote speakers, Dr. Weihua Zhuang and Dr. Pierre Boucher who have agreed toaddresstheconferenceattendees.

WewouldalsoliketoacknowledgethecontinuingsponsorshipofIEEEWiMobbytheIEEEComputerSocietyandIEEE.

We look forwardtoseeingyouat theconference,andwehopethatyouenjoytheconferenceandyourstayinNiagaraFalls

AbderrahimBenslimane AliMiri

GeneralChairforIEEEWiMob2010 GeneralCo‐ChairforIEEEWiMob2010


3

Abderrahim Benslimane is Full Professor of Computer Science andEngineering at the University of Avignon (France) since September2001. He has been as Associate Professor at the University ofTechnology of Belfort‐Montbéliard since September 1994. Heobtained the title to supervise researches (HDR 2000) from theUniversity of Cergy‐Pontoise, France. He received the PhD degree(1993), DEA (MS 1989) from the Franche‐Comte University of

Besançon,andBS(1987)fromtheUniversityofNancy,allinComputerScience.

Hisresearchandteachinginterestsareinwirelessad‐hocandsensornetworks.Particularly,heworkson multicast routing, inter‐vehicular communications, Quality of service, energy conservation,localization, intrusion detection andMAC layer performance evaluation. Hewas also interested inspecification and verification of communication protocols, group communication algorithms andmultimedia synchronization. He has several refereed international publications (book, journals andconferences)inallthosedomains.

He has served as technical program chair and co‐chair, member of a number of internationalconferences. He has been reviewer of a great number of journals, of national research projectssponsoredbytheANR/Telecom.HeistheheaderofComputerNetworksandMultimediaApplicationsteam(RAM)oftheComputerLaboratoryofAvignon.

He was responsible of the speciality RTM (Networks, Telecoms andMultimedia), Professional andResearch,of theMaster (MsC)ComputerEngineeringandMathematic,TechniquesandSciencesoftheUniversityofAvignon2001‐2006.

Heisinvolvedinmanynationalandinternationalprojects.Heismemberofmanyeditorialboardsofinternationaljournals.HechairsmanyIEEEinternationalconferences.Heparticipatestothesteeringand the program committee of many IEEE international conferences. He is IEEE senior member,member of the CA of the IEEE French section, of the Technical Committee IEEE ComSocCommunicationsandInformationSecurity(CISTC),Vice‐PresidentoftheFranceIEEEstudentactivitiesandoftheSPECIF/FranceandVice‐chairpublicationsofCISTCIEEECOMSOC.Hewasmemberofthe“ConseilNationaldesUniversités”2003‐2007(27èmesection).

Hehasmanyinternationalcollaborations,forsupervisingMsCandPhDstudents.HesupervisedmanyPh.Dthesisinlocalizationinsensornetworks,securityinadhocnetworks,QoSinWiMAXandcrosslayer energy conservation in ad hoc networks and many MsC research supervision (and cosupervision) of students in Univ. Avignon, Univ. Montreal, Univ. Concordia, Ecole Polytecnique ofMontreal.


4

He iseditorialmemberofmany international journals, general chairofWiMobandsymposiumco‐chairinGlobecomandICC.Hewasguesteditorofmanyspecialissues.

AliMirihasbeenaFullProfessoratSchoolofComputerScience,RyersonUniversity, Toronto since 2009. He has also been with the School ofInformation Technology and Engineering and Department ofMathematicsandStatisticssince2001asanAssistantProfessor,andlaterasanAssociateProfessorin2005andaFullProfessorat2008.Heisthefounder and the director of Computational Laboratory in Coding andCryptography (CLiCC) at the University of Ottawa. He has held visitingpositions at the Fields Institute for Research inMathematical Sciences,Toronto in2006,andUniversitédeCergy‐Pontoise,France in2007,andAlicanteandAlbeceteUniversitiesinSpainin2008.Hisresearchinterests

includecomputernetworks,digital communication,andsecurityandprivacy technologiesand theirapplications.Bycombininghisexpertise inmathematics, computerscienceandengineering,hehasmadesignificantcontributionstotheseareas,writingandco‐authoringmorethan120peer‐reviewedpapersininternationalconferenceandjournals.Dr.Mirihasservedinmorethan50organizingandtechnical program committees of international conferences and workshops. He has chaired/co‐chairedThe14thworkshoponSelectedAreas inCryptography(SAC),2007,TheFieldsworkshoponNew Direction on Cryptography, 2008, IFIP Conference in Wireless Sensor and Actor Networks(WSAN),2008,TheCanadianWorkshopinInformationTheory(CWIT),2009,TheEighthInternationalConferenceonPrivacy, Security,andTrust (PST),2010, IEEE InternationalConferenceonWirelessandMobileComputing,NetworkingandCommunications(WiMoB),2010,andhewillco‐chairingThe18thworkshoponSelectedAreas inCryptography (SAC),2011.Hehas servedasaguesteditor forJournal of Ad Hoc and SensorWireless Networks, Journal of Telecommunications Systems, and iscurrentlyservingontheeditorialboardofInternationalJournalOnAdvancesinInternetTechnology.

HeisamemberofProfessionalEngineersOntario,ACMandaseniormemberofIEEE.


5

General Information

Registration

Delegatesmayregisteron:

• Monday,October11:8:00AMto5:00PM

• Tuesday,October12:8:00AMto3:00PM

• Wednesday,October13:8:00AMto10:00AM

WirelessInternetAccess

Username: wimob

Password: Conference


6

Program at a glance Sunday,October10

Time UpperFallsviewStudioB

05:00PM–7:30PM ReceptionMonday,October11Time StrategyRoom1 StrategyRoom2 StrategyRoom3

08:30AM

Keynote:VehicularNetworking:ChallengesandOpportunities

09:30AM Break@PrefunctionSpaceStrategyRoom10:00AM WirelessandAd‐HocNetworks(I) MobileNetworking 12:00PM Lunch@GreatRoomB01:20PM WirelessandAd‐HocNetworks(II) SensorNetworks(I) 3:00PM Break@PrefunctionSpaceStrategyRoom03:30PM VehicularCommunications

05:20PMNASSUE:SecondInternationalWorkshoponNetworkAssuranceandSecurityServicesinUbiquitousEnvironments(NASSUE2010)

SensorNetworks(II)

Tuesday,October12Time StrategyRoom1 StrategyRoom2 StrategyRoom3

08:40AMSTWMC1:ThirdIEEEInternationalWorkshoponSelectedTopicsinMobileandWirelessComputing(STMWC'10)‐1

CMPA:FirstWorkshoponCooperativeMobileProtocolsandApplications(CMPA2010)

10:10AM Break@PrefunctionSpaceStrategyRoom

10:30AM

STWMC2:ThirdIEEEInternationalWorkshoponSelectedTopicsinMobileandWirelessComputing(STMWC'10)‐2

VECON1:FirstInternationalWorkshoponVEhicularCOmmunicationsandNetworking(VECON2010)‐1

12:10PM Lunch@GreatRoomB

01:20PM

AWSAN:FirstInternationalWorkshoponAdvancesinWirelessSensorandActuatorNetworks(AWSAN2010)

VECON2:FirstInternationalWorkshoponVEhicularCOmmunicationsandNetworking(VECON2010)‐2

3:00PM Break@PrefunctionSpaceStrategyRoom

03:30PM

STWMC3:ThirdIEEEInternationalWorkshoponSelectedTopicsinMobileandWirelessComputing(STMWC'10)‐3

PEMOS:FirstInternationalWorkshoponthePerformanceEnhancementsinMIMO‐OFDMSystems(PEMOS2010)


7

6:30PM Dinner@GreatRoomB

Wednesday,October13Time StrategyRoom1 StrategyRoom2 StrategyRoom3

08:30AM

Keynote:Towards50BillionDevices:ASustainableEvolutionofMobileNetworks

9:30AM Break@PrefunctionSpaceStrategyRoom10:00AM AirInterfaces SmartSystems 12:00PM Lunch@GreatRoomB01:20PM MobilityandNomadicity(I) NextGenerationNetworks(I) 3:00PM Break@PrefunctionSpaceStrategyRoom03:30PM NextGenerationNetworks(II) MobilityandNomadicity(II)


8

KeynoteSpeakersDr.WeihuaZhuangProfessor,PhD,FIEEE,PEng,TierI(Senior)CanadaResearchChairTitle:VehicularNetworking:ChallengesandOpportunitiesAbstractVehicularadhocnetworks(VANETs)aimatprovidingcommunicationsamongvehicles,andbetweenvehiclesandnearbyroadsideequipment,withverylimitedornoinfrastructuresupport.VANETsareenvisionedtobeacornerstoneforroadsafety,intelligenttransportation,mobileInternet

access,andmanylocationdependentcommercialapplications.Thegrowingimportanceofinter‐vehicularcommunicationshasbeenrecognizedbygovernments,academia,andindustry.Incomparisonwithgeneral‐purposemobileadhocnetworks,VANETshaveuniquefeaturesthatprovideopportunitiesforoptimizations,

butalsohavecomplexaspectsthatchallengethesystemdesignandimplementation,suchasveryfastnetworktopologychangesduetohighvehiclespeed.Thispresentationwillprovideanoverviewofvehicular

communicationnetworks,discussresearchchallengesandopenissue,andprovidesomesolutionstoresourceallocation,networkcontrol,andserviceprovisioninginVANETs.

BioWeihua Zhuang received theB.Sc. andM.Sc. degrees fromDalianMaritimeUniversity, China, and thePh.D.degreefromtheUniversityofNewBrunswick,Canada,allinelectricalengineering.InOctober1993,shejoined

the Department of Electrical and Computer Engineering, University of Waterloo, Canada, as an AssistantProfessor. Shewas promoted to the rank of Associate Professorwith tenure in July 1997, and then to FullProfessor in July 2002. Since May 2010, she has been a Tier I (Senior) Canada Research Chair in wireless

communicationnetworks.HercurrentresearchfocusesonresourceallocationandQoSprovisioninginwirelessnetworks. She is a co‐author of the textbook Wireless Communications and Networking, which has beenpublished by Prentice Hall since 2003, and has been translated to Chinese and published by the Publishing

HouseofElectronicsIndustryinChinasince2004.Dr.Zhuangisaco‐recipientoftheBestPaperAwardsfromIEEEVTC‐Fall2010,IEEEWCNC2007and2010,IEEE

ICC2007,andtheInternationalConferenceonHeterogeneousNetworkingforQuality,Reliability,SecurityandRobustness (QShine) 2007 and 2008. She received the Outstanding Performance Award in 2005, 2006, and2008fromtheUniversityofWaterlooforoutstandingachievementsinteaching,research,andservice,andthe

Premier'sResearchExcellenceAward in 2001 from theOntarioGovernment fordemonstratedexcellenceofscientificandacademiccontributions.Dr. Zhuang is the Editor‐in‐Chief of IEEE Transactions on Vehicular Technology, and an Editor of EURASIP

JournalonWirelessCommunicationsandNetworking,InternationalJournalofSensorNetworks,andtheETRIJournal.Shewasaneditorof IEEETransactionsonWirelessCommunications(2005‐2009).She istheTPCCo‐ChairforWirelessNetworksSymposiumofIEEEGlobecom2008,CrossLayerDesignsandProtocolsSymposium

of Int.Wireless Communications andMobile Computing Conference (IWCMC) 2007 and 2006, and theACMWorkshoponWirelessMultimediaNetworkingandPerformanceModeling(WMuNeP)2005.SheisaFellowofIEEEandanIEEECommunicationsSocietyDistinguishedLecturer.Dr.ZhuangisalicensedProfessionalEngineer

in the Province of Ontario, Canada. She is the Chair of the Vehicular Technology Chapter, IEEE Kitchener‐Waterloo Section.


9

KeynoteSpeakers(cont.)

Dr.PierreBoucherDIRECTOR,RESEARCHEricssonCanadaInc.Title:Towards50BillionDevices:ASustainableEvolutionofMobileNetworksAbstractMobilenetworksareevolvingrapidlyandwillbemovingfromconnectingpeopletoconnectingthings.This

posessomeresearchchallengesintermsofnetworkefficiencybutalsointermsoftheuseofthesenewkindsofnetworksonourdailylives.

BioPierreBoucher isDirector forResearchat Ericsson’sR&Dcenter inMontreal.He is responsible for research

activities on broadband systems and networks for the R&D center’s collaborative research and innovationprojects with universities and institutions. Areas covered by his group include next generation networks,service architectures and advanced radio applications. His interests are in the application of networked

multimediatechnologies like IMS insectorssuchashealthcareandentertainment.Pierre isalsochairmanofPrompt,aresearchpromotionorganization.HerepresentsEricssononvariousboardspromotingresearchandinnovation in the telecommunications sector and in the community. such as CATA, ADRIQ and

TechnoMontréal.Priortohis15yearsatEricsson,PierreworkedforRogersinNetworkResearchwithafocusonOSSsystems.


10

ExecutiveCommitteeGeneralChair

AbderrahimBenslimane(UniversityofAvignon,France)

GeneralCo‐Chair

AliMiri(RyersonUniversity,Canada)

TPCCo‐Chair

NaveenChilamkurti(LaTrobeUniversity,Australia)

ShiguoLian(FranceTelecomR&DBeijing,P.R.China)

JelenaMisic(RyersonUniversity,Canada)

TarikTaleb(NECEuropeLtd.,Germany)

FinanceChair

AliMiri(RyersonUniversity,Canada)

WorkshopCo‐Chair

LuisOrozcoBarbosa(UniversidaddeCastillaLaMancha,Spain)

JoanGarcia‐Haro(PolytechnicUniversityofCartagena,Spain)

PublicationChair

SaeedSamet(UniversityofOttawa,Canada)

LocalArrangementCo‐Chair

AlaganAnpalagan(RyersonUniversity,Canada)

AlirezaSadeghian(RyersonUniversity,Canada)

PublicityCo‐Chair

AbbasJamalipour(UniversityofSydney,Australia)


11

JaimeLloret(UniversidadPolitécnicadeValencia,Spain)

AbderrezakRachedi(UniversityParis‐EstMarne‐la‐Vallée,France)

JustinZhan(CarnegieMellonUniversity,Japan)

SteeringCommittee

Chair

SamuelPierre(EcolePolytechniquedeMontreal,Canada)

Members

AbderrahimBenslimane(UniversityofAvignon,France)

PierreBoucher(EricssonCanada,Canada)

MiesoDenko(UniversityofGuelph,Canada)

VanThanhDo(Telenor/NorwegianUniversityofScienceandTechnology,Norway)

IbrahimHabib(CityUniversityofNewYork,USA)

KhaledBenLetaief(HongKongUniversityofScience&Technology,HongKong)

HusseinMouftah(UniversityofOttawa,Canada)

GuyPujolle(UniversityofParis6,France)


12

Monday, October 11, 2010 8:30–9:30AM

Keynote:VehicularNetworking:ChallengesandOpportunities

Speaker:Dr.WeihuaZhuang

Room:StrategyRoom3

Chair:AliMiri(RyersonUniversity&UniversityofOttawa,Canada)

10:00AM‐12:00PM

WirelessandAd‐HocNetworks(I)

Room:StrategyRoom1

Chair:JoanGarcia‐Haro(PolytechnicUniversityofCartagena,Spain)

EffectiveTrafficControlforMilitaryTacticalWirelessMobileAd‐hocNetwork

Ji‐SangYou(AgencyforDefenseDevelopment,Korea)

TheMIL‐STD‐188‐220isthemilitarytacticalwirelessmobilead‐hoccommunicationstandardwhichmakesasmoothdataandvoicecommunicationpossible.ThisstandardisknownastheInteroperabilityStandardforDigitalMessageTransferDeviceSubsystems.However,thestandardhastheproblemtogeneratethemeaninglesstrafficduetothefailureoftopologyupdate,inthecaseoftransmittingtheonlypacketnotrequiringtheacknowledgmentstothedestinationnodeawayfromtheradiopropagationscope.Moreover,asourcerequirestheintranetend‐to‐endacknowledgmentfromalldestinationstoconfirmapacketdelivery,regardlessofthehopdistancetodestinationnodes.Thismethodhastheproblemtogenerateunnecessarytrafficinthecasetoconfirmthepacketdeliverywithin1‐hopdistance.Inordertoresolvetheseproblems,thispaperhasproposedthemethodsthatrestrainthemeaninglesstrafficgenerationandsimplifytheprocedurethatconfirmsapacketdeliverywithin1‐hopdistance.

PerformanceofTransparentConductivePolymerAntennasinaMIMOAd‐hocNetwork

NicholasJ.Kirsch(DrexelUniversity,USA);NicholasVacirca(DrexelUniversity,USA);TimothyKurzweg(DrexelUniversity,USA);AdamFontecchio(DrexelUniversity,USA);KapilDandekar(DrexelUniversity,USA)

Multipleantennacommunicationsystemsareasolutiontomeetthedemandforpervasivecomputingandubiquitouswirelesscommunications.Asmultipleantennacommunicationsystemsbecomemorebroadlydeployed,integratingunobtrusiveantennasintovariousformfactorsisbecomingincreasinglyimportant.Antennasthatareflexibleandtransparentcaneasethisdesignconstraint.Inthispaper,wepresentadipoleconductivepolymerantennaarraythatisflexibleandtransparent.Thefocusofthispaperistoshowhowwellthisantennaworksinacommunicationsnetworkbyevaluatingchannelcapacityandpacketerrorrate.

BandwidthBalancinginMobileAdHocNetworks

CongzhouZhou(ColumbiaUniversity,USA);NickMaxemchuk(ColumbiaUniversity,USA)


13

Inthispaper,weextendsbandwidthbalancingtechniqueinwirednetworkstooperateinmobileadhocnetworks(MANETs).InbandwidthbalancinginDistributed‐Queue‐Dual‐Bus(DQDB),differentnodesoccupythesamechannel,andinformationaboutthebandwidthistransferredbetweennodesintheunusedbandwidth.Similarly,inwirelessnetworks,thecapacityonachannelissharedbyseveralsourcesatdifferentnodesandthebandwidthinformationcanbemonitoredonthesharedmedium.Usingthebandwidthbalancingtechnique,weintroduceaflowcontrolschemeforMANETsthatlimitseachflowateachnodeinatransmissionregiontotakeonlyafractionoftheremainingcapacity.ExtensivesimulationsdemonstratethatourflowcontrolschemeiseffectiveandcanprovideQualityofService(QoS)guaranteesforflowsinMANETs.

AnimprovedMap‐basedLocationServiceforVehicularAdHocNetworks

NadiaBrahmi(Irseem‐Esigelec,France);MounirBoussedjra(IRSEEM‐ESIGELECTechnopoleduTechnopôleduMadrillet,France);JosephMouzna(Esigelec‐Irseem,France);KiranCornelio(I&CT,MIT,Manipal,India);ManoharaPai(ManipalInstituteofTechnology,ManipalUniversity,India)

Routingremainsoneofthekeychallengesinvehicularnetworksduetotheirspecialpropertiessuchasthehighmobilityandtheintermittentconnectivity.AlmostalltheefficientroutingsolutionsproposedforVANETsarebasedongeographicinformationprovidedbythenavigationsystemswidelydeployedinthenewgenerationofvehicles.Typically,intheseposition‐basedprotocols,asourcenodehastodiscoverthelocationofdestinationnodebeforesendingthedata.Inthispaper,weproposeadistributedhierarchicallocationservicecalledDensityawareMap‐BasedLocationService(DMBLS)forVehicularAd‐hocNetworks.DMBLSmakesuseofthestreetdigitalmapsandthetrafficdensityinformationtodefineathreelevel‐hierarchyoflocationsservers.Thisinfrastructure‐lessschemehasproventoberobusttonodemobilityandwellsuitedtodynamicnetworks.SimulationsresultsobtainedwithdifferentscenariosdemonstratethatDMBLSachievespromisingperformancesintermsoflocationquerysuccessratioaswellasthequeryandupdatedelayswithagoodaccuracy.

CapabilityReconciliationforVirtualDeviceCompositioninMobileAdHocNetworks

EricKarmouch(UniversityofOttawa,Canada);AmiyaNayak(SITE,UniversityofOttawa,Canada)

Theproliferationofnetworkedappliancesordedicatedfunctionconsumerdeviceswithembeddedprocessorsandnetworkconnectioncapabilitiesisdrivingthevirtualdeviceconcept,wherebysuchappliancescanbecontrolled,monitored,managed,andextendedbeyondwhattheywereinitiallydesignedtodo.Thedynamicandadhocnatureofthediscoveryandcompositionofsuchdevicesandtheservicestheyprovideinevitablyleadstocapabilitydifferences,wherebytheinputofaserviceBisnotcompatiblewiththeoutputofaserviceA;AandBneedingtobecomposed.Moreover,currentschemesforservicecompositioninMANETsdonotconsidercapabilitydifferences.WepresentadistributedconstraintsatisfactionproblemforcapabilityreconciliationinMANETs,andthroughsimulationshowitseffectivenessandefficiency.

ASemanticDatabaseFrameworkforContextManagementinHeterogeneousWirelessNetworks

MehdiLoukil(TELECOMSudParis,France);TakouaGhariani(InstitutTelecom/TelecomSudParis,France);BadiiJouaber(InstitutTELECOM‐TelecomSudParis,France);DjamalZeghlache(InstitutTELECOM,TELECOMSudParis,France)

Recentdevelopmentsincomputerscienceandnetworkingraisetheneedtodevelopnewfamiliesofapplicationsthataresensitivetouserandambientcontexts.Theobjectiveistoofferpersonalizedservicesthatcanbeadaptedtousers'needswithinheterogeneous,complexanddynamicenvironments.Thisrequiresenhancedandgenericsolutionsforcontextrepresentationandretrievalaswellasfortheinteractionsbetweenheterogeneoussystemcomponents.Inthispaper,weproposeaconceptualmodelandasoftwareframeworkusingsemanticontologiestobuildsemanticcontextdatabases.Thisapproachisthenappliedtotheheterogeneouswirelessnetworks'usecase.ContextualinformationisimplementedusingfirstorderlogicandOWLtopromoteexpressivenessandinteroperability.Thedifferentstepstobuildtheframeworkaredetailed.Measurementsandperformanceresultsarethenprovided.


14

10:00AM‐12:00PM

MobileNetworking

Room:StrategyRoom2

Chair:SrinivasSampalli(DalhousieUniversity,Canada)

ATabuSearchDSAAlgorithmforRewardMaximizationinCellularNetworks

HanyKamal(Telecom‐ParisTech,France);MarceauCoupechoux(TELECOMParisTech,France);PhilippeGodlewski(EcoleNationaleSuperieuredeTelecommunication,France)

Inthispaper,wepresentandanalyzeaTabuSearch(TS)algorithmforDSA(DynamicSpectrumAccess)incellularnetworks.Westudyamono‐operatorcasewheretheoperatorisprovidingpacketservicestotheend‐users.Theobjectiveofthecellularoperatoristomaximizeitsrewardwhiletakingintoaccountthetrade‐offbetweenthespectrumcostandtherevenuesobtainedfromend‐users.Theserevenuearemodeledhereasanincreasingfunctionoftheachievedthroughput.Resultsshowthatthealgorithmallowstheoperatortoincreaseitsrewardbytakingadvantageofthespatialheterogeneityofthetrafficinthenetwork,ratherthanassuminghomogeneoustrafficforradioresourceallocation.OurTS‐basedDSAalgorithmisefficientintermsoftherequiredmemoryspaceandconvergencespeed.Resultsshowthatthealgorithmisfastenoughtosuitadynamiccontext.

RobustnessinContext‐AwareMobileComputing

HannesWolf(UniversityofStuttgart,Germany);KurtRothermel(UniversityofStuttgart,Germany,Germany);KlausHerrmann(UniversityofStuttgart,Germany)

Highlevelcontextrecognitionandsituationdetectionareanenablingtechnologiesforunobtrusivemobilecomputingsystems.Significantprogresshasbeenmadeinprocessingandmanagingcontextinformation,leadingtosophisticatedframeworks,middlewares,andalgorithms.Despitegreatimprovements,contextawaresystemsstillrequireasignificantlyincreasedrecognitionaccuracyforhigh‐levelcontextinformationonuncertainsensordatatoenabletherobustexecutionofcontext‐awareapplications.RecentlyAdaptablePervasiveWorkflows(APF)shavebeenpresentedasinnovativeprogrammingparadigmformobilecontext‐awareapplications.WeproposeanovelFlowContextSystem(FlowCon)thatbuildsuponAPFs.FlowConusesstructuralinformationfromtheAPFtoincreaseaccuracyofuncertainhigh‐levelcontextinformationupto49%.Thiswaywemakeanimportantsteptoenablerobustexecutionofmobilecontext‐awareapplications.

MobileSystemsLocationPrivacy:"MobiPriv"ARobustKAnonymousSystem

LeonStenneth(UniversityofIllinoisatChicago,USA);PhilipYu(UniversityofIllinoisChicago,USA);OuriWolfson(UniversityofIllinois,USA)

Withtherapidadvancementofpositioningandtrackingcapabilities(mobilephones,on‐boardnavigationsystems)locationbasedservicesarerapidlyincreasing.Privacyinlocationbasedsystemsisaddressedinmanypapers.Ourworkisfocusedonthetrustedthirdpartyprivacyframeworkthatutilizestheconceptofk‐anonymitywithorwithoutl‐diversity.InpreviousanonymizationmodelsKmaybedefinedasapersonalizationparameterofthemobileuserorasuniformsystemparameterforallmobileusers.Clearly,Kotherusersmaynotbeavailableatthetimeofrequestinthesesystems.Theserequestsarediscardedbecausethequalityofservice(QoS)theyrequirecannotbesatisfied.Inthispaperweintroduceanovelsuiteofalgorithmscalled


15

MobiPrivthatguaranteesa100%successrateofprocessingamobilerequestusingk‐anonymitywithdiversityconsiderations.Weevaluatedoursuiteofalgorithmsexperimentallyagainstpreviouslyproposedanonymizationalgorithmsusingrealworldtrafficvolumedata,realworldroadnetworkandmobileusersgeneratedrealisticallybyamobileobjectgenerator.

IWanttoGoHome:EmpoweringtheLostMobileDevice

ChiZhang(PolytechnicInstituteofNYU,USA);RobertFisher(CarnegieMellonUniversity,USA);JoelWein(Polytechnic,USA)

Itisestimatedthatover8millioncellphonesarelostorstoleneachyear[7];oftenthelossofacellphonemeansthelossofpersonaldata,timeandenormousaggravation.Inthispaperwepresentmachine‐learningbasedalgorithmsbywhichacellphonecandiscernthatitmaybelost,andtakestepstoenhanceitschancesofbeingsuccessfullyrecovered.WeusedatacollectedfromtheRealityMiningproject[10]tocreateasuiteofrealistictestcasesthatmodellostcellphonebehavior.Onthesedatasetsourbestalgorithmscanidentifycasesofalostmobiledevice,basedonitsbehaviorovertheprevious3hours,withcloseto100%accuracy.Inaddition,thealgorithmgeneratesfalsepositiveidentificationswithprobabilitylessthan3%;forindividualswithrelativelypredictablelifestylestheFalsePositiveRateissubstantiallyless.WealsousetheRealityMiningdatatoconstructasetoftestcasesthatmodelthebehaviorofastolenphone,andshowthatsimilaralgorithmictechniquesgivereasonableresultsinthissettingaswell.

TheResource‐OrientedMobileWebServerforLong‐LivedServices

FahadAijaz(RWTHAachenUniversity,Germany)

TheWebServersaregloballyacceptedastheback‐boneoftheInternet.Theresearchersintheareaoftheenterprisecomputinghavestudied,analyzedandimplementedseveralarchitecturestooptimizetheperformanceofthelarge‐scaleWebServers.However,duetotheconvergenceoftheITandthemobilecommunicationdomains,themobilenodesnowarealsobeenviewedastheservicehostingplatforms.TheaimofthisarticleistopresentanoptimizedMobileWebServerarchitectureforprovisioningtheMobileWebServices(MobWS)aslengthyprocesses.Forthatreason,theasynchronousinteractionstrategyisderived,andlaterusedtocomprehensivelydiscusstheserverarchitecture,whichisbasedontheRepresentationalStateTransfer(REST)designprinciples.ThemanuscriptpresentsadetailedperformanceevaluationofthearchitectureandcomparestheresultswiththeserverbasedontheSimpleObjectAccessProtocol(SOAP)standard.TheresultsshowpromisingperformanceimprovementsduetothereducedpayloadrequirementsoftheRESTserver.

CompensationforHPANonlinearityandI/QImbalanceinMIMOBeamformingSystems

JianQi(UniversityofQuebec,INRS‐EMT,Canada);SoniaAissa(UniversityofQuebec,INRS‐EMT,Canada)

Inthispaper,weinvestigatetheeffectsofhigh‐poweramplifier(HPA)nonlinearityandin‐phaseandquadrature‐phase(I/Q)imbalanceontheperformanceofmultiple‐inputmultiple‐output(MIMO)transmitbeamforming(TB)systems.Specifically,weproposeacompensationmethodforHPAnonlinearityandI/QimbalancetogetherinMIMOTBsystems.TheperformanceoftheMIMOTBsystemunderstudyisevaluatedintermsoftheaveragesymbolerrorprobability(SEP)andsystemcapacity,consideringtransmissionoveruncorrelatedfrequency‐flatRayleighfadingchannels.Numericalresultsareprovidedandshowtheeffectsofseveralsystemparameters,suchastheHPAparameters,image‐leakageratio,numbersoftransmitandreceiveantennas,lengthofpilotsymbols,andmodulationorderofphase‐shiftkeying(PSK),onperformance.


16

1:20PM‐3:00PM

WirelessandAd‐HocNetworks(II)

Room:StrategyRoom1

Chair:RafaelCepeda(ToshibaResearchEuropeLtd,UnitedKingdom)

ANewAlgorithmforBackboneFormationinAdHocWirelessNetworksofNodeswithDifferentTransmissionRanges

HosseinKassaei(ConcordiaUniversity,Canada);LataNarayanan(ConcordiaUniversity,Canada)

Weconsidertheproblemofbackboneformationinadhocwirelessnetworkscomposedofheterogeneousnodes.Avirtualbackboneinanadhocwirelessnetworkprovidesahierarchicalinfrastructurethatcanbeusedtoaddressimportantchallengessuchasefficientrouting,multicasting/broadcasting,activity‐scheduling,andenergyefficiency.Wemodelawirelessnetworkinwhichnodeshavedifferenttransmissionrangesbyadiskgraph.AvirtualbackboneinsuchanetworkcanbemodeledbyaStronglyConnectedDominatingandAbsorbentSet(SCDAS)intheassociateddiskgraph.Forpracticalreasons,itisdesirabletominimizethesizeofthisbackbone.Inthispaper,weproposeanefficientdistributedalgorithmfortheconstructionofanSCDASinadhocnetworksmodeledbydiskgraphs.OuralgorithmreliesonlocalinformationintheconstructionoftheSCDAS.Italsoprovidestheflexibilitytoadjustthetradeoffbetweenthedegreeoflocalityofinformationexchangeandthesizeofthesetsitgenerates.ExtensivesimulationresultsshowthattheSCDASconstructedbyouralgorithmissignificantlysmallerthanthatgeneratedbythealgorithmspriortoourwork.

MinimalTCBforMANETNodes

VinayThotakura(MississippiStateUniversity,USA);MahalingamRamkumar(MississippiStateUniversity,USA)

SecuringanyMANETroutingprotocolrequiresmeasurestoensurethatroutinginformationadvertisedbyanode(toitsneighbors)isconsistentwithroutinginformationassimilatedbyanode(fromitsneighbors).Weinvestigateaminimaltrustedcomputingbase(TCB)forMANETnodestoachievethisrequirement.WeoutlinelowcomplexityTCBfunctionswhichcanbeexecutedinsidetrustworthyboundariesofresourcelimitedtrustworthyMANETmodules.TheTCBfunctionsareusedtomaintainatableofactiveneighbors,createroutingrecords(RR),authenticateRRstoTMMsinneighboringnodes,receiveauthenticatedRRs,andupdateRRssubjecttosimplerules.EvenwhilethedynamicRRdatabaseofeverynodeisstoredoutsidetheTMM,bystoringtherootofanindexorderedMerklehashtree(IOMT)(anovelconstructproposedinthispaper)theTMMscanensurethatnodescannotmodify,replayorevenhideRRsthatexistinthedynamicdatabase.

Client‐basedIntrusionPreventionSystemfor802.11WirelessLANs

YaqingZhang(DalhousieUniversity,Canada);SrinivasSampalli(DalhousieUniversity,Canada)

DenialofService(DoS)attackson802.11wirelessLANscanbecausedbymanagementframessentbyrogueaccesspoints.Unfortunately,suchattackscanbesuccessfulevenifthewirelessnetworkisprotectedbyahigh‐levelsecurityprotocolsuchasWiFiProtectedAccessVersion2(WPA2).Wepresentanovelclient‐basedschemeforthepreventionofsuchintrusions.ByusingaMediumAccessControl(MAC)filteringmechanism,the"smart"clientisabletodifferentiatebetweenlegitimateandforgedmanagementframes.Theproposedmechanismisnoncryptographic,haslowoverheadsandcanbedeployedinexistingIEEE802.11WLANs.We


17

havebuiltandtestedaprototypeofourscheme.WedemonstratethatourmechanismcanprotectwirelessclientsagainstmanagementframeDoSattackslaunchedattheMAClayer.

InterferenceAwareSchedulingforUltraWidebandNetworks

HolgerRosier(RWTHAachenUniversity,Germany);JensFrerichs(CommunicationNetworks(ComNets)ResearchGroup,RWTHAachenUniversity,Germany);SebastianMax(RWTHAachenUniversity,Germany)

WirelessPersonalAreaNetworks(WPANs)areusedforawidevarietyofapplications.FormerWPANs,likeBluetooth,offerdataratesonlyforlowratecommunication.Nowadays,consumerelectronicdeviceshavehighdemandsoncommunicationsystems,e.g.forhighdefinitionvideotransmission.UsersexpectfutureWPANstoactlikewiredsystemsbymeansofreliability,thatis,packetlossanddistortion.Multimediasystemsareubiquitous;hence,itcanbeexpected,thatfutureWPANshavetooperateindensenetworktopologies.ForthatreasonnewtechnologieshavetobeevaluatedintermsofinterferencemitigationandtheirabilitytocooperatewithSimultaneouslyOperatingPiconets(SOPs).ThispaperfocusesonUltraWideband(UWB)communicationaccordingtoECMA‐368,calledWiMedia.WiMedia'sreservation‐basedmediumaccessforhighthroughputandstrictQoSrequirementsisevaluatedtakinginter‐piconetinterferenceintoaccount.Strategiesfordistributedinterferenceawareschedulingareproposedandexaminedbysimulationtoshowsystemcapacityforgivenscenarios.

SoftZFMIMOdetectionforturbocodes

PingpingShang(ChonbukNationalUniversity,Korea);SooyoungKim(ChonbukNationalUniversity,Korea);KwonhueChoi(YeungnamUniversity,KOREA,Korea)

Inthispaper,wepresentasoftzeroforcing(ZF)schemeforturbo‐codedmulti‐inputmulti‐output(MIMO)schemes.Thecomplexityofmaximumlikelihood(ML)softdetectionforturbocodedMIMOschemesincreasesexponentiallybythenumberofantennasandmodulationorders,andthusitisaNPhardproblem.Inthispaper,wedividethesoftdetectionprocessasthreesequentialstepsandthishighlyreducesthecomputationalcomplexity.ThethreesequentialstepsincludeZFdetectionofthetransmittedmodulationsymbol,softdemapping,andapplicationofproperchannelgain.WedemonstratethesimulationresultsonfastandslowfadingchannelsandshowthattheproposedsoftZFschemecanachievejustadBpowerlosswithdramaticallyreduceddetectioncomplexitycomparedtoMLdetection.


18

1:20PM‐3:00PM

SensorNetworks(I)

Room:StrategyRoom2

Chair:AshayDhamdhere(UniversityofNewSouthWales,Australia)

MASY:MAnagementofSecretkeYsforFederatedMobileWirelessSensorNetworks

JefMaerien(K.U.Leuven,Belgium);SamMichiels(KatholiekeUniversiteitLeuven,Belgium);ChristopheHuygens(KatholiekeUniversiteitLeuven,Belgium);WouterIJoosen(UniversityofLeuven,Belgium)

WirelessSensorNetworksarebecomingfederatedandmobileenvironments.Thesenewcapabilitiesposealotofnewpossibilitiesandchallenges.Oneofthesechallengesistocreateasecureenvironmenttoallowmultipletrustedcompaniestoshareandmergetheirsensornetworkinfrastructure.Themostbasicneedforasecureenvironmentisthedeploymentofkeymaterial.However,mostcurrentdayresearchassumespre‐sharedsecretsbetweenthesensornodesofmost,ifnotall,companiesinafederation.Thesesolutionsareoftennotscalablenormobileenoughtomeetrealisticbusinessrequirements.Additionally,mostkeydeploymentprotocolstotallyomitanyconnectivitywithback‐endinfrastructure.ThispaperproposesanoveldeploymentprotocolforMAnagementofSecretKeys(MASY).MASYallowssecuredeploymentofakeytoasensornodewhenitentersapreviouslyunknownnetwork.Byoff‐loadingthetrustcreationprocesstotheresource‐richback‐endinfrastructure,theburdenofthesensornodesremainsverylimited.

ALightweightDynamicOptimizationMethodologyforWirelessSensorNetworks

ArslanMunir(UniversityofFlorida,Gainesville,Florida,USA);AnnGordon‐Ross(UniversityofFlorida,USA);SusanLysecky(UniversityofArizona,USA);RomanLysecky(UniversityofArizona,USA)

TechnologicaladvancementsinembeddedsystemsduetoMoore'slawhaveleadtotheproliferationofwirelesssensornetworks(WSNs)indifferentapplicationdomains(e.g.defense,healthcare,surveillancesystems)withdifferentapplicationrequirements(e.g.lifetime,reliability).Manycommercial‐off‐the‐shelf(COTS)sensornodescanbespecializedtomeettheserequirementsusingtunableparameters(e.g.voltage,frequency)tospecializetheoperatingstate.Sinceasensornode'sperformancedependsgreatlyonenvironmentalstimuli,dynamicoptimizationsenablesensornodestoautomaticallydeterminetheiroperatingstatein‐situ.However,dynamicoptimizationmethodologydevelopmentgivenalargedesignspaceandresourceconstraints(memoryandcomputational)isaverychallengingtask.Inthispaper,weproposealightweightdynamicoptimizationmethodologythatintelligentlyselectsinitialtunableparametervaluestoproduceahigh‐qualityinitialoperatingstateinone‐shotfortime‐criticalorhighlyconstrainedapplications.Furtheroperatingstateimprovementsaremadeusinganefficientgreedyexplorationalgorithm,achievingoptimalornear‐optimaloperatingstateswhileexploringonly0.04%ofthedesignspaceonaverage.

UsingLQItoImproveClusterHeadLocationsinDenseZigBeebasedWirelessSensorNetworks

CherifDiallo(InstitutTELECOM;TelecomSudParis,France);MichelMarot(InstitutTELECOM;TelecomSudParis,France);MoniqueBecker(InstitutTELECOM;TelecomSudParis,France)


19

InWSN,itisnotoftendesirabletousetheGPStechnology.Indeed,theuseofGPSisexpensiveandmayreducetheoverallnetworkperformance.Moreover,indoorreceptionoftheGPSsignalisnotpossible.TheLinkQualityIndicator(LQI)isdefinedinthe802.15.4standard,butitscontextofuseisnotspecifiedinthisstandard.SomeworksontheLQI,fewofwhicharefieldexperiments,haveshownthattheLQIdecreasesasthedistanceincreases.However,thechallengeofclusteringmechanismsistoformthesmallestnumberofclustersbymaximizingdistancesseparatingclusterheadstoprovideanefficientcoverofthenetworkandalsominimizestheclusteroverlaps.Thisreducestheamountofchannelcontentionbetweenclusters,andalsoimprovestheefficiencyofalgorithmsthatrunattheleveloftheclusterheads.ThereforeweproposeananalyticalmodelbasedontheuseoftheLQIinordertoderiveanoptimallyone‐dominatingsetinwhichthesmallerdistanceseparatingtwoclusterheadsisimproved.

RelayNodePlacementforWirelessSensorNetworksDeployedinTunnels

RuoshuiLiu(UniversityofCambridge,UnitedKingdom)

NodeplacementplaysasignificantroleintheeffectiveandsuccessfuldeploymentofWirelessSensorNetworks(WSNs),i.e.,meetingdesigngoalssuchascosteffectiveness,coverage,connectivity,lifetimeanddatalatency.Inthispaper,weproposeanewstrategytoassistintheplacementofRelayNodes(RNs)foraWSNmonitoringundergroundtunnelinfrastructure.Byapplyingforthefirsttimeanaccurateempiricalmeanpathlosspropagationmodelalongwithawellfittedfadingdistributionmodelspecificallydefinedforthetunnelenvironment,weaddresstheRNplacementproblemwithguaranteedlevelsofradiolinkperformance.ThesimulationresultsshowthatthechoiceofappropriatepathlossmodelandfadingdistributionfortypicalenvironmentsisvitalinthedeterminationofthenumberandthepositionsofRNs.Furthermore,weadaptatwo‐tierclusteringmulti‐hopframeworkinwhichthefirsttieroftheRNplacementismodeledastheminimumsetcoverproblem,andthesecondtierplacementissolvedusingthesearch‐and‐findalgorithm.Theimplementationoftheproposedschemeisevaluatedbysimulation,anditlaysthefoundationsforfurtherworkinWSNplanningforundergroundtunnelapplications.

Priority‐BasedNodeSelectionandSchedulingforWirelessMultimediaSensorNetworks

MohammadAlaei(UniversitatPolitècnicadeCatalunya(UPC),Spain);JoseM.Barcelo‐Ordinas(UniversitatPolitècnicadeCatalunya(UPC),Spain)

Acriticalaspectofapplicationswithwirelesssensornetworksisnetworklifetime.Sensingandcommunicationsconsumeenergyparticularlyinwirelessmultimediasensornetworks(WMSN)duetohugeamountofdatageneratedbythemultimediasensors.Therefore,judiciouspowermanagementandsensorschedulingcaneffectivelyextendnetworklifetime.Inthispaperweconsidertheproblemofschedulingmultimediasensoractivitiestomaximizenetworklifetime.Theenvironmentisdividedindomainsmonitoredbyclustersofmultimediasensornodes.Networklifetimeincrementisachievedbycooperationbetweenmultimediasensorsintwopriority‐basedways:Intra‐clustercooperationandInter‐clustercooperation.Wewillseethatthelifetimeofclusternodesisconsiderablyincreasedundertheproposednodeselectionandschedulingprocedures.Asforbigclusters,thelifetimeevenisprolongedto5.5timeswithrespecttotheordinaryun‐cooperativenodeawakening.


20

3:30PM‐5:10PM

VehicularCommunications

Room:StrategyRoom1

Chair:JuanJoseAlcarazEspin(TechnicalUniversityofCartagena,Spain)

Aprivacy‐awarelocationserviceforVANETsusingChaum'smixes

FlorianScheuer(UniversityofRegensburg,Germany);MatthiasBrecht(UniversityofRegensburg,Germany);HannesFederrath(UniversityofRegensburg,Germany)

ProtectingtheprivacyofVANETusersisanimportantissue.WepresentinthispaperanarchitecturethataimsatthisgoalbyintegratingChaum'smixnetworkintoadistributedbutinfrastructure‐basedlocationserviceforposition‐basedrouting.Inadditionweenabletheusertodecidewhenhewantstorevealhispositiontoanyoneelse.ThusneitherentityoftheVANETisinfullknowledgeaboutthelocationandtheidentityofanyuseratthesametime.TheproposedsystemcanbeintegratedinmostpublishedVANETsecurityframeworksandourevaluationshowsthatanimplementationisfeasible.

HowtoDisseminateVehicularDataEfficientlyinbothHighwayandUrbanEnvironments?

MohamedCherif(FranceTelecom,France);Sidi‐MohammedSenouci(UniversityofBourgogne‐ISATNevers,France);BertrandDucourthial(UniversitédeTechnologiedeCompiègne,France)

Vehicularnetworksareaclassofmobilenetworksinwhichvehiclesareequippedwithradiointerfacesandarethereforeabletocommunicatewithaninfrastructure(ifexisting)orothervehiclesinanopportunisticway.Informationdisseminationenjoyswideapplicabilityinthesetypesofnetworks,rangingfromtrafficinformationandwarnings,toparkingavailability,fuelprices,roadconditions,andadvertisements.Hence,weproposeanefficientdisseminationprotocol:ROD(RoadOrientedDissemination)thatconsistsintwomodules:(i)OptimizedDistanceDeferTransfermodule,and(ii)StoreandForwardmodule.Thisprotocolpermitstoincreasethedeliveryratioandoptimizethebandwidthusebylimitingthenumberofvehicleshavingtorelayeachpacket.Theprotocolhasbeenimplementedandtestedontheroads.Inthispaperwereportitsperformancestudies,performedbymeansofsimulations,andwecomparethemtootherdisseminationprotocolsresults.PerformancestudyshowsinterestingresultsofRODcomparedtoexistingsolutions.

Mapcast:AMap‐ConstrainedBroadcastSolutionforVANETs

HectorAgustinCozzetti(IstitutoSuperioreMarioBoella,Italy);RiccardoM.Scopigno(IstitutoSuperioreMarioBoella,Italy);LucaCasone(STMicroelectronics,Italy);GiuseppeBarba(STMicroelectronics,Italy)

SolutionsforVehicularAd‐HocNetwork(VANET)arechallengingduetotheintrinsicnatureofthenetworkwhichinvolves,bydefinition,nodemobility,scarceornullfixednodesand,atthecurrentstateofart,lackofsolutionsforthereal‐timetrackingofpositions.MoreoverVANETsaremeanttoprovideprimarilyasolutionfortheimprovementofroadsafety,bytheproperforwardingofmessages:thismakestheoverallservicescenarioevenmorecriticalduetothedelay‐constraintsandthescalabilityissues.Whilesomesolutionshavealreadybeenproposedinliteraturetooptimizemessagemulti‐hopforwardingbasedonmutualpositionsofnodesandexploitingCSMA/CAMACmechanisms,inthispaperanovelsolutionispresented:itextendstheintuitive


21

conceptsofGeo‐Broadcast(thatis,broadcastforwardingbasedondistances)towardsamorepreciseideaofMap‐Drivenforwarding(orMapcast),wherethereal‐liferoadtopologyleadsforwardingpolicies.Mapcastsolvessomeissuesleftopenbypreviousartandsimulativelyshowsinterestingpotentials.

AdaptingStatisticalBroadcasttoLinearlyOrientedNetworksforVANETs

MichaelJSlavik(FloridaAtlanticUniversity,USA);ImadMahgoub(FloridaAtlanticUniversity,USA)

Broadcastisacriticalcomponentinad‐hocwirelessnetworks.Somevehicularnetwork(VANET)applicationsinparticularusebroadcastcommunicationsextensively.VANETsexhibitawidevarietyofnodedensityanddistributionpatterns,sobroadcastprotocolsdesignedtosupporttheseapplicationsmustbeadaptivetothoseconditions.Weshowthatthedistancemethodofstatisticalbroadcastcanbeusedtodesignaprotocolthatperformswellinone‐dimensionalortwo‐dimensionaluniformlydistributednetworks,butnotboth.Weproposeusingthequadratmethodofspatialanalysistocharacterizethedistributionpatternateachnodeandusetheresultingmetric,K,asafactorincomputingthestatisticalthresholdfunction.Theresult,theDistribution‐AdaptiveDistance(DAD)method,isshowntoexhibitahighlevelofreachabilityandefficientbandwidthutilizationacrossarangeofdistributionpatternsfrompurelylineartopurelytwo‐dimensionalandsparselydistributedtodenselydistributed.Moregenerally,thedesignmethodologypresentedinthisworkprovidesaprocedureenablingstatisticalbroadcastprotocoldesignerstobuildprotocolsthatareadaptivetobothnodedensityandnodedistribution.ThiscapabilityisakeyprerequisitefordesignofpracticalbroadcastprotocolstosupportVANETapplications.

PerformanceModelingofSafetyMessageDeliveryinVehicularAdHocNetworks

GhadaBadawy(RyersonUniversity,Canada);JelenaMisic(RyersonUniversity,Canada);TerenceD.Todd(McMasterUniversity,Canada);DongmeiZhao(McMasterUniversity,Canada)

Vehicularad‐hocnetworks(VANETs)willenableawidevarietyoffutureinter‐vehicleandvehicle‐to‐roadsideapplications.Theseserviceswillspanalargerangeoffunctionality,suchasthosesupportingvehicularsafety,tothoseusedforbest‐effortroadsideadvertising.Tosupportthiswiderange,theIEEE802.11pstandarddefinessevencommunicationchannels,consistingofasinglecontrolchannelforsafetyapplications,andsixservicechannelswhichcanbeusedforotherpurposes.Toallowasingleradiointerfacetosupportbothtypesofapplications,thestandarddefinesachannelcoordinationmechanismthatallowsthevehicularradiotoalternatelyaccessthecontrolandservicechannels.Whenthishappensitisveryimportantthatsafetymessagesaretransmittedwithhighreliabilityandlowlatency.Usinganalyticalmodels,thispaperprovidesaperformanceevaluationofvehicularsafetymessagedelivery.Ourresultsshowthatthemechanismdefinedinthestandardcansatisfytheneededlatencyrequirements,butcannotsatisfytherequiredreliabilityforsafetymessagedelivery.


22

3:30PM‐5:10PM

SensorNetworks(II)Room:StrategyRoom2

Chair:NidalNasser(UniversityofGuelph,Canada)

DynamicServicePolicy‐basedClusteredWirelessSensorNetworks

AkramulAzim(UniversityofWaterloo,Canada);MohammadMahfuzulIslam(BUET,Bangladesh)

Energyisoneofthemainobstaclestodeploywirelesssensornetworks(WSNs)becausetinysensornodescannotaccommodatesufficientenergyforachievingthedesiredlevelofusage.Theclusteringprotocolsofwirelesssensornetworkattainstheacmepopularityamongtheresearchersbecauseofmakingeffectiveusageofenergypreservedinsensornodesthroughimplementingclusteringconceptsbasedonlocalityandelectingaclusterheadforeachofthem.Wegetmotivationsfromtheenergysavingclusteringschemesandproposeanenhancementofclusteringschemesbysavingenergyandprolongingthelifetimeofsensornetworksignificantly.TheLowEnergyAdaptiveClusteringHierarchy(LEACH)achievesasupremepopularityforitssimplicityandapplicabilityinWSNs.AlargenumberofworksexistthatmodifiesLEACHtostrengthentheapplicabilityofthisschemeinpracticallife,butonlylimitedtotheclusterset‐upphase.Inthispaper,weobserveamajorproblemthatexistsinalloftheclusteringprotocolbasedonLEACH.LEACHanditsvariantencounterprematuredeathofclusterheadsbecauseofthisfixedroundtimeproblem.Ourproposeddynamicservicepolicybasedschemedecreasestheprematuredeathofclusterheadandthepacketslosssignificantly.

Energy‐AwareMulti‐HopTransmissionforSensorNetworksbasedonAdaptiveModulation

AbdellahChehri(UniversityofOttawa,Canada);HusseinMouftah(UniversityofOttawa,Canada)

WirelessSensornetworks(WSN)havebecomeafocusofresearchinthelastfewyears.WSNiscomposedofsmallbattery‐powereddevicesthathassensorsandwirelesscommunicationcapabilities.EnergymanagementisoneofthekeyissuesinWSNsbecauseitdirectlyimpactsthenetworklife‐time.Inordertoovercomethisrestriction,severalenergy‐efficientapproachesfordifferentlayershavebeeninvestigated.Inthispaper,energyoptimizationonphysicallayerisanalyzed.Thenode'spowerconsumptionisoptimizedthroughscalingthemodulationschemeusedinnodecommunications.Resultsshowthatanoptimalmodulationschemecanleadtotheminimumpowerconsumptionoverthewholewirelesssensornetwork.

Performancestudyofmultiplecover‐setstrategiesformission‐criticalvideosurveillancewithwirelessvideosensors

PhamCongDuc(Univ.ofPau,France);AbdallahMakhoul(UniversityofFranche‐Comté,France)

AWirelessVideoSensorNetwork(WVSN)consistsofasetofsensornodesequippedwithminiaturizedvideocameras.Unlikeomni‐directionalsensors,thesensingregionofavideonodeislimitedtothefieldofviewofitscamera.Inthispaper,westudytheproblemofcoveragebyvideosensorsinrandomlydeployedWVSN.Wefocusontheperformanceofvariousfastcoversetconstructionstrategiesforenablingefficientschedulingofnodesinmission‐criticalsurveillanceapplications.Simulationresultsshowtheperformanceofthevariousstrategiesintermsofpercentageofcoverage,networklifetime,intrusionstealthtimeandnumberofintrusiondetection.

CharacterizingLinkandPathReliabilityinLarge‐ScaleWirelessSensorNetworks


23

TurgayKorkmaz(UniversityofTexasatSanAntonio,USA);KamilSarac(UniversityofTexasatDallas,USA)

Reliabledatatransfer(RDT)isoneofthekeyissuesinwirelesssensornetworks(WSNs)andcanbeachievedbyusinglink‐levelre‐transmissionsandmulti‐pathrouting.AnotherkeyissueisthescalabilityofWSNs.Inthispaper,wetrytobetterunderstandandcharacterize/quantifytherelationshipsbetweenreliabilityandscalability,andidentifypossibledesignoptionsforthefutureRDTprotocolsinlarge‐scaleWSNs.Withthisinmind,weconductactualexperimentstocharacterizelinkreliabilitymeasuresinanactualsensornetworksetting.WethenusedthesemeasuresandanalyzehowcommonlyusedRDTmechanismsimpactoverallpathreliability.Ingeneral,ouranalysisshowsthatthecombinationoflink‐levelre‐transmissionsandmulti‐pathroutingisaviablesolutioninsmall‐scaleWSNs.However,duetotheincreasedlengthofpathsbetweensensornodesandsinksinlarge‐scaleWSNs,itbecomescostlytosustaintheoverallreliabilityatanacceptablelevel.Therefore,thefutureRDTprotocolsshouldfocusonminimizingthepathlengthsusinghierarchicalstructuresinlarge‐scaleWSNs.ItisalsonecessarytocoupleRDTprotocolswithroutingprotocolsthatcantakelinkreliabilitymeasuresintoaccount.

Mobility‐assistedDetectionoftheReplicationAttacksinMobileWirelessSensorNetworks

XiaomingDeng(UniversityofScienceandTechnologyofChina,P.R.China);YanXiong(UniversityofScienceandTechnologyofChina,P.R.China);DepinChen(UniversityofScienceandTechnologyofChina,P.R.China)

Wirelesssensornetworksareoftendeployedinharshenvironments,wheretheadversaryisabletocapturecertainsensors.Onceasensoriscompromised,theadversarycaneasilyreplicateitanddeployseveralreplicasbackintothenetworkforfurthermaliciousactivities.Althoughanumberofprotocolshavebeenproposedtotacklesuchnodereplicationattacks,fewoftheseschemesaresuitableformobilewirelesssensornetworks.Inthispaper,weproposetwonovelmobility‐assisteddistributedsolutionstonodereplicationdetectioninmobilewirelesssensornetworks.Inbothprotocols,afterreceivingthetime‐locationclaims,witnessescarrytheseclaimsaroundthenetworkinsteadoftransmittingthem.Thatmeansdataareforwardedonlywhenappropriatewitnessesencountereachother.Unary‐Time‐LocationStorage&Exchange(UTLSE)detectsthereplicasbyeachofthetwoencounteredwitnesseswhichstoresonlyonetime‐locationclaim.Multi‐Time‐LocationStorage&Diffusion(MTLSD),bystoringmoretime‐locationclaimsforeachtrackednodeandintroducingtime‐locationclaimsdiffusionamongwitnesses,providesexcellentresiliencyandsub‐optimaldetectionprobabilitywithmodestcommunicationoverhead.Duetothemobility‐assistedproperty,ourprotocolsdonotrelyonanyspecificroutingprotocol,whichmakesthemsuitableforvariousmobilesettings.Ourtheoreticalanalysisandsimulationresultsshowthatourprotocolsareefficientintermsofdetectionperformance,communicationoverheadandstorageoverhead.

ALoad‐DistributiveQoSRoutingProtocolforMulti‐ServiceWirelessMeshNetworks

MehdiKhabazian(INRS‐EMT,Canada);SoniaAissa(UniversityofQuebec,INRS‐EMT,Canada)

Thispaperproposesanovelroutingprotocolformulti‐servicewirelessmeshnetworks(WMNs).Ourprotocolprovisionsqualityofservice(QoS)usingbandwidthreservationandbandwidthsplittingmechanismsinthenetworklayerandenhanceddistributedcontentionaccessmechanismintheMAClayer.Aperformanceanalysisisconductedandtheresultsshowthattheproposedresourcemanagementmechanismenableshigh‐prioritytrafficstobetteraccessnetworkresourcesandachievelowerdelays.Low‐prioritytraffics,ontheotherhand,mayberoutedthroughhighernumberofhopsandmayexperiencemoredelaysormeetloweravailablebandwidth.Theproposedbandwidthoffermechanismresultsinanefficienttrafficloaddistributioninthenetworkandeliminatesbottle‐necksituations.TheresultsalsoshowtheinteractionbetweentheMACandroutingprotocolsintermsofjointQoSprovisioning.


24

Wednesday, October 13

8:30AM‐9:30AMKeynote:Towards50BillionDevices:ASustainableEvolutionofMobileNetworksPierreBoucher,EricssonCanadaRoom:StrategyRoom3Chair:AbderrahimBenslimane(UniversityofAvignon&LIA/CERI,France)

10:00AM‐11:40AMAirInterfacesRoom:StrategyRoom1Chair:ShihabJimaa(KhalifaUniversity,UAE)

EffectofChannelInterferenceonIndoorWirelessLocalAreaNetworkPositioningEddieChan(TheHongKongPolytechnicUniversity,HongKong);GeorgeBaciu(TheHongKongPolytechnicUniversity,HongKong)

Localizationsystemsforindoorareashaverecentlybeensuggestedthatmakeuseofexistingwirelesslocal

areanetwork(WLAN)infrastructureandlocationfingerprintingapproach.However,mostexistingresearchworkignoreschannelinterferencebetweenwirelessinfrastructuresandthiscouldaffectaccurateandprecise

positioning.Abetterunderstandingofthepropertiesofchannelinterferencecouldassistinimprovingthepositioningaccuracywhilesavingsignificantamountsofresourcesinthelocation‐awareinfrastructure.Thispaperinvestigatestowhatextentthepositioningaccuracyisaffectedbychannelinterferencebetweenaccess

points.Twosetsofexperimentscomparehowthepositioningaccuracyisaffectedinthreedifferentchannelassignmentschemes:ad‐hoc,sequential,andorthogonaldataisanalyzedtounderstandwhatfeaturesofchannelinterferenceaffectpositioningaccuracy.Theresultsshowthatchoosinganappropriatechannel

assignmentschemecouldmakelocalization10%moreaccurateandreducethenumberofaccesspointsthatarerequiredby15%.Theexperimentalanalysisalsoindicatesthatthechannelinterferenceusuallyobeysaright‐skeweddistributionandpositioningaccuracyisheavilydependentonchannelinterferencebetween

accesspoints(APs).

OntheImpactofMultipathPropagationandDiversityinPerformanceofIterativeBlockDecisionFeedbackEqualizersFábioCoelho(UniversidadeNovadeLisboa,Portugal);RuiDinis(ISR‐IST,TechnicalUniversityofLisbon,Portugal);NunoSouto(ISCTE/InstitutodeTelecomunicações,Portugal);PauloMontezuma(FCT‐UNL,Portugal)

SCmodulation(Single‐Carrier)withFDE(Frequency‐DomainEqualization)combinedwithiterative(turbo)FDEschemeshasexcellentperformanceinseverelytime‐dispersivechannels,makingitapromisingcandidatefor

futurebroadbandwirelesssystems.Infact,itwasobservedthattheperformancecanbeclosetotheMFB(MatchedFilterBound).InthispaperweconsideraclassofiterativeFDEschemesandwestudytheimpactofthenumberofmultipathcomponentsandthediversityorderonitsperformance.Itisshownthatforahigh

numberofseparablemultipathcomponentstheasymptoticperformanceapproachestheMFB,evenwithoutdiversity.WhenwehavediversitytheperformanceapproachestheMFBfaster,evenwhenwehavejustasmallnumberofseparablemultipathcomponents.

ParallelsoftZFdetectionforturbo‐codedQO‐STBCscheme


25

UnheePark(ElectronicsandTelecommunicationsResearchInstitute,Korea);SooyoungKim(ChonbukNationalUniversity,Korea);YoungminKim(ChonbkNationalUniversty,Korea);Dae‐SubOh(ElectronicsandTelecommunicationsResearchInstitute,Korea);Bon‐JunKu(ElectronicsandTelecommunicationsResearchInstitute,Korea)

Azeroforcing(ZF)decoderusingthepseudoinverseofachannelmatrixisgenerallyusedfordetectionofquasi‐orthogonalspacetimeblockcoding(QO‐STBC).ThisZFdetectionforQO‐STBCshouldsacrificenotonlythedecodingcomplexitybutalsothediversitygaincomparedtoasimplelineardetectionfororthogonalSTBC

schemes.ThisdisadvantageofQO‐STBCschemesaremainlyresultfromtheinterferencetermsinthedetectionmatrix.Inthispaper,weproposeaparalleldetectionschemeforQO‐STBC,whichmayenhancethecomputationalefficiencycomparedtotheconventionalZFscheme,especiallywhencombiningwithturbo

codes.Wepresentaveryefficientsoftdecisionmetricstobeusedattheiterativedecoderforturbocodes.Thesimulationresultsinthispaperrevealthattheproposeddetectionschemeproducesanalmostthesameperformancetothatofthethemaximumlikelihood(ML)detection,withgreatlyenhancedcomputational

efficiency.

AnID‐basedAuthenticationSchemeFortheIEEE802.11sMeshNetworkAymenBoudguiga(Telecom&ManagementSudParis,France);MarylineLaurent(InstitutTélécom,TélécomSudParis,France)

NowadaysauthenticationinWirelessMeshNetworks(WMN)referstothe802.1XauthenticationmethodsoraPresharedkeyauthentication,andmakesuseofcertificatesorsharedsecrets.Inwirelessenvironments,

managementofcertificatesisdisadvantageous.CertificatesrequiredeployingaPublicKeyInfrastructure(PKI)andCertificationAuthorities(CA)andtheyrequiredefiningacertificatemanagementpolicytocontrolthegeneration,transmissionandrevocationofcertificates.Managementofcertificatesisacumbersometaskand

doesnotmatchthelimited(powerandmemory)resourcesavailableatwirelessnodes.MoreoveritdoesnotmatchthenonpermanentconnectivitytoCA.Inthispaper,weproposeanID‐basedmethod,asanalternativetothePKI,toprovidenodeswithprivateandpublickeys,andwepresentanauthenticationschemethatuses

theID‐basedcryptographicconcepts.Asillustratedinthepaper,theauthenticationschemeisshownassuitabletotheWMNnetworks.

ComputationallyEfficientLatticeReductionforMIMO‐OFDMSystemsWeiLiu(OregonStateUniversity,USA);KwonhueChoi(YeungnamUniversity,KOREA,Korea);HuapingLiu(OregonStateUniversity,USA)

Weproposeacomputationallyefficientlatticereduction(LR)algorithmformultiple‐inputmultiple‐output

(MIMO)orthogonalfrequencydivisionmultiplexing(OFDM)systemsinfrequency‐selectivefadingchannels.Inourproposedalgorithm,weexploittheinherentfeatureofunimodulartransformationmatrixPthatremainsthesameforfrequencycomponentswhichhaverelativelyhighamplitudecorrelation.Weeliminatethe

redundantcalculationsbyreducingbrute‐forceLRiterationsamongadjacentsubcarriers.WesimulatetheerrorperformanceandcomplexityoftheproposedalgorithmundervariousMIMO‐OFDMsystemconfigurations.TheresultsdemonstratethattheproposedalgorithmcouldsignificantlyreducetheLR

complexitybyupto90%multiplicationsand99%divisionsofbrute‐forceLRwhilemaintainingthesystemperformance.


26

10:00AM‐11:40AM

SmartSystemsRoom:StrategyRoom2

ANovelReducedComplexityDetectionSchemeforDistributedSingle‐CarrierFrequencyDomainEqualizationHomaEghbali(SimonFraserUniversity,Canada);SamiMuhaidat(SimonFraserUniversity,Canada);NaofalAl‐Dhahir(UniversityofTexasatDallas,USA)

Inthispaper,weproposeanewdetectionschemeforsinglecarrierfrequency‐domainequalization(SC‐FDE)forrelay‐assistedtransmissionscenariooverfrequencyselectivechannels.Weshowthat,byincorporating

linearprocessingtechniques,ournewreceiversignificantlyoutperformstheminimummeansquareerror(MMSE)‐distributed(D)‐SC‐FDEreceiverintermsoftheerrorrateperformance.SimulationresultsandcomplexityanalysisdemonstratethatourproposedreceiveroutperformstheconventionalcooperativeMMSE‐

SC‐FDEreceiverbyperformingclosetomatchedfilterbound(MFB),whileincurringaminimaladditionalcomputationalcomplexity

MinimumBitErrorRateMultiuserDetectionofSDMA‐OFDMSystemUsingDifferentialEvolutionaryAlgorithmJehadAbabneh(JordanUniversityofScienceandTechnology,Jordan);TaimourAldalgamouni(JordanUniversityofScienceandTechnology,Jordan);AsmaaAlqudah(JordanUniversityofScienceandTechnology,Jordan)

Spacedivisionmultipleaccessaidedorthogonalfrequencydivisionmultiplexing(SDMA‐OFDM)isapromising

techniqueforhighdataratefuturewirelesscommunications.Inthispaper,aminimumbiterrorrate(MBER)differentialevolution(DE)algorithmbasedmultiuserdetector(MUD)forSDMA‐OFDMsystemisproposed.Theproposedalgorithmdirectlyminimizesthebiterrorrate(BER)costfunctionbyselectingtheoptimumweight

vectors.SimulationresultsshowthattheproposedDEbasedMUDoutperformstheminimummean‐squarederror(MMSE)basedMUDintermsoftheachievableBER.SimulationresultsalsoshowthattheperformanceoftheDEbasedMUDiscomparabletothatoftheparticleswarmoptimization(PSO)basedMUD.

CooperativeRelayinginInterferenceLimitedCognitiveRadioNetworksAsaduzzamanAsad(UniversityofUlsan,Korea);Hyung‐YunKong(UniversityofUlsan,Korea)

Inthispaper,weconsideracooperativerelayingbasedcognitiveradio(CR)networksinwhichtheprimaryreceiversareprotectedbypeakinterferencepowerconstraint.Insuchscenario,findingthetransmission

opportunitywithatargetdataratebymaintainingtheinterferencepowerconstraintistheprimegoalofthesystem.Weshowthatcooperativerelayingtechniquescansignificantlyreducetheoutageprobabilityequivalently,improvethetransmissionopportunityoftheCRnetworksinslow‐fadingchannels.Weconsider

bothdistributedspacetimecode(DSTC)basedsimultaneoustransmissionandsinglerelayselectionbasedtransmissionfromtherelays.TheexactexpressionsoftheoutageprobabilitiesofdifferentcooperativerelayingschemesarederivedforarbitrarynumberofrelaysandinterferencepowerconstraintinRayleighfading


27

environment.ResultsshowthatthesinglerelayselectionbasedschemesoutperformtheDSTCbasedscheme,

intermsofbothoutageprobabilityandimplementationcomplexity,inmulti‐relayCRnetwork.

COPAL:AnAdaptiveApproachtoContextProvisioningFeiLi(ViennaUniversityofTechnology,Austria);SchahramDustdar(ViennaUniversityofTechnology,Austria);SanjinSehic(ViennaUniversityofTechnology,Austria)

Context‐awareservicesneedtoacquirecontextinformationfromheterogeneouscontextsources.Thediversityofservicerequirementsoncontextchallengescontextprovisioningsystemaswellasitsprogramming

model.ThispaperproposesCOPAL(COntextProvisioningforALl)‐‐‐anadaptiveapproachtocontextprovisioning.COPALisatfirstacontextprovisioningsystem,whichprovidesloose‐couplingbetweencontextanditsprocessing.ThecomponentarchitectureofCOPALensuresnewcontextprocessingfunctionscanbe

addeddynamically.Asetofcontextprocessingpatternsareproposedtocustomizecontextattributesandcomposecontextprovisioningschemes.TheCOPALcomponentsandmodelsarereflectedinaDomainSpecificLanguage(DSL),whichcanfurtherreducethedevelopmenteffortsoncontextprovisioningbyautomaticcode

generation.AnmotivatingscenarioisusedthroughoutthepapertoillustrateCOPALapproach.

ChannelAwareDeferringStrategiestoImprovePacketSchedulinginOFDMASystemsIsraelGuío(UniversityofZaragoza,Spain);AngelaHernández‐Solana(UniversityofZaragoza,Spain);VanesaMontero(UniversityofZaragoza,Spain);JavierLafuente‐Martínez(UniversityofZaragoza,Spain);AntonioValdovinos(UniversityofZaragoza,Spain)

Inthispaper,weanalyzetheperformancegainachievedwhenachannel‐awaredeferring(CaD)strategyisappliedtodefertheallocationofuserswithtransitorybadchannelstateinamobileOFDMAsystem.Users

withgoodchannelconditionsreceivemoreresourcesandtheradioresourceutilizationimproves.ToreducetheimpactoftheCaDstrategyonthequalityofservice(QoS)provisioningforthedeferredusers,adelay‐

dependentcriterionisalsoapplied.WeshowthattheCaDsignificantlyreducesboththedroppingrateandthemeandelayforthemostrestrictivetrafficinamulti‐servicescenario,underacertainpowerandsubcarrierallocation(PSA)algorithmthatefficientlycontrolstheinter‐cellinterference(ICI).

TOA‐BasedLateralDistanceMeasurementSystemUsingUWBImpulseRadioKeiichiNakamura(TheUniversityofTokyo,Japan);ShinsukeKobayashi(TheUniversityofTokyo,Japan);HisanoriMatsumoto(YRPUbiquitousNetworkingLaboratory,Japan);NoboruKoshizuka(TheUniversityofTokyo,Japan);KenSakamura(TheUniversityofTokyo,Japan)

Lateraldistancebetweentwotrafficparticipantsisanimportantcontextforintelligenttransportationsystemsforrealizingacollisionpredictionsystem.Obtaininglateraldistancerequirescostlyhardware,prohibitingtrafficparticipantssuchaspedestriansand/orbicycliststoreceivebenefitsoflateraldistanceinformationfor

securingtheirsafety.Inthispaper,atime‐of‐arrival(TOA)basedbilaterationisproposedforestimatingrelativelateraldistanceusingultra‐widebandimpulseradio(UWB‐IR).RangingerrorofUWB‐IRsystemsaffectingtheestimationaccuracyoflateraldistanceiscopedwithapplyingalowpassfiltertoangulardata.

Experimentalresultsshowthattheestimationerrorisreducedfrom8mto3mwhentherelativedistancebetweenatargetvehicleandapedestrianislessthan15m,usingaportableUWB‐IRsystemwith30cmrangingaccuracy.


28

1:20PM‐3:00PM

MobilityandNomadicity(I)Room:StrategyRoom1

Chair:GeorgeBaciu(TheHongKongPolytechnicUniversity,HongKong)

Multi‐GatewayMulti‐pathRoutingProtocolfor802.11sWMNHuYun(UniversityofScienceandTechnologyofChina,P.R.China)

Toenhancethecapacityofwirelessmeshnetwork,multi‐gatewayarchitectureisinvited.Weuseengineeringmethodstodevelopanimplementablemultipathmulti‐gatewayroutingprotocol(MPMG)extendedfromHWMPtoprovidemultipathfunctionality.Wefirstlydeveloparoutingprotocolwithlowermanagement

overhead,thenwedevelopthreeoptimizingstrategytodealwiththebottleneckproblemsappearinginsimulations.AtlastweproposeanimplementableMPMGandevaluateitintypicalscenarios.PerformancecomparisonsofMPMGwithHWMP,AODVandOLSRaredonebyNS‐2.Thesimulationresultsshowthat

MPMGoutperformstheotherthreeroutingprotocols.SpeciallyMPMGimprovesthenetworkthroughputby12.8%andreducesroutingoverheadbyabout80%comparedtoHWMP.

AnSSPFormulationofRoutinginDTNNetworksYoussefIraqi(KhalifaUniversity,UAE)

InthispaperwepresentaStochasticShortestPath(SSP)formulationofroutinginDTNnetworkswhereallthe

nodesarepotentiallymobileandwhereonlyanaggregatemobilityinformationisavailable.Wepresentasolutiontotheoptimalcaseandpresenttwoheuristicstosolvetheproblem.Extensivesimulationsassesstheperformanceoftheproposedschemes.

PromotingCongestionControlinOpportunisticNetworksAndrewGrundy(UniversityofNottingham,UnitedKingdom);MilenaRadenkovic(UniversityofNottingham,UnitedKingdom)

Weareconcernedwithcongestionawareforwardingalgorithmswithinopportunisticnetworks.Weremovethereoccurringassumptionofunlimitedstorage,makingitevidentthatcongestionisaprominentproblem

thatneedstobeaddressed.Weproposeacontext‐driven,distributedcongestioncontrolalgorithmthatadaptivelychoosesthenexthopbasedoncontacthistory,contactstatistics,aswellasstoragestatistics.Weaimtodistributedtheloadawayfromthestoragehotspotsinordertospreadthetrafficaround.Weperform

anextensivesetoftracedrivensimulationsfor"several‐to‐many"communicationpatternsinopportunisticnetworks.Weshowthatcongestioncontrolisanessentialcomponenttobeincludedinthetransferofdatainopportunisticnetworks,whichisachievablebydisseminatingstatisticsconcerninganodesstateofavailability.

Ourresultsshowathatbyusingtheavailabilityheuristicitispossibletoachievehigherlevelsofsentanddeliveredpackets.

Pareto‐MetaheuristicMulti‐ObjectiveNetworkOptimizationforOFDMA‐basedSystems


29

AnasF.AlRawi(UniversityofNewcastleUponTyne,UnitedKingdom);BayanSharif(UniversityofNewcastleUponTyne,UnitedKingdom);CharalamposC.Tsimenidis(NewcastleUniversity,UnitedKingdom)

Inthispaper,anewplanningmethodisproposedforthenextgenerationwirelessnetworksthatarebasedonOrthogonalFrequencyDivisionMultipleAccess(OFDMA).Asaconsequenceofthewidevarietyservice

demandsintermsofdatarateandQualityofService(QoS),thetrafficpatternisconsideredtobeheterogeneous.Therefore,thecomplexityofobtainingBaseStations(BSs)positionsincreaseswiththerandomnessofthetrafficdistribution.Inadditiontothischallenge,thecapacityofeachBSislimiteddueto

powerandbandwidthconstraints,propagationlosses,Gaussianantennapattern,andtheCo‐ChannelInterference(CCI),whichinturnincreasethecomplexitymeasuresforanefficientnetworkdesign.AccordingtoNashEquilibrium,combinedefficientsystemsmustperformequallytoachievecertainperformance.This

impliesthatthetrafficofacellularsystemshouldbeequallydistributedoveralltheBSstoachievethehighestnetworkperformance.Hence,weformulatetheplanningproblemasanon‐linearmulti‐objectiveoptimization

problem.TheoptimumsolutionshouldnotdominatethethroughputofoneBSovertheothersandthisisreferredtoasParetooptimal.However,loadingallcellsequallymaynotbepossibleincertaintrafficdistributions.Therefore,theproposedmethodtendstoapproachtheoptimalsolutionbytacklingtheproblems

ofBSpositioningandresourceallocationsimultaneously.Weadoptahybridapproach,i.e.Pareto‐Metaheuristic(PMH)thatachievesabalancedthroughputoverallcellsaswellasminimizingthenumberoftheinstalledBSstargetingacertainserviceoutageprobability.Simulationresultsshowthat,inadditionto

maximizingtheindividualcellthroughput,thenetworkthroughputvariationdecreasesasthenumberofiterationincreases.

ExperimentalStudyofMobilityintheSoccerFieldwithApplicationtoReal‐TimeAthleteMonitoringVijaySivaraman(UniversityofNewSouthWales,Australia);SarthakGrover(IndianInstituteofTechnologyRoorkee,India);AlexanderKurusingal(UniversityofNewSouthWales,Australia);AshayDhamdhere(UniversityofNewSouthWales,Australia);AlisonBurdett(ToumazTechnologiesLtd.,UnitedKingdom)

Livemonitoringofathletesduringsportingeventscanhelpmaximiseperformancewhilepreventinginjury,and

enablenewapplicationssuchasreferee‐assistandenhancedtelevisionbroadcastservices.Amajorchallengeistheextractionofathletephysiologicaldatainreal‐time,sincetheradiorangeofbody‐wornsensordevicesislimited,necessitatingmulti‐hoproutingmechanisms.However,littleisknownaboutthehighlydynamic

operatingconditionsonasoccerfieldunderwhichcommunicationprotocolsneedtooperate.Inthisworkweconductfieldexperimentsinwhichweoutfitfirst‐divisionsoccerplayerswithsensordevicesandrecordtheirinter‐connectivityduringarealgame.Ourfirstcontributionprofilesthekeypropertiesofthedynamicwireless

topologiesarisinginthesoccerfield,andhighlightstheconsequencesforroutingmechanisms.Weshowthatthetopologyisingeneralsparse,withshortencountersandpower‐lawdistributedinter‐encounters.Importantly,theco‐ordinatedmovementofplayersinthefieldgivesrisetosignificantcorrelationsamongst

links,anaspectthatcanpotentiallybeexploitedbyrouting.Oursecondcontributiondevelopsamodelforgeneratingsynthetictopologiesthatmirrorconnectivityinarealsoccergame,andcanbeusedforsimulationstudiesofroutingmechanisms.Itsnoveltyliesinexplicitlymodellingtheunderlyingauto‐correlationandcross‐

correlationpropertiesofthelinks,fromwhichderivedmeasuressuchasinter‐encountertimesand


30

neighbourhooddistributionsfollow.Ourstudyisanimportantfirststeptowardsunderstandingandmodelling

dynamictopologiesassociatedwithsportsmonitoring,andpavesthewayforthedesignofreal‐timeroutingalgorithmsforsuchenvironments.


31

1:20PM‐3:00PM

NextGenerationNetworks(I)Room:StrategyRoom2

DimensioningoftheLTEAccessTransportNetworkforElasticInternetTrafficXiLi(UniversityofBremen,Germany);UmarToseef(UniversityofBremen,Germany);ThusharaLWeerawardane(UniversityofBremen,Germany);WojciechBigos(NokiaSiemensNetworks,Poland);DominikDulas(NokiaSiemensNetworks,Poland);CarmelitaGoerg(UniversityofBremen,Germany);AndreasTimm‐Giel(HamburgUniversityofTechnology,Germany);AndreasKlug(NokiaSiemensNetworks,Germany)

ThispaperproposesefficientanalyticalmodelstodimensiontherequiredtransportbandwidthsfortheLong

TermEvolution(LTE)accessnetworkfortheelasticInternettraffic(whichiscarriedbytheTCPprotocol).ThedimensioningmodelsarebasedontheuseofProcessorSharingqueuingtheorytoguaranteeadesiredend‐to‐endapplicationQoStarget.Forvalidatingtheanalyticaldimensioningmodels,adevelopedLTEsystem

simulationmodelisused.Extensivesimulationsareperformedwithvarioustrafficandnetworkscenarios.Theanalyticalresultsderivedfromtheproposeddimensioningmodelsarecomparedagainstthesimulationresults.Thepresentedresultsdemonstratethattheproposedanalyticalmodelscanappropriatelyestimatethe

applicationperformancesofdifferentQoSprioritiesandthusbeusedforthelinkdimensioningforvarioustrafficandnetworkscenarios.

SchedulingandResourceAllocationforMulticlassServicesinLTEUplinkSystemsOscarDelgado(ConcordiaUniversity,Canada);BrigitteJaumard(ConcordiaUniversity,Canada)

WeproposetwoschedulingandresourceallocationschemesthatdealwithQualityofService(QoS)requirementsinUplinkLongTermEvolution(LTE)systems.QoSforamulticlasssystemhasbeenseldomtakenintoaccountinpreviousresourceallocationalgorithmsforLTEuplink.Inoneofthenewalgorithms,we

investigatethepossibilityofassigningmorethanoneresourceblockanditsconsequencesonsatisfyingstringentQoSrequirementsinthecontextofheavytraffic,eitherintermsofend‐to‐enddelaysorofminimumrates.Systemcapacityandthenumberofeffectivelyservedrequestsareusedasperformancemetrics.

NumericalresultsshowthatitispossibletomanageamulticlassschemewhilesatisfyingtheQoSconstraintsofallrequests.Allowingtheassignmentofmorethanoneresourceblockperrequestdidnotappeartobeameaningfuladvantage.Indeed,itisonlyusefulwhenthereisanheavytraffic,andsomeofoftherequestshave

stringentQoSrequirements.Butthen,satisfyingthoserequestscanonlybedoneattheexpenseofreducingtheoverallsystemcapacityandoflimitingthenumberofusersthatcanbeserved.

SpectralEfficiencyPerformanceofMBSFN‐enabledLTENetworksChristosBouras(UniversityofPatrasandRACTI,Greece);AntoniosAlexiou(UniversityofPatras,Greece);VasileiosKokkinos(RACTIandUniversityofPatras,Greece);GeorgeTsichritzis(UniversityofPatrasandRACTI,Greece);AndreasPapazois(RACTIandUniversityofPatras,Greece)

LongTermEvolution(LTE)constitutesthelateststeptowardsthe4thgeneration(4G)ofradiotechnologies

designedtoincreasethecapacityandspeedofmobilecommunications.TosupportMultimedia


32

Broadcast/MulticastServices(MBMS),LTEoffersthepossibilitytotransmitMultimediaBroadcastmulticast

serviceoveraSingleFrequencyNetwork(MBSFN),whereatime‐synchronizedcommonwaveformistransmittedfrommultiplecellsforagivenduration.Thisenablesover‐the‐aircombining,thusimprovingtheSignaltoInterferenceplusNoiseRatio(SINR)andspectralefficiency(SE)significantlycomparedto

conventionalMBMSoperation.Inthispaper,weanalyticallycalculatetheSEperformanceachievedinaMBSFNareaforadynamicallychangingusertopologyanddifferentmodulationandcodingschemes(MCS).Finally,basedontheSEmeasurement,wedeterminetheMCSschemethateithermaximizesorachievesatargetSE

forthecorrespondinguserdistribution

EfficientResourceAllocationforDevice‐to‐DeviceCommunicationUnderlayingLTENetworkMohammadZulhasnine(CarletonUniversity,Canada);ChangchengHuang(CarletonUniversity,Canada);AnandSrinivasan(CarletonUniversity,Canada)

D2D(device‐to‐device)communicationasanunderlayingcellularnetworkempowersuser‐drivenrichmultimediaapplicationsandalsohasproventobenetworkefficientoffloadingeNodeBtraffic.However,D2D

transmittersmaycausesignificantamountofinterferencetotheprimarycellularnetworkwhenradioresourcesaresharedbetweenthem.Duringthedownlink(DL)phase,primarycellUE(userequipment)maysufferfrominterferencefromtheD2Dtransmitter.Ontheotherhand,theimmobileeNodeBisthevictimof

interferencebytheD2Dtransmitterduringtheuplink(UL)phasewhenradioresourcesareallocatedrandomly.SuchinterferencecanbeavoidedotherwisediminishifradioresourceallocatedintelligentlywiththecoordinationfromtheeNodeB.Inthispaper,weformulatetheproblemofradioresourceallocationtotheD2D

communicationsasamixedintegernonlinearprogramming(MINLP).SuchanoptimizationproblemisnotoriouslyhardtosolvewithinfastschedulingperiodoftheLongTermEvolution(LTE)network.Wethenproposeanalternativegreedyheuristicalgorithmthatcanlesseninterferencetotheprimarycellularnetwork

utilizingchannelgaininformation.Wealsoperformextensivesimulationtoprovetheefficacyoftheproposedalgorithm.

ARBR:AdaptiveReinforcement‐BasedRoutingforDTNAhmedElwhishi(UniversityofWaterloo,Canada)

Abstract‐‐‐ThispaperintroducesanovelroutingprotocolinDelayTolerantNetworks(DTNs),aimingtosolvetheonlinedistributedroutingproblem.Bymanipulatingacollaborativereinforcementlearningtechnique,agroupofnodescancooperatewitheachotherandmakeaforwardingdecisionforthestoredmessagesbased

onacostfunctionateachcontactwithanothernode.Theproposedprotocolischaracterizedbynotonlyconsideringthecontacttimestatisticsunderanovelcontactmodel,butalsolooksintothefeedbackonuserbehaviorandnetworkconditions,suchascongestionandbufferoccupancysampledduringeachprevious

contactwithanyothernode.Therefore,theproposedprotocolcanachievehighefficiencyviaanadaptiveandintelligentroutingmechanismaccordingtonetworkconditions.Extensivesimulationisconductedtoverifytheproposedprotocol,whereacomparisonismadewithanumberofexistingencounter‐basedroutingprotocols

intermofthenumberoftransmissionsofeachmessage,messagedeliverydelay,anddeliveryratio.


33

3:30PM‐5:30PMNextGenerationNetworks(II)Room:StrategyRoom1

Chair:AmirQayyum(M.A.JinnahUniversity,Islamabad&CenterofResearchinNetworksandTelecom,Pakistan)

AdaptiveMultiuserMIMOTransmissioninWirelessSystemswithCooperatingCellsJinheeLee(KoreaUniversity,Korea);Young‐ChaiKo(KoreaUniversity,Korea);Hong‐ChuanYang(UniversityofVictoria,Canada)

Inmulticellwirelesssystemswithinsufficientfrequencyreuse,usertransmissionwillsufferother‐cellinterference(OCI).CellcooperationisaneffectivewaytomitigateOCIandincreasethesystemsumrate.Anadaptiveschemeforservingoneuserineachcellwasproposedin[1].Inthispaper,wegeneralizethatscheme

byservingmorethanoneuserineachcellwithadaptivezeroforcingbeamforming(ZF)strategies.Basedonourderivedstatisticsofthesignal‐to‐noiseplusinterferenceratios,wechoosetheschemetomaximizethetotalergodicsum‐ratebasedonuserlocations.Throughthenumericalexamples,weshowthatthetotalsystemsum

ratecanbeimprovedbyselectingappropriatetransmittingstrategyadaptively.Asaresult,ourproposedsystemcanexplorespatialmultiplexinggainwithoutadditionalpowerandthusimprovestotalsystemsumratesignificantly.

Orientation‐basedWi‐FiPositioningontheGoogleNexusOneEddieChan(TheHongKongPolytechnicUniversity,HongKong);GeorgeBaciu(TheHongKongPolytechnicUniversity,HongKong)

Whilelocalizationsystemsforindoorareasusingtheexistingwirelesslocalareanetwork(WLAN)infrastructurehaverecentlybeenproposed,wirelessLANlocalizationapproachessufferfromanumberofsignificant

drawbacks.Tobeginwith,thereisinaccuratepositiontrackingduetotheorientationofthemobiledeviceandsignalfluctuation.Inthispaper,weapplyaorientationfilterandaNewtonTrustRegion(TR)algorithmtoeliminatethenoisylocationestimation.WeimplementthelocalizationalgorithmontheNexuswhichisaWi‐Fi

enableddevicewithadigitalcompass.Ourexperimentalanalysisshowsthatorientation‐basedTrustRegionmethodenhancesourpreviousworkwith10%feweraccesspointsand7%moreaccurateforlocationestimation.Theproposedorientation‐basedTrustRegionmethodleadstosubstantiallymoreaccurateand

robustlocalizationsystem.

HybridStreamingDeliveryoverDVB‐HBroadcastandWiMAXMobileNetworksHsin‐TaChiao(IndustrialTechnologyResearchInstitute(ITRI),Taiwan);Chi‐TeTseng(IndustrialTechnologyResearchInstitute(ITRI),Taiwan);Jhih‐WeiJiang(IndustrialTechnologyResearchInstitute(ITRI),Taiwan);Hsin‐AnHou(ITRI,Taiwan)

Hybridstreamingdeliveryoverconvergedmobileandbroadcastnetworkscanenableoperatorstotransmitmultimediacontentsinamoreefficientandflexibleway.Consequently,thefunctionsrelatedtohybrid

streamingdeliveryarerecentlystandardizedintheIP‐basedservicelayerstandardsforDVB‐H,i.e.DVB‐IPDCandOMABCASTstandards.Inbothstandards,seamlessserviceswitchingisoneofthekeybuildingblocksforachievinghybridstreamingdelivery.Inthispaper,wedescribetheexperiencesforimplementingthefunction


34

ofstreamingserviceswitchingbetweenDVB‐HbroadcastandWiMAXmobilenetworksaccordingtothe

abovementionedstandards.Inourimplementation,instantiatingtwosetsofaudioandvideocodecsinparallelduringserviceswitchingisavoidforreducingtherequiredhardwareresourcesinaterminal.Inaddition,theexperimentresultsofstreamingserviceswitchingareprovidedtoshowtheperformanceofour

implementationinanextremetestenvironmentwherethelevelofaDVB‐Hsignalcouldbevariedrapidlyforsimulatingtheobservedroomorbuildingpenetrationlossforamovingterminal.

RobustData‐PartitionedVideoStreamingoveraWiMAXChannelLaithAAl‐Jobouri(UniversityofEssex,UnitedKingdom);MartinFleury(UniversityofEssex,UnitedKingdom);MohammadGhanbari(UniversityofEssex,UnitedKingdom)

Thispaperdemonstratesarobustlayeredvideoschemebasedondata‐partitioningandintendedforIPTV

streamingoverwirelessbroadband.Equalerrorprotectionthroughratelesscodingisapplied,wherebyhigher‐priorityDPpacketsareprotectedbyappropriateselectionofquantizationparameterandpictureslicing,soastoregulatepacketsize.Bothpacketdropsfromcongestionandadversechannelconditionsareshowntobe

affectedbypacketsizeinthemobileWiMAXchannelinvestigated.Themainproposalisforadaptiveratelesscodinginwhichadditionalredundantdataareretransmittedtohealcorruptedpackets.However,thoughthesepacketsarealwaysrepairable,delayincreasesasthepercentageofcorruptedpacketsincreases,whichaffects

thedesignparameters.Intra‐refreshMBsareaddedtopreventtheobjectivevideoqualityfallingbelowanacceptablelevel.Pictureslicingfurtherreducesthepacketsizetoincreaserobustnessinthefaceofmeasurementnoiseduringchannelestimationandtheeffectsofslowandfastfading.

StrategyofSelf‐organizationinSensorsandActuatorsNetworksBilelRomdhani(UniversitédeLyonINRIA,INSALyonF‐69621,France,France);DominiqueBarthel(OrangeLabs,France);FabriceValois(INSALyon,France)

InWirelessSensorsandActuatorsNetworks(WSANs),actuatornodesarenodesricherinresources(processing

capacity,powertransmissionandenergystorage)andbettersuitedthansensornodestoprocessthedata,makedecisionsbasedonsensedvaluesandperformappropriateactions.Inaddition,inordertoprovidetimelyaction,coordinationbetweensensorsandactuatorsisnecessary.Thus,inadditiontotheclassicalenergy

constraintsofWirelessSensorNetworks(WSNs),WSANsalsoimposenewchallengessuchashowtosupportandbenefitfromthenodesheterogeneitywhilepreservingenergyintheself‐poweredsensornodes.Newcommunicationprotocols,specifictoWSANs,areneeded.Inthispaper,weproposeahybridself‐organizing

data‐collectionprotocolinordertoprovideenergyefficiency,lowend‐to‐enddelayandhighdeliveryratiowhiletakingadvantageoftheresourceavailableontheactuatorsnodesinthenetwork.Thisnewself‐organizationprotocolconstructsitsstructurefromtheactuatorsandotherresource‐plentifulnodes.The

natureofthestructureisdifferentinsideandoutsideoftransmissionrangeoftheseresourcefulnodes.

ABitCollisionDetectionBasedQueryTreeprotocolforAnti‐CollisioninRFIDSystemHaosongGou(PusanNationalUniversity,Korea);YounghwanYoo(PusanNationalUniversity,Korea)

Anti‐collisionalgorithmsintheRFIDsystemcanbedividedintotwocategories:ALOHAbasedandbinarytree

basedalgorithm.Eachofthemhasitsownadvantagesordisadvantages.TheQTprotocol,asaclassicbinarytreebasedalgorithm,wasproposedtoachievethereliablethroughputofidentificationbyusingprefixtoavoid

collisions.ThispaperproposesanimprovedQTprotocolcalledBitcollisiondetectionbasedQueryTree(BQT)byadoptingindividualbitcollisiondetection,whichcandetectthecollisionineachbit.Itcanreducethecollisionforthetagswhichhavethesameprefixandaccelerateidentificationprocess.Thesimulationresults


35

andanalysisshowthatourBQTprotocolcouldreducethecollisionsandachievemuchbetterperformanceon

tagidentification.


36

3:30PM‐5:30PMMobilityandNomadicity(II)Room:StrategyRoom2

Chair:AndreasPapazois(RACTIandUniversityofPatras,Greece)

AnytimeandAnywhereMonitoringFortheElderlyYunfengChen(UniversityofGuelph,Canada);NidalNasser(UniversityofGuelph,Canada)

Inthispaperweproposeasystemarchitecturefortelemonitoringsystem.Theproposedarchitectureisnot

limitedtoonlyindoorenvironment.Byemployingamobilephonethatimplementsapersonalserver,thesystemalsosupportsthemonitoringofoldpeoplewhileawayfromhome.Inadditiontothesystemarchitecture,wealsoproposethemiddlewarearchitectureforthepersonalserverandthecross‐layerprotocol

stackarchitectureforthesensornode.Themiddlewareandthecross‐layerstackimprovetheflexibilityandexpansibilityofthesystem.

AComparativeAssessmentofRoutingforMobileNetworksDevanBingRehunathan(UniversityofStAndrews,UnitedKingdom);SaleemNBhatti(UniversityofStAndrews,UnitedKingdom)

Wirelessmobiledevicesarebecomingincreasinglyprevalentinsociety.Asaresult,aggregationofnetworkconnectivitythroughtheuseofmobilenetworksisbecomingincreasinglyrelevanttoserviceprovidersaswell

asformobileusers.ThecurrentapproachbeingpursuedwithintheIETFMobileExtensionsforIPv6(MEXT)WG,isbasedontheNetworkMobility(NEMO)architecture.NEMOusesIP‐in‐IPtunnellingforprovidingmobilenetworkcapabilityonanexistingIPv6network.Thisapproachcanresultinnon‐optimalroutingbetween

sourceanddestinationnodes.OtherproposalssuchasOptiNetsextendNEMOandtrytoaddressissuessuchassub‐optimalrouting.Therearealternativeapproachesalsobeingproposed,suchastheIdentifierLocatorNetworkProtocol(ILNPv6),whichisbasedontheuseofnaming,toenableaflexibleandintegratedmobile

networkcapabilitybasedonIPv6.Wehaveconductedacomparativeanalysisofthecostofprovidingoptimalrouting,intermsofpacketandbandwidthoverhead,basedonanemulation,usingdatafromtheLondonCircleLinemetropolitanrailwayasascenario.Ouranalysisshowsthatthesedifferentapproachestomobilityoffer

significantlydifferentperformancetrade‐offsinroutingformobilenetworks,dependingontheconstraintsofthenetworkscenario.

ARUM:aCooperativeMiddlewareandanExperimentationPlatformforMobileSystemsMatthieuRoy(LAAS‐CNRS,UniversityofToulouse,France);Marc‐OlivierKillijian(Laboratoired'Analyseetd'ArchitecturedesSystèmes(LAAS‐CNRS),France);GaëtanSéverac(LAAS‐CNRS,UniversityofToulouse,France)

Inthispaper,wepresentamiddlewarearchitecturefordependablemobilesystemsandanexperimentationplatformforitsevaluation.Theproposedarchitectureincludesthreebuildingblockstailoredformobile

cooperativeapplications:aProximityMap,aTrustandCooperationOracle,andaCooperativeDataBackupservice.Toillustrateourplatform,wedevelopedaDistributedBlack‐boxapplication,whoseaimistorecordcriticaldatawhiletoleratingthefailureofanode,andimplementedahardwareevaluationplatformofmobile


37

systemsforexperimentingwiththeapplication.Weprovideheresomeinsightsonthedevelopmentofthe

platform,focusingonwirelesscommunication.

AnEco‐FriendlyRoutingProtocolforDelayTolerantNetworksTamerAAbdelKader(UniversityofWaterloo,Canada)

Insparsemobilenetworks,nodesareconnectedatdiscreteperiodsoftime.Thisdisconnectionmaylastforlongperiodsinurbanandruralareas.Inaddition,mobilenodesareenergyandbuffersensitive,suchasin

mobilesensornetworks.Thelimitedpowerandstorageresources,combinedwiththeintermittentconnectionhavecreatedachallengingenvironmentforinter‐nodenetworking.ThistypeofnetworksisoftenreferredtoasDelayTolerantnetworks(DTN).RoutingprotocolsdevelopedforDTNfocusedmainlyonmaximizingthe

deliveryratioandminimizingtheend‐to‐enddelay.Therefore,theytendtospreadmanycopiesofthesamepacketintothenetwork,assumingtheavailabilityofbufferandpower.Decreasingnumberoftransmissions

reducesenergyconsumptionwhichhelpsinmaintainingacleanenvironment.Inthispaper,weformulateamathematicalmodelforoptimalroutinginDTNtoachieveminimumnumberoftransmissions.Inaddition,westudyandanalyzetheDTNheuristicroutingprotocols.Afterthat,weproposeanEco‐friendlyroutingprotocol,

EFR‐DTN,thatefficientlyusesimpleinformationprovidedfromthenetworktoachieveminimumenergyconsumption,whilemaintaininghigherdeliveryratiothantheotherprotocols.Simulationresultsshowtheoutperformanceoftheproposedprotocolunderdifferentbuffercapacities,trafficloads,andpacketTTL

values.

OntheImplementationofEnd‐to‐EndMobilityManagementFramework(EMF)EhsanElahi(M.A.JinnahUniversity,IslamabadPakistan,Pakistan);MuhammadYousaf(CASE,Islamabad,Pakistan);AmbreenSheikh(MuhammadAliJinnahUniversity,Islamabad,Pakistan,Pakistan);MuhammadMaazRehan(CoReNeT,M.A.JinnahUniversity,Islamabad,Pakistan);MuhammadOmerChughtai(CoReNeT,Pakistan);AmirQayyum(M.A.JinnahUniversity,Islamabad,Pakistan)

Traditionallythemobilityproblemhasbeensolvedmostlyatnetworklayer.HowevertheEnd‐to‐EndMobility

ManagementFramework(EMF)[1]providesthesolutiontothisproblemabovethetransportlayer.EMFovercomessomelimitationsofcurrentmobilitymanagementsolutionsbyeffectivelyprovidingmobilityservicessuchassofthandover,willfulhandover,locationupdatesetc.EMFneitherrequiresanysupportof

additionalentitiesinthenetworknorrequiresthechangesinthecurrentimplementationofTCP.ThispaperdescribesaportableimplementationdesignoftheEMFframeworkalongwiththetradeoffsinvolvedinimplementingtheframework.Theresultsofsomeexperimentsforperformanceanalysisarealsopresented

thatquantifytheprotocolandcomputationaloverheads.

VirtualKeyboardBCIusingEyeblinksinEEGRajeshSingla(DrBRAmbedkarNIT,India);RameshwarJha(DrBRAmbedkarNIT,India);BrijilChambayil(DrBRAmbedkarNIT,India)

ABrainComputerInterface(BCI)providesanewcommunicationchannelbetweenhumanbrainandthe

computer.ThispaperisconcentratedondevelopingaBCIsystem,aVirtualKeyboardusingtheLabVIEWplatform.TheEEGsignalcontainsthetechnicalartifacts(noisefromtheelectricpowersource,amplitudeartifact,etc.)andbiologicalartifacts(eyeartifacts,ECGandEMGartifacts).Eyeblinkisoneofthemainartifacts


38

intheEEGsignal.ButinthiscontexttheEyeblinksarenotartifactsandarecontrolsignalstoselectthe

blocks/charactersintheVirtualKeyboard.Thekurtosiscoefficientandamplitudecharacteristicsoftheeyeblinksignalsareusedtodetectthecontrolsignals.


39

Workshops

1. NASSUE:SecondInternationalWorkshoponNetworkAssuranceandSecurityServicesinUbiquitousEnvironments(NASSUE2010)

2. CMPA:FirstWorkshoponCooperativeMobileProtocolsandApplications(CMPA2010)

3. STWMC:ThirdIEEEInternationalWorkshoponSelectedTopicsinMobileandWirelessComputing(STMWC'10)3.1. STWMC1:WirelessCommunications3.2. STWMC2:UbiquitousComputing,ServicesandApplications3.3. STWMC3:MobileNetworking,MobilityandNomadicity

4. VECON:FirstInternationalWorkshoponVEhicularCOmmunicationsandNetworking(VECON2010)4.1. VECON14.2. VECON2

5. AWSAN:FirstInternationalWorkshoponAdvancesinWirelessSensorandActuatorNetworks(AWSAN2010)

6. PEMOS:FirstInternationalWorkshoponthePerformance

EnhancementsinMIMO‐OFDMSystems(PEMOS2010)


40

1. NASSUE:SecondInternationalWorkshoponNetworkAssuranceandSecurityServicesinUbiquitousEnvironments(NASSUE2010)

Thisworkshopisfocusedonnetworkassuranceandsecurity(NAS)measure,whichhasbecomeanimportantresearchissueinubiquitousenvironments(UE).TheobjectiveofthisworkshopistoprovideaneffectiveforumfororiginalscientificandengineeringadvancesinNASissuesinUE.ItwillhighlightthevariousaspectsofNAS‐especiallyonthecruciallinkagebetweenavailability,compliance,andsecurity.NASSUE2010aimstobringtogetherresearchers,practitioners,developers,andpolicymakerstoshareandexchangeideasandtolearnaboutlatestdevelopments,problemsandsolutionsrelatedtoNASissuesinUE.

WorkshopProgramChairs

• BinodVaidya,Univ.ofOttawa,Canada• Shiuh‐JengWang,CentralPoliceUniv.,Taiwan• JoelRodrigues,Inst.ofTelecommunications,UnivofBeiraInterior,Portugal

InternationalAdvisoryCommittee

• DimitrisMakrakis,UnivofOttawa,Ottawa,Canada• PascalLorenz,UnivofHauteAlsace,France

PublicityChair

• SuryaNepal,CSIROICTCentre,Australia

TechnicalProgramCommittee

• BinodVaidya,UnivofOttawa,Canada• Shiuh‐JengWang,CentralPoliceUniv,Taiwan• JoelRodrigues,Inst.ofTelecommunications,UnivofBeiraInterior,Portugal• ByungRaeCha,GIST,Korea• K.P.Chow,UnivofHongKong,HongKong• JiankunHu,RMIT,Australia• Min‐ShiangHwang,NationalChungHsingUniv,Taiwan• SeungjooKim,SungkyunkwanUniv,Korea• ChaeHoonLim,SejongUniv,Korea• SuryaNepal,CSIROICTCentre,Australia• AntonioNogueira,UnivofAveiro,Portugal• KhaledSalah,KingFahdUnivofPetroleum&Minerals,SaudiArabia• NingZhang,UnivofManchester,UK• YanpingYu,ZhejiangGongshangUniv,China• HuifangChen,ZhejiangUniv,China• SteveMarsh,CommunicationsResearchCentre,Canada• XinxinFan,UnivofWaterloo,Canada• AmrYoussef,ConcordiaUniv,Canada• BidiYing,UnivofOttawa,Canada


41

NASSUE 2010 Monday, October 11 5:20PM‐7:00PMRoom:StrategyRoom1Chair:BinodVaidya(UniversityofOttawa,Canada)

ImprovedTwo‐factorUserAuthenticationinWirelessSensorNetworksBinodVaidya(UniversityofOttawa,Canada);DimitriosMakrakis(UniversityofOttawa,Canada);HusseinMouftah(UniversityofOttawa,Canada)

Wirelesssensornetworks(WSNs)areconsideredduetotheubiquitousnature,easeofdeployment,andwiderangeofpossibleapplications.WSNscanbedeployedinunattendedenvironments,wherearegisteredusercanlogintothenetworkandaccessdatacollectedbythelinkedsensors.Authenticatingusersinresourceconstrainedenvironmentsisoneofthemajorsecurityconcerns.Sincesensornodeshavelimitedresourcesandcomputationpower,itisdesirablethattheauthenticationprotocolissimpleandefficient.In2009,M.L.Dasproposedatwo‐factorauthenticationforWSNs,whereauserhastoprovepossessionofboth,apasswordandasmartcard.Sincehisschemeutilizesonlycryptographicone‐wayhashfunctionandexclusive‐ORoperation,itiswell‐suitedforresourceconstrainedenvironments.However,KhanandAlgahathbarpointedoutthatDas'sschemehassomeflawsandisvulnerabletovariousattacksandproposedanalternativesolution.Inthispaper,weshowthatboth,Das'sandKhan‐Algahathbar'sschemeshaveflawsandremainvulnerabletovariousattacksincludingstolensmartcardattacks.Toovercomethesecurityweaknessesofbothschemes,weproposeanimprovedtwo‐factoruserauthenticationthatisresilienttostolensmartcardattacksaswellasothercommontypesofattacks.Weprovidesecurityevaluationoftheproposedprotocolsshowingitsrobustnesstovariousattacksandanalyzedthescheme'sperformancetodetermineitsefficiency.Comparedtothepreviousschemes,itisprovenmorerobustandprovidesbettersecurity.

Pre‐broadcastbasedTimeEfficientPrivacyProtocolforSecureVehicularCommunicationsBidiYing(UniversityofOttawa,Canada);DimitriosMakrakis(UniversityofOttawa,Canada)

Privacyandsecurityaretwoimportantissuesinvehicularnetworks.Userswishtomaintainlocationprivacyandanonymity,meaningtheidentity,location/directionofmoveoftheirvehiclesremainsunknowntoeverybodywithpossibleexceptionlawenforcementauthoritiesresponsiblebylawtoknowandmaintainsuchprivateinformation.Inthispaper,weproposeaPre‐broadcastbasedTimeEfficientPrivacy(PTEP)scheme,which,insteadofperforminganyasymmetricverification,usesMessageAuthenticationCode(MAC)functionalityandHASHoperationstoauthenticatemessages.Moreover,weusetwo‐levelkey(upper‐levelhashchainandlow‐levelhashchain)whichassistsavoidingmessagelosses.AnalysisshowsthattheproposedPTEPschemesuperiorperformanceintermsofpacketlossrateandpacketlatency.Inaddition,itcanbeusedtoserveemergencyandroutinemessagesaswell,whilemostofexistingsolutionscanonlyworkwithroutinemessages.

AFrameworkTowardaSelf‐OrganizingandSelf‐HealingCertificateAuthorityGroupinaContentAddressableNetworkAnuchartTassanaviboon(UniversityofWaterloo,Canada)

Public‐keyprovisioninanInternetscaleiscrucialforsecuringpeer‐to‐peer(P2P)applications.Thispaperproposesaframeworkforaself‐organizingandself‐healingcertificateauthority(CA)inaContentAddressable


42

Network(CAN)thatcanprovidecertificateswithoutacentralizedTrustedThirdParty(TTP).Inourframework,aCAgroupisinitializedbybootstrappingnodesandthengrowstoamaturestatebyitself.Basedonourgroupmanagementpolicies,themembershipintheCAgroupisdynamicandhasauniformdistributionovertheP2Pcommunity.Meanwhile,aByzantineagreementalgorithmisdeployedtomaintainthehonestmajorityoftheCAgroup;allsharesoftheCAgrouparerefreshedgraduallyandcontinuously.Asecurityanalysisshowsthattheframeworkenablekeyregistrationandcertificateissuewithresistancetoman‐in‐the‐middle(MITM),collusionandnodeimpersonationattacks.

FormingVirtualizedSecureFrameworkforLocationBasedServices(LBS)usingDirectAnonymousAttestation(DAA)protocolHanunahOthman(UniversityTeknologiMARA,Malaysia);HabibahHashim(UniversitiTeknologiMARA,Malaysia);Jamalul‐lailAbManan(MIMOSBerhad,Malaysia);MohdAmeerYuslanRazmi(UniversitiTeknologiMARA,Malaysia)

Thetremendousgrowthinmobileandwirelesscommunicationscomeswithmorepervasiveapplications.Currentmobiledeviceplatformdoesnotallowalocalorremoteusertoattestthetargetplatform.Thelimitationofusingexistingsoftware‐basedaloneprotectioncanbeeasilyaffectedbymaliciouscodesanditcannotassureitsownintegrity.Inthispaper,weexploreanewapproachofanonymityissuesinPrivacyEnhancingTechnologies(PETs)whichwillresultintheprivacyenhancementofuserpersonaldataandlocationinformationinmobilenetworkservices.Wecreatethefoundationforrunningtrustedapplications,networkandservicesontopofexistingMobileLocationProtocol(MLP).AlsoformingVirtualizedSecureFrameworkbetweenmobiledevices(clients)andLocationBasedServices(LBS)ServerinVirtualMachine(VM)environmentbasedonDirectAnonymousAttestationprotocol.TrustedPlatformModule(TPM)actsasabasisforsoftwaresecuritymechanismsandtopreserveprivacyofuser'sinformationstoredintrustedplatform.Virtualizationisneededtoimprovetheutilizationofexistingcomputingresourcesandtoreducehardware.EverysingledevicesfoundinaphysicalmachinewillbevirtuallycreatedbythesesoftwaretoactlikeaphysicaldevicesintheVMs.DAAprotocolisproposedtoanonymouslyverifytheauthorityofusersandpreservingprivacyofuser'sprivatelocationinformation.

ATrustEvaluationModelusingControlledMarkovProcessforMANETKevinOuyang(UniversityofOttawa,Canada);BinodVaidya(UniversityofOttawa,Canada);DimitriosMakrakis(UniversityofOttawa,Canada)

AdistributedtrustevaluationmodelispresentedforMANETsbywhichuncertaintiesoftrustaretransformedintoprobabilityvectorsgivingtheprobabilitydistributionoftrustlevels.Thesystemevolvesovertimeasafinite‐stateMarkovprocesswithvarianttransitionmatrixes.Weattempttopredictthetrustworthinessvaluesofentitiesthataredeterminedbytheirinherenterrorpatterns.TheMarkovprocessisassociatedtoaBonus‐MalusSystemandcontrolledbytheestimatederrorpatternsofindividualentitiesinvolved.Aswell,aniterationalgorithmisdesignedtopreventinaccuratepredictionsfortrustvaluesbecauseofthepropertiesofMarkovprocess.ThesimulationresultsdemonstratethatourmodelisabletopredictlocaltrustsuccessfullyforentitiesinMANETsbyestimatingtheiractualerrorpatternsaccurately.


43

2. CMPA:FirstWorkshoponCooperativeMobileProtocolsandApplications(CMPA2010)

Cooperativecommunicationhasemergedasapromisingtechniqueformodernwirelesscommunicationsystems.Certaincharacteristicsofmobileenvironmentscreateanaturalneedfornodestocooperateamongthemselvestoovercomecertainlimitations.Thesecharacteristicsinclude(1)adversechannelconditionsandlackofresources(intermsofbandwidth)whichnecessitatecooperationatthephysicallayer(2)lackofinfrastructurewhichcreatestheneedfornodestocooperateinad‐hocroutingprotocolsforexample.(3)limited‐resourcedeviceswhichmightcreateaneedtoapplicationstocooperateanddistributecomputingtasksandsharetheirexcessofprocessingpower.Theworkshopisseekingpapersonon‐goingresearchthatinvolvescooperationinmobileenvironmentsatanylayeroftheprotocolstack.

WorkshopChairs:

• AshrafMatrawy,CarletonUniversity• MohamedHossamAhmed,MemorialUniversityofNewfoundland• MuhammadJaseemuddin,RyersonUniversity


44

CMPA 2010 Tuesday, October 12 8:40AM‐10:00AM

Room:StrategyRoom2

Chair:MuhammadJaseemuddin(RyersonUniversity,Canada)

JointRoutingandRelaySelectioninDAFMulti‐HopCooperativeAdhocNetworks

SalahAbdulhadi(RyersonUniversity,Canada)

Cooperativediversitytechniqueshaverecentlyreceivedalotofattentionduetotheirabilitytoprovidespatialdiversityinfadingwirelessenvironment,thusincreaseslinkreliability,provideshighercapacityandreducestransmitpowerforthesamelevelofperformance.Inthispaperwestudyajointproblemofrelayselection,powerallocationandroutinginmultihopwirelessadhocnetworksbasedoncooperativetransmission.Inparticular,anoptimalroutingstrategyisproposedtominimizetheend‐to‐endtotaltransmissionpowersubjecttoend‐to‐endtargetrate.Anad‐hocroutingstrategyisproposedtofindanoptimalroute(intermsoftotaltransmitpowerminimizing)fordecode‐andforwardstrategybasedonthewellknownDijikstraalgorithmwhichcanbeeasilyimplementedindistributedway.Simulationresultsshowthattheproposedstrategyhasgreatimprovementintermsofpowersavingcomparedwithtraditionalnon‐cooperativeshortestpathalgorithms,bymorethan70%insomesimulationscenario.

Design,ImplementationandEvaluationofaStructuredP2PAlgorithmforVehicularCommunicationSystems

VivianPrinz(TechnischeUniversitätMünchen,Germany);RolandBader(BMWResearchandTechnologyGmbH,Germany);WolfgangWoerndl(TechnicalUniversityofMunich–DepartmentofInformatics,Germany)

Distributedinformationmanagementisparticularlypowerfulinvehicularnetworks.Forexample,itenablesvehicularcommunicationsystemstopersistentlyprovideup‐to‐the‐minuteinformationaboutaccessibleparkingspaces,existinghazardsortrafficdensitiesandtokeeptheseitemsuptodate.TheVehicularInformationSpaceframework(VIS)implementsdistributedinformationmanagement.VehiclesrunningtheVISformakindofdistributeddatabase.Theyareabletoprovideinformationitemsinalocation‐awareandfullydistributedmanner.Moreover,theycanretrieve,modifyanddeletetheseitems.Forthispurpose,theVISdividesthevehicularnetworkintoseparate,interactingsegmentseachrunningtheVISStructuredP2PAlgorithm(VSPA).ThisarticlefocusesontheVSPA'sdesign,implementationandevaluation.ThealgorithmisbasedonfeaturesderivedfromexistingstructuredP2Palgorithmsandextendedtosuitthespecificcharacteristicsofvehicularnetworks.SimulationstudiesshowthattheVSPAoverlaystatemaintainsconsistentgivenlong‐runsimulations.Oninconsistencies,theoverlaystabilizesrapidly.Thisisevaluatedusinganurbantrafficenvironmentimplyingfewmessagesfornetworkadjustments.Also,itisexaminedonamotorwaygivenhighvehiculardensityandhighdataloadtoinvestigatescalability.Finally,weshowthattheVSPAisabletorebuildanoverlayincaseofanetworkbreakdown.


45

AnEfficientRelayAssignmentSchemeforMultiuserCognitiveRadioNetworkswithDiscretePowerControl

UditPareek(SimonFraserUniversity,Canada);MuhammadNaeem(SimonFraserUniversity,Canada);DanielLee(SimonFraserUniversity,Canada)

Inthispaper,wepresentabinaryparticleswarmoptimization(BPSO)basedlow‐complexityinterferenceawarerelayassignmentschemeformultipleusercognitiveradionetworkswithdiscretepowercontrol.First,weformulatethejointrelayassignment,sourceandrelay'spowerallocationasamixedintegernonlinearprogrammingproblem.Thisisfurtherreducedintoanintegerprogrammingproblem.WeproposeaBPSObasedrelayassignmentschemewithdiscretepowercontrolatsourceandrelaysfortheintegerprogrammingproblem.Theproposedschemehaslowcomputationalcomplexityandsimulationresultsshowthatitsperformanceisclosetotheoptimalexhaustivesearchalgorithm.

RelaySelectionApproachesforWirelessCooperativeNetworks

TauseefJamal(UniversityLusofona,Portugal);PauloM.Mendes(UniversityLusofona,Portugal)

Wirelessnetworksarecharacterizedbyhavinglimitedresourcesaccessedbyalargenumberofmobilestationswithdistinctcapabilities.Insuchchallengedenvironmentthedynamiccontrolofresourcesisofmajorimportancetomitigatethelimitationsofwirelessnetworks,suchastheimpactoflowdataratestationsandwirelesschanneloscillations.Suchaugmentedusageofwirelessresourcescanbeimplementedbaseduponcooperativerelayingschemes,whichhavethepotentialtosupportthedesiredsystemperformanceandnetworklifetime.However,theintroductionofcooperativerelayraisesseveralproblemssuchastheissueforrelayselectionandresourceallocation.Duetothesignificantnumberofdifferentcooperativerelayingapproaches,thisarticleaimstoprovideasystematicanalysisandclassificationofmajorrelayselectionprocedures,andtoidentifyopenresearchdirectionsaswellasthemostsuitableevaluationmethodsforanefficientanalysisofdifferentapproaches.


46

3. STWMC:ThirdIEEEInternationalWorkshoponSelectedTopicsinMobileandWirelessComputing(STMWC'10)3.1. WirelessCommunications3.2. UbiquitousComputing,ServicesandApplications3.3. MobileNetworking,MobilityandNomadicity


47

STMWC2010 - 1 Tuesday, October 12 8:40AM‐10:00AM

Room:StrategyRoom1

Chair:PhamCongDuc(Univ.ofPau,France)

NetworkAssistedAuctioningforCognitiveRadios

JiaLong(CarletonUniversity,Canada);ChangchengHuang(CarletonUniversity,Canada);JamesYan(CarletonUniversity,Canada)

Inthispaper,theuseofacentralizedservertoassistcognitiveradiousersinaccessingbandsinlicensedspectrumsisproposed.Typicalcognitiveradiosareopportunisticusersofspectrumbands.Therefore,theymustscanthespectrumtodetectexistingusersinordertoavoidinterference.Theuseofacentralizedservercanremovetheneedforspectrumscanningifallusersinformtheserverabouttheirpresence.Theserverwillcoordinateanddistributechannelstocognitiveradiousersusingauctioningmechanisms.Ourapproachremovestheneedforcognitiveradiouserstospectrumscan.Scanningcanbecostlyintermsoftimeandpowerconsumption.Inaddition,collisionsbetweenusersduetohiddennodeproblemcanberemoved.Theuseofacentralizedserverallowsforhigherlayersolutionthatwouldallowusersofdifferentwirelesstechnologiestocommunicate.Duetoitsflexibilityofuseacrossdifferentwirelessnetworks,SIPisadoptedasthecommunicationprotocolbetweenthecentralserverandtheprimaryandsecondaryusersofthelicensedspectrum.UsingaSIPservertocoordinatechannelallocationthroughauctioningapproachcangeneraterevenuefortheincumbentnetwork.Resultsshowthatrevenuecanbegeneratedwhilestillmeetingthegoalofefficientspectrumutilization.

ServiceDiscoveryformobilemulti‐domainmulti‐languageenvironments

NorShahnizaKamalBashah(NorwegianUniversityofScienceandTechnology,Norway);AtifBhatti(NorwegianUniversityofScienceandTechnology,Norway);ImranAslamChoudhary(NorwegianUniversityofScienceandTechnology,Norway);IvarJørstad(UbisafeAS,Norway);VanThanhDo(Telenor/NorwegianUniversityofScienceandTechnology,Norway)

Inmobilemulti‐domainmulti‐languageenvironments,aservicecanbeanythingandintroducedbyanybody.Consequently,sameorequivalentservicesmayhavedifferentnamesandserviceswithsamenameortypemaybecompletelydifferent.Existingservicediscoverysystemsareincapableofhandlingthesesituations.Weproposeaservicediscovery,whichisabletodiscoverallthesenewservicetypes.Inaddition,itiscapabletofindservicesthatarenotexactmatchesoftherequestedones.MoresemanticsareintroducedthroughattributeslikeEquivalenceClass,ParentTypeandKeywords.

EfficientMobileObjectLocalizationUsingRFID

KirtiChawla(UniversityofVirginia,USA);GabrielRobins(UniversityofVirginia,USA);LiuyiZhang(UniversityofVirginia,USA)


48

Location‐awarenessofmobileobjectsisthekeytoseveralemergingubiquitouscomputingapplications.WeshowthatRFIDtechnologycanbeleveragedtoachievemobileobjectlocalizationinaninexpensive,powerefficient,scalable,widelyapplicable,flexible,anduser‐friendlymanner.WeoutlinethechallengesthatcanadverselyaffectRFID‐basedlocalizationtechniques,andproposesolutionstomitigatethem.Also,wepresentseveralalgorithmsforRFID‐basedmobileobjectlocalization,comparingfavorablywithpreviousmethodsintermsofaccuracy,speed,reliability,andscalability.

UsingWebTechnologiesinAssessmentofContext‐AwarePervasive/UbiquitousSystems:ATouristGuideService

WaldirRibeiroPiresJunior(FederalUniversityofMinasGerais,Brazil);AntonioA.F.Loureiro(FederalUniversityofMinasGerais,Brazil);RicardoAugustoRabelo(UFMG/DCC,Brazil)

Animportantaspectinthedesignofpervasive/ubiquitousapplicationsistoevaluatethembeforetheirdeploymentinrealscenarios.Apossiblestrategytoassessthemistoperformsimulationsthatprovideusefulinsightsandresultstotheapplicationdesigner.However,thesimulationofpervasive/ubiquitousapplicationsandenvironmentshasproventobeaconsiderablechallengeforseveralreasons.Forinstance,manyofthetechnologies(e.g.,hardwareandsoftware)requiredtoassessthemeitherdonotyetexistorarenotmomentarilyavailableoraccessibleintermsofcostandreadiness,nottomentionotherimportantrequirementssuchasmonitoring,communicationmanagementandprofile/contextstatetrackingofentitiesinthesystem.Inordertomakethisprocesssimplerandfeasible,wedefinedaWebassessmenttoolthatprovidesasimulationapproachforubiquitousenvironmentsbyusingWebtechnologiessuchasAsynchronousJavaScriptandXML,Webapplicationframeworksandamapping/locationWebservice.Usingthesetechnologies,weimplementedapervasiveservice:atouristguideservice.Withthistool,wewereabletoevaluatetheproposedservivequantitativelybystudyingtheinteractionsbetweentheusers/entitiesinvolved,monitortheirprofile/contextstates,andtracktheirmovementsacrossapredefinedmaparea.


49

STMWC2010 - 2 Tuesday, October 12 10:30AM‐11:50AM

Room:StrategyRoom1

Chair:BijanRaahemi(UniversityofOttawa,Canada)

SEAODV:ASecurityEnhancedAODVRoutingProtocolforWirelessMeshNetworks

CeliaLi(Student,Canada);ZhuangWang(Student,Canada);CungangYang(RyersonUniversity,Canada)

Inthispaper,weproposeaSecurityEnhancedAODVroutingprotocol(SEAODV)forwirelessmeshnetworks(WMN).SEAODVemploysBlom'skeypre‐distributionschemetocomputethepairwisetransientkey(PTK)throughthefloodingofenhancedHELLOmessageandsubsequentlyusestheestablishedPTKtodistributethegrouptransientkey(GTK).PTKandGTKauthenticateunicastandbroadcastroutingmessagesrespectively.InWMN,auniquePTKissharedbyeachpairofnodes,whileGTKissharedsecretlybetweenthenodeandallitsone‐hopneighbours.Amessageauthenticationcode(MAC)isattachedastheextensiontotheoriginalAODVroutingmessagetoguaranteethemessage'sauthenticityandintegrityinahop‐by‐hopfashion.SecurityanalysisandperformanceevaluationshowthatSEAODVismoreeffectiveinpreventingidentifiedroutingattacksandoutperformsARANandSAODVintermsofcomputationcostandrouteacquisitionlatency.

EffectsofMobilityonStabilityinVehicularAdHocNetworks

LirenZhang(UnitedArabEmiratesUniversity,UAE)

Thispaperfocusesonthecharacterizationofvehiclemobilityinvehicularadhocnetworks(VANETs).Theperformanceofvehiclemobilityintermsoflinkavailabletimeandthenumberofinter‐vehiclelinkchangesformaintainingactivelinksinVANETisanalyzedusingboththehandoverandrandommovingmodels.Thetheoreticalanalysisisverifiedbysimulationexperiments.Thenumericalresultsindicatethatthevehiclerandommovinganalyticalmodelisabletoprovideamoreaccuratedescriptionofthecomplicatedvehiclemovingbehaviorthantheconventionalrandomwaypointmobilitymodel,especiallywhenvehiclesaremovingrelativelyfast.

SmoothingofVideoTransmissionRatesforanLTENetwork

KhaledShuaib(UnitedArabEmiratesUniversity,UAE);FaragSallabi(UAEUniversity,UAE)

Videosmoothingtechniquescanbeusedtofacilitatemoreeffectivetransmissionandtopreservebettervideoquality.Inthispaperwedevelopasemi‐optimalvideosmoothingapproachtomanagethetransmissionratesofMPEG‐4andH.264videooveraQoS‐basedwirelessLTEnetwork.Theproposedtechniqueutilizesasmoothingbufferwithpre‐definedthresholdstosmooththetransmissionrateswhileassumingminimalinformationaboutthevideotobetransmitted.Theresultsobtainedshowedasignificantimprovementsinsmoothingtransmissionratevariability.Inaddition,weshowamodelforthewirelessLTEchannelanduseitasafeedbacktomanagesmoothingandregulateandmapthetransmissionratesbasedontheavailabilityofnetworkresources.


50

PowerAllocationForNon‐RegenerativerelayinginCognitiveRadioSystems

MuhammadNaeem(SimonFraserUniversity,Canada);UditPareek(SimonFraserUniversity,Canada);DanielLee(SimonFraserUniversity,Canada)

Inthispaper,wepresentalow‐complexitypowerallocationschemefornon‐regenerative(amplifyandforward)relayingforcognitiveradiosystems.Themainobjectiveofpowerallocationistomaximizethesignaltonoiseratio(SNR)atthedestinationundertheconstraintofacceptableinterferencetotheprimaryusers(PU).Inthispaper,weproposeaniterativepowerallocationusingSNRupperBound(IPAUB)fornon‐regenerativerelaying.Theproposedalgorithmhaslowcomputationalcomplexity,anditseffectivenessisverifiedthroughsimulationresults.


51

STMWC2010 – 3 Tuesday, October 12 3:30PM‐5:30PMRoom:StrategyRoom1

Chair:MatthieuRoy(LAAS‐CNRS,UniversityofToulouse,France)

Sensors‐ActuatorsCooperationinWSANsforFire‐FightingApplications

PawelKulakowski(AGHUniversityofScienceandTechnology,Poland);EusebiCalle(UniversityofGirona,Spain);JoseLuisMarzo(UniversitatdeGirona,Spain)

Wirelesssensorandactuatornetworksforenvironmentaloperationsarediscussedinthispaper.Ascenarioofaforestbeingunderfireisanalyzed.Whiletheforestfiredetectionisaclassicalapplicationforsensor

networks,herethisresearchareaisextended,takingintoaccountactuatorsandfocusingonsensors‐actuatorscooperation.First,thespreadingofthefireisillustrated,adaptingawell‐knownmodelbasedonpercolationtheoryandexplainingitsrelationswithepidemicspropagationmodels.Then,itisshownhowthetemperature

datagatheredbysensorscanbeusedbyactuatorstoautomaticallyperformactionstobattlewithblaze.Finally,thesimulationresultsarepresented,documentingthecorrectnessofthedecisionstakenbythesystemandtheefficiencyoffire‐fightingactionsrelatedtothesensorsdensity.

ANeighbor‐basedHoldoffReductionSchemeforDistributedSchedulinginWirelessMeshNetworks

SaraLakani(AzadUniversityofScienceAndResearch,Iran);HosseinGhaffarian(IranUniversityofScienceandTechnology(IUST),Iran);MahmoodFathy(bournemouthuniversity,UnitedKingdom);BijanRaahemi(UniversityofOttawa,Canada)

TheIEEE802.16standardofwirelessmeshnetworksincludesvariousschedulingalgorithms,bothcentralized

anddistributed,todeterminethepropertimeslotthateachwirelessnodecantransmititsdata.Inthispaper,weintroduceanewschedulingschemetoimprovescalabilityandresourceutilizationinwirelessmeshnetworkswhereallnodescompetetogainaccesstothetransmissiontimeslot.Inourproposedmethod,the

transmissiontimeofanodeismodifiedaccordingtothetransmissionstatusofitsneighbors,resultinginashorterholdofftime,andconsequently,reducingthetransmissiondelayandthroughput.ThesimulationresultsconfirmtheefficiencyandperformanceoftheproposedalgorithmovertheIEEE802.16‐meshstandard

intermsofthroughputanddelay.

CompromiseinDecodingforaConcatenatedTurboandSpace‐timeBlockCodedSystem

XuanxuanLv(ZheJiangUniversity,P.R.China);MinjianZhao(ZhejiangUniversity,P.R.China);JieZhong(ZhejiangUniversity,P.R.China);CenPeng(ZhejiangUniversity,P.R.China);JunZheng(ZhejiangUniversity,P.R.China);LipingYang(ZhejiangUniversity,P.R.China)

Inthispaper,weinvestigatetheperformanceofiterativedecodingforconcatenatedTurbocodedandSpace‐

timeblockcoded(STBC)system.Inourproposedsystemthesoftparitybitneedstobeestimated,whichdiffers


52

fromtraditionalTurbodecoding,asthereceiveradoptsiterativedecodingnotonlytoTurbocodesbutthe

entiresystem.Inthiscaseasimplifiedandeffectivemethodofobtainingthesoftinformationofparitybitispresented,resultinginamoderateincreaseofcomplexity.Simulationresultsdemonstratethatperformanceimprovementcanbeobtainedusingtheiterativeschemecomparedwithnon‐iterativedecodingsystem.

Meanwhiletheincreaseofcomplexityinexchangeforperformanceimprovementisconsidered.Ourproposedschememakesanoptimaltrade‐offbetweencomplexityandperformancefortransmittinginRayleighfadingchannel.

EvaluationofsoftdetectionofSTBCschemesforturbocodes

YoungminKim(ChonbuknationalUniversity,Korea);SooyoungKim(ChonbukNationalUniversity,Korea)

Inthispaper,wepresentanefficientturbo‐codedspacetimeblockcoding(STBC)schemesinblockfading

channels.Ithasbeenreportedthatproperutilizationofsoftdecisioninformationisoneoftheimportantfactorsaffectingtheperformanceofturbocodes.IfaSTBCschemeisusedwithturbocodes,theoutputoftheSTBCdecodermustbefedintoaturbocodedecoderintheformofsoftdecisioninformation.Inaddition,the

performanceofaturbocodeissubjecttohowmuchdiversechannelinformationadecodercanutilizeinacodeword.InthispaperweevaluatetheperformanceofturbocodedSTBCschemesoverblockfadingchannels,andpresentanefficientSTBCschemewithverysimplemaximumlikelihooddetectioncapability.

BasebandMIMOreceiverarchitectureforMC‐CDMAanditsFPGAimplementation

IsabelleLaRoche(UniversitéLaval,Canada);SebastienRoy(LavalUniversity,Canada);PaulFortier(LavalUniversity,Canada);Jean‐FrancoisBeaumont(DefenceResearchandDevelopmentCanada‐Ottawa,Canada)

Abasebandmulti‐input,multi‐output(MIMO)multi‐carriercodedivisionmultipleaccess(MC‐CDMA)downlink

systemmeetingwidebandCDMA(WCDMA)bandwidthrequirementsissimulatedanditsreceiverpartisimplementedintoafieldprogrammablegatearray(FPGA).Thereceiverwasdesignedbyintegratinganexistingsingle‐input,single‐output(SISO)fixed‐pointMC‐CDMAreceiverwithanexistingfloating‐pointMIMOreceiver.

ThereceiveremploystemporalmultiplexinginordertouseasingleVerticalBellLaboratoriesLAyeredSpace‐Time(V‐BLAST)detector.SimulationresultsofacompleteMIMOMC‐CDMAsystemshowimprovementsovertheSISOcase.Implementationresultsshowthatitispossibletoimplementthisreceiverdesignintoasingle

FPGAdevice.


53

4. VECON:FirstInternationalWorkshoponVEhicularCOmmunicationsandNetworking(VECON2010)4.1. VECON14.2. VECON2

Thegoalofthisworkshopistopresentanddiscussrecentadvancesintheareaofvehicularwirelesscommunicationsandnetworking.Significanteffortsarebeingcarriedoutbyindustry,academiaandgovernmentagenciestoimprovesafety,decreasefuelconsumption,andincreasethecapacityofexistingroadwaysbyexploitingvehicularcommunicationsandnetworkingtechnologies.Thesetechnologies,whicharegenerallyreferredtoasVANET(VehicularAd‐hocNetworks)orbythemoregeneraltermVCS(VehicularCommunicationSystems),includevehicle‐to‐infrastructure,vehicle‐to‐vehiclecommunicationsandcanbebasedonshort‐andmedium‐rangecommunicationaswellasoncellularsystems.ThedevelopmentanddeploymentofVCSarealsoconsideredoneofthemostcriticalissuesfortheIntelligentTransportationSystem(ITS)industry.

WorkshopCo‐chairs

• JuanJoseAlcaraz,PolytechnicUniversityofCartagena(UPCT),Spain• EstebanEgea‐Lopez,PolytechnicUniversityofCartagena(UPCT),Spain

TechnicalProgramCommitte

• JoseMariaBarcelo,UPC,Spain• PaoloBellavista,UniversitadiBologna,Italy• CarlosJesusBernardos,UC3M,Spain• VicenteCasares‐Giner,UPV,Spain• NirbhayChaubey,ISTAR,India• JacekDanda,AGHUniversity,Poland• FelipeGarcia‐Sanchez,UPCT,Spain• PawelKulakowski,AGHUniversity,Poland• ChristophMecklenbrauker,TUWien,Austria• XavierPerez‐Costa,NECLaboratoriesEurope,Germany• VicentPla,UPV,Spain• JavierVales‐Alonso,UPCT,Spain• OliverYang,UniversityofOttawa,Canada


54

VECON 2010 -1 Tuesday, October 12 10:30AM‐11:50AM

Room:StrategyRoom2

Chair:JuanJoseAlcarazEspin(TechnicalUniversityofCartagena,Spain)

TestingviabilityofrelaypoliciesforreactiveCCAapplicationsinVANETs

Juan‐BautistaTomas‐Gabarron(PolytechnicUniversityofCartagena,Spain);EstebanEgea‐Lopez(PolytechnicUniversityofCartagena(UPCT),Spain);JoanGarcia‐Haro(PolytechnicUniversityofCartagena,Spain);RocíoMurciaHernández(PolytechnicUniversityofCartagena,Spain)

RelayingmechanismsforChainCollisionAvoidance(CCA)applicationsinVehicularAd‐hocNetworks(VANETs)arecrucialwhenonehoptransmissionsarenotenoughtoreachallofthevehiclesinaplatoonatriskofaccident.TakingintoaccountthatCCA‐relatedinformationmustbedistributedtoasmanyvehiclesaspossibleintheshortestaffordabletime,areasonablewaytodeterminetheviabilityofusingsuchrelaypoliciesisbyevaluatingthedelaytospreadinformationtoallrecipientsandtheassociatedoccupationofthecommunicationschannel.Furthermore,theinherenttransitiontoreachfulltechnologypenetrationinthemarketrequirestostudyhowthesystemofvehicleswillbehaveatdifferentstagesofdeploymentandhowdifferentrelayingmechanismsmayaffectthegeneralfunctionalityofthesystemandwhatistheinfluenceofbackgrounddatatrafficwhichcanobviouslyworsenthesuccessfuldeliveryrate(SDR)ofwarningnotificationmessages.

DYMES:aDynamicMessagingServiceforVANETs

AdrianHolzer(EcolePolytechniquedeMontréal,Canada);SaidaMaaroufi(EcolePolytechniquedeMontréal,Canada);SamuelPierre(EcolePolytechniquedeMontreal,Canada)

Applicationsaimedatenhancingtheexperienceofvehiculartransportationhavebeenincreasinginrecentyearswiththewidespreaddiffusionofsmartmobiledeviceswithnetworkcapabilitiesandaccesstouserlocation.Suchapplicationsincludenavigationsystemsandlocation‐basedtimetables.However,mostoftheseapplicationsonlyuseindividualcontextualinformationinordertoprovideusefulservicestotheenduser.Sharingcontextualinformationwithotheruserscanopenahostofnewpossibilities,suchasprovidinglivetrafficmonitoring,wherethelocationandspeedofindividualcarsissharedandindicatestheflowoftraffic;orfriendlocating,wherethelocationoffriendscanbedisplayedonamap.Inthispaper,wearguethatthereisalackofspecializedprogrammingsupportforsuchapplicationsandwepresentDYMES,adynamicmessagingservicedevisedtohelpfillthisgap.CentraltoDYMESisadynamicpublish/subscribesystem,whichthepublicationofdynamiccontextualinformationandthecreationofdynamiccontext‐basedmessagefilters.WepresentthecoreAPIsprovidedbyDYMESandillustratetheirusageviatwotypicalVANETapplications.Furthermore,weidentifyanddiscussimplementationissueswhichguidethearchitecturalchoicesinourongoingwork.

TrafRoute:ADifferentApproachtoRoutinginVehicularNetworks


55

RaphaelFrank(UniversityofLuxembourg,Luxemburg);EugenioGiordano(UniversityofCaliforniaatLosAngeles,USA);PasqualeCataldi(EURECOM,France);MarioGerla(UniversityofCaliforniaatLosAngeles,USA)

Inthenearfuturevehicularnetworksbasedonwirelesstechnologywillbepartofourlives.Efficientandrobustroutingalgorithmswillplayakeyroleinthesuccessofsuchtechnology.InthispaperwepresentTrafRoute,anefficientandrobustroutingschemeforvehicularnetworks,suitableforbothVehicle‐to‐VehicleandVehicle‐to‐Infrastructurecommunications.TrafRouteintroducesanovelapproachtoroutingthatinvolveslandmark‐basedroutesandforwarderself‐election,exploitingtheknowledgeoftheunderlyingroadnetwork.WedemonstrateTrafRoute'sefficiencyandrobustnessthroughsimulationstudiesperformedwithaccuratemobilityandpropagationmodels.

UnifiedPseudonymDistributioninVANETs

JosephBenin(GeorgiaInstituteofTechnology,USA);MichaelNowatkowski(UnitedStatesMilitaryAcademyatWestPoint,USA);HenryOwen(GeorgiaInstituteofTechnology,USA)

VANETscontinuetomatureandtheirinstallationisbecomingareality.Manyideashavebeenexchangedonhowbesttobalanceprivacyandsecurity.Theuseofpseudonymshasbeenalmostuniversallyacceptedasacriticalpartofthisequation.Simulatedresults,usingns‐3,demonstratetheneedformorethanasingleRSUcontactforpseudonymrefillduetothelimitednumberofcertificatesthatcanbeissuedinthattransit.ThispaperprovidesauniversalprotocolusingmultipleRSUsandmultipleservicechannelsforthedistributionofpseudonymsforrefill,intra‐regional,andinter‐regionalpurposes.


56

VECON 2010 - 2 Tuesday, October 12 1:20PM‐3:00PMRoom:StrategyRoom2Chair:EstebanEgea‐Lopez(PolytechnicUniversityofCartagena(UPCT),Spain)

ReactiveServiceLocationinIEEEWAVE

AndryCruzDiaz(GlasgowCaledonianUniversity,UnitedKingdom);TuleenBoutaleb(GlasgowCaledonianUniversity,UnitedKingdom);HuanXNguyen(GlasgowCaledonianUniversity,UnitedKingdom);HuagloryTianfield(GlasgowCaledonianUniversity,UnitedKingdom)

TheIEEEWirelessAccessinVehicularEnvironments(WAVE)familyofstandardsistheleadingworldwidestandardisationeffortintermsofDedicatedShortRangeCommunications(DSRC),anditaimsatdefiningacommonsetofrequirementsandfunctionalitiesthatarenecessaryinordertoenableintercommunicationandinteroperabilitybetweenthenodesinaVehicularAdhocNetwork(VANET).Nonetheless,WAVEdoesnotaimatdefiningafullsoftwarearchitectureforVANETdespiteitsconstitutingstandardsoutlineagivenstructurethatspansthecompleteprotocolstack,therefore,merecompliancetoitsguidelinesdoesnotimplythatthelevelsofcooperativenessrequiredbyadistributed,heterogeneousanddynamicsystemlikethosesupportedbyVANET,areachieved.WAVEprovides,however,thenecessaryprimitivesthatallowfortheadoptionofaService‐OrientedArchitecture(SOA)forVANETthatguaranteesmeetingthegoalsofthosenetworksandthesystemsthatdependonthem.Thispaperdescribeshowtoaccomplishreactiveservicelocation,adesiredfunctionalityinthecontextofanSOAforVANET;basedonthecombinationandfurtherenhancementoftheelementsalreadyspecifiedbyWAVE,exemplifyinghowcomplexobjectivescanbeattainedfromthebasicsetoffunctionalitiesinaWAVE‐compliantnode.

SecureCompressionofPrivacy‐preservingWitnessesinVehicularAdHocNetworks

BoQin(UniversitatRoviraiVirgili,Spain);QianhongWu(UniversitatRoviraiVirgili,Spain);LeiZhang(UniversitatRoviraiVirgili,Spain);JosepDomingo‐Ferrer(UniversitatRoviraiVirgili,Spain)

Vehicularadhocnetworks(VANETs)aredesignedtoimprovetrafficsafetyandefficiency.Tothisend,thetrafficcommunicationmustbeauthenticatedtoguaranteetrustworthinessforguidingdriversandestablishingliabilityincaseoftrafficaccidentinvestigation.CryptographicauthenticationtechniqueshavebeenextensivelyexploitedtosecureVANETs.Applyingcryptographicauthenticationtechniquessuchasdigitalsignaturesraiseschallengestoefficientlystoresignaturesonmessagesgrowingwithtime.Toalleviatefromtheconflictbetweentrafficliabilityinvestigationandlimitedstoragecapacityinvehicles,thispaperproposestoaggregatesignaturesinVANETs.Ourproposalcanpreserveprivacyforhonestvehiclesandtracemisbehavingones,andprovidesapracticalbalancebetweensecurityandprivacyinVANETs.Withourproposal,cryptographicwitnessesofsafety‐relatedtrafficmessagescanbesignificantlycompressedsothattheycanbestoredforalongperiodforliabilityinvestigation.Ourproposalallowsalargenumberoftrafficmessagestobeverifiedasiftheywereasingleone,whichspeedsuptheresponseofvehiclestotrafficreports.

ArchitectureofaSimulationPlatformfortheSmartNavigationServiceInvestigation


57

AndreaToppan(IEIITCNRsez.Bologna,Italy);AlessandroBazzi(WiLab,IEIIT‐BO/CNR,UniversityofBologna,Italy);BarbaraMMasini(UniversityofBologna,Italy);PaoloToppan(WiLab,IEIIT‐BO/CNR,Italy);OresteAndrisano(UniversityofBologna,Italy)

Efficientmobilitymanagementisanissueofvasteconomicimportanceforitsconsequencesonurbanandsuburbanmobility.Inthiscontext,telecommunicationsaregainingakeyrole,allowingtoincreasepeoplesafety,trafficefficiency,andtravelcomfort.Toinvestigatethetelecommunicationsystemsbehaviorinnewinfomobilityscenarios,advancedsimulationstoolsareneededjointlytakingintoaccountrealisticroadtrafficmobilityandtelecommunicationnetworksprotocolsinalltheiraspects.InthispaperwediscussthearchitectureofacomplexandcompletesimulationplatformwearedevelopingonthebehalfoftheItalianprojectPEGASUS:thechoiceoftrafficsimulators,thenetworksimulationandtheirinterfacewillbepresentedanddescribed.

OPAL‐VCN:Open‐Air‐LabforVehicularCommunicationNetworks

AlexanderGladisch(UniversityofRostock,Germany);RobilW.Daher(UniversityofRostock,Germany);MartinKrohn(UniversityofRostock,Germany);DjamshidTavangarian(UniversityofRostock,Germany)

VehicularCommunicationNetworks(VCNs)provideapromisingcommunicationplatformforIntelligentTransportationSystem(ITS)servicesaswellasforvalueaddedservicesindifferentroadsystems.DespitethehighdemandontestfieldsforVCNrelatedtechnicalsolutionsandservices,therearecurrentlyveryfewtestfieldsfortheimmenserequirementontestandR&Dactivities.Moreover,theknownVCN‐relatedtestfieldssuchassim‐TDandVII‐CaliforniamainlyfocusonV2Xcommunication,whilethereislessconsiderationoftherequirementsofrelatedroadsidebackbonenetworks.ThispaperpresentstheOpen‐Air‐LabforVCNs(OPAL‐VCN),concentratingonroadsidebackbonenetworksspecifiedforVCNrequirements.TheOPAL‐VCNdealswiththedesign,developmentandinstallationofareal‐worldtestfieldforVCNs,andcomprisesatestfieldofatotallengthofatleast30kmontheGermanhighwayA19/A20nearRostock(inMecklenburg‐WesternPomerania).Moreover,theOPAL‐VCNtestfieldisbasedonawirelessmulti‐layerroadsidebackbonenetworkthatemploysmodularandscalablesystemarchitecture.Consequently,OPAL‐VCNprovidesaneffectiveplatformforR&DactivitiesaswellasforeducationandindustryandcanbeusedasbasisforinvestigatinganddevelopingVCNrelatedtechnologiesandservices.

TheCaseforaNetworkAdaptationFrameworkinVANETs

CarlosCaloca(Ensenada´sCenterforScientificResearchandAdvancedEducation,Mexico);J.AntonioGarcía(Ensenada´sCenterforScientificResearchandAdvancedEducation,Mexico);ThierryDelot(UniversityLilleNorthofFrance,France)

ThediversecommunicationrequirementsofdifferentvehicularapplicationsandtheinnatedynamicityofVANETnetworkscomplicatethedesignofanetworklayerproposalthatisadequateforallapplicationsandnetworkconditions.ThispaperhighlightsthenecessityforadaptationofnetworkprotocolsinVANETs,anddescribesourongoingworkonaplatform(adaptationframework)thatwillprovideVANETdevelopersanenvironmentwheretheycanbuildthenetworkprotocolsthatadaptbasedoncontextdecisions.Thedesignofouradaptationframeworkreliesheavilyontheseparationofconcernsprinciplebyseparatingtheadaptiveprotocolinsubcomponents,andwemodeltheadaptationasacombinationofthesesubcomponents;fortheprotocolsubcomponentwedefinespecificpointswheretheadaptationcantakeplace.Thesesubcomponentswillbedevelopedandcompiledindependentlyofadaptationframeworkcode,andlinktotheframeworkatruntime,thisthankstotheuseofaplug‐inplatformandcomponent‐orientedprogramming.Wedescribetheframeworkarchitectureandhowtheframeworkinteractswiththeusers,applicationsandthenetwork


58

protocols.Lastlywebrieflytalkabouttheframework'sinitialimplementationandacasestudythatwearedevelopingtotesttheadaptationframework.


59

5. AWSAN:FirstInternationalWorkshoponAdvancesinWirelessSensorandActuatorNetworks(AWSAN2010)

Wirelesssensorandactuatornetworks(WSANs),asaresearchtopic,arecurrentlythesubjectofintensiveworld‐wideresearchactivities.Thesensortechnologypromisesmultipleapplications:frommonitoringanenvironmentindangerousregionsorenemyforcesinabattlefieldtocontrollingtrafficinstreets,inventoryinstorehousesandtrackingpatientsinhospitals.Ontheonehand,smallandcheapsensingdevicescreatepossibilitiesforgatheringhugeamountsofdatainanon‐intrusiveway.Ontheotherhand,actuatorsaddanewnetworkdimensionandcapabilities:thewholesystemcanalsoreacttotheforthcomingevents.ThegoaloftheFirstInternationalWorkshoponAdvancesinWSANsistogatherpeoplefromacademiaandindustryanddiscussthemostemergingissuesandfuturechallengesinthisarea.

WorkshopChair:

• PawelKulakowski,AGHUniversityofScienceandTechnology,Poland

TechnicalProgramCommittee:

• ChiaraBuratti,UniversityofBologna,Italy• SudhakarGanti,UniversityofVictoria,Canada• Antonio‐JavierGarcia‐Sanchez,TechnicalUniversityofCartagena,Spain• FelipeGarcia‐Sanchez,TechnicalUniversityofCartagena,Spain• PawelKulakowski,AGHUniversityofScienceandTechnology,Poland• MiguelLopez‐Guerrero,UniversidadAutonomaMetropolitana,Mexico• FernandoLosilla,TechnicalUniversityofCartagena,Spain• WieslawLudwin,AGHUniversityofScienceandTechnology,Poland• AntonioG.Ruzzelli,UniversityCollegeDublin,Ireland• CedomirStefanovic,UniversityofNoviSad,Serbia• DejanVukobratovic,UniversityofStrathclyde,UK


60

AWSAN 2010 Tuesday, October 12 1:20PM‐3:00PMRoom:StrategyRoom1Chair:PawelKulakowski(AGHUniversityofScienceandTechnology,Poland)

Range‐FreeLocalizationforAir‐DroppedWSNsbyFilteringNodeEstimationImprovements

EvaGarcia(UniversityofCastilla‐LaMancha,Spain);AurelioBermudez(UniversityofCastilla‐LaMancha,Spain);RafaelCasado(UniversityofCastilla‐LaMancha,Spain)

Somesensornetworkapplicationsinvolveanaerialdeploymentofmanysensornodesoveraparticularareaofinterest.Inthiscontext,currentrange‐freelocalizationproposals,basedonaniterativerefinementandexchangeofnodeestimations,arenotdirectlyapplicable,becausetheyintroduceahightrafficoverhead.Inthispaper,weproposetocontrolthisoverheadbymeansofavoidingthetransmissionofcertainlocalizationpackets.Thecriterionappliedbythisnewlocalizationtechniquetofilterpacketsisbasedontheamountofimprovementshownafterupdatinganestimationandthetimefromthelasttransmission.Wealsotunethisfilterinordertofindanoptimaltrade‐offbetweenthebenefitintrafficandthepenaltyintime.

ReliabilityModelforExtendingClusterLifetimeusingBackupClusterHeadsinCluster‐BasedWirelessSensorNetworks

ShafiqUllahHashmi(UniversityofOttawa,Canada);Sk.Md.MizanurRahman(UniversityofOttawa,Canada);HusseinMouftah(UniversityofOttawa,Canada);NicolasD.Georganas(UniversityofOttawa,Canada)

Incluster‐basedtwo‐tierWirelessSensorNetworks(WSNs),thecluster‐headnodes(CHs)gatherdatafromsensorsandthentransmittothebasestation.Whentheseclusterheadnodesstarttodie,thecoverageoftherespectiveclustersislostanditleavestheregionunmonitored.EveniftheCHsarerotatedandreassignedaftersometime,untilthenextrotationthatclusterinquestionwillbeoutofclusterhead,causingalossofinformationandlossofcoverage.ToselectaBackupClusterHead(BCH)issuggestedforthoseCHswhichareclosetodepletetheirenergy[1].WhentheCHdies,BCHtakesovertheresponsibilityandcontinuestoworkasanewclusterhead.Inthispaperwepresentananalyticalmodelofclusterreliabilityincluster‐basedWSNusingBCH,basedonMarkovchainmodel.Weusenon‐homogeneousMarkovprocess,alongwithForwardChapman‐Kolmogorovequationstoillustratetheclustermonitoringperiodinafinitethreestatespacemodel.WetesttheaccuracyofthemodelbyapplyingtheprobabilitiesoffailureofCHandBCHnodes,forafixednumberofsensornodesinacluster.Theresultsshowthatthepresentedmodelisabletomatchthebehaviouroftheclusterstatetransitionaccuratelyandvalidatesthesimulationresultsandanalysispublishedin[1].

AnIEEE802.15.4/ZigBeeBasedWirelessSensorNetworkforEnergyEfficientBuildings

CengizGezer(UniversityofBologna,Italy);MicheleNiccolini(UniversityofBologna,Italy);ChiaraBuratti(UniversityofBologna,Italy)

Realizingenergyefficientcontrolstrategiesinthebuildingsisoneoftheinnovativeandchallengingfieldofapplicationforwirelesssensornetworks.Toachievethegoalofreducedenergyconsumptionandoptimized


61

useofenergyinthebuildings,thedeploymentofsensorsandactuatorsiscrucial.Simpleaffordablesensorscanbeusedtomonitorthepowerconsumedbyeachapplianceinthebuildinginordertoturnthemon/offwhenitisefficientintheuseofenergy.TheARTEMISJointUndertakingprojecteDIANA(EmbeddedSystemsforEnergyEfficientBuildings)fundedbytheEuropeanCommissionaimstoimproveenergyefficiencyinbuildingsbyusingembeddedtechnologies.IntheeDIANAplatformtheenergyconsumedbyhouseholdorofficeappliancesismonitoredbyusingIEEE802.15.4/Zigbee‐compliantdevices.TheaimofthestudyistoshowthefeasibilityoftheIEEE802.15.4/ZigbeetechnologytotheeDIANAapplicationscenarioandtoprovideguidelinesforthenetworkdesign.Forthispurposetwostudieshavebeencarriedout:(i)asimulationanalysisofalargeapartmentwheremanynodesaredeployed;(ii)arealtestbedcomposedofIEEE802.15.4/ZigBee‐compliantdevices.Inthefirstcaseperformance,intermsofpacketerrorrate,averagedelayandenergyconsumption,isevaluatedbyvaryingthenumberofnodesindifferenttrafficconditions.Inthesecondcase,instead,thestatisticsofthedelayisprovided.Thestudyshowsthatsimulationresultsareinlinewiththeresultsachievedthroughthemeasurements.MoreoverresultsfulfiltheeDIANArequirements.

Energy‐awareRoutingProtocolforMobileSensorNetworksUsingLearningAutomataAlgorithms

MaryamKalantary(AzaduniversityinQazvin,Iran);MohammadRezaMeybodi(AmirkabirUniversityofTechnology,Iran)

Thispaperproposesanenergy‐awarelocation‐basedroutingprotocolformobilesensornetworksthatconsistoffrequentlymovingsensors.Ourproposedprotocoluseslearningautomatatoselectbestroutesthatmaximizedeliveryratioandnetworklifetime.Theprotocolusesthelocationandremainingenergyinformationofsensorstoassignacostfunctiontoeachsensornode.Eachnodeinnetworkisequippedwithalearningautomatonwhichselectsleast‐costpathsforeachpacket.Simulationresultsshowthattheproposedmethodachieveshigherdeliveryratio,lowerroutingoverheadandlowerenergyconsumption.

Configuration&DeploymentofSensorNetworkApplicationsusingFilesystemAbstractions

BhanuPisupati(IndianaUniversity,USA);GeoffreyBrown(IndianaUniversity,USA)

Largescalesensornetworksarenontrivialtodeployduetotheirheterogeneous,distributednature.Thispaperpresentsatechniquetoconfigureanddeploysensorapplicationsonheterogeneousnetworksthatisbasedontheuseofvirtualfilesystemabstractions.Theapproachcanaugmentexistingsensorsoftwarebuildprocedureswiththeabilitytoconfigureanddeploysoftware,allusingthefilesystemframework.Thepaperpresentsanarchitecturetoimplementtheideaandillustratesitsusebymeansofaprototype.Automationoftheconfigurationanddeploymentprocessesbyuseofscriptingbasedtechniquesimplementedusingthefilesystemabstractionsisdescribed.


62

6. PEMOS:FirstInternationalWorkshoponthePerformanceEnhancementsinMIMO‐OFDMSystems(PEMOS2010)

Orthogonalfrequencydivisionmultiplexing(OFDM)isapromisingmodulationtechniqueforhighdataratewirelesstransmission.OFDMcombinedwithmultipleantennasatthetransmitterandreceiver(i.e.,MIMO)toincreasethediversitygainand/ortoenhancethesystem’sperformanceontime‐variantandfrequency‐selectivefadingchannels,resultinginaMIMO‐OFDMconfiguration.Combiningbothtechniquesenablestoenhancetheoverallperformance.Thisworkshopbringstogetheracademicsandactiveresearchanddevelopmentprofessionalsworkinginthefieldofwirelesscommunication’soptimizationtopromoteexchangeofresearchideasandpossiblecollaboration.AudiencewillbeexposedtomanyperformanceoptimizationsinMIMO‐OFDMsystemsandwillbeabletorecognizetheimpactofsuchenhancementonthereliabilityandtheefficiencyofthestandardMIMO‐OFDMcommunicationsystem.PEMOS2010willintroducetheresearchcommunity(industry,academia,andGovernment)totheup‐to‐dateresearchintheareaofMIMO‐OFDMwirelesscommunicationsystemsandpromoteteamcollaborationamongorganizationshavingrelevantexpertisetoexecuteanadvancedresearchinthisarea.

WorkshopChair

• ShihabJimaa,KhalifaUniversity,UAE

TechnicalChair

• IbrahimAbualhaol,KhalifaUniversity,UAE

PublicationCo‐Chairs

• ReyadEl‐Khazali,KhalifaUniversity,UAE• AliDawood,KhalifaUniversity,UAE

PublicityCo‐Chairs

• LuisWeruaga,KhalifaUniversity,UAE• YoussefIraqi,KhalifaUniversity,UAE

WebDesignChair

• TarekEl‐Far,KhalifaUniversity,UAE

TechnicalProgramCommittee

• TetsuyaShimamura,SaitamaUniversity,JAPAN• RezaMalekian,AzadUniversity,IRAN• AlaeddinAbu‐Abed,UniversityofCentralOklahoma,USA• AliHazmi,TampereUniversityofTechnology,Finland• ArafatAl‐Dweik,KhalifaUniversityofScience,Technology,andResearch,UAE• BayanSharif,NewcastleUpon‐TyneUniversity,UK• CharalamposTsimenidis,NewcastleUpon‐TyneUniversity,UK• IyadAlFalujah,CerionOptimizationIncorporation,USA• KhaledEl‐Maleh,QualcommIncorporation,USA• KhalidMubarak,KhalifaUniversityofScience,Technology,andResearch,UAE• KhalidQaraqe,TexasA&MUniversityatQatar,Qatar


63

• MohammadM.Banat,JordanUniversityofScienceandTechnology,Jordan• MustafaMatalgah,UniversityofMississippi,USA• RaedShubair,KhalifaUniversityofScience,Technology,andResearch,UAE• RidhaHamila,UniversityofQatar,Qatar• SalamaSaidIkki,UniversityofWaterloo,Canada• SalehAl‐Araji,KhalifaUniversityofScience,Technology,andResearch,UAE• YichuangSun,UniversityofHertfordshire,UK


64

PEMOS 2010 Tuesday, October 12 3:30PM‐5:30PM

Room:StrategyRoom2Chair:ShihabJimaa(KhalifaUniversity,UAE)

PAPRReductionbyNulledSubcarrierDistortioninPer‐subcarrierAntennaSelectionSystemsRafaelCepeda(ToshibaResearchEuropeLtd,UnitedKingdom);JustinCoon(ToshibaTRL,UnitedKingdom)

Weproposearate‐losslesstechniqueforreducingthepeak‐to‐averagepowerratio(PAPR)inorthogonal

frequency‐divisionmultiplexingsystemsemployingantennaselectiononaper‐subcarrierbasis.Theproposedtechnique,whichisfromthefamilyoftheactiveconstellationextension(ACE)approachtoPAPRreduction,exploitsthenulledsubcarriers(foragivenantenna)thatarisethroughtheantennaselectionprocesstoreduce

thePAPRbyintroducingacontrolledlevelofdistortiontothesesubcarriers.WeshowthatthenewschemeiscapableofachievingamuchlowerPAPRthantraditionalACEmethodsappliedtoper‐subcarrierantenna

selectionsystems.Moreover,wedemonstratethroughsimulationanalysesthatthedistortiontransmittedonthenulledsubcarrierswillnothinderpracticalsystemperformance.

BitandPowerAllocationStrategyforAMC‐basedMIMO‐OFDMAWiMAXSystemsMuayadAl‐Janabi(NewcastleUniversity,UnitedKingdom);CharalamposC.Tsimenidis(NewcastleUniversity,UnitedKingdom);BayanSharif(UniversityofNewcastleUponTyne,UnitedKingdom);StephaneY.LeGoff(UniversityofNewcastleuponTyne,UnitedKingdom)

Inthispaper,weproposeabitandpowerallocationstrategyforadaptivemodulationandcoding(AMC)basedspatialmultiplexingmulti‐input‐multi‐output(MIMO)orthogonalfrequencydivisionmultipleaccess(OFDMA)systems.Thisstrategyaimstomaximizetheaveragesystemthroughputbyallocatingtheavailableresources

optimallyamongtheutilizedbandsdependingonthecorrespondingchannelconditionsandthetotaltransmissionpowerconstraints.Theaveragesystemthroughputisrepresentedasatrade‐offcriterionbetweenthespectralefficiencyandbiterrorrate(BER).TheconsideredAMCtechniqueutilizesdistinct

modulationandcodingscheme(MCS)optionsratherthanadoptingfixedoruncodedapproaches.ThetransmitterdividestheOFDMAframeateachtransmitantennaintobandsdependingonthenumberofactiveusersinanassignedbasestation(BS).ThesimulationresultsshowsuperiorperformanceoftheMIMO‐AMC‐

OFDMAsystem,whichadoptstheproposedstrategy,overotherconventionalschemes.

Time‐VaryingChannelEstimationUsingAmplitude‐DivisionBasedParallelNLMSTechniqueRubaiyatYasmin(SaitamaUniversity,Japan);TetsuyaShimamura(SaitamaUniversity,Japan)

Inthispaper,weproposeachannelestimationtechniquetocombattherapidlytime‐varyingcharacteristicsofmultipathchannel.Theproposedmethodusesanormalizedleastmeansquare(NLMS)basednoveladaptationschemewithamplitude‐divisiontechnique.Itsupposesmultiplelineartransversalfiltersasestimators,which

arearrangedinaparallelfashion.Thecoefficientvectorsforeachestimatorareformedwiththeamplitude‐


65

divisionbasedclassificationtechniqueaccordingtotheinformationofthechannelcoefficientvalues.The

coefficientvectorselectedateachiterationisadaptedwiththeNLMSalgorithmtohandlethetimevariationeffectoftherapidlytime‐varyingchannel.ComputersimulationresultsdemonstratethattheproposedestimatorprovidebettertrackingperformancethantheconventionalNLMSestimatorandamplitude‐division

parallelLMS(ADPLMS)estimatorforasecondorderMarkovcommunicationchannelinvariousfaderateconditions.

MIMO‐OFDMwithPilot‐AidedChannelEstimationforWiMaxSystemsFabienDelestre(Universityofhertfordshire,UnitedKingdom)

ThispaperdescribesachannelestimationschemeforMultipleInputMultipleOutput(MIMO)‐OrthogonalFrequencyDivisionMultiplexing(OFDM)systemsbasedontrainingsequence.Wefirstdevelopanapproachto

channelestimationwhichiscrucialforthedecodingofthetransmitteddata.WethendiscusstheimplementationoftheproposedmethodforWiMaxsystemsundervariouschannelconditions.TheefficiencyofthenewalgorithmisdemonstratedthroughthesimulationoftheMIMO‐OFDMsystemfortwoandfour

transmitantennasanddifferentnumberofreceiveantennas.TheSpace‐TimeCodingwith192informationsubcarrierspercodewordisusedasdefinedintheWiMaxstandard.Throughsimulations,itisshownthattheproposedmethodhasbetween1.5dBand2dBlosscomparedtotheidealcasewherethechannelcoefficients

areknownatthereceiver.Insummary,withtheproposedchannelestimationtechnique,combiningdiversityusingSpace‐TimeCodeswithOFDMisprovedtobeapromisingtechniqueforthepresentandfuturewirelesscommunications.

IterativeDetectionforZero‐PaddedOFDMinNon‐RegenerativeCooperativeWirelessNetworksHomaEghbali(SimonFraserUniversity,Canada);SamiMuhaidat(SimonFraserUniversity,Canada)

Zero‐PaddingOrthogonalFrequencyDivisionMultiplexing(ZP‐OFDM)hasrecentlybeenintroducedtoavoid

coded‐OFDM'shighdecodingcomplexity.Varioussub‐optimalZP‐OFDMreceivershavebeendevelopedintheliteraturetotradeoffperformancewithimplementationcomplexity.Inthispaper,weproposeanewiterativedetectionschemeforZP‐OFDMtransmissionstailoredtobroadbandcooperativenetworkswithsinglerelay

andamplify‐and‐forwardrelaying.Byavoidingchanneldependentmatrixinversion,whichisthecaseinminimummeansquareerror(MMSE)‐ZP‐OFDMtransmissions,andincorporatinglinearprocessingtechniques,weshowthatourproposedreceiverisabletobringsignificantcomplexityreductioninthereceiverdesign,

whileoutperformingcooperativeMMSE‐ZP‐OFDM.

Random‐BasedFairAllocationinMulti‐RelayCooperativeOFDMSystemIbrahimYAbualhaol(KhalifaUniversity,UAE);YoussefIraqi(KhalifaUniversity,UAE)

Inthispaper,anovelMulti‐relayAdaptiveRandomSelection(MARS)strategyinadual‐hopmulti‐relayOFDMsystemisproposed.Inthisstrategy,therelayscooperateaccordingtocontributionfactorssuggestedbyeachrelay.TheselectionoftheOFDMsub‐channelsisbasedonuniformrandomdistributionwherethethresholds

oftheuniformrandomvariableareassociatedwiththecontributionfactors.Thisapproachguaranteesfairnessinallocatingtheresourcesineachrelay.TheapproachiscomparedwithstaticallocationoftheOFDMsub‐channels.TheMARSstrategyistestedinamultirelaysystemoverflatandselectiveRayleighfadingchannels.

SimulationresultsshowthesuperiorityoftheproposedschemeinimprovingtheOFDMsystemperformancein


66

termsofBER.Theperformanceisachievedbycreatingavirtualdiversitybyrandomizingtheallocationwhere

nochannelinformationisrequired.

Documents

2010 IEEE 6th International Conference on Wireless and ...IEEE 6th International Conference on Wireless and Mobile Computing, Networking ... 18th workshop on Selected Areas in Cryptography