OPTIMAL SENSOR SCHEDULING ALGORITHMS FOR DISTRIBUTED SENSOR NETWORKS

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

SAFARINEJADIAN BEHROOZ; RAHIMI ABDOLAH

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Journal of Information Systems and Telecommunication Year:2013 | Volume:1 | Issue:3 Page(s): 175-181

Download Full-Text

View:

439

Download:

109

Cites:

Information Journal Paper

Title

OPTIMAL SENSOR SCHEDULING ALGORITHMS FOR DISTRIBUTED SENSOR NETWORKS

Author(s)

SAFARINEJADIAN BEHROOZ | RAHIMI ABDOLAH | Issue Writer Certificate

Keywords

SENSOR SCHEDULING

SUB-OPTIMAL ALGORITHM

OFFLINE OPTIMIZATION

ERROR COVARIANCE

Abstract

In this paper, a sensor network is used to estimate the dynamic states of a system. At each time step, one (or multiple) sensors are available that can send its measured data to a central node, in which all of processing is done. We want to provide an optimal algorithm for scheduling sensor selection at every time step. Our goal is to select the appropriate sensor to reduce computations, optimize the energy consumption and enhance the network lifetime. To achieve this goal, we must reduce the ERROR COVARIANCE. Three algorithms are used in this work: sliding window, thresholding and randomly chosen algorithms. Moreover, we will offer a new algorithm based on circular selection. Finally, a novel algorithm for selecting multiple sensors is proposed. Performance of the proposed algorithms is illustrated with numerical examples.

Cites

A STOCHASTIC LYAPUNOV THEOREM WITH APPLICATION TO STABILITY ANALYSIS OF NETWORKED CONTROL SYSTEMS

References

Cite

APA: Copy

SAFARINEJADIAN, BEHROOZ, & RAHIMI, ABDOLAH. (2013). OPTIMAL SENSOR SCHEDULING ALGORITHMS FOR DISTRIBUTED SENSOR NETWORKS. JOURNAL OF INFORMATION SYSTEMS AND TELECOMMUNICATION (JIST), 1(3), 175-181. SID. https://sid.ir/paper/332614/en

Vancouver: Copy

SAFARINEJADIAN BEHROOZ, RAHIMI ABDOLAH. OPTIMAL SENSOR SCHEDULING ALGORITHMS FOR DISTRIBUTED SENSOR NETWORKS. JOURNAL OF INFORMATION SYSTEMS AND TELECOMMUNICATION (JIST)[Internet]. 2013;1(3):175-181. Available from: https://sid.ir/paper/332614/en

IEEE: Copy

BEHROOZ SAFARINEJADIAN, and ABDOLAH RAHIMI, “OPTIMAL SENSOR SCHEDULING ALGORITHMS FOR DISTRIBUTED SENSOR NETWORKS,” JOURNAL OF INFORMATION SYSTEMS AND TELECOMMUNICATION (JIST), vol. 1, no. 3, pp. 175–181, 2013, [Online]. Available: https://sid.ir/paper/332614/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops