Show simple item record

dc.contributor.authorGholami, M. R.en_US
dc.contributor.authorKeskin, M. F.en_US
dc.contributor.authorGezici, Sinanen_US
dc.contributor.authorJansson, M.en_US
dc.contributor.editorWebster, J. G.
dc.date.accessioned2019-04-23T07:02:23Z
dc.date.available2019-04-23T07:02:23Z
dc.date.issued2016en_US
dc.identifier.urihttp://hdl.handle.net/11693/50896
dc.description.abstractIn this article, we study cooperative positioning in wireless networks in which target nodes at unknown locations locally collaborate with each other to find their locations. We review different models available for positioning and categorize the model‐based algorithms in two groups: centralized and distributed. We then investigate a lower bound on the variance of unbiased estimators, namely the Cramer–Rao lower bound, which is a common benchmark in the positioning literature. We finally discuss some open problems and research topics in the area of positioning that are worth exploring in future studies.en_US
dc.language.isoEnglishen_US
dc.relation.ispartofWiley encyclopedia of electrical and electronics engineeringen_US
dc.relation.isversionofhttps://doi.org/10.1002/047134608X.W8302en_US
dc.relation.isversionofhttps://doi.org/10.1002/047134608Xen_US
dc.subjectCentralized algorithmsen_US
dc.subjectCooperative positioningen_US
dc.subjectCRLBen_US
dc.subjectDistributed algorithmsen_US
dc.subjectLocalizationen_US
dc.titleCooperative positioning in wireless networksen_US
dc.typeBook Chapteren_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.identifier.doi10.1002/047134608X.W8302en_US
dc.identifier.doi10.1002/047134608Xen_US
dc.publisherJohn Wiley & Sonsen_US
dc.contributor.bilkentauthorGezici, Sinan
dc.identifier.eisbn9780471346081


Files in this item

Thumbnail

This item appears in the following Collection(s)

  • Work in Progress 348
    Check/configure data processing but have no pending metadata

Show simple item record