Research on Cooperative Communication Strategy and Intelligent Agent Directional Source Grouping Algorithms for Internet of Things

Yongyan Zou, Yanzhi Zhang and Xin Yi
Additional contact information
Yongyan Zou: Electrical & Information Engineering Department, Sichuan Engineering Technical College, Deyang 618000, Sichuan, China
Yanzhi Zhang: Electrical & Information Engineering Department, Sichuan Engineering Technical College, Deyang 618000, Sichuan, China
Xin Yi: Electrical & Information Engineering Department, Sichuan Engineering Technical College, Deyang 618000, Sichuan, China

Future Internet, 2019, vol. 11, issue 11, 1-20

Abstract: In order to improve the network layer of the Internet of things to improve transmission reliability, save time delay and energy consumption, the Internet of things cooperative communication and intelligent agent technology were studied in this paper. In cooperative communication, a new cooperative communication algorithm KCN (k-cooperative node), and a reliability prediction model are proposed. The k value is determined by the end-to-end reliability. After k cooperative nodes are selected, other nodes enter dormancy. In aggregate traffic allocation, game theory is used to model the traffic equilibrium and end-to-end delay optimization scenarios. In practice, the optimal duty cycle can be calculated, which makes some cooperative nodes enter an idle state to save energy. Under the premise of guaranteeing end-to-end delay, it is shown that the reliability of the proposed KCN algorithm is better than that of the other existing routing protocols. In the aspect of intelligent agent, a Directional source grouping based multi-Agent Itinerary Planning (D-MIP) is proposed. This algorithm studies the routing problem of multi-agent parallel access to multiple source nodes. A directed source packet multi-agent routing planning algorithm is proposed. The iterative algorithm of each source node is limited to a sector, and the optimal intelligent agent route is obtained by selecting an appropriate angle. Compared with other algorithms, it is shown through a lot of simulated results that energy consumption and time delay has been saved by the proposed D-MIP algorithm.

Keywords: intelligent agent algorithms; internet of things (IoT); cooperative communication; routing protocol; duty cycle; game theory; directional source grouping (search for similar items in EconPapers)
JEL-codes: O3 (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/1999-5903/11/11/233/pdf (application/pdf)
https://www.mdpi.com/1999-5903/11/11/233/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jftint:v:11:y:2019:i:11:p:233-:d:282739

Access Statistics for this article

Future Internet is currently edited by Ms. Grace You

More articles in Future Internet from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().