Wireless Sensor Network (WSN) is commonly used to collect information from a remote area and one of the most important challenges associated with WSN is to monitor all targets in a given area while maximizing network lifetime. In wireless communication, energy consumption is proportional to the breadth of sensing range and path loss exponent. Hence, the energy consumption of communication can be minimized by varying the sensing range and decreasing the number of messages being sent. Sensing energy can be optimized by reducing the repeated coverage target. In this paper, an Adaptive Sensor Sensing Range (ASSR) technique is proposed to maximize the WSN Lifetime. This work considers a sensor network with an adaptive sensing range that are randomly deployed in the monitoring area. The sensor is adaptive in nature and can be modified in order to save power while achieving maximum time of monitoring to increase the lifetime of WSN network. The objective of ASSR is to find the best sensing range for each sensor to cover all targets in the network, which yields maximize the time of monitoring of all targets and eliminating double sensing for the same target. Experiments were conducted using an NS3 simulator to verify our proposed technique. Results show that ASSR is capable to improve the network lifetime by 20% as compared to other recent techniques in the case of a small network while achieving an 8% improvement for the case of a large networks.
ADAPTIVE RANDOM SPATIAL BASED CHANNEL ESTIMATION (ARSCE) FOR MILLIMETER WAVE ...IJCNCJournal
Millimeter-wave and mMIMO communications are the most essential success systems for next-generation wireless sensor networks to have enormous amounts of accessible throughput and spectrum. Through installing huge antenna arrays at the base station and performing coherent transceiver processing, mMIMO is a potential technology for enhancing the bandwidth efficiency of wireless sensor networks. The use of mmWave frequencies for mMIMO systems solves the problem of high path-loss through offering greater antenna gains. In this work, we provide a design with a random spatial sample structure that incorporates a totally random step before the analogue is received. It contains a totally random step before the analogue received signals are sent into the digital component of the HBF receiver. Adaptive random spatial based channel estimation (ARSCE) is proposed for channel session measurement collection, and an analogue combiner with valves has been used to estimate the signals at each receiving antenna. The proposed optimization problem formulation attempts to discover the orientations and gains of wideband channel routes. In addition, our proposed model has compared to various state-of-art techniques while considering error minimization.
ON THE PERFORMANCE OF INTRUSION DETECTION SYSTEMS WITH HIDDEN MULTILAYER NEUR...IJCNCJournal
Deep learning applications, especially multilayer neural network models, result in network intrusion detection with high accuracy. This study proposes a model that combines a multilayer neural network with Dense Sparse Dense (DSD) multi-stage training to simultaneously improve the criteria related to the performance of intrusion detection systems on a comprehensive dataset UNSW-NB15. We conduct experiments on many neural network models such as Recurrent Neural Network (RNN), Long-Short Term Memory (LSTM), Gated Recurrent Unit (GRU), etc. to evaluate the combined efficiency with each model through many criteria such as accuracy, detection rate, false alarm rate, precision, and F1-Score.
Performance Analysis of Energy Optimized LTE-V2X Networks for Delay Sensitive...IJCNCJournal
Energy-efficient relaying technology in multi-hop data transmission can help the challenges faced in cellular Vehicle-to-Everything (cellular-V2X) communication. However, due to high demand of emergency service requirements of the systems such as Public Protection and Disaster Relief (PPDR), National Security and Public Safety (NSPS), Intelligent Transport System (ITS) etc., least energy consumed user equipment (UEs)/Vehicular-UEs are required which can either run real-time applications or relay the application data. To support these scenarios, we present a high way based system model in rural area and enhance its scope for applying single-hop direct, relay assisted multi-hop cellular-V2X and Store-CarryForward (SCF) modes of uplink data transmission. We compare the performance of three modes of transmissions in terms of overall energy consumption and overall transmission delay with specific delay constraints of VoIP and video applications. With the varying cell radius and irrespective type of applications, our numerical results, validated with ns-3 show that, least energy is always consumed in SCF mode due to its inherent property but applications suffer a lot due to high delay incurred whereas singlehop direct mode shows the reverse. When compared with cellular-V2X mode, overall transmission delay for single-hop direct mode is acceptable within cell radius 600m but beyond that, relay assisted multi-hop cellular-V2X mode always outperforms (with low latency and moderate energy consumption).
AN EFFICIENT INTRUSION DETECTION SYSTEM WITH CUSTOM FEATURES USING FPA-GRADIE...IJCNCJournal
An efficient Intrusion Detection System has to be given high priority while connecting systems with a network to prevent the system before an attack happens. It is a big challenge to the network security group to prevent the system from a variable types of new attacks as technology is growing in parallel. In this paper, an efficient model to detect Intrusion is proposed to predict attacks with high accuracy and less false-negative rate by deriving custom features UNSW-CF by using the benchmark intrusion dataset UNSW-NB15. To reduce the learning complexity, Custom Features are derived and then Significant Features are constructed by applying meta-heuristic FPA (Flower Pollination algorithm) and MRMR (Minimal Redundancy and Maximum Redundancy) which reduces learning time and also increases prediction accuracy. ENC (ElasicNet Classifier), KRRC (Kernel Ridge Regression Classifier), IGBC (Improved Gradient Boosting Classifier) is employed to classify the attacks in the datasets UNSW-CF, UNSW and recorded that UNSW-CF with derived custom features using IGBC integrated with FPA provided high accuracy of 97.38% and a low error rate of 2.16%. Also, the sensitivity and specificity rate for IGB attains a high rate of 97.32% and 97.50% respectively.
A Novel Routing Strategy Towards Achieving Ultra-Low End-to-End Latency in 6G...IJCNCJournal
Compared to 5G, 6G networks will demand even more ambitious reduction in endto-end latency for packet communication. Recent attempts at breaking the barrier of end-to-end millisecond latencies have focused on re-engineering networks using a hybrid approach consisting of an optical-fiber based backbone network architecture coupled with high-speed wireless networks to connect end-devices to the backbone network. In our approach, a wide area network (WAN) is considered with a high-speed optical fiber grid network as its backbone. After messages from a source node enter the backbone network through a local wireless network, these are delivered very fast to an access point in the backbone network closest to the destination node, followed by its transfer to the local wireless network for delivery to the destination node. We propose a novel routing strategy which is based on distributing the messages in the network in such a way that the average queuing delay of the messages through the backbone network is minimized, and also the route discovery time at each router in the backbone network is drastically reduced. Also, multiple messages destined towards a particular destination router in the backbone network are packed together to form a mailbag, allowing further reductions in processing overheads at intermediate routers and pipelining of mailbag formation and route discovery operations in each router. The performance of the proposed approach green based on these ideas has been theoretically analyzed and then simulated using the ns-3 simulator. Our results show that the average end-to-end latency is less than 380 µs (with only 46-79 µs within the backbone network under varying traffic conditions) for a 1 KB packet size, when using a 500 Gbps optical fiber based backbone network laid over a 15 Km × 15 Km area, a 50 Mbps uplink channel from the source to the backbone network, and a 1 Gbps downlink channel from the backbone network to the destination. The significant reduction in end-to-end latency as compared to existing routing solutions clearly demonstrates the potential of our proposed routing strategy for meeting the ultra-low latency requirements of current 5G and future 6G networks, particularly for mobile edge computing (MEC) application scenarios.
Efficient energy, cost reduction, and QoS based routing protocol for wireless...IJECEIAES
Recent developments and widespread in wireless sensor network have led to many routing protocols, many of these protocols consider the efficiency of energy as the ultimate factor to maximize the WSN lifetime. The quality of Service (QoS) requirements for different applications of wireless sensor networks has posed additional challenges. Imaging and data transmission needs both QoS aware routing and energy to ensure the efficient use of sensors. In this paper, we propose an Efficient, Energy-Aware, Least Cost, (ECQSR) quality of service routing protocol for sensor networks which can run efficiently with best-effort traffic processing. The protocol aims to maximize the lifetime of the network out of balancing energy consumption across multiple nodes, by using the concept of service differentiation, finding lower cost by finding the shortest path using nearest neighbor algorithm (NN), also put certain constraints on the delay of the path for real-time data from where link cost that captures energy nodes reserve, energy of the transmission, error rate and other parameters. The results show that the proposed protocol improves the network lifetime and low power consumption.
Mitigation of packet loss with end-to-end delay in wireless body area network...IJECEIAES
The wireless body area network (WBAN) has been proposed to offer a solution to the problem of population ageing, shortage in medical facilities and different chronic diseases. The development of this technology has been further fueled by the demand for real-time application for monitoring these cases in networks. The integrity of communication is constrained by the loss of packets during communication affecting the reliability of WBAN. Mitigating the loss of packets and ensuring the performance of the network is a challenging task that has sparked numerous studies over the years. The WBAN technology as a problem of reducing network lifetime; thus, in this paper, we utilize cooperative routing protocol (CRP) to improve package delivery via end-to-end latency and increase the length of the network lifetime. The end-to-end latency was used as a metric to determine the significance of CRP in WBAN routing protocols. The CRP increased the rate of transmission of packets to the sink and mitigate packet loss. The proposed solution has shown that the end-to-end delay in the WBAN is considerably reduced by applying the cooperative routing protocol. The CRP technique attained a delivery ratio of 0.8176 compared to 0.8118 when transmitting packets in WBAN.
A small vessel detection using a co-located multi-frequency FMCW MIMO radar IJECEIAES
Small vessels detection is a known issue due to its low radar cross section (RCS). An existing shore-based vessel tracking radar is for long-distance commercial vessels detection. Meanwhile, a vessel-mounted radar system known for its reliability has a limitation due to its single radar coverage. The paper presented a co-located frequency modulated continuous waveform (FMCW) maritime radar for small vessel detection utilising a multiple-input multiple-output (MIMO) configuration. The radar behaviour is numerically simulated for detecting a Swerling 1 target which resembles small maritime’s vessels. The simulated MIMO configuration comprised two transmitting and receiving nodes. The proposal is to utilize a multi-frequency FMCW MIMO configuration in a maritime environment by applying the spectrum averaging (SA) to fuse MIMO received signals for range and velocity estimation. The analysis was summarised and displayed in terms of estimation error performance, probability of error and average error. The simulation outcomes an improvement of 2.2 dB for a static target, and 0.1 dB for a moving target, in resulting the 20% probability of range error with the MIMO setup. A moving vessel's effect was observed to degrade the range error estimation performance between 0.6 to 2.7 dB. Meanwhile, the proposed method was proven to improve the 20% probability of velocity error by 1.75 dB. The impact of multi-frequency MIMO was also observed to produce better average error performance.
ADAPTIVE RANDOM SPATIAL BASED CHANNEL ESTIMATION (ARSCE) FOR MILLIMETER WAVE ...IJCNCJournal
Millimeter-wave and mMIMO communications are the most essential success systems for next-generation wireless sensor networks to have enormous amounts of accessible throughput and spectrum. Through installing huge antenna arrays at the base station and performing coherent transceiver processing, mMIMO is a potential technology for enhancing the bandwidth efficiency of wireless sensor networks. The use of mmWave frequencies for mMIMO systems solves the problem of high path-loss through offering greater antenna gains. In this work, we provide a design with a random spatial sample structure that incorporates a totally random step before the analogue is received. It contains a totally random step before the analogue received signals are sent into the digital component of the HBF receiver. Adaptive random spatial based channel estimation (ARSCE) is proposed for channel session measurement collection, and an analogue combiner with valves has been used to estimate the signals at each receiving antenna. The proposed optimization problem formulation attempts to discover the orientations and gains of wideband channel routes. In addition, our proposed model has compared to various state-of-art techniques while considering error minimization.
ON THE PERFORMANCE OF INTRUSION DETECTION SYSTEMS WITH HIDDEN MULTILAYER NEUR...IJCNCJournal
Deep learning applications, especially multilayer neural network models, result in network intrusion detection with high accuracy. This study proposes a model that combines a multilayer neural network with Dense Sparse Dense (DSD) multi-stage training to simultaneously improve the criteria related to the performance of intrusion detection systems on a comprehensive dataset UNSW-NB15. We conduct experiments on many neural network models such as Recurrent Neural Network (RNN), Long-Short Term Memory (LSTM), Gated Recurrent Unit (GRU), etc. to evaluate the combined efficiency with each model through many criteria such as accuracy, detection rate, false alarm rate, precision, and F1-Score.
Performance Analysis of Energy Optimized LTE-V2X Networks for Delay Sensitive...IJCNCJournal
Energy-efficient relaying technology in multi-hop data transmission can help the challenges faced in cellular Vehicle-to-Everything (cellular-V2X) communication. However, due to high demand of emergency service requirements of the systems such as Public Protection and Disaster Relief (PPDR), National Security and Public Safety (NSPS), Intelligent Transport System (ITS) etc., least energy consumed user equipment (UEs)/Vehicular-UEs are required which can either run real-time applications or relay the application data. To support these scenarios, we present a high way based system model in rural area and enhance its scope for applying single-hop direct, relay assisted multi-hop cellular-V2X and Store-CarryForward (SCF) modes of uplink data transmission. We compare the performance of three modes of transmissions in terms of overall energy consumption and overall transmission delay with specific delay constraints of VoIP and video applications. With the varying cell radius and irrespective type of applications, our numerical results, validated with ns-3 show that, least energy is always consumed in SCF mode due to its inherent property but applications suffer a lot due to high delay incurred whereas singlehop direct mode shows the reverse. When compared with cellular-V2X mode, overall transmission delay for single-hop direct mode is acceptable within cell radius 600m but beyond that, relay assisted multi-hop cellular-V2X mode always outperforms (with low latency and moderate energy consumption).
AN EFFICIENT INTRUSION DETECTION SYSTEM WITH CUSTOM FEATURES USING FPA-GRADIE...IJCNCJournal
An efficient Intrusion Detection System has to be given high priority while connecting systems with a network to prevent the system before an attack happens. It is a big challenge to the network security group to prevent the system from a variable types of new attacks as technology is growing in parallel. In this paper, an efficient model to detect Intrusion is proposed to predict attacks with high accuracy and less false-negative rate by deriving custom features UNSW-CF by using the benchmark intrusion dataset UNSW-NB15. To reduce the learning complexity, Custom Features are derived and then Significant Features are constructed by applying meta-heuristic FPA (Flower Pollination algorithm) and MRMR (Minimal Redundancy and Maximum Redundancy) which reduces learning time and also increases prediction accuracy. ENC (ElasicNet Classifier), KRRC (Kernel Ridge Regression Classifier), IGBC (Improved Gradient Boosting Classifier) is employed to classify the attacks in the datasets UNSW-CF, UNSW and recorded that UNSW-CF with derived custom features using IGBC integrated with FPA provided high accuracy of 97.38% and a low error rate of 2.16%. Also, the sensitivity and specificity rate for IGB attains a high rate of 97.32% and 97.50% respectively.
A Novel Routing Strategy Towards Achieving Ultra-Low End-to-End Latency in 6G...IJCNCJournal
Compared to 5G, 6G networks will demand even more ambitious reduction in endto-end latency for packet communication. Recent attempts at breaking the barrier of end-to-end millisecond latencies have focused on re-engineering networks using a hybrid approach consisting of an optical-fiber based backbone network architecture coupled with high-speed wireless networks to connect end-devices to the backbone network. In our approach, a wide area network (WAN) is considered with a high-speed optical fiber grid network as its backbone. After messages from a source node enter the backbone network through a local wireless network, these are delivered very fast to an access point in the backbone network closest to the destination node, followed by its transfer to the local wireless network for delivery to the destination node. We propose a novel routing strategy which is based on distributing the messages in the network in such a way that the average queuing delay of the messages through the backbone network is minimized, and also the route discovery time at each router in the backbone network is drastically reduced. Also, multiple messages destined towards a particular destination router in the backbone network are packed together to form a mailbag, allowing further reductions in processing overheads at intermediate routers and pipelining of mailbag formation and route discovery operations in each router. The performance of the proposed approach green based on these ideas has been theoretically analyzed and then simulated using the ns-3 simulator. Our results show that the average end-to-end latency is less than 380 µs (with only 46-79 µs within the backbone network under varying traffic conditions) for a 1 KB packet size, when using a 500 Gbps optical fiber based backbone network laid over a 15 Km × 15 Km area, a 50 Mbps uplink channel from the source to the backbone network, and a 1 Gbps downlink channel from the backbone network to the destination. The significant reduction in end-to-end latency as compared to existing routing solutions clearly demonstrates the potential of our proposed routing strategy for meeting the ultra-low latency requirements of current 5G and future 6G networks, particularly for mobile edge computing (MEC) application scenarios.
Efficient energy, cost reduction, and QoS based routing protocol for wireless...IJECEIAES
Recent developments and widespread in wireless sensor network have led to many routing protocols, many of these protocols consider the efficiency of energy as the ultimate factor to maximize the WSN lifetime. The quality of Service (QoS) requirements for different applications of wireless sensor networks has posed additional challenges. Imaging and data transmission needs both QoS aware routing and energy to ensure the efficient use of sensors. In this paper, we propose an Efficient, Energy-Aware, Least Cost, (ECQSR) quality of service routing protocol for sensor networks which can run efficiently with best-effort traffic processing. The protocol aims to maximize the lifetime of the network out of balancing energy consumption across multiple nodes, by using the concept of service differentiation, finding lower cost by finding the shortest path using nearest neighbor algorithm (NN), also put certain constraints on the delay of the path for real-time data from where link cost that captures energy nodes reserve, energy of the transmission, error rate and other parameters. The results show that the proposed protocol improves the network lifetime and low power consumption.
Mitigation of packet loss with end-to-end delay in wireless body area network...IJECEIAES
The wireless body area network (WBAN) has been proposed to offer a solution to the problem of population ageing, shortage in medical facilities and different chronic diseases. The development of this technology has been further fueled by the demand for real-time application for monitoring these cases in networks. The integrity of communication is constrained by the loss of packets during communication affecting the reliability of WBAN. Mitigating the loss of packets and ensuring the performance of the network is a challenging task that has sparked numerous studies over the years. The WBAN technology as a problem of reducing network lifetime; thus, in this paper, we utilize cooperative routing protocol (CRP) to improve package delivery via end-to-end latency and increase the length of the network lifetime. The end-to-end latency was used as a metric to determine the significance of CRP in WBAN routing protocols. The CRP increased the rate of transmission of packets to the sink and mitigate packet loss. The proposed solution has shown that the end-to-end delay in the WBAN is considerably reduced by applying the cooperative routing protocol. The CRP technique attained a delivery ratio of 0.8176 compared to 0.8118 when transmitting packets in WBAN.
A small vessel detection using a co-located multi-frequency FMCW MIMO radar IJECEIAES
Small vessels detection is a known issue due to its low radar cross section (RCS). An existing shore-based vessel tracking radar is for long-distance commercial vessels detection. Meanwhile, a vessel-mounted radar system known for its reliability has a limitation due to its single radar coverage. The paper presented a co-located frequency modulated continuous waveform (FMCW) maritime radar for small vessel detection utilising a multiple-input multiple-output (MIMO) configuration. The radar behaviour is numerically simulated for detecting a Swerling 1 target which resembles small maritime’s vessels. The simulated MIMO configuration comprised two transmitting and receiving nodes. The proposal is to utilize a multi-frequency FMCW MIMO configuration in a maritime environment by applying the spectrum averaging (SA) to fuse MIMO received signals for range and velocity estimation. The analysis was summarised and displayed in terms of estimation error performance, probability of error and average error. The simulation outcomes an improvement of 2.2 dB for a static target, and 0.1 dB for a moving target, in resulting the 20% probability of range error with the MIMO setup. A moving vessel's effect was observed to degrade the range error estimation performance between 0.6 to 2.7 dB. Meanwhile, the proposed method was proven to improve the 20% probability of velocity error by 1.75 dB. The impact of multi-frequency MIMO was also observed to produce better average error performance.
Sierpinski carpet fractal monopole antenna for ultra-wideband applications IJECEIAES
Microstrip antenna is broadly used in the modern communication system due to its significant features such as light weight, inexpensive, low profile, and ease of integration with radio frequency devices. The fractal shape is applied in antenna geometry to obtain the ultra-wideband antennas. In this paper, the sierpinski carpet fractal monopole antenna (SCFMA) is developed for base case, first iteration and second iteration to obtain the wideband based on its space filling and self-similar characteristics. The dimension of the monopole patch size is optimized to minimize the overall dimension of the fractal antenna. Moreover, the optimized planar structure is proposed using the microstrip line feed. The monopole antenna is mounted on the FR4 substrate with the thickness of 1.6 mm with loss tangent of 0.02 and relative permittivity of 4.4. The performance of this SCFMA is analyzed in terms of area, bandwidth, return loss, voltage standing wave ratio, radiation pattern and gain. The proposed fractal antenna achieves three different bandwidth ranges such as 2.6-4.0 GHz, 2.5-4.3 GHz and 2.4-4.4 GHz for base case, first and second iteration respectively. The proposed SCFMA is compared with existing fractal antennas to prove the efficiency of the SCFMA design. The area of the SCFMA is 25×20 푚푚 2 , which is less when compared to the existing fractal antennas.
Massive multiple-input multiple-output (MIMO) systems are considered a promising solution to minimize multiuser interference (MUI) based on simple precoding techniques with a massive antenna array at a base station (BS). This paper presents a novel approach of beam division multiple access (BDMA) which BS transmit signals to multiusers at the same time via different beams based on hybrid beamforming and user-beam schedule. With the selection of users whose steering vectors are orthogonal to each other, interference between users is significantly improved. While, the efficiency spectrum of proposed scheme reaches to the performance of fully digital solutions, the multiuser interference is considerably reduced.
A novel optimal small cells deployment for next-generation cellular networks IJECEIAES
Small-cell-deployments have pulled cellular operators to boost coverage and capacity in high-demand areas (for example, downtown hot spots). The location of these small cells (SCs) should be determined in order to achieve successful deployments. In this paper, we propose a new approach that optimizes small cells deployment in cellular networks to achieve three objectives: reduce the total cost of network installation, balancing the allocation of resources, i.e. placement of each SC and their transmitted power, and providing optimal coverage area with a lower amount of interference between adjacent stations. An accurate formula was obtained to determine the optimum number of SC deployment (NSC). Finally, we derive a mathematical expression to calculate the critical-handoff-point (CHP) for neighboring wireless stations.
DESIGN OF A COMPACT CIRCULAR MICROSTRIP PATCH ANTENNA FOR WLAN APPLICATIONS pijans
This paper presents the design of a compact circular microstrip patch antenna for WLAN applications which covers the band 5.15 to 5.825 GHz. The antenna is designed using 1.4mm thick FR-4 (lossy)substrate with relative permittivity 4.4 and a microstrip line feed is used. The radius of the circular patch is chosen as 7.62mm. To reduce the size and enhance the performance of the proposed antenna, a circular slot is loaded on circular patch and a square slot is etched on the ground plane of dimension 30mm×30mm. Design of the antenna is carried out using CST Microsoft Studio Sonimulation Software. The proposed antenna resonates at 5.5 GHz with a wider bandwidth of 702 MHz and it provides low return loss of -31.58 dB, good gain of 3.23 dB and directivity of 4.28 dBi and high efficiency of around 79% against the resonance frequency. The geometry of the proposed circular antenna with reduced size and its various performance parameters such as return loss, bandwidth, VSWR, gain, directivity, efficiency and radiation pattern plots are presented and discussed.
A COMBINATION OF THE INTRUSION DETECTION SYSTEM AND THE OPEN-SOURCE FIREWALL ...IJCNCJournal
There are many security models for computer networks using a combination of Intrusion Detection System and Firewall proposed and deployed in practice. In this paper, we propose and implement a new model of the association between Intrusion Detection System and Firewall operations, which allows Intrusion Detection System to automatically update the firewall filtering rule table whenever it detects a weirdo intrusion. This helps protect the network from attacks from the Internet.
QoS controlled capacity offload optimization in heterogeneous networksjournalBEEI
An efficient resource allocation mechanism in the physical layer of wireless networks ensures that resources such as bandwidth and power are used with high efficiency in spite of low delay and high edge user data rate. Microcells in the network are typically set with bias settings to artificially increase the Signal-to-Interference-Plus-Noise Ratio, thus encouraging users to offload to the microcell. However, the artificial bias settings are tedious and often suboptimal. This work presents a low complexity algorithm for maximization of network capacity with load balancing in a heterogeneous network without the need for bias setting. The small cells were deployed in a grid topology at a selected distance from macrocell to enhance network capacity through coverage overlap. User association and minimum user throughput were incorporated as constraints to enable closer simulation to real word Quality of Service requirements. The results showed that the proposed algorithm was able to maintain less than 10% user drop rate. The proposed algorithm can increase user confidence as well as maintain load balancing, maintain the scalability, and reduce power consumption of the wireless network.
A Novel Handoff Necessity Estimation Approach Based on Travelling DistanceIJAAS Team
Mobility management is one of the most important challenges in Next
Generation Wireless Networks (NGWNs) as it enables users to move across
geographic boundaries of wireless networks. Nowadays, mobile
communications have heterogeneous wireless networks offering variable
coverage and Quality of Service (QoS). The availability of alternatives
generates a problem of occurrence of unnecessary handoff that results in
wastage of network resources. To avoid this, an efficient algorithm needs to
be developed to minimize the unnecessary handoffs. Conventionally,
whenever Wireless Local Area Network (WLAN) connectivity is available,
the mobile node switch from cellular network to wireless local area network
to gain maximum use of high bandwidth and low cost of wireless local area
network as much as possible. But to maintain call quality and minimum
number of call failure, a considerable proportion of these handovers should
be determined. Our algorithm makes the handoff to wireless local area
network only when the Predicted Received Signal Strength (PRSS) falls
below a threshold value and travelling distance inside the wireless local area
network is larger than a threshold distance.Through MATLAB simulation,
we show that our algorithm is able to improve handover performance.
Comparative study between metaheuristic algorithms for internet of things wir...IJECEIAES
Wireless networks are currently used in a wide range of healthcare, military, or environmental applications. Wireless networks contain many nodes and sensors that have many limitations, including limited power, limited processing, and narrow range. Therefore, determining the coordinates of the location of a node of the unknown location at a low cost and a limited treatment is one of the most important challenges facing this field. There are many meta-heuristic algorithms that help in identifying unknown nodes for some known nodes. In this manuscript, hybrid metaheuristic optimization algorithms such as grey wolf optimization and salp swarm algorithm are used to solve localization problem of internet of things (IoT) sensors. Several experiments are conducted on every meta-heuristic optimization algorithm to compare them with the proposed method. The proposed algorithm achieved high accuracy with low error rate (0.001) and low power consumption.
Ieee transactions 2018 on wireless communications Title and Abstracttsysglobalsolutions
Final year BE, B.Tech, ME, M.Tech projects along with our professionals for developing Real Time Applications in Emerging Technologies.
We can support to your final year projects in all domains with latest technologies and simulation tool like NS2, NS3, Glomosim, Opnet, Matlab, IDL, Sumo, Gridsim, Bonita tool & Cloud deployments (Cloudsim, Google App Engine, Amazon Deployment, and Real time Cloud Deployment)also we are support for JOURNAL and CONFERENCE Preparation.
?
TSYS Research and Development.
20/9 Sardar Patel Road, Janaki Complex,
4th Floor, Adyar, Chennai - 20?
Tel : 91 44 42607879, 98411 03123.
Website : http://www.tsysglobalsolutions.com/
http://tsysphdsupport.com/
Performance analysis for Adaptive Subcarriers Allocation in Coherent Optical ...iosrjce
The constraint to satisfy the need of increased bandwidth requirement for high speed applications
with higher performance has been a motivation to work on Optical Orthogonal Frequency division multiplexing
(OOFDM) technique with coherent detection. We implement the coherent optical OFDM (CO-OOFDM)
technique and investigate the effect of the number of sub-carriers on performance over single mode fiber (SMF)
links. To explore improvement in performance adaptive subcarriers has been selected by assigning subcarriers
to user according to the conditions of channel. An adaptive subcarrier allocation has been investigated and
performance comparison for proportional and equal allocation has been carried over.
AN OPTIMUM ENERGY CONSUMPTION HYBRID ALGORITHM FOR XLN STRATEGIC DESIGN IN WSN’SIJCNCJournal
In this paper, X-Layer protocol is originated which executes mobility error prediction (MEP) algorithm to calculate the remaining energy level of each node. This X-Layer protocol structure employs the mobility aware protocol that senses the mobility concerned to each node with the utilization of Ad-hoc On-Demand Distance Vector (AODV), which shares the information or data specific to the distance among individual nodes. With the help of this theory, the neighbour list will be updated only to those nodes which are mobile resulting in less energy consumption when compared to all (static/mobile) other nodes in the network. Apart from the MEP algorithm, clustering head (CH) election algorithm has also been specified to identify the relevant clusters whether they exists within the network region or not. Also clustering multi-hop routing (CMHR) algorithm was implemented in which the node can identify the cluster to which it belongs depending upon the distance from each cluster surrounding the node. Finally comprising the AODV routing protocol with the Two-Ray Ground method, we implement X-Layer protocol structure by considering MAC protocol in accordance to IEEE 802.15.4 to obtain the best results in energy consumption and also by reducing the energy wastage with respect to each node. The effective results had been illustrated through Network Simulator-II platform.
ITA: The Improved Throttled Algorithm of Load Balancing on Cloud ComputingIJCNCJournal
Cloud computing makes the information technology industry boom. It is a great solution for businesses who want to save costs while ensuring the quality of service. One of the key issues that make cloud computing successful is the load balancing technique used in the load balancer to minimize time costs and optimize costs economically. This paper proposes an algorithm to enhance the processing time of tasks so that it can help improve the load balancing capacity on cloud computing. This algorithm, named as Improved Throttled Algorithm (ITA), is an improvement of Throttled Algorithm. The paper uses the Cloud Analyst tool to simulate. The selected algorithms are used to compare: Equally Load, Round Robin, Throttled and TMA. The simulation results show that the proposed algorithm ITA has improved the processing time of tasks, time spent processing requests and reduced the cost of Datacenters compared to the selected popular algorithms as above. The improvement of ITA is because of selecting virtual machines in an index table that is available but in order of priority. It helps response times and processing times remain stable, limits the idling resources, and cloud costs are minimized compared to selected algorithms.
Performance of symmetric and asymmetric links in wireless networks IJECEIAES
Wireless networks are designed to provide the enabling infrastructure for emerging technological advancements. The main characteristics of wireless networks are: Mobility, power constraints, high packet loss, and lower bandwidth. Nodes’ mobility is a crucial consideration for wireless networks, as nodes are moving all the time, and this may result in loss of connectivity in the network. The goal of this work is to explore the effect of replacing the generally held assumption of symmetric radii for wireless networks with asymmetric radii. This replacement may have a direct impact on the connectivity, throughput, and collision avoidance mechanism of mobile networks. The proposed replacement may also impact other mobile protocol’s functionality. In this work, we are mainly concerned with building and maintaining fully connected wireless network with the asymmetric assumption. For this extent, we propose to study the effect of the asymmetric links assumption on the network performance using extensive simulation experiments. Extensive simulation experiments were performed to measure the impact of these parameters. Finally, a resource allocation scheme for wireless networks is proposed for the dual rate scenario. The performance of the proposed framework is evaluated using simulation.
COMPARATIVE PERFORMANCE ASSESSMENT OF VBLAST ENCODED 8×8 MIMO MC-CDMA WIRELES...pijans
The bit error rate performance of a V-Blast encoded 8x8 MIMO MC-CDMA wireless communication system
for different signal detection (MMSE and ZF) and digital modulation (BPSK, QPSK, DPSK, and 4QAM)
schemes for grayscale image transmission has been investigated in this paper. The proposed wireless system
employ ½-rated Convolution and cyclic redundancy check (CRC) channel encoding over the AWGN channel
and Walsh Hadamard code as an orthogonal spread code. The present Matlab based simulation study
demonstrates that the V-Blast encoded 8×8 MIMO MC-CDMA wireless system with the employment of 1⁄2-
rated convolution and cyclic redundancy check (CRC) channel encoding strategies shows good performance
utilizing BPSK digital modulation and ZF signal detection scheme in grayscale image transmission
Congestion in Wireless Sensor Networks has negative impact on the Quality of Service.
Congestion effects the performance metrics, namely throughput and per-packet energy
consumption, network lifetime and packet delivery ratio. Reducing congestion allows better
utilization of the network resources and thus enhances the Quality of Service metrics of the
network. Traffic Aware Dynamic Routing to Alleviate Congestion in Wireless Sensor Networks
reduces congestion by considering one hop neighbor routing in the network. This paper
proposed an algorithm for Quality of Service Based Traffic-Aware Data forwarding for
congestion control in wireless sensor networks based on two hop neighbor information. On
detection of congestion, the algorithm forwards data packets around the congestion areas by
spreading the excessive packets through multiple paths. The path with light load or under
loaded nodes is efficiently utilized whenever congestion occurs. The main aspect of the
algorithm is to build path to the destination using two independent potential fields depth and
queue length. Queue length field solves the traffic-aware problem. Depth field creates a
backbone to forward packets to the sink. Both fields are combined to yield a hybrid potential
field to make dynamic decision for data forwarding. Network Simulator used for simulating the
algorithm is NS2. The proposed algorithm performs better.
ENERGY EFFICIENT APPROACH BASED ON EVOLUTIONARY ALGORITHM FOR COVERAGE CONTRO...ijcseit
Coverage and connectivity are two important requirements in Wireless Sensor Networks (WSNs). In this
paper, we address the problem of network coverage and connectivity and propose an energy efficient
approach based on genetic evolutionary algorithm for maintaining coverage and connectivity where the
sensor nodes can have different sensing ranges and transmission ranges. The proposed algorithm is
simulated and it' efficiency is demonstrated via different experiments.
International Journal of Computer Science, Engineering and Information Techno...ijcseit
Coverage and connectivity are two important requirements in Wireless Sensor Networks (WSNs). In this paper, we address the problem of network coverage and connectivity and propose an energy efficient approach based on genetic evolutionary algorithm for maintaining coverage and connectivity where the sensor nodes can have different sensing ranges and transmission ranges .The proposed algorithm is simulated and it' efficiency
is demonstrated via different experiments.
Energy efficient approach based on evolutionary algorithm for coverage contro...ijcseit
Coverage and connectivity are two important requirements in Wireless Sensor Networks (WSNs). In this
paper, we address the problem of network coverage and connectivity and propose an energy efficient
approach based on genetic evolutionary algorithm for maintaining coverage and connectivity where the
sensor nodes can have different sensing ranges and transmission ranges. The proposed algorithm is
simulated and it' efficiency is demonstrated via different experiments.
Increasing the Network life Time by Simulated Annealing Algorithm in WSN wit...ijasuc
Since we are not able to replace the battery in a wireless sensor networks (WSNs), the issues
of energy and lifetime are the most important parameters. In asymmetrical networks, different sensors
with various abilities are used. Super nodes, with higher power and wider range of communication in
comparison with common sensors, are used to cause connectivity and transmit data to base stations in
these networks. It is crucial to select the parameters of fit function and monitoring sensors optimally in a
point covering network. In this paper, we utilized an algorithm to select monitoring sensors. The
selection is done by using a novel algorithm that used by simulated annealing. This selection takes
remained energy into consideration. This method increases lifetime, decreases and balances energy
consumption as confirmed by simulation results.
Sierpinski carpet fractal monopole antenna for ultra-wideband applications IJECEIAES
Microstrip antenna is broadly used in the modern communication system due to its significant features such as light weight, inexpensive, low profile, and ease of integration with radio frequency devices. The fractal shape is applied in antenna geometry to obtain the ultra-wideband antennas. In this paper, the sierpinski carpet fractal monopole antenna (SCFMA) is developed for base case, first iteration and second iteration to obtain the wideband based on its space filling and self-similar characteristics. The dimension of the monopole patch size is optimized to minimize the overall dimension of the fractal antenna. Moreover, the optimized planar structure is proposed using the microstrip line feed. The monopole antenna is mounted on the FR4 substrate with the thickness of 1.6 mm with loss tangent of 0.02 and relative permittivity of 4.4. The performance of this SCFMA is analyzed in terms of area, bandwidth, return loss, voltage standing wave ratio, radiation pattern and gain. The proposed fractal antenna achieves three different bandwidth ranges such as 2.6-4.0 GHz, 2.5-4.3 GHz and 2.4-4.4 GHz for base case, first and second iteration respectively. The proposed SCFMA is compared with existing fractal antennas to prove the efficiency of the SCFMA design. The area of the SCFMA is 25×20 푚푚 2 , which is less when compared to the existing fractal antennas.
Massive multiple-input multiple-output (MIMO) systems are considered a promising solution to minimize multiuser interference (MUI) based on simple precoding techniques with a massive antenna array at a base station (BS). This paper presents a novel approach of beam division multiple access (BDMA) which BS transmit signals to multiusers at the same time via different beams based on hybrid beamforming and user-beam schedule. With the selection of users whose steering vectors are orthogonal to each other, interference between users is significantly improved. While, the efficiency spectrum of proposed scheme reaches to the performance of fully digital solutions, the multiuser interference is considerably reduced.
A novel optimal small cells deployment for next-generation cellular networks IJECEIAES
Small-cell-deployments have pulled cellular operators to boost coverage and capacity in high-demand areas (for example, downtown hot spots). The location of these small cells (SCs) should be determined in order to achieve successful deployments. In this paper, we propose a new approach that optimizes small cells deployment in cellular networks to achieve three objectives: reduce the total cost of network installation, balancing the allocation of resources, i.e. placement of each SC and their transmitted power, and providing optimal coverage area with a lower amount of interference between adjacent stations. An accurate formula was obtained to determine the optimum number of SC deployment (NSC). Finally, we derive a mathematical expression to calculate the critical-handoff-point (CHP) for neighboring wireless stations.
DESIGN OF A COMPACT CIRCULAR MICROSTRIP PATCH ANTENNA FOR WLAN APPLICATIONS pijans
This paper presents the design of a compact circular microstrip patch antenna for WLAN applications which covers the band 5.15 to 5.825 GHz. The antenna is designed using 1.4mm thick FR-4 (lossy)substrate with relative permittivity 4.4 and a microstrip line feed is used. The radius of the circular patch is chosen as 7.62mm. To reduce the size and enhance the performance of the proposed antenna, a circular slot is loaded on circular patch and a square slot is etched on the ground plane of dimension 30mm×30mm. Design of the antenna is carried out using CST Microsoft Studio Sonimulation Software. The proposed antenna resonates at 5.5 GHz with a wider bandwidth of 702 MHz and it provides low return loss of -31.58 dB, good gain of 3.23 dB and directivity of 4.28 dBi and high efficiency of around 79% against the resonance frequency. The geometry of the proposed circular antenna with reduced size and its various performance parameters such as return loss, bandwidth, VSWR, gain, directivity, efficiency and radiation pattern plots are presented and discussed.
A COMBINATION OF THE INTRUSION DETECTION SYSTEM AND THE OPEN-SOURCE FIREWALL ...IJCNCJournal
There are many security models for computer networks using a combination of Intrusion Detection System and Firewall proposed and deployed in practice. In this paper, we propose and implement a new model of the association between Intrusion Detection System and Firewall operations, which allows Intrusion Detection System to automatically update the firewall filtering rule table whenever it detects a weirdo intrusion. This helps protect the network from attacks from the Internet.
QoS controlled capacity offload optimization in heterogeneous networksjournalBEEI
An efficient resource allocation mechanism in the physical layer of wireless networks ensures that resources such as bandwidth and power are used with high efficiency in spite of low delay and high edge user data rate. Microcells in the network are typically set with bias settings to artificially increase the Signal-to-Interference-Plus-Noise Ratio, thus encouraging users to offload to the microcell. However, the artificial bias settings are tedious and often suboptimal. This work presents a low complexity algorithm for maximization of network capacity with load balancing in a heterogeneous network without the need for bias setting. The small cells were deployed in a grid topology at a selected distance from macrocell to enhance network capacity through coverage overlap. User association and minimum user throughput were incorporated as constraints to enable closer simulation to real word Quality of Service requirements. The results showed that the proposed algorithm was able to maintain less than 10% user drop rate. The proposed algorithm can increase user confidence as well as maintain load balancing, maintain the scalability, and reduce power consumption of the wireless network.
A Novel Handoff Necessity Estimation Approach Based on Travelling DistanceIJAAS Team
Mobility management is one of the most important challenges in Next
Generation Wireless Networks (NGWNs) as it enables users to move across
geographic boundaries of wireless networks. Nowadays, mobile
communications have heterogeneous wireless networks offering variable
coverage and Quality of Service (QoS). The availability of alternatives
generates a problem of occurrence of unnecessary handoff that results in
wastage of network resources. To avoid this, an efficient algorithm needs to
be developed to minimize the unnecessary handoffs. Conventionally,
whenever Wireless Local Area Network (WLAN) connectivity is available,
the mobile node switch from cellular network to wireless local area network
to gain maximum use of high bandwidth and low cost of wireless local area
network as much as possible. But to maintain call quality and minimum
number of call failure, a considerable proportion of these handovers should
be determined. Our algorithm makes the handoff to wireless local area
network only when the Predicted Received Signal Strength (PRSS) falls
below a threshold value and travelling distance inside the wireless local area
network is larger than a threshold distance.Through MATLAB simulation,
we show that our algorithm is able to improve handover performance.
Comparative study between metaheuristic algorithms for internet of things wir...IJECEIAES
Wireless networks are currently used in a wide range of healthcare, military, or environmental applications. Wireless networks contain many nodes and sensors that have many limitations, including limited power, limited processing, and narrow range. Therefore, determining the coordinates of the location of a node of the unknown location at a low cost and a limited treatment is one of the most important challenges facing this field. There are many meta-heuristic algorithms that help in identifying unknown nodes for some known nodes. In this manuscript, hybrid metaheuristic optimization algorithms such as grey wolf optimization and salp swarm algorithm are used to solve localization problem of internet of things (IoT) sensors. Several experiments are conducted on every meta-heuristic optimization algorithm to compare them with the proposed method. The proposed algorithm achieved high accuracy with low error rate (0.001) and low power consumption.
Ieee transactions 2018 on wireless communications Title and Abstracttsysglobalsolutions
Final year BE, B.Tech, ME, M.Tech projects along with our professionals for developing Real Time Applications in Emerging Technologies.
We can support to your final year projects in all domains with latest technologies and simulation tool like NS2, NS3, Glomosim, Opnet, Matlab, IDL, Sumo, Gridsim, Bonita tool & Cloud deployments (Cloudsim, Google App Engine, Amazon Deployment, and Real time Cloud Deployment)also we are support for JOURNAL and CONFERENCE Preparation.
?
TSYS Research and Development.
20/9 Sardar Patel Road, Janaki Complex,
4th Floor, Adyar, Chennai - 20?
Tel : 91 44 42607879, 98411 03123.
Website : http://www.tsysglobalsolutions.com/
http://tsysphdsupport.com/
Performance analysis for Adaptive Subcarriers Allocation in Coherent Optical ...iosrjce
The constraint to satisfy the need of increased bandwidth requirement for high speed applications
with higher performance has been a motivation to work on Optical Orthogonal Frequency division multiplexing
(OOFDM) technique with coherent detection. We implement the coherent optical OFDM (CO-OOFDM)
technique and investigate the effect of the number of sub-carriers on performance over single mode fiber (SMF)
links. To explore improvement in performance adaptive subcarriers has been selected by assigning subcarriers
to user according to the conditions of channel. An adaptive subcarrier allocation has been investigated and
performance comparison for proportional and equal allocation has been carried over.
AN OPTIMUM ENERGY CONSUMPTION HYBRID ALGORITHM FOR XLN STRATEGIC DESIGN IN WSN’SIJCNCJournal
In this paper, X-Layer protocol is originated which executes mobility error prediction (MEP) algorithm to calculate the remaining energy level of each node. This X-Layer protocol structure employs the mobility aware protocol that senses the mobility concerned to each node with the utilization of Ad-hoc On-Demand Distance Vector (AODV), which shares the information or data specific to the distance among individual nodes. With the help of this theory, the neighbour list will be updated only to those nodes which are mobile resulting in less energy consumption when compared to all (static/mobile) other nodes in the network. Apart from the MEP algorithm, clustering head (CH) election algorithm has also been specified to identify the relevant clusters whether they exists within the network region or not. Also clustering multi-hop routing (CMHR) algorithm was implemented in which the node can identify the cluster to which it belongs depending upon the distance from each cluster surrounding the node. Finally comprising the AODV routing protocol with the Two-Ray Ground method, we implement X-Layer protocol structure by considering MAC protocol in accordance to IEEE 802.15.4 to obtain the best results in energy consumption and also by reducing the energy wastage with respect to each node. The effective results had been illustrated through Network Simulator-II platform.
ITA: The Improved Throttled Algorithm of Load Balancing on Cloud ComputingIJCNCJournal
Cloud computing makes the information technology industry boom. It is a great solution for businesses who want to save costs while ensuring the quality of service. One of the key issues that make cloud computing successful is the load balancing technique used in the load balancer to minimize time costs and optimize costs economically. This paper proposes an algorithm to enhance the processing time of tasks so that it can help improve the load balancing capacity on cloud computing. This algorithm, named as Improved Throttled Algorithm (ITA), is an improvement of Throttled Algorithm. The paper uses the Cloud Analyst tool to simulate. The selected algorithms are used to compare: Equally Load, Round Robin, Throttled and TMA. The simulation results show that the proposed algorithm ITA has improved the processing time of tasks, time spent processing requests and reduced the cost of Datacenters compared to the selected popular algorithms as above. The improvement of ITA is because of selecting virtual machines in an index table that is available but in order of priority. It helps response times and processing times remain stable, limits the idling resources, and cloud costs are minimized compared to selected algorithms.
Performance of symmetric and asymmetric links in wireless networks IJECEIAES
Wireless networks are designed to provide the enabling infrastructure for emerging technological advancements. The main characteristics of wireless networks are: Mobility, power constraints, high packet loss, and lower bandwidth. Nodes’ mobility is a crucial consideration for wireless networks, as nodes are moving all the time, and this may result in loss of connectivity in the network. The goal of this work is to explore the effect of replacing the generally held assumption of symmetric radii for wireless networks with asymmetric radii. This replacement may have a direct impact on the connectivity, throughput, and collision avoidance mechanism of mobile networks. The proposed replacement may also impact other mobile protocol’s functionality. In this work, we are mainly concerned with building and maintaining fully connected wireless network with the asymmetric assumption. For this extent, we propose to study the effect of the asymmetric links assumption on the network performance using extensive simulation experiments. Extensive simulation experiments were performed to measure the impact of these parameters. Finally, a resource allocation scheme for wireless networks is proposed for the dual rate scenario. The performance of the proposed framework is evaluated using simulation.
COMPARATIVE PERFORMANCE ASSESSMENT OF VBLAST ENCODED 8×8 MIMO MC-CDMA WIRELES...pijans
The bit error rate performance of a V-Blast encoded 8x8 MIMO MC-CDMA wireless communication system
for different signal detection (MMSE and ZF) and digital modulation (BPSK, QPSK, DPSK, and 4QAM)
schemes for grayscale image transmission has been investigated in this paper. The proposed wireless system
employ ½-rated Convolution and cyclic redundancy check (CRC) channel encoding over the AWGN channel
and Walsh Hadamard code as an orthogonal spread code. The present Matlab based simulation study
demonstrates that the V-Blast encoded 8×8 MIMO MC-CDMA wireless system with the employment of 1⁄2-
rated convolution and cyclic redundancy check (CRC) channel encoding strategies shows good performance
utilizing BPSK digital modulation and ZF signal detection scheme in grayscale image transmission
Congestion in Wireless Sensor Networks has negative impact on the Quality of Service.
Congestion effects the performance metrics, namely throughput and per-packet energy
consumption, network lifetime and packet delivery ratio. Reducing congestion allows better
utilization of the network resources and thus enhances the Quality of Service metrics of the
network. Traffic Aware Dynamic Routing to Alleviate Congestion in Wireless Sensor Networks
reduces congestion by considering one hop neighbor routing in the network. This paper
proposed an algorithm for Quality of Service Based Traffic-Aware Data forwarding for
congestion control in wireless sensor networks based on two hop neighbor information. On
detection of congestion, the algorithm forwards data packets around the congestion areas by
spreading the excessive packets through multiple paths. The path with light load or under
loaded nodes is efficiently utilized whenever congestion occurs. The main aspect of the
algorithm is to build path to the destination using two independent potential fields depth and
queue length. Queue length field solves the traffic-aware problem. Depth field creates a
backbone to forward packets to the sink. Both fields are combined to yield a hybrid potential
field to make dynamic decision for data forwarding. Network Simulator used for simulating the
algorithm is NS2. The proposed algorithm performs better.
ENERGY EFFICIENT APPROACH BASED ON EVOLUTIONARY ALGORITHM FOR COVERAGE CONTRO...ijcseit
Coverage and connectivity are two important requirements in Wireless Sensor Networks (WSNs). In this
paper, we address the problem of network coverage and connectivity and propose an energy efficient
approach based on genetic evolutionary algorithm for maintaining coverage and connectivity where the
sensor nodes can have different sensing ranges and transmission ranges. The proposed algorithm is
simulated and it' efficiency is demonstrated via different experiments.
International Journal of Computer Science, Engineering and Information Techno...ijcseit
Coverage and connectivity are two important requirements in Wireless Sensor Networks (WSNs). In this paper, we address the problem of network coverage and connectivity and propose an energy efficient approach based on genetic evolutionary algorithm for maintaining coverage and connectivity where the sensor nodes can have different sensing ranges and transmission ranges .The proposed algorithm is simulated and it' efficiency
is demonstrated via different experiments.
Energy efficient approach based on evolutionary algorithm for coverage contro...ijcseit
Coverage and connectivity are two important requirements in Wireless Sensor Networks (WSNs). In this
paper, we address the problem of network coverage and connectivity and propose an energy efficient
approach based on genetic evolutionary algorithm for maintaining coverage and connectivity where the
sensor nodes can have different sensing ranges and transmission ranges. The proposed algorithm is
simulated and it' efficiency is demonstrated via different experiments.
Increasing the Network life Time by Simulated Annealing Algorithm in WSN wit...ijasuc
Since we are not able to replace the battery in a wireless sensor networks (WSNs), the issues
of energy and lifetime are the most important parameters. In asymmetrical networks, different sensors
with various abilities are used. Super nodes, with higher power and wider range of communication in
comparison with common sensors, are used to cause connectivity and transmit data to base stations in
these networks. It is crucial to select the parameters of fit function and monitoring sensors optimally in a
point covering network. In this paper, we utilized an algorithm to select monitoring sensors. The
selection is done by using a novel algorithm that used by simulated annealing. This selection takes
remained energy into consideration. This method increases lifetime, decreases and balances energy
consumption as confirmed by simulation results.
Node Deployment in Homogeneous and Heterogeneous Wireless Sensor NetworkIJMTST Journal
Optimal sensor deployment is necessary condition in homogeneous and heterogeneous wireless sensor
network. Effective deployment of sensor nodes is a major point of concern as performance and lifetime of any
WSN. Proposed sensor deployment in WSN explore every sensor node sends its data to the nearest sink node
of the WSN. In addition to that system proposes a hexagonal cell based sensor deployment which leads to
optimal sensor deployment for both homogeneous and heterogeneous sensor deployment. Wireless sensor
networks are receiving significant concentration due to their potential applications ranging from surveillance
to tracking domains. In limited communication range, a WSN is divided into several disconnected sub-graphs
under certain conditions. We deploy sensor nodes at random locations so that it improves performance of the
network.This paper aims to study, discuss and analyze various node deployment strategies and coverage
problems for Homogeneous and Heterogeneous WSN.
AN ENERGY EFFICIENT DISTRIBUTED PROTOCOL FOR ENSURING COVERAGE AND CONNECTIVI...ijasuc
As wireless sensor networks (WSNs) continue to attract more and more researchers attention, new ideas for
applications are continually being developed, many of which involve consistent coverage with good
network connectivity of a given area of interest. For the successful operation of the wireless Sensor
Network, the active sensor nodes must maintain both coverage and also connectivity. These are two closely
related essential prerequisites and they are also very important measurements of quality of service (QoS)
for wireless sensor networks. This paper presents the design and analysis of novel protocols that can
dynamically configure a sensor network to result in guaranteed degrees of coverage and connectivity. This
protocol is simulated using NS2 simulated and compared against a distributed probabilistic coveragepreserving configuration protocol (DPCCP) with SPAN [1] protocol in the literature and show that it
activates lesser number of sensor nodes, consumes much lesser energy and maximises the network lifetime
significantly.
NETWORK PERFORMANCE ENHANCEMENT WITH OPTIMIZATION SENSOR PLACEMENT IN WIRELES...ijwmn
From one side, sensor manufacturing technology and from other side wireless communication technology
improvement has an effect on the growth and deployment of Wireless Network Sensor (WSN). The
appropriate performance of WSN has abundant necessity which has dependent on the different parameters
such as optimize sensor placement and structure of network sensor. The optimized placement in WSN not
only would optimize number of sensors, but also help to reach to the more precise information. Therefore
different solutions are proposed to reduce cost and increase life time of sensor networks that most of them
are concentrated in the field of routing and information transmission. In this paper, places which they need
new sensors placement or sensor movements are determined and then with applying these changes,
performance of WSN will calculate. To achieve the optimum placement, the network should evaluate
precisely and effective criteria on the performance should extract. Therefore the criteria should be ranked
and after weighting with using AHP algorithms, with use of Geographical Information System (GIS), these
weighted criteria will combined and in the locations which WSN doesn’t have enough performance, new
sensor placement will create. New proposed method, improve 21.11% performance of WSN with sensor
placement in the low performance locations. Also the number of added sensor is 26.09% which is lowest
number of added sensors in comparison with other methods.
NETWORK PERFORMANCE ENHANCEMENT WITH OPTIMIZATION SENSOR PLACEMENT IN WIRELES...ijwmn
From one side, sensor manufacturing technology and from other side wireless communication technology
improvement has an effect on the growth and deployment of Wireless Network Sensor (WSN). The
appropriate performance of WSN has abundant necessity which has dependent on the different parameters
such as optimize sensor placement and structure of network sensor. The optimized placement in WSN not
only would optimize number of sensors, but also help to reach to the more precise information. Therefore
different solutions are proposed to reduce cost and increase life time of sensor networks that most of them
are concentrated in the field of routing and information transmission. In this paper, places which they need
new sensors placement or sensor movements are determined and then with applying these changes,
performance of WSN will calculate. To achieve the optimum placement, the network should evaluate
precisely and effective criteria on the performance should extract. Therefore the criteria should be ranked
and after weighting with using AHP algorithms, with use of Geographical Information System (GIS), these
weighted criteria will combined and in the locations which WSN doesn’t have enough performance, new
sensor placement will create. New proposed method, improve 21.11% performance of WSN with sensor
placement in the low performance locations. Also the number of added sensor is 26.09% which is lowest
number of added sensors in comparison with other methods.
NETWORK PERFORMANCE ENHANCEMENT WITH OPTIMIZATION SENSOR PLACEMENT IN WIRELES...ijwmn
From one side, sensor manufacturing technology and from other side wireless communication technology
improvement has an effect on the growth and deployment of Wireless Network Sensor (WSN). The
appropriate performance of WSN has abundant necessity which has dependent on the different parameters
such as optimize sensor placement and structure of network sensor. The optimized placement in WSN not
only would optimize number of sensors, but also help to reach to the more precise information. Therefore
different solutions are proposed to reduce cost and increase life time of sensor networks that most of them
are concentrated in the field of routing and information transmission. In this paper, places which they need
new sensors placement or sensor movements are determined and then with applying these changes,
performance of WSN will calculate. To achieve the optimum placement, the network should evaluate
precisely and effective criteria on the performance should extract. Therefore the criteria should be ranked
and after weighting with using AHP algorithms, with use of Geographical Information System (GIS), these
weighted criteria will combined and in the locations which WSN doesn’t have enough performance, new
sensor placement will create. New proposed method, improve 21.11% performance of WSN with sensor
placement in the low performance locations. Also the number of added sensor is 26.09% which is lowest
number of added sensors in comparison with other methods.
An implementation of recovery algorithm for fault nodes in a wireless sensor ...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Greedy – based Heuristic for OSC problems in Wireless Sensor NetworksIJMER
This paper contains optimize set coverage problem in wireless sensor networks with adaptable sensing range. Communication and sensing consume energy, so efficient power management can extended the network lifetime. In this paper we consider a enormous number of sensors with adaptable sensing range that are randomly positioned to monitor a number of targets. Every single target may be redundantly covered by various sensors. For preserving energy resources we organize sensors in sets stimulated successively. In this paper we introduce the Optimize Set Coverage (OSC) problem that has in unbiased finding with an extreme number of set covers in which every sensor node to be activated is connected to the base station. A sensor can be participated in various sensor sets, but the overall energy consumed in all groups is forced by the primary energy reserves. We show that the OSC problem is NP-complete and we propose the solutions: an integer programming for OSC problem, a linear programming for OSC problem with greedy approach, and a distributed and localized heuristic. Simulation results are presented and validated to our approaches.
AN EFFICIENT SLEEP SCHEDULING STRATEGY FOR WIRELESS SENSOR NETWORKijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
ENERGY EFFICIENT AGGREGATION WITH DIVERGENT SINK PLACEMENT FOR WIRELESS SENSO...ijasuc
In WSN the data aggregation is a means for condensing the energy requirement by reducing number of
transmission by combining the data and sending the final required result to the base station. The lifetime
of the WSN can be improved by employing the aggregation techniques. During the process of aggregation
the numbers of transmission are reduced by combining the similar data from the nearby areas. By using
the clustering technique and aggregating the correlated data greatly minimize the energy consumed in
collecting and disseminating the data. In this work, we evaluate the performance of a novel energy
efficient cluster based aggregation protocol (EECAP) for WSN. The main focus in this proposed work is
to study the performance of our proposed aggregation protocol with divergent sink placements such as
when sink is at the centre of the sensing field, corner of the sensing field or at a location selected
randomly in the sensor field. We present experimental results by calculating the lifetime of network in
terms of number of sensing rounds using various parameters such as – average remaining energy of
nodes, number of dead nodes after the specified number of sensing rounds. Finally the performance of
various aggregation algorithms such as LEACH, SEP and our proposed aggregation protocol (EECAP)
are compared with divergent sink placements. The simulation results demonstrates that EECAP exhibits
good performance in terms of lifetime and the energy consumption of the wireless sensor networks and
which can be as equally compared with existing clustering protocols.
A new approach for area coverage problem in wireless sensor networks with hyb...ijmnct
One of the most important and basic problems in Wireless Sensor Networks (WSNs) is the coverage
problem. The coverage problem in WSNs causes the security environments is supervised by the existing
sensors in the networks suitably. The importance of coverage in WSNs is so important that is one of the
quality of service parameters. If the sensors do not suitably cover the physical environments they will not
be enough efficient n supervision and controlling. The coverage in WSNs must be in a way that the energy
of the sensors would be the least to increase the lifetime of the network. The other reasons which had
increase the importance of the problem are the topologic changes of the network which are done by the
damage or deletion of some of the sensors and in some cases the network must not lose its coverage. SO, in
this paper we have hybrid the Particle Swarm Optimization (PSO) and Differential Evolution (DE)
algorithms which are the Meta-Heuristic algorithms and have analyzed the area coverage problem in
WSNs. Also a PSO algorithm is implemented to compare the efficiency of the hybrid model in the same
situation. The results of the experiments show that the hybrid algorithm has made more increase in the
lifetime of the network and more optimized use of the energy of the sensors by optimizing the coverage of
the sensors in comparison to PSO.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Vehicle Ad Hoc Networks (VANETs) have become a viable technology to improve traffic flow and safety on the roads. Due to its effectiveness and scalability, the Wingsuit Search-based Optimised Link State Routing Protocol (WS-OLSR) is frequently used for data distribution in VANETs. However, the selection of MultiPoint Relays (MPRs) plays a pivotal role in WS-OLSR's performance. This paper presents an improved MPR selection algorithm tailored to WS-OLSR, designed to enhance the overall routing efficiency and reduce overhead. The analysis found that the current OLSR protocol has problems such as redundancy of HELLO and TC message packets or failure to update routing information in time, so a WS-OLSR routing protocol based on improved-MPR selection algorithm was proposed. Firstly, factors such as node mobility and link changes are comprehensively considered to reflect network topology changes, and the broadcast cycle of node HELLO messages is controlled through topology changes. Secondly, a new MPR selection algorithm is proposed, considering link stability issues and nodes. Finally, evaluate its effectiveness in terms of packet delivery ratio, end-to-end delay, and control message overhead. Simulation results demonstrate the superior performance of our improved MR selection algorithm when compared to traditional approaches.
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
So far, Wireless Body Area Networks (WBANs) have played a pivotal role in driving the development of intelligent healthcare systems with broad applicability across various domains. Each WBAN consists of one or more types of sensors that can be embedded in clothing, attached directly to the body, or even implanted beneath an individual's skin. These sensors typically serve asingle application. However, the traffic generated by each sensor may have distinct requirements. This diversity necessitates a dual approach: tailored treatment based on the specific needs of each traffic typeand the fulfillment of application requirements, such asreliability and timeliness. Never the less, the presence of energy constraints and the unreliable nature of wireless communications make QoS provisioning under such networks a non-trivial task. In this context, the current paper introduces a novel Medium AccessControl (MAC) strategy for the regular traffic applications of WBANs, designed to significantly enhance efficiency when compared to the established MAC protocols IEEE 802.15.4 and IEEE 802.15.6, with a particular focus on improving reliability, timeliness, and energy efficiency.
May_2024 Top 10 Read Articles in Computer Networks & Communications.pdfIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...IJCNCJournal
The efficient use of energy in wireless sensor networks is critical for extending node lifetime. The network topology is one of the factors that have a significant impact on the energy usage at the nodes and the quality of transmission (QoT) in the network. We propose a topology control algorithm for software-defined wireless sensor networks (SDWSNs) in this paper. Our method is to formulate topology control algorithm as a nonlinear programming (NP) problem with the objective to optimizing two metrics, maximum communication range, and desired degree. This NP problem is solved at the SDWSN controller by employing the genetic algorithm (GA) to determine the best topology. The simulation results show that the proposed algorithm outperforms the MaxPower algorithm in terms of average node degree and energy expansion ratio.
Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...IJCNCJournal
The integration of artificial intelligence technology with a scalable Internet of Things (IoT) platform facilitates diverse smart communication services, allowing remote users to access services from anywhere at any time. The multi-server environment within IoT introduces a flexible security service model, enabling users to interact with any server through a single registration. To ensure secure and privacy preservation services for resources, an authentication scheme is essential. Zhao et al. recently introduced a user authentication scheme for the multi-server environment, utilizing passwords and smart cards, claiming resilience against well-known attacks. This paper conducts cryptanalysis on Zhao et al.'s scheme, focusing on denial of service and privacy attacks, revealing a lack of user-friendliness. Subsequently, we propose a new multi-server user authentication scheme for privacy preservation with fuzzy commitment over the IoT environment, addressing the shortcomings of Zhao et al.'s scheme. Formal security verification of the proposed scheme is conducted using the ProVerif simulation tool. Through both formal and informal security analyses, we demonstrate that the proposed scheme is resilient against various known attacks and those identified in Zhao et al.'s scheme.
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation SystemsIJCNCJournal
In -Vehicle Ad-Hoc Network (VANET), vehicles continuously transmit and receive spatiotemporal data with neighboring vehicles, thereby establishing a comprehensive 360-degree traffic awareness system. Vehicular Network safety applications facilitate the transmission of messages between vehicles that are near each other, at regular intervals, enhancing drivers' contextual understanding of the driving environment and significantly improving traffic safety. Privacy schemes in VANETs are vital to safeguard vehicles’ identities and their associated owners or drivers. Privacy schemes prevent unauthorized parties from linking the vehicle's communications to a specific real-world identity by employing techniques such as pseudonyms, randomization, or cryptographic protocols. Nevertheless, these communications frequently contain important vehicle information that malevolent groups could use to Monitor the vehicle over a long period. The acquisition of this shared data has the potential to facilitate the reconstruction of vehicle trajectories, thereby posing a potential risk to the privacy of the driver. Addressing the critical challenge of developing effective and scalable privacy-preserving protocols for communication in vehicle networks is of the highest priority. These protocols aim to reduce the transmission of confidential data while ensuring the required level of communication. This paper aims to propose an Advanced Privacy Vehicle Scheme (APV) that periodically changes pseudonyms to protect vehicle identities and improve privacy. The APV scheme utilizes a concept called the silent period, which involves changing the pseudonym of a vehicle periodically based on the tracking of neighboring vehicles. The pseudonym is a temporary identifier that vehicles use to communicate with each other in a VANET. By changing the pseudonym regularly, the APV scheme makes it difficult for unauthorized entities to link a vehicle's communications to its real-world identity. The proposed APV is compared to the SLOW, RSP, CAPS, and CPN techniques. The data indicates that the efficiency of APV is a better improvement in privacy metrics. It is evident that the AVP offers enhanced safety for vehicles during transportation in the smart city.
April 2024 - Top 10 Read Articles in Computer Networks & CommunicationsIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
DEF: Deep Ensemble Neural Network Classifier for Android Malware DetectionIJCNCJournal
Malware is one of the threats to security of computer networks and information systems. Since malware instances are available sufficiently, there is increased interest among researchers on usage of Artificial Intelligence (AI). Of late AI-enabled methods such as machine learning (ML) and deep learning paved way for solving many real-world problems. As it is a learning-based approach, accumulated training samples help in improving thequality of training and thus leveraging malware detection accuracy. Existing deep learning methods are focusing on learning-based malware detection systems. However, there is need for improving the state of the art through ensemble approach. Towards this end, in this paper we proposed a framework known as Deep Ensemble Framework (DEF) for automatic malware detection. The framework obtains features from training samples. From given malware instance a grayscale image is generated. There is another process to extract the opcode sequences. Convolutional Neural Network (CNN) and Long Short Term Memory (LSTM) techniques are used to obtain grayscale image and opcode sequence respectively. Afterwards, a stacking ensemble is employed in order to achieve efficient malware detection and classification. Malware samples collected fromthe Internet sources and Microsoft are used for theempirical study. An algorithm known as Ensemble Learning for Automatic Malware Detection (EL-AML) is proposed to realize our framework. Another algorithm named Pre-Process is proposed to assist the EL-AML algorithm for obtaining intermediate features required by CNN and LSTM.Empirical study reveals that our framework outperforms many existing methods in terms of speed-up and accuracy.
High Performance NMF Based Intrusion Detection System for Big Data IOT TrafficIJCNCJournal
With the emergence of smart devices and the Internet of Things (IoT), millions of users connected to the network produce massive network traffic datasets. These vast datasets of network traffic, Big Data are challenging to store, deal with and analyse using a single computer. In this paper we developed parallel implementation using a High Performance Computer (HPC) for the Non-Negative Matrix Factorization technique as an engine for an Intrusion Detection System (HPC-NMF-IDS). The large IoT traffic datasets of order of millions samples are distributed evenly on all the computing cores for both storage and speedup purpose. The distribution of computing tasks involved in the Matrix Factorization takes into account the reduction of the communication cost between the computing cores. The experiments we conducted on the proposed HPC-IDS-NMF give better results than the traditional ML-based intrusion detection systems. We could train the HPC model with datasets of one million samples in only 31 seconds instead of the 40 minutes using one processor), that is a speed up of 87 times. Moreover, we have got an excellent detection accuracy rate of 98% for KDD dataset.
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
So far, Wireless Body Area Networks (WBANs) have played a pivotal role in driving the development of intelligent healthcare systems with broad applicability across various domains. Each WBAN consists of one or more types of sensors that can be embedded in clothing, attached directly to the body, or even implanted beneath an individual's skin. These sensors typically serve asingle application. However, the traffic generated by each sensor may have distinct requirements. This diversity necessitates a dual approach: tailored treatment based on the specific needs of each traffic typeand the fulfillment of application requirements, such asreliability and timeliness. Never the less, the presence of energy constraints and the unreliable nature of wireless communications make QoS provisioning under such networks a non-trivial task. In this context, the current paper introduces a novel Medium AccessControl (MAC) strategy for the regular traffic applications of WBANs, designed to significantly enhance efficiency when compared to the established MAC protocols IEEE 802.15.4 and IEEE 802.15.6, with a particular focus on improving reliability, timeliness, and energy efficiency.
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...IJCNCJournal
The efficient use of energy in wireless sensor networks is critical for extending node lifetime. The network topology is one of the factors that have a significant impact on the energy usage at the nodes and the quality of transmission (QoT) in the network. We propose a topology control algorithm for software-defined wireless sensor networks (SDWSNs) in this paper. Our method is to formulate topology control algorithm as a nonlinear programming (NP) problem with the objective to optimizing two metrics, maximum communication range, and desired degree. This NP problem is solved at the SDWSN controller by employing the genetic algorithm (GA) to determine the best topology. The simulation results show that the proposed algorithm outperforms the MaxPower algorithm in terms of average node degree and energy expansion ratio.
Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...IJCNCJournal
The integration of artificial intelligence technology with a scalable Internet of Things (IoT) platform facilitates diverse smart communication services, allowing remote users to access services from anywhere at any time. The multi-server environment within IoT introduces a flexible security service model, enabling users to interact with any server through a single registration. To ensure secure and privacy preservation services for resources, an authentication scheme is essential. Zhao et al. recently introduced a user authentication scheme for the multi-server environment, utilizing passwords and smart cards, claiming resilience against well-known attacks. This paper conducts cryptanalysis on Zhao et al.'s scheme, focusing on denial of service and privacy attacks, revealing a lack of user-friendliness. Subsequently, we propose a new multi-server user authentication scheme for privacy preservation with fuzzy commitment over the IoT environment, addressing the shortcomings of Zhao et al.'s scheme. Formal security verification of the proposed scheme is conducted using the ProVerif simulation tool. Through both formal and informal security analyses, we demonstrate that the proposed scheme is resilient against various known attacks and those identified in Zhao et al.'s scheme.
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation SystemsIJCNCJournal
In -Vehicle Ad-Hoc Network (VANET), vehicles continuously transmit and receive spatiotemporal data with neighboring vehicles, thereby establishing a comprehensive 360-degree traffic awareness system. Vehicular Network safety applications facilitate the transmission of messages between vehicles that are near each other, at regular intervals, enhancing drivers' contextual understanding of the driving environment and significantly improving traffic safety. Privacy schemes in VANETs are vital to safeguard vehicles’ identities and their associated owners or drivers. Privacy schemes prevent unauthorized parties from linking the vehicle's communications to a specific real-world identity by employing techniques such as pseudonyms, randomization, or cryptographic protocols. Nevertheless, these communications frequently contain important vehicle information that malevolent groups could use to Monitor the vehicle over a long period. The acquisition of this shared data has the potential to facilitate the reconstruction of vehicle trajectories, thereby posing a potential risk to the privacy of the driver. Addressing the critical challenge of developing effective and scalable privacy-preserving protocols for communication in vehicle networks is of the highest priority. These protocols aim to reduce the transmission of confidential data while ensuring the required level of communication. This paper aims to propose an Advanced Privacy Vehicle Scheme (APV) that periodically changes pseudonyms to protect vehicle identities and improve privacy. The APV scheme utilizes a concept called the silent period, which involves changing the pseudonym of a vehicle periodically based on the tracking of neighboring vehicles. The pseudonym is a temporary identifier that vehicles use to communicate with each other in a VANET. By changing the pseudonym regularly, the APV scheme makes it difficult for unauthorized entities to link a vehicle's communications to its real-world identity. The proposed APV is compared to the SLOW, RSP, CAPS, and CPN techniques. The data indicates that the efficiency of APV is a better improvement in privacy metrics. It is evident that the AVP offers enhanced safety for vehicles during transportation in the smart city.
DEF: Deep Ensemble Neural Network Classifier for Android Malware DetectionIJCNCJournal
Malware is one of the threats to security of computer networks and information systems. Since malware instances are available sufficiently, there is increased interest among researchers on usage of Artificial Intelligence (AI). Of late AI-enabled methods such as machine learning (ML) and deep learning paved way for solving many real-world problems. As it is a learning-based approach, accumulated training samples help in improving thequality of training and thus leveraging malware detection accuracy. Existing deep learning methods are focusing on learning-based malware detection systems. However, there is need for improving the state of the art through ensemble approach. Towards this end, in this paper we proposed a framework known as Deep Ensemble Framework (DEF) for automatic malware detection. The framework obtains features from training samples. From given malware instance a grayscale image is generated. There is another process to extract the opcode sequences. Convolutional Neural Network (CNN) and Long Short Term Memory (LSTM) techniques are used to obtain grayscale image and opcode sequence respectively. Afterwards, a stacking ensemble is employed in order to achieve efficient malware detection and classification. Malware samples collected fromthe Internet sources and Microsoft are used for theempirical study. An algorithm known as Ensemble Learning for Automatic Malware Detection (EL-AML) is proposed to realize our framework. Another algorithm named Pre-Process is proposed to assist the EL-AML algorithm for obtaining intermediate features required by CNN and LSTM.Empirical study reveals that our framework outperforms many existing methods in terms of speed-up and accuracy.
High Performance NMF based Intrusion Detection System for Big Data IoT TrafficIJCNCJournal
With the emergence of smart devices and the Internet of Things (IoT), millions of users connected to the network produce massive network traffic datasets. These vast datasets of network traffic, Big Data are challenging to store, deal with and analyse using a single computer. In this paper we developed parallel implementation using a High Performance Computer (HPC) for the Non-Negative Matrix Factorization technique as an engine for an Intrusion Detection System (HPC-NMF-IDS). The large IoT traffic datasets of order of millions samples are distributed evenly on all the computing cores for both storage and speedup purpose. The distribution of computing tasks involved in the Matrix Factorization takes into account the reduction of the communication cost between the computing cores. The experiments we conducted on the proposed HPC-IDS-NMF give better results than the traditional ML-based intrusion detection systems. We could train the HPC model with datasets of one million samples in only 31 seconds instead of the 40 minutes using one processor), that is a speed up of 87 times. Moreover, we have got an excellent detection accuracy rate of 98% for KDD dataset.
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...IJCNCJournal
Cyber intrusion attacks increasingly target the Internet of Things (IoT) ecosystem, exploiting vulnerable devices and networks. Malicious activities must be identified early to minimize damage and mitigate threats. Using actual benign and attack traffic from the CICIoT2023 dataset, this WORK aims to evaluate and benchmark machine-learning techniques for IoT intrusion detection. There are four main phases to the system. First, the CICIoT2023 dataset is refined to remove irrelevant features and clean up missing and duplicate data. The second phase employs statistical models and artificial intelligence to discover novel features. The most significant features are then selected in the third phase based on cooperative game theory. Using the original CICIoT2023 dataset and a dataset containing only novel features, we train and evaluate a variety of machine learning classifiers. On the original dataset, Random Forest achieved the highest accuracy of 99%. Still, with novel features, Random Forest's performance dropped only slightly (96%) while other models achieved significantly lower accuracy. As a whole, the work contributes substantial contributions to tailored feature engineering, feature selection, and rigorous benchmarking of IoT intrusion detection techniques. IoT networks and devices face continuously evolving threats, making it necessary to develop robust intrusion detection systems.
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...IJCNCJournal
IoT networking uses real items as stationary or mobile nodes. Mobile nodes complicate networking. Internet of Things (IoT) networks have a lot of control overhead messages because devices are mobile. These signals are generated by the constant flow of control data as such device identity, geographical positioning, node mobility, device configuration, and others. Network clustering is a popular overhead communication management method. Many cluster-based routing methods have been developed to address system restrictions. Node clustering based on the Internet of Things (IoT) protocol, may be used to cluster all network nodes according to predefined criteria. Each cluster will have a Smart Designated Node. SDN cluster management is efficient. Many intelligent nodes remain in the network. The network design spreads these signals. This paper presents an intelligent and responsive routing approach for clustered nodes in IoT networks. An existing method builds a new sub-area clustered topology. The Nodes Clustering Based on the Internet of Things (NCIoT) method improves message transmission between any two nodes. This will facilitate the secure and reliable interchange of healthcare data between professionals and patients. NCIoT is a system that organizes nodes in the Internet of Things (IoT) by grouping them together based on their proximity. It also picks SDN routes for these nodes. This approach involves selecting one option from a range of choices and preparing for likely outcomes problem addressing limitations on activities is a primary focus during the review process. Predictive inquiry employs the process of analyzing data to forecast and anticipate future events. This document provides an explanation of compact units. The Predictive Inquiry Small Packets (PISP) improved its backup system and partnered with SDN to establish a routing information table for each intelligent node, resulting in higher routing performance. Both principal and secondary roads are available for use. The simulation findings indicate that NCIoT algorithms outperform CBR protocols. Enhancements lead to a substantial 78% boost in network performance. In addition, the end-to-end latency dropped by 12.5%. The PISP methodology produces 5.9% more inquiry packets compared to alternative approaches. The algorithms are constructed and evaluated against academic ones.
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...IJCNCJournal
Cyber intrusion attacks increasingly target the Internet of Things (IoT) ecosystem, exploiting vulnerable devices and networks. Malicious activities must be identified early to minimize damage and mitigate threats. Using actual benign and attack traffic from the CICIoT2023 dataset, this WORK aims to evaluate and benchmark machine-learning techniques for IoT intrusion detection. There are four main phases to the system. First, the CICIoT2023 dataset is refined to remove irrelevant features and clean up missing and duplicate data. The second phase employs statistical models and artificial intelligence to discover novel features. The most significant features are then selected in the third phase based on cooperative game theory. Using the original CICIoT2023 dataset and a dataset containing only novel features, we train and evaluate a variety of machine learning classifiers. On the original dataset, Random Forest achieved the highest accuracy of 99%. Still, with novel features, Random Forest's performance dropped only slightly (96%) while other models achieved significantly lower accuracy. As a whole, the work contributes substantial contributions to tailored feature engineering, feature selection, and rigorous benchmarking of IoT intrusion detection techniques. IoT networks and devices face continuously evolving threats, making it necessary to develop robust intrusion detection systems.
** Connect, Collaborate, And Innovate: IJCNC - Where Networking Futures Take ...IJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...IJCNCJournal
IoT networking uses real items as stationary or mobile nodes. Mobile nodes complicate networking. Internet of Things (IoT) networks have a lot of control overhead messages because devices are mobile. These signals are generated by the constant flow of control data as such device identity, geographical positioning, node mobility, device configuration, and others. Network clustering is a popular overhead communication management method. Many cluster-based routing methods have been developed to address system restrictions. Node clustering based on the Internet of Things (IoT) protocol, may be used to cluster all network nodes according to predefined criteria. Each cluster will have a Smart Designated Node. SDN cluster management is efficient. Many intelligent nodes remain in the network. The network design spreads these signals. This paper presents an intelligent and responsive routing approach for clustered nodes in IoT networks. An existing method builds a new sub-area clustered topology. The Nodes Clustering Based on the Internet of Things (NCIoT) method improves message transmission between any two nodes. This will facilitate the secure and reliable interchange of healthcare data between professionals and patients. NCIoT is a system that organizes nodes in the Internet of Things (IoT) by grouping them together based on their proximity. It also picks SDN routes for these nodes. This approach involves selecting one option from a range of choices and preparing for likely outcomes problem addressing limitations on activities is a primary focus during the review process. Predictive inquiry employs the process of analyzing data to forecast and anticipate future events. This document provides an explanation of compact units. The Predictive Inquiry Small Packets (PISP) improved its backup system and partnered with SDN to establish a routing information table for each intelligent node, resulting in higher routing performance. Both principal and secondary roads are available for use. The simulation findings indicate that NCIoT algorithms outperform CBR protocols. Enhancements lead to a substantial 78% boost in network performance. In addition, the end-to-end latency dropped by 12.5%. The PISP methodology produces 5.9% more inquiry packets compared to alternative approaches. The algorithms are constructed and evaluated against academic ones.
Student information management system project report ii.pdfKamal Acharya
Our project explains about the student management. This project mainly explains the various actions related to student details. This project shows some ease in adding, editing and deleting the student details. It also provides a less time consuming process for viewing, adding, editing and deleting the marks of the students.
Hierarchical Digital Twin of a Naval Power SystemKerry Sado
A hierarchical digital twin of a Naval DC power system has been developed and experimentally verified. Similar to other state-of-the-art digital twins, this technology creates a digital replica of the physical system executed in real-time or faster, which can modify hardware controls. However, its advantage stems from distributing computational efforts by utilizing a hierarchical structure composed of lower-level digital twin blocks and a higher-level system digital twin. Each digital twin block is associated with a physical subsystem of the hardware and communicates with a singular system digital twin, which creates a system-level response. By extracting information from each level of the hierarchy, power system controls of the hardware were reconfigured autonomously. This hierarchical digital twin development offers several advantages over other digital twins, particularly in the field of naval power systems. The hierarchical structure allows for greater computational efficiency and scalability while the ability to autonomously reconfigure hardware controls offers increased flexibility and responsiveness. The hierarchical decomposition and models utilized were well aligned with the physical twin, as indicated by the maximum deviations between the developed digital twin hierarchy and the hardware.
Saudi Arabia stands as a titan in the global energy landscape, renowned for its abundant oil and gas resources. It's the largest exporter of petroleum and holds some of the world's most significant reserves. Let's delve into the top 10 oil and gas projects shaping Saudi Arabia's energy future in 2024.
Hybrid optimization of pumped hydro system and solar- Engr. Abdul-Azeez.pdffxintegritypublishin
Advancements in technology unveil a myriad of electrical and electronic breakthroughs geared towards efficiently harnessing limited resources to meet human energy demands. The optimization of hybrid solar PV panels and pumped hydro energy supply systems plays a pivotal role in utilizing natural resources effectively. This initiative not only benefits humanity but also fosters environmental sustainability. The study investigated the design optimization of these hybrid systems, focusing on understanding solar radiation patterns, identifying geographical influences on solar radiation, formulating a mathematical model for system optimization, and determining the optimal configuration of PV panels and pumped hydro storage. Through a comparative analysis approach and eight weeks of data collection, the study addressed key research questions related to solar radiation patterns and optimal system design. The findings highlighted regions with heightened solar radiation levels, showcasing substantial potential for power generation and emphasizing the system's efficiency. Optimizing system design significantly boosted power generation, promoted renewable energy utilization, and enhanced energy storage capacity. The study underscored the benefits of optimizing hybrid solar PV panels and pumped hydro energy supply systems for sustainable energy usage. Optimizing the design of solar PV panels and pumped hydro energy supply systems as examined across diverse climatic conditions in a developing country, not only enhances power generation but also improves the integration of renewable energy sources and boosts energy storage capacities, particularly beneficial for less economically prosperous regions. Additionally, the study provides valuable insights for advancing energy research in economically viable areas. Recommendations included conducting site-specific assessments, utilizing advanced modeling tools, implementing regular maintenance protocols, and enhancing communication among system components.
About
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Technical Specifications
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
Key Features
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface
• Compatible with MAFI CCR system
• Copatiable with IDM8000 CCR
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
Application
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
Immunizing Image Classifiers Against Localized Adversary Attacksgerogepatton
This paper addresses the vulnerability of deep learning models, particularly convolutional neural networks
(CNN)s, to adversarial attacks and presents a proactive training technique designed to counter them. We
introduce a novel volumization algorithm, which transforms 2D images into 3D volumetric representations.
When combined with 3D convolution and deep curriculum learning optimization (CLO), itsignificantly improves
the immunity of models against localized universal attacks by up to 40%. We evaluate our proposed approach
using contemporary CNN architectures and the modified Canadian Institute for Advanced Research (CIFAR-10
and CIFAR-100) and ImageNet Large Scale Visual Recognition Challenge (ILSVRC12) datasets, showcasing
accuracy improvements over previous techniques. The results indicate that the combination of the volumetric
input and curriculum learning holds significant promise for mitigating adversarial attacks without necessitating
adversary training.
Explore the innovative world of trenchless pipe repair with our comprehensive guide, "The Benefits and Techniques of Trenchless Pipe Repair." This document delves into the modern methods of repairing underground pipes without the need for extensive excavation, highlighting the numerous advantages and the latest techniques used in the industry.
Learn about the cost savings, reduced environmental impact, and minimal disruption associated with trenchless technology. Discover detailed explanations of popular techniques such as pipe bursting, cured-in-place pipe (CIPP) lining, and directional drilling. Understand how these methods can be applied to various types of infrastructure, from residential plumbing to large-scale municipal systems.
Ideal for homeowners, contractors, engineers, and anyone interested in modern plumbing solutions, this guide provides valuable insights into why trenchless pipe repair is becoming the preferred choice for pipe rehabilitation. Stay informed about the latest advancements and best practices in the field.
The Benefits and Techniques of Trenchless Pipe Repair.pdf
ADAPTIVE SENSOR SENSING RANGE TO MAXIMISE LIFETIME OF WIRELESS SENSOR NETWORK
1. International Journal of Computer Networks & Communications (IJCNC) Vol.14, No.1, January 2022
DOI: 10.5121/ijcnc.2022.14105 71
ADAPTIVE SENSOR SENSING RANGE TO MAXIMISE
LIFETIME OF WIRELESS SENSOR NETWORK
Almamoon Naife Alauthman, Wan Nor Shuhadah Wan Nik, Nor Aida Mahiddin
Faculty of Informatics and Computing,
Universiti Sultan Zainal Abidin, Besut Campus, Terengganu, Malaysia
ABSTRACT
Wireless Sensor Network (WSN) is commonly used to collect information from a remote area and one of
the most important challenges associated with WSN is to monitor all targets in a given area while
maximizing network lifetime. In wireless communication, energy consumption is proportional to the
breadth of sensing range and path loss exponent. Hence, the energy consumption of communication can be
minimized by varying the sensing range and decreasing the number of messages being sent. Sensing energy
can be optimized by reducing the repeated coverage target. In this paper, an Adaptive Sensor Sensing
Range (ASSR) technique is proposed to maximize the WSN Lifetime. This work considers a sensor network
with an adaptive sensing range that are randomly deployed in the monitoring area. The sensor is adaptive
in nature and can be modified in order to save power while achieving maximum time of monitoring to
increase the lifetime of WSN network. The objective of ASSR is to find the best sensing range for each
sensor to cover all targets in the network, which yields maximize the time of monitoring of all targets and
eliminating double sensing for the same target. Experiments were conducted using an NS3 simulator to
verify our proposed technique. Results show that ASSR is capable to improve the network lifetime by 20%
as compared to other recent techniques in the case of a small network while achieving an 8% improvement
for the case of a large networks.
KEYWORDS
Wireless Sensor Network, (WSN), Adaptive Sensor Sensing Range (ASSR), Deterministic Energy Efficient
Protocol (DEEP), Adjustable Range Deterministic Energy Efficient Protocol (ADEEP), Distributed
Lifetime Coverage Optimization protocol (Dilco), Adjustable Range Load Balancing Protocol (ALBP).
1. INTRODUCTION
Wireless Sensor Network (WSN) contains a large number of sensor nodes that are deployed in a
certain coverage area to monitor some targets; this sensor is connected by wireless
communication, containing transceivers, processing unit, memory, and batteries. Sensor nodes
are randomly deployed which requires intelligent algorithms to control and maximize network
lifetime while ensuring reliable communication between sensors and sink node. It needs to collect
data from the monitoring area and send it to the base station, where end users can retrieve and
process the data [1]. In this way, the sensor network provides an efficient monitoring mechanism
and further provides a better understanding of the monitored area.
When compared to traditional ad hoc networks, WSN is facing some difficulties such as power
and memory limitations. Sensor nodes have limited battery capacity that is not rechargeable
because this process is very difficult of almost impossible, if these sensors are deployed in an
ocean or dangerous area. In such a situation, all network requirements must be equipped with
minimal power consumption to maximize the time of monitoring and further improve the lifetime
of WSN.
2. International Journal of Computer Networks & Communications (IJCNC) Vol.14, No.1, January 2022
72
In WSN, a low number of operating sensors can kill, or terminate the network, since some targets
in the monitoring area became not covered, or some data is not transmitted to the base station.
One of the primary objectives of a wireless sensor network is achieve continuous target
monitoring to ensure that each target in the network is monitored by at least one active sensor.
Regarding to wireless a sensor network energy constraint, it is important to dynamically change
the state of sensor into sleep or active state to decrease power consumption, or by modifying the
sensing range of the sensor. Such dynamic configuration allows minimization of power
consumption while ensuring a good quality of monitoring [2]. Large sensing range increases
energy consumption because they will require additional processing methods to improve the
signal-to-noise ratio and achieve the desired confidence level of transmitting data for large
distances [3]. Therefore, an adaptive sensing range will allow the reduction of power
consumption by minimizing power usage data transmission. In this situation, a sensor node in
WSN is responsible to collect data from monitoring area, processing it, then transmit these data to
the base station or the sink sensor. Note that, data transmission process requires much more
power than dataprocessing [4]. In WSN, location awareness, networking, data integration, and
energy management are all important techniques that require extensive exploration and
investigation [5].
Generally, there are two ways to reduce power consumption and further save more power in
wireless sensor networks. The first way is to schedule the sensor state to the monitoring mode. In
this mode, the sensor is active and consume power, and the other sensor nodes in the network will
be set into a sleep mode which is considered as a low power mode. The second way is to modify
the sensor sensing to reduce power consumption which further capable to lengthen the WSN
lifetime [6].
This paper is organized as follows. In the next section (i.e., Section 2), related works on the
concept of sensing range will be discussed. Then in Section 3 and 4, problem definition and use
case example were presented, respectively. Further, Section 5 discusses the proposed algorithm
(ASSR). Section 6 discusses simulation results, where the proposed algorithm is compared with
four other recent algorithms in sensing range and with fixed sensing range algorithm, while the
last section presents the conclusion.
2. RELATED WORK
A heuristic algorithm for coverage problem and scheduling has been proposed in [7] to extend the
lifetime of WSN by organizing the sensor coverage. In this paper, the author proposed a sensor
deployment method based on discrete wavelet transform (DWT). A sensing model, called
Smooth Sensing Range, was proposed in [8] which varying the sensing diameter. The author
solved the problem by using an approximation algorithm and the sensing angle of many sensors
is restrained. In [9], the author proposed a hybrid approach that combines a column generation
method and an immune genetic algorithm to maximize the lifetime of WSN by using smooth ie
varying of sensor sensing diameter. Further in [10], the author proposed an algorithm that
enhances the target coverage by using limited node mobility called edge Based Centred
Algorithm. This algorithm is based on a diagram that is used to split the sensing area into
polygons. Recently, researchers developed integrated techniques for both coverage and
connectivity problems. A barrier cover of wireless sensors is the asset of sensors located between
two sides such that an object moving from top to bottom side or from bottom to topside to be
detected by at least one sensor [11].
A coverage maximization was achieved when a sensor node can move to the low-density area. In
other words, it divides the monitoring area into a grid, and the selected sensor node in the next
round is situated in the low-density target cover [12]. The goal behind this method is to select the
3. International Journal of Computer Networks & Communications (IJCNC) Vol.14, No.1, January 2022
73
smallest set of nodes in identifying the target coverage and determine the positions for the
deployed sensor nodes in WSN. This method is not efficient in the area coverage with large
network area where the monitoring of each target is necessary. In [13], the author considers the
coverage problem as the most important problem, where they address the problem with the
deployment of the smallest number of sensor node to reach coverage maximization. The authors
propose three optimization models to reach this goal. The first model minimizes the number of
sensors deployed in the area to attain high detection. Meanwhile, second optimization model
minimizes the number of nodes deployed in some locations that require low coverage and further
adjust the number of nodes deployed in other locations that require higher coverage. Then, the
third model is based on the determination of available sensors positions by limiting the number of
sensors for perfect coverage. In [14], the author implements Genetic Algorithm (GA) to solve
coverage problem. This algorithm specifies the positions and the number of sensor nodes to be
deployed in the area of targets in order to achieve maximum coverage. The application of this
algorithm overloads the nodes so that it always leaves the nodes in active state. Further in [15],
the author proposed a heuristic approach that based on column generation scheme to maximize
the set of non-disjoint area, with adjustable sensing range to improve the lifetime of the WSN. In
[16], the author encountered area coverage with varying sensing range by density control model
which improves the sensor’s coverage. Meanwhile in [17], target coverage problem with
adjustable sensing range is formulated as a non-linear integer programming problem to maximize
the network lifetime. In [18], the author proposed an algorithm that uses varying sensing ranges
and exploits node motion to fix emerging cap holes. The algorithm selects the appropriate nodes
by measuring the degree of interference and the residual energy of each sensor near the coverage
area. Further in [19], a dual-tuning duty cycle table scheme is proposed. This scheme mainly
consists of two duty cycle algorithms, an asynchronous tuning algorithm for active slot nodes in
the same sensing area, and a continuous tuning algorithm for two adjacent nodes on the routing
path with one active slot interval.
In [20], the author proposed a CS-based algorithm for efficient data transmission in WSN. It uses
Multiple Objective Genetic Algorithms to improve the transmission range and sensing area. In
[21], the author proposed a barrier coverage mechanism for adaptive sensing band utilization for
WSN. It applies a probabilistic sensing model to evaluate the contribution of cooperative sensing
to each sensor and to identify choke points in time and space during the barrier construction
process. It then adjusts the sensor diameter for the sensors with the greatest quality contribution
and then tabulates them to monitor the targets.
3. PROBLEM DEFINITION
Assume that N sensors are randomly deployed to cover X targets with each sensor has an initial
energy E and has the capability to varying its sensing range. Sensing range options are r1, r2….
rn, corresponding to energy consumptions of e1, e2, …, en. Assume a base station (BS) or sink
node located within the communication range of each sensor. One method to compute the sensor
target coverage is to consider that a sensor covers a target, if the Euclidean distance between the
sensor and target is no greater than sensing range. The formal problem definition is as follows:
Given M targets with known location and energy constrained, WSN with N sensors are randomly
deployed in the targets area, schedule the sensor nodes activity such that all targets are covered
and the network lifetime is maximized.
The approach that we used in this study is to organize the sensors in sets, where only one sensor
in the set is responsible for monitoring or sensing the target, and all other sensors are in sleep
mode. Besides determining the set covers, we are also concerned with setting the sensing range of
each active sensor. The goal is to use a minimum sensing range to minimize the energy
consumption for monitoring all targets in the network to maximize the network lifetime, NS3
4. International Journal of Computer Networks & Communications (IJCNC) Vol.14, No.1, January 2022
74
simulation tools is used to test the proposed algorithm and compare it with a recent algorithm in
this field.
4. USE CASE EXAMPLE
Given an area of interest, the WSN aims to achieve maximum lifetime by consuming minimal
power while covering all targets in the network area. The varying sensing range aims to schedule
all feasible cover activities to maximize the lifetime of WSN and forward each sensor in such a
way that it will not exceed its energy capacity. The following example shows how the adaptive
sensing radius can reduce power consumption to maximize the WSN lifetime. In this example, let
assume that there are four target (t1,t2,t3,t4) and five sensors (s1,s2,s3,s4,s5) with three sensing
radius (SR1,SR2,SR3). SR1 is the minimum sensing radius, SR2 is the medium sensing radius,
while SR3 is the maximum sensing radius (SR1<SR2< SR3) as shown in Figure 1.
Figure 1. Sensor Network for four targets and five sensors
Assume that the initial energy at each sensor is equal to 4, and ESR1=1(energy requires for one
time with sensing radius SR1), ESR2=2 (energy requires for one time with sensing radius SR2),
and ESR2 = 3 (energy requires for one time with sensing radius SR2).
In this sensor network, a sensor can be part of more than one set of scenario with six different
sets can be obtained using the adaption of sensing radius SR1, SR2, and SR3 as the following: C1
= {(s2, SR2), (s5, SR1}, C2 = {(s1, SR2), (s4, SR2)}, C3 = {(s2, SR1), (s5, SR2)}, C4= {(s2,
SR1), (s4, SR1) (s5, SR1)}, C5 = {(s1, SR2), (s3, SR1), (s4, SR1)}, C6 = {(s4, SR2), (s1, SR1),
(s5, SR1)}, as shown in Figure 2.
5. International Journal of Computer Networks & Communications (IJCNC) Vol.14, No.1, January 2022
75
Figure 2. Target cover with different sensing radius
If the sensor nodes do not have the adjustable sensing radius, then the life time if all the sensor
using SR3 is one round (3 joule for each round) , and if using SR2 is two round (2 joule for each
round) and if using SR1 is four round (1 joule for each round) as mention before , but when using
adaptive sensing range the life time is increasing to six round which is equal to three times
enhanced than traditional sensor network, assume the power consumption for each rounds as
follow , round one s2(4-2=2), s5(4-1=3), round two s1(4-2=2), s4 (4-2=2), round three s2(2-1
=2), s5 (3-2=1), round four s2(1-1=0), s4 (2-1=1) ,s5 (1-1=0), round five s1(2-2=0), s4 (1-
1=0),s3(4-1=3), and finally round six s3 (3-3=0)as shown in Table 1.
Table 1. Examples of life time rounds using adaptive sensing radius.
5. ADAPTIVE SENSOR SENSING RANGE (ASSR)
The objective of this study is to maximize the monitoring time of all targets in the network area
by sensors to increase the WSN lifetime because if there is any target that cannot be covered by
at least one sensor, the network become useless and the goal of the network fails, and it is useless
to have any sensors live after the network fails. There are two main questions that should be
Power Level
Round Power consumed Sensor 1 Sensor 2 Sensor 3 Sensor 4 Sensor 5
1 s2(4-2=2), s5 (4-1=3) 4 2 4 4 3
2 s1(4-2=2), s4 (4-2=2) 2 2 4 2 3
3 s2(2-1=2), s5 (3-2=1) 2 1 4 2 1
4 s2(1-1=0), s4 (2-1=1),s5 (1-1=0) 2 0 4 1 0
5 s1(2-2=0), s4 (1-1=0),s3 (4-1=3) 0 0 3 0 0
6 s3 (3-3=0) 0 0 0 0 0
6. International Journal of Computer Networks & Communications (IJCNC) Vol.14, No.1, January 2022
76
answered. The first question is: which condition must the sensor use it to become an active or idle
state, and the second question is: what should be the sensor sensing range if it decides to become
inactive state?
At any time, each sensor in the network must be in one of the following three states; 1) active
state, which means that the sensor monitors the target, 2) idle state, which means that the sensor
only listens to other sensors (doesn’t monitor the target), and 3) deciding state, which mean that
the sensor monitors target, but may change its state to active or idle state.
The procedure is as follows: Assume that each sensor can communicate with its adjacent sensors
with a maximum sensing range to find the covering of target. Each sensor broadcasts its battery
level and covered targets to all its adjacent sensors, and then stays deciding with its maximum
sensing range. However, when a sensor is in the decision state with range R (n), then it should
change its state to one of the following states:
Active state: with sensing range R(n) if there is a target at range R that are not covered by
any other active sensors.
Decision State: if all targets at range R are covered by an active sensor, then this sensor
became in deciding state and decreases its sensing range to the next range R (n-1)
Idle state or sleep state: when the sensing ranges of the sensor becomes R (0) which means
that the sensing range is 0 as shown in Figure 3.
If a target x has a small number of sensors that covers it (for example one, two, or three
sensors), we assume a small number of sensors by 1, 2, or 3 sensors because there is at least
one sensor to cover the target. When the power level of this sensor is exhausted, then it has
to make a choice between the other two sensors to cover the target. In other words, this is a
poor target, where it has a small number of sensors that cover it. Then, the sensor with the
highest energy level will then enter into active mode. In this situation, the rest will enter an
idle or sleep mode state, until this sensor that cover this target exhaust its battery level below
than these idle sensors. Then if that the case, one of the rest sensors is entering the active
state for the rest of time.
Figure 3. Diagram for deciding range and sensing range
7. International Journal of Computer Networks & Communications (IJCNC) Vol.14, No.1, January 2022
77
If a target x has a large number of sensors that cover it (for example more than three
sensors) and if the number of sensors is 4 or above, then we assume that this is a large
number because there are many choices available to cover this target. Therefore,
regarding a sensing range and power level, (in this case, it is a rich target), then the
overall sensors will cover this target. The sensor that does not cover many targets or the
sensor that has a small number of targets in its sensing range (poorest target cover), will
be placed an active mode state to cover this target. If there are several such sensors, then
the sensor that has the largest battery level among them is put into an active state to cover
this target as shown in Figure 4.
After all sensors have decided their states whether it is an active mode or idle mode
(sleep), each sensor will stay in that state some of time (the duration depends on the
nature of the target that we need to sense. For example, if the target is moving then this
period is small. Meanwhile, if the target is stationary or not moving then this period will
be long), or until there is an active sensor exhausts its power, and its power level dropped
to the level less than other sensor in the sleep mode state.
Figure 4. Flow chart for proposed technique (ASSR)
6. RESULTS AND DISCUSSIONS
In this section, we evaluate the performance of centralized and distributed algorithms and analyse
the data generated from the simulations. We have simulated a fixed sensing range with varying
sensing range. For the simulation environments, a static wireless network of sensors and targets
which are scattered and random in 100m x 100m area is considered as in [22] which yield a small
network. Menawhile, an environment with 1000m x 1000m is considered as in [23] which
represents a large network in order to show the robustness of the proposed technique. We assume
that the communication range for each sensor is two times the sensing range. The energy model is
the linear model e = c * r, where r is the distance from sensor to target (sensing range) as describe
in [24], and E = 10 is the sensor starting energy. For both energy models, the simulation results
are consistent. It indicates that network lifetime increases with the number of sensors and
decreases as more targets have to be monitored. All simulation parameter values are summarized
8. International Journal of Computer Networks & Communications (IJCNC) Vol.14, No.1, January 2022
78
and shown in Table 2. These values are considered from [25] in order for comparison purposes
between proposed technique and other existing techniques.
Table 2. Simulation parameters
Experiments were executed by varying the number of sensors and the lifetime is calculated from
the beginning of the execution of monitoring target until the time that the first target is does not
cover by any sensor. We also vary the maximum sensing range, and numbers of targets with
various experiment scenarios. The corresponding data and graphs were presented in the following
sections.
In Table 3, we use the same number of sensors i.e., between 10-200sensors.The number of targets
in this simulation is 40. We simulated four different existing algorithms, namely ALBP, DEEP
[26], ADEEP [27]. and Dilco [28], and compare with our proposed ASSR technique and analyse
the sensing range problem. The results indicate that the network lifetime increases with the
number of sensors, and the network lifetime using the proposed algorithm is better than the four
previous algorithms including the fixed range scenario. As shown in all experiments, the network
with fixed sensing range consumes more power than the network that using varying sensing
range. Figure 5 shows the graph result obtained from fixed range, ALBP, DEEP, ADEEP, Dilco
algorithms against our proposed algorithm.
Table 3. The lifetime (in second) of WSN with 40 targets for different sensing range algorithms
Sensor Number Fixed Sensing Range ALBP DEEP ADEEP Dilco Proposed
10 5.2 6.8 8.2 13.3 14 16
20 7.6 10.3 12.1 18.2 18.2 24.4
40 10.2 13 19.2 23.3 25 29.2
60 17.8 18.4 26.5 29.2 28.2 38.2
80 27.5 26.8 38.6 44.2 43.2 56.3
100 31.2 33.6 52.2 61.2 62.2 70.8
120 38.2 43.6 63.2 70.1 72.2 80.5
140 43.6 54.2 75.2 81.1 83.4 92.3
160 48 54.6 81.2 88.8 90.4 103.4
180 54.8 60.2 92.6 97 104.2 112.4
200 59.1 66 99.3 106.4 114.4 122.3
Parameter Value
Number of sensor node 10 - 200
Number of Target 40-120
sensing range 5m - 60m
Monitoring Area 100m x 100m
Initial energy 5 J
9. International Journal of Computer Networks & Communications (IJCNC) Vol.14, No.1, January 2022
79
Figure 5. Network lifetime for fixed range, ALBP, DEEP, ADEEP, Dilco algorithms and our proposed
technique obtained for 40 targets.
Results from second experiment is shown in Table 4. In this experiment, we use the same number
of sensors i.e., between 10-200sensors, with the number of targets are 70 targets. The results
obtained indicate that the network lifetime is decreased when the number of targets is increased.
Further, as shown in the result, the WSN lifetime obtained from our proposed technique (i.e.,
ASSR) is better than the four other algorithms. As shown in Table 4, the proposed technique
ASSR needs to be in a network that contain 200 sensorsfor122.3 seconds until the first target
becomes uncovered. Meanwhile, Dilco algorithm needs 114.4 seconds, ADEEP needs 106.4
seconds, DEEP needs 99.3 seconds, ALBP needs 65seconds, and the fixed sensing range needs
59 seconds. These results proved that our proposed technique is far better than ALBP algorithm
by100%, DEEP by 23%, ADEEP by 15.5%,and Delco by 8%.The network that is using fixed
sensing range consumes more power than the network that is using varying sensing range. This is
because of power consumption to monitor more than one target at the same time. Figure 6 shows
the graph for comparison results for different sensing range algorithms. As expected, the results
show that the proposed technique is the best technique when compared with other existing
algorithms by approximately 8% due to network life time.
Table 4. The lifetime of WSN with 70 targets for different sensing range algorithm
Sensor Number Fixed Sensing Range ALBP DEEP ADEEP Dilco Proposed
10 3 4.2 5.2 8.2 9.2 9.4
20 5.2 7.4 8.2 12.4 12.8 16.6
40 7.2 10.4 12.4 16.2 19.4 23.2
60 10.4 13.6 16.4 20.4 24.6 28.8
80 15.6 18.2 21.4 26.6 32.4 35.8
100 20.4 24.6 30.2 33.2 40.6 44.2
120 26.2 29.8 38.6 40.4 51.8 54.8
140 31.4 35.8 44.8 48.4 60.6 65.2
0
20
40
60
80
100
120
140
10 20 40 60 80 100 120 140 160 180 200
Network
Lifetime
Number Of sensor
Fixed Sensing
Range
ALBP
DEEP
ADEEP
Dilco
Proposed
10. International Journal of Computer Networks & Communications (IJCNC) Vol.14, No.1, January 2022
80
Figure 6. Network life time between fixed range, ALBP, DEEP, ADEEP, Dilco
and proposed technique for 70 targets.
Results from the last experiment is shown in Table 5. In this experiment, we use different number
of sensors as compared with previous experiments. We use large number of sensors to design a
huge network density. Number of sensors considered in this experiment is between 300-1500
sensors and the number of targets is 120.As shown in the result, our proposed technique ASSR
needs to be in a network that contain 1100 sensors for 393 seconds until the first target becomes
uncovered, while Dilco needs 378 seconds, ADEEP needs 361 seconds, DEEP needs 337
seconds, ALBP needs 318 seconds, and fixed sensing range needs 302 seconds. These results
proved that the ASSR is far better than ALBP by 23%, DEEP by 17%, ADEEP by 9%, and Delco
by 4%. Therefore, in summary, for small and large networks, the network that using fixed sensing
range, consumes more power than the network that using varying sensing range. Figure 7 shows
the graph comparison result for different sensing range algorithms, and it is proved that our
proposed technique is the best technique as compared to other technique in terms of network
lifetime.
160 36.8 40.6 56.4 59.2 71.4 77.4
180 41.6 48.2 65.8 72.4 85.8 90.2
200 49.6 56.2 77.2 85.6 96.6 102.4
11. International Journal of Computer Networks & Communications (IJCNC) Vol.14, No.1, January 2022
81
Table 5. The lifetime of Large WSN with 120 targets for different sensing range algorithm
Figure 7. Network life time between fixed range, ALBP, DEEP, ADEEP, Dilco and proposed technique for
120 targets
7. CONCLUSION
In this paper, we proposed a scheduling strategy technique for the target coverage problem of
WSN with varying sensing range named Adaptive Sensor Sensing Range (ASSR). The problem
addressed in this study is on how to achieve maximum network lifetime by varying the sensor
sensing range, while all targets in the network are covered and sensor energy resources are
constrained. Our proposed technique solved the power dissipation problem as it senses the same
target with many sensors and maximize the network life by decreasing the power dissipation due
the sensing range. The experiment results using NS3 simulation tool showed that the proposed
technique (i.e., ASSR) is capable to lengthen the network lifetime when compared with fixed
sensing range technique, and other four recent techniques addressed this problem by 20% in
small network, and approximately 8%.in large network. Finally, we conclude that the delay of
massages that have been sent in the network from sensors to the base station is an important
factor that must be taken into consideration in designing future solutions.
Sensor Number Fixed Sensing Range ALBP DEEP ADEEP Dilco Proposed
300 78 81 96 101 109 112
500 119 125 142 154 170 176
700 198 203 224 238 267 274
900 262 271 298 319 347 356
1100 302 318 337 361 378 393
1300 349 365 389 423 460 472
1500 372 398 421 458 492 506
12. International Journal of Computer Networks & Communications (IJCNC) Vol.14, No.1, January 2022
82
REFERENCE
[1] R. Hahn and H. Reichl, “Batteries and power supplies for wearable and ubiquitous computing,” in
Proc. 3rd Int. Symp. Wearable Computers, (1999).
[2] X. Wang, G. Xing, Y. Zhang, R. Pless C. Lu, and C. Gill. Integrated Coverage and Connectivity
Configuration in Wireless Sensor Networks. In Sensys, Nov (2003).
[3] A. Gallais, F. Ingelrest, J. Carle and D. Simplot-Ryl, Preserving Area Coverage in Sensor Networks
with a Realistic Physical Layer, in Proc. IEEE International Conference on Computer
Communications (INFOCOM, mini symposium), Anchorage, Alaska, pp. 2416–2420, (2007)
[4] G. J. Pottie and W. J. Kaiser, “Wireless integrated network sensors”, Communications of the
ACMVolume 43Issue 5May, pp 51–58 ,(2000)
[5] Hong Tao ZHANG “Key Technologies of Wireless Sensor Networks: A Review"IOP Conf. Series:
Journal of Physics: Conf. Series 1087 (2018) 062014.
[6] M. Cardei, J. Wu, N. Lu and M. O. Pervaiz, “Maximum Network Lifetime with Adjustable Range,”
IEEE International Conference on Wireless and Mobile Computing, Networking and
Communications, August (2015).
[7] H.Yang , Z.l Wang ,X.B Li ‘’Anovek sensor deployment method based on image processing and
wavelet transform to optimize the surface coverage in WSNs’’ Chinese Journal of Electrnic ,
Vol.25,No.3,pp.495-502 , (2016)
[8] A.Dhawan and A. Zelikovsky ‘’ Maximum lifetime of sensor network with adjustable sensing range’’
7th ACIS international conference on software engineering , artificial intelligence , Networking and
parallel and distributing computing pp.285-289, (2006)
[9] Liu Shufen, GAO Sihua, BAO Tie and ZHANG Yikum ‘’Ahybrid approach to maximize the lifetime
of directional sensor network with smoothy varying sensing range ‘’ Chinese Journal of Electronics
(CJE) vol.26, No.4,(2017)
[10] Aliyu, M., Abdullah A, Chizari H Sabbah T, Altameem A ‘’ Coverage enhancement algorithems for
distributed mobile sensor deployment in wireless sensor network ‘’ International Journal for
distributed sensor network 12(3), 1-9 (2016)
[11] T. Mishra, A. R. Panda, M. R. Lenka, D. Mahapatra and A. R. Swain, "Energy Efficient Coverage
and Connectivity with Varying Energy Level in WSN," IEEE, 2015 International Conference on
Computational Intelligence and Networks march,(2015).
[12] X. M. Guo, C. J. Zhao, X. T. Y. e. a. ‘A deterministic sensor node deployment method with target
coverage based on grid scan’ Chinese Journal of Sensors and Actuators, 25(1):104–109. (2012).
[13] Alduraibi Fahad, N. L. and Younis, M’ Coveragebased node placement optimization in wireless
sensor network with linear topology’ In (ICC), C., editor, IEEE International Conference on. IEEE.
IEEE International Conference on. IEEE (2016)
[14] Omar Banimelhem, Moad Mowafi, and Walid Aljoby ‘’Genetic algorithm based deployment in
hybrid wireless sensor networks'’, Communications and Network. Vol.5 , No.4 (2013)
[15] R. Cerulli, R. De. Donato and A. Raiconi “Exact and heuristic methods to maximize network lifetime
in wireless sensor networks with adjustable sensing range”, European Journal of Operation Research
220(1), pp.58-66, (2012)
[16] Vyacheslay, Zalyubovsiky, Adil Erzin, Sergey Astrakov and Hyunseung Choo” Energy- efficient
area coverage by sensors with two adjustable sensing range”, 7th international conference on
Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, pp. 305-312, IEEE, (2009)
[17] D. Arivudainambi , R. Pavithra & P. Kalyani ‘’ Cuckoo search algorithm for target coverage and
sensor scheduling with adjustable sensing range in wireless sensor network’’ Journal of Discrete
Mathematical Sciences and Cryptography, (2020)
[18] B. Khalifa, A. M. Khedr and Z. Al Aghbari, "A Coverage Maintenance Algorithm for Mobile WSNs
with Adjustable Sensing Range," in IEEE Sensors Journal, vol. 20, no. 3, pp. 1582-1591, 1 Feb.1,
(2020).
[19] GuopengLi, Fufang Li, Tian Wang, Jinsong Gui “Bi-adjusting duty cycle for green communications
in wireless sensor networks" Li et al. EURASIP Journal on Wireless Communications and
Networking (2020) 2020:166
[20] M. A. Mazaideh and J. Levendovszky, "A multi-hop routing algorithm for WSNs based on
compressive sensing and multiple objective genetic algorithm," in Journal of Communications and
Networks, vol. 23, no. 2, pp. 138-147, April (2021).
13. International Journal of Computer Networks & Communications (IJCNC) Vol.14, No.1, January 2022
83
[21] Z. Dong, C. Shang, C. Chang and D. S. Roy, "Barrier Coverage Mechanism Using Adaptive Sensing
Range for Renewable WSNs," in IEEE Access, vol. 8, pp. 86065-86080, (2020)
[22] S. Slijepcevic and M. Potkonjak. Power efficient organization of wireless sensor networks. In ICC
2001, May 2001.
[23] J. Santhosh, G. Arulkumaran, P. Balamurugan ‘’ Improved Energy Intrusion Detection System using
Fuzzy System in Wireless Sensor Network’’ International Journal of Recent Technology and
Engineering (IJRTE) ISSN: 2277-3878, Volume-7, December (2018)
[24] M. Cardei, J. Wu, M Liu, and M.O. Pervaiz. Maximum network lifetime in wireless sensor networks
with adjustable sensing ranges. In WiMob2005, Aug (2005).
[25] Satish C, Samayveer S and Bijendra K ‘’ hetADEEPS: ADEEPS for Heterogeneous Wireless Sensor
Networks’’ International Journal of Future Generation Communication and Networking Vol.6, No.5
(2013), pp.21-32
[26] D. Brinza and A. Zelikovsky, "DEEPS: Energy-Efficient Protocol for Sensor networks," Seventh
ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and
Parallel/Distributed Computing (SNPD'06), Las Vegas, NV, USA, 2006, pp. 261-266
[27] Satish Chand, Samayveer Singh and Bijendra Kumar ‘’ hetADEEPS: ADEEPS for Heterogeneous
Wireless Sensor Networks ‘’ International Journal of Future Generation Communication and
Networking Vol.6, No.5 (2013), pp.21-32
[28] Ali Kadhum Idrees, Karine Deschinkel, Michel Salomon, Raphael Couturier. Distributed lifetime
coverage optimization protocol in wireless sensor networks. The journal of Supercomputing, 71 (12),
pp.4578 - 4593. ffhal-02131127, (2017)
AUTHORS
Almamoon Alauthman received his Bachelor of Computer Engineering from Al-
Balqaa Applied University (ABU), Amman, Jordan. And Master’s degree of Computer
Engineering from Jordan University for Science and Technology (JUST), Irbid, Jordan.
Now he is a Ph.D. student at UNISA University (Malaysia), His research interest
includes VLSI design, Parallel processing, neural network, Computer Architecture
&organization, Wireless Network.
Wan Nor Shuhadah Wan Nik is currently a senior lecturer in the Faculty of
Informatics and Computing, University Sultan Zainal Abidin (UniSA), Malaysia. She
received a Ph.D. in Computer Science (Distributed Systems) from the University of
Sydney, Australia in 2012 before being appointed as a Deputy Director (Infrastructure
& Services) at Information Technology Centre, UniSA from the year 2014 - 2017. She
has been involved in more than ten research grants and led four national grants in the
area of Distributed Systems. Her main research interest includes the area of Computer
Networks and Distributed Systems, including Scheduling in Grid / Cloud and Utility Computing, Wireless
Sensor Networks, IoT, Heuristics and Optimization, and Block chain.
Nor Aida Mahiddin received the B.S. Degree in Information Technology from
National University of Malaysia, the Master's Degree in Computer Science Major in
Distributed Computing and Ph.D. degrees in Computer and Information Sciences from
Auckland University of Technology, New Zealand. she is currently a lecturer at the
Faculty of Informatics and Computing, University Sultan Zainal Abidin, Malaysia. She
is the author of several papers in peer-reviewed journals and conferences proceeding.
She is currently a member of the Institute of Electrical and Electronics Engineers
(IEEE), Internet Society and The Society of Digital Information and Wireless
Communications (SDIWC). Her research interests include network design, modelling and performance
evaluation, wireless communication networks, disaster-resilient network design, optimization of gateway
congestion control, ad hoc and sensor networks and wireless mesh and routing protocols.