Abstract
With their ease of installation, infrastructureless mode of operation and flexible deployment style, Video Surveillance Sensor Networks (VSSNs) provide more opportunities than legacy surveillance methods for applications such as habitat monitoring and border surveillance. We argue that events created in the coverage area of a VSSN are the application level messaging units and propose to employ Event Based Fairness (EBF) which aims at a fair distribution of nodes’ resources according to the event flows. We carried out simulation experiments to compare the application level performances of two different EBF implementations with that of FCFS based queueing. We observe that EBF enhances the VSSN performance in two ways: Firstly, when the video traffic due to the events created exceed the total capacity of the network, EBF increases the overall number of events properly reported to the sink. Secondly, EBF reduces the initial event reporting delay, thus decreases the response time to the occurring events within the network.
This work is supported by TUBITAK under the grant number 108E207.
Chapter PDF
Similar content being viewed by others
References
Downes, I., Rad, L., Aghajan, H.: Development of a mote for wireless image sensor networks. In: Proc. of COGnitive systems with Interactive Sensors (COGIS), Paris, France (March 2006)
Rahimi, M., Baer, R., Iroezi, O.I., Garcia, J.C., Warrior, J., Estrin, D., Srivastava, M.: Cyclops: in situ image sensing and interpretation in wireless sensor networks. In: SenSys 2005: Proceedings of the 3rd international conference on Embedded networked sensor systems, pp. 192–204. ACM Press, New York (2005)
Demers, A., Keshav, S., Shenker, S.: Analysis and simulation of a fair queueing algorithm. In: SIGCOMM 1989: Symposium proceedings on Communications architectures & protocols, pp. 1–12. ACM, New York (1989)
Shreedhar, M., Varghese, G.: Efficient fair queueing using deficit round robin. SIGCOMM Comput. Commun. Rev. 25(4), 231–242 (1995)
Bertsekas, D., Gallager, R.: Data networks, 2nd edn. Prentice-Hall, Inc., NJ (1992)
Jun, J., Sichitiu, M.: Fairness and qos in multihop wireless networks. In: IEEE 58th Vehicular Technology Conference, VTC, vol. 5, pp. 2936–2940 (2003)
Raniwala, A., De, P., Sharma, S., Krishnan, R., cker Chiueh, T.: End-to-end flow fairness over ieee 802.11-based wireless mesh networks. In: IEEE INFOCOM, pp. 2361–2365 (2007)
Rangwala, S., Gummadi, R., Govindan, R., Psounis, K.: Interference-aware fair rate control in wireless sensor networks. In: Rizzo, L., Anderson, T.E., McKeown, N. (eds.) SIGCOMM, pp. 63–74. ACM, New York (2006)
Fan, K.-W., Zheng, Z., Sinha, P.: Steady and fair rate allocation for rechargeable sensors in perpetual sensor networks. In: Proc. of ACM SENSYS, Raleigh, NC (November 2008)
Chen, S., Fang, Y., Xia, Y.: Lexicographic Maxmin Fairness for Data Collection in Wireless Sensor Networks. IEEE Transactions On Mobile Computing, 762–776 (2007)
Sridharan, A., Krishnamachari, B.: Max-min fair collision-free scheduling for wireless sensor networks. In: Workshop on Multihop Wireless Networks (MWN 2004), IPCCC (2004)
Akan, O.B., Akyildiz, I.F.: Event-to-sink reliable transport in wireless sensor networks. IEEE/ACM Trans. Netw. 13(5), 1003–1016 (2005)
Wan, C.-Y., Eisenman, S.B., Campbell, A.T.: Coda: congestion detection and avoidance in sensor networks. In: SenSys 2003: Proceedings of the 1st international conference on Embedded networked sensor systems, pp. 266–279. ACM, New York (2003)
He, T., Stankovic, J.A., Lu, C., Abdelzaher, T.F.: Speed: A stateless protocol for real-time communication in sensor networks. In: ICDCS, pp. 46–55 (2003)
Tassiulas, L., Sarkar, S.: Maxmin fair scheduling in wireless networks. In: INFOCOM (2002)
Nuyens, M., Wierman, A.: The Foreground-Background queue: A survey. Performance Evaluation 65(3-4), 286–307 (2008)
Rai, I., Urvoy-Keller, G., Biersack, E.: Analysis of LAS scheduling for job size distributions with high variance. In: Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, pp. 218–228. ACM Press, New York (2003)
Wierman, A., Bansal, N., Harchol-Balter, M.: A note on comparing response times in the M/GI/1/FB and M/GI/1/PS queues. Operations Research Letters 32(1), 73–76 (2004)
Wierman, A., Harchol-Balter, M.: Classifying scheduling policies with respect to unfairness in an M/GI/1. ACM SIGMETRICS Performance Evaluation Review 31(1), 238–249 (2003)
Shao, Z., Madhow, U.: Scheduling heavy-tailed data traffic over the wireless Internet. In: Proceedings of IEEE 56th Vehicular Technology Conference, 2002. VTC 2002-Fall, vol. 2 (2002)
Ye, W., Heidemann, J., Estrin, D.: Medium access control with coordinated adaptive sleeping for wireless sensor networks. IEEE/ACM Trans. Netw. 12(3), 493–506 (2004)
Inc, O.: OPNET Modeler
Komar, C., Ersoy, C.: Optimization of power consumption using trespassers favorite path and variable sensing range integrated sleep schedule in surveillance wireless sensor networks. In: 23rd International Symposium on Computer and Information Sciences, 2008. ISCIS 2008, pp. 1–5 (2008)
Ozgovde, A., Demirkol, I., Ersoy, C.: Effect of sleep schedule and frame rate on the capabilities of Video Sensor Networks. In: 3rd International Symposium on Wireless Pervasive Computing, 2008. ISWPC 2008, pp. 156–159 (2008)
Durmus, Y., Ozgovde, A., Ersoy, C.: Exploring the effect of the network parameters of video sensor networks. In: Proceedings of ISCN 2008 8th International Symposium on Computer Networks, pp. 188–192 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 IFIP International Federation for Information Processing
About this paper
Cite this paper
Durmus, Y., Ozgovde, B.A., Ersoy, C. (2009). Event Based Fairness for Video Surveillance Sensor Networks. In: Fratta, L., Schulzrinne, H., Takahashi, Y., Spaniol, O. (eds) NETWORKING 2009. NETWORKING 2009. Lecture Notes in Computer Science, vol 5550. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01399-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-01399-7_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01398-0
Online ISBN: 978-3-642-01399-7
eBook Packages: Computer ScienceComputer Science (R0)