Traffic splitting with network calculus for mesh sensor networks
2007 (English)In: Proceedings of Future Generation Communication and Networking, FGCN 2007, IEEE Computer Society, 2007, 371-376 p.Conference paper (Refereed)
In many applications of sensor networks, it is essential to ensure that messages are transmitted to their destinations as early as possible and the buffer size of each sensor node is as small as possible. In this paper, we firstly propose a mesh sensor network system model. Based on this system model, the expressions for deriving the delay bound and buffer requirement bound are presented using network calculus. In order to balance traffic load and improve resource utilization, three traffic splitting mechanisms are proposed The numerical results show that the delay bound and buffer requirement bound are lowered while applying those traffic splitting mechanisms. And thus the performance of the whole sensor network is improved.
Place, publisher, year, edition, pages
IEEE Computer Society, 2007. 371-376 p.
Differentiation (calculus), Mathematical techniques, Mechanisms, Model structures, Sensors, Telecommunication equipment, Video streaming
Computer and Information Science Electrical Engineering, Electronic Engineering, Information Engineering
IdentifiersURN: urn:nbn:se:kth:diva-39382DOI: 10.1109/FGCN.2007.220ISI: 000252885900071ScopusID: 2-s2.0-52249109853ISBN: 978-076953048-2OAI: oai:DiVA.org:kth-39382DiVA: diva2:440881
2007 International Conference on Future Generation Communication and Networking, FGCN 2007; Jeju Island; South Korea; 6 December 2007 through 8 December 2007
QC 201411072011-09-142011-09-092014-11-07Bibliographically approved