Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
CMOS Image Sensor for Smart Cameras Read chapter Read first chapter

2016 | OriginalPaper | Chapter

Distributed Medium Access for Camera Sensor Networks: Theory and Practice

Authors : Hojin Lee, Donggyu Yun, Yung Yi

Published in: Theory and Applications of Smart Cameras

Publisher: Springer Netherlands

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Camera sensor networks (CSN) have recently emerged as an important class of sensor networks, where each node is equipped with a camera and has a capability of visually detecting events in its neighborhood. The applications of CSN are highly diverse, including surveillance, environmental monitoring, smart homes, and telepresence systems. In this article, we focus on one of the key unique characteristics of CSN: An event detected by a sensor node can trigger a large amount of sensing data generation, which should be delivered in a distributed manner, whereas in “traditional” sensor networks the volume of sensing data is typically small. Networking protocols to convey the captured image from sensors to decision making modules consist of from distributed and energy-efficient layers accessed via a high-throughput and low-delay MAC to fancy routing and transport protocols. In this article, we focus on the MAC layer and survey the theory and the practical implementation efforts of CSMA-based MAC mechanisms, referred to as optimal CSMA, that are fully distributed with the goal of guaranteeing throughput and delay.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

inform now
previous chapter Time Synchronization for Multi-hop Surveillance Camera Systems
next chapter Wireless Sensor Network for Video Sensors
Footnotes
1
Let \( [x_{i} :i \in {\mathscr{L}}] \) denote the vector whose ith element is \( x_{i} . \) For notational convenience, instead of \( [x_{i} :i \in {\mathscr{L}}] \), we use \( [x_{i} ] \) in the remainder of this paper.
 
2
We use j to index the state updates, and \( T(j) \) is the time of j-th update.
 
3
Note that the notations on the network model in this Sect. 4.1 slightly differ from those in other sections, e.g., in Sects. 2.1 and 4.2. For example, in Sects. 2.1 and 4.2, we use \( {\mathscr{L}} \) to refer to the set of nodes in the interference graph G, and \( {\mathscr{V}} \) was not used there.
 
4
The results can be readily extended to the case where the interference matrix may be different on different channels. In such case, interference would be modelled by \( A \in \{ 0,1\}^{L \times L \times C} \) where \( A_{klc} = 1 \) iff link k and l interfere each other on channel c.
 
5
We say \( t \equiv k \) (mod T) if t − k is an integer multiple of T. It is called congruent modulo.
 
6
This per-link optimality is much stronger than the ‘network-wide’ optimality defined by the averaged delay over all links.
 
7
CW sizes are one of values in \( \{ 2^{i + 1} - 1:i = 0, \ldots ,9\} \).
 
Literature
1.
Akyildiz IF, Melodia T, Chowdhury KR (2007) A survey on wireless multimedia sensor networks. Comput Netw 51(4):921–960CrossRef
2.
Chen W, Wang Y, Chen M, Liew SC (2011) On the performance of TCP over throughput-optimal CSMA. In: Proceedings of IWQoS
3.
Hegde N, Proutiere A (2012) Simulation-based optimization algorithms with applications to dynamic spectrum access. In: Proceedings of CISS
4.
Jang H, Yun SY, Shin J, Yi Y (2014) Distributed learning for utility maximization over CSMA-based wireless multihop networks. In: Proceedings of INFOCOM
5.
Jiang L, Leconte M, Ni J, Srikant R, Walrand J (2011) Fast mixing of parallel Glauber dynamics and low-delay CSMA scheduling. In: Proceedings of INFOCOM
6.
Jiang L, Shah D, Shin J, Walrand J (2010) Distributed random access algorithm: scheduling and congestion control. IEEE Trans Inf Theory 56(12):6182–6207MathSciNetCrossRef
7.
Jiang L, Walrand J (2010) A distributed CSMA algorithm for throughput and utility maximization in wireless networks. IEEE/ACM Trans Networking 18(3):960–972CrossRef
8.
Jiang L, Walrand J (2011) Approaching throughput-optimality in distributed CSMA scheduling algorithms with collisions. IEEE/ACM Trans Networking 19(3):816–829CrossRef
9.
Kai CH, Liew SC (2012) Applications of belief propagation in CSMA wireless networks. IEEE/ACM Trans Networking 20(4):1276–1289CrossRef
10.
Kim TH, Ni J, Srikant R, Vaidya N (2011) On the achievable throughput of CSMA under imperfect carrier sensing. In: Proceedings of INFOCOM
11.
Kwak J, Lee CH, Eun DY (2014) A high-order markov chain based scheduling algorithm for low delay in CSMA networks. In: Proceedings of IEEE INFOCOM
12.
Lee CH, Eun DY, Yun SY, Yi Y (2012) From Glauber dynamics to Metropolis algorithm: smaller delay in optimal CSMA. In: Proceedings of ISIT
13.
Lee D, Yun D, Shin J, Yi Y, Yun SY (2014) Provable per-link delay-optimal CSMA for general wireless network topology. In: Proceedings of IEEE INFOCOM
14.
Lee H, Moon S, Yi Y (2015) A-DCF: design and implementation of delay and queue length based wireless mac. In: Proceedings of IEEE INFOCOM
15.
Lee J, Lee H, Yi Y, Chong S, Nardelli B, Chiang M (2013) Making 802.11 DCF near-optimal: design, implementation, and evaluation. In: Proceedings of IEEE SECON
16.
Lee J, Lee HW, Yi Y, Chong S (2012) Improving TCP performance over optimal CSMA in wireless multi-hop networks. IEEE Commun Lett 16(9):1388–1391CrossRef
17.
Lee J, Lee J, Yi Y, Chong S, Proutiere A, Chiang M (2009) Implementing utility-optimal CSMA. In: Proceedings of Allerton (2009)
18.
Li B, Eryilmaz A (2012) A fast-CSMA algorithm for deadline-constrained scheduling over wireless fading channels. In: ArXiv e-prints
19.
Li H, Vaidya N (2014) Optimal CSMA-based wireless communication with worst-case delay and non-uniform sizes. In: Proceedings of IEEE INFOCOM
20.
Liu J, Yi Y, Proutiere A, Chiang M, Poor HV (2008) Maximizing utility via random access without message passing. Tech. rep., Microsoft Research Labs, UK
21.
Liu J, Yi Y, Proutiere A, Chiang M, Poor HV (2010) Towards utility-optimal random access without message passing. Wiley J Wirel Commun Mobile Comput 10(1):115–128CrossRef
22.
Lotfinezhad M, Marbach P (2011) Throughput-optimal random access with order-optimal delay. In: Proceedings of INFOCOM
23.
Murty RN, Mainland G, Rose I, Chowdhury AR, Gosain A, Bers J, Welsh M (2008) Citysense: an urban-scale wireless sensor network and testbed. In: Proceedings of IEEE HST
24.
Nardelli B, Lee J, Lee K, Yi Y, Chong S, Knightly E, Chiang M (2011) Experimental evaluation of optimal CSMA. In: Proceedings of INFOCOM
25.
Ni J, Tan B, Srikant R (2010) Q-CSMA: Queue-length based CSMA/CA algorithms for achieving maximum throughput and low delay in wireless networks. In: Proceedings of INFOCOM
26.
Proutiere A, Yi Y, Lan T, Chiang M (2010) Resource allocation over network dynamics without timescale separation. In: Proceedings of INFOCOM
27.
Qian D, Zheng D, Zhang J, Shroff N (2010) CSMA-based distributed scheduling in multi-hop MIMO networks under SINR model. In: Proceedings of INFOCOM
28.
Rajagopalan S, Shah D, Shin J (2009) Network adiabatic theorem: an efficient randomized protocol for contention resolution. In: Proceedings of ACM SIGMETRICS. Seattle, WA
29.
Shah D, Shin J (2010) Delay optimal queue-based CSMA. In: Proceedings of ACM SIGMETRICS
30.
31.
Shah D, Shin J, Tetali P (2011) Medium access using queues. In: Proceedings of IEEE FOCS
32.
Shah D, Tse DNC, Tsitsiklis JN (2011) Hardness of low delay network scheduling. IEEE Trans Inf Theory 57(12):7810–7817MathSciNetCrossRef
33.
Subramanian V, Alanyali M (2011) Delay performance of CSMA in networks with bounded degree conflict graphs. In: Proceedings of ISIT
34.
Tassiulas L, Ephremides A (1992) Stability properties of constrained queueing systems and scheduling for maximum throughput in multihop radio networks. IEEE Trans Autom Control 37(12):1936–1949MathSciNetCrossRefMATH
35.
Warrier A, Janakiraman S, Ha S, Rhee I (2009) DiffQ: Practical differential backlog congestion control for wireless networks. In: Proceedings of IEEE INFOCOM
36.
37.
Yi Y, Chiang M (2011) Next-generation internet architectures and protocols. In: Chap. 16: Stochastic network utility maximization and wireless scheduling, Cambridge University Press, Cambridge
38.
Yun SY, Shin J, Yi Y (2013) CSMA over time-varying channels: optimality, uniqueness and limited backoff rate. In: Proceedings of ACM MobiHoc
39.
Yun SY, Shin J, Yi Y (2013) CSMA using the bethe approximation for utility maximization. In: Proceedings of ISIT
40.
Yun SY, Yi Y, Shin J, Eun DY (2012) Optimal CSMA: a survey. In: Proceedings of ICCS
Metadata
Title
Distributed Medium Access for Camera Sensor Networks: Theory and Practice
Authors
Hojin Lee
Donggyu Yun
Yung Yi
Copyright Year
2016
Publisher
Springer Netherlands
Book
Theory and Applications of Smart Cameras

Print ISBN: 978-94-017-9986-7

Electronic ISBN: 978-94-017-9987-4

Copyright Year: 2016

DOI
https://doi.org/10.1007/978-94-017-9987-4_14