Prediction of Link Failure in MANET-IoT Using Fuzzy Linear Regression

A Mobile Ad-hoc NETwork(MANET)contains numerous mobile nodes,and it forms a structure-less network associated with wireless links.But,the node movement is the key feature of MANETs;hence,the quick action of the nodes guides a link failure.This link failure creates more data packet drops that can cause a long time delay.As a result,measuring accurate link failure time is the key factor in the MANET.This paper presents a Fuzzy Linear Regression Method to measure Link Failure(FLRLF)and provide an optimal route in the MANET-Internet of Things(IoT).This work aims to predict link failure and improve routing efficiency in MANET.The Fuzzy Linear Regression Method(FLRM)measures the long lifespan link based on the link failure.The mobile node group is built by the Received Signal Strength(RSS).The Hill Climbing(HC)method selects the Group Leader(GL)based on node mobility,node degree and node energy.Additionally,it uses a Data Gathering node forward the infor-mation from GL to the sink node through multiple GL.The GL is identified by linking lifespan and energy using the Particle Swarm Optimization(PSO)algo-rithm.The simulation results demonstrate that the FLRLF approach increases the GL lifespan and minimizes the link failure time in the MANET.

LBLP:Link-Clustering-Based Approach for Overlapping Community Detection

Recently, complex networks have attracted considerable research attention. Community detection is an important problem in the field of complex networks and is useful in a variety of applications such as information propagation, link prediction, recommendation, and marketing. In this study, we focus on discovering overlapping community structures by using link partitions. We propose a Latent Dirichlet Allocation （LDA）-Based Link Partition （LBLP） method, which can find communities with an adjustable range of overlapping. This method employs the LDA model to detect link partitions, which can calculate the community belonging factor for each link. On the basis of this factor, link partitions with bridge links can be found efficiently. We validate the effectiveness of the proposed solution by using both real-world and synthesized networks. The experimental results demonstrate that the approach can find a meaningful and relevant link community structure.

A capability matching and ontology reasoning method for high precision OGC web service discovery

Finding the right spatially aware web service in a heterogeneous distributed environment using criteria such as service type,version,time,space,and scale has become a challenge in the integration of geospatial information services.A new method for retrieving Open Geospatial Consortium(OGC)Web Service(OWS)that deals with this challenge using page crawling,link detection,service capability matching,and ontology reasoning,is described in this paper.Its major components are distributed OWS,the OWS search engine,the OWS ontology generator,the ontology-based OWS catalog service,and the ontology-based multi-protocol OWS client.Experimental results show that the execution time of this proposed method equals only 0.26 of that of Nutch’s method.In addition,the precision is much higher.Moreover,this proposed method can carry out complex OWS reasoning-based queries.It is being used successfully for the Antarctica multi-protocol OWS portal of the Geo-Information Web Service Portal of the Polar.

Hidden Process Offline Forensic Based on Memory Analysis in Windows

Malicious software programs usually bypass the detection of anti-virus software by hiding themselves among apparently legitimate programs.In this work,we propose Windows Virtual Machine Introspection（WVMI）to accurately detect those hidden processes by analyzing memory data.WVMI dumps in-memory data of the target Windows operating systems from hypervisor and retrieves EPROCESS structures’address of process linked list first,and then generates Data Type Confidence Table（DTCT）.Next,it traverses the memory and identifies the similarities between the nodes in process linked list and the corresponding segments in the memory by utilizing DTCT.Finally,it locates the segments of Windows’EPROCESS and identifies the hidden processes by further comparison.Through extensive experiments,our experiment shows that the WVMI detects the hidden process with high identification rate,and it is independent of different versions of Windows operating system.