Position and Velocity Tracking in Mobile Networks Using Particle and Kalman Filtering With Comparison

Olama, Mohammed M.; Djouadi, Seddik M.; Papageorgiou, Ioannis; Charalambous, Charalambos D.

doi:10.1109/tvt.2007.906370

Cited by 26 publications

(9 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To support IP QoS, the Internet Engineering Task Force (IETF) recommends integrated services (IntServ) and differentiated services (DiffServ) (Olama et al, 2008). These services also are expected to be effective in all-IP-based 4G networks.…”

Section: Session Managementmentioning

confidence: 99%

“…These services also are expected to be effective in all-IP-based 4G networks. Since 4G networks will support multimedia traffic, we must visit the issue of providing IP QoS in IP based wireless access networks (Olama et al, 2008) and propose ITRAS for QoS support in 4G networks, where the decision of radio resource allocation follows IntServ or DiffServ policy.…”

Section: Session Managementmentioning

confidence: 99%

See 1 more Smart Citation

Mobility Management for Seamless Information Flow in a Heterogeneous Networks

Macriga¹

2011

Journal of Computer Science

View full text Add to dashboard Cite

Problem statement:In the heterogeneous networks, generally the entire networks operating on the Radio Frequencies under wireless mode available for communication are brought under a single head based on their common operating procedures and functions. As a common mode the basic functions of the networks are requesting, tracing, sending, acknowledging, authenticating, authorizing, receiving, updating, forwarding, controlling, registering, managing. As the radio frequency is considered the signal strength, maximum coverage, power level are taken as the major factor. Approach: Todays cellular network has a wide coverage area and also a good signal strength and as the WiMax is considered the data transmission rate and the volume of information communicated is high. As we consider the Adhoc Network the path tracing and the nearby node identification is faster and there is no need for a standard architecture. As the major of the different networks are combined with certain QoS without disturbing the existing infrastructure a fast seamless flow of voluminous information in real time application can be achieved. As the data transmission is considered the major part is affected based on the initiation & delay such as authentication delay, handover delay, session initiation, activation which is being carried out only after the control had reached the service point. Results: In the proposed study the transmission of information is purely controlled by categorizing the type of information that is being transmitted such as the information ready for transmission is online or offline. Coming to on line either voice communication, Multimedia communication or real-time information transmission. Considering the offline the information is stored file or images. Among the above one the real time video transmission is considered as the major application because delay cannot be permitted and one more thing the mobility should be managed without any break in the transmission path. The rapidly growing demand for "anywhere, anytime" high-speed access to IP-based services is becoming one of the major challenges for mobile networks. Conclusion: As the demand for mobility increases, mobile terminals need to roam freely across heterogeneous networks, posing the challenge of network integration into an All-IP ubiquitous access platform.

show abstract

Section: Session Managementmentioning

confidence: 99%

Section: Session Managementmentioning

confidence: 99%

Mobility Management for Seamless Information Flow in a Heterogeneous Networks

Macriga¹

2011

Journal of Computer Science

View full text Add to dashboard Cite

show abstract

“…Such adaptive sensor selection problems arise in a wide range of applications, including cellular networks [17], distributed tracking in Ad hoc sensor networks [18], robotic localisation, and underwater networks [19]. Broadly speaking [39], approaches used to solve the sensor selection problem can be categorised either under the Bayesian framework [40,41], or the information theoretic framework [42][43][44][45].…”

Section: Introductionmentioning

confidence: 99%

Consensus-based distributed dynamic sensor selection in decentralised sensor networks using the posterior Cramér–Rao lower bound

Mohammadi

Asif

2015

Signal Processing

View full text Add to dashboard Cite

“…Recent developments in sensor technology and advances in communication systems allow a large number of observation nodes (sensors) to be deployed in geographically distributed sensor networks for a variety of applications including, but not limited to, position and velocity tracking in cellular communications [7], target surveillance, distributed tracking in Ad Hoc sensor networks [8], and localization in radar and underwater sonar system [9], [10]. The paper focuses on decentralized architectures [11], where there is no central fusion centre with estimation performed in a distributed fashion across the system.…”

Section: Introductionmentioning

confidence: 99%

Decentralized Bayesian Estimation with Quantized Observations: Theoretical Performance Bounds

Mohammadi

Asif

Zhong

et al. 2013

2013 IEEE International Conference on Distributed Computing in Sensor Systems

View full text Add to dashboard Cite

The posterior Cramér Rao lower bound (PCRLB) has recently been proposed as an effective selection criteria for sensor resource management in large, geographically distributed sensor networks. Existing algorithms (in particular the decentralized approaches with no central fusion centre) designed for computing the PCRLB are based on raw observations resulting in significant communication overhead from the sensor nodes to the associated local processing nodes. The paper derives distributive computational techniques for determining the PCRLB for quantized sensor networks configured using decentralized architectures. We refer to the distributed computation of the PCRLB as dPCRLB. The main contribution of the paper is extending the dPCRLB algorithm [1] to quantized observations that leads to significant savings in the communication overhead over its counterparts that use raw observations. In our Monte Carlo simulations, we show that the proposed dPCRLB closely follows the centralized bound based on quantized observations. As expected, there is potential performance loss with quantization as is illustrated by the difference between the dPCRLBs computed using raw and quantized observations. The drop in the estimator's performance is, however, compensated for with an increase in the number of quantization levels associated with the observation quantizer.

show abstract

Position and Velocity Tracking in Mobile Networks Using Particle and Kalman Filtering With Comparison

Cited by 26 publications

References 16 publications

Mobility Management for Seamless Information Flow in a Heterogeneous Networks

Mobility Management for Seamless Information Flow in a Heterogeneous Networks

Consensus-based distributed dynamic sensor selection in decentralised sensor networks using the posterior Cramér–Rao lower bound

Decentralized Bayesian Estimation with Quantized Observations: Theoretical Performance Bounds

Contact Info

Product

Resources

About