This document presents a study on resource allocation techniques in LTE-Advanced cellular systems that use device-to-device communication. The study considers a dual hop device-to-device network that can operate using amplify-and-forward or decode-and-forward relay transmission modes. Analytical solutions are derived for optimal power allocation and subcarrier pairing schemes using convex optimization techniques. Simulations validate the proposed resource allocation schemes and show that the subcarrier pairing schemes improve overall sum throughput. The goals are to investigate optimal resource allocation algorithms for power control and subcarrier assignment over two hops in LTE-Advanced networks.
Sensor networks consist of randomly deployed nodes that are powered by smaller batteries. The quantum and quality of information sensed by these nodes is of vital importance. Battery saving techniques or algorithms are need of the hour. One such technique is clustering of the nodes. This paper presents modification to existing DEEHC algorithm that builds multiple vertex disjoint paths from nodes to base station via cluster heads. The proposed modification (MDEEHC) improves the performance of the network as equated to DEEHC and FLDEEC by relaying the data of the child cluster heads using relay nodes. MDEEHC shows improvement in terms of throughput, packet delivery ratio, number of packet drops and remaining energy. Pragati Dikshit | Rajveer Kaur Hyher | Goldendeep Kaur"An Improved DEEHC to Extend Lifetime of WSN" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-2 | Issue-5 , August 2018, URL: http://www.ijtsrd.com/papers/ijtsrd15905.pdf http://www.ijtsrd.com/engineering/computer-engineering/15905/an-improved-deehc-to-extend-lifetime-of-wsn/pragati-dikshit
Wireless Sensor Network Based Clustering Architecture for Cooperative Communi...ijtsrd
We propose clusters based cooperatives based verbal architecture coop on the cellular ad hoc wireless sensor network Mawsn with the environment fading Rayleigh. The main ability and contributions of this paper are as follows. First, the proposed cage uses a cluster as a underlying system to help stable transmission services. 2D, the proposed enclosure uses a cluster based verbal cooperative exchange to effectively guide the package delivery ratio with multi hop power saving transmission. 0.33, we do not forget reasonable methods mainly based on cellular ad hoc nodes with sensing features and constant sensor nodes in the sensor field along with conventional research for the introduction of constant network sensors. Fourth, we have theoretical analysis with blackouts opportunities for proposed cooperative transmissions. Overall performance evaluation is run through simulation and evaluation. Sweeti Kumari | Dr. Ranjan Kumar Singh "Wireless Sensor Network Based Clustering Architecture for Cooperative Communication" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-5 | Issue-4 , June 2021, URL: https://www.ijtsrd.compapers/ijtsrd43670.pdf Paper URL: https://www.ijtsrd.comengineering/electronics-and-communication-engineering/43670/wireless-sensor-network-based-clustering-architecture-for-cooperative-communication/sweeti-kumari
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.
Characterization of directed diffusion protocol in wireless sensor networkijwmn
Wireless sensor network (WSN) has enormous applications in many places for monitoring the environments
of importance. Sensor nodes are capable of sensing, computing, and communicating. These sensor nodes
are energy constraint and operated by batteries. Since energy consumption is an important issue of WSN,
there have been many energy-efficient protocols proposed for the WSN. Directed diffusion (DD) is a datacentric
protocol that focuses on the energy efficiency of the networks. Since the first proposal of DD
protocol by Deborah, there have been various versions of DD protocols proposed by many scientists across
the globe. These upgraded versions of DD protocols add on various features to the original DD protocol
such as energy, scalability, network lifetime, security, reliability, and mobility. In this paper, we discuss
and classify various characteristics of themost populardirected diffusion protocols that have been proposed
over couple of years.
Sensor networks consist of randomly deployed nodes that are powered by smaller batteries. The quantum and quality of information sensed by these nodes is of vital importance. Battery saving techniques or algorithms are need of the hour. One such technique is clustering of the nodes. This paper presents modification to existing DEEHC algorithm that builds multiple vertex disjoint paths from nodes to base station via cluster heads. The proposed modification (MDEEHC) improves the performance of the network as equated to DEEHC and FLDEEC by relaying the data of the child cluster heads using relay nodes. MDEEHC shows improvement in terms of throughput, packet delivery ratio, number of packet drops and remaining energy. Pragati Dikshit | Rajveer Kaur Hyher | Goldendeep Kaur"An Improved DEEHC to Extend Lifetime of WSN" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-2 | Issue-5 , August 2018, URL: http://www.ijtsrd.com/papers/ijtsrd15905.pdf http://www.ijtsrd.com/engineering/computer-engineering/15905/an-improved-deehc-to-extend-lifetime-of-wsn/pragati-dikshit
Wireless Sensor Network Based Clustering Architecture for Cooperative Communi...ijtsrd
We propose clusters based cooperatives based verbal architecture coop on the cellular ad hoc wireless sensor network Mawsn with the environment fading Rayleigh. The main ability and contributions of this paper are as follows. First, the proposed cage uses a cluster as a underlying system to help stable transmission services. 2D, the proposed enclosure uses a cluster based verbal cooperative exchange to effectively guide the package delivery ratio with multi hop power saving transmission. 0.33, we do not forget reasonable methods mainly based on cellular ad hoc nodes with sensing features and constant sensor nodes in the sensor field along with conventional research for the introduction of constant network sensors. Fourth, we have theoretical analysis with blackouts opportunities for proposed cooperative transmissions. Overall performance evaluation is run through simulation and evaluation. Sweeti Kumari | Dr. Ranjan Kumar Singh "Wireless Sensor Network Based Clustering Architecture for Cooperative Communication" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-5 | Issue-4 , June 2021, URL: https://www.ijtsrd.compapers/ijtsrd43670.pdf Paper URL: https://www.ijtsrd.comengineering/electronics-and-communication-engineering/43670/wireless-sensor-network-based-clustering-architecture-for-cooperative-communication/sweeti-kumari
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.
Characterization of directed diffusion protocol in wireless sensor networkijwmn
Wireless sensor network (WSN) has enormous applications in many places for monitoring the environments
of importance. Sensor nodes are capable of sensing, computing, and communicating. These sensor nodes
are energy constraint and operated by batteries. Since energy consumption is an important issue of WSN,
there have been many energy-efficient protocols proposed for the WSN. Directed diffusion (DD) is a datacentric
protocol that focuses on the energy efficiency of the networks. Since the first proposal of DD
protocol by Deborah, there have been various versions of DD protocols proposed by many scientists across
the globe. These upgraded versions of DD protocols add on various features to the original DD protocol
such as energy, scalability, network lifetime, security, reliability, and mobility. In this paper, we discuss
and classify various characteristics of themost populardirected diffusion protocols that have been proposed
over couple of years.
AN EFFICIENT BANDWIDTH OPTIMIZATION AND MINIMIZING ENERGY CONSUMPTION UTILIZI...IJCNCJournal
The bandwidth utilization plays a vital role in a Wireless Sensor Network (WSN) that transmits data packets from source peer to perspective destination peer without any packet loss and time delay. In a conventional system, two main features cannot be satisfied concurrently such as low delay and high data
reliability and then the peer was transferred fewer data packets and it optimized with regular bandwidth rate. Moreover, the convention of bandwidth in network routers influences the quality of service (QoS). To overcome the above issues, an Efficient Reliability and Interval Discrepant Routing (ERIDR) algorithm is proposed to optimize bandwidth utilization on the router network with the help of bandwidth optimizer. The
bandwidth optimizer allocates required bandwidth for data transmission to each peer simultaneously to ensure the bandwidth efficiency. The proposed design is to optimize bandwidth utilization of every peer and increase data processing via higher bandwidth rate that reduces time delay and minimizes energy consumption. The proposed method establishes a high bandwidth rate router to transmit data concurrently from source peer to destination peer (peer-to-peer) without any packet loss by initializing host IP address for every peer. Based on Experimental evaluations, proposed methodology reduces 3.32 AD (Average Delay), 0.05 ET (Execution Time), 5.44 EC (Energy Consumption) and 0.28 BU (Bandwidth Utilization)
compared than existing methodologies.
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.
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.
Extending the longevity, is a significant job to be accomplished by these sensor networks. The traditional routing protocols could not be applied here, due to its nodes powered by batteries. Nodes are often clustered in to non-overlapping clusters, so as to provide energy efficiency. A concise overview on clustering processes, within wireless sensor networks is given in this paper. But it is difficult to replace the deceased batteries of the sensor nodes. A distinctive sensor node consumes much of its energy during wireless communication. This research work suggests the development of a hierarchical distributed clustering mechanism, which gives improved performance over the existing clustering algorithm LEACH. The two hiding concepts behind the proposed scheme are the hierarchical distributed clustering mechanism and the concept of threshold. Energy utilization is significantly reduced, thereby greatly prolonging the lifetime of the sensor nodes.
A NOVEL ROUTING PROTOCOL FOR TARGET TRACKING IN WIRELESS SENSOR NETWORKSIJCNCJournal
Wireless sensor networks (WSNs) are large scale integration consists of hundreds or thousands or more
number of sensor nodes. They are tiny, low cost, low weight, and limited battery, primary storage,
processing power. They have wireless capabilities to monitor physical or environmental conditions. This
paper compared the performance analysis of some existing routing protocols for target tracking
application with proposed hierarchical binary tree structure to store the routing information. The sensed
information is stored in controlled way at multiple sensor nodes (e.g. node, parent node and grandparent
node) which deployed using complete binary tree data structure. This reduces traffic implosion and
geographical overlapping. Simulation result showed improved network lifetime by 20%, target detection
probability by 25%, and reduces error rate by 20%, energy efficiency, fault tolerance, and routing
efficiency. We have evaluated our proposed algorithm using NS2.
LIFETIME IMPROVEMENT USING MOBILE AGENT IN WIRELESS SENSOR NETWORKJournal For Research
Wireless sensor networks have attracted much attention in the research community over the last few years, driven by a wealth of theoretical and practical challenges and an increasing number of practical civilian application. ‘one deployment, multiple applications’ is an emerging trend in the development of WSN, due to the high cost of deploying hundreds and thousands of sensors nodes over a wide geographical area and the application-specific nature of tasking a WSN. A wireless sensor network is a collection of nodes organized into a cooperative network. To reduce the energy consumption, the transmission of data between sensor nodes must be reduced in order to preserve the remaining energy in cluster node. We propose a new energy balancing architecture based on cluster with hexagonal geometry with radius R.select the base station and after select the cluster head with maximum energy of the node and after select mobile agent in minimum distance to cluster head and second highest maximum energy. And then send the data mobile agent to cluster head and cluster head to base station.and we have energy management must be followed to balance the energy in the whole network and improving network lifetime.
ENERGY EFFICIENT ROUTING IN WIRELESS SENSOR NETWORKS BASED ON QOSIAEME Publication
Energy is a serious resource parameter in Wireless Sensor Networks. Utilizing energy in an effectual manner is a challenging task in Wireless Sensor Networks. This paper presents an overview on various energy efficient routing protocols which fulfills the criteria of QoS parameters. Various energy effective and QoS based routing protocols have been compared. To improve the QoS in a network, data fusion and data accumulation is considered to be one of major energy saving technique. The routing protocols based on data aggregation, reduced cost routing and secure routing are also discussed in detail. Simulation tools like NS2, NS3, OMNET etc can be used to evaluate the network performance.
The rapid need of wireless demands a great deal of security and reliable routing in order to keep all the data sources and equipments secure. In order to develop efficient and robust protocols, it is essential to understand the inherent characteristics of wireless networks such as connectivity, coverage and varying channel conditions. Wireless LAN introduces the concept that use can connect to any one at any place at anytime by using various mobile appliances that can be carried at any place. Now Communication is no longer limited to a one place by holding wired phones. This is the big boom to the I.T industry but it also brings a lot of opportunities and challenges for the Network Administrator who is looking after the Wireless LANs (WLAN). WLAN traffic travels over radio waves that cannot be constrained by the walls or any Simranjeet Kaur"Reliable and Efficient Routing in WLAN" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-1 | Issue-6 , October 2017, URL: http://www.ijtsrd.com/papers/ijtsrd3585.pdf http://www.ijtsrd.com/computer-science/computer-network/3585/reliable-and-efficient-routing-in-wlan/simranjeet-kaur
AN ENHANCED HYBRID ROUTING AND CLUSTERING TECHNIQUE FOR WIRELESS SENSOR NETWORKijwmn
Wireless Sensor Networks (WSN) have extensively deployed in a wide range of applications. However, WSN still faces several limitations in processing capabilities, memory, and power supply of sensor nodes. It is required to extend the lifetime of WSN. Mainly this is achieved by routing protocols choosing the best transmission path in-network with desired power conservation.This cause is developing a generic protocol framework for WSNa big challenge. This work proposed a new routing technique, described as Hybrid Routing-Clustering (HRC) model. This new approach takes advantage of clustering and routing procedures defined in K-Mean clustering and AODV routing, which constituted of three phases. This development aims to achieve enhanced power conservation rate in consequence network lifetime. An extensive evaluation methodology utilized to measure the performance of the proposed model in simulated scenarios.The results categorized in terms of the average amount of packet received and power conservation rate. The Hybrid Routing-Clustering (HRC) model was determined, showed enhanced results regarding both parameters. In the end, they are comparing these results with well-known routing and well-known clustering algorithms.
Interoperator Dynamic Spectrum Sharing (Analysis, Costs and Implications)CSCJournals
This paper addresses Dynamic Spectrum Sharing (DSS) between two wireless operators. The Universal Mobile Telecommunication System (UMTS) network is used as a case study. The proposed protocol is evaluated under the uniform and non-uniform traffic conditions. The underlying principles of the algorithm can be deployed in the UMTS extension Band (2500MHz-2690MHz) which is yet to be allocated or the re-farmed GSM spectrum (900MHz/1800MHz). The simulation results for the proposed protocol shows that significant spectrum sharing gains can be obtained. However such spectrum efficiency gain need to be carefully balanced with the complexity in terms of latency (delays) and additional overhead it brings to the network. The results show that significant spectrum sharing gain of 4.0 % and 2.0 % can be obtained under uniform and non-uniform traffic conditions
A Novel Weighted Clustering Based Approach for Improving the Wireless Sensor ...IJERA Editor
Great lifetime and reliability is the key aim of Wireless Sensor Network (WSN) design. As for prolonging
lifetime of this type of network, energy is the most important resource; all recent researches are focused on more
and more energy efficient techniques. Proposed work is Weighted Clustering Approach based on Weighted
Cluster Head Selection, which is highly energy efficient and reliable in mobile network scenario. Weight
calculation using different attributes of the nodes like SNR (Signal to Noise Ratio), Remaining Energy, Node
Degree, Mobility, and Buffer Length gives efficient Cluster Head (CH) on regular interval of time. CH rotation
helps in optimum utilization of energy available with all nodes; results in prolonged network lifetime.
Implementation is done using the NS2 network simulator and performance evaluation is carried out in terms of
PDR (Packet Delivery Ratio), End to End Delay, Throughput, and Energy Consumption. Demonstration of the
obtained results shows that proposed work is adaptable for improving the performance. In order to justify the
solution, the performance of proposed technique is compared with the performance of traditional approach. The
performance of proposed technique is found optimum as compared to the traditional techniques.
Load Balancing for Achieving the Network Lifetime in WSN-A SurveyAM Publications
a wireless sensor network is network form of sense compute, and communication elements which helps to
observe, events in a specified environment. Sensor nodes in wireless sensor network are depends on battery power they
have limited transmission range that’s why energy efficiency plays a vital role to minimize the overhead through which
the Network Lifetime can be achieved. The lifetime of network, depends on number of nodes, strength, range of area
and connectivity of nodes in the network. In this paper we are over viewing techniques which are used in wireless sensor
network for load balancing. Wireless sensor network having different nodes with different kind of energy which can be
improve the lifetime of the network and its dependability. This paper will provide the person who reads with the
groundwork for research in load balancing techniques for wireless sensor networks.
Congestion Control Clustering a Review PaperEditor IJCATR
Wireless Sensor Networks consists of sensor nodes which are scattered in the environment, gather data and transmit it to a
base station for processing. Energy conservation in the Wireless Sensor Networks (WSN) is a very important task because of their
limited battery power. The related works so far have been done have tried to solve the problem keeping in the mind the constraints of
WSNs. In this paper, a priority based application specific congestion control clustering (PASCCC) protocol has been studied, which
often integrates the range of motion and heterogeneity of the nodes to detect congestion in a very network. Moreover a comparison of
the various clustering techniques has been done. From the survey it has been found that none of the protocol is efficient for energy
conservation. Hence the paper ends with future scope to overcome these issues.
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.
Performance evaluation of data filtering approach in wireless sensor networks...ijmnct
Wireless Sensor Network is a field of research which is viable in every application area like security
services, patient care, traffic regulations, habitat monitoring and so on. The resource limitation of small
sized tiny nodes has always been an issue in wireless sensor networks. Various techniques for improving
network lifetime have been proposed in the past. Now the attention has been shifted towards heterogeneous
networks rather than having homogeneous sensor nodes in a network. The concept of partial mobility has
also been suggested for network longevity. In all the major proposals; clustering and data aggregation in
heterogeneous networks has played an integral role. This paper contributes towards a new concept of
clustering and data filtering in wireless sensor networks. In this paper we have compared voronoi based
ant systems with standard LEACH-C algorithm and MTWSW with TWSW algorithm. Both the techniques
have been applied in heterogeneous wireless sensor networks. This approach is applicable both for critical
as well as for non-critical applications in wireless sensor networks. Both the approaches presented in this
paper outperform LEACH-C and TWSW in terms of energy efficiency and shows promising results for
future work.
Device-to-device (D2D) communications underlaying a cellular infrastructure has been proposed as a means of taking advantage of the physical proximity of communicating devices, increasing resource utilization, and improving cellular coverage. Relative to the traditional cellular methods, there is a need to design new peer discovery methods, physical layer procedures, and radio resource management algorithms that help realize the potential article we use the 3GPP Long Term Evolution system as a baseline for D2D design, review some of the key design challenges, and propose solution approaches that allow cellular devices and D2D pairs to share spectrum resources and thereby increase the spectrum and energy efficiency of traditional cellular networks. Sim- ulation results illustrate the viability of the proposed design.
Markovian Queueing Model for Throughput Maximization in D2D-Enabled Cellular ...IJECEIAES
Device-to-Device (D2D) communication has been considered a key enabling technol- ogy that can facilitate spectrum sharing in 4G and 5G cellular networks. In order to meet the high data rate demands of these new generation cellular networks, this paper considers the optimization of available spectrum resource through dynamic spectrum access. The utilization of continuous-time Markov chain (CTMC) model for efficient spectrum access in D2D-enabled cellular networks is investigated for the purpose of determining the impact of this model on the capacity improvement of cellular networks. The paper considers the use of CTMC model with both queueing and non-queueing cases called 13-Q CTMC and 6-NQ CTMC respectively with the aim of improving the overall capacity of the cellular network under a fairness constraint among all users. The proposed strategy consequently ensures that spectrum access for cellular and D2D users is optimally coordinated by designing optimal spectrum access probabilities. Numerical simulations are performed to observe the impact of the proposed Markovian queueing model on spectrum access and consequently on the capacity of D2D-enabled cellular networks. Results showed that the proposed 13-Q CTMC provide a more spectrumefficient sharing scheme, thereby enabling better network performances and larger capabilities to accommodate more users.
Optical network is an emerging technology for data communication
inworldwide. The information is transmitted from the source to destination
through the fiber optics. All optical network (AON) provides good
transmission transparency, good expandability, large bandwidth, lower bit
error rate (BER), and high processing speed. Link failure and node failure
haveconsistently occurred in the traditional methods. In order to overcome
the above mentioned issues, this paper proposes a robust software defined
switching enabled fault localization framework (SDSFLF) to monitor the
node and link failure in an AON. In this work, a novel faulty node
localization (FNL) algorithm is exploited to locate the faulty node. Then, the
software defined faulty link detection (SDFLD) algorithm that addresses the
problem of link failure. The failures are localized in multi traffic stream
(MTS) and multi agent system (MAS). Thus, the throughput is improved in
SDSFLF compared than other existing methods like traditional routing and
wavelength assignment (RWA), simulated annealing (SA) algorithm, attackaware RWA (A-RWA) convex, longest path first (LPF) ordering, and
biggest source-destination node degree (BND) ordering. The performance of
the proposed algorithm is evaluated in terms of network load, wavelength
utilization, packet loss rate, and burst loss rate. Hence, proposed SDSFLF
assures that high performance is achieved than other traditional techniques.
A bipartite graph based proportional fair scheduling strategy to improve thr...IJECEIAES
The fifth-generation wireless communication is expected to provide a huge amount of capacity to cater to the need of an increasing number of mobile consumers, which can be satisfied by device-to-device (D2D) communication. Reusing the cellular user’s resources in an efficient manner helps to increase the spectrum efficiency of the network but it leads to severe interference. The important point in reusing cellular user resources is that D2D communication should not affect the cellular user’s efficiency. After achieving this requirement, the focus is now turned toward the allocation of resources to D2D communication. This resource allocation strategy is to be designed in such a way that it will not affect communication among the cellular user (CU). This scheme improves various performance objectives. This paper aims at designing a proportional fair resource allocation algorithm based on the bipartite graph which maintains the quality of service (QoS) of CUs while providing D2D communication. This algorithm can be merged with any other scheme of resource allocation for improving QoS and adopting changing channels. In this scheme, a D2D pair can be allocated with one or more than one resource blocks. The MATLAB simulations analyze the performance of the proposed scheme.
AN EFFICIENT BANDWIDTH OPTIMIZATION AND MINIMIZING ENERGY CONSUMPTION UTILIZI...IJCNCJournal
The bandwidth utilization plays a vital role in a Wireless Sensor Network (WSN) that transmits data packets from source peer to perspective destination peer without any packet loss and time delay. In a conventional system, two main features cannot be satisfied concurrently such as low delay and high data
reliability and then the peer was transferred fewer data packets and it optimized with regular bandwidth rate. Moreover, the convention of bandwidth in network routers influences the quality of service (QoS). To overcome the above issues, an Efficient Reliability and Interval Discrepant Routing (ERIDR) algorithm is proposed to optimize bandwidth utilization on the router network with the help of bandwidth optimizer. The
bandwidth optimizer allocates required bandwidth for data transmission to each peer simultaneously to ensure the bandwidth efficiency. The proposed design is to optimize bandwidth utilization of every peer and increase data processing via higher bandwidth rate that reduces time delay and minimizes energy consumption. The proposed method establishes a high bandwidth rate router to transmit data concurrently from source peer to destination peer (peer-to-peer) without any packet loss by initializing host IP address for every peer. Based on Experimental evaluations, proposed methodology reduces 3.32 AD (Average Delay), 0.05 ET (Execution Time), 5.44 EC (Energy Consumption) and 0.28 BU (Bandwidth Utilization)
compared than existing methodologies.
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.
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.
Extending the longevity, is a significant job to be accomplished by these sensor networks. The traditional routing protocols could not be applied here, due to its nodes powered by batteries. Nodes are often clustered in to non-overlapping clusters, so as to provide energy efficiency. A concise overview on clustering processes, within wireless sensor networks is given in this paper. But it is difficult to replace the deceased batteries of the sensor nodes. A distinctive sensor node consumes much of its energy during wireless communication. This research work suggests the development of a hierarchical distributed clustering mechanism, which gives improved performance over the existing clustering algorithm LEACH. The two hiding concepts behind the proposed scheme are the hierarchical distributed clustering mechanism and the concept of threshold. Energy utilization is significantly reduced, thereby greatly prolonging the lifetime of the sensor nodes.
A NOVEL ROUTING PROTOCOL FOR TARGET TRACKING IN WIRELESS SENSOR NETWORKSIJCNCJournal
Wireless sensor networks (WSNs) are large scale integration consists of hundreds or thousands or more
number of sensor nodes. They are tiny, low cost, low weight, and limited battery, primary storage,
processing power. They have wireless capabilities to monitor physical or environmental conditions. This
paper compared the performance analysis of some existing routing protocols for target tracking
application with proposed hierarchical binary tree structure to store the routing information. The sensed
information is stored in controlled way at multiple sensor nodes (e.g. node, parent node and grandparent
node) which deployed using complete binary tree data structure. This reduces traffic implosion and
geographical overlapping. Simulation result showed improved network lifetime by 20%, target detection
probability by 25%, and reduces error rate by 20%, energy efficiency, fault tolerance, and routing
efficiency. We have evaluated our proposed algorithm using NS2.
LIFETIME IMPROVEMENT USING MOBILE AGENT IN WIRELESS SENSOR NETWORKJournal For Research
Wireless sensor networks have attracted much attention in the research community over the last few years, driven by a wealth of theoretical and practical challenges and an increasing number of practical civilian application. ‘one deployment, multiple applications’ is an emerging trend in the development of WSN, due to the high cost of deploying hundreds and thousands of sensors nodes over a wide geographical area and the application-specific nature of tasking a WSN. A wireless sensor network is a collection of nodes organized into a cooperative network. To reduce the energy consumption, the transmission of data between sensor nodes must be reduced in order to preserve the remaining energy in cluster node. We propose a new energy balancing architecture based on cluster with hexagonal geometry with radius R.select the base station and after select the cluster head with maximum energy of the node and after select mobile agent in minimum distance to cluster head and second highest maximum energy. And then send the data mobile agent to cluster head and cluster head to base station.and we have energy management must be followed to balance the energy in the whole network and improving network lifetime.
ENERGY EFFICIENT ROUTING IN WIRELESS SENSOR NETWORKS BASED ON QOSIAEME Publication
Energy is a serious resource parameter in Wireless Sensor Networks. Utilizing energy in an effectual manner is a challenging task in Wireless Sensor Networks. This paper presents an overview on various energy efficient routing protocols which fulfills the criteria of QoS parameters. Various energy effective and QoS based routing protocols have been compared. To improve the QoS in a network, data fusion and data accumulation is considered to be one of major energy saving technique. The routing protocols based on data aggregation, reduced cost routing and secure routing are also discussed in detail. Simulation tools like NS2, NS3, OMNET etc can be used to evaluate the network performance.
The rapid need of wireless demands a great deal of security and reliable routing in order to keep all the data sources and equipments secure. In order to develop efficient and robust protocols, it is essential to understand the inherent characteristics of wireless networks such as connectivity, coverage and varying channel conditions. Wireless LAN introduces the concept that use can connect to any one at any place at anytime by using various mobile appliances that can be carried at any place. Now Communication is no longer limited to a one place by holding wired phones. This is the big boom to the I.T industry but it also brings a lot of opportunities and challenges for the Network Administrator who is looking after the Wireless LANs (WLAN). WLAN traffic travels over radio waves that cannot be constrained by the walls or any Simranjeet Kaur"Reliable and Efficient Routing in WLAN" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-1 | Issue-6 , October 2017, URL: http://www.ijtsrd.com/papers/ijtsrd3585.pdf http://www.ijtsrd.com/computer-science/computer-network/3585/reliable-and-efficient-routing-in-wlan/simranjeet-kaur
AN ENHANCED HYBRID ROUTING AND CLUSTERING TECHNIQUE FOR WIRELESS SENSOR NETWORKijwmn
Wireless Sensor Networks (WSN) have extensively deployed in a wide range of applications. However, WSN still faces several limitations in processing capabilities, memory, and power supply of sensor nodes. It is required to extend the lifetime of WSN. Mainly this is achieved by routing protocols choosing the best transmission path in-network with desired power conservation.This cause is developing a generic protocol framework for WSNa big challenge. This work proposed a new routing technique, described as Hybrid Routing-Clustering (HRC) model. This new approach takes advantage of clustering and routing procedures defined in K-Mean clustering and AODV routing, which constituted of three phases. This development aims to achieve enhanced power conservation rate in consequence network lifetime. An extensive evaluation methodology utilized to measure the performance of the proposed model in simulated scenarios.The results categorized in terms of the average amount of packet received and power conservation rate. The Hybrid Routing-Clustering (HRC) model was determined, showed enhanced results regarding both parameters. In the end, they are comparing these results with well-known routing and well-known clustering algorithms.
Interoperator Dynamic Spectrum Sharing (Analysis, Costs and Implications)CSCJournals
This paper addresses Dynamic Spectrum Sharing (DSS) between two wireless operators. The Universal Mobile Telecommunication System (UMTS) network is used as a case study. The proposed protocol is evaluated under the uniform and non-uniform traffic conditions. The underlying principles of the algorithm can be deployed in the UMTS extension Band (2500MHz-2690MHz) which is yet to be allocated or the re-farmed GSM spectrum (900MHz/1800MHz). The simulation results for the proposed protocol shows that significant spectrum sharing gains can be obtained. However such spectrum efficiency gain need to be carefully balanced with the complexity in terms of latency (delays) and additional overhead it brings to the network. The results show that significant spectrum sharing gain of 4.0 % and 2.0 % can be obtained under uniform and non-uniform traffic conditions
A Novel Weighted Clustering Based Approach for Improving the Wireless Sensor ...IJERA Editor
Great lifetime and reliability is the key aim of Wireless Sensor Network (WSN) design. As for prolonging
lifetime of this type of network, energy is the most important resource; all recent researches are focused on more
and more energy efficient techniques. Proposed work is Weighted Clustering Approach based on Weighted
Cluster Head Selection, which is highly energy efficient and reliable in mobile network scenario. Weight
calculation using different attributes of the nodes like SNR (Signal to Noise Ratio), Remaining Energy, Node
Degree, Mobility, and Buffer Length gives efficient Cluster Head (CH) on regular interval of time. CH rotation
helps in optimum utilization of energy available with all nodes; results in prolonged network lifetime.
Implementation is done using the NS2 network simulator and performance evaluation is carried out in terms of
PDR (Packet Delivery Ratio), End to End Delay, Throughput, and Energy Consumption. Demonstration of the
obtained results shows that proposed work is adaptable for improving the performance. In order to justify the
solution, the performance of proposed technique is compared with the performance of traditional approach. The
performance of proposed technique is found optimum as compared to the traditional techniques.
Load Balancing for Achieving the Network Lifetime in WSN-A SurveyAM Publications
a wireless sensor network is network form of sense compute, and communication elements which helps to
observe, events in a specified environment. Sensor nodes in wireless sensor network are depends on battery power they
have limited transmission range that’s why energy efficiency plays a vital role to minimize the overhead through which
the Network Lifetime can be achieved. The lifetime of network, depends on number of nodes, strength, range of area
and connectivity of nodes in the network. In this paper we are over viewing techniques which are used in wireless sensor
network for load balancing. Wireless sensor network having different nodes with different kind of energy which can be
improve the lifetime of the network and its dependability. This paper will provide the person who reads with the
groundwork for research in load balancing techniques for wireless sensor networks.
Congestion Control Clustering a Review PaperEditor IJCATR
Wireless Sensor Networks consists of sensor nodes which are scattered in the environment, gather data and transmit it to a
base station for processing. Energy conservation in the Wireless Sensor Networks (WSN) is a very important task because of their
limited battery power. The related works so far have been done have tried to solve the problem keeping in the mind the constraints of
WSNs. In this paper, a priority based application specific congestion control clustering (PASCCC) protocol has been studied, which
often integrates the range of motion and heterogeneity of the nodes to detect congestion in a very network. Moreover a comparison of
the various clustering techniques has been done. From the survey it has been found that none of the protocol is efficient for energy
conservation. Hence the paper ends with future scope to overcome these issues.
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.
Performance evaluation of data filtering approach in wireless sensor networks...ijmnct
Wireless Sensor Network is a field of research which is viable in every application area like security
services, patient care, traffic regulations, habitat monitoring and so on. The resource limitation of small
sized tiny nodes has always been an issue in wireless sensor networks. Various techniques for improving
network lifetime have been proposed in the past. Now the attention has been shifted towards heterogeneous
networks rather than having homogeneous sensor nodes in a network. The concept of partial mobility has
also been suggested for network longevity. In all the major proposals; clustering and data aggregation in
heterogeneous networks has played an integral role. This paper contributes towards a new concept of
clustering and data filtering in wireless sensor networks. In this paper we have compared voronoi based
ant systems with standard LEACH-C algorithm and MTWSW with TWSW algorithm. Both the techniques
have been applied in heterogeneous wireless sensor networks. This approach is applicable both for critical
as well as for non-critical applications in wireless sensor networks. Both the approaches presented in this
paper outperform LEACH-C and TWSW in terms of energy efficiency and shows promising results for
future work.
Device-to-device (D2D) communications underlaying a cellular infrastructure has been proposed as a means of taking advantage of the physical proximity of communicating devices, increasing resource utilization, and improving cellular coverage. Relative to the traditional cellular methods, there is a need to design new peer discovery methods, physical layer procedures, and radio resource management algorithms that help realize the potential article we use the 3GPP Long Term Evolution system as a baseline for D2D design, review some of the key design challenges, and propose solution approaches that allow cellular devices and D2D pairs to share spectrum resources and thereby increase the spectrum and energy efficiency of traditional cellular networks. Sim- ulation results illustrate the viability of the proposed design.
Markovian Queueing Model for Throughput Maximization in D2D-Enabled Cellular ...IJECEIAES
Device-to-Device (D2D) communication has been considered a key enabling technol- ogy that can facilitate spectrum sharing in 4G and 5G cellular networks. In order to meet the high data rate demands of these new generation cellular networks, this paper considers the optimization of available spectrum resource through dynamic spectrum access. The utilization of continuous-time Markov chain (CTMC) model for efficient spectrum access in D2D-enabled cellular networks is investigated for the purpose of determining the impact of this model on the capacity improvement of cellular networks. The paper considers the use of CTMC model with both queueing and non-queueing cases called 13-Q CTMC and 6-NQ CTMC respectively with the aim of improving the overall capacity of the cellular network under a fairness constraint among all users. The proposed strategy consequently ensures that spectrum access for cellular and D2D users is optimally coordinated by designing optimal spectrum access probabilities. Numerical simulations are performed to observe the impact of the proposed Markovian queueing model on spectrum access and consequently on the capacity of D2D-enabled cellular networks. Results showed that the proposed 13-Q CTMC provide a more spectrumefficient sharing scheme, thereby enabling better network performances and larger capabilities to accommodate more users.
Optical network is an emerging technology for data communication
inworldwide. The information is transmitted from the source to destination
through the fiber optics. All optical network (AON) provides good
transmission transparency, good expandability, large bandwidth, lower bit
error rate (BER), and high processing speed. Link failure and node failure
haveconsistently occurred in the traditional methods. In order to overcome
the above mentioned issues, this paper proposes a robust software defined
switching enabled fault localization framework (SDSFLF) to monitor the
node and link failure in an AON. In this work, a novel faulty node
localization (FNL) algorithm is exploited to locate the faulty node. Then, the
software defined faulty link detection (SDFLD) algorithm that addresses the
problem of link failure. The failures are localized in multi traffic stream
(MTS) and multi agent system (MAS). Thus, the throughput is improved in
SDSFLF compared than other existing methods like traditional routing and
wavelength assignment (RWA), simulated annealing (SA) algorithm, attackaware RWA (A-RWA) convex, longest path first (LPF) ordering, and
biggest source-destination node degree (BND) ordering. The performance of
the proposed algorithm is evaluated in terms of network load, wavelength
utilization, packet loss rate, and burst loss rate. Hence, proposed SDSFLF
assures that high performance is achieved than other traditional techniques.
A bipartite graph based proportional fair scheduling strategy to improve thr...IJECEIAES
The fifth-generation wireless communication is expected to provide a huge amount of capacity to cater to the need of an increasing number of mobile consumers, which can be satisfied by device-to-device (D2D) communication. Reusing the cellular user’s resources in an efficient manner helps to increase the spectrum efficiency of the network but it leads to severe interference. The important point in reusing cellular user resources is that D2D communication should not affect the cellular user’s efficiency. After achieving this requirement, the focus is now turned toward the allocation of resources to D2D communication. This resource allocation strategy is to be designed in such a way that it will not affect communication among the cellular user (CU). This scheme improves various performance objectives. This paper aims at designing a proportional fair resource allocation algorithm based on the bipartite graph which maintains the quality of service (QoS) of CUs while providing D2D communication. This algorithm can be merged with any other scheme of resource allocation for improving QoS and adopting changing channels. In this scheme, a D2D pair can be allocated with one or more than one resource blocks. The MATLAB simulations analyze the performance of the proposed scheme.
IJCER (www.ijceronline.com) International Journal of computational Engineerin...ijceronline
Call for paper 2012, hard copy of Certificate, research paper publishing, where to publish research paper,
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJCER, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, research and review articles, IJCER Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathematics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer review journal, indexed journal, research and review articles, engineering journal, www.ijceronline.com, research journals,
yahoo journals, bing journals, International Journal of Computational Engineering Research, Google journals, hard copy of Certificate,
journal of engineering, online Submission
Ameliorate the performance using soft computing approaches in wireless networksIJECEIAES
Wireless sensor networks are an innovative and rapidly advanced network occupying the broad spectrum of wireless networks. It works on the principle of “use with less expense, effort and with more comfort.” In these networks, routing provides efficient and effective data transmission between different sources to access points using the clustering technique. This work addresses the low-energy adaptive clustering hierarchy (LEACH) protocol’s main backdrop of choosing head nodes based on a random value. In this, the soft computing methods are used, namely the fuzzy approach, to overcome this barrier in LEACH. Our approach’s primary goal is to extend the network lifetime with efficient energy consumption and by choosing the appropriate head node in each cluster based on the fuzzy parameters. The proposed clustering algorithm focused on two fuzzy inference structures, namely Mamdani and Sugeno fuzzy logic models in two scenarios, respectively. We compared our approach with four existing works, the conventional LEACH, LEACH using the fuzzy method, multicriteria cluster head delegation, and fuzzy-based energy efficient clustering approach (FEECA) in wireless sensor network. The proposed scenario based fuzzy LEACH protocol approaches are better than the four existing methods regarding stability, network survivability, and energy consumption.
Efficient radio resource allocation scheme for 5G networks with device-to-devi...IJECEIAES
A vital technology in the next-generation cellular network is device-to-device (D2D) communication. Cellular user enabled with D2D communication provides high spectral efficiency and further increases the coverage area of the cell, especially for the end-cell users and blind spot areas. However, the implementation of D2D communication increases interference among the cellular and D2D users. In this paper, we proposed a radio resource allocation (RRA) algorithm to manage the interference using fractional frequency reuse (FFR) scheme and Hungarian algorithm. The proposed algorithm is divided into three parts. First, the FFR scheme allocates different frequency bands among the cell (inner and outer region) for both the cellular and the D2D users to reduce the interference. Second, the Hungarian weighted bipartite matching algorithm is used to allocate the resources to D2D users with the minimum total system interference, while maintaining the total system sum rate. The cellular users share the resources with more than one D2D pair. Lastly, the local search technique of swapping is used for further allocation to minimize the interference. We implemented two types of assignments, fair multiple assignment, and restricted multiple assignment. We compared our results with existing algorithms which verified that our proposed algorithm provides outstanding results in aspects like interference reduction and system sum rate. For restricted multiple assignment, 60-70% of the D2D users are allocated in average cases.
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.
Energy-efficient device-to-device communication in internet of things using ...IJECEIAES
Device-to-device (D2D) communication has grown into notoriety as a critical component of the internet of things (IoT). One of the primary limitations of IoT devices is restricted battery source. D2D communication is the direct contact between the participating devices that improves the data rate and delivers the data quickly by consuming less battery. An energy-efficient communication method is required to enhance the communication lifetime of the network by reducing the node energy dissipation. The clustering-based D2D communication method is maximally acceptable to boom the durability of a network. The oscillating spider monkey optimization (OSMO) and oscillating particle swarm optimization (OPSO) algorithms are used in this study to improve the selection of cluster heads (CHs) and routing paths for D2D communication. The CHs and D2D communication paths are selected depending on the parameters such as energy consumption, distance, end-to-end delay, link quality and hop count. A simulation environment is designed to evaluate and test the performance of the OSMO-OPSO algorithm with existing D2D communication algorithms (such as the GAPSO-H algorithm, adaptive resource-aware splitlearning (ARES), bio-inspired cluster-based routing scheme (Bi-CRS), and European society for medical oncology (ESMO) algorithm). The results proved that the proposed technique outperformed with respect to traditional routing strategies regarding latency, packet delivery, energy efficiency, and network lifetime.
Energy Efficient Resource Allocation and Relay Selection Schemes for D2D Comm...ijtsrd
Device to Device D2D communication is a wireless peer to peer service, that allows direct communication to discharge hub input by binding wireless broadcasting amongst devices, as a vital technology module for next generation cellular communication system. Mobile devices limited battery power is a barricade for harnessing the performance of cellular communication systems. High data rate Device to Device communication is requisite to boost the crescent traffic requirement of apparent applications. In this paper suggest a centralized relay selection and power allocation process to state a multi objective optimization trouble to clearance the commutation in between total transmit power and system throughput. The proposed framework, suggest lowest perplexity modulation and demodulation procedure by route discovery for Generalized frequency division multiplexing systems. The proposed diplomacy deed the peculiar framework of the modulation matrix to depress the computational rate in the absence of meet with any performance loss distress. Centralized algorithm to discover the outcome in polynomial time. Proposed algorithms markedly minimize the total transmit power and enhance the system throughput. Surya S M | Prof. K. Kalai Selvi "Energy-Efficient Resource Allocation and Relay Selection Schemes for D2D Communications in 5G Wireless Networks" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-4 | Issue-3 , April 2020, URL: https://www.ijtsrd.com/papers/ijtsrd30413.pdf Paper Url :https://www.ijtsrd.com/engineering/electronics-and-communication-engineering/30413/energyefficient-resource-allocation-and-relay-selection-schemes-for-d2d-communications-in-5g-wireless-networks/surya-s-m
Energy Efficient Resource Allocation and Relay Selection Schemes for D2D Comm...ijtsrd
Device to Device D2D communication is a wireless peer to peer service, that allows direct communication to discharge hub input by binding wireless broadcasting amongst devices, as a vital technology module for next generation cellular communication system. Mobile devices limited battery power is a barricade for harnessing the performance of cellular communication systems. High data rate Device to Device communication is requisite to boost the crescent traffic requirement of apparent applications. In this paper suggest a centralized relay selection and power allocation process to state a multi objective optimization trouble to clearance the commutation in between total transmit power and system throughput. The proposed framework, suggest lowest perplexity modulation and demodulation procedure by route discovery for Generalized frequency division multiplexing systems. The proposed diplomacy deed the peculiar framework of the modulation matrix to depress the computational rate in the absence of meet with any performance loss distress. Centralized algorithm to discover the outcome in polynomial time. Proposed algorithms markedly minimize the total transmit power and enhance the system throughput. Surya S M | Prof. K. Kalai Selvi "Energy-Efficient Resource Allocation and Relay Selection Schemes for D2D Communications in 5G Wireless Networks" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-4 | Issue-3 , April 2020, URL: https://www.ijtsrd.com/papers/ijtsrd30413.pdf Paper Url :https://www.ijtsrd.com/engineering/electronics-and-communication-engineering/30413/energyefficient-resource-allocation-and-relay-selection-schemes-for-d2d-communications-in-5g-wireless-networks/surya-s-m
Q-LEARNING BASED ROUTING PROTOCOL TO ENHANCE NETWORK LIFETIME IN WSNSIJCNCJournal
In resource constraint Wireless Sensor Networks (WSNs), enhancement of network lifetime has been one of the significantly challenging issues for the researchers. Researchers have been exploiting machine learning techniques, in particular reinforcement learning, to achieve efficient solutions in the domain of WSN. The objective of this paper is to apply Q-learning, a reinforcement learning technique, to enhance the lifetime of the network, by developing distributed routing protocols. Q-learning is an attractive choice for routing due to its low computational requirements and additional memory demands. To facilitate an agent running at each node to take an optimal action, the approach considers node’s residual energy, hop length to sink and transmission power. The parameters, residual energy and hop length, are used to calculate the Q-value, which in turn is used to decide the optimal next-hop for routing. The proposed protocols’ performance is evaluated through NS3 simulations, and compared with AODV protocol in terms of network lifetime, throughput and end-to-end delay.
A MANET is an autonomous collection of mobile users that communicate over relatively bandwidth constrained wireless links. When designing mobile ad hoc networks, several interesting and difficult problems arise because of the shared nature of the wireless medium, limited transmission power (range) of wireless devices, node mobility, and battery limitations. This paper aims at providing a new schema to improve Dynamic Source Routing (DSR) Protocol. The aim
behind the proposed enhancement is to find the best route in acceptable time limit without having broadcast storm. Moreover, O-DSR enables network not only to overcome congestion but also maximize the lifetime of mobile nodes. Some simulations results show that the Route Request (RREQ) and the Control Packet Overhead decrease by 15% when O-DSR is used, consequently. Also the global energy consumption in O-DSR is lower until to 60 % , which leads to a long lifetime of the network.
Constructing Minimum Connected Dominating Set in Mobile Ad Hoc NetworksGiselleginaGloria
One of the most important challenges of a Mobile Ad Hoc Network (MANET) is to ensure efficient routing among its nodes. A Connected Dominating Set (CDS) is a widely used concept by many protocols for broadcasting and routing in MANETs. Those existing protocols require significant message overhead in construction of CDS. In this paper, we propose a simple, inexpensive and novel algorithm of computing a minimum CDS. The proposed algorithm saves time and message overhead in forming a CDS while supporting node mobility efficiently. Simulation results show that the proposed algorithm is efficient in terms of both message complexity and the size of the CDS.
Constructing Minimum Connected Dominating Set in Mobile Ad Hoc Networks
poster_fit_22
1. Abstract
Resource Allocation in Emerging 4G Cellular Systems: LTE-Advanced
Hammadullah Muhammad Afaq Ahmad Muhammad Waqas
Supervisor: Dr. Guftaar Ahmad Sardar Sidhu
Department of Electrical Engineering, Comsats Institute of Information Technology Islamabad.
System Model
Simulation
Long Term Evolution (LTE) is an
advanced standard for wireless
communications technology. The
resource allocation in LTE has been
considered as a fruitful field for
enhancing the system performance.
In this research, we consider an
OFDM based dual hop device to
device (D2D) communication
network which can operate under
Amplify and Forward (AF) or Decode
and Forward (DF) relay transmission
mode.
Exploiting convex optimization
techniques, analytical solutions are
derived. Simulations are presented
to validate the proposed schemes.
Objective
1. K. Doppler, M. Rinne, C. Wijting, C. B. Ribeiro, and K. Hugl, “Device to-device communication as an underlay to LTE-Advanced
networks, IEEE Communications Magazine, vol. 47, no. 12, pp. 42–49, Dec. 2009.
2. G. A. S. Sidhu, F. Gao, W. Chen, and W. Wang, ''Resource allocation in relay-aided OFDM cognitive radio networks'' IEEE Trans. On
Vehicular Tech. (TVT), Vol. 62, No. 08, pp. 3700--3710, October 2013.
3. 3rd Generation Partnership Project (3GPP), Technical Specification Group (TSG) Radio Access Network:(RAN),2000, 3G TR25.833Vl
.
Problem Formulation
Using Decode and Forward Relay:
Conclusion
In this work a relay aided D2D
network is considered which works
under the cellular network.
The trivial solution from proposed
subcarrier pairing schemes
improves the sum throughput.
System Model
References
The main goals of this project are
to investigate the resource
allocation techniques in LTE-
Advanced cellular systems.
Design the optimal algorithms for
power allocation and the subcarrier
permutation schemes over two
hops.
Method
Duality Theory.
Subgradient Method.
Water filling Algorithm.
CC2CAF
n =
1
2
log2
Ã
1 +
qnjhnj2
pnjgnj2
qnjhnj2(w2
r + Rnj fMnj2) + (w2
d + SnjeTj2)(pnjgnj2 + ¾2
r + RjfMj2)
!
CD2DAF
n =
1
2
log2
Ã
1 +
SnjTnj2
RnjMnj2
SnjTnj2(w2
c + pnjegnj2) + (w2
e + qnjehj2)(RnjMnj2 + ¾2
r + pjegj2)
!
max
pn ;qn
NX
n=1
CC2CAF=DF
n +
NX
n=1
C(D2DAF=DF )
n
s.t.
NX
n=1
Pn · Pt
NX
n=1
Qn · Qt
CC2CDF
n = min
µ
log2
µ
1 +
Pnjgnj2
Rnj¹mj2 + ¾2
¶
;log2
µ
1 +
Qnjhnj2
Snj¹tj2 + ¾2
¶¶
CD2DDF
n = min
µ
log2
µ
1 +
Rnjmnj2
Pnj¹gj2 + ¾2
¶
;log2
µ
1 +
Snjtnj2
Qnj¹hj2 + ¾2
¶¶
min
¸
D(¸; ´)
s.t.¸; ´ ¸ 0
¸i+1 = ¸i + ±
Ã
pT ¡
NX
n=1
pn
!
Optimal Solution
Pn =
Ã
1
¸
¡
Rn
fMn
2
+ ¾2
g2
n
!
Pn =
Ã
1
¸nXn
¡
Rn
fMn
2
+ ¾2
g2
n
!