Intrusion objects with shapes under randomized scheduling algorithm in sensor networks

Yang Xiao; Hui Chen; Yanping Zhang; Xiaojiang Du; Bo Sun; Kui Wu

doi:10.1109/ICDCS.Workshops.2008.39

Intrusion objects with shapes under randomized scheduling algorithm in sensor networks

Yang Xiao, Hui Chen, Yanping Zhang, Xiaojiang Du, Bo Sun, Kui Wu

Department of Electrical and Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

4 Scopus citations

Abstract

Wireless sensor networks have many applications. In this paper, we are particularly interested in a sensor network which is used for monitoring a field to detect intrusion objects such as enemy tanks, enemy cars, etc. Since sensor nodes have limited energy supply, sensor networks may be configured to put some sensor nodes in sleep mode to save energy. This is a special case of a randomized scheduling algorithm. In this paper, we study the performance of the randomized scheduling algorithm via both analysis and simulation in terms of intrusion coverage intensity when an intrusion object occupies an area. We study the impact of the size of intrusion object on the sensor network's configuration.

Original language	English
Title of host publication	Proceedings - The 28th International Conference on Distributed Computing Systems Workshops, ICDCS Workshops 2008
Pages	315-320
Number of pages	6
DOIs	https://doi.org/10.1109/ICDCS.Workshops.2008.39
State	Published - 2008
Event	28th International Conference on Distributed Computing Systems Workshops, ICDCS Workshops 2008 - Beijing, China Duration: 17 Jun 2008 → 20 Jun 2008

Publication series

Name	Proceedings - International Conference on Distributed Computing Systems

Conference

Conference	28th International Conference on Distributed Computing Systems Workshops, ICDCS Workshops 2008
Country/Territory	China
City	Beijing
Period	17/06/08 → 20/06/08

Access to Document

10.1109/ICDCS.Workshops.2008.39

Cite this

Xiao, Y., Chen, H., Zhang, Y., Du, X., Sun, B., & Wu, K. (2008). Intrusion objects with shapes under randomized scheduling algorithm in sensor networks. In Proceedings - The 28th International Conference on Distributed Computing Systems Workshops, ICDCS Workshops 2008 (pp. 315-320). Article 4577802 (Proceedings - International Conference on Distributed Computing Systems). https://doi.org/10.1109/ICDCS.Workshops.2008.39

@inproceedings{885aaff477a1439ca058392cd9f3ffbd,

title = "Intrusion objects with shapes under randomized scheduling algorithm in sensor networks",

abstract = "Wireless sensor networks have many applications. In this paper, we are particularly interested in a sensor network which is used for monitoring a field to detect intrusion objects such as enemy tanks, enemy cars, etc. Since sensor nodes have limited energy supply, sensor networks may be configured to put some sensor nodes in sleep mode to save energy. This is a special case of a randomized scheduling algorithm. In this paper, we study the performance of the randomized scheduling algorithm via both analysis and simulation in terms of intrusion coverage intensity when an intrusion object occupies an area. We study the impact of the size of intrusion object on the sensor network's configuration.",

author = "Yang Xiao and Hui Chen and Yanping Zhang and Xiaojiang Du and Bo Sun and Kui Wu",

year = "2008",

doi = "10.1109/ICDCS.Workshops.2008.39",

language = "English",

isbn = "9780769531731",

series = "Proceedings - International Conference on Distributed Computing Systems",

pages = "315--320",

booktitle = "Proceedings - The 28th International Conference on Distributed Computing Systems Workshops, ICDCS Workshops 2008",

note = "28th International Conference on Distributed Computing Systems Workshops, ICDCS Workshops 2008 ; Conference date: 17-06-2008 Through 20-06-2008",

}

Xiao, Y, Chen, H, Zhang, Y, Du, X, Sun, B & Wu, K 2008, Intrusion objects with shapes under randomized scheduling algorithm in sensor networks. in Proceedings - The 28th International Conference on Distributed Computing Systems Workshops, ICDCS Workshops 2008., 4577802, Proceedings - International Conference on Distributed Computing Systems, pp. 315-320, 28th International Conference on Distributed Computing Systems Workshops, ICDCS Workshops 2008, Beijing, China, 17/06/08. https://doi.org/10.1109/ICDCS.Workshops.2008.39

Intrusion objects with shapes under randomized scheduling algorithm in sensor networks. / Xiao, Yang; Chen, Hui; Zhang, Yanping et al.
Proceedings - The 28th International Conference on Distributed Computing Systems Workshops, ICDCS Workshops 2008. 2008. p. 315-320 4577802 (Proceedings - International Conference on Distributed Computing Systems).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Intrusion objects with shapes under randomized scheduling algorithm in sensor networks

AU - Xiao, Yang

AU - Chen, Hui

AU - Zhang, Yanping

AU - Du, Xiaojiang

AU - Sun, Bo

AU - Wu, Kui

PY - 2008

Y1 - 2008

N2 - Wireless sensor networks have many applications. In this paper, we are particularly interested in a sensor network which is used for monitoring a field to detect intrusion objects such as enemy tanks, enemy cars, etc. Since sensor nodes have limited energy supply, sensor networks may be configured to put some sensor nodes in sleep mode to save energy. This is a special case of a randomized scheduling algorithm. In this paper, we study the performance of the randomized scheduling algorithm via both analysis and simulation in terms of intrusion coverage intensity when an intrusion object occupies an area. We study the impact of the size of intrusion object on the sensor network's configuration.

AB - Wireless sensor networks have many applications. In this paper, we are particularly interested in a sensor network which is used for monitoring a field to detect intrusion objects such as enemy tanks, enemy cars, etc. Since sensor nodes have limited energy supply, sensor networks may be configured to put some sensor nodes in sleep mode to save energy. This is a special case of a randomized scheduling algorithm. In this paper, we study the performance of the randomized scheduling algorithm via both analysis and simulation in terms of intrusion coverage intensity when an intrusion object occupies an area. We study the impact of the size of intrusion object on the sensor network's configuration.

UR - http://www.scopus.com/inward/record.url?scp=51949083481&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=51949083481&partnerID=8YFLogxK

U2 - 10.1109/ICDCS.Workshops.2008.39

DO - 10.1109/ICDCS.Workshops.2008.39

M3 - Conference contribution

AN - SCOPUS:51949083481

SN - 9780769531731

T3 - Proceedings - International Conference on Distributed Computing Systems

SP - 315

EP - 320

BT - Proceedings - The 28th International Conference on Distributed Computing Systems Workshops, ICDCS Workshops 2008

T2 - 28th International Conference on Distributed Computing Systems Workshops, ICDCS Workshops 2008

Y2 - 17 June 2008 through 20 June 2008

ER -

Xiao Y, Chen H, Zhang Y, Du X, Sun B, Wu K. Intrusion objects with shapes under randomized scheduling algorithm in sensor networks. In Proceedings - The 28th International Conference on Distributed Computing Systems Workshops, ICDCS Workshops 2008. 2008. p. 315-320. 4577802. (Proceedings - International Conference on Distributed Computing Systems). doi: 10.1109/ICDCS.Workshops.2008.39

Intrusion objects with shapes under randomized scheduling algorithm in sensor networks

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this