Optimizing the beacon exchange rate for proactive autonomic configuration in ubiquitous MANETs

Proactive self-configuration is indispensable for MANETs like ubiquitous sensor networks (USNs), as component devices of the network are usually exposed to natural or man-made disasters due to the hostile deployment and ad hoc nature of the USNs. Network state beacons (NSBs) are exchanged among the key nodes of the network for crucial and effective monitoring of the network for steady state operation. The rate of beacon exchange (F/sub E/) and its contents, define the time and nature of the proactive action. Therefore it is very important to optimize these parameters to tune the functional response of the USN. This paper presents a comprehensive model for monitoring and proactively reconfiguring the network by optimizing the F/sub E/. The results confirm the improved throughput while maintaining QoS over longer periods of network operation

Distributed and Load-Adaptive Self Configuration in Sensor Networks

Proactive self-configuration is crucial for MANETs such as sensor networks, as these are often deployed in hostile environments and are ad hoc in nature. The dynamic architecture of the network is monitored by exchanging so-called Network State Beacons (NSBs) between key network nodes. The Beacon Exchange rate and the network state define both the time and nature of a proactive action to combat network performance degradation at a time of crisis. It is thus essential to optimize these parameters for the dynamic load profile of the network. This paper presents a novel distributed adaptive optimization Beacon Exchange selection model which considers distributed network load for energy efficient monitoring and proactive reconfiguration of the network. The results show an improvement of 70% in throughput, while maintaining a guaranteed quality-of- service for a small control-traffic overhead

Cross-compiler bipartite vulnerability search

Open-source libraries are widely used in software development, and the functions from these libraries may contain security vulnerabilities that can provide gateways for attackers. This paper provides a function similarity technique to identify vulnerable functions in compiled programs and proposes a new technique called Cross-Compiler Bipartite Vulnerability Search (CCBVS). CCBVS uses a novel training process, and bipartite matching to filter SVM model false positives to improve the quality of similar function identification. This research uses debug symbols in programs compiled from open-source software products to generate the ground truth. This automatic extraction of ground truth allows experimentation with a wide range of programs. The results presented in the paper show that an SVM model trained on a wide variety of programs compiled for Windows and Linux, x86 and Intel 64 architectures can be used to predict function similarity and that the use of bipartite matching substantially improves the function similarity matching performance. © 2021 by the authors. Licensee MDPI, Basel, Switzerland

Optimising Network Control Traffic in Resource Constrained MANETS

The exchange of Network State Beacons (NSBs) is crucial to monitoring the dynamic state of MANETs like sensor networks. The rate of beacon exchange (FX) and the network state define both the time and nature of a proactive action to reconfigure the network in order to combat network performance degradation at a time of crisis. It is thus essential to select the FX within optimized bounds, so that minimal control traffic is incurred due to state maintenance and reconfiguration activities. This paper presents a novel distributed model that selects optimized bounds for FX selection and adapts dynamically to the load profile of the network for energy efficient monitoring and proactive reconfiguration

Coverage Characteristics of Symmetric Topologies for Pervasive Sensor Networks

The success of pervasive computing environments comprising ubiquitous loco-dynamic sensing devices is very dependent upon the coverage characteristics (CCs) of the network topology. These characteristics include blanket coverage, network density, affects on surrounding environments and intra-sensor coverage overlaps. This paper presents a systematic mathematical model to quantitatively investigate the effects of CCs and provides a comparison with other well used topologies e.g. hexagonal, triangular and square grid. The paper uses connectivity, density saturation, conflict regions and effectiveness of the topology as quality parameters in simulation studies for a disaster recovery network in various irregular terrains. Numerical as well as simulation results confirm the improved performance of hexagonal topology (HT) in terms of the above mentioned quality parameters which can be used to tune the network design to ensure the required QoS throughout the life of the network

Adaptive Self-Configuration for Distributed Load in Sensor Networks

The dynamic architecture of the network is monitored by exchanging so-called Network State Beacons (NSBs) between key network nodes. The Beacon Exchange rate and the network state define both the time and nature of a proactive action to combat network performance degradation at a time of crisis. It is thus essential to select and update the beacon exchange rate (FX) according to the variations in the load profile of the network. This paper presents a novel localized method that for selecting and updating the FX by adapting to the network load and energy constraints. The results indicating that the model reconfigures the network more effectively to achieve higher throughput as well as greater network integrity, with minimal resource overheads

Dynamic symmetrical topology models for pervasive sensor networks

The success of pervasive computing environments using ubiquitous loco-dynamic sensing devices is very dependent upon the sensor deployment topology (DT) employed. This paper presents a systematic mathematical model for efficient sensor deployment and provides a comparison with other popular topologies. The model focuses upon blanket coverage of a surveillance area using a minimum number of sensing devices, with minimal infra-sensor overlapping to reduce collisions and co-existence problems. Simulation results are presented for the hexagonal, triangular and square grid topologies for various dimensions of surveillance area. The results confirm that the hexagonal model gives optimal performance in terms of requiring the minimal number of sensors. The paper also highlights the improved performance of ubiquitous wireless sensor networks when a hexagonal topology (HT) is used

“I am your perfect online partner" analysis of dating profiles used in cybercrime

Internet Online Dating has become an influential mainstream social practice facilitating the finding of a partner. Unscrupulous operators have identified its potential and started to use this platform for identity theft in form of so called Online Romance Scams. Quickly, this cybercrime has become very successful and thus, an increasing threat in the social networking environment. So far, very little is known about its structure and the reason for its success, and this needs to be known in order to be able to fight it efficiently. This research tries to contribute to this knowledge, and argues that scammers use so-called ‘Love Stories’, which represent personal affinities related to romantic relationships, to their benefit when tailoring common narratives as part of fraudulent online profiles to attract their victims. We look at these different types of ‘Personal Love Stories’ and discuss how they can be used in this type of scam, followed by a qualitative analysis of fraudulent profiles from three different international websites to examine this assumptio

How to Improve Postgenomic Knowledge Discovery Using Imputation

While microarrays make it feasible to rapidly investigate many complex biological problems, their multistep fabrication has the proclivity for error at every stage. The standard tactic has been to either ignore or regard erroneous gene readings as missing values, though this assumption can exert a major influence upon postgenomic knowledge discovery methods like gene selection and gene regulatory network (GRN) reconstruction. This has been the catalyst for a raft of new flexible imputation algorithms including local least square impute and the recent heuristic collateral missing value imputation, which exploit the biological transactional behaviour of functionally correlated genes to afford accurate missing value estimation. This paper examines the influence of missing value imputation techniques upon postgenomic knowledge inference methods with results for various algorithms consistently corroborating that instead of ignoring missing values, recycling microarray data by flexible and robust imputation can provide substantial performance benefits for subsequent downstream procedures