In this article an Archimedean spiral antenna is designed and analyzed that has good operation in broadband application. By analyzing this design, the effects that different parameters have on antenna operation will be studied and ways of optimization will be found. In More
In this article an Archimedean spiral antenna is designed and analyzed that has good operation in broadband application. By analyzing this design, the effects that different parameters have on antenna operation will be studied and ways of optimization will be found. Influences of cavity height and number of turns to obtain good matching and gain in a frequency interval of 4 to 18 GHz will be discussed. In addition, using cavity wall around the antenna, side lobes are decreased or deleted. By tapering the arms at feeding center, better matching will be attained. For making S11 bandwidth better, increasing the cavity height or reducing the number of turns can be used. Changing number of turns does not have a significant effect on the gain. To improve the antenna gain, the cavity height needs to be adjusted such that the reflected wave from cavity and radiated wave from spiral arms are constructing.
Manuscript profile
The wireless sensor network includes a number of fixed sensor nodes that move sink nodes to collect data between nodes. To reduce energy consumption and increase the value of collected data, it is necessary to determine the optimum route and residence location of mobile More
The wireless sensor network includes a number of fixed sensor nodes that move sink nodes to collect data between nodes. To reduce energy consumption and increase the value of collected data, it is necessary to determine the optimum route and residence location of mobile sinks, which increases the life of wireless sensor networks. Using network coding, this paper presents a Mixed Integer Linear Programming Model to determine the optimal multicast routing of source sensor nodes to mobile sinks in wireless sensor networks, which determines the time and location of sinks to collect maximum coded data and reduces the delay in sink movement and energy consumption. Solving this problem in polynomial time is not possible due to the involvement of various parameters and the constrained resources of wireless sensor networks. Therefore, several exploratory and greedy and fully distributed algorithms are proposed to determine the movement of sinks and their residence location based on maximizing the value of coded data and the type of data dead time. By simulating, the optimal method and the use of coding and proposed algorithms, reduce the runtime and energy consumption and increase the value of collected data and network lifetime than non-coding methods.
Manuscript profile