This document proposes algorithms to maximize network lifetime in wireless sensor networks using cooperative MAC protocols. It formulates the problems of minimizing transmission power and maximizing network lifetime as cross-layer optimization problems considering routing, relay selection, and power allocation. Distributed algorithms are presented that solve these problems for both direct transmission and cooperative transmission modes. The algorithms select routes and relay nodes to minimize power consumption or equalize node lifetimes while meeting requirements for transmission success probability and rate.
Energy Consumption in Ad Hoc Network With Agents Minimizing the Number of Hop...CSCJournals
Wireless mobile ad-hoc network (MANET) is a special kind of network, where all of the nodes move in time. Node is intended to help relaying packets of neighboring nodes using multi-hop routing mechanism in order to solve problem of dead communication. MANET which engages broadcasting and contains multiple hops becomes increasingly vulnerable to problems such as mobile node’s energy degradation, routing problem and rapid increasing of overhead packets. This paper provides an extensive study of energy consumption in the MANET that consists of several network areas with the presence agents. Agents will minimize number of hops and its affect in linearity with the delay. As nodes grow, either in data transmission services or coverage of node’s communication or more agents stand in overlapped locations, accordingly data exchange and topology development to adapt the network are becoming an important issue. As a result, agents are needed to support process automation, high-level connectivity and intelligent service on that such environment. We evaluate the agents’ performance and network energy consumption for supporting MANET. The proposed agents provides service packets transmission between networks; e.g. determine appropriate relay nodes dynamically, maintain the transmission between networks through another nodes, share the topology knowledge among agents, and route packets between source and final destination that are unable to communicate directly. The achievement on research with this approach is conducted via simulation study. A similar network without agents is presented to derive such referential bounds by using appropriate functions of network agents. The proposed algorithm is confirmed with composite simulation results.
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
Mobile Ad Hoc Network (MANET) is a very dynamic and infrastructure-less ad hoc network. The actual
network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable. MANET is a resource limited network and therefore the developed routing
algorithm for packet transmission should be power and bandwidth efficient. These kinds of dynamic
networks should operate with minimal management overhead. The management functionality of the
network increases with number of nodes and reduces the performance of the network. Here, in this paper,
we have designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Graph theoretic routing algorithm is used to develop route for packet
transmission by using the minimum resources. In this paper, we developed routing algorithm for cluster
based MANET and finds a path from source to destination using minimum cumulative degree path. Our
simulation results show that this routing algorithm provide efficient routing path with the increasing
number of nodes and uses multi-hop connectivity for intra-cluster to utilize minimum power for packet
transmission irrespective of number of nodes in the network.
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
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
Modified q aware scheduling algorithm for improved fairness in 802.16 j networksIJCNCJournal
Deployment of Multi-hop Relays in WiMax based Cellu
lar Networks is considered as a cost effective
solution to increase the Coverage area of Base Stat
ion and also to improve the Network Capacity with h
igh
quality short links. Scheduling became a challengin
g task in these Multi-hop Relay Wireless Cellular
Networks of IEEE 802.16j standard. H. Chen, X. Xie
and H. Wu proposed a Q-aware Scheduling
Algorithm in which back-pressure flow control mecha
nism is used to reflect current Q size of the Relay
s
and considered high back-pressure links to include
in Concurrent Transmission Scenarios, to maximize t
he
throughput. This focus on high back-pressure links,
leads to starvation of Mobile Stations having low
back-
pressure links, resulting unfairness in some cases.
To remedy this situation, a Fair Link Inclusion (F
LI)
mechanism is applied in Greedy Algorithm of Q-aware
Scheduling Algorithm. Simulation results show that
Modified Q-aware Scheduling Algorithm with FLI mech
anism has reasonable improvement in fairness and
maintaining steady throughput when compared with ex
isting algorithms.
Energy Consumption in Ad Hoc Network With Agents Minimizing the Number of Hop...CSCJournals
Wireless mobile ad-hoc network (MANET) is a special kind of network, where all of the nodes move in time. Node is intended to help relaying packets of neighboring nodes using multi-hop routing mechanism in order to solve problem of dead communication. MANET which engages broadcasting and contains multiple hops becomes increasingly vulnerable to problems such as mobile node’s energy degradation, routing problem and rapid increasing of overhead packets. This paper provides an extensive study of energy consumption in the MANET that consists of several network areas with the presence agents. Agents will minimize number of hops and its affect in linearity with the delay. As nodes grow, either in data transmission services or coverage of node’s communication or more agents stand in overlapped locations, accordingly data exchange and topology development to adapt the network are becoming an important issue. As a result, agents are needed to support process automation, high-level connectivity and intelligent service on that such environment. We evaluate the agents’ performance and network energy consumption for supporting MANET. The proposed agents provides service packets transmission between networks; e.g. determine appropriate relay nodes dynamically, maintain the transmission between networks through another nodes, share the topology knowledge among agents, and route packets between source and final destination that are unable to communicate directly. The achievement on research with this approach is conducted via simulation study. A similar network without agents is presented to derive such referential bounds by using appropriate functions of network agents. The proposed algorithm is confirmed with composite simulation results.
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
Mobile Ad Hoc Network (MANET) is a very dynamic and infrastructure-less ad hoc network. The actual
network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable. MANET is a resource limited network and therefore the developed routing
algorithm for packet transmission should be power and bandwidth efficient. These kinds of dynamic
networks should operate with minimal management overhead. The management functionality of the
network increases with number of nodes and reduces the performance of the network. Here, in this paper,
we have designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Graph theoretic routing algorithm is used to develop route for packet
transmission by using the minimum resources. In this paper, we developed routing algorithm for cluster
based MANET and finds a path from source to destination using minimum cumulative degree path. Our
simulation results show that this routing algorithm provide efficient routing path with the increasing
number of nodes and uses multi-hop connectivity for intra-cluster to utilize minimum power for packet
transmission irrespective of number of nodes in the network.
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
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
Modified q aware scheduling algorithm for improved fairness in 802.16 j networksIJCNCJournal
Deployment of Multi-hop Relays in WiMax based Cellu
lar Networks is considered as a cost effective
solution to increase the Coverage area of Base Stat
ion and also to improve the Network Capacity with h
igh
quality short links. Scheduling became a challengin
g task in these Multi-hop Relay Wireless Cellular
Networks of IEEE 802.16j standard. H. Chen, X. Xie
and H. Wu proposed a Q-aware Scheduling
Algorithm in which back-pressure flow control mecha
nism is used to reflect current Q size of the Relay
s
and considered high back-pressure links to include
in Concurrent Transmission Scenarios, to maximize t
he
throughput. This focus on high back-pressure links,
leads to starvation of Mobile Stations having low
back-
pressure links, resulting unfairness in some cases.
To remedy this situation, a Fair Link Inclusion (F
LI)
mechanism is applied in Greedy Algorithm of Q-aware
Scheduling Algorithm. Simulation results show that
Modified Q-aware Scheduling Algorithm with FLI mech
anism has reasonable improvement in fairness and
maintaining steady throughput when compared with ex
isting algorithms.
PERFORMANCE IMPROVEMENT OF NONREGENERATIVE COOPERATIVE RELAY NETWORKS WITH OP...ijwmn
This paper analyzes the performance of Channel Side Information (CSI)-assisted cooperative amplify-andforward
(CAF) relay networks that employ both the node placement (i.e., relay position) based optimal
power allocation policy among collaborating nodes and adaptive M-ary quadrature amplitude modulation
(M-QAM)/ M-ary phase shift keying (M-PSK) techniques in generalized wireless fading environments. In
particular, we advocate a simple yet unified numerical approach based on the marginal moment generating
function (MGF) of the total received Signal to Noise Ratio (SNR) to derive analytical expressions for the
average bit error rate (ABER), mean achievable spectral efficiency, and outage probability performance
metrics. The proposed analytical framework is sufficiently general and flexible to characterize the
performance of adaptive-link CAF relay networks over a wide range of fading distributions (i.e., not
restricted to Rayleigh fading or independent identically distributed (i.i.d) Nakagami-m fading ) with
independent but non-identically distributed (i.n.d) fading statistics across the spatially distributed diversity
paths. Additionally, we further simplify the computational complexity, by employing the use of an
“approximate MGF expression” to compute the system performance metrics over the generalized fading
channel. Employing the above novel approach based on “approximate MGF” in conjunction derived
analytical frameworks allows us to simplify the computation complexity of achievable spectral efficiency as
well as ABER of CAF relay system in the generalized fading environments by simply replacing appropriate
single channel MGF which is readily available
Q-LEARNING BASED ROUTING PROTOCOL TO ENHANCE NETWORK LIFETIME IN WSNSIJCNCJournal
In resource constraint Wireless Sensor Networks (WSNs), enhancement of network lifetime has been one of the significantly challenging issues for the researchers. Researchers have been exploiting machine learning techniques, in particular reinforcement learning, to achieve efficient solutions in the domain of WSN. The objective of this paper is to apply Q-learning, a reinforcement learning technique, to enhance the lifetime of the network, by developing distributed routing protocols. Q-learning is an attractive choice for routing due to its low computational requirements and additional memory demands. To facilitate an agent running at each node to take an optimal action, the approach considers node’s residual energy, hop length to sink and transmission power. The parameters, residual energy and hop length, are used to calculate the Q-value, which in turn is used to decide the optimal next-hop for routing. The proposed protocols’ performance is evaluated through NS3 simulations, and compared with AODV protocol in terms of network lifetime, throughput and end-to-end delay.
Efficient energy, cost reduction, and QoS based routing protocol for wireless...IJECEIAES
Recent developments and widespread in wireless sensor network have led to many routing protocols, many of these protocols consider the efficiency of energy as the ultimate factor to maximize the WSN lifetime. The quality of Service (QoS) requirements for different applications of wireless sensor networks has posed additional challenges. Imaging and data transmission needs both QoS aware routing and energy to ensure the efficient use of sensors. In this paper, we propose an Efficient, Energy-Aware, Least Cost, (ECQSR) quality of service routing protocol for sensor networks which can run efficiently with best-effort traffic processing. The protocol aims to maximize the lifetime of the network out of balancing energy consumption across multiple nodes, by using the concept of service differentiation, finding lower cost by finding the shortest path using nearest neighbor algorithm (NN), also put certain constraints on the delay of the path for real-time data from where link cost that captures energy nodes reserve, energy of the transmission, error rate and other parameters. The results show that the proposed protocol improves the network lifetime and low power consumption.
Downlink beamforming and admissin control for spectrum sharing cognitive radi...acijjournal
n this paper, to detect the moving objects between frames in compressed video and to obtain the bes
t
compression video
and the noiseless video. We describe a video in which frames by classifying
macroblocks (MB), and describe motion estimation (ME), motion vector field (MV) and motion
compensation (MC). we propose to classify Macroblocks of each video frame into different
classes and use
this class information to describe the frame content based on the motion vector. MB class informatio
n
video applications such as shot change detection, motion discontinuity detection, Outlier rejection
for
global motion estimation. To reduc
e the noise and to improve the clarity of the compressed video by using
contrast limited adaptive histogram equalization (CLAHE) Algorithm
MESSAGE ROUTING IN WIRELESS AND MOBILE NETWORKS USING TDMA TECHNOLOGYijwmn
In an era where communication has a most important role in modern societies, designing efficient
algorithms for data transmission is of the outmost importance. TDMA is a technology used in many
communication systems such as satellite, cell phone as well as other wireless or mobile networks. Most 2G
cellular systems as well as some 3G are TDMA based. In order to transmit data in such systems we need
to cluster them in packages. To achieve a faster transmission we are allowed to preempt the transmission of
any packet in order to resume at a later time. Preemption can be used to reduce idleness of some stations.
Such preemptions though come with a reconfiguration cost in order to setup for the next transmission. In
this paper we propose two algorithms which yield improved transmission scheduling. These two algorithms
we call MGA and IMGA (Improved MGA). We have proven an approximation ratio for MGA and ran
experiments to establish that it works even better in practice. In order to conclude that MGA will be a very
helpful tool in constructing an improved schedule for packet routing using preemtion with a setup cost, we
compare its results to two other efficient algorithms designed by researchers in the past: A-PBS(d+1) and
GWA. To establish the efficiency of IMGA we ran experiments in comparison to MGA as well as APBS(d+1)
and GWA. IMGA has proven to produce the most efficient schedule on all counts.
Improved Good put using Harvest-Then-Transmit Protocol for Video TransferEswar Publications
In multiple wireless networks, large end-to-end delay and packet losses can decrease meaningfully the traffic flow goodput due to path irregularity and multiplicity. To report these problems, current methods are proposed by using management of queue and decision making process. Hence, this paper proposesa Harvest-Then-Transmit (HTT) Protocol which selects an energy efficient path based on multiple parameters i.e. energy, delay, transmission time and perform transmission of video to handle number of video packets. A multipath environment is establishing where a server performs transferring of video along the energy efficient path of wireless network. Simulation shows the proposed protocol improves the overall goodput up to 10%, increases packet delivery rate up to 12%, and reduces end-to-end delay up to 3%, compared to existing system.
EFFICIENT PACKET DELIVERY APPROACH FOR ADHOC WIRELESS NETWORKS cscpconf
A wireless ad-hoc network is a collection of nodes which are selfconfiguring,
connected by wireless links. The nodes are free to move randomly and
organize themselves arbitrarily; thus, the network's topology may change rapidly and
unpredictably. These kinds of networks are very flexible and they do not require any
existing infrastructure. Therefore, ad-hoc wireless networks are suitable for temporary
communication links. The biggest challenge in these kinds of networks is to find a path
between the communication end points of nodes that are mobile. Due to the limited
transmission range of wireless interfaces, the communication traffic has to be relayed
over several intermediate nodes to enable the communication between two nodes.
Therefore, these kinds of networks are also called multi-hop ad-hoc networks. The
proposed model is designed to improve the problems of real-time event-based
communication. It improves the packet delivery ratio by prior prediction and reduces
end-to-end packet delay. This in turn improves performance of the routing process
significantly and increases the Quality of Service (QoS).
A NOVEL HYBRID OPPORTUNISTIC SCALABLE ENERGY EFFICIENT ROUTING DESIGN FOR LOW...IJCNCJournal
Opportunistic Routing (OR) scheme increases the transmission reliability despite the lossy wireless radio links by exploiting the broadcast nature of the wireless medium. However, OR schemes in low power Wireless Sensor Network (WSN) leads to energy drain in constrained sensor nodes due to constant
overhearing, periodic beaconing for Neighbourhood Management (NM) and increase in packet header length to append priority wise sorted Forwarding Candidates Set (FCS) prior to data transmission. The timer-based coordination mechanism incurs the least overhead to coordinate among the FCS that has successfully received the data packet for relaying the data in a multi-hop manner. This timer-based mechanism suffers from duplicate transmissions if the FCS is either not carefully selected or coordinated. The focus of this work is to propose a hybrid opportunistic energy efficient routing design for large scale, low power and lossy WSN. This design avoids periodic 'hello' beacons for NM, limits constant overhearing and increase in packet header length. There are two modes of operation i) opportunistic ii) unicast mode. The sender node adopts opportunistic forwarding for its initial data packet transmission and instead of pre-computing the FCS, it is dynamically computed in a completely distributed manner. The
eligible nodes to be part of FCS will be neighbour nodes at lower corona level than the sender with respect to the sink and remaining energy above the minimum threshold. The nodes part of FCS based on crosslayered multi-metrics and fuzzy decision logic determines its priority level to compute Dynamic Holding
Delay (DHD) for effective timer coordination. The differentiated back off implementation along with DHD enables the higher priority candidate that had received data packet to forward the packet first and facilitates others to cancel its timer upon overhearing. The sender node switches to unicast mode of
forwarding for successive transmissions by choosing the forwarding node with maximum trust value as it
denotes the stability of the temporally varying link with respect to the forwarder. The sender node will revert to opportunistic mode to increase transmission reliability in case of link-level transmission error or no trustworthy forwarders. Simulation results in NS2 show significant increase in Packet Delivery Ratio (PDR),decrease in both average energy consumption per node and Normalized Energy Consumption (NEC) per packet in comparison with existing protocols.
Performance Evaluation of Gauss-Markov Mobility Model in Hybrid LTE-VANET Net...TELKOMNIKA JOURNAL
Vehicular Ad-hoc Network (VANET) is developed based on mobile ad-hoc networks (MANET).
VANET has different characteristics than MANET. On VANET, a mobile node (MN) moves faster, topology
changes dynamically. The previous research shows that the model of mobility affects to the network
performance. In this paper, a Gauss-Markov mobility model is used to illustrate the motion of the MN. This
paper enriches the evaluation of the performance of Gauss-Markov mobility model on LTE-VANET hybrid
network, by evaluating various network performance metrics, i.e. packet delivery ratio (PDR), throughput,
and delay. This research simulates the Gauss-Markov mobility model with various numbers of nodes and
randomness index (α), using Network Simulator-3 (NS-3). The result shows that strong correlation among
PDR, throughput, and delay with the addition number of MNs. Based on the simulation result, the hybrid
LTE-VANET have smaller 40% average delay than the existing VANET. This simulation also concludes
that different value of alpha on Gauss-Markov mobility model does not influence PDR, throughput, and
delay.
QoS controlled capacity offload optimization in heterogeneous networksjournalBEEI
An efficient resource allocation mechanism in the physical layer of wireless networks ensures that resources such as bandwidth and power are used with high efficiency in spite of low delay and high edge user data rate. Microcells in the network are typically set with bias settings to artificially increase the Signal-to-Interference-Plus-Noise Ratio, thus encouraging users to offload to the microcell. However, the artificial bias settings are tedious and often suboptimal. This work presents a low complexity algorithm for maximization of network capacity with load balancing in a heterogeneous network without the need for bias setting. The small cells were deployed in a grid topology at a selected distance from macrocell to enhance network capacity through coverage overlap. User association and minimum user throughput were incorporated as constraints to enable closer simulation to real word Quality of Service requirements. The results showed that the proposed algorithm was able to maintain less than 10% user drop rate. The proposed algorithm can increase user confidence as well as maintain load balancing, maintain the scalability, and reduce power consumption of the wireless network.
EFFICIENT MULTI-PATH PROTOCOL FOR WIRELESS SENSOR NETWORKSijwmn
Wireless sensor networks are useful for streaming multimedia in infrastructure-free and hazardous environments. However, these networks are quite different from their wired counterpart and are composed of nodes with constrained bandwidth and energy. Multiple-path transmission is one of the methods for ensuring QoS routing in both wired and wireless environment. Directed diffusion, a well known wireless sensor network protocol, only routes packets through a single path, which barely meets the throughput requirement of multimedia data. Instead, we propose a multipath algorithm based on directed diffusion that reinforces multiple routes with high link quality and low latency. This algorithm retains the merits of the original directed diffusion algorithms, including its energy efficiency and scalability. A hybrid metric of link quality and latency is used as the criterion for path selection. In order to select disjoint paths, we propose a scheme for reinforced nodes to respond negatively to multiple reinforcement messages. We use the NS-2 simulation tool with video trace generated by Multiple Description Coding (MDC) to evaluate the performance. The results show that our algorithm gives better throughput and delay performance, i.e higher video quality, than standard directed diffusion that transmits over a single path, with low overheads and energy consumption.
Performance Analysis of Enhanced Opportunistic Minimum Cost Routingin Mobile ...IJERA Editor
Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network with
infrastructure less environment to establish a data transmission between nodes within the network. A routing
protocol is used to discover routes between nodes. In this paper, we study the three existing routing protocols
namely AODV, DSDV and DSR to analyze theirperformance based on set of parameters.AODV and DSR
deliver almost all the packets compared to DSDV. Hence we try to modify the AODVprotocol and use in the
cooperative transmission.
In this paper, we study the cooperative transmission at the network layer and cooperative diversity at the
physical layer as a joint optimization of the transmission power in a Mobile Ad-Hoc Network (MANET) with
static channel. However due to variable wireless channels static routing is suboptimal. Proposed protocol
proactively selects forwarding nodes that work cooperatively forwarding the packet towards the destination.
Cooperative transmission side diversity helps in reducing interference. Diversity can be achieved at the physical
layer by coordinating the multiple nodes. Nodes are equipped with Omni-directional antenna and take the
advantages of transmission side diversity to achieve energy saving, under the assumption that channel gains are
available at the transmitters.
The proposed Opportunistic Minimum Cost Cooperative Transmission Shortest Path (OMCTSP) algorithms
select the best optimum route with minimum cost in terms of energy, number of hops, available bandwidth, link
quality (SNR) and outage probability. As the network becomes larger, finding optimal routes becomes
computationally intractable as the complexity of the dynamic programming (DP) approach increases as o (22n)
where n is the number of nodes in the networks. Hence we develop two suboptimal algorithms have complexity
of o (n2) perform as same as optimal algorithm. Also developthe Opportunistic Cooperative Routing in MANET
(O_CORMAN), which is a network layer opportunistic routing scheme for mobile ad hoc networks. Nodes in
the network use the components proactive routing protocol, forwarder list update and local re-transmission. We
evaluate the performance using NS 2.32 simulator there is significant performance improvement with respect to
energy, throughput packet delivery, and delay compared with Modified AODV (OMCTSP).
Computer network is becoming more popular and common, the need to use the broadband connection services (e-learning - online training, video conferencing - online conference, IPTV - digital TV ...) of organizations and individuals is increasing. Multicast is an effective mechanism for the transmission of information and data to many recipients simultaneously. Multicast is a routing problem from a source node to a receiver node set, also known as the routing from one point to multipoint. The advances in technology and multimedia applications emerge quickly has provided great motivation for the application of new real-time multi-point. Many multi-point applications will not function properly if the QoS (quality of service) can not be guaranteed. Therefore, multi-point algorithms must be able to meet the QoS constraints (cost, reliability, bandwidth, jitter, delay...). The objective of multicast routing algorithms guarantee QoS is to provide routing algorithms have the ability to recognize the tree to satisfy the maximum of traffic streams with QoS requirements. Most multicast algorithms on MPLS (MultiProtocol Label Switching) considered the unique QoS constraint as bandwidth. The other QoS constraints can be converted into bandwidth efficiency. Starting from this reality, this paper research multicast routing algorithms guarantee bandwidth and propose new algorithm compares with existing ones.
PERFORMANCE IMPROVEMENT OF NONREGENERATIVE COOPERATIVE RELAY NETWORKS WITH OP...ijwmn
This paper analyzes the performance of Channel Side Information (CSI)-assisted cooperative amplify-andforward
(CAF) relay networks that employ both the node placement (i.e., relay position) based optimal
power allocation policy among collaborating nodes and adaptive M-ary quadrature amplitude modulation
(M-QAM)/ M-ary phase shift keying (M-PSK) techniques in generalized wireless fading environments. In
particular, we advocate a simple yet unified numerical approach based on the marginal moment generating
function (MGF) of the total received Signal to Noise Ratio (SNR) to derive analytical expressions for the
average bit error rate (ABER), mean achievable spectral efficiency, and outage probability performance
metrics. The proposed analytical framework is sufficiently general and flexible to characterize the
performance of adaptive-link CAF relay networks over a wide range of fading distributions (i.e., not
restricted to Rayleigh fading or independent identically distributed (i.i.d) Nakagami-m fading ) with
independent but non-identically distributed (i.n.d) fading statistics across the spatially distributed diversity
paths. Additionally, we further simplify the computational complexity, by employing the use of an
“approximate MGF expression” to compute the system performance metrics over the generalized fading
channel. Employing the above novel approach based on “approximate MGF” in conjunction derived
analytical frameworks allows us to simplify the computation complexity of achievable spectral efficiency as
well as ABER of CAF relay system in the generalized fading environments by simply replacing appropriate
single channel MGF which is readily available
Q-LEARNING BASED ROUTING PROTOCOL TO ENHANCE NETWORK LIFETIME IN WSNSIJCNCJournal
In resource constraint Wireless Sensor Networks (WSNs), enhancement of network lifetime has been one of the significantly challenging issues for the researchers. Researchers have been exploiting machine learning techniques, in particular reinforcement learning, to achieve efficient solutions in the domain of WSN. The objective of this paper is to apply Q-learning, a reinforcement learning technique, to enhance the lifetime of the network, by developing distributed routing protocols. Q-learning is an attractive choice for routing due to its low computational requirements and additional memory demands. To facilitate an agent running at each node to take an optimal action, the approach considers node’s residual energy, hop length to sink and transmission power. The parameters, residual energy and hop length, are used to calculate the Q-value, which in turn is used to decide the optimal next-hop for routing. The proposed protocols’ performance is evaluated through NS3 simulations, and compared with AODV protocol in terms of network lifetime, throughput and end-to-end delay.
Efficient energy, cost reduction, and QoS based routing protocol for wireless...IJECEIAES
Recent developments and widespread in wireless sensor network have led to many routing protocols, many of these protocols consider the efficiency of energy as the ultimate factor to maximize the WSN lifetime. The quality of Service (QoS) requirements for different applications of wireless sensor networks has posed additional challenges. Imaging and data transmission needs both QoS aware routing and energy to ensure the efficient use of sensors. In this paper, we propose an Efficient, Energy-Aware, Least Cost, (ECQSR) quality of service routing protocol for sensor networks which can run efficiently with best-effort traffic processing. The protocol aims to maximize the lifetime of the network out of balancing energy consumption across multiple nodes, by using the concept of service differentiation, finding lower cost by finding the shortest path using nearest neighbor algorithm (NN), also put certain constraints on the delay of the path for real-time data from where link cost that captures energy nodes reserve, energy of the transmission, error rate and other parameters. The results show that the proposed protocol improves the network lifetime and low power consumption.
Downlink beamforming and admissin control for spectrum sharing cognitive radi...acijjournal
n this paper, to detect the moving objects between frames in compressed video and to obtain the bes
t
compression video
and the noiseless video. We describe a video in which frames by classifying
macroblocks (MB), and describe motion estimation (ME), motion vector field (MV) and motion
compensation (MC). we propose to classify Macroblocks of each video frame into different
classes and use
this class information to describe the frame content based on the motion vector. MB class informatio
n
video applications such as shot change detection, motion discontinuity detection, Outlier rejection
for
global motion estimation. To reduc
e the noise and to improve the clarity of the compressed video by using
contrast limited adaptive histogram equalization (CLAHE) Algorithm
MESSAGE ROUTING IN WIRELESS AND MOBILE NETWORKS USING TDMA TECHNOLOGYijwmn
In an era where communication has a most important role in modern societies, designing efficient
algorithms for data transmission is of the outmost importance. TDMA is a technology used in many
communication systems such as satellite, cell phone as well as other wireless or mobile networks. Most 2G
cellular systems as well as some 3G are TDMA based. In order to transmit data in such systems we need
to cluster them in packages. To achieve a faster transmission we are allowed to preempt the transmission of
any packet in order to resume at a later time. Preemption can be used to reduce idleness of some stations.
Such preemptions though come with a reconfiguration cost in order to setup for the next transmission. In
this paper we propose two algorithms which yield improved transmission scheduling. These two algorithms
we call MGA and IMGA (Improved MGA). We have proven an approximation ratio for MGA and ran
experiments to establish that it works even better in practice. In order to conclude that MGA will be a very
helpful tool in constructing an improved schedule for packet routing using preemtion with a setup cost, we
compare its results to two other efficient algorithms designed by researchers in the past: A-PBS(d+1) and
GWA. To establish the efficiency of IMGA we ran experiments in comparison to MGA as well as APBS(d+1)
and GWA. IMGA has proven to produce the most efficient schedule on all counts.
Improved Good put using Harvest-Then-Transmit Protocol for Video TransferEswar Publications
In multiple wireless networks, large end-to-end delay and packet losses can decrease meaningfully the traffic flow goodput due to path irregularity and multiplicity. To report these problems, current methods are proposed by using management of queue and decision making process. Hence, this paper proposesa Harvest-Then-Transmit (HTT) Protocol which selects an energy efficient path based on multiple parameters i.e. energy, delay, transmission time and perform transmission of video to handle number of video packets. A multipath environment is establishing where a server performs transferring of video along the energy efficient path of wireless network. Simulation shows the proposed protocol improves the overall goodput up to 10%, increases packet delivery rate up to 12%, and reduces end-to-end delay up to 3%, compared to existing system.
EFFICIENT PACKET DELIVERY APPROACH FOR ADHOC WIRELESS NETWORKS cscpconf
A wireless ad-hoc network is a collection of nodes which are selfconfiguring,
connected by wireless links. The nodes are free to move randomly and
organize themselves arbitrarily; thus, the network's topology may change rapidly and
unpredictably. These kinds of networks are very flexible and they do not require any
existing infrastructure. Therefore, ad-hoc wireless networks are suitable for temporary
communication links. The biggest challenge in these kinds of networks is to find a path
between the communication end points of nodes that are mobile. Due to the limited
transmission range of wireless interfaces, the communication traffic has to be relayed
over several intermediate nodes to enable the communication between two nodes.
Therefore, these kinds of networks are also called multi-hop ad-hoc networks. The
proposed model is designed to improve the problems of real-time event-based
communication. It improves the packet delivery ratio by prior prediction and reduces
end-to-end packet delay. This in turn improves performance of the routing process
significantly and increases the Quality of Service (QoS).
A NOVEL HYBRID OPPORTUNISTIC SCALABLE ENERGY EFFICIENT ROUTING DESIGN FOR LOW...IJCNCJournal
Opportunistic Routing (OR) scheme increases the transmission reliability despite the lossy wireless radio links by exploiting the broadcast nature of the wireless medium. However, OR schemes in low power Wireless Sensor Network (WSN) leads to energy drain in constrained sensor nodes due to constant
overhearing, periodic beaconing for Neighbourhood Management (NM) and increase in packet header length to append priority wise sorted Forwarding Candidates Set (FCS) prior to data transmission. The timer-based coordination mechanism incurs the least overhead to coordinate among the FCS that has successfully received the data packet for relaying the data in a multi-hop manner. This timer-based mechanism suffers from duplicate transmissions if the FCS is either not carefully selected or coordinated. The focus of this work is to propose a hybrid opportunistic energy efficient routing design for large scale, low power and lossy WSN. This design avoids periodic 'hello' beacons for NM, limits constant overhearing and increase in packet header length. There are two modes of operation i) opportunistic ii) unicast mode. The sender node adopts opportunistic forwarding for its initial data packet transmission and instead of pre-computing the FCS, it is dynamically computed in a completely distributed manner. The
eligible nodes to be part of FCS will be neighbour nodes at lower corona level than the sender with respect to the sink and remaining energy above the minimum threshold. The nodes part of FCS based on crosslayered multi-metrics and fuzzy decision logic determines its priority level to compute Dynamic Holding
Delay (DHD) for effective timer coordination. The differentiated back off implementation along with DHD enables the higher priority candidate that had received data packet to forward the packet first and facilitates others to cancel its timer upon overhearing. The sender node switches to unicast mode of
forwarding for successive transmissions by choosing the forwarding node with maximum trust value as it
denotes the stability of the temporally varying link with respect to the forwarder. The sender node will revert to opportunistic mode to increase transmission reliability in case of link-level transmission error or no trustworthy forwarders. Simulation results in NS2 show significant increase in Packet Delivery Ratio (PDR),decrease in both average energy consumption per node and Normalized Energy Consumption (NEC) per packet in comparison with existing protocols.
Performance Evaluation of Gauss-Markov Mobility Model in Hybrid LTE-VANET Net...TELKOMNIKA JOURNAL
Vehicular Ad-hoc Network (VANET) is developed based on mobile ad-hoc networks (MANET).
VANET has different characteristics than MANET. On VANET, a mobile node (MN) moves faster, topology
changes dynamically. The previous research shows that the model of mobility affects to the network
performance. In this paper, a Gauss-Markov mobility model is used to illustrate the motion of the MN. This
paper enriches the evaluation of the performance of Gauss-Markov mobility model on LTE-VANET hybrid
network, by evaluating various network performance metrics, i.e. packet delivery ratio (PDR), throughput,
and delay. This research simulates the Gauss-Markov mobility model with various numbers of nodes and
randomness index (α), using Network Simulator-3 (NS-3). The result shows that strong correlation among
PDR, throughput, and delay with the addition number of MNs. Based on the simulation result, the hybrid
LTE-VANET have smaller 40% average delay than the existing VANET. This simulation also concludes
that different value of alpha on Gauss-Markov mobility model does not influence PDR, throughput, and
delay.
QoS controlled capacity offload optimization in heterogeneous networksjournalBEEI
An efficient resource allocation mechanism in the physical layer of wireless networks ensures that resources such as bandwidth and power are used with high efficiency in spite of low delay and high edge user data rate. Microcells in the network are typically set with bias settings to artificially increase the Signal-to-Interference-Plus-Noise Ratio, thus encouraging users to offload to the microcell. However, the artificial bias settings are tedious and often suboptimal. This work presents a low complexity algorithm for maximization of network capacity with load balancing in a heterogeneous network without the need for bias setting. The small cells were deployed in a grid topology at a selected distance from macrocell to enhance network capacity through coverage overlap. User association and minimum user throughput were incorporated as constraints to enable closer simulation to real word Quality of Service requirements. The results showed that the proposed algorithm was able to maintain less than 10% user drop rate. The proposed algorithm can increase user confidence as well as maintain load balancing, maintain the scalability, and reduce power consumption of the wireless network.
EFFICIENT MULTI-PATH PROTOCOL FOR WIRELESS SENSOR NETWORKSijwmn
Wireless sensor networks are useful for streaming multimedia in infrastructure-free and hazardous environments. However, these networks are quite different from their wired counterpart and are composed of nodes with constrained bandwidth and energy. Multiple-path transmission is one of the methods for ensuring QoS routing in both wired and wireless environment. Directed diffusion, a well known wireless sensor network protocol, only routes packets through a single path, which barely meets the throughput requirement of multimedia data. Instead, we propose a multipath algorithm based on directed diffusion that reinforces multiple routes with high link quality and low latency. This algorithm retains the merits of the original directed diffusion algorithms, including its energy efficiency and scalability. A hybrid metric of link quality and latency is used as the criterion for path selection. In order to select disjoint paths, we propose a scheme for reinforced nodes to respond negatively to multiple reinforcement messages. We use the NS-2 simulation tool with video trace generated by Multiple Description Coding (MDC) to evaluate the performance. The results show that our algorithm gives better throughput and delay performance, i.e higher video quality, than standard directed diffusion that transmits over a single path, with low overheads and energy consumption.
Performance Analysis of Enhanced Opportunistic Minimum Cost Routingin Mobile ...IJERA Editor
Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network with
infrastructure less environment to establish a data transmission between nodes within the network. A routing
protocol is used to discover routes between nodes. In this paper, we study the three existing routing protocols
namely AODV, DSDV and DSR to analyze theirperformance based on set of parameters.AODV and DSR
deliver almost all the packets compared to DSDV. Hence we try to modify the AODVprotocol and use in the
cooperative transmission.
In this paper, we study the cooperative transmission at the network layer and cooperative diversity at the
physical layer as a joint optimization of the transmission power in a Mobile Ad-Hoc Network (MANET) with
static channel. However due to variable wireless channels static routing is suboptimal. Proposed protocol
proactively selects forwarding nodes that work cooperatively forwarding the packet towards the destination.
Cooperative transmission side diversity helps in reducing interference. Diversity can be achieved at the physical
layer by coordinating the multiple nodes. Nodes are equipped with Omni-directional antenna and take the
advantages of transmission side diversity to achieve energy saving, under the assumption that channel gains are
available at the transmitters.
The proposed Opportunistic Minimum Cost Cooperative Transmission Shortest Path (OMCTSP) algorithms
select the best optimum route with minimum cost in terms of energy, number of hops, available bandwidth, link
quality (SNR) and outage probability. As the network becomes larger, finding optimal routes becomes
computationally intractable as the complexity of the dynamic programming (DP) approach increases as o (22n)
where n is the number of nodes in the networks. Hence we develop two suboptimal algorithms have complexity
of o (n2) perform as same as optimal algorithm. Also developthe Opportunistic Cooperative Routing in MANET
(O_CORMAN), which is a network layer opportunistic routing scheme for mobile ad hoc networks. Nodes in
the network use the components proactive routing protocol, forwarder list update and local re-transmission. We
evaluate the performance using NS 2.32 simulator there is significant performance improvement with respect to
energy, throughput packet delivery, and delay compared with Modified AODV (OMCTSP).
Computer network is becoming more popular and common, the need to use the broadband connection services (e-learning - online training, video conferencing - online conference, IPTV - digital TV ...) of organizations and individuals is increasing. Multicast is an effective mechanism for the transmission of information and data to many recipients simultaneously. Multicast is a routing problem from a source node to a receiver node set, also known as the routing from one point to multipoint. The advances in technology and multimedia applications emerge quickly has provided great motivation for the application of new real-time multi-point. Many multi-point applications will not function properly if the QoS (quality of service) can not be guaranteed. Therefore, multi-point algorithms must be able to meet the QoS constraints (cost, reliability, bandwidth, jitter, delay...). The objective of multicast routing algorithms guarantee QoS is to provide routing algorithms have the ability to recognize the tree to satisfy the maximum of traffic streams with QoS requirements. Most multicast algorithms on MPLS (MultiProtocol Label Switching) considered the unique QoS constraint as bandwidth. The other QoS constraints can be converted into bandwidth efficiency. Starting from this reality, this paper research multicast routing algorithms guarantee bandwidth and propose new algorithm compares with existing ones.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
JCWAEED: JOINT CHANNEL ASSIGNMENT AND WEIGHTED AVERAGE EXPECTED END-TO-END DE...csandit
In recent years, multi-channel multi-radio Wireless Mesh network has become one of the most important technologies in the evolution of next-generation networks. Its multi-hop, selforganization,self-healing and simple deployment is an effective way to solve the bottleneck problem of last mile. In this paper, we propose a new routing metric called WAEED, deployed in JCWAEED protocol, a joint channel assignment and weighted average expected end-to-end delay routing protocol which considers both interference suppression with factor IF and end-toend delay. Additionally, we give the exact calculation formula of transmission delay and queuing delay. Simulations results demonstrate that JCWAEED outperforms other joint design routing protocols in terms of throughput, end-to-end delay and packet loss rate.
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/
Energy Behavior in Ad Hoc Network Minimizing the Number of Hops and Maintaini...CSCJournals
Wireless ad-hoc mesh network is a special kind of network, where all of the nodes move in time. The topology of the network changes as the nodes are in the proximity of each other. Ad-hoc networks are generally self-configuring no stable infrastructure takes a place. In this network, each node should help relaying packets of neighboring nodes using multi-hop routing mechanism. This mechanism is needed to reach far destination nodes to solve problem of dead communication. This multiple traffic "hops" within a wireless mesh network caused dilemma. Wireless mesh network that contain multiple hops become increasingly vulnerable to problems such as energy degradation and rapid increasing of overhead packets. This paper provides a generic routing framework that balances energy efficient broadcast schemes in Wireless (Ad-Hoc) Mesh Network and maintaining connectivity of nodes (mobile terminals). Typically, each node’s activities will consume energy, either for sending packets, receiving or preparing/processing packets. Number of hops, distance of nodes, and size of packet will determine the consumption of energy. The framework is based on the principle that additional relay nodes with appropriate energy and routing metric between source and final destination significantly reduces the energy consumption necessary to deliver packets in Wireless (Ad-Hoc) Mesh Network while keep the connectivity of dynamic nodes. Using the framework, the average network connectivity is kept 18% higher and the lifetime of network lasting more than 2.38% compared with network with Link State Routing mechanism. The simulation notes that the end-to-end delay may increase rapidly if relay nodes are more than five.
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.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Cross layer design for power control and linkIJCNCJournal
Frequent changes in network topology due to mobility and limited battery power of the mobile devices are the key challenges in the adhoc networks. The depletion of power source may cause early unavailability of nodes and thus links in the network. The mobility of nodes causes frequent routes breaks and adversely affects the required performance of the applications. We propose a cross layer design for the dynamic power control protocol and link prediction (DPCPLP) that provides a combined solution for power conservation as well as link availability. This combines the effect of optimum transmit power and received signal strength based link availability estimation with AODV routing protocol using cross layer approach.
This method proposes to use optimum transmit power for transmitting the packets to a neighboring node to
increase the battery life of adhoc nodes and received signal strength based link prediction to increase the
availability of the links. In this paper, the transmit power and received signal strength of the packets are
cross-layer interaction parameters to provide the combined solution for power conservation and reliable
route formation with increased availability of links and thus the routes amongst sources and destinations. Further, this increases network and nodes’ lifetime and capacity. It improves throughput and packet delivery ratio by spatial reuse, prior prediction of link breaks and initiating the route repair. It also reduces
end-to-end delay and power consumption by use of optimum transmit power. Through simulations, we have
shown that our proposed protocol shows better performance.
Coverage and Connectivity Aware Neural Network Based Energy Efficient Routing...graphhoc
There are many challenges when designing and deploying wireless sensor networks (WSNs). One of the key challenges is how to make full use of the limited energy to prolong the lifetime of the network, because energy is a valuable resource in WSNs. The status of energy consumption should be continuously monitored after network deployment. In this paper, we propose coverage and connectivity aware neural network based energy efficient routing in WSN with the objective of maximizing the network lifetime. In the proposed scheme, the problem is formulated as linear programming (LP) with coverage and connectivity aware constraints. Cluster head selection is proposed using adaptive learning in neural networks followed by coverage and connectivity aware routing with data transmission. The proposed scheme is compared with existing schemes with respect to the parameters such as number of alive nodes, packet delivery fraction, and node residual energy. The simulation results show that the proposed scheme can be used in wide area of applications in WSNs.
A wireless network consists of a set of wireless nodes forming the network. The bandwidth allocation scheme used in wireless networks should automatically adapt to the network’s environments, where issues such as mobility are highly variable. This paper proposes a method to distribute the bandwidth for wireless network nodes depending on dynamic methodology;this methodology uses intelligent clustering techniques that depend on the student’s distribution at the university campus, rather than the classical allocation methods. We propose a clustering-based approach to solve the dynamic bandwidth allocation problem in wireless networks, enabling wireless nodes to adapt their bandwidth allocation according to the changing number of expected users over time. The proposed solution allows the optimal online bandwidth allocation based on the data extracted from the lectures timetable, and fed to the wireless network control nodes, allowing them to adapt to their environment. The environment data is processed and clustered using the KMeans clustering algorithm to identify potential peak times for every wireless node. The proposed solution feasibility is tested by applying the approach to a case study, at the Arab American University campus wireless network.
An Improved Energy Efficient Wireless Sensor Networks Through Clustering In C...Editor IJCATR
One of the major reason for performance degradation in Wireless sensor network is the overhead due to control packet and
packet delivery degradation. Clustering in cross layer network operation is an efficient way manage control packet overhead and which
ultimately improve the lifetime of a network. All these overheads are crucial in a scalable networks. But the clustering always suffer
from the cluster head failure which need to be solved effectively in a large network. As the focus is to improve the average lifetime of
sensor network the cluster head is selected based on the battery life of nodes. The cross-layer operation model optimize the overheads
in multiple layer and ultimately the use of clustering will reduce the major overheads identified and their by the energy consumption
and throughput of wireless sensor network is improved. The proposed model operates on two layers of network ie., Network Layer
and Transport Layer and Clustering is applied in the network layer . The simulation result shows that the integration of two layers
reduces the energy consumption and increases the throughput of the wireless sensor networks.
Similar to Iaetsd increasing network life span of manet by using (20)
Cosmetic shop management system project report.pdfKamal Acharya
Buying new cosmetic products is difficult. It can even be scary for those who have sensitive skin and are prone to skin trouble. The information needed to alleviate this problem is on the back of each product, but it's thought to interpret those ingredient lists unless you have a background in chemistry.
Instead of buying and hoping for the best, we can use data science to help us predict which products may be good fits for us. It includes various function programs to do the above mentioned tasks.
Data file handling has been effectively used in the program.
The automated cosmetic shop management system should deal with the automation of general workflow and administration process of the shop. The main processes of the system focus on customer's request where the system is able to search the most appropriate products and deliver it to the customers. It should help the employees to quickly identify the list of cosmetic product that have reached the minimum quantity and also keep a track of expired date for each cosmetic product. It should help the employees to find the rack number in which the product is placed.It is also Faster and more efficient way.
Courier management system project report.pdfKamal Acharya
It is now-a-days very important for the people to send or receive articles like imported furniture, electronic items, gifts, business goods and the like. People depend vastly on different transport systems which mostly use the manual way of receiving and delivering the articles. There is no way to track the articles till they are received and there is no way to let the customer know what happened in transit, once he booked some articles. In such a situation, we need a system which completely computerizes the cargo activities including time to time tracking of the articles sent. This need is fulfilled by Courier Management System software which is online software for the cargo management people that enables them to receive the goods from a source and send them to a required destination and track their status from time to time.
COLLEGE BUS MANAGEMENT SYSTEM PROJECT REPORT.pdfKamal Acharya
The College Bus Management system is completely developed by Visual Basic .NET Version. The application is connect with most secured database language MS SQL Server. The application is develop by using best combination of front-end and back-end languages. The application is totally design like flat user interface. This flat user interface is more attractive user interface in 2017. The application is gives more important to the system functionality. The application is to manage the student’s details, driver’s details, bus details, bus route details, bus fees details and more. The application has only one unit for admin. The admin can manage the entire application. The admin can login into the application by using username and password of the admin. The application is develop for big and small colleges. It is more user friendly for non-computer person. Even they can easily learn how to manage the application within hours. The application is more secure by the admin. The system will give an effective output for the VB.Net and SQL Server given as input to the system. The compiled java program given as input to the system, after scanning the program will generate different reports. The application generates the report for users. The admin can view and download the report of the data. The application deliver the excel format reports. Because, excel formatted reports is very easy to understand the income and expense of the college bus. This application is mainly develop for windows operating system users. In 2017, 73% of people enterprises are using windows operating system. So the application will easily install for all the windows operating system users. The application-developed size is very low. The application consumes very low space in disk. Therefore, the user can allocate very minimum local disk space for this application.
Student information management system project report ii.pdfKamal Acharya
Our project explains about the student management. This project mainly explains the various actions related to student details. This project shows some ease in adding, editing and deleting the student details. It also provides a less time consuming process for viewing, adding, editing and deleting the marks of the students.
Industrial Training at Shahjalal Fertilizer Company Limited (SFCL)MdTanvirMahtab2
This presentation is about the working procedure of Shahjalal Fertilizer Company Limited (SFCL). A Govt. owned Company of Bangladesh Chemical Industries Corporation under Ministry of Industries.
Vaccine management system project report documentation..pdfKamal Acharya
The Division of Vaccine and Immunization is facing increasing difficulty monitoring vaccines and other commodities distribution once they have been distributed from the national stores. With the introduction of new vaccines, more challenges have been anticipated with this additions posing serious threat to the already over strained vaccine supply chain system in Kenya.
Water scarcity is the lack of fresh water resources to meet the standard water demand. There are two type of water scarcity. One is physical. The other is economic water scarcity.
Immunizing Image Classifiers Against Localized Adversary Attacksgerogepatton
This paper addresses the vulnerability of deep learning models, particularly convolutional neural networks
(CNN)s, to adversarial attacks and presents a proactive training technique designed to counter them. We
introduce a novel volumization algorithm, which transforms 2D images into 3D volumetric representations.
When combined with 3D convolution and deep curriculum learning optimization (CLO), itsignificantly improves
the immunity of models against localized universal attacks by up to 40%. We evaluate our proposed approach
using contemporary CNN architectures and the modified Canadian Institute for Advanced Research (CIFAR-10
and CIFAR-100) and ImageNet Large Scale Visual Recognition Challenge (ILSVRC12) datasets, showcasing
accuracy improvements over previous techniques. The results indicate that the combination of the volumetric
input and curriculum learning holds significant promise for mitigating adversarial attacks without necessitating
adversary training.
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
Saudi Arabia stands as a titan in the global energy landscape, renowned for its abundant oil and gas resources. It's the largest exporter of petroleum and holds some of the world's most significant reserves. Let's delve into the top 10 oil and gas projects shaping Saudi Arabia's energy future in 2024.
Overview of the fundamental roles in Hydropower generation and the components involved in wider Electrical Engineering.
This paper presents the design and construction of hydroelectric dams from the hydrologist’s survey of the valley before construction, all aspects and involved disciplines, fluid dynamics, structural engineering, generation and mains frequency regulation to the very transmission of power through the network in the United Kingdom.
Author: Robbie Edward Sayers
Collaborators and co editors: Charlie Sims and Connor Healey.
(C) 2024 Robbie E. Sayers
Iaetsd increasing network life span of manet by using
1. Increasing network life span of MANET by using
cooperative MAC protocol
B Suman Kanth1
, P Venkateswara Rao2
1
M.Tech , Dept. of CSE, Audisankara College of Engineering & Technology, Gudur, A.P, India.
2
Professor, Dept. of CSE, Audisankara College of Engineering & Technology, Gudur, A.P, India.
Abstract – Cooperative diversity has been shown
to give important performance increases in
wireless networks where communication is
hindered by channel fading. In resource limit
networks, the advantages of cooperation can be
further exploited by optimally allocating the
energy and bandwidth resources among users in a
cross-layer way. In this paper, we examine the
problem of transmission power minimization and
network lifetime maximization using cooperative
diversity for wireless sensor networks, under the
restraint of a target end-to-end transmission
consistency and a given transmission rate. By
using a cross-layer optimization scheme,
distributive algorithms which mutually consider
routing, relay selection, and power allocation plans
are proposed for the consistency constraint
wireless sensor networks.
Index terms – power minimization, cooperative
diversity, relay selection, cross-layer optimization.
I. INTRODUCTION
Wireless sensor networks are composed of nodes
powered by batteries, for which substitute or
recharging is very hard, if unfeasible. Therefore,
reducing the energy use for consistent data
transmission becomes one of the most important
design concerns for such networks. As an
promising and powerful solution that can
overcome the drawback of resource constraint
wireless networks, cooperative communication has
received major attention recently as one of the key
candidates for meeting the stringent requirement
of the resource limited networks.
Cooperative communication is developed from the
traditional MIMO (multiple-input and multiple-
output) techniques and the model of relay
channels. Though MIMO has been shown to be
able to significantly enlarge the system throughput
and reliability, it is not simple to be
straightforward to implement in the wireless
sensor networks due to the control on the size and
hardware complexity of sensor nodes.
Cooperative communication, however, is able to
achieve the same space diversity by forming a
virtual distributed antenna array where each
antenna belongs to a separate node. With
cooperation, users that understanding a deep fade
134
INTERNATIONAL CONFERENCE ON CURRENT INNOVATIONS IN ENGINEERING AND TECHNOLOGY
INTERNATIONAL ASSOCIATION OF ENGINEERING & TECHNOLOGY FOR SKILL DEVELOPMENT
ISBN: 378 - 26 - 138420 - 5
www.iaetsd.in
2. in their link towards the destination can utilize
quality of service (QoS).
a variety of cooperative schemes have been
developed so far. Cooperative beam forming
scheme was proposed for CDMA cellular
networks. Coded cooperation was proposed along
with analog-and-forward (AF) and decipher-and-
forward (DF) schemes. Diversity-multiplexing
tradeoff tools were used to analyze the
performance of diversive cooperative schemes
such as fixed relaying, selection relaying, and
incremental relaying. Multi relay cooperative
protocol using space-time coding was proposed.
Opportunistic relaying (or selective cooperation)
was proposed with various relay selection policies.
Power allocation problem and SER performance
analysis in resource constraint networks. These
works are primarily focused on enhancinging the
link performance in the physical layer.
Cooperative communication presents at birth a
cross-layer problem, since communication
resources have to be carefully allocated among
different nodes in the network. Therefore, the
integration and interaction with higher layers has
become an active research area in recent years.
There have been a lot of efforts towards this
consideration such as combining node cooperation
with ARQ in the link layer, or resource allocation
in the MAC layer, and routing algorithm in the
network layer.
However, a complete cross-layer optimization
incorporating three layers (routing, relay selection
in MAC, and power allocation in PHY) for
cooperative networks is still an open issue.
Although there are some efforts concerned in
optimizing some metrics such as throughput,
delay, or power use under certain QoS conditions,
these efforts focus on either one-hop situation or
fading-free channels.
Different from our work, we focus on various
optimization goal and conditions. We are planning
on energy minimization as well as network
lifetime maximization. The QoS conditions in our
work are end-to-end transfer reliability while the
work is under the constraint of end-to-end
transmission capacity. We believe in wireless
sensor network and the network lifetime
maximization, and the guarantee for end-to-end
reliability is more important than other
considerations. Moreover, we extend our work of
cross-layer optimization for cooperative network.
We decomposes the problem of minimizing
network power consumption into a routing sub-
problem in the network layer and a combined relay
selection and power allocation sub-problem in the
physical layer.
However, the decomposition method to solve this
cross-layer problem is faulty for its complexity.
Since the algorithm projected is non-heuristic, it
needs comprehensive iterations, with long meet
time and huge overhead for message exchanging,
thus inappropriate for sensor network application.
On opposite side, in our work, we try to derive a
closed-form solution (though may not be optimal)
and propose our algorithm in a heuristic way; thus,
135
INTERNATIONAL CONFERENCE ON CURRENT INNOVATIONS IN ENGINEERING AND TECHNOLOGY
INTERNATIONAL ASSOCIATION OF ENGINEERING & TECHNOLOGY FOR SKILL DEVELOPMENT
ISBN: 378 - 26 - 138420 - 5
www.iaetsd.in
3. it can be distributively employed in wireless
sensor networks. In the cooperative
communication and data-aggregation techniques
are together implemented to reduce the energy
spending in wireless sensor networks by reducing
the sum of data for transmission and better using
network resources through cooperative
communication. There are also extra works in
prolonging network lifetime using cooperative
communication techniques.
To address above stated problems, a cooperative
scheme is proposed join the maximum lifetime
power allocation and the energy aware routing to
maximize the network lifetime. This method is not
a cross-layer method since the energy saving
routing is formed first, and cooperative
transmission is applied based on the build routes.
Therefore, the qualities of cooperative
transmission are not fully discovered since the best
cooperative route might be completely different
from the noncooperative route.
A suboptimal algorithm for lifetime increasing is
developed based on the performance analysis for
MPSK modulation in the condition of adding
some special cooperative relays at the best places
to prolong the network lifetime, while, in our
work, the nodes are randomly distributed and no
additional relay nodes deployed.
In a word, we propose a fresh scheme to increase
the network lifetime by utilize the cooperative
diversity and together considering routing, relay
selection, and power allocation in arbitrarily
distributed wireless sensor networks.
II. CROSS – LAYER OPTIMIZATION PROBLEM IN
COOPERATIVE SENSOR NETWORK
In this section, we prepare and analyze the min-
power problem and the max-lifetime problem in
the context of reliability conditioned cooperative
networks and obtain relevant solutions, leading to
our algorithms which will be explained in detail in
the next section.
Problem Formulation
Consider a multihop wireless sensor network
containing of multiple arbitrarily disseminated
sensor nodes and one sink. Each sensor node has a
single omnidirectional antenna and can
dynamically adjust its transmitted power.
We consider two associated optimization
objectives. The first is called min-power problem:
given any source node, the goal is to find the route
that minimizes the total transmission power, while
fulfilling a required end-to-end broadcast success
probability and transmission rate.
The second is called max-lifetime problem: given
a set of source nodes, the goal is to offers an
information transferring scheme that increases the
network lifetime, defined as the lifetime of the
node whose battery consumes out first [1], while
fulfilling the same conditions as the min-power
problem.
136
INTERNATIONAL CONFERENCE ON CURRENT INNOVATIONS IN ENGINEERING AND TECHNOLOGY
INTERNATIONAL ASSOCIATION OF ENGINEERING & TECHNOLOGY FOR SKILL DEVELOPMENT
ISBN: 378 - 26 - 138420 - 5
www.iaetsd.in
4. Figure 1. Cooperative transmission (CT)
and direct transmission (DT) modes as
building blocks for any route.
From Figure 1, we can see that to promote data
from node i to node j on link (i, j), either direct
transmission is used or a particular node r helps
node i to forward data to node j using decipher-
and-forward (DF) cooperative diversity.
The broadcast rate and power for direct
transmission (DT) mode and cooperative
transmission (CT) mode classified into three cases
such as 1) Direct Transmission in which node i
send the data to the node j. 2) Single-Relay
Cooperation in which for the cooperative
transmission mode, the sender I sends its symbol
in its time slot. Due to the transmit nature of the
wireless medium, both the receiver and the relay
receive noisy versions of the transmitted symbol.
We assume that the relay and the receiver decide
that the received symbol is properly received if the
received (SNR) is greater than a certain threshold.
According to the incremental relaying scheme, if
the receiver deciphers the symbol suitably, then it
sends an acknowledgment (ACK) to the sender
and the relay to confirm a accurate reception.
Otherwise, it sends a negative acknowledgment
(NACK) that allows the relay, if it received the
symbol properly, to transmit this symbol to the
receiver in the next time slot. 3) Multirelay
Cooperation in which for the multirelay
collaboration mode, we use the opportunistic
relaying scheme according to this opportunistic
relaying scheme, for each frame, a node with the
best immediate relaying channel condition among
several possible relays is selected to promote the
packet in each frame.
Now consider the min-power problem described in
the above. This is a convex problem and we can
solve it using Lagrangian multiplier techniques.
To make best use of the lifetime of the entire
network, the novel solution is that the lifetime of
each node in the route of flow is equal to a target
lifetime.
III. COOPERATION-BASED CROSS-LAYER
SCHEMES
In this section, we propose thorough minimum-
power and maximize-lifetime cross-layer
algorithms, under the constraint of end-to-end
success probability and data rate, both in direct
mode and cooperative mode. We assume that each
node transmits HELLO packet to its neighbors to
update the local topology information. Our
algorithms are composed of two parts: routing
(and relay selection) algorithm and power
allocation algorithm. Algorithms are based on the
conventional Bellman-Ford shortest path
137
INTERNATIONAL CONFERENCE ON CURRENT INNOVATIONS IN ENGINEERING AND TECHNOLOGY
INTERNATIONAL ASSOCIATION OF ENGINEERING & TECHNOLOGY FOR SKILL DEVELOPMENT
ISBN: 378 - 26 - 138420 - 5
www.iaetsd.in
5. algorithm which can be distributively
implemented. In Bellman-Ford algorithm, each
node executes the iteration.
Table 1
Symbol and Explanation
Notation Explanation
,
∝
The effective distance between node
I and j
The latest estimate cost of the
shortest path from node j to the
destination
( ) The set of neighboring nodes of node
i
Qs Quality parameter
i) Min-Power Cross-Layer Scheme with Direct
Transmission
We can see that to reduce is equal to minimizing.
That means the formation of routing actually has
nothing to do with the QoS parameter. Thus we
can decompose the cross-layer optimization
problem into two sub-problems.
First we select the minimum-power route with the
least based on conservative Bellman-Ford
algorithm. Then, the transmission power
correlated to for each node in the route is
adjusted.
Since the forward nodes in the route may not
know (if not a priori for the whole network),
the source node may need to transfer a message
containing to the destination through the path
to inform all the forward nodes. Thus, the cross-
layer scheme is as follows.
Algorithm 1 (Min-Power Cross-layer Scheme with
Direct Transmission (MPCS-DT)). Consider
(1) Every node initiates its cost for routing as
∞ except Cost (0) = 0 (node 0 represents the sink).
(2) Every node estimates the effective
distance ,
∝
of its outgoing links through the
measurement of the average SNR from
periodically broadcasted HELLO message.
(3) Every node calculates the costs of its
outgoing links as ,
∝/
.
(4) Every node updates its cost toward the
destination as Cost(i) = min ∈ ( ) ,
∝/
+
( ) , and select node j as the next hop node.
(5) If the required QoS parameter is a
priori to the whole network, each node in the route
will adjust the transmit power.
(6) If not, the source will deliver a message
though the constructed route, informing all nodes
along the path about the . Then each node in the
route will adjust the transmit power.
(7) Got to Step (2).
i) Min-Power Cross-Layer Scheme with Cooperative
Transmission
The min-power scheme for cooperative
communication is composed of two parts: single-
relay scheme and multirelay scheme. For single-
relay scheme, that to minimize , is equal to
minimizing ∑ , . Hence, the cross-layer best
strategy can be realized by three steps. First, the
potential relay of each link is selected by
minimizing . Then, the min-power route is
138
INTERNATIONAL CONFERENCE ON CURRENT INNOVATIONS IN ENGINEERING AND TECHNOLOGY
INTERNATIONAL ASSOCIATION OF ENGINEERING & TECHNOLOGY FOR SKILL DEVELOPMENT
ISBN: 378 - 26 - 138420 - 5
www.iaetsd.in
6. constructed as the route with the least ∑ , .
Finally, the transmission power of the nodes in the
route is adjusted. The algorithm as follows.
Algorithm 2 (Min-Power Cross-layer Scheme
Cooperative Transmission (MPCS-CT) (for single-
relay scenario)). Consider
(1) The similar as steps 1 & 2 in Algorithm 1.
(2) The similar as steps 1 & 2 in Algorithm 1.
(3) Every node calculates the costs of its
outgoing links as , = min ∈ ( , ) ,
∝
,
∝
+
,
∝
, and select node k as the relay of this link,
where N(i, j) denotes the set of neighboring node
of both i and j.
(4) Every node updates its cost toward the
destination as = min ∈ ( ) ,
/
+
and select node j as the next hop node.
(5) & (6) The similar as steps 5 & 6 in
Algorithm 1 except each path node and relay node
in the route adjust the transmit power.
(6) Go to step (2).
For multirelay scheme (assume we need K relays
for each link), the difference with single-relay
scheme is that the K probable relays have to be
selected and only the optimal relay is chosen from
time-to-time in every transmission slot.
The best communicate is in charge of relaying the
packet, while further potential relays will turn off
the radio and not receive the packet to save
energy. The algorithm is as follows.
Algorithm 3 (Min-Power Cross-Layer Scheme
Cooperative Transmission (MPCS-CT) (for
opportunistic relaying multirelay scenario)).
Consider
(1) the similar as steps 1 & 2 Algorithm 1.
(2) the similar as steps 1 & 2 Algorithm 1.
(3) Every node sorts all its neighboring nodes
ascending according to the value of ,
∝
+ ∝
,
and selects the first K nodes as potential relays.
Then it calculates the costs of its outgoing links as
, = min ∈ ( , )
∝ ∏ ,
∝
+ ,
∝
,
where N(i, j) denotes the set of neighboring node
of both I and j.
(4) Every node updates its cost toward the
destination as Costi = min ( ,
+ ), and
select node j as the next hop node.
(5) (5) & (6) The similar as steps 5 & 6 in algorithm 1
except each path node and relay node in the route
adjust the transmit power.
(6) Go to (2).
ii) Max-Lifetime Cross-Layer Scheme with Direct
Transmission
The remaining energy of each node is decreasing
at unusual rates; the route may vary from time to
time as the residual energy of the intermediate
node in the route varies. The rate of the
recalculation of the route is determined by the rate
of HELLO message exchange. Thus, the algorithm
is as follows.
Algorithm 4 (Max-Lifetime Cross-Layer Scheme
with Direct Transmission (MLCS-DT)). Consider
(1) & (2) The similar as steps 1 & 2 in
Algorithm 1.
139
INTERNATIONAL CONFERENCE ON CURRENT INNOVATIONS IN ENGINEERING AND TECHNOLOGY
INTERNATIONAL ASSOCIATION OF ENGINEERING & TECHNOLOGY FOR SKILL DEVELOPMENT
ISBN: 378 - 26 - 138420 - 5
www.iaetsd.in
7. (3) Every node measures its residual energy
and its total power for the ongoing flows. Then it
calculate the cost of its outgoing links as
,
∝
/ and its total power for the ongoing
flows.
(4) Every node updates its cost toward the
destination as Costi = min ∈ ( )
,
∝
+ ,
and select node j as the next hop node.
(5) & (6) the similar as steps 5 & 6 in Algorithm 1
except each node in the route adjust the transmit
power.
(7) Go to (2).
iii) Max-Lifetime Cross-Layer Scheme with
Cooperative Transmission
To find a route which can maximize, we should
find a path with the minimum, and the power of
nodes should be adjusted.
Algorithm 5 (Max-Lifetime Cross-Layer Scheme
with Cooperative Transmission (MLCS-CT)).
Consider
(1) & (2) the similar as steps 1 & 2 in
Algorithm 1.
(3) Every node calculates the effective distance of
its outgoing links as
, = min ∈ ( , ) ,
∝
( ,
∝
+ ,
∝
), and select
node k as the relay of this link.
(4) Every node measures its residual energy
and its total transmission power for the ongoing
flows. Then calculates the cost of its outgoing
links.
(5) Every node updates its cost toward the
destination as = min ∈ ( )
,
+ ,
and selects node j as the next hop node.
(6) & (7) The similar as steps 5 & 6 in
Algorithm 1 except each forward node and relay
node in the route adjust the transmit power.
(8) Go to (2).
IV. EXPECTED RESULTS
In this section we compare the Min-Power
Algorithms to demonstrate the effect of cross-layer
design for communication; we implement two
min-power algorithms: MPCS-DT and MPCS-CT
in random networks. For better comparison, we
also implement two other cooperation along the
shortest non-cooperative routing (MPCR)
algorithm and cooperation along the shortest non-
cooperative path (CASNCP) algorithms.
And also we compare the Max-Life Algorithms,
for that we consider three different schemes: (1)
max-lifetime cross-layer scheme with direct
communication (MLCS-DT)and (2) max-lifetime
cross-layer scheme with cooperative
communication (MLCS-CT) and (3) greedy power
allocation and cost-based routing (GPA-CR).
V. CONCLUSION
In this paper, we build several cross-layer
algorithms for energy resourceful and consistent
data transfer in wireless sensor networks using
cooperative diversity. We examine the problem of
how to minimize transmission power consumption
140
INTERNATIONAL CONFERENCE ON CURRENT INNOVATIONS IN ENGINEERING AND TECHNOLOGY
INTERNATIONAL ASSOCIATION OF ENGINEERING & TECHNOLOGY FOR SKILL DEVELOPMENT
ISBN: 378 - 26 - 138420 - 5
www.iaetsd.in
8. and exploit the network lifetime while
guaranteeing the end-to-end accomplishment
probability.
REFERENCES
[1] F. Akyildiz, W. Su, Y. Sankarasubramaniam,
and E. Cayirci, “A survey on sensor
networks,” IEEE Communications Magazine,
vol. 40, no. 8, pp. 102–105, 2002.
[2] A. Nosratinia, T. E. Hunter, and A. Hedayat,
“Cooperative communication in wireless
networks,” IEEE Communications Magazine,
vol. 42, no. 10, pp. 74–80, 2004.
[3] Y.-W. Hong, W.-J. Huang, F.-H. Chiu, and C.-
C. J. Kuo, “Cooperative communications in
resource-constrained wireless networks,”
IEEE Signal Processing Magazine, vol. 24, no.
3, pp. 47–57, 2007.
[4] L. Zheng and D. N. C. Tse, “Diversity and
freedom: a fundamental tradeoff in multiple
antenna channels,” in Proceedings of the IEEE
International Symposium on Information
Theory (ISIT '02), p. 476, Lausanne,
Switzerland, July 2002.
[5] T. M. Cover and A. A. E. Gamal, “Capacity
theorems for the relay channel,” IEEE
Transactions on Information Theory, vol. 25,
no. 5, pp. 572–584, 1979.
[6] A. Sendonaris, E. Erkip, and B. Aazhang,
“User cooperation diversity part I and part 2,”
IEEE Transactions on Communications, vol.
51, no. 11, pp. 1927–1938, 2003.
[7] J. N. Laneman, D. N. C. Tse, and G. W.
Wornell, “Cooperative diversity in wireless
networks: efficient protocols and outage
behavior,” IEEE Transactions on Information
Theory, vol. 50, no. 12, pp. 3062–3080, 2004.
141
INTERNATIONAL CONFERENCE ON CURRENT INNOVATIONS IN ENGINEERING AND TECHNOLOGY
INTERNATIONAL ASSOCIATION OF ENGINEERING & TECHNOLOGY FOR SKILL DEVELOPMENT
ISBN: 378 - 26 - 138420 - 5
www.iaetsd.in