This document summarizes a research paper that proposes a new algorithm for calculating TCP timeout over wireless ad hoc networks. The current TCP timeout calculation does not adapt well to the unstable nature of wireless networks where factors like node mobility can cause estimated round trip times to vary greatly. The proposed algorithm aims to make timeout calculation more adaptive to network conditions in wireless ad hoc networks to improve TCP performance and quality of service for real-time multimedia applications. It describes challenges with existing TCP timeout approaches over wireless networks and reviews related literature before introducing the novel algorithm developed and tested through simulation.
Congestion control in packet switched wide area networks using a feedback modelijcses
In a complex world, where networking expands very rapidly, the network stability of flow of bandwidth
played a vital role in transmitting packets. Hence, it was imperative to find solution to the problem of
congestion especially in the follow of bandwidth stability.
Congestion in computer networking is caused by so many factors. Some of the signs are packet loss,
queuing delay resulting from overloading the buffer, faulty hardware devices, intermixing of old and new
technologies and unstable flow of bandwidth resulting from positive feedback
PERFORMANCE EVALUATION OF SELECTED E2E TCP CONGESTION CONTROL MECHANISM OVER ...ijwmn
TCP is one of the main protocols that govern the Internet traffic nowadays. However, it suffers significant
performance degradation over wireless links. Since wireless networks are leading the communication
technologies recently, it is imperative to introduce effective solutions for the TCP congestion control
mechanisms over such networks. In this research four End-to-End TCP implementations are discussed,
they are TCP Westwood, Hybla, Highspeed, and NewReno. The performance of these variants is compared
using LTE emulated environment in terms of throughput, delay, and fairness. Ns-3 simulator is used to
simulate the LTE networks environment. The simulation results showed that TCP Highspeed achieves the
best throughput results. Although TCP Westwood recorded the lowest latency values comparing to others,
it behaved unfairly among different traffic flows. Moreover, TCP Hybla demonstrated the best fairness
behaviour among other TCP variants
Improving QoS-based Routing by Limiting Interference in Lossy Wireless Sensor...ijwmn
Many new routing protocols have been proposed for wireless sensor networks to maximize throughput, minimize delay or improve other QoS metrics in order to solve the problems of resource-constrained sensor nodes in large networks. However, many of them are based on flooding or its variants. Many routing messages are propagated unnecessarily and may cause different interference characteristics during route discovery phase and in the actual application data transmission phase. As a result, incorrect routes may be selected. Epidemic algorithms have been used to limit flooding in the field of wireless sensor networks. Directed diffusion has been commonly used in wireless sensor networks because it is designed to improve energy efficiency and scalability. However, the intrinsic flooding scheme for interest subscriptions prevents it from achieving the maximal potential of these two goals. We propose a routing
protocol that uses ID-free epidemic flooding to limit interference in conjunction with metrics for increasing throughput and reducing delay. Simulation results in ns2 show that there is an optimal number of neighbors to achieve the best throughput and delay performance. For a fixed topology of a certain size, there exists an optimal percentage of neighbors that forward the flooding message to achieve the best throughput and delay performance.
A Low Overhead Reachability Guaranteed Dynamic Route Discovery Mechanism for ...ijasuc
A crucial issue for a mobile ad hoc network is the handling of a large number of nodes. As more nodes join
the mobile ad hoc network, contention and congestion are more likely. The on demand routing protocols
which broadcasts control packets to discover routes to the destination nodes, generate a high number of
broadcast packets in a larger networks causing contention and collision. We propose an efficient route
discovery protocol, which reduces the number of broadcast packet, using controlled flooding technique.
The simulation results show that the proposed probabilistic flooding decreases the number of control
packets floating in the network during route discovery phase, without lowering the success ratio of path
discoveries. Furthermore, the proposed method adapts to the normal network conditions. The results show
that up to 70% of control packet traffic is saved in route discovery phase when the network is denser.
Reduce the probability of blocking for handoff and calls in cellular systems ...TELKOMNIKA JOURNAL
In cellular systems the high probability of blocking represents a big problem for users, the proposed solution by reducing the blocking probability and investigation cellular systems by method channels assignment. The aim from apaper is studying the effect the channel assignment on the value of blocking probability. The results showed that the fixe channeld assignment gives a large probability of blocking for high loads, while (FCA) reduce probability of blocking for handoff and calls according to cluster size. The cellular system representation in the case of (DCA), in (3-cell reuse) and (7-cell reuse), the results showed the first best way to reduce blocking probability and lead to reduce to approximately zero when loads that are less than 200%. Increasing the cluster size causes to reduce blocking probability. The results showed that the probability blocking for handoff less than from probability of blocking for new calls.
A QUALITY OF SERVICE ARCHITECTURE FOR RESOURCE PROVISIONING AND RATE CONTROL ...ijasuc
Prioritized flow control is a type of QoS provisioning in which each class is provided a different QoS by
assigning priority to one class over another in terms of allocating resources. It is an effective means to
provide service differentiation to different class of service in mobile ad hoc networks. So the objective is to
achieve a desired level of service to high-priority flows so that the wireless medium is completely utilized
using adaptive rate control. In this paper, we propose to design QoS architecture for Bandwidth
Management and Rate Control in MANET. Our proposed QoS architecture contains an adaptive
bandwidth management technique which measures the available bandwidth at each node in real-time and
it is then propagated on demand by the QoS routing protocol. The source nodes perform call admission
control for different priority of flows based on the bandwidth information provided by the QoS routing.
The network bandwidth utilization is monitored continuously and network congestion is detected in
advance. Then a rate control mechanism is used to regulate best-effort traffic.
Congestion control in packet switched wide area networks using a feedback modelijcses
In a complex world, where networking expands very rapidly, the network stability of flow of bandwidth
played a vital role in transmitting packets. Hence, it was imperative to find solution to the problem of
congestion especially in the follow of bandwidth stability.
Congestion in computer networking is caused by so many factors. Some of the signs are packet loss,
queuing delay resulting from overloading the buffer, faulty hardware devices, intermixing of old and new
technologies and unstable flow of bandwidth resulting from positive feedback
PERFORMANCE EVALUATION OF SELECTED E2E TCP CONGESTION CONTROL MECHANISM OVER ...ijwmn
TCP is one of the main protocols that govern the Internet traffic nowadays. However, it suffers significant
performance degradation over wireless links. Since wireless networks are leading the communication
technologies recently, it is imperative to introduce effective solutions for the TCP congestion control
mechanisms over such networks. In this research four End-to-End TCP implementations are discussed,
they are TCP Westwood, Hybla, Highspeed, and NewReno. The performance of these variants is compared
using LTE emulated environment in terms of throughput, delay, and fairness. Ns-3 simulator is used to
simulate the LTE networks environment. The simulation results showed that TCP Highspeed achieves the
best throughput results. Although TCP Westwood recorded the lowest latency values comparing to others,
it behaved unfairly among different traffic flows. Moreover, TCP Hybla demonstrated the best fairness
behaviour among other TCP variants
Improving QoS-based Routing by Limiting Interference in Lossy Wireless Sensor...ijwmn
Many new routing protocols have been proposed for wireless sensor networks to maximize throughput, minimize delay or improve other QoS metrics in order to solve the problems of resource-constrained sensor nodes in large networks. However, many of them are based on flooding or its variants. Many routing messages are propagated unnecessarily and may cause different interference characteristics during route discovery phase and in the actual application data transmission phase. As a result, incorrect routes may be selected. Epidemic algorithms have been used to limit flooding in the field of wireless sensor networks. Directed diffusion has been commonly used in wireless sensor networks because it is designed to improve energy efficiency and scalability. However, the intrinsic flooding scheme for interest subscriptions prevents it from achieving the maximal potential of these two goals. We propose a routing
protocol that uses ID-free epidemic flooding to limit interference in conjunction with metrics for increasing throughput and reducing delay. Simulation results in ns2 show that there is an optimal number of neighbors to achieve the best throughput and delay performance. For a fixed topology of a certain size, there exists an optimal percentage of neighbors that forward the flooding message to achieve the best throughput and delay performance.
A Low Overhead Reachability Guaranteed Dynamic Route Discovery Mechanism for ...ijasuc
A crucial issue for a mobile ad hoc network is the handling of a large number of nodes. As more nodes join
the mobile ad hoc network, contention and congestion are more likely. The on demand routing protocols
which broadcasts control packets to discover routes to the destination nodes, generate a high number of
broadcast packets in a larger networks causing contention and collision. We propose an efficient route
discovery protocol, which reduces the number of broadcast packet, using controlled flooding technique.
The simulation results show that the proposed probabilistic flooding decreases the number of control
packets floating in the network during route discovery phase, without lowering the success ratio of path
discoveries. Furthermore, the proposed method adapts to the normal network conditions. The results show
that up to 70% of control packet traffic is saved in route discovery phase when the network is denser.
Reduce the probability of blocking for handoff and calls in cellular systems ...TELKOMNIKA JOURNAL
In cellular systems the high probability of blocking represents a big problem for users, the proposed solution by reducing the blocking probability and investigation cellular systems by method channels assignment. The aim from apaper is studying the effect the channel assignment on the value of blocking probability. The results showed that the fixe channeld assignment gives a large probability of blocking for high loads, while (FCA) reduce probability of blocking for handoff and calls according to cluster size. The cellular system representation in the case of (DCA), in (3-cell reuse) and (7-cell reuse), the results showed the first best way to reduce blocking probability and lead to reduce to approximately zero when loads that are less than 200%. Increasing the cluster size causes to reduce blocking probability. The results showed that the probability blocking for handoff less than from probability of blocking for new calls.
A QUALITY OF SERVICE ARCHITECTURE FOR RESOURCE PROVISIONING AND RATE CONTROL ...ijasuc
Prioritized flow control is a type of QoS provisioning in which each class is provided a different QoS by
assigning priority to one class over another in terms of allocating resources. It is an effective means to
provide service differentiation to different class of service in mobile ad hoc networks. So the objective is to
achieve a desired level of service to high-priority flows so that the wireless medium is completely utilized
using adaptive rate control. In this paper, we propose to design QoS architecture for Bandwidth
Management and Rate Control in MANET. Our proposed QoS architecture contains an adaptive
bandwidth management technique which measures the available bandwidth at each node in real-time and
it is then propagated on demand by the QoS routing protocol. The source nodes perform call admission
control for different priority of flows based on the bandwidth information provided by the QoS routing.
The network bandwidth utilization is monitored continuously and network congestion is detected in
advance. Then a rate control mechanism is used to regulate best-effort traffic.
Congestion Control in Wireless Sensor Networks- An overview of Current TrendsEditor IJCATR
In WSN congestion occurs when traffic load exceeds the capacity available at any point in a network. Congestion
acts an important role in degrading the performance of the network or failure of the network. So it is essential to detect and
control the congestion in the entire WSN. Thus one can improve the performance of the network. Different factors are involved
in the congestion; the main factor is buffer over flow, packet loss, lowers network throughput and energy wastage. To address
this challenge this is essential for a distributed algorithm that mitigate congestion and allocate appropriate source rate to a sink
node for wireless sensor network. This paper gives some ideas how to control and manage the congestion in a wireless sensor
network.
Improving data transmission in the vanet using multi criteria decision making...ijfcstjournal
In vehicular ad
-
hoc networks the packets are sent using multi
-
hop methods and the receiving limit of a
message is gradually extended, but the exponential increment of the number of nodes re
-
broadcasting a
message results in broadcast storm problem in data
broadcasting in this case. Some characteristics like
high speed of nodes, rapid topological changes and repetitive discontinuities have made it difficult
to
design an efficient broadcasting protocol for these networks.
We have offered a novel fuzzy method
based on multi
-
criteria decision
-
making (MCDM) for prioritizing the
vehicles in selection of the most proper neighbor to broadcast data in this paper. With using this f
uzzy
method, the most proper vehicles participate in data broadcasting. The results of
simulation using NS show
that because of selecting the neighboring vehicles with high priority in data broadcasting, the spee
d of
sending the packs is increased and the network load is considerably decreased. This method also
considerably decreases broadca
sting traffic.
Token Based Packet Loss Control Mechanism for NetworksIJMER
International Journal of Modern Engineering Research (IJMER) is Peer reviewed, online Journal. It serves as an international archival forum of scholarly research related to engineering and science education.
International Journal of Modern Engineering Research (IJMER) covers all the fields of engineering and science: Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Computer Engineering, Agricultural Engineering, Aerospace Engineering, Thermodynamics, Structural Engineering, Control Engineering, Robotics, Mechatronics, Fluid Mechanics, Nanotechnology, Simulators, Web-based Learning, Remote Laboratories, Engineering Design Methods, Education Research, Students' Satisfaction and Motivation, Global Projects, and Assessment…. And many more.
A dynamic performance-based_flow_controlingenioustech
Dear Students
Ingenious techno Solution offers an expertise guidance on you Final Year IEEE & Non- IEEE Projects on the following domain
JAVA
.NET
EMBEDDED SYSTEMS
ROBOTICS
MECHANICAL
MATLAB etc
For further details contact us:
enquiry@ingenioustech.in
044-42046028 or 8428302179.
Ingenious Techno Solution
#241/85, 4th floor
Rangarajapuram main road,
Kodambakkam (Power House)
http://www.ingenioustech.in/
Efficient and Fair Bandwidth Allocation AQM Scheme for Wireless NetworksCSCJournals
Heterogeneous Wireless Networks are considered nowadays as one of the potential areas in research and development. The traffic management’s schemes that have been used at the fusion points between the different wireless networks are classical and conventional. This paper is focused on developing a novel scheme to overcome the problem of traffic congestion in the fusion point router interconnected the heterogeneous wireless networks. The paper proposed an EF-AQM algorithm which provides an efficient and fair allocation of bandwidth among different established flows. Finally, the proposed scheme developed, tested and validated through a set of experiments to demonstrate the relative merits and capabilities of a proposed scheme
Throughput Performance Analysis VOIP over LTEiosrjce
IOSR Journal of Electronics and Communication Engineering(IOSR-JECE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of electronics and communication engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in electronics and communication engineering. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Qo s oriented distributed routing protocols : anna university 2nd review pptAAKASH S
To find a QoS path between source and destination, Which satisfies
The QoS requirements for each admitted connection and
Optimizes the use of network resources
Quality encompasses the data loss, latency, jitter, efficient use of network resources,..
QoS mechanisms for unfairness: managing queuing behavior, shaping traffic, control admission, routing, …
Usually, a hybrid network has widespread base stations
The data transmission in hybrid networks has two features:
An AP can be a source or a destination to any mobile node
It allows a stream to have anycast transmission along multiple transmission paths to its destination through base stations
The number of transmission hops between a mobile node and an AP is small
It enables a source node to connect to an AP through an intermediate node
In this paper introduce the QoS-Oriented Distributed routing protocol(QOD)
This QOD protocol makes five contributions:
QoS-guaranteed neighbor selection algorithm
Distributed packet scheduling algorithm
Mobility-based segment resizing algorithm
Soft-deadline based forwarding scheduling algorithm
Data redundancy elimination based transmission
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.
To find a QoS path between source and destination, Which satisfies
The QoS requirements for each admitted connection and
Optimizes the use of network resources
Quality encompasses the data loss, latency, jitter, efficient use of network resources,..
QoS mechanisms for unfairness: managing queuing behavior, shaping traffic, control admission, routing, …
Usually, a hybrid network has widespread base stations
The data transmission in hybrid networks has two features:
An AP can be a source or a destination to any mobile node
It allows a stream to have anycast transmission along multiple transmission paths to its destination through base stations
The number of transmission hops between a mobile node and an AP is small
It enables a source node to connect to an AP through an intermediate node
Performance assessment of VoIP service over different handover mechanisms in ...IJECEIAES
Many researchers have discussed various topics in universal mobile telecommunication system (UMTS) networks: the process of switching from one cell to another for the subscriber and the impact of the quality of the connection during the transition process, quality of services (QoS), the quality of the uplink and downlink carrier line, the various types of code for the voice transmitted through the Internet, especially the research that discussed voice over internet protocol (VoIP) technology as voice travels from cell to cell in mobile networks, depending on the type of delivery. In this paper, a proposed scenario of a UMTS network was implemented to evaluate the multicellular VoIP movement; the proposed UMTS network was simulated using the OPNET 14.5 simulator. The calculation and analysis of the different parameters of the user while moving from one cell to another with different movement speeds considered, the best mean opinion score (MOS) value (3.19) registered for the scenario (soft handover) comparing with another type of handover (3.00).
Two-level scheduling scheme for integrated 4G-WLAN network IJECEIAES
In this paper, a novel scheduling scheme for the Fourth Generation (4G)-Wireless Local Area Network (WLAN) network is proposed to ensure that end to end traffic transaction is provisioned seamlessly. The scheduling scheme is divided into two stages; in stage one, traffic is separated into Actual Time Traffic (ATT) and Non-Actual-Time Traffic (NATT), while in stage two, complex queuing strategy is performed. In stage one, Class-Based Queuing (CBQ) and Deficit Round Robin(DRR) are used for NATT and ATT applications, respectively to separate and forward traffic themselves according to source requirements. Whereas in the stage, two Control Priority Queuing (CPQ) is used to assign each class the appropriate priority level. Evaluation of the performance of the integrated network was done according to several metrics such as end-to-end delay, jitter, packet loss, and network’s throughput. Results demonstrate major improvements for AT services with minor degradation on NAT applications after implementing the new scheduling scheme.
Device to Device Communications will enable on cellular 4G/5G networks soon, There are many research aspects in D2D Communications,
Mode Selection
Network Coding
MIMO
Multi-Hop
the most complicated Interference scenarios are coming
AN OPTIMAL FUZZY LOGIC SYSTEM FOR A NONLINEAR DYNAMIC SYSTEM USING A FUZZY BA...IJCNCJournal
The impetus for this paper is the development of Fuzzy Basis Function “FBF” that assigns in an optimal fashion, a function approximation for a nonlinear dynamic system. A fuzzy basis function is applied to find the best location of the characteristic points by specifying the set of fuzzy rules. The advantage of this technique is that, it may produce a simple and well-performing system because it selects the most significant fuzzy basis functions to minimize an objective function in the output error for the fuzzy rules. The fuzzy basis function is a linguistic fuzzy IF_THEN rule. It provides a combination of the numerical information and the linguistic information in the form input-output pairs and in the form of fuzzy rules. The proposed control scheme is applied to a magnetic ball suspension system.
Adhoc mobile wireless network enhancement based on cisco devicesIJCNCJournal
Adhoc wireless networks become one of the most researchable areas in the studying of routing protocols depending on the Open System Interconnection (OSI Model). This paper use Cisco devices as a reference to enhance the performance of the network. This enhancement will be due to high processing, reliability, average cost, power consumption and accessibility. The aim of this research not only to get the cost down, it also to choose a time to time device to process the data as rapid as it can. Using NAT, Access List and DHCP protocols defined in Cisco (Graphical Unit Interface) GUI of the (Command Line Interface) CLI, the task can be made.
Congestion Control in Wireless Sensor Networks- An overview of Current TrendsEditor IJCATR
In WSN congestion occurs when traffic load exceeds the capacity available at any point in a network. Congestion
acts an important role in degrading the performance of the network or failure of the network. So it is essential to detect and
control the congestion in the entire WSN. Thus one can improve the performance of the network. Different factors are involved
in the congestion; the main factor is buffer over flow, packet loss, lowers network throughput and energy wastage. To address
this challenge this is essential for a distributed algorithm that mitigate congestion and allocate appropriate source rate to a sink
node for wireless sensor network. This paper gives some ideas how to control and manage the congestion in a wireless sensor
network.
Improving data transmission in the vanet using multi criteria decision making...ijfcstjournal
In vehicular ad
-
hoc networks the packets are sent using multi
-
hop methods and the receiving limit of a
message is gradually extended, but the exponential increment of the number of nodes re
-
broadcasting a
message results in broadcast storm problem in data
broadcasting in this case. Some characteristics like
high speed of nodes, rapid topological changes and repetitive discontinuities have made it difficult
to
design an efficient broadcasting protocol for these networks.
We have offered a novel fuzzy method
based on multi
-
criteria decision
-
making (MCDM) for prioritizing the
vehicles in selection of the most proper neighbor to broadcast data in this paper. With using this f
uzzy
method, the most proper vehicles participate in data broadcasting. The results of
simulation using NS show
that because of selecting the neighboring vehicles with high priority in data broadcasting, the spee
d of
sending the packs is increased and the network load is considerably decreased. This method also
considerably decreases broadca
sting traffic.
Token Based Packet Loss Control Mechanism for NetworksIJMER
International Journal of Modern Engineering Research (IJMER) is Peer reviewed, online Journal. It serves as an international archival forum of scholarly research related to engineering and science education.
International Journal of Modern Engineering Research (IJMER) covers all the fields of engineering and science: Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Computer Engineering, Agricultural Engineering, Aerospace Engineering, Thermodynamics, Structural Engineering, Control Engineering, Robotics, Mechatronics, Fluid Mechanics, Nanotechnology, Simulators, Web-based Learning, Remote Laboratories, Engineering Design Methods, Education Research, Students' Satisfaction and Motivation, Global Projects, and Assessment…. And many more.
A dynamic performance-based_flow_controlingenioustech
Dear Students
Ingenious techno Solution offers an expertise guidance on you Final Year IEEE & Non- IEEE Projects on the following domain
JAVA
.NET
EMBEDDED SYSTEMS
ROBOTICS
MECHANICAL
MATLAB etc
For further details contact us:
enquiry@ingenioustech.in
044-42046028 or 8428302179.
Ingenious Techno Solution
#241/85, 4th floor
Rangarajapuram main road,
Kodambakkam (Power House)
http://www.ingenioustech.in/
Efficient and Fair Bandwidth Allocation AQM Scheme for Wireless NetworksCSCJournals
Heterogeneous Wireless Networks are considered nowadays as one of the potential areas in research and development. The traffic management’s schemes that have been used at the fusion points between the different wireless networks are classical and conventional. This paper is focused on developing a novel scheme to overcome the problem of traffic congestion in the fusion point router interconnected the heterogeneous wireless networks. The paper proposed an EF-AQM algorithm which provides an efficient and fair allocation of bandwidth among different established flows. Finally, the proposed scheme developed, tested and validated through a set of experiments to demonstrate the relative merits and capabilities of a proposed scheme
Throughput Performance Analysis VOIP over LTEiosrjce
IOSR Journal of Electronics and Communication Engineering(IOSR-JECE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of electronics and communication engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in electronics and communication engineering. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Qo s oriented distributed routing protocols : anna university 2nd review pptAAKASH S
To find a QoS path between source and destination, Which satisfies
The QoS requirements for each admitted connection and
Optimizes the use of network resources
Quality encompasses the data loss, latency, jitter, efficient use of network resources,..
QoS mechanisms for unfairness: managing queuing behavior, shaping traffic, control admission, routing, …
Usually, a hybrid network has widespread base stations
The data transmission in hybrid networks has two features:
An AP can be a source or a destination to any mobile node
It allows a stream to have anycast transmission along multiple transmission paths to its destination through base stations
The number of transmission hops between a mobile node and an AP is small
It enables a source node to connect to an AP through an intermediate node
In this paper introduce the QoS-Oriented Distributed routing protocol(QOD)
This QOD protocol makes five contributions:
QoS-guaranteed neighbor selection algorithm
Distributed packet scheduling algorithm
Mobility-based segment resizing algorithm
Soft-deadline based forwarding scheduling algorithm
Data redundancy elimination based transmission
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.
To find a QoS path between source and destination, Which satisfies
The QoS requirements for each admitted connection and
Optimizes the use of network resources
Quality encompasses the data loss, latency, jitter, efficient use of network resources,..
QoS mechanisms for unfairness: managing queuing behavior, shaping traffic, control admission, routing, …
Usually, a hybrid network has widespread base stations
The data transmission in hybrid networks has two features:
An AP can be a source or a destination to any mobile node
It allows a stream to have anycast transmission along multiple transmission paths to its destination through base stations
The number of transmission hops between a mobile node and an AP is small
It enables a source node to connect to an AP through an intermediate node
Performance assessment of VoIP service over different handover mechanisms in ...IJECEIAES
Many researchers have discussed various topics in universal mobile telecommunication system (UMTS) networks: the process of switching from one cell to another for the subscriber and the impact of the quality of the connection during the transition process, quality of services (QoS), the quality of the uplink and downlink carrier line, the various types of code for the voice transmitted through the Internet, especially the research that discussed voice over internet protocol (VoIP) technology as voice travels from cell to cell in mobile networks, depending on the type of delivery. In this paper, a proposed scenario of a UMTS network was implemented to evaluate the multicellular VoIP movement; the proposed UMTS network was simulated using the OPNET 14.5 simulator. The calculation and analysis of the different parameters of the user while moving from one cell to another with different movement speeds considered, the best mean opinion score (MOS) value (3.19) registered for the scenario (soft handover) comparing with another type of handover (3.00).
Two-level scheduling scheme for integrated 4G-WLAN network IJECEIAES
In this paper, a novel scheduling scheme for the Fourth Generation (4G)-Wireless Local Area Network (WLAN) network is proposed to ensure that end to end traffic transaction is provisioned seamlessly. The scheduling scheme is divided into two stages; in stage one, traffic is separated into Actual Time Traffic (ATT) and Non-Actual-Time Traffic (NATT), while in stage two, complex queuing strategy is performed. In stage one, Class-Based Queuing (CBQ) and Deficit Round Robin(DRR) are used for NATT and ATT applications, respectively to separate and forward traffic themselves according to source requirements. Whereas in the stage, two Control Priority Queuing (CPQ) is used to assign each class the appropriate priority level. Evaluation of the performance of the integrated network was done according to several metrics such as end-to-end delay, jitter, packet loss, and network’s throughput. Results demonstrate major improvements for AT services with minor degradation on NAT applications after implementing the new scheduling scheme.
Device to Device Communications will enable on cellular 4G/5G networks soon, There are many research aspects in D2D Communications,
Mode Selection
Network Coding
MIMO
Multi-Hop
the most complicated Interference scenarios are coming
AN OPTIMAL FUZZY LOGIC SYSTEM FOR A NONLINEAR DYNAMIC SYSTEM USING A FUZZY BA...IJCNCJournal
The impetus for this paper is the development of Fuzzy Basis Function “FBF” that assigns in an optimal fashion, a function approximation for a nonlinear dynamic system. A fuzzy basis function is applied to find the best location of the characteristic points by specifying the set of fuzzy rules. The advantage of this technique is that, it may produce a simple and well-performing system because it selects the most significant fuzzy basis functions to minimize an objective function in the output error for the fuzzy rules. The fuzzy basis function is a linguistic fuzzy IF_THEN rule. It provides a combination of the numerical information and the linguistic information in the form input-output pairs and in the form of fuzzy rules. The proposed control scheme is applied to a magnetic ball suspension system.
Adhoc mobile wireless network enhancement based on cisco devicesIJCNCJournal
Adhoc wireless networks become one of the most researchable areas in the studying of routing protocols depending on the Open System Interconnection (OSI Model). This paper use Cisco devices as a reference to enhance the performance of the network. This enhancement will be due to high processing, reliability, average cost, power consumption and accessibility. The aim of this research not only to get the cost down, it also to choose a time to time device to process the data as rapid as it can. Using NAT, Access List and DHCP protocols defined in Cisco (Graphical Unit Interface) GUI of the (Command Line Interface) CLI, the task can be made.
COST-EFFICIENT RESIDENTIAL ENERGY MANAGEMENT SCHEME FOR INFORMATION-CENTRIC N...IJCNCJournal
Home network (HOMENET) performs multiple important functions such as energy management,
multimedia sharing, lighting and climate control in smart grid (SG). In HOMENET there are numerous
challenges among which mobility and security are the basic requirements that need to be addressed with
priority. The information-centric networking (ICN) is regarded as the future Internet that subscribes data
in a content-centric manner irrespective of its location. Furthermore, it has pecial merit in mobility and
security since ICN supports in-network caching and self-contained security, these make ICN a potential
solution for home communication fabric. This paper aims to apply the ICN approach on HOMENET
system, which we called ICN-HOMENET. Then, a proof-of-concept evaluation is employed to evaluate the
effectiveness of the proposed ICN-HOMENET approach in data security, device mobility and efficient
content distribution for developing HOMENET system in SG. In addition, we proposed a cost-efficient
residential energy management (REM) scheme called ICN-REM scheme for ICN-HOMENET system which
encourages consumers to shift the start time of appliances from peak hours to off-peak hours to reduce the
energy bills. To the best of our knowledge, this is the first attempt to propose an ICN-based REM scheme
for HOMENET system. In this proposal, we not only consider the conflicting requests from appliances and
domestic power generation, but also think the energy management unit (EMU) should cooperate with
measurement sensors to control some specific appliances in some specific conditions. Moreover, the
corresponding performance evaluation validates its correctness and effectiveness.
Distributed firewalls and ids interoperability checking based on a formal app...IJCNCJournal
To supervise and guarantee a network security, the administrator uses different security components, such
as firewalls, IDS and IPS. For a perfect interoperability between these components, they must be
configured properly to avoid misconfiguration between them. Nevertheless, the existence of a set of
anomalies between filtering rules and alerting rules, particularly in distributed multi-component
architectures is very likely to degrade the network security. The main objective of this paper is to check if a
set of security components are interoperable. A case study using a firewall and an IDS as examples will
illustrate the usefulness of our approach.
Performance comparison of coded and uncoded ieee 802.16 d systems under stanf...IJCNCJournal
Worldwide Interoperability for Microwave Access (WiMax), standardized asIEEE 802.16d is a popular
technology for broadband wireless communication system. Orthogonal Frequency Division Multiplexing
(OFDM) is the core of this technology.OFDMreduces Inter-symbol Interference (ISI) and hence improves
system performance (i.e., Bit Error Rate (BER)). To improve system performance further error correction
coding schemes have been included in WiMax. It is widely accepted thata coded system outperforms an
uncodedsystem. But, the performance improvement of a coded system depends on the channel conditions. In
this paper, we investigated and compared the performances of a coded and an uncoded WiMaxsystem
under a practical channel model called Stanford University Interim (SUI). Different modulation schemes
namely BPSK, QPSK, 16-QAM, and 64-QAM have been considered in this work. It is shown that the
selection of codedoruncoded WiMaxsystem should depend on the channel condition as well as on the
modulation used. It is also shown that anuncoded system outperforms a coded system under some channel
conditions.
Regressive admission control enabled by real time qos measurementsIJCNCJournal
We propose a novel regressive principle to Admission Control (AC) assisted by real-time passive QoS
monitoring. This measurement-based AC scheme acceptsflows by default, but based on the changes in the
network QoS, it makes regressive decisions on the possible flow rejection, thus bringing cognition to the
network path. TheREgressive Admission Control (REAC) system consists of three modules performing the
necessary tasks:QoS measurements, traffic identification, and the actual AC decision making and flow
control. There are two major advantages with this new scheme; (i) significant optimization of the
connection start-up phase, and (ii) continuous QoS knowledge of the accepted streams. In fact, the latter
combined with the REAC decisions can enable guaranteed QoS without requiring any QoS support from
the network. REAC was tested on a video streaming test bed and proved to have a timely and realistic
match between the network's QoS and the video quality.
THE IMPACT OF NODE MISBEHAVIOR ON THE PERFORMANCE OF ROUTING PROTOCOLS IN MANETIJCNCJournal
MANET is a cooperative wireless network in which mobile nodes are responsible for routing and
forwarding packets from and to other nodes. Noncooperation is a challenge that definitely degrades the
performance of MANET. A misbehaving or selfish node may make use of other nodes in the network, but
decline to share its own resources with them. These selfish nodes may severely affect the performance of
routing protocols in MANET.
In this paper, we compare the performance of four routing protocols under security attack of node
misbehavior in MANET. We investigate AODV and DSR reactive routing protocols and OLSR and GRP
proactive routing protocols using Riverbed Modeler simulator. The performance comparison is carried out
using two types of misbehaving nodes. The metrics used are End-to-End delay, Packet Delivery Ratio, Data
dropped and the Load. The experimental results show that AODV routing protocol performs better than the
other routing protocols with higher packet delivery ratio. Further, OLSR routing protocol outperforms the
other routing protocols with minimum End-to-End delay.
A method of evaluating effect of qo s degradation on multidimensional qoe of ...IJCNCJournal
This paper studies a method of investigating effect of IP performance (QoS) degradation on quality of experience (QoE) for a Web service; it considers the usability based on the ISO 9241-11 as multidimensional QoE of a Web service (QoE-Web) and the QoS parameters standardized by the IETF. Moreover, the paper tackles clarification of the relationship between ISO-based QoE-Web and IETF-based QoS by the multiple regression analysis. The experiment is intended for the two actual Japanese online shopping services and utilizes 35 subjects. From the results, the paper quantitatively discusses how the QoE-Web deteriorates owing to the QoS degradation and shows that it is appropriate to evaluate the proposed method
In the last decade Peer to Peer technology has been thoroughly explored, becauseit overcomes many limitations compared to the traditional client server paradigm. Despite its advantages over a traditional approach, the ubiquitous availability of high speed, high bandwidth and low latency networks has supported the traditional client-server paradigm. Recently, however, the surge of streaming services has spawned renewed interest in Peer to Peer technologies. In addition, services like geolocation databases and browser technologies like Web-RTC make a hybrid approach attractive.
In this paper we present algorithms for the construction and the maintenance of a hybrid P2P overlay multicast tree based on topological distances. The essential idea of these algorithms is to build a multicast tree by choosing neighbours close to each other. The topological distances can be easily obtained by the browser using the geolocation API. Thus the implementation of algorithms can be done web-based in a distributed manner.
We present proofs of our algorithms as well as experimental results and evaluations.
Evaluation of scalability and bandwidthIJCNCJournal
Multi-Point to Multi-Point Traffic Engineering (MP2MP-TE) leads to an important scalability in Multi
Protocol Label Switching-Traffic Engineering (MPLS-TE) networks. This paper emphasizes on the support
of Fast-reroute (FRR) in MPLS-TE networks by using MP2MP bypass TE-tunnels. Hence, one MP2MP
bypass TE-tunnel can be used to protect several primary TE-tunnels. During failure, the primary TE-tunnel
is encapsulated into the MP2MP bypass TE-tunnel which calls for defining a new type of MPLS hierarchy,
i.e. the multipoint to multipoint hierarchy. In this paper we present a simulation study that evaluates
several fast rerouting scenarios depending on the number of leaves of a MP2MP bypass TE-tunnel and on
the number of primary TE-tunnels that can be encapsulated into one MP2MP bypass TE-tunnel. In
particular, the scalability/bandwidth efficiency tradeoff between these schemes is analyzed and valuable
comparisons with the existing approaches are presented.
Energy efficient clustering in heterogeneousIJCNCJournal
Cluster head election is a key technique used to reduce energy consumption and enhancing the throughput
of wireless sensor networks. In this paper, a new energy efficient clustering (E2C) protocol for
heterogeneous wireless sensor networks is proposed. Cluster head is elected based on the predicted
residual energy of sensors, optimal probability of a sensor to become a cluster head, and its degree of
connectivity as the parameters. The probability threshold to compete for the role of cluster head is derived.
The probability threshold has been extended for multi-levels energy heterogeneity in the network. The
proposed E2C protocol is simulated in MATLAB. Results obtained in the simulationshowthat performance
of the proposed E2Cprotocol is betterthan stable election protocol (SEP), and distributed energy efficient
clustering (DEEC) protocol in terms of energy consumption, throughput, and network lifetime.
Concepts and evolution of research in the field of wireless sensor networksIJCNCJournal
The field of Wireless Sensor Networks (WSNs) is experiencing a resurgence of interest and a continuous evolution in the scientific and industrial community. The use of this particular type of ad hoc network is becoming increasingly important in many contexts, regardless of geographical position and so, according to a set of possible application. WSNs offer interesting low cost and easily deployable solutions to perform a remote real time monitoring, target tracking and recognition of physical phenomenon. The uses of these sensors organized into a network continue to reveal a set of research questions according to particularities target applications. Despite difficulties introduced by sensor resources constraints, research contributions in this field are growing day by day. In this paper, we present a comprehensive review of most recent literature of WSNs and outline open research issues in this field.
Managing, searching, and accessing iot devicesIJCNCJournal
In this paper a new method is proposed for management of REST-based services acting as proxies for Internet-of-Things devices. The method is based on a novel way of monitoring REST resources by hierarchical set of directories, with the possibility of smart searching for “the best” device according to atthe- place devices’ availability and functionality, overall context (including geo-location), and personal preferences. The system is resistant to changes of network addresses of the devices and their services, as well as core system points such as directories. Thus, we successfully deal with the problem of
(dis)connectivity and mobility of network nodes, and the problem of a “newcomer” device trying to connect
to the network at an incidental place/time.
Main novelty of the approach is a summary of three basic achievements. Firstly, the system introduces
unifying tools for efficient monitoring. On one hand, we may control an availability and load (statistics) of
devices/services. On the other hand, we are able to search for “the best” device/service with different criteria, also formulated ad-hoc and personalized. Secondly, the system is resistant to sudden changes of network topology and connections (basically IP addressing), and frequent disconnections of any system element, including core nodes such as central directories. As a result, we may have a common view to the whole system at any time/place and with respect to its current state, even if the elements of the system are distributed across a wider area. Thirdly, any element of the system, from simple devices to global directories, is able to self-adjust to evolving parameters of the environment (including other devices as a part of this environment). In particular, it is possible for a mobile “newcomer” device to interact with the system at any place and time without a need for prior installation, re-programming, determination of
actual parameters, etc. The presented approach is a coherent all-in-one solution to basic problems related
with efficient usage of IoT devices and services, well suited to the hardware- and software-restricted world
of Internet of Things and Services. Fully implemented, the system is now being applied for an “intelligent”
home and workplace with user-centric e-comfort management.
Infrastructure of services for a smart cityIJCNCJournal
Sustainability, appropriate use of natural resources and providing a better quality of life for citizens has become a prerequisite to change the traditional concept of a smart city. A smart city needs to use latest generation Information Technologies, IT, and hardware to improve services and data, to offer to create a balanced environment between the ecosystem and inhabitants. This paper analyses the advantages of using a private cloud architecture to share hardware and software resources when it is required. Our case study is Guadalajara, which has nine municipalities and each one monitor’s air quality. Each municipality has a set of servers to process information independently and consists of information systems for the transmission and storage of data with other municipalities. We analysed the behaviour of the carbon footprint during the years1999-2013 and we observed a pattern in each season. Thus our proposal requires municipalities to use a cloud-based solution that allows managing and consolidating infrastructure to minimize maintenance costs and electricity consumption to reduce carbon footprint generated by the city.
A Mobile Ad-Hoc Network (MANET) is a self configuring, infrastructure less network of mobile devices
connected by wireless links. Loopholes like wireless medium, lack of a fixed infrastructure, dynamic
topology, rapid deployment practices, and the hostile environments in which they may be deployed, make
MANET vulnerable to a wide range of security attacks and Wormhole attack is one of them. During this
attack a malicious node captures packets from one location in the network, and tunnels them to another
colluding malicious node at a distant point, which replays them locally. This paper presents a cluster based
Wormhole attack avoidance technique. The concept of hierarchical clustering with a novel hierarchical 32-
bit node addressing scheme is used for avoiding the attacking path during the route discovery phase of the
DSR protocol, which is considered as the under lying routing protocol. Pinpointing the location of the
wormhole nodes in the case of exposed attack is also given by using this method.
A novel secure e contents system for multi-media interchange workflows in e-l...IJCNCJournal
The goal of e-learning is to benefit from the capabilities offered by new information technology (such as
remote digital communications, multimedia, internet, cell phones, teleconferences, etc.) and to enhance the
security of several government organizations so as to take into considerations almost all the contents of elearning
such as: information content, covering most of citizens or state firms or corporations queries.
Content provides a service to provide most if not all basic and business services; content of communicative
link provides the citizen and the state agencies together all the time and provides content security for all
workers on this network to work in securely environment. Access to information as well is safeguarded. The
main objective of this research is to build a novel multi-media security system (encrypting / decrypting
system) that will enable E-learning to exchange more secured multi-media data/information.
Packet delivery ratio, delay, throughput, routing overhead etc are the strict quality of service requirements
for applications in Ad hoc networks. So, the routing protocol not only finds a suitable path but also the path
should satisfy the QoS constraints also. Quality of services (QoS) aware routing is performed on the basis
of resource availability in the network and the flow of QoS requirement. In this paper we developed a
source routing protocol which satisfying the link bandwidth and end –to- end delay factor. Our protocol
will find multiple paths between the source and the destination, out of those one will be selected for data
transfer and others are reserve at the source node those can be used for route maintenance purpose. The
path selection is strictly based on the bandwidth and end-to-end delay in case two or more then two paths
are having the same values for QoS constraints then we will use hop as a parameter for path selection.
Priority scheduling for multipath video transmission in wmsnsIJCNCJournal
In video data transmission over Wireless Multimedia Sensor Networks (WMSNs), in which network
congestion and link failures are main characteristics, providing Quality-of-Service (QoS) is challenging. In
such situation, using multipath routing protocols along with efficient packet scheduling can improve the
performance of video delivery over sensor networks. In this paper we propose a new packet scheduling
mechanism for multipath video transmission over WMSN. Since, different video frame types in a
compressed video stream have different impact on the perceived video at the receiver; our proposed
scheme for video packet scheduling is content aware that schedules transmission of different video packets
over different paths. For this purpose, condition of each routing path is periodically evaluated and the high
priority video packets are transmitted through high quality paths. Simulation results show that our
proposed scheduling improves the quality of the perceived video at the receiver, considerably.
A CELLULAR BONDING AND ADAPTIVE LOAD BALANCING BASED MULTI-SIM GATEWAY FOR MO...pijans
As it is well known, the QoS(quality of service) provided by mobile Internet access point devices is far from
the QoS level offered by the common ADSL modem-router due to several reasons: in fact, mobile Internet
access networks are not designed to support real-time data traffic because of several drawbacks
concerning the wireless medium such as resource sharing, traffic congestion, radio link coverage etc.,
which impact directly such parameters as delay, jitter, and packet loss rate that are strictly connected to
the quality of user experience. The main scope of the present paper is to introduce a dual USIM HSPA
gateway for ad hoc and sensors networks thanks to which it will be possible to guarantee a QoS suitable
for a series of network-centric application such as real-time communications and monitoring, video
surveillance, real-time sensor networks, telemedicine, vehicular and mobile sensor networks and so on. The
main idea is to exploit multiple radio access networks in order to enhance the available end-to-end
bandwidth and the perceived quality of experience. The scope has been reached by combining multiple
radio access with dynamic load balancing and the VPN (virtual private network) bond technique.
A CELLULAR BONDING AND ADAPTIVE LOAD BALANCING BASED MULTI-SIM GATEWAY FOR MO...pijans
As it is well known, the QoS(quality of service) provided by mobile Internet access point devices is far from
the QoS level offered by the common ADSL modem-router due to several reasons: in fact, mobile Internet
access networks are not designed to support real-time data traffic because of several drawbacks
concerning the wireless medium such as resource sharing, traffic congestion, radio link coverage etc.,
which impact directly such parameters as delay, jitter, and packet loss rate that are strictly connected to
the quality of user experience. The main scope of the present paper is to introduce a dual USIM HSPA
gateway for ad hoc and sensors networks thanks to which it will be possible to guarantee a QoS suitable
for a series of network-centric application such as real-time communications and monitoring, video
surveillance, real-time sensor networks, telemedicine, vehicular and mobile sensor networks and so on. The
main idea is to exploit multiple radio access networks in order to enhance the available end-to-end
bandwidth and the perceived quality of experience. The scope has been reached by combining multiple
radio access with dynamic load balancing and the VPN (virtual private network) bond technique.
A Cellular Bonding and Adaptive Load Balancing Based Multi-Sim Gateway for Mo...pijans
As it is well known, the QoS(quality of service) provided by mobile Internet access point devices is far from
the QoS level offered by the common ADSL modem-router due to several reasons: in fact, mobile Internet
access networks are not designed to support real-time data traffic because of several drawbacks
concerning the wireless medium such as resource sharing, traffic congestion, radio link coverage etc.,
which impact directly such parameters as delay, jitter, and packet loss rate that are strictly connected to
the quality of user experience. The main scope of the present paper is to introduce a dual USIM HSPA
gateway for ad hoc and sensors networks thanks to which it will be possible to guarantee a QoS suitable
for a series of network-centric application such as real-time communications and monitoring, video
surveillance, real-time sensor networks, telemedicine, vehicular and mobile sensor networks and so on. The
main idea is to exploit multiple radio access networks in order to enhance the available end-to-end
bandwidth and the perceived quality of experience. The scope has been reached by combining multiple
radio access with dynamic load balancing and the VPN (virtual private network) bond technique.
Computer networks have experienced an explosive growth over the past few years, which has lead to some severe congestion problems. Reliable protocols like TCP works well in wired networks where loss occurs mostly because of congestion. However, in wireless networks, loss occurs because of bit rates and handoffs too. TCP responds all losses by congestion control and avoidance algorithms, which results in degradation of TCP’s End-To-End performance in wireless networks. This paper discusses different issues and problems regarding use of TCP in wireless networks and provides comprehensive survey of various schemes to improve performance of TCP in Wireless Networks.
Performance Evaluation of TCP with Adaptive Pacing and LRED in Multihop Wirel...ijwmn
Transmission Control Protocol (TCP) was designed to provide reliable end-to-end delivery of
data over unreliable networks. In practice, most TCP deployments have been carefully designed in the
context of wired networks. Ignoring the properties of wireless and Ad-hoc Networks can lead to TCP
implementations with poor performance. In a wireless network, however packet losses occur more often
due to unreliable wireless links than due to congestion. When using TCP over wireless links, each packet
loss on the wireless link results in congestion control measures being invoked at the source. This causes
severe performance degradation. If there is any packet loss in wireless networks, then the reason for that
has to be found out. If there is congestion, then only congestion control mechanism has to be applied.
This work shows the performance of TCP with Adaptive Pacing (TCP-AP) and Link Random Early
Discard (LRED) as queuing model in multihop transmission when the source and destination nodes are
in mobile nature. The adaptive pacing technique seeks to improve spatial reuse. The LRED technique
seeks to react earlier to link overload. This paper consists of simulated environment results under
different network scenarios. This work proves that the combination of TCP-AP and LRED give much
better result than as the individual technique. Simulations are done with the use of NS-2.
This study presents the “overview of TCP
performance on satellite communication networks”, aimed at
satellite characteristics, their effects on throughput selected link
control protocols and various method proposed for enhancing
TCP throughput on satellite networks. Literature reviews on
satellite link characteristics and their effects on TCP operation in
satellite communication networks. Different improve strategies
that have been proposed to enhance TCP data throughput on
satellite links. The choice of frame size (n in bits) and window size
(W in number of frames) used to improve data throughput on
satellite links were considered in this study. Also, the role of
sliding window flow control protocol was considered. However,
the sliding window method ensures that traffic congestion on the
networks is minimized and also, increases the TCP throughput in
satellite communication networks
In the last few years, video streaming facilities over TCP or UDP, such as YouTube, Facetime, Daily-motion, Mobile video calling have become more and more popular. The important
challenge in streaming broadcasting over the Internet is to spread the uppermost potential quality,
observe to the broadcasting play out time limitation, and efficiently and equally share the offered
bandwidth with TCP or UDP, and additional traffic types. This work familiarizes the Streaming
Media Data Congestion Control protocol (SMDCC), a new adaptive broadcasting streaming
congestion management protocol in which the connection’s data packets transmission frequency is
adjusted allowing to the dynamic bandwidth share of connection using SMDCC, the bandwidth share
of a connection is projected using algorithms similar to those introduced in TCP Westwood. SMDCC
avoids the Slow Jump phase in TCP. As a result, SMDCC does not show the pronounced rate
alternations distinguishing of modern TCP, so providing congestion control that is more appropriate
for streaming broadcasting applications. Besides, SMDCC is fair, sharing the bandwidth equitably
among a set of SMDCC connections. Main benefit is robustness when packet harms are due to
indiscriminate errors, which is typical of wireless links and is becoming an increasing concern due to
the emergence of wireless Internet access. In the presence of indiscriminate errors, SMDCC is also
approachable to TCP Tahoe and Reno (TTR). We provide simulation results using the ns3 simulator
for our protocol running together with TCP Tahoe and Reno.
New adaptation method based on cross layer and TCP over protocols to improve ...IJECEIAES
Due to rapid growth of multimedia traffic used over the mobile ad-hoc networks (MANETs), to keep up with the progress of this constraint MANETs protocols becoming increasingly concerned with the quality of service. In view of the random mobility nodes in MANET, TCP becomes more unreliability in case of higher energy consumption and packet loss. In this paper we proposed a new optimization approach to enhance decision making of TCP based on some changes of IEEE 802.11 MAC uses cross layer approach. The aim is to minimize the impact of retransmissions of packet lost and energy consumption in order to analyse and chose the appropriate routing protocol for TCP that can be enhance QoS MANET. Our simulation results based QoS study using NS3 show that, our proposal achieved better performance of TCP in MANETs significantly, and also improved the throughput, energy consumption and facilitates the traffic transmission over routing protocol.
A QUALITY OF SERVICE ARCHITECTURE FOR RESOURCE PROVISIONING AND RATE CONTROL ...ijasuc
Prioritized flow control is a type of QoS provisioning in which each class is provided a different QoS by
assigning priority to one class over another in terms of allocating resources. It is an effective means to
provide service differentiation to different class of service in mobile ad hoc networks. So the objective is to
achieve a desired level of service to high-priority flows so that the wireless medium is completely utilized
using adaptive rate control. In this paper, we propose to design QoS architecture for Bandwidth
Management and Rate Control in MANET. Our proposed QoS architecture contains an adaptive
bandwidth management technique which measures the available bandwidth at each node in real-time and
it is then propagated on demand by the QoS routing protocol. The source nodes perform call admission
control for different priority of flows based on the bandwidth information provided by the QoS routing.
The network bandwidth utilization is monitored continuously and network congestion is detected in
advance. Then a rate control mechanism is used to regulate best-effort traffic.
Performance improvement of bottleneck link in red vegas over heterogeneous ne...eSAT Journals
Abstract In communication networks, congestion avoidance in routers is one of the hottest topics. Current IP network has become the dominant paradigm for all networking environments. The significant cause of packet losses in such heterogeneous networks is no longer limited to network congestion. Traditional TCP interprets every packet loss as caused by congestion which may be not the case in the current Internet. TCP Vegas detects network congestion in the early stage and successfully prevents periodic packet loss that usually occurs in TCP Reno. In this paper a new variant of TCP Vegas namedRed Vegas has used. The Red Vegas may detect random packet losses precisely. Through the packet loss differentiation, Red Vegas reacts appropriately to the losses, and therefore the throughput of connection over heterogeneous networks significantly improved. The bandwidth of the bottleneck link is under-utilized when the random loss rate is high. Therefore, a new design of the fast recovery mechanism for Red Vegas would be carried out. The proposed mechanism improves the aggression of Vegas TCP in competing for the available bandwidth whilst maintaining the inherent stability of the original Vegas TCP scheme. Index Terms: TCP Vegas, RED Vegas, Bandwidth and Congestion Control
Performance improvement of bottleneck link in red vegas over heterogeneous ne...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Call Admission Control Scheme With Multimedia Scheduling Service in WiMAX Net...Waqas Tariq
WiMAX network introduces a multimedia data scheduling service with different quality of service (QoS) requirements. Transmission opportunities are scheduled by the service according to the types of traffic data for the different connections or users. In the paper, we first propose a uniform definition of QoS level for the multimedia data types in the service. The QoS level of a connection are determined by the type of data of the connection and its allocated resources. Based on these QoS levels, we propose a call admission control (CAC) scheme for the entry admission of a new connection without degrading the network performance and the QoS of ongoing connections. The key idea of this scheme is to regulate the arriving traffic of the network such that the network can work at an optimal point, given under a heavy load traffic. Taking advantage of the simulation experiments, we confirm the fact that the proposed scheme can achieve better trade-off between the overall performance of network system and the QoS level of individual connection.
Vehicle Ad Hoc Networks (VANETs) have become a viable technology to improve traffic flow and safety on the roads. Due to its effectiveness and scalability, the Wingsuit Search-based Optimised Link State Routing Protocol (WS-OLSR) is frequently used for data distribution in VANETs. However, the selection of MultiPoint Relays (MPRs) plays a pivotal role in WS-OLSR's performance. This paper presents an improved MPR selection algorithm tailored to WS-OLSR, designed to enhance the overall routing efficiency and reduce overhead. The analysis found that the current OLSR protocol has problems such as redundancy of HELLO and TC message packets or failure to update routing information in time, so a WS-OLSR routing protocol based on improved-MPR selection algorithm was proposed. Firstly, factors such as node mobility and link changes are comprehensively considered to reflect network topology changes, and the broadcast cycle of node HELLO messages is controlled through topology changes. Secondly, a new MPR selection algorithm is proposed, considering link stability issues and nodes. Finally, evaluate its effectiveness in terms of packet delivery ratio, end-to-end delay, and control message overhead. Simulation results demonstrate the superior performance of our improved MR selection algorithm when compared to traditional approaches.
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
So far, Wireless Body Area Networks (WBANs) have played a pivotal role in driving the development of intelligent healthcare systems with broad applicability across various domains. Each WBAN consists of one or more types of sensors that can be embedded in clothing, attached directly to the body, or even implanted beneath an individual's skin. These sensors typically serve asingle application. However, the traffic generated by each sensor may have distinct requirements. This diversity necessitates a dual approach: tailored treatment based on the specific needs of each traffic typeand the fulfillment of application requirements, such asreliability and timeliness. Never the less, the presence of energy constraints and the unreliable nature of wireless communications make QoS provisioning under such networks a non-trivial task. In this context, the current paper introduces a novel Medium AccessControl (MAC) strategy for the regular traffic applications of WBANs, designed to significantly enhance efficiency when compared to the established MAC protocols IEEE 802.15.4 and IEEE 802.15.6, with a particular focus on improving reliability, timeliness, and energy efficiency.
May_2024 Top 10 Read Articles in Computer Networks & Communications.pdfIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...IJCNCJournal
The efficient use of energy in wireless sensor networks is critical for extending node lifetime. The network topology is one of the factors that have a significant impact on the energy usage at the nodes and the quality of transmission (QoT) in the network. We propose a topology control algorithm for software-defined wireless sensor networks (SDWSNs) in this paper. Our method is to formulate topology control algorithm as a nonlinear programming (NP) problem with the objective to optimizing two metrics, maximum communication range, and desired degree. This NP problem is solved at the SDWSN controller by employing the genetic algorithm (GA) to determine the best topology. The simulation results show that the proposed algorithm outperforms the MaxPower algorithm in terms of average node degree and energy expansion ratio.
Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...IJCNCJournal
The integration of artificial intelligence technology with a scalable Internet of Things (IoT) platform facilitates diverse smart communication services, allowing remote users to access services from anywhere at any time. The multi-server environment within IoT introduces a flexible security service model, enabling users to interact with any server through a single registration. To ensure secure and privacy preservation services for resources, an authentication scheme is essential. Zhao et al. recently introduced a user authentication scheme for the multi-server environment, utilizing passwords and smart cards, claiming resilience against well-known attacks. This paper conducts cryptanalysis on Zhao et al.'s scheme, focusing on denial of service and privacy attacks, revealing a lack of user-friendliness. Subsequently, we propose a new multi-server user authentication scheme for privacy preservation with fuzzy commitment over the IoT environment, addressing the shortcomings of Zhao et al.'s scheme. Formal security verification of the proposed scheme is conducted using the ProVerif simulation tool. Through both formal and informal security analyses, we demonstrate that the proposed scheme is resilient against various known attacks and those identified in Zhao et al.'s scheme.
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation SystemsIJCNCJournal
In -Vehicle Ad-Hoc Network (VANET), vehicles continuously transmit and receive spatiotemporal data with neighboring vehicles, thereby establishing a comprehensive 360-degree traffic awareness system. Vehicular Network safety applications facilitate the transmission of messages between vehicles that are near each other, at regular intervals, enhancing drivers' contextual understanding of the driving environment and significantly improving traffic safety. Privacy schemes in VANETs are vital to safeguard vehicles’ identities and their associated owners or drivers. Privacy schemes prevent unauthorized parties from linking the vehicle's communications to a specific real-world identity by employing techniques such as pseudonyms, randomization, or cryptographic protocols. Nevertheless, these communications frequently contain important vehicle information that malevolent groups could use to Monitor the vehicle over a long period. The acquisition of this shared data has the potential to facilitate the reconstruction of vehicle trajectories, thereby posing a potential risk to the privacy of the driver. Addressing the critical challenge of developing effective and scalable privacy-preserving protocols for communication in vehicle networks is of the highest priority. These protocols aim to reduce the transmission of confidential data while ensuring the required level of communication. This paper aims to propose an Advanced Privacy Vehicle Scheme (APV) that periodically changes pseudonyms to protect vehicle identities and improve privacy. The APV scheme utilizes a concept called the silent period, which involves changing the pseudonym of a vehicle periodically based on the tracking of neighboring vehicles. The pseudonym is a temporary identifier that vehicles use to communicate with each other in a VANET. By changing the pseudonym regularly, the APV scheme makes it difficult for unauthorized entities to link a vehicle's communications to its real-world identity. The proposed APV is compared to the SLOW, RSP, CAPS, and CPN techniques. The data indicates that the efficiency of APV is a better improvement in privacy metrics. It is evident that the AVP offers enhanced safety for vehicles during transportation in the smart city.
April 2024 - Top 10 Read Articles in Computer Networks & CommunicationsIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
DEF: Deep Ensemble Neural Network Classifier for Android Malware DetectionIJCNCJournal
Malware is one of the threats to security of computer networks and information systems. Since malware instances are available sufficiently, there is increased interest among researchers on usage of Artificial Intelligence (AI). Of late AI-enabled methods such as machine learning (ML) and deep learning paved way for solving many real-world problems. As it is a learning-based approach, accumulated training samples help in improving thequality of training and thus leveraging malware detection accuracy. Existing deep learning methods are focusing on learning-based malware detection systems. However, there is need for improving the state of the art through ensemble approach. Towards this end, in this paper we proposed a framework known as Deep Ensemble Framework (DEF) for automatic malware detection. The framework obtains features from training samples. From given malware instance a grayscale image is generated. There is another process to extract the opcode sequences. Convolutional Neural Network (CNN) and Long Short Term Memory (LSTM) techniques are used to obtain grayscale image and opcode sequence respectively. Afterwards, a stacking ensemble is employed in order to achieve efficient malware detection and classification. Malware samples collected fromthe Internet sources and Microsoft are used for theempirical study. An algorithm known as Ensemble Learning for Automatic Malware Detection (EL-AML) is proposed to realize our framework. Another algorithm named Pre-Process is proposed to assist the EL-AML algorithm for obtaining intermediate features required by CNN and LSTM.Empirical study reveals that our framework outperforms many existing methods in terms of speed-up and accuracy.
High Performance NMF Based Intrusion Detection System for Big Data IOT TrafficIJCNCJournal
With the emergence of smart devices and the Internet of Things (IoT), millions of users connected to the network produce massive network traffic datasets. These vast datasets of network traffic, Big Data are challenging to store, deal with and analyse using a single computer. In this paper we developed parallel implementation using a High Performance Computer (HPC) for the Non-Negative Matrix Factorization technique as an engine for an Intrusion Detection System (HPC-NMF-IDS). The large IoT traffic datasets of order of millions samples are distributed evenly on all the computing cores for both storage and speedup purpose. The distribution of computing tasks involved in the Matrix Factorization takes into account the reduction of the communication cost between the computing cores. The experiments we conducted on the proposed HPC-IDS-NMF give better results than the traditional ML-based intrusion detection systems. We could train the HPC model with datasets of one million samples in only 31 seconds instead of the 40 minutes using one processor), that is a speed up of 87 times. Moreover, we have got an excellent detection accuracy rate of 98% for KDD dataset.
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
So far, Wireless Body Area Networks (WBANs) have played a pivotal role in driving the development of intelligent healthcare systems with broad applicability across various domains. Each WBAN consists of one or more types of sensors that can be embedded in clothing, attached directly to the body, or even implanted beneath an individual's skin. These sensors typically serve asingle application. However, the traffic generated by each sensor may have distinct requirements. This diversity necessitates a dual approach: tailored treatment based on the specific needs of each traffic typeand the fulfillment of application requirements, such asreliability and timeliness. Never the less, the presence of energy constraints and the unreliable nature of wireless communications make QoS provisioning under such networks a non-trivial task. In this context, the current paper introduces a novel Medium AccessControl (MAC) strategy for the regular traffic applications of WBANs, designed to significantly enhance efficiency when compared to the established MAC protocols IEEE 802.15.4 and IEEE 802.15.6, with a particular focus on improving reliability, timeliness, and energy efficiency.
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...IJCNCJournal
The efficient use of energy in wireless sensor networks is critical for extending node lifetime. The network topology is one of the factors that have a significant impact on the energy usage at the nodes and the quality of transmission (QoT) in the network. We propose a topology control algorithm for software-defined wireless sensor networks (SDWSNs) in this paper. Our method is to formulate topology control algorithm as a nonlinear programming (NP) problem with the objective to optimizing two metrics, maximum communication range, and desired degree. This NP problem is solved at the SDWSN controller by employing the genetic algorithm (GA) to determine the best topology. The simulation results show that the proposed algorithm outperforms the MaxPower algorithm in terms of average node degree and energy expansion ratio.
Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...IJCNCJournal
The integration of artificial intelligence technology with a scalable Internet of Things (IoT) platform facilitates diverse smart communication services, allowing remote users to access services from anywhere at any time. The multi-server environment within IoT introduces a flexible security service model, enabling users to interact with any server through a single registration. To ensure secure and privacy preservation services for resources, an authentication scheme is essential. Zhao et al. recently introduced a user authentication scheme for the multi-server environment, utilizing passwords and smart cards, claiming resilience against well-known attacks. This paper conducts cryptanalysis on Zhao et al.'s scheme, focusing on denial of service and privacy attacks, revealing a lack of user-friendliness. Subsequently, we propose a new multi-server user authentication scheme for privacy preservation with fuzzy commitment over the IoT environment, addressing the shortcomings of Zhao et al.'s scheme. Formal security verification of the proposed scheme is conducted using the ProVerif simulation tool. Through both formal and informal security analyses, we demonstrate that the proposed scheme is resilient against various known attacks and those identified in Zhao et al.'s scheme.
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation SystemsIJCNCJournal
In -Vehicle Ad-Hoc Network (VANET), vehicles continuously transmit and receive spatiotemporal data with neighboring vehicles, thereby establishing a comprehensive 360-degree traffic awareness system. Vehicular Network safety applications facilitate the transmission of messages between vehicles that are near each other, at regular intervals, enhancing drivers' contextual understanding of the driving environment and significantly improving traffic safety. Privacy schemes in VANETs are vital to safeguard vehicles’ identities and their associated owners or drivers. Privacy schemes prevent unauthorized parties from linking the vehicle's communications to a specific real-world identity by employing techniques such as pseudonyms, randomization, or cryptographic protocols. Nevertheless, these communications frequently contain important vehicle information that malevolent groups could use to Monitor the vehicle over a long period. The acquisition of this shared data has the potential to facilitate the reconstruction of vehicle trajectories, thereby posing a potential risk to the privacy of the driver. Addressing the critical challenge of developing effective and scalable privacy-preserving protocols for communication in vehicle networks is of the highest priority. These protocols aim to reduce the transmission of confidential data while ensuring the required level of communication. This paper aims to propose an Advanced Privacy Vehicle Scheme (APV) that periodically changes pseudonyms to protect vehicle identities and improve privacy. The APV scheme utilizes a concept called the silent period, which involves changing the pseudonym of a vehicle periodically based on the tracking of neighboring vehicles. The pseudonym is a temporary identifier that vehicles use to communicate with each other in a VANET. By changing the pseudonym regularly, the APV scheme makes it difficult for unauthorized entities to link a vehicle's communications to its real-world identity. The proposed APV is compared to the SLOW, RSP, CAPS, and CPN techniques. The data indicates that the efficiency of APV is a better improvement in privacy metrics. It is evident that the AVP offers enhanced safety for vehicles during transportation in the smart city.
DEF: Deep Ensemble Neural Network Classifier for Android Malware DetectionIJCNCJournal
Malware is one of the threats to security of computer networks and information systems. Since malware instances are available sufficiently, there is increased interest among researchers on usage of Artificial Intelligence (AI). Of late AI-enabled methods such as machine learning (ML) and deep learning paved way for solving many real-world problems. As it is a learning-based approach, accumulated training samples help in improving thequality of training and thus leveraging malware detection accuracy. Existing deep learning methods are focusing on learning-based malware detection systems. However, there is need for improving the state of the art through ensemble approach. Towards this end, in this paper we proposed a framework known as Deep Ensemble Framework (DEF) for automatic malware detection. The framework obtains features from training samples. From given malware instance a grayscale image is generated. There is another process to extract the opcode sequences. Convolutional Neural Network (CNN) and Long Short Term Memory (LSTM) techniques are used to obtain grayscale image and opcode sequence respectively. Afterwards, a stacking ensemble is employed in order to achieve efficient malware detection and classification. Malware samples collected fromthe Internet sources and Microsoft are used for theempirical study. An algorithm known as Ensemble Learning for Automatic Malware Detection (EL-AML) is proposed to realize our framework. Another algorithm named Pre-Process is proposed to assist the EL-AML algorithm for obtaining intermediate features required by CNN and LSTM.Empirical study reveals that our framework outperforms many existing methods in terms of speed-up and accuracy.
High Performance NMF based Intrusion Detection System for Big Data IoT TrafficIJCNCJournal
With the emergence of smart devices and the Internet of Things (IoT), millions of users connected to the network produce massive network traffic datasets. These vast datasets of network traffic, Big Data are challenging to store, deal with and analyse using a single computer. In this paper we developed parallel implementation using a High Performance Computer (HPC) for the Non-Negative Matrix Factorization technique as an engine for an Intrusion Detection System (HPC-NMF-IDS). The large IoT traffic datasets of order of millions samples are distributed evenly on all the computing cores for both storage and speedup purpose. The distribution of computing tasks involved in the Matrix Factorization takes into account the reduction of the communication cost between the computing cores. The experiments we conducted on the proposed HPC-IDS-NMF give better results than the traditional ML-based intrusion detection systems. We could train the HPC model with datasets of one million samples in only 31 seconds instead of the 40 minutes using one processor), that is a speed up of 87 times. Moreover, we have got an excellent detection accuracy rate of 98% for KDD dataset.
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...IJCNCJournal
Cyber intrusion attacks increasingly target the Internet of Things (IoT) ecosystem, exploiting vulnerable devices and networks. Malicious activities must be identified early to minimize damage and mitigate threats. Using actual benign and attack traffic from the CICIoT2023 dataset, this WORK aims to evaluate and benchmark machine-learning techniques for IoT intrusion detection. There are four main phases to the system. First, the CICIoT2023 dataset is refined to remove irrelevant features and clean up missing and duplicate data. The second phase employs statistical models and artificial intelligence to discover novel features. The most significant features are then selected in the third phase based on cooperative game theory. Using the original CICIoT2023 dataset and a dataset containing only novel features, we train and evaluate a variety of machine learning classifiers. On the original dataset, Random Forest achieved the highest accuracy of 99%. Still, with novel features, Random Forest's performance dropped only slightly (96%) while other models achieved significantly lower accuracy. As a whole, the work contributes substantial contributions to tailored feature engineering, feature selection, and rigorous benchmarking of IoT intrusion detection techniques. IoT networks and devices face continuously evolving threats, making it necessary to develop robust intrusion detection systems.
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...IJCNCJournal
IoT networking uses real items as stationary or mobile nodes. Mobile nodes complicate networking. Internet of Things (IoT) networks have a lot of control overhead messages because devices are mobile. These signals are generated by the constant flow of control data as such device identity, geographical positioning, node mobility, device configuration, and others. Network clustering is a popular overhead communication management method. Many cluster-based routing methods have been developed to address system restrictions. Node clustering based on the Internet of Things (IoT) protocol, may be used to cluster all network nodes according to predefined criteria. Each cluster will have a Smart Designated Node. SDN cluster management is efficient. Many intelligent nodes remain in the network. The network design spreads these signals. This paper presents an intelligent and responsive routing approach for clustered nodes in IoT networks. An existing method builds a new sub-area clustered topology. The Nodes Clustering Based on the Internet of Things (NCIoT) method improves message transmission between any two nodes. This will facilitate the secure and reliable interchange of healthcare data between professionals and patients. NCIoT is a system that organizes nodes in the Internet of Things (IoT) by grouping them together based on their proximity. It also picks SDN routes for these nodes. This approach involves selecting one option from a range of choices and preparing for likely outcomes problem addressing limitations on activities is a primary focus during the review process. Predictive inquiry employs the process of analyzing data to forecast and anticipate future events. This document provides an explanation of compact units. The Predictive Inquiry Small Packets (PISP) improved its backup system and partnered with SDN to establish a routing information table for each intelligent node, resulting in higher routing performance. Both principal and secondary roads are available for use. The simulation findings indicate that NCIoT algorithms outperform CBR protocols. Enhancements lead to a substantial 78% boost in network performance. In addition, the end-to-end latency dropped by 12.5%. The PISP methodology produces 5.9% more inquiry packets compared to alternative approaches. The algorithms are constructed and evaluated against academic ones.
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...IJCNCJournal
Cyber intrusion attacks increasingly target the Internet of Things (IoT) ecosystem, exploiting vulnerable devices and networks. Malicious activities must be identified early to minimize damage and mitigate threats. Using actual benign and attack traffic from the CICIoT2023 dataset, this WORK aims to evaluate and benchmark machine-learning techniques for IoT intrusion detection. There are four main phases to the system. First, the CICIoT2023 dataset is refined to remove irrelevant features and clean up missing and duplicate data. The second phase employs statistical models and artificial intelligence to discover novel features. The most significant features are then selected in the third phase based on cooperative game theory. Using the original CICIoT2023 dataset and a dataset containing only novel features, we train and evaluate a variety of machine learning classifiers. On the original dataset, Random Forest achieved the highest accuracy of 99%. Still, with novel features, Random Forest's performance dropped only slightly (96%) while other models achieved significantly lower accuracy. As a whole, the work contributes substantial contributions to tailored feature engineering, feature selection, and rigorous benchmarking of IoT intrusion detection techniques. IoT networks and devices face continuously evolving threats, making it necessary to develop robust intrusion detection systems.
** Connect, Collaborate, And Innovate: IJCNC - Where Networking Futures Take ...IJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...IJCNCJournal
IoT networking uses real items as stationary or mobile nodes. Mobile nodes complicate networking. Internet of Things (IoT) networks have a lot of control overhead messages because devices are mobile. These signals are generated by the constant flow of control data as such device identity, geographical positioning, node mobility, device configuration, and others. Network clustering is a popular overhead communication management method. Many cluster-based routing methods have been developed to address system restrictions. Node clustering based on the Internet of Things (IoT) protocol, may be used to cluster all network nodes according to predefined criteria. Each cluster will have a Smart Designated Node. SDN cluster management is efficient. Many intelligent nodes remain in the network. The network design spreads these signals. This paper presents an intelligent and responsive routing approach for clustered nodes in IoT networks. An existing method builds a new sub-area clustered topology. The Nodes Clustering Based on the Internet of Things (NCIoT) method improves message transmission between any two nodes. This will facilitate the secure and reliable interchange of healthcare data between professionals and patients. NCIoT is a system that organizes nodes in the Internet of Things (IoT) by grouping them together based on their proximity. It also picks SDN routes for these nodes. This approach involves selecting one option from a range of choices and preparing for likely outcomes problem addressing limitations on activities is a primary focus during the review process. Predictive inquiry employs the process of analyzing data to forecast and anticipate future events. This document provides an explanation of compact units. The Predictive Inquiry Small Packets (PISP) improved its backup system and partnered with SDN to establish a routing information table for each intelligent node, resulting in higher routing performance. Both principal and secondary roads are available for use. The simulation findings indicate that NCIoT algorithms outperform CBR protocols. Enhancements lead to a substantial 78% boost in network performance. In addition, the end-to-end latency dropped by 12.5%. The PISP methodology produces 5.9% more inquiry packets compared to alternative approaches. The algorithms are constructed and evaluated against academic ones.
Student information management system project report ii.pdfKamal Acharya
Our project explains about the student management. This project mainly explains the various actions related to student details. This project shows some ease in adding, editing and deleting the student details. It also provides a less time consuming process for viewing, adding, editing and deleting the marks of the students.
CFD Simulation of By-pass Flow in a HRSG module by R&R Consult.pptxR&R Consult
CFD analysis is incredibly effective at solving mysteries and improving the performance of complex systems!
Here's a great example: At a large natural gas-fired power plant, where they use waste heat to generate steam and energy, they were puzzled that their boiler wasn't producing as much steam as expected.
R&R and Tetra Engineering Group Inc. were asked to solve the issue with reduced steam production.
An inspection had shown that a significant amount of hot flue gas was bypassing the boiler tubes, where the heat was supposed to be transferred.
R&R Consult conducted a CFD analysis, which revealed that 6.3% of the flue gas was bypassing the boiler tubes without transferring heat. The analysis also showed that the flue gas was instead being directed along the sides of the boiler and between the modules that were supposed to capture the heat. This was the cause of the reduced performance.
Based on our results, Tetra Engineering installed covering plates to reduce the bypass flow. This improved the boiler's performance and increased electricity production.
It is always satisfying when we can help solve complex challenges like this. Do your systems also need a check-up or optimization? Give us a call!
Work done in cooperation with James Malloy and David Moelling from Tetra Engineering.
More examples of our work https://www.r-r-consult.dk/en/cases-en/
Water scarcity is the lack of fresh water resources to meet the standard water demand. There are two type of water scarcity. One is physical. The other is economic water scarcity.
NO1 Uk best vashikaran specialist in delhi vashikaran baba near me online vas...Amil Baba Dawood bangali
Contact with Dawood Bhai Just call on +92322-6382012 and we'll help you. We'll solve all your problems within 12 to 24 hours and with 101% guarantee and with astrology systematic. If you want to take any personal or professional advice then also you can call us on +92322-6382012 , ONLINE LOVE PROBLEM & Other all types of Daily Life Problem's.Then CALL or WHATSAPP us on +92322-6382012 and Get all these problems solutions here by Amil Baba DAWOOD BANGALI
#vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore#blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #blackmagicforlove #blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #Amilbabainuk #amilbabainspain #amilbabaindubai #Amilbabainnorway #amilbabainkrachi #amilbabainlahore #amilbabaingujranwalan #amilbabainislamabad
About
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Technical Specifications
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
Key Features
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface
• Compatible with MAFI CCR system
• Copatiable with IDM8000 CCR
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
Application
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...
A novel algorithm for tcp timeout
1. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.3, May 2015
DOI : 10.5121/ijcnc.2015.7311 145
A NOVEL ALGORITHM FOR TCP TIMEOUT
CALCULATION OVER WIRELESS AD HOC
NETWORKS
Tareq T. Krishan1
, Adnan M. Al-Smadi2
1
Department of CIS, The University of Jordan-Aqaba, Jordan
2
Prof. Adnan M. Al-Smadi, Yarmouk University, Irbid, Jordan
ABSTRACT
To accommodate real-time multimedia applications that achieve Quality of Service (QOS) requirements in
a wireless ad-hoc network, a QOS control mechanisms is needed. Correspondence over such networks
must consider other aspects in regard to network properties; that the time it takes to send a message and
reach its destination faces different variables from one message to the other in a short time. Therefore, the
equation of calculating the time required to resend the message must be able to contain the worst case and
acknowledges different features for the network. The objective of this paper is to improve retransmission
time calculation adaptability when occurring using Transmission Control Protocol (TCP) over wireless Ad
hoc networks. Hence, it aims to obtain more accurate time to ensure retransmission time occurring in
accordance to the network environment variables efficiently.
KEYWORDS
TCP Computation Enhancement, Wireless networks, wireless Ad-hoc networks, Mobility, QOS for routing,
smart routing.
1.INTRODUCTION
Wireless ad-hoc networks do not require any fixed equipment or infrastructures such as routers,
switches, access points, base stations, or cables. Nodes are connected with each other through
radio signals to organize a network and transmit data from one node to another. Therefore
wireless ad hoc networks are considered as promising technology to establish a means of
communication where installation of network equipment and cables is not allowed due to some
difficulties, For instance high cost. For example, historic landmark, festival site, or when
conventional communication infrastructures are destroyed due to catastrophic disasters like
earthquake. In such situations, wireless ad-hoc networks are expected to accommodate real-time
multimedia flow for remote Monitoring, video conferencing, and Voice over IP (VoIP)
communications. Congestion may occur at one node or which generally affects QOS by routing.
Several papers on QOS routing have been proposed for wireless ad-hoc networks. QOS - Ad hoc
on-demand Distance Vectors (AODV) [4] is a per node available bandwidth estimation protocol
based on AODV. It estimates the available bandwidth using the number of packets exchanged
between nodes. On the other hand, Several Studies on retransmission adaptability have been
proposed to wireless ad-hoc networks and TCP timeout adaptively over wireless mobile ad hoc
networks [2] [5] to enhance retransmission’s timeout and reduce congestion which affects on the
2. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.3, May 2015
146
overall throughput of the network. To our knowledge, there has been no work addressing the
problem of controlling time retransmission time in order to achieve performance gain in the
context of real-time multimedia applications over mobile wireless
ad hoc networks.
This paper proposes a new approach which ensures occurrence of retransmission in more adaptive
scenarios in case of congestion in one node or more, consistent with application QOS
requirements in a wireless ad hoc network. This paper focuses on new algorithm that has been
built and tested in the NS-2 simulation environment, where sequence has been applied in number
of nodes and movement speed through multiple test cases to ensure the stability of the low
percentage of delays with the increasing number of nodes. Thus, we are talking about the stability
of performance to coincide with unstable network.
The remainder of this paper is organized as follow. Problem statement is described in Section II.
Section III includes the literature review. Section IV presents a novel algorithm for TCP timeout
calculation over ad hoc networks. Simulation set up is described in section V. Proposed equations
are displayed in Section VI. Finally, conclusions and future work are included in Section VII.
2. PROBLEM STATEMENT
Recent years have seen rapid progress and evolution in the context of communication technology
and wireless networks. This was a result of the continuous development of accuracy in the
technology of Integrated Circuit (IC) industry. In addition, it provided a qualitative improvement,
which led to the acquisition of mobile devices with ultrafine sizes and lower costs have made
successes of a multifaceted in terms of the quality of performance in the services and applications
that provide user [1].
The evolution in wireless revolution governed by the quality of the applications and services
required, which is used by the studies and research related in wireless networks recently cares in
the quality of messaging and ideal transmission channels. The following are challenges faced by
wireless networks [2]:
• Limited capacity of transmission's frequencies Bandwidth (BW), where the wireless
network is characterized by lower capacity range of messaging and data rates offered
unlike the wired network which is characterized by a larger transmission capacity [3].
• long times to track Round Trip Time (RTT) , which tend wireless networks to own
delay, due to high relatively loss of packets more than wired networks . So, a renewed
tracks offering concept of mobility for the user to move free with enjoyment of the
services without interrupting the network [4].
• Energy consumption such as mobile computers, mobile devices and PDA, that managed
by cell power / battery. Therefore, there is need to reduce power consumption through
producing batteries less consumption [5], or smart routing algorithms.
The majority of the above factors impose themselves on applications and network services,
especially real world applications; for instance, video conferencing, that require to ensure a
sequential flow and order of packets to achieve the reliability and quality of the delivery to the
end users. Instant wireless environment is affected by several factors [6] including:
3. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.3, May 2015
147
• Geographic locations. Variation in the flow of transmission over sight line of sight,
which is known as the Line of Sight (LOS) /Non Line of Sight (NLOS)
• High Latencies.
• Disconnect temporary connection.
• High degree of delay to deliver packages.
The low performance for TCP influenced by the properties of the wireless network that imposes
itself, which led to the research and investigation in recent years to make the TCP more adaptive
wireless work [7] [8].
Wireless networks are classified into two categories: namely: infrastructure networks and mobile
wireless networks. The most important characteristic of the second type from the rest of the other
networks is the amount of communications managed between nodes mobile in the absence of
standalone router, as it relates to nodes with each other. Mobile wireless network mechanism of
action is crystallized through temporary telecommunications and short-term with a plurality of
hops, each node acting as a guide to push the data packets and routed to hold other [9].
The basic idea of the decrease of the performance and quality of the TCP on the wireless network
is the inability to detect the position of the packet loss, which causes the loss attributable to a
variety of reasons not limited to network congestion, but for other things, including:
• Link Breakage disconnection, Handoff, Fading [10].
• Delay Ability (wireless mobile networks, for example, talking about the fullness of the
queue for a specified size and thus a drop of the packages).
• High error rate in the deciding one.
With respect to these causes for the loss of packets is generating reactions as a reduction of
inappropriate window transmission and reduce the period of the beginning of the transmission
and activation of control mechanisms in congestion reduces the productivity of the transport
protocol [11]. The causes of low productivity during the occurrence of transmission by using TCP
in a private mobile network illustrated as follows [7]:
• Effect of re- calculating the route to the source: by virtue of mobile nodes may change
tracks, and re-build new tracks that require being more obvious, that the process of
discovery of the new route takes time at length what makes TCP sender subject to a
waiting period longer, until the discovery of the new route.
• Effect of the division of the network: This problem occurs When stationed sender in part
of the network and recipient ensconce him into another part of the network. Packet cannot
reach to destination directly, sender still in a waiting period (Timeout) and by virtue of
the non-arrival notification access within the estimated round trip time (ERTT) of the
flight path and go back. Sender resends the package lost several times with doubling in
(timers); we talk about inflation in timeout.
• Effect of window congestion in mobile ad hoc networks (MANET): congestion window
indicate the percentage of accepted data for a particular party and by virtue of that, the
roads changed much capacitive given two ways will fluctuate as well.
4. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.3, May 2015
148
Increasing or decreasing the number of mobile nodes over the path between the transmitter and
receiver with different speeds will renew the change in the values of the time of the flight path
default such as Sample Round Trip Time (SRTT); thus affected the values to guess the time of
the flight path (ERTT) in a manner sudden increases so led ultimately to possible inflation
processes and the value of the retransmission Timeout. Irregular variations for guess the round-
trip time and the possible delay caused by Retransmission Timeout (RTO) lowers the efficiency
of the TCP and hence the low quality of the service provided. That requires TCP to be more in
recognition of the properties of the network with the calculated values for retransmission.
Therefore, we talk about reducing effects by the changes to the values of renewable time in
virtual flight path. RTO lowers the efficiency of the TCP and hence the low quality of the service
provided.
Estimating times of renewable tracks the most important factor in the performance of the
transmission appears through the TCP, especially when dealing with change in the movement of
the node between the sender and the receiver. This will cause a sudden increase values to guess
the time of the flight path and thus increasing the value of timeout [12].
Temporary disconnection lead to wide difference on time values over virtual paths, in regards to
packets and approval its arrival. The big difference is known incremental sudden delay and thus a
“Spurious TCP Timeout” occurs, which reduce productivity and performance of the TCP [13].
This study aims to improve the calculation of time retransmission by the sender who uses the
TCP, which take the sender until the completion of the receiving instant, acknowledgment (ACK)
from the destination, and adapt to what can occur in this period under the conditions imposed by
the mobile network.
3. LITERATURE REVIEW
There are many previous studies regarding the adaptability of transmission protocol on wireless
networks in general. The studies focused specifically on operations to calculate values and guess
retransmission waiting time and the extent of vulnerability to the vagaries of flight paths, with
indirect talk about the nature of the problem, which circulated the current study. The paper in [16]
Presented algorithm EIFEL which made the TCP more durable on the wireless network, through
the removal of uncertainty for the re-messaging and being able to reduce the Spurious Timeout &
Spurious Fast Retransmission. Fahmy, et. Al. [9] suggested improving the performance of the
TCP packet loss in wireless scenarios, where showed that the collapse or loss of packets is not
due to congestion. However, it does not intersect with the proposed study in this paper in terms of
the impact of renewable infrastructure for the wireless network in terms of the movement of
mobile nodes on the performance of the TCP. Another study presented in [13] investigated the
subject of TCP Timeout on the wireless network and studied add additional delay is added
regularly to increase the contrast time flight path. This study has shown that the additional delay
added to the time of the flight path will increase the productivity of the TCP and reduce Spurious
Timeout formed as a result of the high variability of the values of the time of the flight path
Default. The big challenge faced by this study is that when the value of the guess is too long
Timeout lead to Underutilizing Network and when the value is very small guessing there will be
inflation in the retransmission. Kesselman and mansour [17] proposed that the value of the
retransmission ideal time depends on the RTT & TCP windows size. It also touched upon the
completion of the study to the time that the retransmission increases the productivity of the TCP,
noting that the time of retransmission is affected by the difference quotient of the flight path and
go back higher the value of the TCP windows size increases the value of the time of
5. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.3, May 2015
149
retransmission. The paper also talked about the sense of Premature RTO occurrence send back
fast and early to coincide with the lack of an actual loss for the package, any package that comes
to be the status of the delay notice arrives late; Mini occurrence of resending unjustified. Costa
[19] suggested so-called FREEZ-TCP To alert the sender about the loss of signal expected in
transmission range to avoid the loss of packets and increasing the rate of delay their arrival, sends
a notice to the sender to freeze timers Instant (timers) to receive further notice acknowledges the
return signal strength Instant. Then, TCP sender proceeds into transmission.
The most important studies that provided a solution through the presence of the equations is
provided by Jacobson study [14]. The equations proposed provided optimal solutions in a manner
calculated wait time on wired networks to its stability with relatively lower rates of loss of
packets as the loss of packets on the wired network leads to congestion on the network. Theses
equations show the following:
• When data segments transmission began sequentially by the sender depending on TCP,
records the start time of the actual transmission to send the segment. When receiving the
notice of arrival (ACK) of that segment, the time of its receipt is also recorded. The
difference between those times called (SRTT), time that represent for send the packet and
receive delivery notification; that is,
SRTT = current time where the segment ACK received – Previous time where the segment
was sent to distance
• TCP calculates the estimated value of the time of route between the weighted average of
the value of time and track previously estimated the value of the flight path according to
the new equations [15]
ܴܶܶܧ = ܽ ∗ ERTT + ሺ1 − aሻ ∗ SRTT (1)
where, ‘a’ is a constant value ranging between [0.8 – 0.9],
ERTT is the estimated round trip time
ܶ݅݉݁ݐݑ = 2 ∗ ܴܶܶܧ (2)
Timeout is calculated as a function of the value of ERTT multiplied by the number (2), which
represents the process of Backoff. This process is trying to keep the network stable in the event
of a sudden burden on the network leads to the probability of loss of firmness [15].
݁ܿ݊݁ݎ݂݂݁݅ܦ = ܴܵܶܶ − ܴܶܶܧ (3)
ܴܶܶܧ = ERTT + ሺߜ ∗ ݁ܿ݊݁ݎ݂݂݁݅ܦሻ (4)
݊݅ݐܽ݅ݒ݁ܦ = Deviation + ߜ ሺ |Diff | − Deviation ሻ (5)
Where, | | represent the absolute value
ܶ݅݉݁ݐݑ = ߤ ∗ ERTT + ∅ ∗ Deviation (6)
Where, Deviation be between SRTT and ERTT, φ = 4 ideal value of inflation, µ = 1,
δ = 1/8 factor value Influenced with movement.
6. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.3, May 2015
150
Equation (6) illustrates that if the difference is large, the deviation coefficient is dominant at the
expense of timeout. On the other hand, if the difference is small, then timeout approaches ERTT.
However, Jacobson algorithm applied to the mobile wireless network suffers from several
challenges for not adopting wireless scenarios taking into account the work in terms of the high
rates of loss of packets and mobility node then is repeated time values estimated route (Estimated)
between two mobile nodes difficult process. In addition, a deviation value for the time of route
from time to time leads the issue of the movement of nodes at different speeds. Also, application
of Equations (3-6) on the mobile wireless environment showed that the Timeout values are
increasing sharply due to the movement of nodes at different speeds either be oncoming traffic
from each decade, or vice versa.
The study in [12] refers to the direct reasons that leads to low effectiveness of Jacobson's
equations in the wireless environment through two scenarios relate to the movement of the
decade:
• Timeout will increase if two nodes moved away from each other, comparing to delay
with receive duplicated notifications.
• If two nodes closer to each other, timeout is supposed to decrease, but actually it
increases comparing to delay with receive duplicated notifications.
More recent study in this area is the study in [18]. This study presented several proposals to
amend the equation calculating the Timeout in the equations developed by Jacobson [14] to
become more suitable for mobile wireless networks taking into account the mobility of the node
and speed. Pointing out that the values of the times of route varies from time to time largely
because of the volatility in the node and speeds different. The study presented several proposals to
amend the Timeout calculation in Equation (6). The results obtained from Jacobson equation
applied in [18]. The deferments are decreasing between SRTT and ERTT, when number of hops is
lower and nodes speed is slow. The deferments are increasing between SRTT and ERTT, when
number of hops increases and nodes speed is fast.
The original form to the Jacobson equation is: ܶ݅݉݁ݐݑ = ߤ ∗ ERTT + ∅ ∗ Deviation
So, we can summarize the results of Jacobson equation within wireless environment depending
on increasing and decreasing in the number of hops:
• When nodes movements near each other quickly, the number of hops will decrease and
thus SRRT reach to lowest level. After that each of ERTT and the impact of deviations
also reduced. So, ERTT will be the major factor through timeout computation with no
difference between SRTT and ERTT paths.
• Increasing the speed of the nodes makes the number of nodes that form the path of
communication is changing rapidly, thus increasing potential node makes changes at the
time of the flight path the default happen faster.
• In Jacobson’s Equation, Deviation value hits in the factor (Φ = 4) to enlarge the values
Timeout toward super value and therefore there is a big difference between the values of
the SRTT times and RTO.
Halasa in [18] has begun with the following modification on equation (6), so its amendment
produced the following equation:
ܶ݅݉݁ݐݑ = μ ∗ ERTT + ሺሺ∅ ∗ Deviationሻ/nሻ (7)
7. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.3, May 2015
151
Results can be summarized as follows:
• Talked about the worst case (Φ ∗ deviation) in terms of exception hit that value with the
number of hops, just Sufficiency in dividing by the number of nodes.
• With increase of the speed of movement and increase the number of nodes, increasing
changes in the estimated times for sending what makes the expression Deviation
dominant element in calculating the period Timeout.
Kajioka, et. Al. [20], proposed a QOS-aware routing mechanism for real-time applications. By
embedding bandwidth information in control messages of OLSRv2, a source node establishes the
logical path with the maximum available bandwidth. It confirmed that proposal could achieve
almost the same packet delivery ratio, the end-to-end delay, and the delay jitter as QOLSR in
general topology. But this study did not address the impact of the movement of nodes on the
accounts of TCP protocol regarding the time of re-transmission for packets and adaptive
computations that relating to this dilemma. Lee et. al., [21], explains how the network coding
(NC) is useful in the wireless network and evaluated various aspects of the performance of NC at
wireless ad hoc network. It found the impact each of (characteristic of MAC protocol, additive
power consumption by NC protocol and network conditions inappropriate for NC) on
performance evaluation. Therefore, the practical gain of NC is lower than the theoretical gain.
Also, this investigation does not refer to the TCP adaptability in regard to RTO and the effects of
mobility on overall network throughput.
4. A NOVEL ALGORITHM FOR TCP TIMEOUT CALCULATION
OVER AD HOC NETWORKS
The Transmission Control Protocol is a messaging Transfer Protocol to enable the reliability for
guaranteed delivery of data packets to their goals according to its harmonized multi-tasking
structure, together towards the optimization of its performance. On the other hand it uses the
Transmission Control Protocol timers’ retransmission (Retransmission Timers) as one of the
mechanisms of the main supports reliability to deliver data. It is the process of retransmission
based on the calculated value of the retransmission time (Retransmission Timeout), which spent
by the sender to re-send the missing package if elapsed time is estimated to reach the notice
received the package sent by the sender to the node. This value is calculated as a function of the
average time of the virtual transmission path, which represents the elapsed time between sending
data segment of the sender and the receipt of notice of delivery section node dispatcher. When
directly sender used for Transmission Control Protocol sent to the first data packet after the
adoption of a session contact with the receiving party through a mechanism called "Three Way
Hand Shake", then the time of the virtual transmission path time is calculated from the estimated
transmission path. Its value at the first package posted equal to the virtual transmission time.
That is, ERTT = SRTT (But it will vary later while sending the following packages due to
different placement of the node any movement) and then the value of the retransmission time will
be calculated even if the elapsed time is estimated to receive delivery of the package sent notice.
Then it a period of retransmission (Timeout) starts, which were calculated in advance to re-send
the package, lost successively until the receipt of the notice delivered means that the sender shall
remain for a period of time until the retransmission received notice of the arrival of the package
lost [16].
Methodology of the current study focused on the need for accuracy in regard to RTO computation
through making the processes of accounts more adaptive. Then, if these values are calculated in
inaccurate approach, it may lead to re-send the wrong information for lost packages.
8. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.3, May 2015
152
The method of calculating the time of retransmission by Jacobson Karl’s equations has proven to
give good results on the network stable by virtue of the low rate of loss of firmness. The main
reason for the loss of packets on the wired network is congestion on the network [13]. Therefore,
the present study was to consider the factor of congestion can be included in the calculation of the
equation of time retransmission used in the Transmission Control Protocol and study its
behaviour over wireless networks for the mobile as if they contain the retransmission period of
time the value of the congestion at the path of an actor is not stable between the sender and the
future of the network.
Current study processes can be crystallized into the following functional steps:
1. Apply the proposed algorithm using TCL language via NS2 simulator and ongoing to start
with last formulation obtained by [18]; namely Equation (7) in this paper. This includes
timeout equation that consists of a factor for the number of nodes n. It should be
mentioned that the number of nodes used in the current study is 10.
• Analysis the behavior of Equation (7) via 15 nodes. That is expanding the number of
nodes to measure the overall throughput of this equation by increasing the number of
nodes. Thus, justifications are made for the amendment to the equation to bring a new
vision to the equation.
• Formulate the equations through present study that included the inclusion of the change in
the value of the congestion coupled with the number of nodes as the first vision is
included for the calculation of the equation of time retransmission within the present
study (15) node.
• After that, an optimal formulation is applied, with nodes increasing from 20 – 30 nodes.
Therefore, an ideal situation is applied to maintain a better level of delay on the network.
2. Make adjustments to the equation presented in [18], which include the inclusion of the
change in the congestion value at the node (Cwnd) coupled with the change in the
number of nodes n according to random velocities within the equation of calculating the
value of retransmission time.
3. Applying the modified equations within the increasing number of nodes between 20-30
nodes to reach to the optimal case, with stable in the delay level.
5. SET UP AND CONFIGURE THE PROPERTIES OF THE MOBILE WIRELESS
NETWORK SIMULATION (PREPROCESSING)
The process of creating the network’s properties within the simulation is crystallized at
the following steps:
First step
Configure each channel of transmission across the network and any coverage pattern which is
multiple destinations deployment on the network.
• Create a standard of physical specifications which is the participatory use of participatory usage of
transmission medium by end users including network frequency with ( 2.4 - 5 GHz ) with the
transfer rate of data across a network's nodes of (2 Mbps ) and throughput of ( 0.9 MB ).
• Next would be, configure a data link layer on the network and the type of sensor for wireless
messaging in each node.
9. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.3, May 2015
153
• Create communication interface wireless that consists of PHY protocol to connect between data
link layer & physical layer as a communication protocol between these two layers through
network. That's because of its basic and direct role in running entities a peer to peer among users
of mobile network.
• Define a variable for the number of nodes that needs to be applied in the simulation.
• Define the size of the queue for packets at each node (what has a relationship with the flow
management and scroll in the nodes).
• Prepare the protocol that manages following processes (flow, scroll and dropping) for packets and
it in each of the nodes.
This means that we are talking about Queuing management methodology used in network, which
consists of Drop-tail protocol whose methodology is to achieve priority to push and scroll packets
on (FIFO) queue principle within incoming packets from different nodes either to pass it to
another node or to drop it. Then, packets from the queue that exceeds the size of the queue for
each node are dropped.
After that, define variable for routing protocols for mobile wireless network. Then define
simulation time in the study.
Finally, define 64 kbps transmission rate, we talk about the bandwidth of frequencies
transmission through the network.
Second step
Consist of configuring the nodes by assigning all the properties of the network that had been
prepared in First step to the nodes, starting from linking the number of nodes defined in the First
step to a channel network.
Then, the nodes in the network are positioned by selecting the initial sites for nodes that are
defined in the First step before starting the implementation of the Network Simulation.
Finally, implementation of random movement of nodes is requested when simulation is applied at
different speeds of the nodes.
Third step
• Consist of configuring sink Agent & TCP Agent who manages the transmission control between
two selected nodes as receiver and transmitter.
• Following this, achieving the linking of TCP Agent with the node selected as a source of
transmission to manage and control messaging sent from source.
• As well as achieving the linking of the Sink protocol Agent with nodes selected as a destination for
sending to control and manages instant Messaging with the recipient.
• Then comes the actual linking between messaging management protocols for both source and
Destination.
• Following this, defining and configuring communication and interaction management for
intermediate nodes that represent path between specific source and specific target.
• And then, implementing the actual communication and interaction management by creating
Constant Bit rate Application that is linked with TCP Agent as the application that runs the
adjustment of traffic to queue the packets in the path from the source node, Through several
criteria like determining the size of the packet which is 2321 Byte also like determining the data
transfer speed rate through the path between source and target which is 600 Kbps.
10. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.3, May 2015
154
The following is the preprocessing steps mentioned above, which represents the Characteristics to
the environment of an Ad hoc network during the study.
Figure 1. Preprocessing steps
1. Step One
Set channel-type Wireless Channel
Set Propagation –Model Two Ray ground
Set Mac-type IEEE 802.11
Set Link-Layer-type LL
Set Antenna-model Omni Antenna
Set Network-Interface-Type Phy/wireless
Set No. Of Mobile Nodes n
Set Max-packet-In-Ifq 10000
Set Interface-Queue-type Drop tail/Priority Queue
Set Routing-Protocol Var(rp),
where Var(rp) is a variable Selected by the
user. ( Aodv, Dsdv , Dsr ….)
Set Simulation Time 150 Second
Set Mac-Data-Rate 2 MB/s
Set Mac-Bandwidth-Rate 64 Kb/s
2. Step Two
Set Nodes-Configuration as defined in Step 1
Set Initial position For the Nodes, Defined
Previously
Start Mobile-Nodes Motion randomly
3. Step Three
Set Tcp Agent, for the sender
Set Tcp Sink, for the receiver
11. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.3, May 2015
155
6. PROPOSED EQUATIONS
ܶ݅݉݁ݐݑ = ܴܶܶܧ + ݊ ∗
௩௧
Φ∗௪ௗ
(8)
Where, ERTT is the estimated round trip time, Cwnd is changes the value of the congestion with
the change of the number of nodes obtained by TCP agent, n is number of nodes, Deviation is
the deviation between SRTT and ERTT, ΦΦΦΦ = is Ideal value of inflation, used by Jacobson/
Karels [22].
The application of equation's algorithm (8) as shown in the Figure 2, the following result has
been obtained from simulation as shown in Figure 3.
Algorithm
Procedure Plot ( )
Set SRTT = 0; initial value.
Set ERTT = 0; initial value.
Set Deviation = 0; initial value.
Set δ = 1/8
Set µ = 1
Set Ф = 4
Get SRTT from TCP agent
Set ERTT = SRTT
Set Time = 0.01 ms
LOOP
i: 0.01 : 150
Get SRTT from TCP agent.
Get Cwnd from TCP agent.
Set ݁ܿ݊݁ݎ݂݂݁݅ܦ = ܴܵܶܶ − ܴܶܶܧ
Set ܴܶܶܧ = ܴܶܶܧ + ሺ ࢾ ∗ ݁ܿ݊݁ݎ݂݂݁݅ܦሻ
Set ݊݅ݐܽ݅ݒ݁ܦ = ݊݅ݐܽ݅ݒ݁ܦ + ࢾ ∗ ሺ||݁ܿ݊݁ݎ݂݂݁݅ܦ − )݊݅ݐܽ݅ݒ݁ܦ
Set ܶ݅݉݁ݐݑ = ܴܶܶܧ + ݊ ∗
௩௧
ః ∗ ௪ௗ
Commit file F0 = RTT
Commit file F1 = Timeout
Set ܶ݅݉݁ = ܶ݅݉݁ + 0.01
End LOOP
Execute X Graph For Files F0 , F1
Execute
Figure 2. The algorithm for the first modification.
12. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.3, May 2015
156
Figure 3. Applying first modification using AODV via 15 nodes.
ܶ݅݉݁ݐݑ = ܴܶܶܧ + φ ∗
௩௧
∗௪ௗ
(9)
where, ERTT is the estimated round trip time, Cwnd is changes the value of the congestion with
the change of the number of nodes Obtained by TCP agent, n is number of nodes, Deviation is
The deviation between SRTT and ERTT, ΦΦΦΦ = is Ideal value of inflation, used by Jacobson/
Karels.
Applying equation (9) to the algorithm in Figure 2, with change in the equation, the following
result has been obtained using simulation as shown in Figure 4.
Figure 4. Applying second modification using AODV via 15 nodes.
ܶ݅݉݁ݐݑ = ܴܶܶܧ +
௩௧
(∗௪ௗ)
(10)
Where, ERTT is Estimated round trip time, Cwnd is Changes the value of the congestion with
the change of the number of nodes Obtained by TCP agent , n is number of nodes, Deviation is
The deviation between SRTT and ERTT, ΦΦΦΦ = is ideal value of inflation, used by Jacobson/
Karels.
In the application of equation's algorithm (10) using Figure 2, with change in the equation, the
following result has been obtained using simulation as shown in Figure 5.
13. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.3, May 2015
157
Figure 5. Applying third modification using AODV via 15 nodes.
Figure 6. Applying third modification using AODV via 20 nodes.
ܶ݅݉݁ݐݑ = ܴܶܶܧ +
௩௧
ఒ
(11)
where, ERTT is Estimated round trip time, Deviation is The deviation between SRTT and
ERTT , ߣ = Ф ∗ ݀݊ݓܥ ∗ ݊, Cwnd is Changes the value of the congestion with the change of the
number of nodes obtained by TCP agent, n is number of nodes, ΦΦΦΦ = is Ideal value of
inflation, used by Jacobson/ Karels.
In the application of equation's algorithm (11) using Figure 2, with change in the equation, the
following result has been obtained using simulation as shown in Figure 7.
Figure 7. Applying fourth modification using AODV via 20 nodes.
14. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.3, May 2015
158
Figure 8. Applying fourth modification using AODV via 25 nodes.
Figure 9. Applying fourth modification using AODV via 30 nodes.
A comparison of the retransmission timeout (RTO) using the original equation in [18]
AND the modified proposed equation in this paper is shown in Table 1.
Table 1. Comparison between the results using original and proposed (modified) equations
Method Number of Nodes RTO in msec
Original equation in [18]
Equation (11)
10 38.5584
Modified equation
Equation (12)
15 26.3908
Modified equation
Equation (15)
30 26.6854
Hence, the retransmission timeout has maintained a relatively good level with doubling
the number of nodes from 15 to 30 nodes. That is, the difference in the rate of RTO
during incrementing the number of nodes is 0.2946 msec. Therefore, RTO is not affected
by increasing the number of nodes, thus preserving a low level of delay in the network.
15. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.3, May 2015
159
7. CONCLUSIONS AND FUTURE VISIONS
The paper presented an algorithm to improve the retransmission time over ad hoc networks. The
algorithm is a modification to the formula developed by [18]. Several experiments were
performed taking different number of nodes. A comparison was made between the formula in
[18] and the proposed modification. The results obtained shows that the proposed method
outperformed the one in [18]. The retransmission time was about the same when we went from
10 to 30 nodes using the proposed algorithm.
We suggest that different studies should be considered to introduce new mechanisms that achieve
smart and more effective routing, with taking into account the mobility Characteristics.
ACKNOWLEDGMENTS
First Author would like to thank Prof. Adnan Al-Smadi for his guidance and continuous support
through his experience and knowledge. The authors would also like Recognize that the work has
relied on the objectivity and transparency in all aspects of this research.
REFERENCES
[1] Shondip, S., " Localized Demand Driven Routing for Mobile Ad hoc Wireless Networks " , Master
Thesis, Computer science Department, University of Bristol , UK, pp. 39-47 , Feb 2005 .
[2] Crow, B., Widjaja, I., Kim, J., and Sakai, P., " IEEE 802.11 Wireless Local Area networks " , IEEE
Commun.Mag , Vol.35 , No.9 , pp. 116-126 , September 1997.
[3] Jamieson, K., and Balakrishnan, H., " PPR : Partial Packet Recovery for Wireless Networks ". In
Proc. Of ACM SIGCOM, Kyoto , Japan , August 2007, pp. 409–420 .
[4] Xu, S., and Saddawi, T., " Does the IEEE 802.11 Mac protocol work well in multihope wireless ad
hoc Networks? " , IEEE communication Magazine , Vol.39 , No.6 , pp. 130-137 , 2001.
[5] Srinivas, A., and Modiano, E., " Minimum Energy Disjoint Path Routing in Wireless Ad Hoc
Networks " , ACM Mobicom , pp. 122-133 , 2003 .
[6] Balakrishnan, H., Seshan, S., Amir E., and Katz, R., " Improving TCP/IP Performance Over
Wireless Networks " , Proceedings of Mobicom , Berkeley , CA , United States , pp. 2-11 , 1995.
[7] Hanbali, E., Nain, p., " A survey of TCP Over Mobile Ad hoc Networks " , Theme COM , Vol.7 , pp.
22-36 , May 2004 .
[8] Moustafa, k., " TCP over Mobile Ad hoc Access Networks “, Master Thesis ,Carleton University
Ottawa, Ontario, December 2002.
[9] Fahmy, S., Probhakar, S., Avasarala, S., and Younis O., " TCP Over Wireless Links : Mechanisms
and implication " , accepted for publication , Computer Science , Purdue University , pp. 1-9 , 2002 .
[10] Duel-Hallen, A., Hu, S., and Hallen, H., " Long-Range Prediction of Fading Signals:Enabling
Adapting Transmission for Mobile Radio Channels ", IEEE Signal Processing , Vol.17 , no.3 , pp. 1-
4 , May 2000 .
[11] Natani, J., Mohsin, M., and Sharma, V., " TCP For wireless networks ", Computer science Program ,
University of Texas at Dallas , pp. 16-20 , 2001 .
[12] Kandah, F., " Performance Evaluation of TCP's Fast Retransmission over IEEE 802.11's DCF " ,
Master Thesis , Computer Science Department , University of Jordan , Amman , June 2005 .
[13] Klein, E., Leung, K., Parkinson, R., and Samuel, G., “Avoiding Spurious TCP Throughputs in
Wireless Networks by Delay Injection”, Global Telecommunications Conference. GLOBECOM ’04.
IEEE, Vol. 5, no.29, pp. 2754 – 2759, December 2004.
[14] Jacobson, V. “Congestion Avoidance and Control”, Proc. of the Symposium on Communications
Architectures and Protocols (SIGCOMM), Stanford, CA, PP. 314-329, Augest 1988.
[15] Peterson, L., and Davie, B. " Computer Networks : A System Approach " , Morgan Kauffmann,
Vol.3, no.4, pp. 101-115, 2003.
16. International Journal of Computer Networks & Communications (IJCNC) Vol.7, No.3, May 2015
160
[16] Ludwig, R., and Sklower, K., “The Eifel Retransmission Timer ". Computer Communication Review,
Vol.3, no.3, pp. 17-27, 2000.
[17] Kesselman , Y. Mansour " Optimizing TCP Retransmission Timeout " P. Lorenz and P. Dini (Eds.):
ICN 2005, LNCS 3421, Springer-Verlag Berlin Heidelberg, pp. 133–140 , 2005.
[18] Halasa, R., " Studying TCP's Timeout Adaptivity Over Wireless Mobile Ad hoc Networks ", Master
Thesis, University of Jordan, Amman, August 2006.
[19] Da costa, G., " Freeze TCP with timestamps for fast packet loss recovery after disconnections ",
Science direct magazine , Private Bag 4800, Department of Electrical and Computer Engineering,
University of Canterbur , Christchurch, New Zealand, pp. 1792-1796, 2003 .
[20] Kajioka, S., Wakamiya, N., Satoh, H., Monden, K., Hayashi, M., Matsui, S., Murata, M., “ A
QoS-aware routing mechanism for multi-channel multi-interface ad-hoc networks ” . Elsevier – Ad
hoc networks, Vol. 9, no.5, pp. 911 – 927, July 2011.
[21] Lee, K-H., Cho, S., Kim, J-H., “ performance evaluation of network coding in IEEE 802.11
wireless ad hoc networks ” Elsevier – Ad hoc networks, Vol.16 , pp. 131 – 141 , May 2014.
[22] Krishan, T., “Timeout Adaptability for TCP Retransmission Ad Hoc Networks”, Master Thesis, Al
Al-Byte University, Jordan, May 2009.
AUTHOR’S
Tareq t. Krishan Received the BSc. Degree in Computer science from Jerash private
university, Jerash, Jordan in 2004, the MSc. Degree from Al- al Bayt University, al
mafraq, Jordan in 2009. Presently, He is a lecturer with the Computer information
systems department, The University of Jordan – Aqaba. His current research interests
include mobile ad hoc networks, TCP adaptability over wireless networks and mobility.
Adnan M. Al-Smadi received B.S. degree (Magna Cum Laude) and the M.S. degree in
electrical engineering from Tennessee State University, Nashville, TN, USA in 1987
and 1990, respectively. He received the Ph.D. degree in electrical and computer
engineering from Vanderbilt University, Nashville in 1995.
From 1989 to 1991, he was an instructor of Mathematics at Tennessee State University, and from 1991 to
1992, he was an instructor of Mathematics at Fisk University, Nashville. From 1992 to 1995, he was an
instructor of Aeronautical and Industrial Technology at Tennessee State University. In addition, from 1995
to 1997, he was an adjunct Assistant Professor of Electrical and Computer Engineering at Vanderbilt
University. From 1995 to 1997, he served as Interim Department Head of the Aeronautical and Industrial
Technology Department at Tennessee State University. From 1997 to 2006, he joined Hijjawi College for
Engineering Technology as a faculty member of Electronics Engineering at Yarmouk University, Jordan.
From 2002 to 2004, he served as the Chairman of the Department of Electronics Engineering at Yarmouk
University. From 2004 to 2006, Professor Al-Smadi served as the Dean of Hijjawi College for Engineering
Technology. From 2006 to 2010, he was on sabbatical leave as a professor of Computer Science and the
Dean of Prince-Hussein Bin Abdullah College for Information Technology at Al Al-Bayt University in
Jordan. From May 2012 to September 2012, he was the Head of of Quality Assurance & Accreditation
Department at Yarmouk University. From 2009 to 2014, Prof. Al-Smadi served as a Member of the
"Recognition of non-Jordanian Universities & Certificates' Equivalency," Committee at the Ministry of
Higher Education and Scientific Research, Jordan. Since 2013, he has been serving as a "Member of the
Board of Trustees," Jerash Private University, Jordan. In addition, Professor Al-Smadi is serving now as the
Dean of Hijjawi College for Engineering Technology.
Professor Al-Smadi is a Senior Member of the IEEE and a member of Eta Kappa Nu in the USA.