Search

With rapid proliferation of radio technology, discontinuous spectrum aggregation and access in a single radio has become conceivable. When the bandwidth of the spectrum fragment is narrow, then spectrum aggregation can be utilized to bundle multiple small fragments in one radio. This can positively improve the efficiency of the spectrum utilization. Though, aggregation of fragmented segments leads to improved spectrum utilization it results in further spectrum fragmentation leading to practical hardware constraints. As a solution, we use the popular memory allocation techniques to perform spectrum aggregation so that further fragmentation can be reduced. We derive at an efficient Spectrum Aggregation Algorithm based on Memory Allocation techniques.

Traffic management has been and remains a significant issue, particularly in urban regions with elevated vehicle density. Adoption of an intelligent transport system (ITS) has extensively experimented to curb the traffic threat with blended experiences as a result. By communicating with other vehicles traveling on the same road in the form of clusters, an ad hoc vehicle network (VANET) forms and ITS that can allow vehicles with less human input to cooperate. By considering the elevated mobility nature of cars in VANET, this article provides a solution to the primary threat of VANET clustering by embracing the flexibility of fuzzy logics for cluster formation on a multilane urban high way. It also demonstrates that cluster stability is enhanced by performing the cluster head (CH) selection process based on a mixture of fuzzy logic, lane weighting, and utility function with the fuzzy membership function adjusted to boost cluster stability.

Due to the prospective implementation in many fields, study functionality in the wireless sensor network has risen very impressively in recent years. Wireless large-scale sensor networks contain various sources and various sink numbers. This plays a significant part in application performance. To this end, we will concentrate on the primary issue of sink arrangement in this study to minimize time delay in the worst scenario as well as to increase the lifespan of the wireless sensor network. Here we suggest an interconnected anatomy frame for calculating the mobility of the junction sink, routing details. We're talking about the causes of sub problems and bringing them efficient results. Then we combine all these outcomes and suggest the real issue with the optimum polynomial-time algorithm. From this consequence, the merits of involving nodes (mobile sink) and network argument or parametric quantity impact will be displayed. (Example: various sensors, sinks and time delay bound) the lifespan of the network. As we understand, Wireless sensor network nodes are battery-dependent equipment that collects information from the surroundings and send this (information) information to the sink node for further computational processing leading to energy dissipation in batteries The batteries are non-rechargeable or in certain settings it may be hard to replace or recharge. These problems result in the design of a new algorithm for node energy efficiency In typical conditions, the sensor nodes display many to one communication with the sink, resulting in a faster energy depletion of the nodes near the sink, commonly referred to as the energy deficiency hole problem or the hot spot problem. hence in this situation, the mobility of the sink can help in balancing of energy dissipation of the sensor nodes In wireless sensor network when information data hold up by working sink it should be Bounded. Our results show that the proposed algorithm can work better than previous methods and yield results in remote locations such as in the wide region of the wireless sensor network, lake, mountains, hill stations, etc. Additional guideline antennas can boost the transfer chain, which increases to lower hops and low routing delays. Finally, numerical studies analyze the suggested work and simulations are performed to validate through MATLAB.