World Wide Web is a vast resource of data growing continuously. Nowadays, it becomes increasingly hard for users to retrieve useful data due to the continually rapid growth in data volume. This vast amount of data is making search more and more difficult with traditional search engine as they return huge data for a given query which is consisting of relevant as well as irrelevant data. This is not only results in wastage of user time but also lead to data overload problem. So, users are not satisfied with searching the information by traditional search engine. So the problem of re-ranking search pages or results has become one of the main problems in IR field. Currently searching methods are mainly based on keyword matching technique but this technique has some weaknesses. The first weakness is that web users cannot express their search intention accurately or properly using several keywords. So most of the time, the exactly matched results do not satisfy the web users. Second weakness is that keyword matching cannot sure the selected candidates have high correlation with the user's query, given the different meanings of the keywords. Another problem about traditional search engines is their ranking methods. To fulfil the requirement of users we are using Semantic search engine with page ranking algorithm which will search the data semantically and holds the capability to re-rank search results effectively and try the best to arrange the web results which are most relevant for the users. The proposed algorithm for page ranking is based on result of semantic web with user attention time.
20 December 2022 in International Journal of Communication Systems
In mission-critical environments, designing efficient routing protocols for unmanned aerial vehicles (UAVs) is challenging due to limited energy resources, high-speed mobility, and highly dynamic link conditions. This paper proposes a hierarchical routing framework, termed hierarchically coordinated proximal multi-hop routing (HCPMR) scheme, which integrates multi-agent proximal policy optimization (MAPPO) with graph neural networks (GNNs) to enable scalable, stable, and energy-efficient UAV communication. HCPMR organizes UAVs into energy- and stability-aware clusters, where GNN- assisted intra-cluster coordination is performed by cluster leaders, who also manage inter-cluster routing through periodically synchronized exchanges under a centralized training and decentralized execution (CTDE) paradigm. GNN-based embeddings allow UAVs to capture spatial dependencies within their local neighbourhoods, enabling adaptive routing with reduced control overhead, enhanced reliability, and improved energy efficiency. The proposed scheme incorporates a multi-objective reward function to jointly optimize energy consumption, fairness, delivery reliability, and terrain adaptability. Simulation results using NS-3/ns3-gym across urban, desert, and mountainous scenarios demonstrate that HCPMR increases packet delivery ratio by 6.5% compared to coordinated Q-learning-based multi-hop routing (CQMR) and by 16% compared to improved Q-learning–based multi-hop routing (IQMR). Moreover, HCPMR achieves approximately 13% higher residual energy than CQMR and 58% higher than IQMR, while reducing control overhead by 20% and 38.5%, respectively. These results establish HCPMR as an adaptive and efficient routing framework for dynamic FANETs in mission-critical operations, effectively enhancing routing decisions through GNN-driven embeddings and MAPPO-based coordination.