A Human Location Prediction-Based Routing Protocol in Mobile Crowdsensing-Based Urban Sensor Networks
Source abstract
Abstract
Mobile crowdsensing (MCS) has recently emerged as an urban-sensing paradigm that takes advantage of smartphone sensing capabilities and user mobility. A major challenge in mobile crowdsensing-based urban sensor networks is how to efficiently transfer data from sensors to the sink (e.g., the server center). Therefore, this study proposes a human location prediction-based routing protocol (HLPRP) in such networks. Specifically, a human location prediction (HLP) model is designed to estimate the location of mobile nodes. The proposed HLP model is based on a recurrent neural network with long short-term memory cells. The movement history of each person is used in the HLP model to predict their future locations. Experimental results on real traces are used to validate the proposed HLP model. Then, using predicted location information from the HLP model, packet delivery predictability is obtained. Packet delivery predictability represents the possibility that a node will deliver a packet to its destination and is used to select optimal relay nodes to maximize the packet delivery ratio, minimize the packet delivery cost, and reduce delivery latency. In addition, the proposed routing protocol considers social strength for relay selection. To evaluate the HLPRP, we conduct simulations and compare results with other routing protocols, showing that the HLPRP can outperform existing protocols.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Opportunistic and Delay-Tolerant Networks · Human Mobility and Location-Based Analysis · Energy Efficient Wireless Sensor Networks
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
Department of Electrical, Electronic and Computer Engineering, University of Ulsan, Ulsan 44610, Korea
References (37)
Show source-provided references
1. A Survey on Mobile Crowdsensing Systems: Challenges, Solutions, and Opportunities10.1109/COMST.2019.2914030 ↗
2. Mobile crowd sensing—Taxonomy, applications, challenges, and solutions10.1016/j.chb.2018.10.028 ↗
3. Data-Oriented Mobile Crowdsensing: A Comprehensive Survey10.1109/COMST.2019.2910855 ↗
4. When Sharing Economy Meets IoT: Towards Fine-Grained Urban Air Quality Monitoring through Mobile Crowdsensing on Bike-Share System
5. Crowd Sensing Urban Healthy Street Monitoring Based on Mobile Positioning System
6. Mobile crowd sensing based dynamic traffic efficiency framework for urban traffic congestion control
7. Jiang, Z., Zhu, H., Zhou, B., Lu, C., Sun, M., Ma, X., Fan, X., Wang, C., and Chen, L. (2021). CrowdPatrol: A Mobile Crowdsensing Framework for Traffic Violation Hotspot Patrolling. IEEE Trans. Mob. Comput.10.1109/TMC.2021.3110592 ↗
8. Kutsarova, V., and Matskin, M. (2021, January 12–16). Combining Mobile Crowdsensing and Wearable Devices for Managing Alarming Situations. Proceedings of the 2021 IEEE 45th Annual Computers, Software, and Applications Conference (COMPSAC), Madrid, Spain.10.1109/COMPSAC51774.2021.00080 ↗
9. Vahdat, A., and Becker, D. (2000). Epidemic Routing for Partially-Connected Ad Hoc Networks, Duke University. Technical Report CS-2000-06.
10. Garg, P., Kumar, H., Johari, R., Gupta, P., and Bhatia, R. (2018, January 22–23). Enhanced Epidemic Routing Protocol in Delay Tolerant Networks. Proceedings of the 2018 5th International Conference on Signal Processing and Integrated Networks (SPIN), Noida, India.10.1109/SPIN.2018.8474132 ↗
11. Spyropoulos, T., Psounis, K., and Raghavendra, C.S. (2005, January 26). Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks. Proceedings of the 2005 ACM SIGCOMM Workshop on Delay-tolerant Networking, Philadelphia, PA, USA.10.1145/1080139.1080143 ↗
12. Duong, D.V.A., and Yoon, S. (2019, January 16–18). An Efficient Probabilistic Routing Algorithm Based on Limiting The Number of Replications. Proceedings of the 2019 International Conference on Information and Communication Technology Convergence, Jeju Island, Korea.10.1109/ICTC46691.2019.8939947 ↗
13. Lindgren, A., Doria, A., and Schelén, O. (2004). Probabilistic Routing in Intermittently Connected Networks. Service Assurance with Partial and Intermittent Resources, Springer.10.1007/978-3-540-27767-5_24 ↗
14. Haoran, S., Muqing, W., and Yanan, C. (2018, January 7–10). A Community-Based Opportunistic Routing Protocol in Delay Tolerant Networks. Proceedings of the 2018 IEEE 4th International Conference on Computer and Communications (ICCC), Chengdu, China.10.1109/CompComm.2018.8780894 ↗
15. TSIRP: A Temporal Social Interactions-Based Routing Protocol in Opportunistic Mobile Social Networks10.1109/ACCESS.2021.3079443 ↗
16. Fundamentals of Recurrent Neural Network (RNN) and Long Short-Term Memory (LSTM) network10.1016/j.physd.2019.132306 ↗
17. Shi, J., Qiao, C., Koutsonikolas, D., and Challen, G. (2021, August 24). CRAWDAD Dataset Buffalo/Phonelab-Wifi (v. 2016-03-09). Available online: https://crawdad.org/buffalo/phonelab-wifi/20160309.
18. Ahmed, M., Goyal, S., Singh, S., and Gupta, J. (2019, January 19–21). An improved Spray and Wait routing protocol for Delay Tolerant Network. Proceedings of the 2019 2nd IEEE Middle East and North Africa COMMunications Conference (MENACOMM), Manama, Bahrain.10.1109/MENACOMM46666.2019.8988574 ↗
19. Abdajbar, A.N., Mohamed, K.S., and Alias, M.Y. (2019, January 7–9). Link Budget Based Optimised Link State Routing Protocol in Flying Ad-hoc Networks. Proceedings of the 2019 IEEE Conference on Sustainable Utilization and Development in Engineering and Technologies (CSUDET), Penang, Malaysia.10.1109/CSUDET47057.2019.9214608 ↗
20. A Proposed Routing Protocol for Mobile Ad Hoc Networks
21. An adaptive spray and wait routing algorithm based on capability of node in DTN10.12733/jics20103282 ↗
22. Epsoc: Social-based epidemic-based routing protocol in opportunistic mobile social network
23. Raghav, N., and Kumar, A. (2019, January 13–15). Routing Strategy based on Centrality in Opportunistic Networks. Proceedings of the 2019 6th International Conference on Computing for Sustainable Global Development (INDIACom), New Delhi, India.
24. Yim, J., Ahn, H., and Ko, Y.B. (2016, January 4–6). The betweenness centrality based geographic routing protocol for unmanned ground systems. Proceedings of the 10th International Conference on Ubiquitous Information Management and Communication, Danang, Vietnam.10.1145/2857546.2857622 ↗
25. Exploiting Friendship Relations for Efficient Routing in Mobile Social Networks10.1109/TPDS.2012.83 ↗
26. BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks10.1109/TMC.2010.246 ↗
27. Wang, G., Zheng, L., Yan, L., and Zhang, H. (2017, January 27–29). Probabilistic routing algorithm based on transmission capability of nodes in DTN. Proceedings of the 2017 11th IEEE International Conference on Anti-counterfeiting, Security, and Identification, Xiamen, China.10.1109/ICASID.2017.8285762 ↗
28. Binary Spray and wait routing Protocol with controlled replication for DTN based Multi-Layer UAV Ad-hoc network Assisting VANET
29. Kuronuma, Y., Suzuki, H., and Koyama, A. (2017, January 27–29). An Adaptive DTN Routing Protocol Considering Replication State. Proceedings of the 2017 31st International Conference on Advanced Information Networking and Applications Workshops, Taipei, Taiwan.10.1109/WAINA.2017.21 ↗
30. Kaur, H., and Kaur, H. (2017). An enhanced spray-copy-wait DTN routing using optimized delivery predictability. Computer Communication, Networking and Internet Security, Springer.10.1007/978-981-10-3226-4_62 ↗
31. Bonino, D., Alizo, M.T.D., Pastrone, C., and Spirito, M. (2016, January 13–15). WasteApp: Smarter waste recycling for smart citizens. Proceedings of the 2016 International Multidisciplinary Conference on Computer and Energy Science (SpliTech), Split, Croatia.10.1109/SpliTech.2016.7555951 ↗
32. Basta, N., ElNahas, A., Grossmann, H.P., and Abdennadher, S. (2019, January 24–26). A Framework for Social Tie Strength Inference in Vehicular Social Networks. Proceedings of the 2019 Wireless Days (WD), Manchester, UK.10.1109/WD.2019.8734218 ↗
33. Li, C., Jiang, F., Wang, X., and Shen, B. (2016, January 13–15). Optimal relay selection based on social threshold for D2D communications underlay cellular networks. Proceedings of the 2016 8th International Conference on Wireless Communications Signal Processing (WCSP), Yangzhou, China.10.1109/WCSP.2016.7752453 ↗
34. MSN-CDF: New community detection framework to improve routing in mobile social networks10.1002/dac.4989 ↗
35. Gagniuc, P.A. (2017). Markov Chains: From Theory to Implementation and Experimentation, John Wiley & Sons.10.1002/9781119387596 ↗
36. Keränen, A., Ott, J., and Kärkkäinen, T. (2009, January 2–6). The ONE Simulator for DTN Protocol Evaluation. Proceedings of the SIMUTools ’09: Proceedings of the 2nd International Conference on Simulation Tools and Techniques, Rome, Italy.10.4108/ICST.SIMUTOOLS2009.5674 ↗
37. Shi, J., Meng, L., Striegel, A., Qiao, C., Koutsonikolas, D., and Challen, G. (2016, January 10–14). A walk on the client side: Monitoring enterprise Wifi networks using smartphone channel scans. Proceedings of the IEEE INFOCOM 2016—The 35th Annual IEEE International Conference on Computer Communications, San Francisco, CA, USA.10.1109/INFOCOM.2016.7524453 ↗