Multi-agent itinerary planning for wireless sensor networks book

Energy efficient and reliable data dissemination in wireless sensor network is an important research issue since the network consists of low cost nodes with limited resources. Report by international journal of communication networks and information security ijcnis. Directional source grouping for multiagent itinerary planning i n wireless sensor networks abstract. Optimal itinerary planning for mobile multiple agents in wsn. Abstractmulti mobile agents based on data collection and aggregations have proved their effective in wireless sensor networks wsn. Wireless sensor network, data gathering, mobile agent, multiagent, itinerary planning. Intelligent communication in wireless sensor networks mdpi. Second, we present a novel routing itinerary algorithm. Existing multiagent itinerary algorithms are either timeconsuming, or too complicated to realize in reality. Wireless sensor network, data gathering, mobile agent, multi agent, itinerary planning.

Wireless sensor networks wsn are designed to collect information by means of a large number of energylimited battery sensor nodes. Energyefficient itinerary planning for multiple mobile agent emip. Therefore, it is important to minimize the energy consumed by each sensor, in order to extend the network life. Mobile agent mabased wireless sensor networks present a good alternative. Multiagent itinerary planning for sensor networks invited paper 1min chen, 2 sergio gonzlez, 3 yan zhang, 2victor c. Despite the advantages of multiagent itinerary planning, finding the. Directional source grouping for multiagent itinerary planning i n wireless sensor networks. The simulation result clearly shows that our novel approach performs better. In this paper, we propose multimobile agent itinerary planningbased energy and fault aware data aggregation in wireless sensor networks maef to plan itineraries for mas. Pdf recently, wireless sensor networks have employed the concept of mobile agent to.

Recently, wireless sensor networks have employed the concept of. First, we build a multiagent based distributed wsn dwsn model. While most of existing work focus on designing various single agent based itinerary planning sip algorithms by considering energyefficiency andor aggregation efficiency, this paper identifies the drawbacks of this approach in large scale network, and proposes a solution through. A novel framework is presented to divide our mip algorithm into four parts. This paper proposes a novel mipbased data gathering. Agentbased data collection and aggregation have been proved to be efficient in wireless sensor networks wsns. Pdf multimobile agent itinerary planning algorithms for data. Multiagent itinerary planning for wireless sensor networks. Wireless algorithms, systems, and applications acheter. A novel routing algorithm for wireless sensor network. The goal of this work is to design an intelligent wsn that collects as much information as possible to process it intelligently. Multiple mobile agents based data dissemination protocol. Thus, using multiagent itinerary planning overcomes the drawbacks of. As software entities that migrate among nodes, mobile agents mas are able to deliver and execute codes for flexible application retasking, local processing, and collaborative signal and information processing.

Determination of itinerary planning for multiple agents in. Request pdf multiagent itinerary planning for wireless sensor networks agentbased data collection and aggregation have been proved to be efficient in wireless sensor networks wsns. This paper presents a new immune inspired algorithm, the clonal selection algorithm for multiagent itinerary planning csamip, to solve the mip problem in wireless sensor networks. Multimobile agent itinerary planning algorithms for. Disjoint multi mobile agent itinerary planning for big data. Computers and internet algorithms research applied research energy consumption energy efficiency multiagent systems sensors innovations usage wireless sensor networks. While most of existing work focus on designing various single agent based itinerary planning sip algorithms by considering energyefficiency andor aggregation efficiency, this paper identifies the drawbacks of this approach in large scale network, and proposes a. Request pdf multiagent itinerary planning for wireless sensor networks. Balanced itinerary planning for multiple mobile agents in. This can be achieved by grouping nodes in clusters and planning itineraries efficiently among cluster heads chs only. Multimobile agent itinerary planningbased energy and fault aware. Directional source grouping for multiagent itinerary.

384 551 163 283 1507 690 750 437 1224 457 227 623 681 912 464 1320 1116 514 1399 208 95 859 859 988 325 767 983 1314 1575 602 1306 1410 1084 1122 132 421 1292 450 483 1121 481 225 1142 1378 1233