2009
DOI: 10.1016/j.comcom.2009.05.005
|View full text |Cite
|
Sign up to set email alerts
|

An efficient location tracking structure for wireless sensor networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Year Published

2011
2011
2020
2020

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 18 publications
(8 citation statements)
references
References 22 publications
0
8
0
Order By: Relevance
“…Given the positive scalers , , , and , the sensor network can track the two targets, furthermore the PIB distributed filter (4) is distributed filter, that is the performance constraint (11) is achieved for all nonzero , , , and , if there exist positive scalers , and , such that the following LMIs are satisfied: (14) and (15) where , , (13) is , where is the number of sensors in -group and is the number of sensors in -group. Thus, the size of the matrices in (13) has a linear relation with the total number of the sensors.…”
Section: Sufficient Conditions For Distributed Filtering Designmentioning
confidence: 99%
See 1 more Smart Citation
“…Given the positive scalers , , , and , the sensor network can track the two targets, furthermore the PIB distributed filter (4) is distributed filter, that is the performance constraint (11) is achieved for all nonzero , , , and , if there exist positive scalers , and , such that the following LMIs are satisfied: (14) and (15) where , , (13) is , where is the number of sensors in -group and is the number of sensors in -group. Thus, the size of the matrices in (13) has a linear relation with the total number of the sensors.…”
Section: Sufficient Conditions For Distributed Filtering Designmentioning
confidence: 99%
“…It should be pointed out that the interaction among the targets, such as magnitude and noise, would make multiple targets tracking problem much harder than single target tracking problem. This fact motivates researchers to have intensive studies on multiple targets tracking problem in sensor networks [12]- [14]. In previous work, all the information are transmitted under perfect connection.…”
Section: Introductionmentioning
confidence: 99%
“…Node localization can be done by various algorithms. Here we are using 3 localization algorithms [6] in order to find out node localization. Every sensor node is separated by certain distance called transmission range.…”
Section: Wsn Localizationmentioning
confidence: 99%
“…Localization can be done in indoor as well as outdoor envorinments. Bat algorithm can be done in different ways [6] here we are proposing a new algorithm firefly driven bat algorithm [8] it gives better results compared to bat algorithm and bacterial foraging driven bat algorithm (BDBA). From literature of optimization algorithms for localization, bat algorithm is best localization algorithm compared to PSO and cuckoo search and firefly algorithm.…”
Section: Introductionmentioning
confidence: 99%
“…Nonetheless, with the explosion of connected fixed/mobile devices, the LTE networks are facing a number of challenges with respect to network congestion, radio frequency interference, link health, and others. To address these challenges, centroid topology optimization (CTO)-based schemes [9,32,37,39,45], which are capable of improving LTE network performance with respect to throughput, delay, delay standard deviation (DSD), packet loss ratio (PLR), signal-to-noise-plusinterference ratio (SNIR), modulation and coding scheme (MCS) index, and corresponding transport block size (TBS), have been widely used. To be specific, a CTO-based scheme is a position computation scheme, which deploys an eNodeB to the center-ofgravity of UEs within their transmission range.…”
Section: Introductionmentioning
confidence: 99%