Helpful correspondence is developing as a standout amongst the most encouraging procedures in remote systems by reason of giving spatial differing qualities pick up. The transfer hub (RN) assumes a key part in agreeable correspondences, and RN choice may generously influence the execution pick up in a system with helpful media get to control (MAC). The issue of RN determination while considering MAC overhead, which is acquired by handshake motioning as well as casing retransmissions because of transmission disappointment also. We plan a helpful MAC system. The current framework utilizes agreeable MAC system with our ideal RN determination calculation, which is called ideal transfer choice MAC (ORS-MAC), and utilize a hypothetical model to break down the participation execution picks up. Be that as it may, it has transmission delay, less scope range and having crash amid transmission. Organize coding, which joins a few bundles together for transmission, is exceptionally useful to decrease the excess at the system and to build the general throughput. In this a novel system coding mindful helpful MAC convention, to be specific NCAC-MAC is proposed, that picks the hand-off hub utilizing Splitting Algorithm-based Relay Selection. The plan goal of NCAC-MAC is to build the throughput and lessen the postponement.
WARM WELCOME FROM HCL VELACHERY…….
HCL Learning is part of HCL Info Systems Ltd, India’s Premier information enabling company with an annual turnover of 15000 crores Leveraging on the 34 years of industry experience of HCL, with an objective to develop quality IT professionals to meet this ever expanding requirement of Hardware Networking and Software professionals for the IT sector, HCL has launched HCL Career Development Centre.
For any clarification,
contact Person
Mr.Senthilvel.S
9382207007
HCL Velachery -42
We make use of the existence of cell-disjoint paths in the 3D grid topology to design a new highly reliable adaptive geographic routing protocol called Grid-based Adaptive Routing Protocol (GARP) for Underwater Wireless Sensor Networks. In GARP, the underwater environment is viewed as a virtual 3D grid of cells. A packet is forwarded following a pre-constructed routing path from a node in a grid cell to a node in a neighbouring grid cell repeatedly until the destination sink node is reached. When a selected routing path becomes unavailable, GARP adapts to the condition by switching to an alternative path making use of the existing cell-disjoint paths. Since the protocol uses pre-constructed routing paths, it avoids path establishment and path maintenance overheads. Analytical performance evaluation results for GARP are obtained showing its high reliability. In tested cases, the delivery ratio has approached 100% when the network density has reached a minimum number of sensor nodes per grid cell.
Abstract: VANET (vehicular ad-hoc network) is a classification of MANET in which vehicles act as mobile node and provides a different approach to Intelligent transport System (ITS). VANET is an emerging area for Intelligent Transportation System (ITS) which can result in increased traffic safety, collision warning through exchange of messages through wireless media. Efficient routing protocols are required for efficient communication among vehicles. In the given paper, we surveyed various VANETs protocols like GPRS, GPRS-MV & GPSR. We compare our proposed protocols via NS-2 based simulations and show the performance of different protocols.
A MANET is an autonomous collection of mobile users that communicate over relatively bandwidth constrained wireless links. When designing mobile ad hoc networks, several interesting and difficult problems arise because of the shared nature of the wireless medium, limited transmission power (range) of wireless devices, node mobility, and battery limitations. This paper aims at providing a new schema to improve Dynamic Source Routing (DSR) Protocol. The aim
behind the proposed enhancement is to find the best route in acceptable time limit without having broadcast storm. Moreover, O-DSR enables network not only to overcome congestion but also maximize the lifetime of mobile nodes. Some simulations results show that the Route Request (RREQ) and the Control Packet Overhead decrease by 15% when O-DSR is used, consequently. Also the global energy consumption in O-DSR is lower until to 60 % , which leads to a long lifetime of the network.
WARM WELCOME FROM HCL VELACHERY…….
HCL Learning is part of HCL Info Systems Ltd, India’s Premier information enabling company with an annual turnover of 15000 crores Leveraging on the 34 years of industry experience of HCL, with an objective to develop quality IT professionals to meet this ever expanding requirement of Hardware Networking and Software professionals for the IT sector, HCL has launched HCL Career Development Centre.
For any clarification,
contact Person
Mr.Senthilvel.S
9382207007
HCL Velachery -42
We make use of the existence of cell-disjoint paths in the 3D grid topology to design a new highly reliable adaptive geographic routing protocol called Grid-based Adaptive Routing Protocol (GARP) for Underwater Wireless Sensor Networks. In GARP, the underwater environment is viewed as a virtual 3D grid of cells. A packet is forwarded following a pre-constructed routing path from a node in a grid cell to a node in a neighbouring grid cell repeatedly until the destination sink node is reached. When a selected routing path becomes unavailable, GARP adapts to the condition by switching to an alternative path making use of the existing cell-disjoint paths. Since the protocol uses pre-constructed routing paths, it avoids path establishment and path maintenance overheads. Analytical performance evaluation results for GARP are obtained showing its high reliability. In tested cases, the delivery ratio has approached 100% when the network density has reached a minimum number of sensor nodes per grid cell.
Abstract: VANET (vehicular ad-hoc network) is a classification of MANET in which vehicles act as mobile node and provides a different approach to Intelligent transport System (ITS). VANET is an emerging area for Intelligent Transportation System (ITS) which can result in increased traffic safety, collision warning through exchange of messages through wireless media. Efficient routing protocols are required for efficient communication among vehicles. In the given paper, we surveyed various VANETs protocols like GPRS, GPRS-MV & GPSR. We compare our proposed protocols via NS-2 based simulations and show the performance of different protocols.
A MANET is an autonomous collection of mobile users that communicate over relatively bandwidth constrained wireless links. When designing mobile ad hoc networks, several interesting and difficult problems arise because of the shared nature of the wireless medium, limited transmission power (range) of wireless devices, node mobility, and battery limitations. This paper aims at providing a new schema to improve Dynamic Source Routing (DSR) Protocol. The aim
behind the proposed enhancement is to find the best route in acceptable time limit without having broadcast storm. Moreover, O-DSR enables network not only to overcome congestion but also maximize the lifetime of mobile nodes. Some simulations results show that the Route Request (RREQ) and the Control Packet Overhead decrease by 15% when O-DSR is used, consequently. Also the global energy consumption in O-DSR is lower until to 60 % , which leads to a long lifetime of the network.
RTH-RSS Mac: Path loss exponent estimation with received signal strength loca...IOSR Journals
Abstract: Nowadays , Wireless Sensor Networks (WSNs) succed in domain of technology trends; new
require’sare continuously have more complex challenging, such as the real time location. The MAC layer
plays a crucial role in these networks; it controls the communication module and manages the medium sharing.
In this work, we integrate the received signal strength path-loss exponent estimation (RSS PLE) based on
location technique in Real Time Hybrid MAC (RTHMAC) protocol in goal to minimize the delay phase’s and
get more life time node’s. It combinesalso the advantages of both TDMA and FDMA in order to give a soft real
time communication for WSN.
Keywords: Duty cycle, RSS, PLE ,FDMA,TDMA, WSN ,Cluster
Self-Pruning based Probabilistic Approach to Minimize Redundancy Overhead for...IJCNCJournal
The Broadcast storm problem causes severe interference, intense collision and channel contention, which greatly degrades the QoS performance metrics of the routing protocols. So, we suggest a neighbourhood coverage knowledge probabilistic broadcasting model (NCKPB) integrating with AODV protocol with knowledge on 2-hop neighbourhood coverage; a connectivity function to control a node’s forwarding probability of retransmission to alleviate significant overhead redundancy. Our objective is to minimize the broadcast RREQ overhead while ensuring fair retransmission bandwidth. We considered two more important measures called Saved Rebroadcast and Reachability. The outcomes of NCKPB, Fixed probability (FP) and Flooding (FL) routing schemes are examined under three major operating conditions, such as node density, mobility and traffic load. The NS-2 results demonstrate the efficacy of the proposed NCKPB model by illustrating its performance superiority over all key metrics such as redundancy overhead, end to end latency, throughput, reachability, saved rebroadcast and collision contrast to FP and FL.
POSITION BASED ADAPTIVE ROUTING FOR VANETSIJCNCJournal
Routing plays a very significant role in multi hop data dissemination in Vehicular Ad-Hoc Networks
(VANETs). Wehave proposed a Position based Adaptive Routing (PAR) protocol which is scalable for different
network densities in VANETs. This scheme uses Preferred Group Broadcasting (PGB) for route discovery.
In this mode, after broadcasting the request for route discovery the source node starts listening to
the channel. If the packet is not further rebroadcasted by any neighbor in a set timeout, then it repeats the
broadcast. This process is repeated until the request reaches the destination. The destination keeps on accumulating
route requests coming from different paths until predefined time. It then chooses the least cost
path as route reply. It uses the set of traversed anchors for sending the unicast route reply to the source
node. PAR uses Advance Greedy Forwarding (AGF) for data forwarding and greedily forwards the data
packet to the next anchor towards destination node. It switches to carry and forward mode once it finds
partitions in the network. The intermediate vehicle buffers the packet until next junction and switches back
to position based scheme and greedily forwards to next node in range which is closest to the destination. To
have an end to end connectedpath, it uses guards to guard anchors tied to different junction and geographical
locations in the network. The algorithm is scalable and exploits advantages of existing techniques
already developed for specific scenarios in VANET. Results show that the service ratio and packet
delay of PAR are higher than its counterparts.
Destination Aware APU Strategy for Geographic Routing in MANETEditor IJCATR
In this paper, we have explained the Enhanced Adaptive Position Update strategy for geographic routing in mobile ad hoc
network In Adaptive Position Update strategy, there are two techniques: Mobility prediction rule and On-demand learning rule. Proposed
system is based on the destination aware routing in which path to transfer the data over the network is based on the distance from highly
stable node to the destination node. Results of the proposed system are compared with Periodic Beaconing on the basis of packet delivery
ratio, beacon overhead, energy consumption. Experiment results show a high improvement in results on the parameters energy
consumption, packet delivery ratio and beacon overhead. Proposed work is implemented on the NS2 (Network Simulator) Environment
to perform experiments.
Comparative analysis on Void Node Removal Routing algorithms for Underwater W...Editor IJCATR
The designing of routing algorithms faces many challenges in underwater environment like: propagation delay, acoustic channel behaviour, limited bandwidth, high bit error rate, limited battery power, underwater pressure, node mobility, localization 3D deployment, and underwater obstacles (voids). This paper focuses the underwater voids which affects the overall performance of the entire network. The majority of the researchers have used the better approaches for removal of voids through alternate path selection mechanism but still research needs improvement. This paper also focuses the architecture and its operation through merits and demerits of the existing algorithms. This research article further focuses the analytical method of the performance analysis of existing algorithms through which we found the better approach for removal of voids
Investigating VANET for Unwavering Ways with Flawless Connectivitypaperpublications3
Abstract: This paper is investigating the VANET techniques by understanding the various papers published by the authors in IEEE transactions. In this paper the new technique is explored where no of the routing method is applied for connecting the nodes. But using the other information such as speed ,density, time, range and calculating the time required by the vehicle on the road of interests we can link them full time period of their run. We can use the standard frequency bands widths allocated by the Governments.
Reduce Handover Delay Using the HSBCC Based Buffer Over Flow In Wimax Networkinventionjournals
In wireless networks to improve the competence for event account. Due to the in complete transmission size of nodes, a single path often cannot meet the condition of data transmission. Consequently, multipath show is needed. However, not every path originate by multipath routing algorithms maybe appropriate for conveying image, because a extended routing pathway with a long end to end show delay may not satisfied the time constraint. Furthermore, each data stream includes two kinds of material data handover. We have coming a novel explicit rate-based congestion control method, for supportive requests hand over process. Handover Streaming based Congestion Control (HSBCC), a new adaptive media handover streaming congestion organization in which the assembly packet broadcast rate is adjusted rendering to the active bandwidth share of the connection. They prepare not maintain or continually inform their route tables with the newest route in network. If a node requirements to send a pack to another node then this protocol explorations for the route in an on-demand method and begins the joining in order to communicate and receive the packet. The route detection usually happens by flooding the route application packets throughout the network. It makes sense to simply disregard a packet loss due to random frequency errors than to multiplicatively reduction the current transport rate and it is more suitable to periodically investigation the network during interruption period for a prompt retrieval than to slow down and exponentially increase the retransmission timer.
A Survey on Spectrum-Map Based on Normal Opportunistic Routing Methods for Co...Eswar Publications
Cognitive Radio (CR) technology has significant impacts on upper layer performance in Ad Hoc Networks (AHNs). In recent times, several number of investigation are conducted in CR are mostly focusing on the opportunistic spectrum admission and physical layer transmission throughput. However, CR technology determination also have considerable impacts in mobile Ad Hoc networks (AHNs), which enables wireless devices to dynamically create networks without essentially use of a fixed infrastructure . Nowadays, establishing a cognitive network is such a difficult task. The most important issues is routing in CRAHNs. In this paper, it majorly focuses on the survey of routing and opportunistic routing schema in CRAHN. The most significant scheme behind this concept is to make use of a suitable routing protocol designed for establishing Cognitive Radio Network (CRN). Due to licensing, the accessibility of radio frequency for wireless communication gets reduced day by day. Thus, there is a necessitate to have some other way to use these frequencies in an efficient manner.
Routing is efficient method to solve these issues, but the use of geographical concept is also a challenging task in CRN. Since, there is a lack in detailed understanding of these extremely dynamic opportunistic links and a consistent end-to-end transportation mechanism over the network. Here, it focuses on the study of possible routing approaches with the purpose of be able to be employed in CRAHNs. There is a comparison on
performance evaluation of various potential routing approaches in terms of table significant reduction and what
solution can be found from the routing protocol are also discussed. The routing protocol attains reliable communications for CRAHNs, without usually getting feedback information from nodes in a CRAHN to considerably accumulate the communication overhead.
Abstract The Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) based Medium Access Control (MAC) protocol uses a short request-to-send (RTS) and clear-to-send (CTS) control packets prior of actual data packet transmission. The function of the CSMA/CA based MAC protocol in wireless communication is to facilitate wireless nodes (i.e. laptop, PC, smart phones and etc) to access a wireless medium efficiently. Besides, it is also efficiently manage the wireless medium when more wireless nodes involving in transmission activity in the network. This protocol allows all wireless nodes in the network to communicate between each other without collision. Since collisions may only occurred on the RTS control packets thus it can reduce the actual data collision on the medium. The RTS/CTS control handshake provides better performance and reduce the duration of collision especially when long data packets are transmitted over wireless medium. However, even though the CSMA/CA based MAC protocol working effectively and provides better throughput performance over single hop communication but it performance degrade significantly when directly applied in multihop Wireless Mesh Network (WMN). The reason behind this poor performance is due to the inefficient packet delivery of CSMA/CA based MAC protocol in multihop network. The exchange of RTS and CTS signaling that required at each hop throughout the multihop network eventually will cause the large overheads and subsequently degrade network throughput. Therefore, in this paper, an enhancement of RTS/CTS handshake has been proposed in order reduces the signaling overheads and ultimately allows a smooth packet delivery in the multihop network without any collision. In this work, the multihop network performances are evaluated analytically in terms of throughput and overhead. It is proven that the new method of RTS/CTS handshake provides significant improvement in throughput and overhead. Keywords: Medium Access Control (MAC) protocol; Signaling; Overheads; Multihop communication
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
REAL-TIME ROUTING PROTOCOLS FOR WIRELESS SENSOR NETWORKS: A SURVEYcscpconf
Wireless sensor networks can be termed as a new generation of distributed embedded systems
that has a capability of meeting broad range of real-time applications. Examples include
radiation monitoring, fire monitoring, border surveillance, and medical care to name but a few.
Wireless sensor networks that are deployed in time/mission-critical applications with highly
dynamic environments have to interact with the physical phenomenon under stringent timing
constraints and severe resource limitations. For such real-time wireless sensor networks,
designing and developing a real-time routing protocol that meets the required real-time
guarantee of data packets communication is a stimulating field of study that raised many
challenges and research issues. In this paper, we present a comprehensive survey of real-time
routing protocols in WSN, by discussing each protocol with its key features. Finally, we concluded this paper with open research issues and challenges of real-time routing in WSN.
A QUANTITATIVE ANALYSIS OF HANDOVER TIME AT MAC LAYER FOR WIRELESS MOBILE NET...ijwmn
Extensive studies have been carried out for reducing the handover time of wireless mobile network at
medium access control (MAC) layer. However, none of them show the impact of reduced handover time
on the overall performance of wireless mobile networks. This paper presents a quantitative analysis to
show the impact of reduced handover time on the performance of wireless mobile networks. The proposed
quantitative model incorporates many critical performance parameters involve in reducing the handover
time for wireless mobile networks. In addition, we analyze the use of active scanning technique with
comparatively shorter beacon interval time in a handoff process. Our experiments verify that the active
scanning can reduce the overall handover time at MAC layer if comparatively shorter beacon intervals are
utilized for packet transmission. The performance measures adopted in this paper for experimental
verifications are network throughput under different network loads.
An Efficient Cooperative Media Access Control Based Relay Node Selection In W...Christo Ananth
Christo Ananth et al. discussed because of various appealing focal points, agreeable correspondences have been broadly viewed as one of the promising systems to enhance throughput and scope execution in remote interchanges. The hand-off hub (RN) assumes a key part in helpful interchanges, and RN determination may considerably influence the execution pick up in a system with agreeable media get to control (MAC). In this paper, we address the issue of RN choice while considering MAC overhead, which is brought about by handshake motioning as well as casing retransmissions because of transmission disappointment too. We outline a helpful MAC component with our ideal RN determination calculation, which is called ideal hand-off choice MAC, and utilize a hypothetical model. To investigate the collaboration execution picks up. We direct recreation tests in view of Network Simulator To assess our proposed agreeable MAC. Numerical outcomes approve the adequacy of our investigative model and demonstrate that our composed MAC fundamentally outflanks existing agreeable MAC components that don't consider retransmission MAC overhead.
RTH-RSS Mac: Path loss exponent estimation with received signal strength loca...IOSR Journals
Abstract: Nowadays , Wireless Sensor Networks (WSNs) succed in domain of technology trends; new
require’sare continuously have more complex challenging, such as the real time location. The MAC layer
plays a crucial role in these networks; it controls the communication module and manages the medium sharing.
In this work, we integrate the received signal strength path-loss exponent estimation (RSS PLE) based on
location technique in Real Time Hybrid MAC (RTHMAC) protocol in goal to minimize the delay phase’s and
get more life time node’s. It combinesalso the advantages of both TDMA and FDMA in order to give a soft real
time communication for WSN.
Keywords: Duty cycle, RSS, PLE ,FDMA,TDMA, WSN ,Cluster
Self-Pruning based Probabilistic Approach to Minimize Redundancy Overhead for...IJCNCJournal
The Broadcast storm problem causes severe interference, intense collision and channel contention, which greatly degrades the QoS performance metrics of the routing protocols. So, we suggest a neighbourhood coverage knowledge probabilistic broadcasting model (NCKPB) integrating with AODV protocol with knowledge on 2-hop neighbourhood coverage; a connectivity function to control a node’s forwarding probability of retransmission to alleviate significant overhead redundancy. Our objective is to minimize the broadcast RREQ overhead while ensuring fair retransmission bandwidth. We considered two more important measures called Saved Rebroadcast and Reachability. The outcomes of NCKPB, Fixed probability (FP) and Flooding (FL) routing schemes are examined under three major operating conditions, such as node density, mobility and traffic load. The NS-2 results demonstrate the efficacy of the proposed NCKPB model by illustrating its performance superiority over all key metrics such as redundancy overhead, end to end latency, throughput, reachability, saved rebroadcast and collision contrast to FP and FL.
POSITION BASED ADAPTIVE ROUTING FOR VANETSIJCNCJournal
Routing plays a very significant role in multi hop data dissemination in Vehicular Ad-Hoc Networks
(VANETs). Wehave proposed a Position based Adaptive Routing (PAR) protocol which is scalable for different
network densities in VANETs. This scheme uses Preferred Group Broadcasting (PGB) for route discovery.
In this mode, after broadcasting the request for route discovery the source node starts listening to
the channel. If the packet is not further rebroadcasted by any neighbor in a set timeout, then it repeats the
broadcast. This process is repeated until the request reaches the destination. The destination keeps on accumulating
route requests coming from different paths until predefined time. It then chooses the least cost
path as route reply. It uses the set of traversed anchors for sending the unicast route reply to the source
node. PAR uses Advance Greedy Forwarding (AGF) for data forwarding and greedily forwards the data
packet to the next anchor towards destination node. It switches to carry and forward mode once it finds
partitions in the network. The intermediate vehicle buffers the packet until next junction and switches back
to position based scheme and greedily forwards to next node in range which is closest to the destination. To
have an end to end connectedpath, it uses guards to guard anchors tied to different junction and geographical
locations in the network. The algorithm is scalable and exploits advantages of existing techniques
already developed for specific scenarios in VANET. Results show that the service ratio and packet
delay of PAR are higher than its counterparts.
Destination Aware APU Strategy for Geographic Routing in MANETEditor IJCATR
In this paper, we have explained the Enhanced Adaptive Position Update strategy for geographic routing in mobile ad hoc
network In Adaptive Position Update strategy, there are two techniques: Mobility prediction rule and On-demand learning rule. Proposed
system is based on the destination aware routing in which path to transfer the data over the network is based on the distance from highly
stable node to the destination node. Results of the proposed system are compared with Periodic Beaconing on the basis of packet delivery
ratio, beacon overhead, energy consumption. Experiment results show a high improvement in results on the parameters energy
consumption, packet delivery ratio and beacon overhead. Proposed work is implemented on the NS2 (Network Simulator) Environment
to perform experiments.
Comparative analysis on Void Node Removal Routing algorithms for Underwater W...Editor IJCATR
The designing of routing algorithms faces many challenges in underwater environment like: propagation delay, acoustic channel behaviour, limited bandwidth, high bit error rate, limited battery power, underwater pressure, node mobility, localization 3D deployment, and underwater obstacles (voids). This paper focuses the underwater voids which affects the overall performance of the entire network. The majority of the researchers have used the better approaches for removal of voids through alternate path selection mechanism but still research needs improvement. This paper also focuses the architecture and its operation through merits and demerits of the existing algorithms. This research article further focuses the analytical method of the performance analysis of existing algorithms through which we found the better approach for removal of voids
Investigating VANET for Unwavering Ways with Flawless Connectivitypaperpublications3
Abstract: This paper is investigating the VANET techniques by understanding the various papers published by the authors in IEEE transactions. In this paper the new technique is explored where no of the routing method is applied for connecting the nodes. But using the other information such as speed ,density, time, range and calculating the time required by the vehicle on the road of interests we can link them full time period of their run. We can use the standard frequency bands widths allocated by the Governments.
Reduce Handover Delay Using the HSBCC Based Buffer Over Flow In Wimax Networkinventionjournals
In wireless networks to improve the competence for event account. Due to the in complete transmission size of nodes, a single path often cannot meet the condition of data transmission. Consequently, multipath show is needed. However, not every path originate by multipath routing algorithms maybe appropriate for conveying image, because a extended routing pathway with a long end to end show delay may not satisfied the time constraint. Furthermore, each data stream includes two kinds of material data handover. We have coming a novel explicit rate-based congestion control method, for supportive requests hand over process. Handover Streaming based Congestion Control (HSBCC), a new adaptive media handover streaming congestion organization in which the assembly packet broadcast rate is adjusted rendering to the active bandwidth share of the connection. They prepare not maintain or continually inform their route tables with the newest route in network. If a node requirements to send a pack to another node then this protocol explorations for the route in an on-demand method and begins the joining in order to communicate and receive the packet. The route detection usually happens by flooding the route application packets throughout the network. It makes sense to simply disregard a packet loss due to random frequency errors than to multiplicatively reduction the current transport rate and it is more suitable to periodically investigation the network during interruption period for a prompt retrieval than to slow down and exponentially increase the retransmission timer.
A Survey on Spectrum-Map Based on Normal Opportunistic Routing Methods for Co...Eswar Publications
Cognitive Radio (CR) technology has significant impacts on upper layer performance in Ad Hoc Networks (AHNs). In recent times, several number of investigation are conducted in CR are mostly focusing on the opportunistic spectrum admission and physical layer transmission throughput. However, CR technology determination also have considerable impacts in mobile Ad Hoc networks (AHNs), which enables wireless devices to dynamically create networks without essentially use of a fixed infrastructure . Nowadays, establishing a cognitive network is such a difficult task. The most important issues is routing in CRAHNs. In this paper, it majorly focuses on the survey of routing and opportunistic routing schema in CRAHN. The most significant scheme behind this concept is to make use of a suitable routing protocol designed for establishing Cognitive Radio Network (CRN). Due to licensing, the accessibility of radio frequency for wireless communication gets reduced day by day. Thus, there is a necessitate to have some other way to use these frequencies in an efficient manner.
Routing is efficient method to solve these issues, but the use of geographical concept is also a challenging task in CRN. Since, there is a lack in detailed understanding of these extremely dynamic opportunistic links and a consistent end-to-end transportation mechanism over the network. Here, it focuses on the study of possible routing approaches with the purpose of be able to be employed in CRAHNs. There is a comparison on
performance evaluation of various potential routing approaches in terms of table significant reduction and what
solution can be found from the routing protocol are also discussed. The routing protocol attains reliable communications for CRAHNs, without usually getting feedback information from nodes in a CRAHN to considerably accumulate the communication overhead.
Abstract The Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) based Medium Access Control (MAC) protocol uses a short request-to-send (RTS) and clear-to-send (CTS) control packets prior of actual data packet transmission. The function of the CSMA/CA based MAC protocol in wireless communication is to facilitate wireless nodes (i.e. laptop, PC, smart phones and etc) to access a wireless medium efficiently. Besides, it is also efficiently manage the wireless medium when more wireless nodes involving in transmission activity in the network. This protocol allows all wireless nodes in the network to communicate between each other without collision. Since collisions may only occurred on the RTS control packets thus it can reduce the actual data collision on the medium. The RTS/CTS control handshake provides better performance and reduce the duration of collision especially when long data packets are transmitted over wireless medium. However, even though the CSMA/CA based MAC protocol working effectively and provides better throughput performance over single hop communication but it performance degrade significantly when directly applied in multihop Wireless Mesh Network (WMN). The reason behind this poor performance is due to the inefficient packet delivery of CSMA/CA based MAC protocol in multihop network. The exchange of RTS and CTS signaling that required at each hop throughout the multihop network eventually will cause the large overheads and subsequently degrade network throughput. Therefore, in this paper, an enhancement of RTS/CTS handshake has been proposed in order reduces the signaling overheads and ultimately allows a smooth packet delivery in the multihop network without any collision. In this work, the multihop network performances are evaluated analytically in terms of throughput and overhead. It is proven that the new method of RTS/CTS handshake provides significant improvement in throughput and overhead. Keywords: Medium Access Control (MAC) protocol; Signaling; Overheads; Multihop communication
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
REAL-TIME ROUTING PROTOCOLS FOR WIRELESS SENSOR NETWORKS: A SURVEYcscpconf
Wireless sensor networks can be termed as a new generation of distributed embedded systems
that has a capability of meeting broad range of real-time applications. Examples include
radiation monitoring, fire monitoring, border surveillance, and medical care to name but a few.
Wireless sensor networks that are deployed in time/mission-critical applications with highly
dynamic environments have to interact with the physical phenomenon under stringent timing
constraints and severe resource limitations. For such real-time wireless sensor networks,
designing and developing a real-time routing protocol that meets the required real-time
guarantee of data packets communication is a stimulating field of study that raised many
challenges and research issues. In this paper, we present a comprehensive survey of real-time
routing protocols in WSN, by discussing each protocol with its key features. Finally, we concluded this paper with open research issues and challenges of real-time routing in WSN.
A QUANTITATIVE ANALYSIS OF HANDOVER TIME AT MAC LAYER FOR WIRELESS MOBILE NET...ijwmn
Extensive studies have been carried out for reducing the handover time of wireless mobile network at
medium access control (MAC) layer. However, none of them show the impact of reduced handover time
on the overall performance of wireless mobile networks. This paper presents a quantitative analysis to
show the impact of reduced handover time on the performance of wireless mobile networks. The proposed
quantitative model incorporates many critical performance parameters involve in reducing the handover
time for wireless mobile networks. In addition, we analyze the use of active scanning technique with
comparatively shorter beacon interval time in a handoff process. Our experiments verify that the active
scanning can reduce the overall handover time at MAC layer if comparatively shorter beacon intervals are
utilized for packet transmission. The performance measures adopted in this paper for experimental
verifications are network throughput under different network loads.
An Efficient Cooperative Media Access Control Based Relay Node Selection In W...Christo Ananth
Christo Ananth et al. discussed because of various appealing focal points, agreeable correspondences have been broadly viewed as one of the promising systems to enhance throughput and scope execution in remote interchanges. The hand-off hub (RN) assumes a key part in helpful interchanges, and RN determination may considerably influence the execution pick up in a system with agreeable media get to control (MAC). In this paper, we address the issue of RN choice while considering MAC overhead, which is brought about by handshake motioning as well as casing retransmissions because of transmission disappointment too. We outline a helpful MAC component with our ideal RN determination calculation, which is called ideal hand-off choice MAC, and utilize a hypothetical model. To investigate the collaboration execution picks up. We direct recreation tests in view of Network Simulator To assess our proposed agreeable MAC. Numerical outcomes approve the adequacy of our investigative model and demonstrate that our composed MAC fundamentally outflanks existing agreeable MAC components that don't consider retransmission MAC overhead.
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.
Improved routing scheme with ACO in WSN in comparison to DSDVijsrd.com
Routing is the process of selecting best paths in a network in terms of energy and distance. In adhoc it is critical to collect the information in an efficient manner as it has limitations in terms of centralized congestion. In such case to perform the effective communication there is the requirement of some such routing approach that can provide the routing with optimized path. In this work, ACO based routing approach is defined to generate the optimized path in comparison to DSDV over the network. The presented approach is implemented in matlab environment and obtained results shows the effective results in terms of optimized path.
Flbra fuzzy logic based routing algorithm for indoor wireless sensor networksijcsit
Considering the context of building management systems with wireless sensor networks monitoring
environmental features, this paper presents a proposal of a Fuzzy Logic Based Routing Algorithm (FLBRA)
to determine the cost of each link and the identification of the best routes for packet forwarding. We
describe the parameters (Received Signal Strength Indicator - RSSI, Standard Deviation of the RSSI and
Packet Error Rate - PER) for the cost definition of each path, the sequence of identifying best routes and
the results obtained in simulation. As expected in this proposal, the simulation results showed an increase
in the packet delivery rate compared to RSSI-based forward protocol (RBF).
Multipoint Relay Path for Efficient Topology Maintenance Algorithm in Optimiz...IJCNCJournal
The Optimal Link State Routing (OLSR) protocol employs multipoint relay (MPR) nodes to disseminate topology control (TC) messages, enabling network topology discovery and maintenance. However, this approach increases control overhead and leads to wasted network bandwidth in stable topology scenarios due to fixed flooding periods. To address these challenges, this paper presents an Efficient Topology Maintenance Algorithm (ETM-OLSR) for Enhanced Link-State Routing Protocols. By reducing the number of MPR nodes, TC message generation and forwarding frequency are minimized. Furthermore, the algorithm selects a smaller subset of TC messages based on the changes in the MPR selection set from the previous cycle, adapting to stable and fluctuating network conditions. Additionally, the sending cycle of TC messages is dynamically adjusted in response to network topology changes. Simulation results demonstrate that the ETM-OLSR algorithm effectively reduces network control overhead, minimizes end-to-end delay, and improves network throughput compared to traditional OLSR and HTR-OLSR algorithms.
Multipoint Relay Path for Efficient Topology Maintenance Algorithm in Optimiz...IJCNCJournal
The Optimal Link State Routing (OLSR) protocol employs multipoint relay (MPR) nodes to disseminate topology control (TC) messages, enabling network topology discovery and maintenance. However, this approach increases control overhead and leads to wasted network bandwidth in stable topology scenarios due to fixed flooding periods. To address these challenges, this paper presents an Efficient Topology Maintenance Algorithm (ETM-OLSR) for Enhanced Link-State Routing Protocols. By reducing the number of MPR nodes, TC message generation and forwarding frequency are minimized. Furthermore, the algorithm selects a smaller subset of TC messages based on the changes in the MPR selection set from the previous cycle, adapting to stable and fluctuating network conditions. Additionally, the sending cycle of TC messages is dynamically adjusted in response to network topology changes. Simulation results demonstrate that the ETM-OLSR algorithm effectively reduces network control overhead, minimizes end-to-end delay, and improves network throughput compared to traditional OLSR and HTR-OLSR algorithms.
Mobile environment pretense a number of novel
theoretical and optimization issues such as position, operation
and following in that a lot of requests rely on them for
desirable information. The precedent works are sprinkled
across the entire network layer: from the medium of physical
to link layer to routing and then application layer. In this
invention, we present outline solutions in Medium Access
Control (MAC), data distribution, coverage resolve issues
under mobile ad-hoc network environment based on
congestion control technique using Transmission Control
Protocol (TCP). In mobile ad-hoc network issues can arise
such as link disconnections, channel contention and recurrent
path loss. To resolve this issue, we propose a Cross Layer
based Hybrid fuzzy ad-hoc rate based Congestion Control
(CLHCC) approach to maximize network performance. Based
on the destination report it regulates the speed of data flow to
control data loss by monitoring the present network status
and transmits this report to the source as advice. The source
adjusts the sending flow rate as per the advice. This is
monitored by channel usage, ultimate delay, short term
throughput.
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
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.
Maximizing Throughput using Adaptive Routing Based on Reinforcement LearningEswar Publications
In this paper, prioritized sweeping confidence based dual reinforcement learning based adaptive routing is studied. Routing is an emerging research area in wireless networks and needs more research due to emerging technologies such as wireless sensor network, ad hoc networks and network on chip. In addition, mobile ad hoc network suffers from various network issues such as dynamicity, mobility, data packets delay, high dropping ratio, large routing overhead, less throughput and so on. Conventional routing protocols based on distance vector
or link state routing is not much suitable for mobile ad hoc network. All existing conventional routing protocols are based on shortest path routing, where the route having minimum number of hops is selected. Shortest path routing is non-adaptive routing algorithm that does not take care of traffic present on some popular routes of the network. In high traffic networks, route selection decision must be taken in real time and packets must be diverted on some alternate routes. In Prioritized sweeping method, optimization is carried out over confidence based dual reinforcement routing on mobile ad hoc network and path is selected based on the actual traffic present on the network at real time. Thus they guarantee the least delivery time to reach the packets to the destination. Analysis is done on 50 nodes MANET with random mobility and 50 nodes fixed grid network. Throughput is used to judge the performance of network. Analysis is done by varying the interval between the successive packets.
Rc maca receiver-centric mac protocol for event-driven wireless sensor networksLogicMindtech Nologies
NS2 Projects for M. Tech, NS2 Projects in Vijayanagar, NS2 Projects in Bangalore, M. Tech Projects in Vijayanagar, M. Tech Projects in Bangalore, NS2 IEEE projects in Bangalore, IEEE 2015 NS2 Projects, WSN and MANET Projects, WSN and MANET Projects in Bangalore, WSN and MANET Projects in Vijayangar
Similar to SPLITTING ALGORITHM BASED RELAY NODE SELEC-TION IN WIRELESS NETWORKS (20)
Call for Papers - Journal of Electrical Systems (JES), E-ISSN: 1112-5209, ind...Christo Ananth
At the forefront of technological innovation and scholarly discourse, the Journal of Electrical Systems (JES) is a peer-reviewed publication dedicated to advancing the understanding and application of electrical systems, communication systems and information science. With a commitment to excellence, we provide a platform for researchers, academics, and professionals to contribute to the ever-evolving field of electrical engineering, communication technology and Information Systems.
The mission of JES is to foster the exchange of knowledge and ideas in electrical and communication systems, promoting cutting-edge research and facilitating discussions that drive progress in the field. We aim to be a beacon for those seeking to explore, challenge, and revolutionize the way we harness, distribute, and utilize electrical energy and information systems..
Call for Papers - Utilitas Mathematica, E-ISSN: 0315-3681, indexed in ScopusChristo Ananth
Utilitas Mathematica Journal is a broad scope journal that publishes original research and review articles on all aspects of both pure and applied mathematics. This journal is the official publication of the Utilitas Mathematica Academy, Canada. It enjoys good reputation and popularity at international level in terms of research papers and distribution worldwide. Offers selected original research in Pure and Applied Mathematics and Statistics. UMJ coverage extends to Operations Research, Mathematical Economics, Mathematics Biology and Computer Science. Published in association with the Utilitas Mathematica Academy. The leadership of the Utilitas Mathematica Journal commits to strengthening our professional community by making it more just, equitable, diverse, and inclusive. We affirm that our mission, Promote the Practice and Profession of Statistics, can be realized only by fully embracing justice, equity, diversity, and inclusivity in all of our operations. Individuals embody many traits, so the leadership will work with the members of UMJ to create and sustain responsive, flourishing, and safe environments that support individual needs, stimulate intellectual growth, and promote professional advancement for all
Call for Chapters- Edited Book: Quantum Networks and Their Applications in AI...Christo Ananth
The research on Quantum Networked Artificial Intelligence is at the intersection of Quantum Information Science (QIS), Artificial Intelligence, Soft Computing, Computational Intelligence, Machine Learning, Deep Learning, Optimization, Etc. It Touches On Many Important Parts Of Near-Term Quantum Computing And Noisy Intermediate-Scale Quantum (NISQ) Devices. The research on quantum artificial intelligence is grounded in theories, modelling, and significant studies on hybrid classical-quantum algorithms using classical simulations, IBM Q services, PennyLane, Google Cirq, D-Wave quantum annealer etc. So far, the research on quantum artificial intelligence has given us the building blocks to achieve quantum advantage to solve problems in combinatorial optimization, soft computing, deep learning, and machine learning much faster than traditional classical computing. Solving these problems is important for making quantum computing useful for noise-resistant large-scale applications. This makes it much easier to see the big picture and helps with cutting-edge research across the quantum stack, making it an important part of any QIS effort. Researchers — almost daily — are making advances in the engineering and scientific challenges to create practical quantum networks powered with artificial intelligence
Call for Chapters- Edited Book: Real World Challenges in Quantum Electronics ...Christo Ananth
Most experts would consider this the biggest challenge. Quantum computers are extremely sensitive to noise and errors caused by interactions with their environment. This can cause errors to accumulate and degrade the quality of computation. Developing reliable error correction techniques is therefore essential for building practical quantum computers. While quantum computers have shown impressive performance for some tasks, they are still relatively small compared to classical computers. Scaling up quantum computers to hundreds or thousands of qubits while maintaining high levels of coherence and low error rates remains a major challenge. Developing high-quality quantum hardware, such as qubits and control electronics, is a major challenge. There are many different qubit technologies, each with its own strengths and weaknesses, and developing a scalable, fault-tolerant qubit technology is a major focus of research. Funding agencies, such as government agencies, are rising to the occasion to invest in tackling these quantum computing challenges. Researchers — almost daily — are making advances in the engineering and scientific challenges to create practical quantum computers
Call for Chapters- Edited Book: Real-World Applications of Quantum Computers ...Christo Ananth
It is no surprise that Quantum Computing will prove to be a big change for the world. The practical examples of quantum computing can prove to be a good substitute for traditional computing methods. Quantum computing can be applied to many concepts in today’s era when technology has grown by leaps and bounds. It has a wide beach of applications ranging from Cryptography, Climate Change and Weather Forecasting, Drug Development and Discovery, Financial Modeling, Artificial Intelligence, etc. Giant firms have already begun the process of quantum computing in the field of artificial intelligence. The search algorithms of today are mostly designed according to classical computing methods. While Comparing Quantum Computers with Data Mining with Other Counterpart Systems, we are able to understand its significance thereby applying new techniques to obtain new real-time results and solutions
Call for Papers- Thematic Issue: Food, Drug and Energy Production, PERIÓDICO ...Christo Ananth
Published since 2004, Periódico Tchê Química (PQT) is a is a triannual (published every four months), international, fully peer-reviewed, and open-access Journal that welcomes high-quality theoretically informed publications in the multi and interdisciplinary fields of Chemistry, Biology, Physics, Mathematics, Pharmacy, Medicine, Engineering, Agriculture and Education in Science.
Researchers from all countries are invited to publish on its pages. The Journal is committed to achieving a broad international appeal, attracting contributions, and addressing issues from a range of disciplines. The Periódico Tchê Química is a double-blind peer-review journal dedicated to express views on the covered topics, thereby generating a cross current of ideas on emerging matters
Call for Papers - PROCEEDINGS ON ENGINEERING SCIENCES, P-ISSN-2620-2832, E-IS...Christo Ananth
Proceedings on Engineering Sciences examines new research and development at the engineering. It provides a common forum for both front line engineering as well as pioneering academic research. The journal's multidisciplinary approach draws from such fields as Automation, Automotive engineering, Business, Chemical engineering, Civil engineering, Control and system engineering, Electrical and electronic engineering, Electronics, Environmental engineering, Industrial and manufacturing engineering, Industrial management, Information and communication technology, Management and Accounting, Management and quality studies, Management Science and Operations Research, Materials engineering, Mechanical engineering, Mechanics of Materials, Mining and energy, Safety, Risk, Reliability, and Quality, Software engineering, Surveying and transport, Architecture and urban engineering.
Call for Papers - Onkologia i Radioterapia, P-ISSN-1896-8961, E-ISSN 2449-916...Christo Ananth
Onkologia I Radioterapia is an international peer reviewed journal which publishes on both clinical and pre-clinical research related to cancer. Journal also provide latest information in field of oncology and radiotherapy to both clinical practitioner as well as basic researchers. Submission for publication can be submitted through online submission, Editorial manager system, or through email as attachment to journal office. For any issue, journal office can be contacted through email or phone for instatnt resolution of issue. Onkologia I Radioterapia is a peer-reviewed scopus indexed medical journal publishing original scientific (experimental, clinical, laboratory), review and case studies (case report) in the field of oncology and radiotherapy. In addition, publishes letters to the Editorial Board, reports on scientific conferences, book reviews, as well as announcements about planned congresses and scientific congresses. Oncology and Radiotherapy appear four times a year. All articles published with www.itmedical.pl and www.medicalproject.com.pl is now available on our new website
Call for Papers - Journal of Indian School of Political Economy, E-ISSN 0971-...Christo Ananth
The journal is published every quarter and contains 200 pages in each issue. It is devoted to the study of Indian economy, polity and society. Research papers, review articles, book reviews are published in the journal. All research papers published in the journal are subject to an intensive refereeing process. Each issue of the journal also includes a section on documentation, which reproduces extensive excerpts of relevant reports of committees, working groups, task forces, etc., which may not be readily accessible, official documents compiled from scattered electronic and/or other sources and statistical supplement for ready reference of the readers. It is now in its nineteenth year of publication. So far, five special issues have been brought out, namely: (i) The Scheduled Castes: An Inter-Regional Perspective, (ii) Political Parties and Elections in Indian States : 1990-2003, (iii) Child Labour, (iv) World Trade Organisation Agreements, and (v) Basel-II and Indian Banks
Call for Papers - Journal of Ecohumanism (JoE), ISSN (Print): 2752-6798, ISSN...Christo Ananth
Journal of Ecohumanism is an Open Access international peer-reviewed journal for scholars, researchers, and students who are interested in the fields of Environmental Humanities, Ecohumanism, Ecology, Literary Theory and Cultural Criticism, Economic and Business Studies, Law and Legal Studies in a broad interdisciplinary field of Social Sciences and Humanities. Journal of Ecohumanism is an Open Access peer reviewed journal, allowing users to freely access, download, copy, distribute, print, search, or link to full-text articles for any lawful purpose without requiring permission from the publisher or author. JoE follows a strict double, blind review policy for all the submissions which is embedded in our general publication ethics and supported by rigorous academic scrutiny of papers published. Materials published in the journal do not necessarily represent the views of its editorial board and reviewers
Call for Papers- Journal of Wireless Mobile Networks, Ubiquitous Computing, a...Christo Ananth
JoWUA is an online peer-reviewed journal and aims to provide an international forum for researchers, professionals, and industrial practitioners on all topics related to wireless mobile networks, ubiquitous computing, and their dependable applications. JoWUA consists of high-quality technical manuscripts on advances in the state-of-the-art of wireless mobile networks, ubiquitous computing, and their dependable applications; both theoretical approaches and practical approaches are encouraged to submit. All published articles in JoWUA are freely accessible in this website because it is an open access journal. JoWUA has four issues (March, June, September, December) per year with special issues covering specific research areas by guest editors. The editorial board of JoWUA makes an effort for the increase in the quality of accepted articles compared to other competing journals
Call for Papers - International Journal of Intelligent Systems and Applicatio...Christo Ananth
International Journal of Intelligent Systems and Applications in Engineering (IJISAE) is an international and interdisciplinary journal for both invited and contributed peer reviewed articles that intelligent systems and applications in engineering at all levels. The journal publishes a broad range of papers covering theory and practice in order to facilitate future efforts of individuals and groups involved in the field. IJISAE, a peer-reviewed double-blind refereed journal, publishes original papers featuring innovative and practical technologies related to the design and development of intelligent systems in engineering. Its coverage also includes papers on intelligent systems applications in areas such as nanotechnology, renewable energy, medicine engineering, Aeronautics and Astronautics, mechatronics, industrial manufacturing, bioengineering, agriculture, services, intelligence based automation and appliances, medical robots and robotic rehabilitations, space exploration and etc.
Call for Papers- Special Issue: Recent Trends, Innovations and Sustainable So...Christo Ananth
Energy Systems Modelling is growing in relevance on providing insights and strategies to plan a carbon-neutral future. The implementation of an effective energy transition plan faces multiple challenges, spanning from the integration of the operations of different energy carriers and sectors to the consideration of multiple spatial and temporal resolutions. Demand-side management has to be applied to multi-carrier energy system models lacks; prosumers is explored only in a limited manner; In General, multi-scale modelling frameworks should be established and considered both in the dimensions of time, space, technology and energy carrier; long term energy system models tend to address uncertainty scarcely; there is a lack of studies modelling uncertainties related to emerging technologies and; modelling of energy consumer behaviour is one of the major aspect of future research. The increased pressure in decarbonizing the energy system has renewed the interest in energy system modelling, with several reviews trying to convey a comprehensive description of the utilized methodologies as well as providing new insights on how they can be used to answer new questions
Call for Papers - Educational Administration: Theory and Practice, E-ISSN: 21...Christo Ananth
The Educational Administration: Theory and Practice publishes prominent empirical and conceptual articles focused on timely and critical leadership and policy issues of educational organizations. The journal embraces traditional and emergent research paradigms, methods, and issues. The journal particularly promotes the publication of rigorous and relevant scholarly work that enhances linkages among and utility for educational policy, practice, and research arenas.
The goal of the editorial team and the journal’s editorial board is to promote sound scholarship and a clear and continuing dialogue among scholars and practitioners from a broad spectrum of education. Educational Administration: Theory and Practice presents prominent empirical and conceptual articles focused on timely and critical leadership and policy issues facing educational organizations. As an editorial team, we embrace traditional and emergent theoretical frameworks, research methods, and topics. We particularly promote the publication of rigorous and relevant scholarly work with utility for educational policy, practice, and research.
The journal’s primary focus is on studies of educational leadership, organizations, leadership development, and policy as they relate to elementary and secondary levels of education. Examinations of leadership and policy that fall outside K-12 are considered insofar as there are meaningful connections to the K-12 arena (e.g., college pipeline). International comparative investigations are welcome to the extent they have implications for a broad audience.s.
Bharatiya Shiksha Shodh Patrika is a half yearly refereed UGC care listed journal of Social Sciences Journal of Education. It is a bilingual (Hindi and English) Journal being published regularly since 1982 by Bharatiya Shiksha Shodh Sansthan, Saraswatikunj, Nirala Nagar, Lucknow, Uttar Pradesh, India. Bharatiya Shiksha Shodh Sansthan is an apex Research Institute of Vidya Bharti. The objective of this Journal is to provide an academic forum for Teachers, Teacher Educators, Research Scholars, Policy Makers. Administrators, other Research Workers to encourage original and critical thinking in the field of Education and allied disciplines through presentation of novel ideas, critical appraisal of contemporary educational problems and views and experiences on improved educational practices. However, articles from other disciplines related to contemporary educational issues of relevance may be accepted for publication subject to the approval of the Review Committee.
Call for Papers - African Journal of Biological Sciences, E-ISSN: 2663-2187, ...Christo Ananth
African Journal of Biological Sciences is an International peer-reviewed, Open Access journal that publishes original research articles as well as review articles in all areas of Biological Sciences. It operates a fully open access publishing model which allows open global access to its published content. This model is supported through Article Processing Charges. For more information on Article Processing charges click here. Its scope embraces Animal Sciences, Biochemistry, Bioinformatics, Biotechnology, Botany, Cell Biology, Developmental Biology, Ecology, Environmental Sciences, Ethno Medicine, Food Science, Freshwater Biology, Genetics, Immunology, Marine Biology, Microbiology, Molecular Biology, Physiology, Plant Sciences, Structural Biology,Toxicology,Zoology etc.
It is essential that authors prepare their manuscripts according to established specifications. Failure to follow them may result in papers being delayed or rejected. Therefore, contributors are strongly encouraged to read the author guidelines carefully before preparing a manuscript for submission. The manuscripts should be checked carefully for grammatical, punctuation errors. All papers are subjected to peer review. All articles published in this journal represent the opinion of the authors and not reflect the official policy of the Journal of African Journal of Biological Sciences
Wind Energy Harvesting: Technological Advances and Environmental ImpactsChristo Ananth
Christo Ananth, Rajini K R Karduri, "Wind Energy Harvesting: Technological Advances
and Environmental Impacts", International Journal of Advanced Research in Basic Engineering Sciences and Technology (IJARBEST), Volume 6,Issue 2,February 2020,pp:77-84
Hydrogen Economy: Opportunities and Challenges for a Sustainable FutureChristo Ananth
Christo Ananth, Rajini K R Karduri, "Hydrogen Economy: Opportunities and Challenges
for a Sustainable Future", International Journal of Advanced Research in Basic Engineering Sciences and Technology (IJARBEST), Volume 6,Issue 2,February 2020,pp:69-76
The Economics of Transitioning to Renewable Energy SourcesChristo Ananth
Christo Ananth, Rajini K R Karduri, "The Economics of Transitioning to Renewable Energy Sources", International Journal of Advanced Research in Basic Engineering Sciences and Technology (IJARBEST), Volume 6,Issue 2,February 2020,pp:61-68
Harnessing WebAssembly for Real-time Stateless Streaming PipelinesChristina Lin
Traditionally, dealing with real-time data pipelines has involved significant overhead, even for straightforward tasks like data transformation or masking. However, in this talk, we’ll venture into the dynamic realm of WebAssembly (WASM) and discover how it can revolutionize the creation of stateless streaming pipelines within a Kafka (Redpanda) broker. These pipelines are adept at managing low-latency, high-data-volume scenarios.
6th International Conference on Machine Learning & Applications (CMLA 2024)ClaraZara1
6th International Conference on Machine Learning & Applications (CMLA 2024) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of on Machine Learning & Applications.
Online aptitude test management system project report.pdfKamal Acharya
The purpose of on-line aptitude test system is to take online test in an efficient manner and no time wasting for checking the paper. The main objective of on-line aptitude test system is to efficiently evaluate the candidate thoroughly through a fully automated system that not only saves lot of time but also gives fast results. For students they give papers according to their convenience and time and there is no need of using extra thing like paper, pen etc. This can be used in educational institutions as well as in corporate world. Can be used anywhere any time as it is a web based application (user Location doesn’t matter). No restriction that examiner has to be present when the candidate takes the test.
Every time when lecturers/professors need to conduct examinations they have to sit down think about the questions and then create a whole new set of questions for each and every exam. In some cases the professor may want to give an open book online exam that is the student can take the exam any time anywhere, but the student might have to answer the questions in a limited time period. The professor may want to change the sequence of questions for every student. The problem that a student has is whenever a date for the exam is declared the student has to take it and there is no way he can take it at some other time. This project will create an interface for the examiner to create and store questions in a repository. It will also create an interface for the student to take examinations at his convenience and the questions and/or exams may be timed. Thereby creating an application which can be used by examiners and examinee’s simultaneously.
Examination System is very useful for Teachers/Professors. As in the teaching profession, you are responsible for writing question papers. In the conventional method, you write the question paper on paper, keep question papers separate from answers and all this information you have to keep in a locker to avoid unauthorized access. Using the Examination System you can create a question paper and everything will be written to a single exam file in encrypted format. You can set the General and Administrator password to avoid unauthorized access to your question paper. Every time you start the examination, the program shuffles all the questions and selects them randomly from the database, which reduces the chances of memorizing the questions.
An Approach to Detecting Writing Styles Based on Clustering Techniquesambekarshweta25
An Approach to Detecting Writing Styles Based on Clustering Techniques
Authors:
-Devkinandan Jagtap
-Shweta Ambekar
-Harshit Singh
-Nakul Sharma (Assistant Professor)
Institution:
VIIT Pune, India
Abstract:
This paper proposes a system to differentiate between human-generated and AI-generated texts using stylometric analysis. The system analyzes text files and classifies writing styles by employing various clustering algorithms, such as k-means, k-means++, hierarchical, and DBSCAN. The effectiveness of these algorithms is measured using silhouette scores. The system successfully identifies distinct writing styles within documents, demonstrating its potential for plagiarism detection.
Introduction:
Stylometry, the study of linguistic and structural features in texts, is used for tasks like plagiarism detection, genre separation, and author verification. This paper leverages stylometric analysis to identify different writing styles and improve plagiarism detection methods.
Methodology:
The system includes data collection, preprocessing, feature extraction, dimensional reduction, machine learning models for clustering, and performance comparison using silhouette scores. Feature extraction focuses on lexical features, vocabulary richness, and readability scores. The study uses a small dataset of texts from various authors and employs algorithms like k-means, k-means++, hierarchical clustering, and DBSCAN for clustering.
Results:
Experiments show that the system effectively identifies writing styles, with silhouette scores indicating reasonable to strong clustering when k=2. As the number of clusters increases, the silhouette scores decrease, indicating a drop in accuracy. K-means and k-means++ perform similarly, while hierarchical clustering is less optimized.
Conclusion and Future Work:
The system works well for distinguishing writing styles with two clusters but becomes less accurate as the number of clusters increases. Future research could focus on adding more parameters and optimizing the methodology to improve accuracy with higher cluster values. This system can enhance existing plagiarism detection tools, especially in academic settings.
Hybrid optimization of pumped hydro system and solar- Engr. Abdul-Azeez.pdffxintegritypublishin
Advancements in technology unveil a myriad of electrical and electronic breakthroughs geared towards efficiently harnessing limited resources to meet human energy demands. The optimization of hybrid solar PV panels and pumped hydro energy supply systems plays a pivotal role in utilizing natural resources effectively. This initiative not only benefits humanity but also fosters environmental sustainability. The study investigated the design optimization of these hybrid systems, focusing on understanding solar radiation patterns, identifying geographical influences on solar radiation, formulating a mathematical model for system optimization, and determining the optimal configuration of PV panels and pumped hydro storage. Through a comparative analysis approach and eight weeks of data collection, the study addressed key research questions related to solar radiation patterns and optimal system design. The findings highlighted regions with heightened solar radiation levels, showcasing substantial potential for power generation and emphasizing the system's efficiency. Optimizing system design significantly boosted power generation, promoted renewable energy utilization, and enhanced energy storage capacity. The study underscored the benefits of optimizing hybrid solar PV panels and pumped hydro energy supply systems for sustainable energy usage. Optimizing the design of solar PV panels and pumped hydro energy supply systems as examined across diverse climatic conditions in a developing country, not only enhances power generation but also improves the integration of renewable energy sources and boosts energy storage capacities, particularly beneficial for less economically prosperous regions. Additionally, the study provides valuable insights for advancing energy research in economically viable areas. Recommendations included conducting site-specific assessments, utilizing advanced modeling tools, implementing regular maintenance protocols, and enhancing communication among system components.
KuberTENes Birthday Bash Guadalajara - K8sGPT first impressionsVictor Morales
K8sGPT is a tool that analyzes and diagnoses Kubernetes clusters. This presentation was used to share the requirements and dependencies to deploy K8sGPT in a local environment.
Understanding Inductive Bias in Machine LearningSUTEJAS
This presentation explores the concept of inductive bias in machine learning. It explains how algorithms come with built-in assumptions and preferences that guide the learning process. You'll learn about the different types of inductive bias and how they can impact the performance and generalizability of machine learning models.
The presentation also covers the positive and negative aspects of inductive bias, along with strategies for mitigating potential drawbacks. We'll explore examples of how bias manifests in algorithms like neural networks and decision trees.
By understanding inductive bias, you can gain valuable insights into how machine learning models work and make informed decisions when building and deploying them.
Using recycled concrete aggregates (RCA) for pavements is crucial to achieving sustainability. Implementing RCA for new pavement can minimize carbon footprint, conserve natural resources, reduce harmful emissions, and lower life cycle costs. Compared to natural aggregate (NA), RCA pavement has fewer comprehensive studies and sustainability assessments.
Literature Review Basics and Understanding Reference Management.pptxDr Ramhari Poudyal
Three-day training on academic research focuses on analytical tools at United Technical College, supported by the University Grant Commission, Nepal. 24-26 May 2024
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.
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.
SPLITTING ALGORITHM BASED RELAY NODE SELEC-TION IN WIRELESS NETWORKS
1. Rev. Fac. Agron. (LUZ). 2017, 34: 187-215. Abril-Junio.
ISSN 2477-9407
Esta publicacion cientifica en formato digital es continuacion de la Revista Impresa: Deposito legal pp194802ZU42, ISSN 0378-7818
162
SPLITTING ALGORITHM BASED RELAY NODE SELEC-
TION IN WIRELESS NETWORKS
SPLITTING ALGORITHM BASED SELECCIÓN DE
NODO DE RELÉ EN REDES INALÁMBRICAS
DIVULGAÇÃO DE SELEÇÃO DE NÍVEIS DE RELÉ COM
ALGORITMO EM REDES SEM FIO
Christo Ananth , Joy Winston.J.
Faculty, AMA International University,
Kingdom of Bahrain
ABSTRACT
Helpful correspondence is developing as a standout amongst the most encouraging
procedures in remote systems by reason of giving spatial differing qualities pick up.
The transfer hub (RN) assumes a key part in agreeable correspondences, and RN
choice may generously influence the execution pick up in a system with helpful media
get to control (MAC). The issue of RN determination while considering MAC overhead,
which is acquired by handshake motioning as well as casing retransmissions because
of transmission disappointment also. We plan a helpful MAC system. The current
framework utilizes agreeable MAC system with our ideal RN determination calcula-
tion, which is called ideal transfer choice MAC (ORS-MAC), and utilize a hypothetical
model to break down the participation execution picks up. Be that as it may, it has
transmission delay, less scope range and having crash amid transmission. Organize
coding, which joins a few bundles together for transmission, is exceptionally useful to
decrease the excess at the system and to build the general throughput. In this a novel
system coding mindful helpful MAC convention, to be specific NCAC-MAC is propo-
sed, that picks the hand-off hub utilizing Splitting Algorithm-based Relay Selection.
The plan goal of NCAC-MAC is to build the throughput and lessen the postponement.
Keywords: RN, ORS-MAC, NCAC-MAC.
1 2
1,2
2. RESUMEN
La correspondencia útil se está desarrollando como un destacado entre los procedi-
mientos más alentadores en los sistemas remotos por la razón de la mejora de las
cualidades espaciales. El centro de transferencia (RN) asume una parte clave en
correspondencias agradables, y la elección de RN puede influir generosamente en la
recuperación de la ejecución en un sistema con medios útiles para controlar (MAC). El
problema de la determinación de RN al considerar la sobrecarga de MAC, que se
adquiere mediante el movimiento de la mano al igual que las retransmisiones de la
carcasa debido a la decepción de la transmisión también. Planeamos un sistema MAC
útil. El marco actual utiliza un sistema MAC agradable con nuestro cálculo de deter-
minación de RN ideal, que se llama MAC de opción de transferencia ideal (ORS-
MAC), y utiliza un modelo hipotético para dividir las selecciones de ejecución de parti-
cipación. Sea como fuere, tiene retraso de transmisión, menor rango de alcance y
bloqueo en medio de la transmisión. Organizar la codificación, que une algunos
paquetes para la transmisión, es excepcionalmente útil para disminuir el exceso en el
sistema y para generar el rendimiento general. En este se propone un novedoso
sistema que codifica la convención MAC útil y atenta, para ser específico, NCAC-
MAC, que elige el centro de derivación utilizando la selección de relés basada en
algoritmos de división. El objetivo del plan de NCAC-MAC es construir el rendimiento
y disminuir el aplazamiento.
Palabras clave: RN, ORS-MAC, NCAC-MAC.
ABSTRATO
A correspondência útil está se desenvolvendo como um dos mais encorajadores proce-
dimentos em sistemas remotos, em razão de dar qualidades diferenciadas espaciais.
O hub de transferência (RN) assume uma parte importante em correspondências
agradáveis, e a escolha do RN pode influenciar generosamente a escolha da execução
em um sistema com controle de mídia útil (MAC). A questão da determinação do RN,
considerando a sobrecarga do MAC, que é adquirida por motioning de handshake,
bem como retransmissões de maiúsculas e minúsculas por causa da decepção de
transmissão também. Planejamos um sistema MAC útil. A estrutura atual utiliza um
sistema MAC agradável com nosso cálculo de determinação de RN ideal, que é chama-
do de MAC de escolha de transferência ideal (ORS-MAC), e utiliza um modelo hipoté-
tico para dividir a execução de participação. Seja como for, tem atraso de transmissão,
menor alcance de escopo e queda em meio à transmissão. Organizar a codificação, que
une alguns pacotes para transmissão, é excepcionalmente útil para diminuir o exces-
so no sistema e para construir o rendimento geral. Neste, é proposto um novo sistema
que codifica uma convenção MAC útil e cuidadosa, para ser específico, o NCAC-MAC,
que escolhe o hub hand-off utilizando a Seleção de Relé Baseada em Algoritmo de
Divisão. O objetivo do plano do NCAC-MAC é construir o throughput e diminuir o
adiamento.
Palavras-chave: RN, ORS-MAC, NCAC-MAC.
Rev. Fac. Agron. (LUZ). 2017 34: 162-169. Abril-Junio
Esta publicacion cientifica en formato digital es continuacion de la Revista Impresa: Deposito legal pp194802ZU42, ISSN 0378-7818
163
3. These MAC systems could be alluded to as
auto hand-off choice MAC and bolster
existing participation strategies to acquire
spatial differences. Different from Optimal
Relay Selection Algorithm.
Optimal RN Selection Algorithm When S
needs to transmit data to D
I. EXISTING SYSTEM
A large portion of the current research chip
away at agreeable correspondences is
centered around amplify–forward (AF),
decode–forward (DF), and coded participa-
tion at the physical layer, for example, how
to abatement blackout likelihood and
enhance arrange limit. In any case, in
practical correspondence frameworks, for
example, remote neighborhood (WLANs),
agreeable interchanges ought to be actua-
lized in conjunction with a media get to
control (MAC) system. As it were, helpful
MAC is a characteristic plan to misuse the
advantages of agreeable interchanges.
It is realized that RNs assume a key part
in agreeable interchanges, and in this
manner, the issue of RN choice ought to
deliberately be tended to. Accordingly, as
of late, scientists have additionally exami-
ned helpful MAC components to misuse
the advantages of agreeable corresponden-
ce as a usage in down to earth remote
systems. Some helpful MAC systems are
proposed, and critical execution pick up
has been watched. [2] proposed a helpful
MAC instrument called hand-off Distribu-
ted Coordinate Function (rDCF) in specia-
lly appointed systems, and Liu et al. propo-
sed Cooperative Media Access Control
(CoopMAC) in WLANs.
These MAC systems utilize table-based
RN determination by keeping up a table to
keep collaboration data, for example,
transmission rates at source (S)- to-RN
and RN-to-goal (D) joins. S chooses
whether collaboration is utilized or not and
picks the best RN as indicated by the parti-
cipation data. Their thought for RN deter-
mination is clear: a RN is just chosen if
there is a two-bounce channel superior to
the immediate channel. [3] proposed an
agreeable MAC with programmed hand-off
determination , and [5] proposed a helpful
transfer based autorate MAC convention
for multi rate remote systems.
node RN is selected as the RN, and coope-
ration mode is
adopted
else
direct transmission mode is adopted
end if
For computing T_d and T_c, fundamental
participation data ought to be given. To
this end, every hub ought to keep up a
table called Coop-table that keeps the
helpful collaboration data. There are six
segments in the Coop-table: the ID of
hub, i.e., Gsd, Gsr, Grd, and Pr, and the
tally of successive transmission disappo-
intments of the comparing hub. CSI
(Gsd,Gsr, and Grd) can be gotten by chan-
nel appraise.
As indicated by the handshaking
methodology and catching, every hub can
get Gsd, Gsr, Grd, and Pr and refresh the
Coop-table. Truth be told, the Coop-table
can be kept up in handshaking technique
without much extra overhead, which is
comparative. In this way, the overhead of
the Coop-table has been considered in the
handshaking system.
At the point when any chose RN bombs in
giving collaboration, the relating disappo-
intment tally will be increased by one. At
the point when the disappointment tally
achieves an edge that can be predefined,
the data about this hub will be expelled
from the Cooptable. The disappointment
number will be reset to zero after a
fruitful transmission.
Rev. Fac. Agron. (LUZ). 2017 34: 162-169. Abril-Junio
Esta publicacion cientifica en formato digital es continuacion de la Revista Impresa: Deposito legal pp194802ZU42, ISSN 0378-7818
164
4. To process the throughput, we should deter-
mine pd and pc first. By and large, the
mistake likelihood of the handshake
methodology can be disregarded in view of
the short edge length and low essential
transmission rate, and hence, the transmis-
sion blunder likelihood can be approxima-
ted to be the blunder likelihood of the infor-
mation outline. For effortlessness, we
expect that the remote channel is a
Rayleigh blurring channel with Gaussian
clamor, and bit mistakes are autonomous
indistinguishably disseminated over the
entire casing. Without loss of sweeping
statement, we accept that the adjustment is
parallel stage move keying for effort-
lessness.
The transmission blunder likelihood of the
information outline (with length informa-
tion) at the goal in direct transmission
mode is given by where information b is
meant as the bit mistake rate (BER) of the
information outline, which can be figured as
information γsd is the SNR of the gotten
motion at D sent from S, which can be regis-
tered as γsd = PsGsd/σ2, and σ2 is Gaussian
commotion control. Along these lines, as per
the length of information casing, the trans-
mission blunder likelihood of that can be
acquired.
II. RELAY SELECTION TECHNI-
QUES
In our helpful MAC, a key issue is to figure
out if to utilize agreeable correspondence
and which hub is chosen as the RN. The
response to both inquiries needs to look at
the execution pick up brought by agreeable
correspondence when an alternate RN is
chosen. To this end, we have to infer the
system throughput, considering MAC
overhead and transmission disappo-
intment.
The transmission disappointment is
created by impact and channel transmis-
sion mistake. Since the transmission crash
likelihood is not identified with collabora-
tion, we accept that the transmission
disappointment likelihood is equivalent to
the transmission blunder likelihood in our
proposed ideal RN determination calcula-
tion.
Let the transmission disappointment likeli-
hood for direct transmission and helpful
transmission be signified by pd and pc,
individually. Let the FTT for direct trans-
mission and agreeable transmission be
indicated by FTT_d and FTT_c, individua-
lly.
Considering transmission disappointment,
the throughputs for immediate and agreea-
ble correspondence, which are indicated we
realize that participation could be embra-
ced when T_c > T_d, in light of the fact that
the pick up of diminished transmission
disappointment likelihood can cover the
extra overhead of expanded FTT in collabo-
ration mode. Not the same as existing
helpful MAC components, we select RN by
considering FTT as well as transmission
disappointment likelihood too. This is more
practical in mistake inclined remote
systems.
III. PROPOSED SYSTEM
In this section, we present another efficient
collision free relay selection method, i.e.,
splitting algorithm-based relay selection
strategy, namely SA-RS. In SA-RS, only
those relay nodes whose utility values lie
between two thresholds transmit. And the
threshold is updated in every node indepen-
dently round by round, based on the
feedback (FB) from the destination node.
Rev. Fac. Agron. (LUZ). 2017 34: 162-169. Abril-Junio
Esta publicacion cientifica en formato digital es continuacion de la Revista Impresa: Deposito legal pp194802ZU42, ISSN 0378-7818
165
5. The casing trading procedure of SA-RS is
delineated. At each schedule vacancy, each
hand-off competitor checks its utility
esteem. On the off chance that it lies
between the present two limits, the hub
communicates a Relay Indicator (RI), else,
it keeps quiet. At the point when the
present vacancy closes, the transfer compe-
titors sit tight for the criticism from the
goal hub.
In the event that no criticism is gotten, it
implies that no hand-off hub sends RI at
the present schedule vacancy. Something
else, for the situation that the input is
gotten, FB equivalent to e speaks to an
impact because of various RI edges, and FB
equivalent to 1 speaks to a fruitful hand-off
choice by single RI casing.
The edges are refreshed over and over as
indicated by Algorithm 1, until choosing the
hand-off hub effectively or achieving the
most extreme round number. ETH edge is
sent by the ideal transfer hub, who plays
out the retransmission in the interest of the
source hub.
The part calculation which is used to
conform the edges in SA-RS is initially
proposed. The two limits, i.e., the lower
edge Ul and higher edge Uh are refreshed
intermittently. A hand-off competitor i
sends RI if and just if its utility esteem Ui
fulfills Ul ≤ Ui ≤ Uh. At that point, we
clarify the detail of the Algorithm 1 as
takes after:
Initialize the thresholds. Here, FU(u)=Pr(U
> u) denotes the complimentary cumulative
distribution function (CCDF) of the utility.
At the first time slot, the thresholds are
initialized as Ul = F_U^(-1)(1/n) and Uh =∞
1, so that the probability that one node’s
utility value is above Ul is 1=n. Note that n
is the number of relay candidates that can
be obtained by the connectivity table. This
setting minimizes the probability of a
collision in the first round. And Ull tracks
the largest utility value known up to the
current round.
Let m denotes the value of the feedback,
which indicates the time slot was idle (0),
collision (e), or success (1). And k and K are
the number of time slots used so far and the
maximum time slots, respectively.
If a collision occurs (m = e), the range (Ul,
Uh) splits into two parts by function split()
given as
The nodes in the upper part send RI in the
next time slot.
If the time slot is idle (m = 0) and there has
been a collision before (Ull ≠ 0), the best
utility value lies between (Ull, Ul). Thus,
we split it into two parts again, the nodes
lie in the upper part send RI in the next
time slot.
If the time slot is idle (m = 0) but there has
never been a collision before (Ull= 0), all the
nodes’ utility values are below Ul. Therefo-
re, we lower the Ul using function lower()
given as
The algorithm ends when the outcome is a
success (m = 1) or it reaches the maximum
time slot (k > K). The best relay node can
be found within 2.5 time slots on average.
Thus, the average time consumed in relay
selection process by SA-RS is 2 × 2:5 ×η+ 5
× SIFS, where η denotes the time slot. This
time consists of the time consumed by RI
and the corresponding FB, and the SIFS
time between them. For a comparison, the
average time consumed on the best relay
selection by GCRS is (G/2+ M/2 + 1) × η+ 2
× SIFS (here, we take an optimistic calcu-
lation without considering the reconten-
tion, since it occurs with very low probabi-
lity). G/2and M/2 denote the average
number of slots that inter- and intracon-
tentions need, and 1 denotes the additio-
nal time slot for FB1.Using the parameter
setting, we can observe that the average
time on relay selection by GC-RS (4,816µs)
is longer than the one by SA-RS (2,940µs).
Rev. Fac. Agron. (LUZ). 2017 34: 162-169. Abril-Junio
Esta publicacion cientifica en formato digital es continuacion de la Revista Impresa: Deposito legal pp194802ZU42, ISSN 0378-7818
166
6. Besides comparison of the time consump
tion on relay selection, we also compare the
transmission overhead between GC-RS and
SA-RS.
The average number of additional commu-
nication frames is 3 (GI, MI and FB1) by
GC-RS, and 5 (RI and FB in every round,
2.5 rounds on average) by SA-RS. The
additional communication overheads by
GC-RS are less than the one by SA-RS.
Utilizing GC-RS or SA-RS into NCAC-
MAC, the best relay node can be selected in
a collision free fashion. However, the
avoidance of the collision is achieved at the
cost of frame exchanging overhead.
IV. SIMULATION RESULTS
To verify our analytical model and validate
the performance improvement of the propo-
sed cooperative MAC mechanism, we use
simulation experiments based on NS-2 to
evaluate the throughput performance.
Rev. Fac. Agron. (LUZ). 2017 34: 162-169. Abril-Junio
Esta publicacion cientifica en formato digital es continuacion de la Revista Impresa: Deposito legal pp194802ZU42, ISSN 0378-7818
167
7. REFERENCES
[1]Xiaoyan Wang, Student Member,
IEEE, Jie Li, Senior Member, IEEE, and
Feilong Tang “Network Coding Aware
Cooperative MAC Protocol for Wireless
Ad Hoc Networks” IEEE TRANSAC-
TIONS ON PARALLEL AND DISTRIBU-
TED SYSTEMS, VOL. 25, NO. 1,
JANUARY 2014
[2] H. Adam, W. Elmenreich, C. Bettstet-
ter, and S.M. Senouci, “CoRe-MAC: A
MAC-Protocol for Cooperative Relaying in
Wireless Networks,” Proc. IEEE Globe-
com, pp. 1-6, Dec. 2009.
[3] R. Ahlswede, N. Cai, S. Li, and R.
Yeung, “Network Information Flow,”
IEEE Trans. Information Theory, vol. 46,
no. 4, pp. 1204-1216,July 2000.
[4] J. Alonso-Za’rate, E. Kartsakli, C.
Verikoukis, and L. Alonso,“Persistent
RCSMA: A MAC Protocol for a Distribu-
ted Cooperative ARQ Scheme in Wireless
Networks,” EURASIP J. Advances in
Signal Processing, vol. 2008, May 2008.
[5] X. Bao and J. Li, “Adaptive Network
Coded Cooperation (ANCC) for Wireless
Relay Networks: Matching Code-on-
Graph with Network-on-Graph,” IEEE
Trans. Wireless Comm., vol. 7, no. 2,pp.
574-583, Feb. 2008.
BIOGRAPHY
Christo Ananth got his B.E. Degree in
Electronics and Communication Enginee-
ring in 2009 and his M.E. Degree in
Applied Electronics in 2013. He received
his PhD Degree in Engineering in 2017.
He completed his Post Doctoral Research
work in Co-operative Networks in 2018.
Christo Ananth has almost 9 years of
involvement in research, instructing,
counseling and down to earth application
improvement. His exploration skill covers
Image Processing, Co-operative Networ-
ks, Electromagnetic Fields, Electronic
Devices, Wireless Networks and Medical
Electronics. He has taken an interest and
presented 3 papers in National level
V. CONCLUSION
In this, a system coding mindful agreeable
medium get to control convention, specifi-
cally NCAC-MAC, for remote sensor
systems is exhibited. By presenting
NCAC-MAC, the benefits of both NC and
CC can be abused. This plan additionally
proposes a system coding mindful utility-
based hand-off determination procedure,
to pick the best hand-off in a productive
and conveyed way. Likewise, with the
motivation behind stay away from impact
this plan fused into the crash free hand-off
choice technique called SA-RS into
NCAC-MAC. The NCACMAC can conside-
rably enhance the throughput, deferral,
and PDR, contrasting and IEEE 802.11
CSMA and Phoenix.
VI. SCOPE FOR FUTURE
ENHANCEMENT
In a future work, we will research the
NCAC-MAC for bigger scale organize
estimate, and consider the effective
answer for the stored issue in a system
with high portability. It is additionally a
promising future work to build up a
system coding mindful helpful MAC
convention in light of multichannel
168
Rev. Fac. Agron. (LUZ). 2017 34: 162-169. Abril-Junio
Esta publicacion cientifica en formato digital es continuacion de la Revista Impresa: Deposito legal pp194802ZU42, ISSN 0378-7818
8. 169
.
Technical Symposiums, 9 Research
papers in National Level Conferences, 31
Research Papers in International level
Conferences, 56 Research Papers in
refereed and indexed International
Journals in the field of Embedded
Systems, Networking, Digital Image
Processing, Network Security and VLSI.
He has attended 14 Technical
Seminars/Training Courses/Faculty
Development Programs. He has contribu-
ted 25 Dissertations / Thesis / Technical
Reports in International Publication
Houses, 20 International Book Chapters
in USA and has authored & published 4
National-level Engineering Text books
and authored 3 International-level Engi-
neering text books. He has published 10
Monographs in Reputed International
Journals. He is a beneficiary of Special
note in 6 Engineering Text books associa-
ted to Anna University,Chennai. He is
the recipient of 15 Honours & Best Facul-
ty Awards including “Best Knowledge
Exchange/Transfer Initiative Of The
Year- 2017”, “Engineering Leadership
Award”, “Young Scientist Award – 2017”,
“Sir James Prescott Joule Award”, “Outs-
tanding Digital Innovator Award – 2017”,
“2018 Albert Nelson Marquis Lifetime
Achievement Award”, “Exemplary Infor-
mation And Communication Engineer
Award” and “Green Peace Award – 2017”
for his Excellence in Engineering Educa-
tion.
At present, he is a member of 140 Profes-
sional Bodies over the globe. He is a
Biographical World Record Holder of
Marquis' Who’s Who in the World
(32nd,33rd and 34th Edition) for his
exceptional commitment towards explore
group from 2015-2017. He has conveyed
Guest Lectures in Reputed Engineering
Colleges and Reputed Industries on
different themes. He has earned 4 Best
Paper Awards from different instruction
related social exercises in and outside
India. He has organized nearly 19
self-supporting National level Technical
Symposiums, Conferences and Works-
hops in the field of Embedded Systems,
Networking, Digital Image Processing,
Network Security, VLSI, Biotechnology,
Management and Architecture. He is a
Technical Advisory Board member of
nearly 90 National Level/International
Level Technical Conferences over the
globe. He is serving as Editorial board
member/Reviewer of 381
SCI/ISI/Scopus/Web of Science indexed
International Journals and 155 Refereed,
Indexed and Reputed International
Journals. He has set up about 87 MOUs
as Chief with Educational Institutions
over the globe. He is chosen as an elected
fellow from ISECE (Malaysia) and a Life
Member from ISTE (India).
Rev. Fac. Agron. (LUZ). 2017 34: 162-169. Abril-Junio
Esta publicacion cientifica en formato digital es continuacion de la Revista Impresa: Deposito legal pp194802ZU42, ISSN 0378-7818