{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T14:19:13Z","timestamp":1766067553242,"version":"3.41.0"},"reference-count":27,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2022,12,20]],"date-time":"2022-12-20T00:00:00Z","timestamp":1671494400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Sen. Netw."],"published-print":{"date-parts":[[2023,5,31]]},"abstract":"<jats:p>The Internet of Behavior is the recent trend in the Internet of Things (IoT), which analyzes the behaviour of individuals using huge amounts of data collected from their activities. The behavioural data collection process from an individual to a data center in the network layer of the IoT is addressed by the Routing Protocol for Low-powered Lossy Networks (RPL) downward routing policy. A hybrid mode of operation in RPL is designed to minimize the limitations of standard modes of operations in the downward routing of RPL. The existing hybrid modes use the common parameters, such as routing table capacity, energy level, and hop-count for making storing mode decisions at each node. However, none of these works have utilized the deciding parameters, such as number of Destination-Oriented Directed Acyclic Graph (DODAG) children, rank, and transmission traffic density for this purpose. In this article, we propose two hybrid MOPs for RPL focusing on the aspect of efficient downward communication for the Internet of Behaviors. The first version decides the mode of each node based on the rank and number of DODAG children of the node. In addition, the proposed Mode of Operation (MOP) has the provision to balance the task of a storing node that is currently running on low power and computational resources by a handover mechanism among the ancestors. The second version of the hybrid MOP utilizes the upward and downward transmission traffic probabilities together with 170 rule or 1D cellular automata to decide the operating mode of a node. The analysis on the upper bound on communication shows that both proposed works have communication overhead nearly equal to the storing mode. The experimental results also infer that the proposed adaptive MOP have lower communication overhead compared with standard storing modes and existing schemes ARPL, MERPL, and HIMOPD.<\/jats:p>","DOI":"10.1145\/3548686","type":"journal-article","created":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T11:43:04Z","timestamp":1658317384000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Hybrid Mode of Operation Schemes for P2P Communication to Analyze End-Point Individual Behaviour in IoT"],"prefix":"10.1145","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5461-7845","authenticated-orcid":false,"given":"Alekha Kumar","family":"Mishra","sequence":"first","affiliation":[{"name":"National Institute of Technology Jamshedpur, Adityapur, Jamshedpur, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0168-3021","authenticated-orcid":false,"given":"Osho","family":"Singh","sequence":"additional","affiliation":[{"name":"National Institute of Technology Jamshedpur, Adityapur, Jamshedpur, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6582-2756","authenticated-orcid":false,"given":"Abhay","family":"Kumar","sequence":"additional","affiliation":[{"name":"National Institute of Technology Jamshedpur, Adityapur, Jamshedpur, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8332-278X","authenticated-orcid":false,"given":"Deepak","family":"Puthal","sequence":"additional","affiliation":[{"name":"Khalifa University, Abu Dhabi, UAE"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6620-9083","authenticated-orcid":false,"given":"Pradip Kumar","family":"Sharma","sequence":"additional","affiliation":[{"name":"University of Aberdeen, Old Aberdeen Campus, Meston Walk, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9863-2054","authenticated-orcid":false,"given":"Biswajeet","family":"Pradhan","sequence":"additional","affiliation":[{"name":"University of Technology Sydney, NSW, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,12,20]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCSRE.2019.8807584"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.scient.2011.05.037"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-15-5341-7_44"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/3036698"},{"key":"e_1_3_1_6_2","first-page":"1","volume-title":"RPL: IPv6 Routing Protocol for Low-Power and Lossy Networks","author":"Brandt A.","year":"2012","unstructured":"A. Brandt, J. Hui, R. Kelsey, P. Levis, K. Pister, R. Struik, J. P. Vasseur, and R. Alexander. 2012. RPL: IPv6 Routing Protocol for Low-Power and Lossy Networks. RFC 6550. 1\u2013157 pages. Retrieved August 1, 2022 fromhttps:\/\/tools.ietf.org\/html\/rfc6550."},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1080\/0144929X.2019.1587001"},{"key":"e_1_3_1_8_2","article-title":"Internet of Behavior (IoB) and explainable AI systems for influencing IoT behavior","author":"Elayan Haya","year":"2021","unstructured":"Haya Elayan, Moayad Aloqaily, and Mohsen Guizani. 2021. Internet of Behavior (IoB) and explainable AI systems for influencing IoT behavior. arXiv preprint arXiv:2109.07239 (2021).","journal-title":"arXiv preprint arXiv:2109.07239"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICON.2013.6781985"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCW.2017.7962723"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2021.3095077"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSEN.2019.2910881"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2017.2751617"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/LCN.2015.7366295"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/2700261"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-017-3964-2"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106854"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2017.2755980"},{"key":"e_1_3_1_19_2","unstructured":"Wolfram MathWorld. Elementary Cellular Automaton. 2022. https:\/\/mathworld.wolfram.com\/ElementaryCellularAutomaton.html."},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1177\/1550147718772533"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2018.10.007"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.011.2000286"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.5120\/6367-8773"},{"key":"e_1_3_1_24_2","first-page":"1","volume-title":"Routing Metrics Used for Path Calculation in Low-Power and Lossy Networks","author":"Vasseur J. P.","year":"2012","unstructured":"J. P. Vasseur, M. Kim, K. Pister, N. Dejean, and D. Barthel. 2012. Routing Metrics Used for Path Calculation in Low-Power and Lossy Networks. RFC 6551. 1\u2013157 pages. Retrieved August 1, 2022 fromhttps:\/\/tools.ietf.org\/html\/rfc6551."},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2019.2939407"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/iSES.2018.00035"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2021.3058573"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSEN.2019.2924153"}],"container-title":["ACM Transactions on Sensor Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3548686","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3548686","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:50:52Z","timestamp":1750182652000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3548686"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,20]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,5,31]]}},"alternative-id":["10.1145\/3548686"],"URL":"https:\/\/doi.org\/10.1145\/3548686","relation":{},"ISSN":["1550-4859","1550-4867"],"issn-type":[{"type":"print","value":"1550-4859"},{"type":"electronic","value":"1550-4867"}],"subject":[],"published":{"date-parts":[[2022,12,20]]},"assertion":[{"value":"2021-09-30","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-07-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-12-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}