Andrea Marin
Abstract
Wireless Sensor Networks (WSNs) are important examples of Collective Adaptive System, which consist of a set of motes that are spatially distributed in an indoor or outdoor space. Each mote monitors its surrounding conditions, such as humidity, intensity of light, temperature, and vibrations, but also collects complex information, such as images or small videos, and cooperates with the whole set of motes forming the WSN to allow the routing process. The traffic in the WSN consists of packets that contain the data harvested by the motes and can be classified according to the type of information that they carry. One pivotal problem in WSNs is the bandwidth allocation among the motes. The problem is known to be challenging due to the reduced computational capacity of the motes, their energy consumption constraints, and the fully decentralised network architecture. In this article, we study a novel algorithm to allocate the WSN bandwidth among the motes by taking into account the type of traffic they aim to send. Under the assumption of a mesh network and Poisson distributed harvested packets, we propose an analytical model for its performance evaluation that allows a designer to study the optimal configuration parameters. Although the Markov chain underlying the model is not reversible, we show it to be ρ-reversible under a certain renaming of states. By an extensive set of simulations, we show that the analytical model accurately approximates the performance of networks that do not satisfy the assumptions. The algorithm is studied with respect to the achieved throughput and fairness. We show that it provides a good approximation of the max-min fairness requirements.
- I. F. Akyildiz and I. H. Kasimoglu. 2004. Wireless sensor and actor networks: research challenges. Ad Hoc Netw. 2, 4 (2004), 351--367.Google Scholar
Cross Ref
- D. Bertsekas and R. Gallager. 1992. Data Networks. Prentice Hall. Google ScholarDigital Library
- M. Caccamo, L. Y. Zhang, S. Lui, and G. Buttazzo. 2002. An implicit prioritized access protocol for wireless sensor networks. In Proceedings of the 23rd IEEE Real-Time Systems Symposium (RTSS’02). 39--48. Google ScholarDigital Library
- M. Cherian and T. R. G. Nair. 2014. Priority based bandwidth allocation in wireless sensor networks. Int. J. Comput. Netw. Commun. (IJCNC) 6, 6 (2014), 119--128.Google ScholarCross Ref
- M. Chitnis, P. Pagano, G. Lipari, and Y Liang. 2009. A survey on bandwidth resource allocation and scheduling in wireless sensor networks. In Proceedings of the IEEE International Conference on Network-Based Information Systems. 121--128. Google ScholarDigital Library
- G. Degirmenci, J. P. Kharoufeh, and R. O. Baldwin. 2013. On the performance evaluation of query-based wireless sensor networks. Perform. Eval. 70, 2 (2013), 124--147. Google ScholarDigital Library
- C. T. Ee and R. Bajcsy. 2004. Congestion control and fairness for many-to-one routing in sensor networks. In Proceedings of the 2nd International Conference on Embedded Networked Sensor Systems. 148--161. Google ScholarDigital Library
- R. Fagin and T. G. Price. 1978. Efficient calculation of expected miss ratios in the independent reference model. SIAM J. Comput. 7, 3 (1978), 288--297.Google ScholarDigital Library
- C. Feng, J. Hillston, and V. Galpin. 2016. Automatic moment-closure approximation of spatially distributed collective adaptive systems. ACM Trans. Model. Comput. Simul. 26, 4 (2016), 26:1--26:22. Google ScholarDigital Library
- A. Frescha. 2015. Collective adaptive systems. In Proceedings of UBICOMP/ISWC’15 Adjunct. 893--895. Google ScholarDigital Library
- E. Gelenbe and A. Marin. 2015. Interconnected wireless sensors with energy harvesting. In Proceedings of the International Conference on Analytical Stochastic Modelling Techniques and Applications (ASMTA’15). 87--99.Google Scholar
- E. L. Hahne. 1991. Round-robin scheduling for max-min fairness in data networks. IEEE J. Select. Areas Commun. 9 (1991), 1024--1039. Google ScholarDigital Library
- Z. Hanzalek and P. Jurĉik. 2010. Energy efficient scheduling for cluster-tree wireless sensor networks with time-bounded data flows: Application to IEEE 802.15.4/ZigBee. IEEE Trans. Industr. Informat. 6, 3 (Aug 2010), 438--450.Google ScholarCross Ref
- T. He, J. A. Stankovic, C. Lu, and T. Abdelzaher. 2003. SPEED: A stateless protocol for real-time communication in sensor networks. In Proceedings of the 23rd IEEE International Conference on Distributed Computing Systems. 46--55. Google ScholarDigital Library
- F. Kelly. 1979. Reversibility and Stochastic Networks. Wiley, New York. Google ScholarDigital Library
- D. Khan, B. Nefzi, L. Santinelli, and Y. Song. 2012. Probabilistic bandwidth assignment in wireless sensor networks. In Wireless Algorithms, Systems, and Applications. Lecture Notes in Computer Science, Vol. 7405. Springer, Berlin, 631--647.Google Scholar
- W. F. King. 1971. Analysis of paging algorithms. In Proceedings of the International Federation for Information Processing Congress (IFIP’71).Google Scholar
- R. Lopes Pereira, J. Trinidade, F. Goncalves, L. Suresh, D. Barbosa, and T. Vazao. 2014. A wireless sensor network for monitoring volcano-seismic signals. Nat. Haz. Earth Syst. Sci. 14 (2014), 3123--3142.Google ScholarCross Ref
- A. Mainwaring, D. Culler, J. Polastre, R. Szewczyk, and J. Anderson. 2002. Wireless sensor networks for habitat monitoring. In Proceedings of the 1st ACM International Workshop on Wireless Sensor Networks and Applications. ACM, 88--97. Google ScholarDigital Library
- A. Marin and S. Rossi. 2014a. On discrete time reversibility modulo state renaming and its applications. In Proceedings of the Conference on International Conference on Performance Evaluation Methodologies and Tools (ValueTools’14). Google ScholarDigital Library
- A. Marin and S. Rossi. 2014b. On the relations between lumpability and reversibility. In Proceedings of the IEEE 22nd International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS’14). 427--432. Google ScholarDigital Library
- A. Marin and S. Rossi. 2016a. On the relations between Markov chain lumpability and reversibility. Acta Informat. (2016). Available online. Google ScholarDigital Library
- A. Marin and S. Rossi. 2016b. Priority-based bandwidth allocation in wireless sensor networks. In Proceedings of the 9th EAI Proceedings of the International Conference on Performance Evaluation Methodologies and Tools (ValueTools’15). 137--144. Google ScholarDigital Library
- R. Pan, B. Prabhakar, and K. Psounis. 2000. CHOKe, a stateless active queue management scheme for approximating fair bandwidth allocation. In Proceedings of the IEEE INFOCOM’00. IEEE Computer Society Press, Washington, DC, 942--951.Google Scholar
- Y. Sankarasubramabiam, O. Akan, and I. Akyildiz. 2003. Event-to-sink reliable transport in wireless sensor networks. In Proceedings of the 4th ACM Symposium on Mobile Ad Hoc Networking 8 Computing (MobiHoc’03). 177--188. Google ScholarDigital Library
- L. Tan and S. Tang. 2017. Energy harvesting wireless sensor node with temporal death: novel models and analyses. IEEE/ACM Trans. Netw. 25, 2 (2017), 896--909. Google ScholarDigital Library
- L. Tan and M. Wu. 2016. Data reduction in wireless sensor networks: a hierarchical LMS prediction approach. IEEE Sens. J. 16, 6 (2016), 1708--1715.Google ScholarCross Ref
- L. Tan, Z. Zhu, F. Ge, and N. Xiong. 2015. Utility maximization resource allocation in wireless networks: Methods and algorithms. IEEE Trans. Syst., Man Cybernet.: Syst. 45, 7 (2015), 101--1034.Google Scholar
- S. Tang and L. Tan. 2017. Reward rate maximization and optimal transmission policy of EH device with temporal death in EH-WSNs. IEEE Trans. Wireless Commun. 16, 2 (2017), 1157--1167. Google ScholarDigital Library
- M. Tschaikowski and M. Tribastone. 2017. Spatial fluid limits for stochastic mobile networks. Perform. Eval. 109 (2017), 52--76. Google ScholarDigital Library
- C. Tunc and N. Akar. 2017. Markov fluid queue model of an energy harvesting IoT device with adaptive sensing. Perform. Eval. 111 (2017), 1--16. Google ScholarDigital Library
- C. Wan, S. B. Eisenman, and A. T. Campbell. 2003. CODA: Congestion detection and avoidance in sensor networks. In Proceedings of the 1st ACM Conference on Embedded Networked Sensor Systems. 266--279. Google ScholarDigital Library
- P. D. Welch. 1981. On the Problem of the Initial Transient in Steady-state Simulations. Technical Report. IBM Watson Research Center, Yorktown Heights, NY.Google Scholar
- P. Whittle. 1986. Systems in Stochastic Equilibrium. John Wiley 8 Sons Ltd. Google ScholarDigital Library
- A. Woo and D. E. Culler. 2001. A transmission control scheme for media access in sensor networks. In Proceedings of the 7th International Conference on Mobile Computing and Networking. 221--235. Google ScholarDigital Library
- W. Y. Yi, K. M. Lo, K. S. Mak, T. Leung, Y. Leung, and M. L. Meng. 2015. A survey of wireless sensor network based air pollution monitoring systems. Sensors 15, 12 (2015), 31392--31427.Google ScholarCross Ref
Index Terms
- A Product-Form Model for the Performance Evaluation of a Bandwidth Allocation Strategy in WSNs
Recommendations
Performance evaluation of sensor deployment using optimization techniques and scheduling approach for K-coverage in WSNs
In the wireless sensor networks, sensor deployment and coverage are the vital parameter that impacts the network lifetime. Network lifetime can be increased by optimal placement of sensor nodes and optimizing the coverage with the scheduling approach. ...
Lifetime aware deployment of k base stations in WSNs
MSWiM '12: Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systemsIn WSNs (wireless sensor networks), sensor nodes are typically battery powered. The number of base stations and their locations have significant impacts on the lifetime of a WSN. We study two multiple base station deployment problems. The first problem ...
Provisioning QoS in Wireless Sensor Networks Using a Simple Max-Min Fair Bandwidth Allocation
CSIE '09: Proceedings of the 2009 WRI World Congress on Computer Science and Information Engineering - Volume 01Wireless Sensor Network (WSN) is made up of a number of sensor nodes and base stations. The ad hoc nature of sensor deployment produces unpredictable patterns of connectivity and varied node density. Consequently, uneven bandwidth provisioning will ...
Comments