This paper analyzes the performance of cooperative amplify-and-forward (CAF) relay networks that
employ adaptive M-ary quadrature amplitude modulation (M-QAM)/M-ary phase shift keying (M-PSK)
digital modulation techniques in Nakagami-m fading channel. In particular, we present and compared the
analysis of CAF relay networks with different cooperative diversity and opportunistic routing strategies
such as regular Maximal Ratio Combining (MRC), Selection Diversity Combining (SDC), Opportunistic
Relay Selection with Maximal Ratio Combining (ORS-MRC) and Opportunistic Relay Selection with
Selection Diversity Combining (ORS-SDC). We advocate a simple yet unified numerical approach based on
the marginal moment generating function (MGF) of the total received SNR to compute the average symbol
error rate (ASER), mean achievable spectral efficiency, and outage probability performance metrics.
EFFICIENT ANALYSIS OF THE ERGODIC CAPACITY OF COOPERATIVE NON-REGENERATIVE RE...ijwmn
In this paper, we proposed a novel efficient method of analyzing the ergodic channel capacity of the
cooperative amplify-and-forward (CAF) relay system. This is accomplished by employing a very tight
approximate moment generating function (MGF) of end-to-end signal-to-noise ratio of 2-hop multi-relay
system, which is In this paper, we proposed a novel efficient method of analyzing the ergodic channel
capacity of the cooperative amplify-and-forward (CAF) relay system. This is accomplished by employing a
very tight approximate moment applicable to myriad of fading environments including mixed and
composite fading channels. Three distinct adaptive source transmission policies were considered in our
analysis namely: (i) constant power with optimal rate adaptation (ORA); (ii) optimal joint power and rate
adaptation (OPRA); and (iii) fixed rate with truncated channel inversion (TCIFR). The proposed frame
work based on the novel approximate MGF method is sufficiently general to encapsulate all types of fading
environments (especially for the analysis of the mixed fading case)and provides significant advantage to
model wireless system for mixed and composite fading channel. In addition to simplifying computation
complexity of ergodic capacity for CAF relaying schemes treated in literature, we also derive closed form
expressions for the above three adaptive source transmission policies under Nakagami-m fading with i.n.d
statistics. The accuracy of our proposed method has been validated with existing MGF expressions that are
readily available for specific fading environments in terms of bounds, and via Monte Carlo simulations.
Cooperative communication has emerged as a new
dimension of diversity to emulate the strategies designed for
multiple antenna systems, since a wireless mobile device may not
be able to support multiple transmit antennas due to size, cost,
or hardware limitations. Capacity optimization of the wireless
network is performed by making changes in the physical layer of
the network. In this article, we propose a Capacity-Optimized
Cooperative (COCO) topology control scheme to improve the
network capacity in MANETs by jointly considering both upper
layer network capacity and physical layer cooperative
communications. Simulations in the network simulator are
performed to show the efficiency of the system.
Cooperative communication has received tremendous interest
for wireless networks. Most existing works on cooperative
communications are focused on link-level physical layer issues.
Consequently, the impacts of cooperative communications on
network-level upper layer issues, such as topology control,
routing and network capacity, are largely ignored. In this
article, we propose a Capacity-Optimized Cooperative (COCO)
topology control scheme to improve the network capacity in
MANETs by jointly considering both upper layer network
capacity and physical layer cooperative communications.
Through simulations, we show that physical layer cooperative
communications have significant impacts on the network
capacity, and the proposed topology control scheme can
substantially improve the network capacity in MANETs with
cooperative communications.
GPSFR: GPS-Free Routing Protocol for Vehicular Networks with Directional Ante...ijwmn
Efficient and practical communications between large numbers of vehicles are critical in providing high level of safety and convenience to drivers. Crucial real-time information on road hazard, traffic conditions and driver services must be communicated to vehicles rapidly even in adverse environments, such as “urban canyons” and tunnels. We propose a novel routing protocol in vehicular networks that does not require position information (e.g. from GPS) but instead rely on relative position that can be determined dynamically. This GPS-Free Geographic Routing (GPSFR) protocol uses the estimated relative position of vehicles and greedily chooses the best next hop neighbor based on a Balance Advance (BADV) metric which balances between proximity and link stability in order to improve routing performance. In this paper, we focuses primarily on the complexity of routing in highways and solves routing problems that arise when vehicles are near interchanges, curves, and merge or exit lanes of highways. Our simulation results show that by taking relative velocity into account, GPSFR reduces link breakage to only 27% that of GPSR in the dense network. Consequently, GPSFR outperforms GPSR in terms of higher data delivery ratio, lower delay, less sensitivity of the network density and route paths’length
A Proactive Greedy Routing Protocol Precludes Sink-Hole Formation in Wireless...ijwmn
The International Journal of Wireless & Mobile Networks (IJWMN) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Wireless & Mobile Networks. The journal focuses on all technical and practical aspects of Wireless & Mobile Networks. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced wireless & mobile networking concepts and establishing new collaborations in these areas.
FANET optimization: a destination path flow model IJECEIAES
Closed-loop routing in flying ad hoc networks (FANET) arises as a result of the quick changes of communication links and topology. As such, causing link breakage during information dissemination. This paper proposed a destination path flow model to improve the communication link in FANET. The models utilized Smell Agent Optimization and Particle Swarm Optimization algorithms in managing link establishment between communicating nodes. The modeled scenario depicts the practical application of FANET in media and sports coverage where only one vendor is given the license for live coverage and must relay to other vendors. Three different scenarios using both optimization Algorithms were presented. From the result obtained, the SAO optimizes the bandwidth costs much better than PSO with a percentage improvement of 10.46%, 4.04% and 3.66% with respect to the 1st, 2nd and 3rd scenarios respectively. In the case of communication delay between the FANET nodes, the PSO has a much better communication delay over SAO with percentage improvement of 40.89%, 50.26% and 68.85% in the first, second and third scenarios respectively.
ENERGY EFFICIENT NODE RANK-BASED ROUTING ALGORITHM IN MOBILE AD-HOC NETWORKSIJCNCJournal
Mobile Ad-hoc Network (MANET) is an emerging technology, infrastructure less with self-organizing, selfhealing, multi-hop wireless routing networks in real time. In such networks, many routing problems arise due to complexity in the network mobility which results from difficulty in achieving energy efficient routing
in the field of MANET. Due to the dynamic nature and the limited battery energy of the mobile nodes, the communication links between intermediate relay nodes may fail frequently, thus affecting the routing performance of the network and also the availability of the nodes. Though existing protocols are not
concentrating about communication links and battery energy, node links are very important factor for improving quality of routing protocols because Node Rank helps us to determine whether the node is within transmission range or out of transmission range through considering residual energy of the node during the routing process. This paper proposes a novel Energy Efficient Node Rank-based Routing (EENRR)
algorithm which includes certain performance metrics such as control overhead and residual energy in order to improve the Packet Delivery Ratio (PDR), and Network Life Time (NLT) from its originally observed routing performance obtained through other existing protocols. Simulation results show that, when the number of nodes increases from 10 to 100 nodes, EENRR algorithm increases the average residual energy by 31.08% and 21.26% over the existing Dynamic Source Routing (DSR) and Energy Efficient Delay Time Routing (EEDTR) protocols, respectively. Similarly it increases the PDR by 45.38% and 28.3% over the existing DSR and EEDTR protocols respectively.
Design and implementation of new routingIJCNCJournal
Energy consumption is a key element in the Wireless Sensor Networks (WSNs) design. Indeed, sensor nodes are really constrained by energy supply. Hence, how to improve the network lifetime is a crucial and challenging task. Several techniques are available at different levels of the OSI model to maximize the WSN lifetime and especially at the network layer which uses routing strategies to maintain the routes in the network and guarantee reliable communication. In this paper we intend to propose a new protocol called
Combined Energy and Distance Metrics Dynamic Routing Protocol (CEDM-DR). Our new approach considers not only the distance between wireless sensors but also the energy of node acting as a router in order to find the optimal path and achieve a dynamic and adaptive routing.
The performance metrics exploited for the evaluation of our protocol are average energy consumed, network lifetime and packets lost. By comparing our proposed routing strategy to protocol widely used in WSN namely Ad hoc On demand Distance Vector(AODV), simulation results show that CEDM-DR strategy might effectively balance the sensor power consumption and permits accordingly to enhance the network
lifetime. As well, this new protocol yields a noticeable energy saving compared to its counterpart.
EFFICIENT ANALYSIS OF THE ERGODIC CAPACITY OF COOPERATIVE NON-REGENERATIVE RE...ijwmn
In this paper, we proposed a novel efficient method of analyzing the ergodic channel capacity of the
cooperative amplify-and-forward (CAF) relay system. This is accomplished by employing a very tight
approximate moment generating function (MGF) of end-to-end signal-to-noise ratio of 2-hop multi-relay
system, which is In this paper, we proposed a novel efficient method of analyzing the ergodic channel
capacity of the cooperative amplify-and-forward (CAF) relay system. This is accomplished by employing a
very tight approximate moment applicable to myriad of fading environments including mixed and
composite fading channels. Three distinct adaptive source transmission policies were considered in our
analysis namely: (i) constant power with optimal rate adaptation (ORA); (ii) optimal joint power and rate
adaptation (OPRA); and (iii) fixed rate with truncated channel inversion (TCIFR). The proposed frame
work based on the novel approximate MGF method is sufficiently general to encapsulate all types of fading
environments (especially for the analysis of the mixed fading case)and provides significant advantage to
model wireless system for mixed and composite fading channel. In addition to simplifying computation
complexity of ergodic capacity for CAF relaying schemes treated in literature, we also derive closed form
expressions for the above three adaptive source transmission policies under Nakagami-m fading with i.n.d
statistics. The accuracy of our proposed method has been validated with existing MGF expressions that are
readily available for specific fading environments in terms of bounds, and via Monte Carlo simulations.
Cooperative communication has emerged as a new
dimension of diversity to emulate the strategies designed for
multiple antenna systems, since a wireless mobile device may not
be able to support multiple transmit antennas due to size, cost,
or hardware limitations. Capacity optimization of the wireless
network is performed by making changes in the physical layer of
the network. In this article, we propose a Capacity-Optimized
Cooperative (COCO) topology control scheme to improve the
network capacity in MANETs by jointly considering both upper
layer network capacity and physical layer cooperative
communications. Simulations in the network simulator are
performed to show the efficiency of the system.
Cooperative communication has received tremendous interest
for wireless networks. Most existing works on cooperative
communications are focused on link-level physical layer issues.
Consequently, the impacts of cooperative communications on
network-level upper layer issues, such as topology control,
routing and network capacity, are largely ignored. In this
article, we propose a Capacity-Optimized Cooperative (COCO)
topology control scheme to improve the network capacity in
MANETs by jointly considering both upper layer network
capacity and physical layer cooperative communications.
Through simulations, we show that physical layer cooperative
communications have significant impacts on the network
capacity, and the proposed topology control scheme can
substantially improve the network capacity in MANETs with
cooperative communications.
GPSFR: GPS-Free Routing Protocol for Vehicular Networks with Directional Ante...ijwmn
Efficient and practical communications between large numbers of vehicles are critical in providing high level of safety and convenience to drivers. Crucial real-time information on road hazard, traffic conditions and driver services must be communicated to vehicles rapidly even in adverse environments, such as “urban canyons” and tunnels. We propose a novel routing protocol in vehicular networks that does not require position information (e.g. from GPS) but instead rely on relative position that can be determined dynamically. This GPS-Free Geographic Routing (GPSFR) protocol uses the estimated relative position of vehicles and greedily chooses the best next hop neighbor based on a Balance Advance (BADV) metric which balances between proximity and link stability in order to improve routing performance. In this paper, we focuses primarily on the complexity of routing in highways and solves routing problems that arise when vehicles are near interchanges, curves, and merge or exit lanes of highways. Our simulation results show that by taking relative velocity into account, GPSFR reduces link breakage to only 27% that of GPSR in the dense network. Consequently, GPSFR outperforms GPSR in terms of higher data delivery ratio, lower delay, less sensitivity of the network density and route paths’length
A Proactive Greedy Routing Protocol Precludes Sink-Hole Formation in Wireless...ijwmn
The International Journal of Wireless & Mobile Networks (IJWMN) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Wireless & Mobile Networks. The journal focuses on all technical and practical aspects of Wireless & Mobile Networks. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced wireless & mobile networking concepts and establishing new collaborations in these areas.
FANET optimization: a destination path flow model IJECEIAES
Closed-loop routing in flying ad hoc networks (FANET) arises as a result of the quick changes of communication links and topology. As such, causing link breakage during information dissemination. This paper proposed a destination path flow model to improve the communication link in FANET. The models utilized Smell Agent Optimization and Particle Swarm Optimization algorithms in managing link establishment between communicating nodes. The modeled scenario depicts the practical application of FANET in media and sports coverage where only one vendor is given the license for live coverage and must relay to other vendors. Three different scenarios using both optimization Algorithms were presented. From the result obtained, the SAO optimizes the bandwidth costs much better than PSO with a percentage improvement of 10.46%, 4.04% and 3.66% with respect to the 1st, 2nd and 3rd scenarios respectively. In the case of communication delay between the FANET nodes, the PSO has a much better communication delay over SAO with percentage improvement of 40.89%, 50.26% and 68.85% in the first, second and third scenarios respectively.
ENERGY EFFICIENT NODE RANK-BASED ROUTING ALGORITHM IN MOBILE AD-HOC NETWORKSIJCNCJournal
Mobile Ad-hoc Network (MANET) is an emerging technology, infrastructure less with self-organizing, selfhealing, multi-hop wireless routing networks in real time. In such networks, many routing problems arise due to complexity in the network mobility which results from difficulty in achieving energy efficient routing
in the field of MANET. Due to the dynamic nature and the limited battery energy of the mobile nodes, the communication links between intermediate relay nodes may fail frequently, thus affecting the routing performance of the network and also the availability of the nodes. Though existing protocols are not
concentrating about communication links and battery energy, node links are very important factor for improving quality of routing protocols because Node Rank helps us to determine whether the node is within transmission range or out of transmission range through considering residual energy of the node during the routing process. This paper proposes a novel Energy Efficient Node Rank-based Routing (EENRR)
algorithm which includes certain performance metrics such as control overhead and residual energy in order to improve the Packet Delivery Ratio (PDR), and Network Life Time (NLT) from its originally observed routing performance obtained through other existing protocols. Simulation results show that, when the number of nodes increases from 10 to 100 nodes, EENRR algorithm increases the average residual energy by 31.08% and 21.26% over the existing Dynamic Source Routing (DSR) and Energy Efficient Delay Time Routing (EEDTR) protocols, respectively. Similarly it increases the PDR by 45.38% and 28.3% over the existing DSR and EEDTR protocols respectively.
Design and implementation of new routingIJCNCJournal
Energy consumption is a key element in the Wireless Sensor Networks (WSNs) design. Indeed, sensor nodes are really constrained by energy supply. Hence, how to improve the network lifetime is a crucial and challenging task. Several techniques are available at different levels of the OSI model to maximize the WSN lifetime and especially at the network layer which uses routing strategies to maintain the routes in the network and guarantee reliable communication. In this paper we intend to propose a new protocol called
Combined Energy and Distance Metrics Dynamic Routing Protocol (CEDM-DR). Our new approach considers not only the distance between wireless sensors but also the energy of node acting as a router in order to find the optimal path and achieve a dynamic and adaptive routing.
The performance metrics exploited for the evaluation of our protocol are average energy consumed, network lifetime and packets lost. By comparing our proposed routing strategy to protocol widely used in WSN namely Ad hoc On demand Distance Vector(AODV), simulation results show that CEDM-DR strategy might effectively balance the sensor power consumption and permits accordingly to enhance the network
lifetime. As well, this new protocol yields a noticeable energy saving compared to its counterpart.
Reducing Packet Transmission Delay in Vehicular Ad Hoc Networks using Edge No...CSCJournals
VANETs (Vehicular Ad hoc Networks) are highly mobile wireless ad hoc networks and will play an important role in public safety communications and commercial applications. Routing of data in VANETs is a challenging task due to rapidly changing topology and high speed mobility of vehicles. Conventional routing protocols in MANETs (Mobile Ad hoc Networks) are unable to fully address the unique characteristics in vehicular networks. In this paper, we propose EBGR (Edge Node Based Greedy Routing), a greedy position based routing approach to forward packets to the node present in the edge of the limited transmission range of source/forwarding node as most suitable next hop, with consideration of nodes moving in the direction of the destination. We propose Revival Mobility model (RMM) to evaluate the performance of our routing technique. This paper presents a detailed description of our approach and simulation results show that end to end delay in packet transmission is minimized considerably compared to current routing protocols of VANET.
Dynamic Topology Re-Configuration in Multihop Cellular Networks Using Sequent...IJERA Editor
Cellular communications has experienced explosive growth in the past two decades. Today millions of people around the world use cellular phones. Cellular phones allow a person to make or receive a call from almost anywhere. Likewise, a person is allowed to continue the phone conversation while on the move. Cellular communications is supported by an infrastructure called a cellular network, which integrates cellular phones into the public switched telephone network. The cellular network has gone through three generations.The first generation of cellular networks is analog in nature. To accommodate more cellular phone subscribers, digital TDMA (time division multiple access) and CDMA (code division multiple access) technologies are used in the second generation (2G) to increase the network capacity. With digital technologies, digitized voice can be coded and encrypted. Therefore, the 2G cellular network is also more secure. The third generation (3G) integrates cellular phones into the Internet world by providing highspeed packet-switching data transmission in addition to circuit-switching voice transmission. The 3G cellular networks have been deployed in some parts of Asia, Europe, and the United States since 2002 and will be widely deployed in the coming years. The high increase in traffic and data rate for future generations of mobile communication systems, with simultaneous requirement for reduced power consumption, makes Multihop Cellular Networks (MCNs) an attractive technology. To exploit the potentials of MCNs a new network paradigm is proposed in this paper. In addition, a novel sequential genetic algorithm (SGA) is proposed as a heuristic approximation to reconfigure the optimum relaying topology as the network traffic changes. Network coding is used to combine the uplink and downlink transmissions, and incorporate it into the optimum bidirectional relaying with ICI awareness. Numerical results have shown that the algorithms suggested in this thesis provide significant improvement with respect to the existing results, and are expected to have significant impact in the analysis and design of future cellular networks.
LINK-LEVEL PERFORMANCE EVALUATION OF RELAY-BASED WIMAX NETWORKijwmn
Relay technology promises appreciable network throughput and coverage enhancement which is required
for high speed wireless cellular systems to function to their optimum. This paper is focused on analysing
the link performance of a relay-based WiMAX network under varying conditions. Comparison is made
between relay and direct link communication in terms of BER (Bit Error Rate), spectral efficiency and
capacity. Effect of multipath fading and user speed on performance are investigated as well. The entire
study involves a hypothetical view as well as MATLAB simulations to predict the benefit of relay
deployment. This is aimed at solving pertinent issues such as coverage holes and cell edge problems which
are associated with traditional non-relay based cellular networks.
JOINT-DESIGN OF LINK-ADAPTIVE MODULATION AND CODING WITH ADAPTIVE ARQ FOR COO...IJCNCJournal
This paper analyzes the efficiency of a joint-design of an adaptive modulation and coding (AMC) at the
physical (PHY) layer with an adaptive Rmax-truncated selective-repeat automatic repeat request (ARQ)
protocol at the medium access control (MAC) layer to maximize the throughput of cooperative nonregenerative
relay networks under prescribed delay and/or error performance constraints. Particularly, we
generalize the existing design model/results for cross-layer combining of AMC along with truncated ARQ
in non-cooperative diversity networks in three-folds: (i) extension of the cross-layer PHY/MAC design or
optimization to cooperative diversity systems; (ii) generalization/unification of analytical expressions for
various network performance metrics to generalized block fading channels with independent but nonidentically
distributed (i.n.d) fading statistics among the spatially distributed nodes; (iii) analysis of the
effectiveness of joint-adaptation of the maximum retransmission limit Rmax of ARQ protocol and
cooperative diversity order N for delay-insensitive applications. Our insightful numerical results reveal
that the average throughput can be increased significantly by judiciously combining two additional degrees
of freedom (N and Rmax) that are available in cooperative amplify-and-forward (CAF) relay networks
besides employing AMC at the PHY layer, especially in the most challenging low signal-to-noise ratio
(SNR) regime.
CROSS LAYER DESIGN APPROACH FOR EFFICIENT DATA DELIVERY BASED ON IEEE 802.11P...pijans
Intelligent Transportation Systems (ITS) have been one of the promising technology that has a great interest attention from many researchers over the world. Vehicular Ad-hoc Network (VANET) communications environment as a part of ITS opens the way for a wide range of applications such as safety applications, mobility and connectivity for both driver and passengers to exploit the transport systems in a smoothly, efficiently and safer way. Several challenging tasks facing adopting VANET functionality for ITS such as modelling of wireless transmission and routing issues. These research issues have become more critical due to the high mobility of vehicles nodes (transmitters and receivers) and unexpected network topology due to the high speed of nodes. In fact, modelling radio propagation channel in VANET environment which considers as one of a stringent communications environment is a challenging task. The selection of a suitable transmission model plays a key role in the routing decisions for VANET. Different propagation models allow calculating the Received Signal Strength (RSS) based on key environmental properties such as the distance between transmitter vehicle and a receiver vehicle, the gain and antenna height of transmitter and a receiver vehicles. Hence, it is useful to calculate RSS and SNR values for a specific propagation model and then these values can be used later for routing decision in order to find the best path with high SNR. This paper evaluates the performance of different transmission models (freespace, two-ray and log-normal) in terms of Receive Signal Strength (RSS). In addition, the performance of such wireless transmission models for vehicular communication in terms of PDR, throughput and delay is evaluated by applying the proposed cross layer routing approach based on IEEE 802.11p. By using MATLAB, the obtained results confirm the best packet delivery ratio for our proposed approach, where it indicates poor quality of DSSS PHY with high number vehicles. The minimum delay achieved when traffic density is decreased.
An Efficient and Stable Routing Algorithm in Mobile Ad Hoc NetworkIJCNCJournal
Mobile Ad hoc Network (MANET) is mainly designed to set up communication among devices in infrastructure-less wireless communication network. Routing in this kind of communication network is highly affected by its restricted characteristics such as frequent topological changes and limited battery power. Several research works have been carried out to improve routing performance in MANET. However, the overall performance enhancement in terms of packet delivery, delay and control message overhead is still not come into the wrapping up. In order to overcome the addressed issues, an Efficient and Stable-AODV (EFST-AODV) routing scheme has been proposed which is an improvement over AODV to establish a better quality route between source and destination. In this method, we have modified the route request and route reply phase. During the route request phase, cost metric of a route is calculated on the basis of parameters such as residual energy, delay and distance. In a route reply phase, average residual energy and average delay of overall path is calculated and the data forwarding decision is taken at the source node accordingly. Simulation outcomes reveal that the proposed approach gives better results in terms of packet delivery ratio, delay, throughput, normalized routing load and control message overhead as compared to AODV.
Dear Student,
DREAMWEB TECHNO SOLUTIONS is one of the Hardware Training and Software Development centre available in
Trichy. Pioneer in corporate training, DREAMWEB TECHNO SOLUTIONS provides training in all software
development and IT-related courses, such as Embedded Systems, VLSI, MATLAB, JAVA, J2EE, CIVIL,
Power Electronics, and Power Systems. It’s certified and experienced faculty members have the
competence to train students, provide consultancy to organizations, and develop strategic
solutions for clients by integrating existing and emerging technologies.
ADD: No:73/5, 3rd Floor, Sri Kamatchi Complex, Opp City Hospital, Salai Road, Trichy-18
Contact @ 7200021403/04
phone: 0431-4050403
PERFORMANCE ANALYSIS OF WIRELESS MESH NETWORK USING ADAPTIVE INFORMANT FACTOR...IJCSES Journal
Wireless mesh network (WMN) has become an important leading technology which provides several types of useful applications such as community network, broadband home network and internet access, etc. The rise in the size of users in WMN has created a degradation of efficiency in a network especially in dense areas due to the clumsy channel allocation and hence creating many challenges for enhancing the users experience, network quality and throughput. Therefore in this paper, we proposed OCA based AIF model that can access the channel information and then it process to improve the RF channel association. The proposed OCA-AIF will function for each period when some interference is detected via AIF and we further extend this analysis by taking in to consideration the influence of interference to provide a high quality indicator in network. The analysis of result shows the optimization by our proposed approach which increases as per the increment of relay nodes (RNs).
LARGE-SCALE MULTI-USER MIMO APPROACH FOR WIRELESS BACKHAUL BASED HETNETScsandit
In this paper, we consider the optimization of wireless capacity-limited backhaul links in future heterogeneous networks (HetNets). We assume that the HetNet is formed with one macro-cell base station (MBS), which is associated with multiple small-cell base stations (SBSs). It is also assumed both the MBS and the SBSs are equipped with massive arrays, while all mobiles users (macro-cell and small-cell users) have single antenna. For the backhaul links, we propose to use a capacity-aware beamforming scheme at the SBSs and MRC at the MBS. Using particle swarm optimization (PSO), each SBS seeks the optimal transmit weight vectors that maximize the backhaul uplink capacity and the access uplinks signal-to-interference plus noise ratio (SINR). The performance evaluation in terms of the symbol error rate (SER) and the ergodic system capacity shows that the proposed capacity-aware backhaul link scheme achieves similar or better performance than traditional wireless backhaul links and requires considerably less computational complexity.
Comparative Review for Routing Protocols in Mobile Ad-Hoc Networksijasuc
Wireless Mobile Ad-Hoc Networks is one of the attractive research field that growing exponentially in the
last decade. it surrounded by much challenges that should be solved the improve establishment of such
networks. Failure of wireless link is considered as one of popular challenges faced by Mobile Ad-Hoc
Networks (MANETs). As this type of networks does not require any pre-exist hardware. As well as, every
node have the ability of roaming where it can be connected to other nodes dynamically. Therefore, the
network internal structure will be unpredictably changed frequently according to continuous activities
between nodes that simultaneously update network topology in the basis of active ad-hoc nature. This
model puts the functionality of routing operation in crucial angle in the area of research under mobile adhoc
network field due to highly dynamic nature. Adapting such kernel makes MANET indigence new
routing techniques to settle these challenges. Thereafter, tremendous amount of routing protocols proposed
to argue with ad-hoc nature. Thus, it is quite difficult to specify which protocols operate efficiently under
different mobile ad-hoc scenarios. This paper examines some of the prominent routing protocols that are
designed for mobile ad-hoc networks by describing their structures, operations, features and then
comparing their various characteristics.
we find out various power aware and data packet rate control with-collision-avoidance (CSMA/CA)-based ad hoc wireless network communication. And identifies that CSMA
Topology Management for Mobile Ad Hoc Networks ScenarioIJERA Editor
Cooperative communication is the main accessing point in present days. These results can be accessed through proactive protocol like route request packet sending and route request packet receiving. The main issue is how communication will be done in MANETS. Mobile Ad-hoc networks are self-configurable networks; each node behaves like server and client in MANET. COCO (Capacity Optimized Cooperative Communication) model was developed for accessing these types of resources in MANETs. This model can’t provide sufficient communication or overall network performance. This model provides sufficient capability improvement in mobile ad-hoc networks, but this model will be taking more power resources for doing this work. exploitation simulation examples, we have a tendency to show that physical layer cooperative communications have important impacts on the performance of topology control and network capability, and also the proposed topology management scheme will considerably improve the network capability in MANETs with cooperative communications
A Cluster-Based Routing Protocol and Fault Detection for Wireless Sensor NetworkIJCNCJournal
In Wireless Sensors Networks (WSN) based application, a large number of sensor devices must be deployed. Energy efficiency and network lifetime are the two most challenging issues in WSN. As a consequence, the main goal is to reduce the overall energy consumption using clustering protocols which have to ensure reliability and connectivity in large-scale WSN. This work presents a new clustering and routing algorithm based on the properties of the sensor networks. The main goal of this work is to extend the network lifetime via charge equilibration in the WSN. According to many errors with sensing devices and to have greater data accuracy, we use a quorum mechanism. The proposed algorithms are evaluated widely and the results are compared with related works. The experimental results show that the proposed algorithm provides an effective improvement in terms of energy consumption, data accuracy and network lifetime.
Investigation of Clock Synchronization Techniques and its Performance Impact ...ijctet
Mobile ad hoc Network (MANET) is an assortment of mobile nodes that area unit needed to transmit packets on behalf of every alternative. The mobile nodes maintain the topology data during a dynamic network among a selected vary. All nodes should remember of its neighbors that area unit directly approachable. The every node in network maintained next hop data of close neighbor nodes. The routing protocols area unit routed knowledge packets in between sender and receiver during a specific time instant. The time synchronization is maintained the communication clock cycle between the nodes. Time synchronization is an important element of a MANET. Time synchronization during a network aims at providing a typical duration for local clocks of nodes within the network. Since all hardware clocks area unit imperfect, local clocks of nodes could alienate from one another in time, thus determined time or durations of your
The performance of the vehicular communication-clustering processTELKOMNIKA JOURNAL
For the new wireless systems and beyond, the intelligent transportation system is considered as one of the main features that could be covered in the new research topics. Furthermore, both high-speed data transmission and data processing play a crucial role for these generations. Our work covers two main propositions in order to attain an improvement in such intelligent systems performance. A clustering algorithm is proposed and presented for grouping mobile nodes based on their speeds with some modified head assignments processes. This will be combined with a parallel-processing technique that enhances the QoS. Mainly, this work concerns enhancing the V2V data transmission and the processing speed. Thus, a wavelet processing stage has been imposed to optimize the transmitted power phenomenon. In order to check the validity of such proposition, five main efficiency factors have been investigated; namely complementary cumulative distributions, bit rates, energy efficiency, the lifetime of cluster head and the ordinary nodes reattaching-head average times.
PERFORMANCE ANALYSIS OF MULTI-PATH TCP NETWORKIJCNCJournal
MPTCP is proposed by IETF working group, it allows a single TCP stream to be split across multiple
paths. It has obvious benefits in performance and reliability. MPTCP has implemented in Linux-based
distributions that can be compiled and installed to be used for both real and experimental scenarios. In this
article, we provide performance analyses for MPTCP with a laptop connected to WiFi access point and 3G
cellular network at the same time. We prove experimentally that MPTCP outperforms regular TCP for
WiFi or 3G interfaces. We also compare four types of congestion control algorithms for MPTCP that are
also implemented in the Linux Kernel. Results show that Alias Linked Increase Congestion Control
algorithm outperforms the others in the normal traffic load while Balanced Linked Adaptation algorithm
outperforms the rest when the paths are shared with heavy traffic, which is not supported by MPTCP.
PERFORMANCE ASSESSMENT OF CHAOTIC SEQUENCE DERIVED FROM BIFURCATION DEPENDENT...IJCNCJournal
In CDMA system, m-sequence and Gold codes are often utilized for spreading-despreading and
scrambling-descrambling operations. In a previous work, a design framework was created for generating
large family of codes from logistic map, which have comparable autocorrelation and cross correlation to
m-sequence and Gold codes. The purpose of this work is to evaluate the performance of these chaotic
codes in a CDMA environment. In the bit error rate (BER) simulation, matched filter, decorrelator and
MMSE receiver have been utilized. The received signal was modelled for synchronous CDMA uplink for
simulation simplicity purpose. Additive White Gaussian Noise channel model was assumed for the
simulation.
Reducing Packet Transmission Delay in Vehicular Ad Hoc Networks using Edge No...CSCJournals
VANETs (Vehicular Ad hoc Networks) are highly mobile wireless ad hoc networks and will play an important role in public safety communications and commercial applications. Routing of data in VANETs is a challenging task due to rapidly changing topology and high speed mobility of vehicles. Conventional routing protocols in MANETs (Mobile Ad hoc Networks) are unable to fully address the unique characteristics in vehicular networks. In this paper, we propose EBGR (Edge Node Based Greedy Routing), a greedy position based routing approach to forward packets to the node present in the edge of the limited transmission range of source/forwarding node as most suitable next hop, with consideration of nodes moving in the direction of the destination. We propose Revival Mobility model (RMM) to evaluate the performance of our routing technique. This paper presents a detailed description of our approach and simulation results show that end to end delay in packet transmission is minimized considerably compared to current routing protocols of VANET.
Dynamic Topology Re-Configuration in Multihop Cellular Networks Using Sequent...IJERA Editor
Cellular communications has experienced explosive growth in the past two decades. Today millions of people around the world use cellular phones. Cellular phones allow a person to make or receive a call from almost anywhere. Likewise, a person is allowed to continue the phone conversation while on the move. Cellular communications is supported by an infrastructure called a cellular network, which integrates cellular phones into the public switched telephone network. The cellular network has gone through three generations.The first generation of cellular networks is analog in nature. To accommodate more cellular phone subscribers, digital TDMA (time division multiple access) and CDMA (code division multiple access) technologies are used in the second generation (2G) to increase the network capacity. With digital technologies, digitized voice can be coded and encrypted. Therefore, the 2G cellular network is also more secure. The third generation (3G) integrates cellular phones into the Internet world by providing highspeed packet-switching data transmission in addition to circuit-switching voice transmission. The 3G cellular networks have been deployed in some parts of Asia, Europe, and the United States since 2002 and will be widely deployed in the coming years. The high increase in traffic and data rate for future generations of mobile communication systems, with simultaneous requirement for reduced power consumption, makes Multihop Cellular Networks (MCNs) an attractive technology. To exploit the potentials of MCNs a new network paradigm is proposed in this paper. In addition, a novel sequential genetic algorithm (SGA) is proposed as a heuristic approximation to reconfigure the optimum relaying topology as the network traffic changes. Network coding is used to combine the uplink and downlink transmissions, and incorporate it into the optimum bidirectional relaying with ICI awareness. Numerical results have shown that the algorithms suggested in this thesis provide significant improvement with respect to the existing results, and are expected to have significant impact in the analysis and design of future cellular networks.
LINK-LEVEL PERFORMANCE EVALUATION OF RELAY-BASED WIMAX NETWORKijwmn
Relay technology promises appreciable network throughput and coverage enhancement which is required
for high speed wireless cellular systems to function to their optimum. This paper is focused on analysing
the link performance of a relay-based WiMAX network under varying conditions. Comparison is made
between relay and direct link communication in terms of BER (Bit Error Rate), spectral efficiency and
capacity. Effect of multipath fading and user speed on performance are investigated as well. The entire
study involves a hypothetical view as well as MATLAB simulations to predict the benefit of relay
deployment. This is aimed at solving pertinent issues such as coverage holes and cell edge problems which
are associated with traditional non-relay based cellular networks.
JOINT-DESIGN OF LINK-ADAPTIVE MODULATION AND CODING WITH ADAPTIVE ARQ FOR COO...IJCNCJournal
This paper analyzes the efficiency of a joint-design of an adaptive modulation and coding (AMC) at the
physical (PHY) layer with an adaptive Rmax-truncated selective-repeat automatic repeat request (ARQ)
protocol at the medium access control (MAC) layer to maximize the throughput of cooperative nonregenerative
relay networks under prescribed delay and/or error performance constraints. Particularly, we
generalize the existing design model/results for cross-layer combining of AMC along with truncated ARQ
in non-cooperative diversity networks in three-folds: (i) extension of the cross-layer PHY/MAC design or
optimization to cooperative diversity systems; (ii) generalization/unification of analytical expressions for
various network performance metrics to generalized block fading channels with independent but nonidentically
distributed (i.n.d) fading statistics among the spatially distributed nodes; (iii) analysis of the
effectiveness of joint-adaptation of the maximum retransmission limit Rmax of ARQ protocol and
cooperative diversity order N for delay-insensitive applications. Our insightful numerical results reveal
that the average throughput can be increased significantly by judiciously combining two additional degrees
of freedom (N and Rmax) that are available in cooperative amplify-and-forward (CAF) relay networks
besides employing AMC at the PHY layer, especially in the most challenging low signal-to-noise ratio
(SNR) regime.
CROSS LAYER DESIGN APPROACH FOR EFFICIENT DATA DELIVERY BASED ON IEEE 802.11P...pijans
Intelligent Transportation Systems (ITS) have been one of the promising technology that has a great interest attention from many researchers over the world. Vehicular Ad-hoc Network (VANET) communications environment as a part of ITS opens the way for a wide range of applications such as safety applications, mobility and connectivity for both driver and passengers to exploit the transport systems in a smoothly, efficiently and safer way. Several challenging tasks facing adopting VANET functionality for ITS such as modelling of wireless transmission and routing issues. These research issues have become more critical due to the high mobility of vehicles nodes (transmitters and receivers) and unexpected network topology due to the high speed of nodes. In fact, modelling radio propagation channel in VANET environment which considers as one of a stringent communications environment is a challenging task. The selection of a suitable transmission model plays a key role in the routing decisions for VANET. Different propagation models allow calculating the Received Signal Strength (RSS) based on key environmental properties such as the distance between transmitter vehicle and a receiver vehicle, the gain and antenna height of transmitter and a receiver vehicles. Hence, it is useful to calculate RSS and SNR values for a specific propagation model and then these values can be used later for routing decision in order to find the best path with high SNR. This paper evaluates the performance of different transmission models (freespace, two-ray and log-normal) in terms of Receive Signal Strength (RSS). In addition, the performance of such wireless transmission models for vehicular communication in terms of PDR, throughput and delay is evaluated by applying the proposed cross layer routing approach based on IEEE 802.11p. By using MATLAB, the obtained results confirm the best packet delivery ratio for our proposed approach, where it indicates poor quality of DSSS PHY with high number vehicles. The minimum delay achieved when traffic density is decreased.
An Efficient and Stable Routing Algorithm in Mobile Ad Hoc NetworkIJCNCJournal
Mobile Ad hoc Network (MANET) is mainly designed to set up communication among devices in infrastructure-less wireless communication network. Routing in this kind of communication network is highly affected by its restricted characteristics such as frequent topological changes and limited battery power. Several research works have been carried out to improve routing performance in MANET. However, the overall performance enhancement in terms of packet delivery, delay and control message overhead is still not come into the wrapping up. In order to overcome the addressed issues, an Efficient and Stable-AODV (EFST-AODV) routing scheme has been proposed which is an improvement over AODV to establish a better quality route between source and destination. In this method, we have modified the route request and route reply phase. During the route request phase, cost metric of a route is calculated on the basis of parameters such as residual energy, delay and distance. In a route reply phase, average residual energy and average delay of overall path is calculated and the data forwarding decision is taken at the source node accordingly. Simulation outcomes reveal that the proposed approach gives better results in terms of packet delivery ratio, delay, throughput, normalized routing load and control message overhead as compared to AODV.
Dear Student,
DREAMWEB TECHNO SOLUTIONS is one of the Hardware Training and Software Development centre available in
Trichy. Pioneer in corporate training, DREAMWEB TECHNO SOLUTIONS provides training in all software
development and IT-related courses, such as Embedded Systems, VLSI, MATLAB, JAVA, J2EE, CIVIL,
Power Electronics, and Power Systems. It’s certified and experienced faculty members have the
competence to train students, provide consultancy to organizations, and develop strategic
solutions for clients by integrating existing and emerging technologies.
ADD: No:73/5, 3rd Floor, Sri Kamatchi Complex, Opp City Hospital, Salai Road, Trichy-18
Contact @ 7200021403/04
phone: 0431-4050403
PERFORMANCE ANALYSIS OF WIRELESS MESH NETWORK USING ADAPTIVE INFORMANT FACTOR...IJCSES Journal
Wireless mesh network (WMN) has become an important leading technology which provides several types of useful applications such as community network, broadband home network and internet access, etc. The rise in the size of users in WMN has created a degradation of efficiency in a network especially in dense areas due to the clumsy channel allocation and hence creating many challenges for enhancing the users experience, network quality and throughput. Therefore in this paper, we proposed OCA based AIF model that can access the channel information and then it process to improve the RF channel association. The proposed OCA-AIF will function for each period when some interference is detected via AIF and we further extend this analysis by taking in to consideration the influence of interference to provide a high quality indicator in network. The analysis of result shows the optimization by our proposed approach which increases as per the increment of relay nodes (RNs).
LARGE-SCALE MULTI-USER MIMO APPROACH FOR WIRELESS BACKHAUL BASED HETNETScsandit
In this paper, we consider the optimization of wireless capacity-limited backhaul links in future heterogeneous networks (HetNets). We assume that the HetNet is formed with one macro-cell base station (MBS), which is associated with multiple small-cell base stations (SBSs). It is also assumed both the MBS and the SBSs are equipped with massive arrays, while all mobiles users (macro-cell and small-cell users) have single antenna. For the backhaul links, we propose to use a capacity-aware beamforming scheme at the SBSs and MRC at the MBS. Using particle swarm optimization (PSO), each SBS seeks the optimal transmit weight vectors that maximize the backhaul uplink capacity and the access uplinks signal-to-interference plus noise ratio (SINR). The performance evaluation in terms of the symbol error rate (SER) and the ergodic system capacity shows that the proposed capacity-aware backhaul link scheme achieves similar or better performance than traditional wireless backhaul links and requires considerably less computational complexity.
Comparative Review for Routing Protocols in Mobile Ad-Hoc Networksijasuc
Wireless Mobile Ad-Hoc Networks is one of the attractive research field that growing exponentially in the
last decade. it surrounded by much challenges that should be solved the improve establishment of such
networks. Failure of wireless link is considered as one of popular challenges faced by Mobile Ad-Hoc
Networks (MANETs). As this type of networks does not require any pre-exist hardware. As well as, every
node have the ability of roaming where it can be connected to other nodes dynamically. Therefore, the
network internal structure will be unpredictably changed frequently according to continuous activities
between nodes that simultaneously update network topology in the basis of active ad-hoc nature. This
model puts the functionality of routing operation in crucial angle in the area of research under mobile adhoc
network field due to highly dynamic nature. Adapting such kernel makes MANET indigence new
routing techniques to settle these challenges. Thereafter, tremendous amount of routing protocols proposed
to argue with ad-hoc nature. Thus, it is quite difficult to specify which protocols operate efficiently under
different mobile ad-hoc scenarios. This paper examines some of the prominent routing protocols that are
designed for mobile ad-hoc networks by describing their structures, operations, features and then
comparing their various characteristics.
we find out various power aware and data packet rate control with-collision-avoidance (CSMA/CA)-based ad hoc wireless network communication. And identifies that CSMA
Topology Management for Mobile Ad Hoc Networks ScenarioIJERA Editor
Cooperative communication is the main accessing point in present days. These results can be accessed through proactive protocol like route request packet sending and route request packet receiving. The main issue is how communication will be done in MANETS. Mobile Ad-hoc networks are self-configurable networks; each node behaves like server and client in MANET. COCO (Capacity Optimized Cooperative Communication) model was developed for accessing these types of resources in MANETs. This model can’t provide sufficient communication or overall network performance. This model provides sufficient capability improvement in mobile ad-hoc networks, but this model will be taking more power resources for doing this work. exploitation simulation examples, we have a tendency to show that physical layer cooperative communications have important impacts on the performance of topology control and network capability, and also the proposed topology management scheme will considerably improve the network capability in MANETs with cooperative communications
A Cluster-Based Routing Protocol and Fault Detection for Wireless Sensor NetworkIJCNCJournal
In Wireless Sensors Networks (WSN) based application, a large number of sensor devices must be deployed. Energy efficiency and network lifetime are the two most challenging issues in WSN. As a consequence, the main goal is to reduce the overall energy consumption using clustering protocols which have to ensure reliability and connectivity in large-scale WSN. This work presents a new clustering and routing algorithm based on the properties of the sensor networks. The main goal of this work is to extend the network lifetime via charge equilibration in the WSN. According to many errors with sensing devices and to have greater data accuracy, we use a quorum mechanism. The proposed algorithms are evaluated widely and the results are compared with related works. The experimental results show that the proposed algorithm provides an effective improvement in terms of energy consumption, data accuracy and network lifetime.
Investigation of Clock Synchronization Techniques and its Performance Impact ...ijctet
Mobile ad hoc Network (MANET) is an assortment of mobile nodes that area unit needed to transmit packets on behalf of every alternative. The mobile nodes maintain the topology data during a dynamic network among a selected vary. All nodes should remember of its neighbors that area unit directly approachable. The every node in network maintained next hop data of close neighbor nodes. The routing protocols area unit routed knowledge packets in between sender and receiver during a specific time instant. The time synchronization is maintained the communication clock cycle between the nodes. Time synchronization is an important element of a MANET. Time synchronization during a network aims at providing a typical duration for local clocks of nodes within the network. Since all hardware clocks area unit imperfect, local clocks of nodes could alienate from one another in time, thus determined time or durations of your
The performance of the vehicular communication-clustering processTELKOMNIKA JOURNAL
For the new wireless systems and beyond, the intelligent transportation system is considered as one of the main features that could be covered in the new research topics. Furthermore, both high-speed data transmission and data processing play a crucial role for these generations. Our work covers two main propositions in order to attain an improvement in such intelligent systems performance. A clustering algorithm is proposed and presented for grouping mobile nodes based on their speeds with some modified head assignments processes. This will be combined with a parallel-processing technique that enhances the QoS. Mainly, this work concerns enhancing the V2V data transmission and the processing speed. Thus, a wavelet processing stage has been imposed to optimize the transmitted power phenomenon. In order to check the validity of such proposition, five main efficiency factors have been investigated; namely complementary cumulative distributions, bit rates, energy efficiency, the lifetime of cluster head and the ordinary nodes reattaching-head average times.
PERFORMANCE ANALYSIS OF MULTI-PATH TCP NETWORKIJCNCJournal
MPTCP is proposed by IETF working group, it allows a single TCP stream to be split across multiple
paths. It has obvious benefits in performance and reliability. MPTCP has implemented in Linux-based
distributions that can be compiled and installed to be used for both real and experimental scenarios. In this
article, we provide performance analyses for MPTCP with a laptop connected to WiFi access point and 3G
cellular network at the same time. We prove experimentally that MPTCP outperforms regular TCP for
WiFi or 3G interfaces. We also compare four types of congestion control algorithms for MPTCP that are
also implemented in the Linux Kernel. Results show that Alias Linked Increase Congestion Control
algorithm outperforms the others in the normal traffic load while Balanced Linked Adaptation algorithm
outperforms the rest when the paths are shared with heavy traffic, which is not supported by MPTCP.
PERFORMANCE ASSESSMENT OF CHAOTIC SEQUENCE DERIVED FROM BIFURCATION DEPENDENT...IJCNCJournal
In CDMA system, m-sequence and Gold codes are often utilized for spreading-despreading and
scrambling-descrambling operations. In a previous work, a design framework was created for generating
large family of codes from logistic map, which have comparable autocorrelation and cross correlation to
m-sequence and Gold codes. The purpose of this work is to evaluate the performance of these chaotic
codes in a CDMA environment. In the bit error rate (BER) simulation, matched filter, decorrelator and
MMSE receiver have been utilized. The received signal was modelled for synchronous CDMA uplink for
simulation simplicity purpose. Additive White Gaussian Noise channel model was assumed for the
simulation.
ENERGY SAVINGS IN APPLICATIONS FOR WIRELESS SENSOR NETWORKS TIME CRITICAL REQ...IJCNCJournal
Along with handling and poor storage capacity, each sensor in wireless sensor network (WSN) is equipped
with a limited power source and very difficult to be replaced in most application environments. Improving
the energy savings in applications for wireless sensor networks is necessary. In this paper, we mainly focus
on energy consumption savings in applications for wireless sensor networks time critical requirements. Our
Paper accompanying analysis of advanced technologies for energy saving techniques for the optimization
of energy efficiency together with the data transmission is optimal. Moreover, we propose improvements to
increase energy savings in applications for wireless sensor networks require time critical (LEACH
improvements). Simulation results show that our proposed protocol significantly better than LEACH about
the formation of clusters in each round, the average power, the number of nodes alive and average total
received data in base stations.
As Wireless Sensor Networks are penetrating into the industrial domain, many research opportunities are emerging. One such essential and challenging application is that of node localization. A feed-forward neural network based methodology is adopted in this paper. The Received Signal Strength Indicator (RSSI) values of the anchor node beacons are used. The number of anchor nodes and their configurations has an impact on the accuracy of the localization system, which is also addressed in this paper. Five different training algorithms are evaluated to find the training algorithm that gives the best result. The multi-layer Perceptron (MLP) neural network model was trained using Matlab. In order to evaluate the performance of the proposed method in real time, the model obtained was then implemented on the Arduino microcontroller. With four anchor nodes, an average 2D localization error of 0.2953 m has been achieved with a 12-12-2 neural network structure. The proposed method can also be implemented on any other embedded microcontroller system.
Using spectral radius ratio for node degreeIJCNCJournal
In this paper, we show that the spectral radius ratio for node degree could be used to analyze the variation of node degree during the evolution of complex networks. We focus on three commonly studied models of complex networks: random networks, scale-free networks and small-world networks. The spectral radius ratio for node degree is defined as the ratio of the principal (largest) eigenvalue of the adjacency matrix of a network graph to that of the average node degree. During the evolution of each of the above three categories of networks (using the appropriate evolution model for each category), we observe the spectral radius ratio for node degree to exhibit high-very high positive correlation (0.75 or above) to that of the
coefficient of variation of node degree (ratio of the standard deviation of node degree and average node degree). We show that the spectral radius ratio for node degree could be used as the basis to tune the operating parameters of the evolution models for each of the three categories of complex networks as well as analyze the impact of specific operating parameters for each model.
These days considering expansion of networks, dissemination of information has become one of significant cases for researchers. In social networks in addition to social structures and people effectiveness on each other, Profit increase of sales, publishing a news or rumor, spread or diffusion of an idea can be mentioned. In social societies, people affect each other and with an individual’s membership, his friends
may join that group as well. In publishing a piece of news, independent of its nature there are different ways to expand it. Since information isn’t always suitable and positive, this article is trying to introduce the immunization mechanism against this information. The meaning of immunization is a kind of Slow Publishing of such information in network. Therefor it has been tried in this article to slow down the
publishing of information or even stop them. With comparison of presented methods for immunization and also presenting rate delay parameter, the immunization of methods were evaluated and we identified the most effective immunization method. Among existing methods for immunization and recommended methods, recommended methods also have an effective role in preventing spread of malicious rumor.
Peer-to-Peer streaming technology has become one of the major Internet applications as it offers the opportunity of broadcasting high quality video content to a large number of peers with low costs. It is widely accepted that with the efficient utilization of peers and server's upload capacities, peers can enjoy watching a high bit rate video with minimal end-to-end delay. In this paper, we present a practical scheduling algorithm that works in the challenging condition where no spare capacity is available, i.e., it maximally utilizes the resources and broadcasts the maximum streaming rate. Each peer contacts with only a small number of neighbours in the overlay network and autonomously subscribes to sub-streams according to a budget-model in such a way that the number of peers forwarding exactly one sub-stream will be maximized. The hop-count delay is also taken into account to construct a short depth trees. Finally, we show through simulation that peers dynamically converge to an efficient overlay structure with a short hop-count delay. Moreover, the proposed scheme gives nice features in the homogeneous case and overcomes SplitStream in all simulated scenarios.
ADAPTIVE HANDOVER HYSTERESIS AND CALL ADMISSION CONTROL FOR MOBILE RELAY NODESIJCNCJournal
The aim of equipping a wireless network with a mobile relay node is to support broadband wireless communications for vehicular users and their devices. The high mobility of vehicular users, possibly at a very high velocity in the area in which two cells overlap, could cause the network to suffer from a reduced handover success rate and, hence, increased radio link failure. The combined impact of these problems is service interruptions to vehicular users. Thus, the handover schemes are crucial in solving these problems. In this work, we first present the adaptive handover hysteresis scheme for the wireless network with mobile relay nodes in the high-speed train scenario. Specifically, our proposed adaptive hysteresis scheme is based on the velocity of the train. Second, the handover call dropping probability is reduced by introducing a modified call admission control scheme to support radio resource reservation for handover calls that prioritizes handover calls of mobile relay over the other calls. The proposed solution in which adaptive parameter is combined with call admission control is evaluated by system level simulation. Our simulation results illustrate an increased handover success rate and reduced radio link failures.
On the approximation of the sum of lognormals by a log skew normal distributionIJCNCJournal
Several methods have been proposed to approximate the sum of lognormal RVs. However the accuracy of each method relies highly on the region of the resulting distribution being examined, and the individual lognormal parameters, i.e., mean and variance. There is no such method which can provide the needed accuracy for all cases. This paper propose a universal yet very simple approximation method for the sum of Lognormals based on log skew normal approximation. The main contribution on this work is to propose an analytical method for log skew normal parameters estimation. The proposed method provides highly accurate approximation to the sum of lognormal distributions over the whole range of dB spreads for any correlation coefficient. Simulation results show that our method outperforms all previously proposed methods and provides an accuracy within 0.01 dB for all cases.
PERFORMANCE EVALUATION OF WIRELESS SENSOR NETWORK UNDER HELLO FLOOD ATTACKIJCNCJournal
Wireless sensor network (WSN) is highly used in many fields. The network consists of tiny lightweight
sensor nodes and is largely used to scan or detect or monitor environments. Since these sensor nodes are
tiny and lightweight, they put some limitations on resources such as usage of power, processing given task,
radio frequency range. These limitations allow network vulnerable to many different types of attacks such
as hello flood attack, black hole, Sybil attack, sinkhole, and many more. Among these attacks, hello flood is
one of the most important attacks. In this paper,we have analyzed the performance of hello flood attack and
compared the network performance as number of attackers increases. Network performance is evaluated
by modifying the ad-hoc on demand distance vector (AODV) routing protocol by using NS2 simulator. It
has been tested under different scenarios like no attacker, single attacker, and multiple attackers to know
how the network performance changes. The simulation results show that as the number of attackers
increases the performance in terms of throughput and delay changes.
In this paper, an application-based QoS evaluation approach for heterogeneous networks is proposed.It is possible to expand the network capacity and coverage in a dynamic fashion by applying heterogeneous wireless network architecture. However, the Quality of Service (QoS) evaluation of this type of network architecture is very challenging due to the presence of different communication technologies. Different communication technologies have different characteristics and the applications that utilize them have unique QoS requirements. Although, the communication technologies have different performance measurement parameters, the applications using these radio access networks have the same QoS requirements. As a result, it would be easier to evaluate the QoS of the access networks and the overall network configuration based on the performance of applications running on them. Using such applicationbased QoS evaluation approach, the heterogeneous nature of the underlying networks and the diversity of their traffic can be adequately taken into account. Through simulation studies, we show that the application performance based assessment approach facilitates better QoS management and monitoring of heterogeneous network configurations.
Advancements in Complementary Metal Oxide Semiconductor (CMOS) technology have enabled Wireless Sensor Networks (WSN) to gather, process and transport multimedia (MM) data as well and not just limited to handling ordinary scalar data anymore. This new generation of WSN type is called Wireless Multimedia Sensor Networks (WMSNs). Better and yet relatively cheaper sensors – sensors that are able to sense both scalar data and multimedia data with more advanced functionalities such as being able to handle rather intense computations easily - have sprung up. In this paper, the applications, architectures, challenges and issues faced in the design of WMSNs are explored. Security and privacy issues, over all requirements, proposed and implemented solutions so far, some of the successful achievements and other related works in the field are also highlighted. Open research areas are pointed out and a few solution suggestions to the still persistent problems are made, which, to the best of my knowledge, so far haven’t been explored yet.
HIDING A MESSAGE IN MP3 USING LSB WITH 1, 2, 3 AND 4 BITSIJCNCJournal
Steganography is the art of hiding information in ways that prevent the detection of hidden messages. This
paper presentsa new method which randomly selects position in MP3 file to hide a text secret messageby
using Least Significant Bit (LSB) technique. The text secret message isused in start and ends locations a
unique signature or key.The methodology focuses to embed one bit, two bits, three bitsor four bits from
secret message into MP3 file by using LSB techniques. The evaluation and performancemethods are based
on robustness (BER and correlation), Imperceptibility (PSNR) and hiding capacity (Ratio between Sizes of
text message and MP3 Cover) indicators.The experimental results show the new method is more security.
Moreover the contribution of this paper is the provision of a robustness-based classification of LSB
steganography models depending on their occurrence in the embedding position.
Maximizing network interruption in wirelessIJCNCJournal
With the colossal growth of wireless sensor networks (WSNs) in different applications starting from home
automation to military affairs, the pressure on ensuring security in such a network is paramount.
Considering the security challenges, it is really a hard-hitting effort to develop a secured WSN system.
Moreover, as the information technology is getting popular, the intruders are also planning new ideas to
break the system security, to harm the network and to make the system quality down with the target of
taking the control of the network to corrupt it or to get benefits from it anyway. The intruders corrupt the
system only when the security breaking cost (SBC) is lower compared with the benefits they attained or the
harm it can make to others. In this paper, the authors define the term “maximizing network interruption
problem” and propose a technique, called the grid point approximation algorithm, to estimate the SBC of a
multi-hop WSN so that it can be made tougher for an intruder to break the system security. It is assumed
that the intruder has the complete picture of the entire network. The technique is designed from the
intruder’s point of view for completely jamming all the sensor nodes in the network through placing
jammers or malicious nodes strategically and at the same time keeping the number of jammer nodes to
minimum or near minimum. To the best of the authors’ knowledge, there is no work proposed so far of the
same kind. Experimental results with the changes of the different network parameters show that the
proposed algorithm is able to provide excellent performances to achieve the targets.
A NOVEL METHOD TO TEST DEPENDABLE COMPOSED SERVICE COMPONENTSIJCNCJournal
Assessing Web service systems performance and their dependability are crucial for the development of
today’s applications. Testing the performance and Fault Tolerance Mechanisms (FTMs) of composed
service components is hard to be measured at design time due to service instability is often caused by the
nature of the network conditions. Using a real internet environment for testing systems is difficult to set up
and control. We have introduced a fault injection toolkit that emulates a WAN within a LAN environment
between composed service components and offers full control over the emulated environment in addition to
the capability to inject network-related faults and application specific faults. The toolkit also generates
background workloads on the system under test so as to produce more realistic results. We describe an
experiment that has been performed to examine the impact of fault tolerance protocols deployed at a
service client by using our toolkit system.
A predictive framework for cyber security analytics using attack graphsIJCNCJournal
Security metrics serve as a powerful tool for organizations to understand the effectiveness of protecting computer networks. However majority of these measurement techniques don’t adequately help corporations to make informed risk management decisions. In this paper we present a stochastic security framework for obtaining quantitative measures of security by taking into account the dynamic attributes associated with vulnerabilities that can change over time. Our model is novel as existing research in attack graph analysis do not consider the temporal aspects associated with the vulnerabilities, such as the availability of exploits and patches which can affect the overall network security based on how the vulnerabilities are interconnected and leveraged to compromise the system. In order to have a more realistic representation of how the security state of the network would vary over time, a nonhomogeneous model is developed which incorporates a time dependent covariate, namely the vulnerability age. The daily transition-probability matrices are estimated using Frei's Vulnerability Lifecycle model. We also leverage the trusted CVSS metric domain to analyze how the total exploitability and impact measures evolve over a time period for a given network.
APPROXIMATING NASH EQUILIBRIUM UNIQUENESS OF POWER CONTROL IN PRACTICAL WSNSIJCNCJournal
Transmission power has a major impact on link and communication reliability and network lifetime in Wireless Sensor Networks. We study power control in a multi-hop Wireless Sensor Network where nodes' communication interfere with each other. Our objective is to determine each node's transmission power level that will reduce the communication interference and keep energy consumption to a minimum. We propose a potential game approach to obtain the unique equilibrium of the network transmission power allocation. The unique equilibrium is located in a continuous domain. However, radio transceivers accept only discrete values for transmission power level setting. We study the viability and performance of mapping the continuous solution from the potential game to the discrete domain required by the radio. We demonstrate the success of our approach through TOSSIM simulation when nodes use the Collection Tree Protocol for routing the data. Also, we show results of our method from the Indriya testbed. We compare it with the case where the motes use Collection Tree Protocol with the maximum transmission power.
Sensor nodes are highly mobile, which makes the application running on them face network related problems like node failure, link failure, network level disconnection, scarcity of resources etc. Node failure and Network fault are need to be monitored continuously by supervising the network status especially for critical applications like Health Monitoring System. We propose Node Monitoring protocol (NMP) to monitor the node good conditions using agents and ensure that node gets promised quality of service. These Nodes senses environment and communicates important data to the sink or base station. To establish the correct event time, these nodes need to be synchronized with global clock. Therefore, time synchronization is very important parameter. We have built a simulating environment for Validating Node Monitoring Protocol (NMP) to assess the reliability of Health Monitoring systems. Formal Specification and Description Language tool (SDL) has been used to validate the NMP at design time in order to increase the confidence and efficiency of the system.
ENHANCEMENT OF TRANSMISSION RANGE ASSIGNMENT FOR CLUSTERED WIRELESS SENSOR NE...IJCNCJournal
Transmitter range assignment in clustered wireless networks is the bottleneck of the balance between
energy conservation and the connectivity to deliver data to the sink or gateway node. The aim of this
research is to optimize the energy consumption through reducing the transmission ranges of the nodes,
while maintaining high probability to have end-to-end connectivity to the network’s data sink. We modified
the approach given in [1] to achieve more than 25% power saving through reducing cluster head (CH)
transmission range of the backbone nodes in a multihop wireless sensor network with ensuring at least
95% end-to-end connectivity probability.
EFFICIENT ANALYSIS OF THE ERGODIC CAPACITY OF COOPERATIVE NON-REGENERATIVE RE...ijwmn
In this paper, we proposed a novel efficient method of analyzing the ergodic channel capacity of the
cooperative amplify-and-forward (CAF) relay system. This is accomplished by employing a very tight
approximate moment generating function (MGF) of end-to-end signal-to-noise ratio of 2-hop multi-relay
system, which is In this paper, we proposed a novel efficient method of analyzing the ergodic channel
capacity of the cooperative amplify-and-forward (CAF) relay system. This is accomplished by employing a
very tight approximate moment applicable to myriad of fading environments including mixed and
composite fading channels. Three distinct adaptive source transmission policies were considered in our
analysis namely: (i) constant power with optimal rate adaptation (ORA); (ii) optimal joint power and rate
adaptation (OPRA); and (iii) fixed rate with truncated channel inversion (TCIFR). The proposed frame
work based on the novel approximate MGF method is sufficiently general to encapsulate all types of fading
environments (especially for the analysis of the mixed fading case)and provides significant advantage to
model wireless system for mixed and composite fading channel. In addition to simplifying computation
complexity of ergodic capacity for CAF relaying schemes treated in literature, we also derive closed form
expressions for the above three adaptive source transmission policies under Nakagami-m fading with i.n.d
statistics. The accuracy of our proposed method has been validated with existing MGF expressions that are
readily available for specific fading environments in terms of bounds, and via Monte Carlo simulations.
CROSS LAYER DESIGN APPROACH FOR EFFICIENT DATA DELIVERY BASED ON IEEE 802.11P...pijans
Intelligent Transportation Systems (ITS) have been one of the promising technology that has a great
interest attention from many researchers over the world. Vehicular Ad-hoc Network (VANET)
communications environment as a part of ITS opens the way for a wide range of applications such as safety
applications, mobility and connectivity for both driver and passengers to exploit the transport systems in a
smoothly, efficiently and safer way. Several challenging tasks facing adopting VANET functionality for ITS
such as modelling of wireless transmission and routing issues. These research issues have become more
critical due to the high mobility of vehicles nodes (transmitters and receivers) and unexpected network
topology due to the high speed of nodes. In fact, modelling radio propagation channel in VANET
environment which considers as one of a stringent communications environment is a challenging task. The
selection of a suitable transmission model plays a key role in the routing decisions for VANET. Different
propagation models allow calculating the Received Signal Strength (RSS) based on key environmental
properties such as the distance between transmitter vehicle and a receiver vehicle, the gain and antenna
height of transmitter and a receiver vehicles. Hence, it is useful to calculate RSS and SNR values for a
specific propagation model and then these values can be used later for routing decision in order to find the
best path with high SNR. This paper evaluates the performance of different transmission models (free-
space, two-ray and log-normal) in terms of Receive Signal Strength (RSS). In addition, the performance of
such wireless transmission models for vehicular communication in terms of PDR, throughput and delay is
evaluated by applying the proposed cross layer routing approach based on IEEE 802.11p. By using
MATLAB, the obtained results confirm the best packet delivery ratio for our proposed approach, where it
indicates poor quality of DSSS PHY with high number vehicles. The minimum delay achieved when traffic
density is decreased
Efficient and stable route selection by using cross layer concept for highly...Roopali Singh
Efficient and stable route selection by using cross layer concept for highly mobile network with predictive features by Rupali Singh, Gajendra Singh Dhakad
published in International Journal of Research & Technology, Volume 3, Issue 4_November_2015
Design and analysis of routing protocol for cognitive radio ad hoc networks i...IJECEIAES
Multi-hop routing protocol in cognitive radio mobile ad hoc networks (CRMANETs) is a critical issue. Furthermore, the routing metric used in multi-hop CRMANETs should reflect the bands availability, the links quality, the PU activities and quality of service (QoS) requirements of SUs. For the best of our knowledge, many of researchers investigated the performance of the different routing protocols in a homogeneous environment only. In this paper, we propose a heterogeneous cognitive radio routing protocol (HCR) operates in heterogeneous environment (i.e. the route from source to destination utilize the licensed and unlicensed spectrum bands). The proposed routing protocol is carefully developed to make a tradeoff between the channel diversity of the routing path along with the CRMANETs throughput. Using simulations, we discuss the performance of the proposed HCR routing protocol and compare it with the AODV routing protocol using a discrete-event simulation which we developed using JAVA platform.
To increase the network capacity, there is
need to minimize the interference among nodes and
optimum control of topology in the foundation of
network. Recently, technological development helps to
build of mobile ad-hoc networks (MANETs) in order to
improve the quality of service (QoS) in terms of delay. In
contradictory to the objective of minimizing interference,
it is important to concern topology control in delay
constrained environment. The present research work
attempts to control the delay-constrained topology with
jointly considering delay and interference concept.
Additionally, the study proposed an interference oriented
topology control algorithm for delay-constrained
MANETs by taking account of both the interference
constraint and the delay constraint under the specific
condition of transmission delay, contention delay and the
queuing delay. Further, the study investigated the impact
of node mobility on the interference oriented topology
control algorithm. Finally, the results of the present
study shows that the proposed algorithm controls the
topology to convince the interference constraint, and
increases the transmit range to congregate the delay
requirement. Also, the study conclude that the algorithm
could effectively reduce the delay protocol and improve
the performance effectively in delay-constrained mobile
ad hoc networks.
Reduction of Topology Control Using Cooperative Communications in ManetsIJMER
International Journal of Modern Engineering Research (IJMER) is Peer reviewed, online Journal. It serves as an international archival forum of scholarly research related to engineering and science education.
Performance analysis of multilayer multicast MANET CRN based on steiner minim...TELKOMNIKA JOURNAL
In this study, the multicast mobile ad hoc (MANET) CRN has been developed, which involves multi-hop and multilayer consideration and Steiner minimal tree (SMT) algorithm is employed as the router protocol. To enhance the network performance with regards to throughput and packet delivery rate (PDR), as channel assignment scheme, the probability of success (POS) is employed that accounts for the channel availability and the time needed for transmission when selecting the best channel from the numerous available channels for data transmission from the source to all destinations nodes effectively. Within Rayleigh fading channels under various network parameters, a comparison is done for the performance of SMT multicast (MANET) CRN with POS scheme versus maximum data rate (MDR), maximum average spectrum availability (MASA) and random channel assignment schemes. Based on the simulation results, the SMT multicast (MANET) CRN with POS scheme was seen to demonstrate the best performance versus other schemes. Also, the results proved that the throughput and PDR performance are improved as the number the primary channels and the channel’s bandwidth increased while dropped as the value of packet size D increased. The network’s performance grew with rise in the value of idle probability (푃퐼) since the primary user’s (PU) traffic load is low when the value of 푃퐼 is high.
Rate Adaptation for Time Varying Channels Using Distributed Relay Selectionpaperpublications3
Abstract: Fixed systems used in cooperative communication suffer from multiplexing loss and low spectral efficiency due to the half duplex constraint of relays. To improve the multiplexing gain, successive relaying is proposed. This allows concurrent transmission of the source and relays. However, the severe inter-relay interference becomes a key challenge. Here Rate Adaptation for Time Varying Channels Using Distributed Relay Selection is proposed, which is capable of adapting the relay’s rate using distributed relay selection.
Analysis of Neighbor Knowledge Based Bcast Protocol Performance For Multihop ...pijans
Reliable group communication is a challenging issue for most Mobile Ad-hoc Networks (MANETs) due to
dynamic nature of wireless mobile nodes, group key establishment and management, ensuring secure
information exchange and Quality of Service (QoS) in data transfer. Recently multicast and broadcast
routing protocols are emerging for supporting QoS aware group communication. In MANETs QoS
requirements can be quantified by a set of measurable pre-specified service attributes such as packet
delivery ratio, end-to-end delay, packet loss probability, network control overhead, throughput,
bandwidth, power consumption, service coverage area etc. In this paper, the performance of a neighbor
knowledge based broadcast protocol is analyzed using different QoS metrics (packet delivery ratio, end-toend delay, packet loss probability and network control overhead). BCAST is used as broadcast protocol.
The performance differentials are analyzed using NS-2 network simulator for varying number of data
senders (multicast group size) and data sending rate (offered traffic to the network) over QoS aware group
communication. Simulation results show that BCAST performs well in most cases and provides robust
performance even with high traffic environments.
Analysis of Neighbor Knowledge Based Bcast Protocol Performance For Multihop ...pijans
Reliable group communication is a challenging issue for most Mobile Ad-hoc Networks (MANETs) due to
dynamic nature of wireless mobile nodes, group key establishment and management, ensuring secure
information exchange and Quality of Service (QoS) in data transfer. Recently multicast and broadcast
routing protocols are emerging for supporting QoS aware group communication. In MANETs QoS
requirements can be quantified by a set of measurable pre-specified service attributes such as packet
delivery ratio, end-to-end delay, packet loss probability, network control overhead, throughput,
bandwidth, power consumption, service coverage area etc. In this paper, the performance of a neighbor
knowledge based broadcast protocol is analyzed using different QoS metrics (packet delivery ratio, end-toend delay, packet loss probability and network control overhead). BCAST is used as broadcast protocol.
The performance differentials are analyzed using NS-2 network simulator for varying number of data
senders (multicast group size) and data sending rate (offered traffic to the network) over QoS aware group
communication. Simulation results show that BCAST performs well in most cases and provides robust
performance even with high traffic environments.
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/
Resource Allocation in MIMO – OFDM Communication System under Signal Strength...Kumar Goud
Abstract: - Multiple Inputs and Multiple Output (MIMO) and Orthogonal Frequency Division Multiplexing (OFDM) system have the potential to attain high capability on the propagation setting. The aim of this paper is that the adaptive resource allocation in MIMO-OFDM system uses the water filling formula. Water filling answer is enforced for allocating the ability so as to extend the data rate. The overall system capability is maximised subject to the constraints on total power, signal to noise quantitative relation, and proportionality. Channel is assumed as a flat attenuation channel and therefore the comparison is created for various 2×2, 2×3, 3×2 and 4×4 MIMO-OFDM systems and water filling formula with allotted power. Supported the capability contribution from the relaying terminal, a brand new parameter referred to as cooperation constant is introduced as an operate of the relaying sub channel. This parameter is employed to switch the target parameter of the subcarrier allocation procedure. Fairness-oriented [Fading Channel] and throughput-oriented [Near finish Channel] algorithms square measure elite from the literature to check the planned technique. Each algorithms square measure changed to use the mean of cooperation constant within the objective parameter of the subcarrier allocation procedure and shown to own a much better total turnout with none sacrifice.
Keywords - MIMO-OFDM; Water filling Algorithm; Subcarrier Resource Allocation
GRAPH THEORETIC ROUTING ALGORITHM (GTRA) FOR MOBILE AD-HOC NETWORKS (MANET)graphhoc
Battlefield theater applications require supporting large number of nodes. It can facilitate many multi-hop
paths between each source and destination pairs. For scalability, it is critical that for supporting network
centric applications with large set of nodes require hierarchical approach to designing networks. In this
research we consider using Mobile Ad Hoc Network (MANET) with multiple clusters. Each cluster
supports a few nodes with a cluster head. The intra-cluster connectivity amongst the nodes within the
cluster is supported by multi-hop connectivity to ensure handling mobility in such a way that no service
disruption can occur. The inter-cluster connectivity is also achieved by multi-hop connectivity. However,
for inter-cluster communications, only cluster heads are connected. The selection of intra-cluster
communications and inter-cluster communications allow scalability of the network to support multiservices
applications end-to-end with a desired Quality of Service (QoS). This paper proposes graph
theoretic approach to establish efficient connection between a source and a destination within each cluster
in intra-cluster network and between clusters in inter-cluster network. Graph theoretic approach
traditionally was applied networks where nodes are static or fixed. In this paper, we have applied the
graph theoretic routing to MANET where nodes are mobile. One of the important challenges in MANET is
to support an efficient routing algorithm for multi-hop communications across many nodes which are
dynamic in nature. However, dynamic behavior of the nodes requires greater understanding of the node
degree and mobility at each instance of time in order to maintain end-to-end QoS for multi-service
provisioning. This paper demonstrates graph theoretic approach produces an optimum multi-hop
connectivity path based on cumulative minimum degree that minimizes the contention and scheduling
delay end-to-end. It is applied to both intra-cluster communications as well as inter-cluster
communications. The performance shows that having a multi-hop connectivity for intra-cluster
communications is more power efficient compared to broadcast of information with maximum power
coverage. Each cluster performs similarly and the algorithm is also used for inter-cluster communications.
Our simulation results show that the proposed graph theoretic routing approach will reduce the overall
delay and improves the physical layer data frame transmission.
All papers submitted to IJMRR are subject to a double-blind peer review process. IJMRR is an international forum for research that advances the theory and practice of management. The journal publishes original works with practical significance and academic value. Authors are invited to submit theoretical or empirical papers in all aspects of management, including strategy, human resources, marketing, operations, technology, informAll papers submitted to IJMRR are subject to a double-blind peer review process. IJMRR is an international forum for research that advances the theory and practice of management. The journal publishes original works with practical significance and academic value. Authors are invited to submit theoretical or empirical papers in all aspects of management, including strategy, human resources, marketing, operations, technology, information systems, finance and accounting, business economics, and public sector management. action systems, finance and accounting, business economics, and public sector management.
Nexgen Technology Address:
Nexgen Technology
No :66,4th cross,Venkata nagar,
Near SBI ATM,
Puducherry.
Email Id: praveen@nexgenproject.com.
www.nexgenproject.com
Mobile: 9751442511,9791938249
Telephone: 0413-2211159.
NEXGEN TECHNOLOGY as an efficient Software Training Center located at Pondicherry with IT Training on IEEE Projects in Android,IEEE IT B.Tech Student Projects, Android Projects Training with Placements Pondicherry, IEEE projects in pondicherry, final IEEE Projects in Pondicherry , MCA, BTech, BCA Projects in Pondicherry, Bulk IEEE PROJECTS IN Pondicherry.So far we have reached almost all engineering colleges located in Pondicherry and around 90km
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.
Operation “Blue Star” is the only event in the history of Independent India where the state went into war with its own people. Even after about 40 years it is not clear if it was culmination of states anger over people of the region, a political game of power or start of dictatorial chapter in the democratic setup.
The people of Punjab felt alienated from main stream due to denial of their just demands during a long democratic struggle since independence. As it happen all over the word, it led to militant struggle with great loss of lives of military, police and civilian personnel. Killing of Indira Gandhi and massacre of innocent Sikhs in Delhi and other India cities was also associated with this movement.
How to Create Map Views in the Odoo 17 ERPCeline George
The map views are useful for providing a geographical representation of data. They allow users to visualize and analyze the data in a more intuitive manner.
Unit 8 - Information and Communication Technology (Paper I).pdfThiyagu K
This slides describes the basic concepts of ICT, basics of Email, Emerging Technology and Digital Initiatives in Education. This presentations aligns with the UGC Paper I syllabus.
This is a presentation by Dada Robert in a Your Skill Boost masterclass organised by the Excellence Foundation for South Sudan (EFSS) on Saturday, the 25th and Sunday, the 26th of May 2024.
He discussed the concept of quality improvement, emphasizing its applicability to various aspects of life, including personal, project, and program improvements. He defined quality as doing the right thing at the right time in the right way to achieve the best possible results and discussed the concept of the "gap" between what we know and what we do, and how this gap represents the areas we need to improve. He explained the scientific approach to quality improvement, which involves systematic performance analysis, testing and learning, and implementing change ideas. He also highlighted the importance of client focus and a team approach to quality improvement.
Model Attribute Check Company Auto PropertyCeline George
In Odoo, the multi-company feature allows you to manage multiple companies within a single Odoo database instance. Each company can have its own configurations while still sharing common resources such as products, customers, and suppliers.
How to Make a Field invisible in Odoo 17Celine George
It is possible to hide or invisible some fields in odoo. Commonly using “invisible” attribute in the field definition to invisible the fields. This slide will show how to make a field invisible in odoo 17.
The Roman Empire A Historical Colossus.pdfkaushalkr1407
The Roman Empire, a vast and enduring power, stands as one of history's most remarkable civilizations, leaving an indelible imprint on the world. It emerged from the Roman Republic, transitioning into an imperial powerhouse under the leadership of Augustus Caesar in 27 BCE. This transformation marked the beginning of an era defined by unprecedented territorial expansion, architectural marvels, and profound cultural influence.
The empire's roots lie in the city of Rome, founded, according to legend, by Romulus in 753 BCE. Over centuries, Rome evolved from a small settlement to a formidable republic, characterized by a complex political system with elected officials and checks on power. However, internal strife, class conflicts, and military ambitions paved the way for the end of the Republic. Julius Caesar’s dictatorship and subsequent assassination in 44 BCE created a power vacuum, leading to a civil war. Octavian, later Augustus, emerged victorious, heralding the Roman Empire’s birth.
Under Augustus, the empire experienced the Pax Romana, a 200-year period of relative peace and stability. Augustus reformed the military, established efficient administrative systems, and initiated grand construction projects. The empire's borders expanded, encompassing territories from Britain to Egypt and from Spain to the Euphrates. Roman legions, renowned for their discipline and engineering prowess, secured and maintained these vast territories, building roads, fortifications, and cities that facilitated control and integration.
The Roman Empire’s society was hierarchical, with a rigid class system. At the top were the patricians, wealthy elites who held significant political power. Below them were the plebeians, free citizens with limited political influence, and the vast numbers of slaves who formed the backbone of the economy. The family unit was central, governed by the paterfamilias, the male head who held absolute authority.
Culturally, the Romans were eclectic, absorbing and adapting elements from the civilizations they encountered, particularly the Greeks. Roman art, literature, and philosophy reflected this synthesis, creating a rich cultural tapestry. Latin, the Roman language, became the lingua franca of the Western world, influencing numerous modern languages.
Roman architecture and engineering achievements were monumental. They perfected the arch, vault, and dome, constructing enduring structures like the Colosseum, Pantheon, and aqueducts. These engineering marvels not only showcased Roman ingenuity but also served practical purposes, from public entertainment to water supply.
How to Split Bills in the Odoo 17 POS ModuleCeline George
Bills have a main role in point of sale procedure. It will help to track sales, handling payments and giving receipts to customers. Bill splitting also has an important role in POS. For example, If some friends come together for dinner and if they want to divide the bill then it is possible by POS bill splitting. This slide will show how to split bills in odoo 17 POS.
CLASS 11 CBSE B.St Project AIDS TO TRADE - INSURANCE
PERFORMANCE ANALYSIS OF THE LINK-ADAPTIVE COOPERATIVE AMPLIFY-AND-FORWARD RELAY NETWORKS WITH OPPORTUNISTIC RELAYING STRATEGY
1. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.3, May 2016
DOI: 10.5121/ijcnc.2016.8301 1
PERFORMANCE ANALYSIS OF THE LINK-ADAPTIVE
COOPERATIVE AMPLIFY-AND-FORWARD RELAY
NETWORKS WITH OPPORTUNISTIC RELAYING
STRATEGY
Bhuvan Modi, O. Olabiyi and A.Annamalai
Center of Excellence for Communication Systems Technology Research
Department of Electrical and Computer Engineering,
Prairie View A & M University, TX 77446 United States of America
ABSTRACT
This paper analyzes the performance of cooperative amplify-and-forward (CAF) relay networks that
employ adaptive M-ary quadrature amplitude modulation (M-QAM)/M-ary phase shift keying (M-PSK)
digital modulation techniques in Nakagami-m fading channel. In particular, we present and compared the
analysis of CAF relay networks with different cooperative diversity and opportunistic routing strategies
such as regular Maximal Ratio Combining (MRC), Selection Diversity Combining (SDC), Opportunistic
Relay Selection with Maximal Ratio Combining (ORS-MRC) and Opportunistic Relay Selection with
Selection Diversity Combining (ORS-SDC). We advocate a simple yet unified numerical approach based on
the marginal moment generating function (MGF) of the total received SNR to compute the average symbol
error rate (ASER), mean achievable spectral efficiency, and outage probability performance metrics.
KEYWORDS
Cooperative communications, adaptive M-QAM/MPSK modulation, Opportunistic relay selection
1. INTRODUCTION
The current and the future network design is highly challenged in every front due to increasing
connectivity and data rate requirements. The global internet traffic has experienced exponential
growth in the past 10 years and this plummeting growth is expected to continue in the future.
Cisco has predicted that annual global internet traffic is expected to reach zettabyte threshold by
2015 from current 15 billion network connections (including machine-to-machine connections)
[1]. This means, an average of more than two devices are expected to be in use per person on
earth. This surge in connectivity is attributed to the proliferation of the communication devices
such as tablets, mobile phones, connected appliances, and other smart machines. Since most of
these devices are mobile in nature, the increased connectivity requirement will be placing a huge
demand on already limited wireless network access resources. Also, as most of the predicted
internet traffic is expected to be dominated by video contents, there is a need to find more cost
effective ways of delivering these high data rate services to the end users within the limited
wireless channel bandwidth. Therefore, the development of very high-speed wireless access
system is imperative. Most of the ongoing communication research and industrial standard efforts
are dedicated to solving this problem. In fact the evolution of mobile networks from 2/2.5G
(GSM, GPRS, EDGE, IS95/IS98) to 3G (WCDMA/HSPA/CDMA2000) and to 4G (LTE/
HSPA+/ WIMAX) has been in response to address this issue [2]. While the current 4G access
2. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.3, May 2016
2
network holds the promise of delivering up to 1GBps data rate to end users (mostly available at
the macrocell base station), the proliferation of mobile devices has lead to very small-size "hot
spot" and therefore require extensive dimensioning of network resources in terms of coverage.
These hot spots could be homes, trains, airports and possibly buses with high data rate wireless
access requirements. The range extension (with high speed connectivity) has been a major point
of interest in LTE advance standard, and femtocells (very small base stations installable by the
end users) have been identified as the most promising potential solution. Since femtocells will act
as relays between the end user and the macrocells (regular base station) with multiple femtocells
expected to cooperate, the 4G network can greatly benefit from the ongoing research on the new
communication paradigm of cooperative relay system. The deployment of a large number of
femtocells can then be used to improve coverage, capacity (area and system spectral efficiency),
and energy efficiency of the wireless network access system.
The cooperative relay communication system takes advantage of the broadcast nature of the
wireless channel to improve the communication between the source node and a destination node
with the aid of one or more relay nodes. The system harnesses the new form of spatial diversity
and combat multipath fading, thereby improving the spectral efficiency, and reducing the
transmission error, system outages, and transmission power. The reduced transmission power (of
wireless device, femtocell and macrocell) effectively lowers the inter and intra macrocell
interference, thereby improving both the system and the area spectral efficiency. In another
development, the “cooperative diversity system” concept has gained research impetus owing to its
inherent ability to overcome the practical implementation issue of packing a large number of
antenna elements (to exploit the benefits of multiple-input-multiple-output (MIMO) space-time
processing techniques) in small form-factor devices. In general, there are three cooperative
relaying protocols: amplify-and-forward, decode-and-forward, and compress-and-forward [3-7].
The other variations include incremental, opportunistic, blind and semi-blind relays. In this
article, we advocate the implementation of the amplify-and-forward protocol on femtocell. The
advantages of this include its simplicity, lower implementation cost (i.e., relay nodes (femtocells)
do not have to decode and then re-encode the information received prior transmission) and
possibly the better privacy. The main drawback of the regular cooperative amplify-and-forward
(CAF) diversity system which employs the maximum ratio combining (MRC) or selection
diversity combining (SDC) at the destination's receiver is that each relay has to transmit on the
orthogonal channels (TDMA/CDMA). Therefore, the spectral efficiency is scaled by 1/(N+1),
where N is the number of relays, which reduces the capacity with increasing number of relays. In
order to improve this, Bletsas et al. and Zhao et al. [8-11], proposed relay selection method
otherwise known as the opportunistic relaying system (ORS). Here, the best relay is selected prior
to relay-to-destination transmission to limit the number of orthogonal transmissions to two. The
destination would then employ either MRC (subsequently referred to as ORS-MRC) or SDC
(subsequently referred to as ORS-SDC) diversity scheme on the two final diversity paths. In
addition to reducing the number of independent transmissions, the ORS protocols have been
shown to achieve full diversity just like regular relay system [27].
Adaptive transmission is yet another powerful wireless communication strategy for improving the
spectral utilization efficiency, wherein the signal constellation size, power level and/or the coding
rate are “matched” to the prevailing channel conditions based on the acquired channel-side-
information (CSI) on the feedback channel. Several articles have investigated the combination of
the link adaptation and the regular cooperative diversity system, both from theoretical limit
(ergodic capacity) and practical implementation (using digital modulation schemes) perspectives.
3. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.3, May 2016
3
For instance, the ergodic capacity of cooperative amplify-and-forward (CAF) relay networks with
the limited CSI were derived in [12-19] for different source-adaptive transmission policies in a
myriad of stochastic fading environments. The performance of practical adaptive digital
modulation scheme with regular relay system was considered in [20 -23]. The performance of
CAF relay with constant power M-QAM adaptive rate transmission, when average bit error rate
(ABER) in Rayleigh fading is constrained to be below a specified target bit error rate (BER) is
examined in [21] and [22] for fixed and optimum mode switching thresholds, respectively. In
[23], the performance of discrete-rate adaptive M-QAM for a single incremental relay in
Nakagami-m environment was examined, while [22] investigates the performance of a
cooperative decode-and-forward relay network with five-modes adaptive M-QAM transmission
in an i.i.d Nakagami-m wireless fading environment. All these articles and related references
indicate the advantage of the adaptive cooperative diversity system over the non-adaptive and/or
the non-cooperative system especially at low and medium signal-to-noise ratio (SNR). However,
the half-duplex nature of regular relay system makes the performance worse at high SNRs.
With the introduction of ORS in [8-11], several articles have been published on its performance,
but mostly focusing on non-adaptive system (i.e. fixed modulation). Average symbol or bit error
rate (ASER/ABER) performance for ORS-MRC scheme over Rayleigh, independent and
identically distributed (i.i.d) Nakagami-m, and independent and non-identically distributed (i.n.d)
Nakagami-m fading channels was investigated in [26-27], [28], and [29] respectively, while [30]
investigated ASER of both ORS-MRC and ORS-SDC scheme over i.i.d Nakagami-m fading
channel. Outage capacity for ORS-MRC and ORS-SDC has been considered in [31]. It is
important to note that until now; only a few articles have considered the link adaptive ORS
system. For instance, ergodic capacity with the source adaptation techniques have been
considered in [32-35] for the ORS-MRC scheme over Rayleigh fading channel, while the variable
rate constant power adaptive M-QAM modulation with ORS-MRC and ORS-SDC schemes over
Rayleigh fading have been considered in [35-36] and [37] respectively. Also, [38] analyzed the
performance of link adaptive incremental opportunistic relaying over i.n.d Rayleigh fading
channels. However [39] studied the performance analysis of cooperative communication with
only ORS-SDC scheme. Careful study of the adaptive ORS schemes [32-39] indicates that, the
analyses of both the ergodic capacity and the practically achievable spectral efficiency have been
obtained using the probability density function method, which can be very tedious and may not
always yield compact solutions.
In contrast, in this article we develop a new analytical framework based on the marginal MGF
method for evaluating the ASER, mean spectral utilization efficiency and outage probability
performance metrics (i.e., since the MGF of total received SNR may be easier to compute or
readily available for CAF relay networks).The developed analytical framework is thenused to
analyze and compare the performance of regular MRC, SDC, opportunistic MRC and SDC CAF
relay schemes that employ constant power adaptive discrete rate M-QAM/M-PSK transmission.
The proposed analytical framework is general, and can be applied to any arbitrary fade
distribution as long as the MGF of the end-to-end SNR is available unlike channel specific
derivations in [32-38]. For completeness purpose, the ergodic capacity with optimal rate
adaptation was also presented. Numerical analysis indicates that ORS-MRC leads the pack
considering the ergodic capacity and achievable spectral efficiency, while the regular MRC is the
best in terms of the outage probability and ASER. In the overall, the ORS-MRC is the best due to
the additional power saving as it consumes only 2/(N+1), of the total power consumed by regular
MRC. Therefore, not only does it perform well as a communication paradigm, it also supports
green technology due to its low transmit power requirement. Careful literature search indicates
that, this is perhaps the first time such comprehensive analysis of regular and opportunistic CAF
relay network with the link adaptation is being reported.
4. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.3, May 2016
4
The remainder of this article is organized as follows. In Section 2, the system model is discussed.
Section 3 derives the performance metrics for the CAF relay networks with adaptive M-QAM/M-
PSK modulation. Selected numerical results are presented in Section 4. Our conclusions are given
in Section 5.
Figure 1. Link-adaptive cooperative relay networks
2. SYSTEM MODEL
2.1 TOTAL MGF OF CAF RELAY NETWORKS
In this section, we will present the moment generating function (MGF) of the relayed path of
different cooperative diversity and opportunistic routing protocols that will be utilized in
evaluating the end-to-end ASER, mean spectral efficiency and the outage probability
performance metrics of the proposed network over a myriad of fading channels with the adaptive
M-QAM/M-PSK modulation schemes.
2.1.1 REGULAR COOPERATION: CAF RELAYING WITH MAXIMUM RATIO COMBINING
(MRC) AT THE DESTINATION
In this protocol, as shown in Fig 1, source node S which communicates with a destination node D
via a direct-link and through N amplify-and-forward relays, Ri, ,{1,2,...., }i N∈ in two transmission
phases. During the initial Phase I, S transmits signal x to D as well as to the relays Ri, where the
channel fading coefficients between S and D, S and the i-th relay node Ri, and Ri and D are
denoted by ,s dα , ,s iα and ,i dα , respectively. During the second phase of cooperation, each of the N
relay nodes transmits the received signal after amplification via orthogonal transmissions (e.g.,
TDMA in a round-robin fashion and/or FDMA). Hence, the channel usage per source
transmission, ( ) 1.U N N= +
Now, consider that the maximum ratio combiner (MRC) is employed at a D to coherently
combine all the signals received during Phase I and Phase II, the total received SNR at output of
the MRC detector can be shown to be (e.g., [19,20, 25])
, , ( )
, , ,
, ,1 1 11
N N N
s i i d H MM R C
i iT s d s d s d
s i i di i i
γ γ
γ γ γ γ γ γ
γ γ= = =
≤= + = + +
+ +∑ ∑ ∑
(1)
5. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.3, May 2016
5
where ( )
, ,, , ,HM
i s i s ii d i dγ γ γ γ γ= + is the harmonic mean SNR,
2
, , sa b a b oE Nγ α=
corresponds to the
instantaneous SNRs of link a-b, sE denotes the average symbol energy and 0N corresponds to the
noise variance.
The approximation of (1) is obtained by recognizing that the instantaneous SNR of a two hops
path can be accurately estimated to be the harmonic mean of the individual link SNRs, especially
at moderate/high SNR regimes [43]. Hence, it is straight-forward to show that the MGF of end-to-
end SNRis given by
, 1
( ) ( ) ( )MRC
s d iT
N
i
s s sγ γγ
φ φ φ=
= ∏ (2)
where ,
( )s d
sγφ and ( )i
sγφ are the MGFs of the SNR for the S-D link and the relayed paths,
respectively. The MGF of SNR for single channel reception is readily available in the literature. It
has been shown in the literature that the evaluation of the MGF, PDF and CDF of i
γ is a daunting
task with existing results limited to Rayleigh fading [41] and Nakagami-m [42] fading channels
with integer m and even in such cases the expressions are too complicated, and mostly useless for
the system level analysis. However, it has been shown in [43] that, ( )HM
i
γ in (1) can effectively
approximate i
γ especially at medium and high SNRs. Also, in this case the MGF expressions are
still difficult to obtain with the existing results limited to Raleigh fading [44] and i.i.d. Nakagami-
m [43] channels. Due to this limitation, the bounds have been developed for iγ and it is given by
( )
, ,
min( , ).UB
i s i i d
γ γ γ=
For instance, the closed-form formula for the MGF of ( )UB
i
γ in a Nakagami channel with i.n.d
fading statistics is given by [51]
( )
2 1
{( , ),( , )}
( ) ( )
( ) 1 , ; 1 ;
( ) ( )i
k
UB
m
k j j k k k j
j k k
k s i i d k k j j k j k k j j k j k k j
j k
m m m s m
s F m m m
m m m s m m s m m
γφ
∈
≠
Γ + Ω Ω + Ω
= − +
Γ Γ Ω Ω +Ω +Ω Ω Ω +Ω +Ω
∑
(3)
where [ ]q q
E γΩ = corresponds to the mean SNR of link q, (.)Γ is the Gamma function and mqis the
Nakagami-m fading index.
2.1.2 REGULAR COOPERATION: CAF RELAYING WITH SELECTION DIVERSITY COMBINING
(SDC) AT THE DESTINATION
In this kind of protocol implementation, the best route is selected at the destination node based on
the end-to-end relay SNR. Here in the case of SDC, the channel usage per source transmission is
similar to the MRC case (i.e., ( ) 1U N N= + ).
For this protocol, the effective SNR at the output of the SDC detector (i.e., all the signals received
during Phase I and Phase II) is given by
( ), 1 2 , ,1 1, ,2 2, , ,max( , , ,... ) max ,min( ),min( ),...min( )SDC
T s d N s d s d s d s N N dγ γ γ γ γ γ γ γ γ γ γ γ= ≈ (4)
For instance, the MGF of SDC
Tγ for a special case of independent and identically distributed (i.i.d)
Nakagami-m fading statistics can be obtained from Appendix A as [45]
6. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.3, May 2016
6
( )
( ) ( )
1 2 2
21
2 11
1 , ,... 1
( 1)
( ) 1 ( 1) 1, 1; 1;
! (1 2 )( 1) (1 2 )
j
SDC
T
p
i m
m mpN m mm ps
m m mmp i i i j j
s mN
s F m m
p i s pm s p
λγ
λ
φ λ
−− Ω Ω ΩΩ
+ +
= = ΩΩ
Γ + +
≈ + + − × + + +
+ +Γ + + +
∑ ∑ ∏
(5)
where 2 1(.,.;.;.)F is the Gauss hypergeometric function.
2.1.1 CAF RELAYING WITH OPPORTUNISTIC ROUTE SELECTION AND SDC (ORS-SDC) AT
THE SOURCE
The (ORS-SDC) relaying protocol focuses on limiting the number of cooperating relay to one.
Additionally, the choice of the appropriate route is selected by the source (assuming that the relay
with the best transmission parameter is already determined during the route discovery process) or
can be accomplished in a distributed fashion among the relays as proposed in [8]. Compared to
the regular cooperative diversity protocol discussed above, the best route is selected at the source
based on the end-to-end relay SNR. Therefore, the statistics of the best route selection is the same
as the selection diversity combining at the destination as the best among N+1 links is being
selected. However, the channel usage per source transmission in the case is ( ) 2U N = (i.e., source
will broadcast the signal to all the relays and destination in first time slot; and in the second time
slot, one of the best relay amplify and forward the signal to the destination). Therefore, the
spectral efficiency here does not reduce with the increasing number of relays as in the case of
regular cooperative diversity protocols discussed above (i.e., MRC and SDC only). Also, the
amount of channel side information and the implementation complexity is highly reduced.
2.1.2 CAF RELAYING WITH OPPORTUNISTIC RELAY SELECTION AND MRC (ORS-MRC) AT
THE DESTINATION
This protocol implementation takes advantage of the half duplex nature of the relay transmission
to achieve better performance than the ORS-SDC protocol. Here, since the source transmits in the
first transmission phase, and due to the broadcast nature of the wireless channel, the destination
can be close enough to receive this signal before receiving the signal from the relay. This is
particularly true in the distributed ORS protocol implementation proposed in [8]. Therefore, if the
channel side information of both the links is available, the received signal can be combined with
the MRC scheme at the destination. Note that the transmission channel usage ( ) 2U N = each
source transmission, but the statistics is slightly different from the pure ORS-SDC protocol. The
effective end-to-end SNR of the ORS-MRC protocol can be expressed as
( ),1 2 ,1 ,2, , 1, 2, ,max( , ,... ) max min( ),min( ),...min( )ORS MRC
T N s Ns ss d s d d d N dγ γ γ γ γ γ γ γ γ γ γ γ−
= + ≈ + (6)
The MGF of ORS MRC
Tγ −
for a special case of independent and identically distributed (i.i.d)
Nakagami-m fading statistics can be obtained from Appendix B as [45]
( )
( )
( )1 2 2
21
( 1)
1 , ,... 1
( 1)
( ) 1 1 ( 1)
! 2
j
ORS MRC
T
p
impN m
m ps
m
m
p i i i j j
N s
s
p i s p
λγ
λ
φ −
−
− ΩΩ
+
= = Ω
Γ +
≈ + + −
+
∑ ∑ ∏ (7)
Hence, by utilizing the above mentioned closed-form MGFs of the four protocol schemes, we can
easily analyse and compare the performance of CAF relay networks in terms of mean achievable
spectral efficiency, outage probability and average symbol error rate.
7. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.3, May 2016
7
2.2CUMULATIVE DISTRIBUTION FUNCTION (CDF) OF THE TOTAL END-TO-END SNR
To evaluate the various performance measures, the knowledge of the CDF of total effective SNR
T
γ of the CAF relay networks is required. Since the analytical CDF expression for the CAF relay
networks is difficult to obtain, the alternative is to compute the CDF from the MGF expression in
(2).
One of the most efficient frequency inversion method is the Abate’s Fixed-Talbot method (i.e.,
multi-precision Laplace transform inversion) [16], viz.,
( )
1
( )
1
11
2
( )
( ) ( ) Re{ ( ) }
( )
Z
xsrx k k
X X X k
k
k
r
Z Z
j
F x r e e s
s
θσ θ
φ φ θ
θ
−
=
+
≅ + ∑ (8)
where 2 / (5 ),r Z x= / , ( ) ( cot( )),k k k kk Z s r jθ π θ θ θ= = + ( ) ( cot( ) 1)cot( ),k k k k kσ θ θ θ θ θ= + − and positive
integer Z can be chosen to get the desired accuracy. Utilizing (8), we can easily compute the CDF
expressions from its respective total MGF expression for the CAF relay networks.
3. ADAPTIVE MODULATION
In this section, we develop a new analytical framework based on the marginal MGF for
evaluating the ASER, mean spectral utilization efficiency and outage probability performance
metrics.It will shown that the mean achievable spectral efficiency of ADR M-QAM/M-PSK and
ASER of CAF relay networks with adaptive source transmission can be expressed in terms of
difference of two “CDF” terms.The ADR M-QAM/M-PSK schemes are first explained, followed
by the outage probability, the mean spectral efficiency, and the average SER analysis.
3.1 ADR M-QAM/M-PSK SCHEMES
In the adaptive modulation techniques, the destination node needs only to compute the total
received SNR, select the appropriate transmission rate, and feedback this information to the
transmitter. In context of CAF relay system, the destination node only needs to compute and
convey the information on the total (effective) received SNR to the source node for it to select an
appropriate transmission rate. This results into a higher mean achievable spectral efficiency
without having to sacrifice the error rate performance. For this reason and more specifically due
to several other practical advantages of the adaptive rate modulation, we consider both the
adaptive M-QAM and the M-PSK digital modulation schemes in this paper to improve the
performance of the CAF relay networks.
In order to simplify the analysis of the adaptive modulation, there is a need to express
instantaneous error rate in desirable exponential form, similar to the one in the existing literatures
[21-25]. Here, we employ the exponential-type representations of the instantaneous (SER) for the
M-PSK and the M-QAM schemes and are respectively given by [40, Table II]
1 1
2 2sin 2 sin1 1
S
b M b Ms s
P a e c e
γ π γ π
− −
≈ + (9)
( )( ) ( )
1 1 1 13 63 9
2 2 22 1 1 1 2 1
1 1 1 1 1 12 2
s s s s
S
b b b b
M M M MP ka e kc ka e kc e k a c e
γ γ γ γ
− − − −
− − − −≈ + − − − (10)
8. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.3, May 2016
8
where ( ) ,1M Mk = − M is the constellation size and parameters 1 1
0.2938; 1.0483;a b= =
1
0.5070c = are obtained from [40, Table I]. The above exponential forms particularly facilitate
the averaging of the SER over the fade distribution. The resulting average symbol error rate
(ASER) expression (taking advantage of Laplace transform property), which can be evaluated as
the weighted sum of the MGF of end-to-end SNR of fading channel, can be expressed as
( ) ( )1 1 1 1
2 2sin 2 sinM PSKP a b M c b Mγ γφ π φ π−
= + (11)
( )2 2 21 1 1 1
1 1 1 1 1 1
3 3 6 9
2 2 ( ) ( )
2( 1) 1 1 2( 1)
M QAM
b b b b
P ka kc ka kc k a c
M M M M
φ φ φ φ−
= + − − −
− − − −
(12)
where (.)γφ is the MGF of SNR for single channel.
In the ADR M-QAM/M-PSK system, the range of the effective received SNR is divided into T+1
fading regions. When the fading causes the total received SNR to fall into the n-th region (n = 0,
1,T), the constellation size 2n
n
M = is employed for the transmission. Also, the SNR thresholds
for partitioning of the total received SNR depends on the target SER level, Ps. The region
boundary n
γ is chosen for the corresponding transmission mode n to be the minimum SNR
required to achieve Ps, which can be easily obtained by inverting (9) and (10) for M-PSK and M-
QAM modulation schemes respectively
( )
2
1 1 1
2
11
41
ln
sin 2
S
n
n
a a c P
b M c
γ
π
− + +
≈ −
(13)
( )( )2
1 1 1 1
11
4 1 1
2( 1)
ln
3 2
Mn
SMnn
n
a a c P
M
b c
γ
−
− + + − −
−
≈ −
(14)
where , 1,2,3...,n T= and 1 .Tγ + = +∞
It is worth to mention here that, the two exponential terms are more accurate than the existing
invertible expressions in the literature [46-48]. Representative example has been shown in Fig. 2,
where a comparison has been made between the proposed approximation and the single and two
exponential term approximation in [47] and [48] respectively. This figure highlights that our
proposed exponential approximation (11-12), yields a very good estimate of the actual ASER
performance over a wide range of average link SNRs, different fading severity indices and for
different constellation sizes. It is evident from the figure that, the proposed approximation
performs better than [47] and [48] for the M-QAM and better than [48] for the M-PSK.
Therefore, for the rest of the analysis in this article, the proposed two exponential term
approximation will be utilized.
9. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.3, May 2016
9
Figure 2 ASER of M-PSK and M-QAM over Nakagami fading channels (m = 1 and 3) without diversity
3.2 OUTAGE PROBABILITY
When the total received SNR falls below the region boundary threshold 1
γ ( 1
γ can be obtained by
setting, n = 1 in (13) or (14)), we cease the transmission, because the prescribed target SER
cannot be satisfied even with the smallest constellation size. The probability of such an outage
event is given by 1
( )out FP γ γ= , where the CDF term can be evaluated efficiently using (8).
3.3 MEAN SPECTRAL EFFICIENCY
The normalized average achievable spectral efficiency for ADR M-QAM/PSK is given by the
weighted sum of the data rates in each of the partitioned regions [21, 25] viz.,
1
1
( )
T
adr
n
n
R
np
B U N =
= ∑ (15)
where n
p denotes the transmission mode selection probability (i.e., probability that the total
received SNR falls in the n-th partition region):
1
1
( ) ( ) ( )
n
n n n
n
p f d F F
γ
γ γ γ
γ
γ γ γ γ
+
+
= = −∫ (16)
Hence, using the appropriate MGF expressions derived in [43-44, 49] in (8), we can readily
compute the mean spectral efficiency of the ADR M-QAM/PSK in a myriad of wireless fading
environments.
0 5 10 15 20 25 30
10
-6
10
-5
10
-4
10
-3
10
-2
10
-1
10
0
Mean SNR Per Symbol (dB)
AvearageSymbolErrorRate
[47, Eq.(17)]
Exact
Proposed Method
[48, Eq.(10)]
32PSK, m = 1
16QAM, m = 3
4QAM, m = 1
8PSK, m = 3
10. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.3, May 2016
10
3.4 ASER OF ADAPTIVE M-QAM/PSK
The ASER of ADR M-QAM/PSK can be calculated as the ratio of the average number of error
bits per transmission divided by the average number of bits per transmission [47], viz.,
1
1
1
,
( ) ( )
T
n
n
adr T
n n
n
n SER
ASER
n F Fγ γγ γ
=
+
=
=
−
∑
∑
(17)
where n
SER is the average SER in a specific SNR region of 1[ , ]n nγ γ+ and can be represented as
1
( )
n
n M
n
PSER f d
γ
γ
γ
γ γ
+
= ∫ (18)
where PM is the CEP of the modulation scheme in AWGN channel. For the special case of M-
PSK scheme, we can derive the n
SER by substituting (9) in to (18) viz.,
( )( ) ( )( )}{
( ) ( ) ( ) ( )
1
2 2
1 1 1 1
2 2 2 2
1 1 1 1 1 11 1
exp sin exp 2 sin ( )
sin sin sin sin( , ) ( , ) (2 , ) (2 , )
n
n
n
n nn n
SER a b M c b M f d
a M M c M Mb b b b
γ
γ
γ
γ γ γ γ
γ π γ π γ γ
π π π πφ γ φ γ φ γ φ γ
+
+ +
= − + −
= +− −
∫ (19)
and the term ( )( , ) e f dβγ
γ
α
γ γ γφ β α
∞
−
= ∫ in (19) denotes the marginal MGF of the total received SNR.
Note that although this quantity is available in closed-form for non-cooperative system (e.g. [48]),
similar expressions do not appear to be readily available or generalized for the CAF relay
networks, particularly in a generalized wireless fading environment. Utilizing [51, Appendix C],
we can compute the desired marginal MGF as a difference between two “CDF” terms of an
auxiliary function, viz.,
1 1 1 1ˆ ˆ ˆ ˆ
( ) ( ) ( ) ( )n n nn na a b b
SER a F F c F Fγ γ γ γ
γ γ γ γ+ +
= − + − (20)
where ˆ ( )a
F xγ
and ˆ
( )b
F xγ
in (20) can be evaluated efficiently via (8), but using the “MGF” formulas
of the auxiliary functions (i.e., ( )( )2
1
sin( )a
Ms s bγ γ πφ φ= + and ( )( )2
1
sin( ) 2b
Ms s bγ γ πφ φ= + ). Similarly treatment
can also be applied to the M-QAM modulation scheme by substituting (10) into (18).
Eq. (20) allows us to generalize the evaluation of adr
ASER over arbitrary multipath/shadowing
fading as long as the MGF of SNR of fading channel is available. This is in sharp contrast with
channel specific PDF methods in [32-34] which limited their analysis to Rayleigh fading channel.
4. NUMERICAL RESULTS
In this section, selected numerical results are provided for the normalized mean achievable
spectral efficiency, outage probability and ASER performance metrics of CAF relay networks
with both the adaptive discrete rate M-QAM and M-PSK digital modulation schemes. In
particular, we are comparing the performance of four distinct cooperative diversity and
11. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.3, May 2016
11
opportunistic routing protocols: (i) ORS-MRC (ii) ORS-SDC (iii) MRC and (iv) SDC, over the
i.i.d Nakagami fading environment (including special case of Rayleigh fading). Moreover, the
ergodic capacity analysis with the optimal rate adaptation policy is also presented for the
theoretical performance limit of the above protocol schemes. To generate plots, the mean link
SNRs are chosen arbitrarily as: ,1s
Ω = ,2s
Ω = ,3s
Ω = 1,d
Ω = 2,d
Ω = 3,d
Ω = ,s d
Ω = Es/N0 and the fading indexes
on the each links is chosen as m = 3 (unless states otherwise). For the ADR system, the target
SER of 10-3
is arbitrarily chosen.
Fig. 3 illustrates the ergodic capacities of the ORA policy using four different protocols (i.e.,
ORS-MRC, ORS-SDC, SDC and MRC). To generate the plots, we have used the following
generalized expressions in terms of the MGF of end-to-end SNR of CAF relay networks [11]
02
1 1
1 ( )
( ) ln
y
O RAC e
y dy
B U N y γφ
−∞
−= ∫ (21)
Expression (21) indicates that the ORA capacity evaluation requires only the knowledge of the
MGF of SNR of the fading channel. By substituting the total MGF of the above mentioned
protocols into (21), we can easily generate the curves as shown in the figure. From the figure, we
can observe that the performance of the opportunistic relay scheme (i.e., ORS-MRC and ORS-
SDC) is better than the regular cooperation (i.e., MRC and SDC) respectively. This improvement
in the performance of the ORS scheme is due to the utilization of the two orthogonal slots for the
total transmissions compared to the three slots in the regular cooperation. Moreover, it is
interesting to note that, the authors in [28], compares the ergodic capacities of the CAF relay
network using best relay selection and the regular MRC scheme. However, their framework does
not lend itself to the analysis of the ORS-SDC or the SDC case, whereas our framework
encapsulates the performance of all the four protocols.
Figure 3 Ergodic channel capacities of the optimal rate adaptation (ORA) policy with two cooperative
relays (N =2)
0 5 10 15 20
0
0.5
1
1.5
2
2.5
3
3.5
4
Es
/N0
(dB)
NormalizedChannelCapacityC/B(bits/sec/Hz)
ORS-MRC
ORS-SDC
SDC
MRC
12. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.3, May 2016
12
Fig. 4 shows the comparison in terms of spectral efficiency of the different cooperative diversity
and the opportunistic routing protocols, with the adaptive M-PSK modulation. It is worth to
mention that for a single relay case, the ORS-MRC gives the same performance as the MRC
scheme, while the ORS-SDC scheme also gives the same performance as the SDC scheme.
However, as the number of relay increases, ORS-MRC performs better than the regular MRC
protocol at medium and high SNRs, while the ORS-SDC protocol performs better than the regular
SDC protocol throughout the SNR range. This is because irrespective of the number of relays in
the participation, the total channel usage for the ORS-MRC and the ORS-SDC is kept constant at
two time slots per source transmission; whereas the channel usage for MRC and SDC schemes
increases with increasing number of relays. Moreover, to further improve the spectral efficiency,
we incorporate the adaptive M-PSK modulation scheme (compared to fixed modulation schemes
in the previous literatures) to adapt the transmission rate with the varying channel conditions. It is
evident from Fig. 4 that by increasing the maximum constellation size (transmission modes) in
the ADR M-PSK directly translates into improved spectral efficiency. However, this
improvement is achieved at the expense of the increased ASER (see Fig. 5). In summary, the link
adaptive ORS-MRC scheme gives the best overall performance. Hence, it can be concluded that
the ORS-MRC protocols are recommended for the cooperating nodes at the tactical edge or at the
cell boundary, where the received signal strength is weak.
Figure 4 Comparison of different cooperative diversity and opportunistic routing protocols with adaptive
M-PSK modulation (T = 3 and 4)
Fig. 5 illustrates the average symbol error rate (ASER) of a CAF relay network with the adaptive
M-PSK modulation (using T = 3 and 4). We observe that the ASER of the MRC scheme is the
lowest, whereas, the ORS-SDC scheme is the highest. This is due to the availability of the total
N+1 diversity paths in the MRC scheme. However, this is achieved at the expense of the power
efficiency as the ORS-SDC and the ORS-MRC requires only 1/(N+1) and 2/(N+1) of the total
power of the regular MRC scheme respectively.
0 5 10 15 20 25 30
0
0.2
0.4
0.6
0.8
1
1.2
1.4
1.6
1.8
2
SNR Es
/No
(dB)
NormalizedAverageSpectralEfficiency(bits/sec/Hz)
ORS-MRC
ORS-SDC
MRC
SDC
N = 3
N = 1
T = 4
T = 4
T = 3
T = 3
13. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.3, May 2016
13
Figure 5 Average symbol error rate of a CAF system with different cooperative diversity and opportunistic
routing protocols using adaptive M-PSK modulation (T =3 and 4)
Figure 6 Comparison of different cooperative diversity and opportunistic routing protocols with adaptive
M-MQAM modulation (T = 5) consisting of two relays
Fig. 6 shows the spectral efficiency performance comparison of the four cooperative diversity and
the opportunistic routing protocols with the ADR M-QAM modulation scheme with T = 5. This
figure highlights the influence of the channel fading severity on the performance of the link
adaptive cooperative system. While the performance trend among the protocols is similar to the
one obtained in Fig. 4, Fig. 6 in particularly shows that, as the channel condition improves, the
0 5 10 15 20 25 30
10
-9
10
-8
10
-7
10
-6
10
-5
10
-4
10
-3
SNR Es
/No
(dB)
AverageSymbolErrorRate
N = 1
N = 3
ORS MRC
ORS SDC
MRC
T = 3
T = 4
0 5 10 15 20 25 30
0
0.5
1
1.5
2
2.5
SNR Es
/No
(dB)
NormalizedAverageSpectralEfficiency(bits/sec/Hz)
m = 4
m = 1
ORS-MRC
ORS-SDC
MRC
SDC
14. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.3, May 2016
14
achievable spectra efficiency improves. To the best of our knowledge, this effect has never been
reported in the earlier literature, and it also demonstrates the versatility of our mathematical
framework.
Figure 7 Probability of outage of a CAF system with different cooperative diversity and
opportunistic routing protocols using adaptive M-PSK modulation (T = 3) (Note that for N=1, the
ORS-MRC and MRC, whereas for any values of N, ORS-SDC and SDC schemes are the same)
Figure 7 depicts the outage probability as a function of SNR at the target SER of 10-3
and it
highlights the benefit of the cooperative diversity to maximize the performance of the wireless
communication system. From figure 7, we conclude the following important observations. First,
we notice that the case with cooperative diversity (i.e., N = 3) evidently outperforms the case with
N = 1. Second, the outage probability with the MRC protocol has a better performance than all the
other protocols (similar to the case in fig. 5 for the ASER analysis with the MRC protocol). This
performance gain is due to the additional diversity path offered by all the relays and direct path in
the system, but still at the expense of the power efficiency.
5. CONCLUSIONS
This paper analyzes the performance of cooperative amplify-and-forward (CAF) relay networks
that employ the adaptive M-ary quadrature amplitude modulation (M-QAM)/M-ary phase shift
keying (M-PSK) digital modulation techniques in the Nakagami-m fading channel model. In
particular, we present and compared the analysis of the CAF relay networks with different
cooperative diversity and opportunistic routing protocols such as Maximal Ratio Combining
(MRC), Selection Diversity Combining (SDC), Opportunistic Relay Selection with Maximal
Ratio Combining (ORS-MRC) and Opportunistic Relay Selection with Selection Diversity
Combining (ORS-SDC).We advocate a simple yet unified numerical approach based on the
marginal moment generating function (MGF) of the total received SNR to compute the average
symbol error rate (ASER), mean achievable spectral efficiency, and the outage probability
performance metrics. These analytical frameworks and results will facilitate the choice of
cooperation protocol and configurations that can be employed in the design and deployment of
femtocells.
0 5 10 15 20 25
10
-6
10
-5
10
-4
10
-3
10
-2
10
-1
10
0
SNR Es
/No
(dB)
OutageProbability
MRC
ORS-MRC
ORS-SDC
N = 1
N = 3
15. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.3, May 2016
15
APPENDIX A
This section provides the derivation for the MGF of end-to-end SNR of CAF relay system with
SDC protocol at the destination. This is also applicable to the ORS scheme with SDC at the
destination.
The CDF of the end-to-end SNR given in (4) can be expressed as
( ), , , ,1 1
( ) ( ) ( ) ( ) 1 [1 ( )][1 ( )]SDC
s d r s d s r r dT
N N
r r
F F F F F Fγ γ γ γ γγ
γ γ γ γ γ γ= =
= ≈ − − −∏ ∏ (A.1)
where ,
( )s d
Fγ γ , ,
( )s r
Fγ γ and ,
( )r d
Fγ γ are the CDFs of the source-to-destination, source-to-relay and
relay-to-destination links, respectively.
The effective MGF can then be evaluate using the differentiation property of the Laplace
transform via a single integral expression
( )
,
, , ,
10
10
( ) ( ) ( )
( ) 1 [1 ( )][1 ( )]
SDC
s d rT
s d s r r d
Ns
r
Ns
r
s s e F F d
s e F F F d
γ
γ γγ
γ
γ γ γ
φ γ γ γ
γ γ γ γ
∞
−
=
∞
−
=
=
≈ − − −
∏∫
∏∫
(A.2)
For special case of independent and identically distributed (i.i.d.) Nakagami-m channel, the MGF
can be reduced to [30]
( )
1 2 2
21
(2 )
0
1 , ,... 1
( , )
( ) 1 ( 1)
( ) !
j
m
SDC
T
p
ip mN mm
ps p
p i i i j j
NG m
s s e e d
pm i
γγ λ
γ
γ
φ γ γΩ
−∞ − Ω− Ω
= =
≈ + −
Γ
∑ ∑ ∏∫ (A.3)
where (.,.)G is the lower incomplete gamma function and
2
1
p
jj
iλ =
= ∑
Using the identity [52, Eq. (6.455.2)], after few algebraic manipulations, the closed-form MGF
expression can be obtained as shown in (5).
APPENDIX B
This section provides the derivation for the MGF of end-to-end SNR of ORS CAF relay system
with MRC protocol at the destination.
The effective MGF of (6) can be evaluated using the addition and differentiation properties of the
Laplace transform via a single integral expression given by
( )
,
, , ,
10
10
( ) ( ) ( )
( ) 1 [1 ( )][1 ( )]
ORS MRC
s d rT
s d s r r d
Ns
r
Ns
r
s s s e F d
s s e F F d
γ
γ γγ
γ
γ γ γ
φ φ γ γ
φ γ γ γ
−
∞
−
=
∞
−
=
=
≈ − − −
∏∫
∏∫
(B.1)
16. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.3, May 2016
16
For special case of independent and identically distributed (i.i.d.) Nakagami-m channel, the MGF
can be reduced to
( )
( )
1 2 2
21
(2 )
0
1 , ,... 1
( ) 1 1 ( 1)
!
j
m
ORS MRC
T
p
ip mN m
m pp ss
m
p i i i j j
N
s s e e d
p i
γλ γ
γ
φ γ γΩ
−
− ∞− −Ω −Ω
= =
≈ + + −
∑ ∑ ∏ ∫
(B.2)
Using the identity [52, Table 17.13], after few algebraic manipulations, the closed-form MGF
expression can be obtained as expressed in (7).
It is worth to mention that the expression in (7) is much more compact and simpler than the
equivalent expression in [30, Eq. (17)].
ACKNOWLEDGMENT
This work is supported in part by funding from the National Science Foundation NSF/HRD
0931679 and the US Air Force Research Laboratory (Contract #FA8750-09-1-0151).
REFERENCES
[1] Cisco Visual Networking Index: Forecast and Methodology,2010-
2015.http://www.cisco.com/en/US/solutions/collateral/ns341/ns525/ns537/ns705/ns827/white_paper_
c11-481360_ns827_Networking_Solutions_White_Paper.html. Accessed February 01, 2011
[2] ITU global standard for international mobile telecommunications ´IMT-Advanced´.
http://www.itu.int/ITU-R/index.asp?category=information&rlink=imt- advanced & lang=en.
Accessed February 01, 2011
[3] N. Laneman, D. Tse, and G. Wornell, (2004) “Cooperative diversity in wireless networks: efficient
protocols and outage behavior,” IEEE Trans. Info. Theory, vol. 50, no.12, pp. 3062-3080.
[4] N. Lanemanand G. Wornell, (2003) “Distributed space-time coded protocols for exploiting
cooperative diversity in wireless networks. IEEE Trans. Info. Theory, vol. 49, no .10, pp. 2415–2525.
[5] A. Sendonaris, E. Erkip and B. Aazhang, (2003) “User cooperation diversity, part I: system
description”IEEE Trans. Communications, vol. 51, no.11, pp. 1927–1938.
[6] A. Sendonaris, E. Erkip and B. Aazhang,(2003) “User cooperation diversity, part II: implementation
aspects and performance analysis”,IEEE Trans. Communications, vol. 51, no. 11, pp. 1939–1948.
[7] M. Khojastepour, A. Sabharwal and B. Aazhang, (2004) “Lower bounds on the capacity of Gaussian
relay channel”,Conf. Information Sciences and Systems (CISS), Princeton, NJ, pp. 597–602.
[8] A. Bletsas, A. Khisti,D. P. Reedand A. Lippman, (2006) “A simple cooperative diversity method
based on network path selection,”IEEE Journal on Selected Areas on Communications, vol. 24, no.3,
pp. 659-672.
[9] Y. Zhao, R. Adve, and T. J. Lim, (2006) “Improving amplify-and-forward relay networks: optimal
power allocation versus selection”,IEEE International Symposium on Information Theory, pp. 1234-
1238.
[10] Y. Zhao, R. Adve and T. J. Lim, (2006) “Symbol error rate of selection amplify-and-forward relay
systems”,IEEE Communications Letters, vol. 10, no. 11, pp. 757-759.
[11] A. Bletsas, H. Shin, and M. Z. Win, (2007) “Cooperative communications with outage-optimal
opportunistic relaying”, IEEE Transactions on Wireless Communications, vol. 6, no. 9, pp. 1-11.
[12] B. Modi, A. Annamalai, O. Olabiyi and R. Palat, (2013) “Ergodic capacity analysis of cooperative
amplify-and-forward relay networks over generalized fading channels”,Wiley Journal of Wireless and
Mobile Computing, vol. 15, no. 8, pp.1259-1273
[13] T. Nechiporenko, K. Phan, C. Tellambura and H. Nguyen, (2009) “Capacity of Rayleigh fading
cooperative systems under adaptive transmission”, IEEE Trans. Wireless Comm., vol. 8, no.4, pp.
1626-1631.
17. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.3, May 2016
17
[14] A. Annamalai, R. Palat and J. Matyjas, (2010) “Estimating ergodic capacity of cooperative analog
relaying under different adaptive source transmission techniques”, IEEE Sarnoff Symposium, pp. 1-4.
[15] A. Annamalai, B. Modi, R. Palat and J. Matyjas, (2010)“Tight-bounds on the ergodic capacity of
cooperative analog relaying with adaptive source transmission techniques”,IEEE International
Symposium on Personal, Indoor, and Mobile Radio Comm., pp. 18-23.
[16] R. Palat, A. Annamalai and J. Reed, (2008) “An efficient method for evaluating information outage
probability and ergodic capacity of OSTBC systems”, IEEE Comm. Letters, vol. 12, no.3, pp. 191-
193.
[17] M. Di. Renzo, F. Graziosi, and F. Santucci, (2010) “Channel capacity over generalized fading
channels: A novel MGF-based approach for performance analysis and design of wireless
communication systems”, IEEE Trans. Vehicular Technology, vol. 59, no.1, pp. 127-149.
[18] B. Modi, O. Olabiyi, A. Annamalai and D. Vaman, (2011)“On ergodic capacity of cooperative non-
regenerative relay networks in Rice fading environments”, IEEE GLOBECOMWorkshop, pp. 348-
352
[19] B. Modi, O. Olabiyi, A. Annamalai and D. Vaman, (2011) “Improving the spectral efficiency of
adaptive modulation in amplify-and-forward cooperative relay networks with an adaptive ARQ
protocol”, IEEE Global Telecommunications Conference, pp. 1-5
[20] M. Hasna, (2005) “On the capacity of cooperative diversity systems with adaptive modulation”,
International Conference on Wireless and Optical Communication Networks, pp. 432-436.
[21] T. Nechiporenko, K. Phan, C. Tellambura and H. Nguyen, (2008) “Performance analysis of adaptive
M-QAM for Rayleigh fading cooperative systems”, IEEE International Conference on
Communications, pp. 3393–3399.
[22] T. Nechiporenko, P. Kalansuriya and C. Tellambura, (2009) “Performance of optimum switching
adaptive M-QAM for amplify-and-forward relays,” IEEE Trans. Vehic. Tech., vol. 58, no. 5, pp.
2258–2268.
[23] K. Hwang, Y. Ko and M. Alouini, (2008) “Performance analysis of opportunistic incremental relaying
with adaptive modulation over cooperative networks”, IEEE International Symp. Wireless Pervasive
Comput.,pp. 586–590.
[24] P. Kalansuriya and C. Tellambura, (2009) “Performance analysis of decode-and-forward relay
network under adaptive M-QAM”, IEEE International Conference on Communications, pp. 3393-
3399.
[25] B. Modi and A. Annamalai, (2011) “Improving the spectral efficiency of amplify-and-forward
cooperative relay network with adaptive M-QAM modulation”, 20th IEEE International Conference
on Computer Communications and Networks, pp. 1-6.
[26] B. Barua, N. Quoc and H. Shin, (2008) “On the SEP of cooperative diversity with opportunistic
relaying”, IEEE communication letters, vol. 12, no. 10, pp. 727-729.
[27] S. Ikki, and M. H. Ahmed, (2008) “Performance of multiple-relay cooperative diversity system with
best relay selection over Rayleigh fading channels”,EURASIP Journal on Advances on Signal
Processing, article ID 580368.
[28] S. I. Hussain, M.S. Alouini and M. O. Hasna, (2010) “Performance analysis of best relay selection
scheme for amplify-and-forward cooperative networks in identical Nakagami-m channels”,IEEE
Signal Processing Advances in Wireless Communications Conference, pp. 1-5.
[29] S. I. Hussain, M.O Hasna and M.S. Alouini, (2010)“Performance analysis of best relay selection
scheme for fixed gain cooperative networks in non-identical Nakagami-m channels”, IEEESignal
Processing Advances in Wireless Communications Conference, pp. 255-259.
[30] O. Waqar, D. C. McLernon and M. Ghogho (2009) “Performance analysis of non-regenerative
opportunistic relaying in nakagami-m fading”,IEEE International Symposium on Personal, Indoor,
and Mobile Radio Comm., pp. 231 – 235.
[31] S. Valentin, S. I. Hermann, H. Karl, L. Loyola and J. Widmer, (2008) “Opportunistic relaying vs.
selective cooperation: analyzing the occurance–conditioned outage capacity”,11th International
Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems, pp. 193-202.
[32] S. Ikki, and M. H. Ahmed, (2010) “Performance analysis of adaptive decode-and-forward cooperative
diversity networks with best relay selection”IEEE Transactions on Communications, vol. 58, no. 1,
pp. 68-72.
[33] S.Ikki, and M. H. Ahmed, (2010) “On the capacity of relay selection cooperative diversity networks
under adaptive transmission”,IEEE Vehicular Technology Conf., pp. 1–5.
18. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.3, May 2016
18
[34] M. Torabi, andD. Heccoun, (2010) “Capacity analysis of opportunistic relaying in cooperative
systems with outdated channel information”,IEEE Communication Letters, vol. 14,no.12, pp. 1-3.
[35] M. Torabi, J. F. Frigon and D. Haccoun, (2011) “On the performance analysis of AF opportunistic
relaying with adaptive transmission over Rayleigh fading channels”, IEEE pacific Rim conference on
communications, computers and signal processing, pp. 173-178.
[36] E. S. Altubaishi, and X. S. Shen, (2011) “Spectrally efficient variable-rate best-relay selection scheme
for adaptive cooperative system”, IEEE GLOBECOM Conference, pp. 1-5.
[37] M. Torabi, J.F. Frigon, and D. Haccoun, (2011) “Performance analysis of variable rate adaptive
modulation for AF opportunistic relaying under outdated CSI” IEEEInternational Symposium on
Personal, Indoor and Mobile Radio Communication, pp. 1753-1757
[38] K.S. Hwang, Y.C. Ko, and M.S. Alouini, (2009) “Performance analysis of incremental opportunistic
relaying over identically and non-identically distributed cooperative paths”, IEEE Transactions on
Wireless Communications, vol. 8, no. 4, pp. 1953-1960.
[39] H.Y. Lateef, D. C. McLermon and M. Ghogho, (2010) “Performance analysis of cooperative
communication with opportunistic relaying”, IEEE 11thInternational Workshop on Signal Processing
Advances in Wireless Communications, pp. 1-5
[40] O. Olabiyi and A. Annamalai, (2011) “ASER analysis of cooperative non-regenerative relay systems
over generalized fading channels”, IEEE International Conference on Computer Communication and
Networks, pp. 1-6.
[41] R. H. Y. Louie, Y. Li, and B. Vucetic, (2008) “Performance analysis of beamforming in two hop
amplify and forward relay networks”,IEEE International Conference on Communications, pp. 4311–
4315.
[42] D. Senarante and C. Tellambura, (2010)“Unified exact performance analysis of two-hop amplify-and-
forward relaying in Nakagami fading”, IEEE Trans. Veh. Tech., vol. 59, no.3, pp.1529-1534.
[43] M. Hasna and M.S. Alouini (2004) “Harmonic mean and end-to-end performance of transmission
system with relays”, IEEE Trans. Communications, vol. 52, no 1, pp. 130-135.
[44] Weifeng Su, K. S. Ahmed andK. J. Ray Liu, (2008) “Cooperative communication protocols in
wireless networks: performance analysis and optimum power allocation”, Springer link Wireless
Personal Communication, vol. 44, no. 2, pp.181-217.
[45] O. Olabiyi, A. Annamalai, O. Odejideand E. Adebola, (2012)“Integrated design of
APP/NET/PHY/MAC layers for cooperative relay networks. Under review for Publication,
International Journal of Wireless and Mobile Computing
[46] O. Olabiyi and A. Annamalai, (2012) “Efficient symbol error rate analysis of cooperative non-
regenerative relay systems over generalized fading channels”,International Journal of Wireless and
Mobile Networks, vol. 4, no.1, pp. 1-20
[47] A. Goldsmith and S. Chua, (1997) “Variable-rate variable-power M-QAM for fading channels”,
IEEE Trans. Commun., vol. 45, no. 10, pp. 1218–1230.
[48] M. Chiani, D. Dardari and M. K. Simon, (2003) “New exponential bounds and approximations for
the computation of error probability in fading channels”, IEEE Trans. On Wireless Commun., vol. 2,
no. 4, pp. 840–845.
[49] M. Di. Renzo, F. Graziosi and F. Santucci, (2009) “A unified framework for performance analysis of
CSI-assisted cooperative communications over fading channels”,IEEE Trans. Communications, vol.
57, pp. 2551-2557.
[50] A. Annamalai, G.Deora and C. Tellambura, (2005) “Theoretical diversity improvement in GSC (N,
L) receiver with non identical fading statistics”, IEEE Trans. Commun., vol. 53, no. 6, pp. 1027-
1035.
[51] B. Modi, A. Annamalai, O. Olabiyi and R. Chembil Palat, (2012) “Ergodic capacity analyses of
cooperative amplify and forward relay networks over Rice and Nakagami fading channels”,
International Journal of Wireless and Mobile Networks, vol. 4, no.1, pp. 97-116.
[52] I. S. Gradshteyn and I. M. Ryzhik, Table of Integrals, Series and Products, 5th ed., San Diego, CA:
Academic, 1994.
19. International Journal of Computer Networks & Communications (IJCNC) Vol.8, No.3, May 2016
19
AUTHORS
Dr. Bhuvan Modi received PhD. degree from Prairie View A & M University, Texas A
& M University System, in 2012. He earned his M.S. degree in Electrical Engineering
from Lamar University, United States of America, M.S. degree in Electronics and
Communication Engineering from Dharmsinh Desai University, India, and the B.S.
degree in Electronics and Communication Engineering from North Gujarat University,
India, in 2009, 2002 and 2001, respectively. He is currently working as a Senior
Member of Technical Staff at AT&T Mobility Lab, Seattle, WA. He received ‘Student Travel Grant
Award’ to present his work at the IEEE MILCOM’11. Over last few years, Mr. Modi has published over a
dozen peer reviewed conference and journal articles. His current research interests include cross-layer
design/optimization for adaptive-link cooperative relay networks, Software Define Networking and 4G
VoLTE.
Dr. Oluwatobi O. Olabiyi received the B.Sc. degree in Electronic and Electrical
Engineering from Obafemi Awolowo University, Ile-Ife and M.S. and PhD degree in
Electrical Engineering from Prairie View A&M University, Texas. Over the last few
years, he has co-authored approximately two-dozen peer-reviewed conference and
journal articles. He was the recipient of the Roy G. Perry College of Engineering
Outstanding Masters Student of the Year Award (2011) and the National Society of
Black Engineer’s Golden Torch Award for Graduate Student of Year (2012). His research interests include
dynamic spectrum access, MIMO, cooperative communications, statistical signal processing, compressive
sensing, machine-learning and optimization techniques.
Dr. Annamalai is presently the Director of Center of Excellence for Communication
Systems Technology Research, a Texas A&M Board of Regents approved University
Research Center at the Prairie View A&M University, and a tenured faculty member
in the Department of Electrical and Computer Engineering. He has over 20 years of
research/teaching experience in wireless communications at Motorola, University of
Victoria, Air Force Research Laboratory, Virginia Tech and PVAMU with
approximately 200 peer-reviewed publications and 5 book chapters. Dr. Annamalai
has been honored by his colleagues on numerous occasions for his excellence in research including
winning the 2011 Roy G. Perry College of Engineering Outstanding Faculty (Research) Award, IEEE
Leon Kirchmayer Prize Paper award, ASEE/AFOSR Summer Faculty Fellowships, NSERC Doctoral
Prize, CAGS/UMI Distinguished Doctoral Dissertation Award, IEEE VTS/Motorola Daniel E. Noble
Fellowship, among others. He had served on the Editorial Boards of four IEEE journals/transactions in the
last 15 years, and has helped to organize a few major IEEE conferences on wireless communications
including serving in the capacity of Technical Program Chair of the 2002 IEEE Vehicular Technology
Conference in Vancouver, Canada. His current research interests include cooperative spectrum sensing,
compressive sensing, cross-layer design for scalable multimedia transmission and cooperative wireless
communications.