This document proposes an improved quality of service protocol for real-time traffic in mobile ad hoc networks. It presents a modified version of the AODV routing protocol that provides two key improvements: 1) A balanced best-effort traffic aware route discovery mechanism that selects paths with lower ratios of best-effort packets to minimize their impact on real-time traffic. 2) A packet forwarding procedure that gives transmission priority to real-time packets by transmitting them immediately from the queue while best-effort packets have to wait, improving throughput for real-time applications. Simulation results show the proposed protocol performs better than basic AODV in terms of throughput and delay for real-time traffic.
CONGESTION AWARE LINK COST ROUTING FOR MANETSIJCNCJournal
Due to the dynamic topology, self-configuration and decentralized nature of Mobile Ad hoc Network
(MANET), it provides many benefits in wireless networks and is easy to deploy. But the transmission of
data over ad hoc networks has elevated many technical issues for successful routing. Congestion is one of
the important issues which cause performance degradation of a network, due to long delay and high packet
loss. This paper proposes a Congestion aware Link Cost Routing for MANET where the protocol finds a
path with optimized linked cost based on SNR, Link delay, and the and remaining battery power. Along
with this optimization, in this protocol, every node finds its congestion status and participates in the route
discovery on the basis of its status. Data forwarding is also done based on the congestion status at the time
of forwarding. The protocol results in better performance in terms of packet delivery fraction, end to end
delay, throughput, and packet drop when compared to existing protocols.
The congestion control within the TCP (Transmission Control Protocol) plays a critical role in
amending data rate to evade congestion from happening possibilities. Based on TCP communication sender
not only guarantees the successful packet delivery, but also maintains the correct sequence of packets by
receiving the frequent acknowledgement from the receiver. In this research we proposed a congestion
control scheme with modified TCP and queue length variation with OLSR routing protocol in MANET. The
TCP protocol performance is modified by forwarding busy channel signals to predecessor nodes through
intermediate nodes in network. The congestion is controlled by that novel method of detecting the node is
busy or ready for communication. If the communication is start in network and the possibility if congestion
is arise, then in that case the queue length is handle the possibility of congestion. The congestion is
minimized due to awaring about the channel busy status and nodes buffer status or queue status. The TCP
protocol is able to handle the congestion situation but i.e. completely based on acknowledgement of receiver
and also not very effective to control it. The proposed TCP congestion control OLSR routing is improves
the network performance by reducing packet loss. The performance of network is measure through
performance metrics like throughput, PDF and Routing overhead in different node density scenarios. The
performance of proposed scheme is provides the better results.
ECA MODEL BASED QOS AODV ROUTING FOR MANETSIJCNCJournal
Applications like banking, interactive multimedia, movie on demand, VOIP, etc., are delay sensitive by
nature. The QoS given to users will be affected by network delay, which can be mitigated by employing
QoS routing and efficient data transfer. To build routing table, normal AODV routing uses flooding
technique, which will not consider QoS requirements. Hence QoS based routing which is stable for the
entire application is essential, which understands the dynamic nature of the MANET and establishes the
required route, in minimum possible time. We have proposed an intelligent routing protocol based ECA
model and AODV for establishing QoS route.
The simulation results shows that the ECA model gives better results, while considering the local
connectivity time, source to destination connectivity time, number of data packets successfully delivered to
the destination, local and global error correction time, compared to AODV.
EFFICIENT PACKET DELIVERY APPROACH FOR ADHOC WIRELESS NETWORKS cscpconf
A wireless ad-hoc network is a collection of nodes which are selfconfiguring,
connected by wireless links. The nodes are free to move randomly and
organize themselves arbitrarily; thus, the network's topology may change rapidly and
unpredictably. These kinds of networks are very flexible and they do not require any
existing infrastructure. Therefore, ad-hoc wireless networks are suitable for temporary
communication links. The biggest challenge in these kinds of networks is to find a path
between the communication end points of nodes that are mobile. Due to the limited
transmission range of wireless interfaces, the communication traffic has to be relayed
over several intermediate nodes to enable the communication between two nodes.
Therefore, these kinds of networks are also called multi-hop ad-hoc networks. The
proposed model is designed to improve the problems of real-time event-based
communication. It improves the packet delivery ratio by prior prediction and reduces
end-to-end packet delay. This in turn improves performance of the routing process
significantly and increases the Quality of Service (QoS).
Adaptive QoS Multicast Routing with Mobility Prediction in MANETs ijasuc
A Mobile Ad hoc NETwork (MANET) is a collection of wireless mobile hosts that form a temporary network
without a centralized administration or wired infrastructure. Due to the high mobility of nodes, the network
topology of MANETs changes very fast, making it more difficult to find the routes that message packets use.
Network control with Quality of Service (QoS) support is a key issue for multimedia applications in MANET.
Most of the real time applications have stringent requirements on bandwidth, delay, delay-jitter, packet loss
ratio, cost and other QoS metrics. This paper proposes a Multi-constrained QoS routing with mobility
prediction protocol. If the node has enough resources to transmit data packets, it uses the Global
Positioning System (GPS) to get the location information of the mobile nodes and selects the routing path
with the maximum Route Expiration Time (RET). A set of static and mobile agents are used to find the
multicast routes and transmit the packets. Extensive simulations have been conducted to evaluate the
performance of MC_MAODV using Network Simulator (NS-2). The simulation results show that the
proposed protocol achieves good performance in terms of improving packet delivery ratio and minimizing
end-to-end delay.
PERFORMANCES OF AD HOC NETWORKS UNDER DETERMINISTIC AND PROBABILISTIC CHANNEL...IJCNCJournal
Deterministic channel models have been widely used in simulation and modeling of ad hoc network for a long time. But, deterministic channel models are too simple to represent a real-world ad hoc network scenario. Recently, random channel models have drawn considerable attention of the researchers in this field. The results presented in the literature show that random channel models have a grave impact on the
performance of an ad hoc network. A comprehensive investigation on this issue is yet to be available in the
literature. In this investigation, we consider both deterministic and random channel models to investigate their effects on ad hoc networks. We consider two different types of routing protocols namely single path and multipath routing protocols. We choose Destination Sequence Distance Vector (DSDV), Dynamic Source Routing Protocol (DSR), and Ad-hoc On-Demand Distance Vector (AODV) as the single path routing protocols. On the other hand, we choose Ad-hoc On-Demand Multiple Path Distance Vector (AOMDV) as the multipath routing protocol. The results show that some single path routing protocol can outperform multipath routing protocol under both deterministic and random channel conditions. These results surprisingly contradict the popular claim that multipath routing protocol always outperforms single path routing protocol. A guideline for choosing an appropriate routing protocol for adhoc network has also been provided in this work.
CONGESTION AWARE LINK COST ROUTING FOR MANETSIJCNCJournal
Due to the dynamic topology, self-configuration and decentralized nature of Mobile Ad hoc Network
(MANET), it provides many benefits in wireless networks and is easy to deploy. But the transmission of
data over ad hoc networks has elevated many technical issues for successful routing. Congestion is one of
the important issues which cause performance degradation of a network, due to long delay and high packet
loss. This paper proposes a Congestion aware Link Cost Routing for MANET where the protocol finds a
path with optimized linked cost based on SNR, Link delay, and the and remaining battery power. Along
with this optimization, in this protocol, every node finds its congestion status and participates in the route
discovery on the basis of its status. Data forwarding is also done based on the congestion status at the time
of forwarding. The protocol results in better performance in terms of packet delivery fraction, end to end
delay, throughput, and packet drop when compared to existing protocols.
The congestion control within the TCP (Transmission Control Protocol) plays a critical role in
amending data rate to evade congestion from happening possibilities. Based on TCP communication sender
not only guarantees the successful packet delivery, but also maintains the correct sequence of packets by
receiving the frequent acknowledgement from the receiver. In this research we proposed a congestion
control scheme with modified TCP and queue length variation with OLSR routing protocol in MANET. The
TCP protocol performance is modified by forwarding busy channel signals to predecessor nodes through
intermediate nodes in network. The congestion is controlled by that novel method of detecting the node is
busy or ready for communication. If the communication is start in network and the possibility if congestion
is arise, then in that case the queue length is handle the possibility of congestion. The congestion is
minimized due to awaring about the channel busy status and nodes buffer status or queue status. The TCP
protocol is able to handle the congestion situation but i.e. completely based on acknowledgement of receiver
and also not very effective to control it. The proposed TCP congestion control OLSR routing is improves
the network performance by reducing packet loss. The performance of network is measure through
performance metrics like throughput, PDF and Routing overhead in different node density scenarios. The
performance of proposed scheme is provides the better results.
ECA MODEL BASED QOS AODV ROUTING FOR MANETSIJCNCJournal
Applications like banking, interactive multimedia, movie on demand, VOIP, etc., are delay sensitive by
nature. The QoS given to users will be affected by network delay, which can be mitigated by employing
QoS routing and efficient data transfer. To build routing table, normal AODV routing uses flooding
technique, which will not consider QoS requirements. Hence QoS based routing which is stable for the
entire application is essential, which understands the dynamic nature of the MANET and establishes the
required route, in minimum possible time. We have proposed an intelligent routing protocol based ECA
model and AODV for establishing QoS route.
The simulation results shows that the ECA model gives better results, while considering the local
connectivity time, source to destination connectivity time, number of data packets successfully delivered to
the destination, local and global error correction time, compared to AODV.
EFFICIENT PACKET DELIVERY APPROACH FOR ADHOC WIRELESS NETWORKS cscpconf
A wireless ad-hoc network is a collection of nodes which are selfconfiguring,
connected by wireless links. The nodes are free to move randomly and
organize themselves arbitrarily; thus, the network's topology may change rapidly and
unpredictably. These kinds of networks are very flexible and they do not require any
existing infrastructure. Therefore, ad-hoc wireless networks are suitable for temporary
communication links. The biggest challenge in these kinds of networks is to find a path
between the communication end points of nodes that are mobile. Due to the limited
transmission range of wireless interfaces, the communication traffic has to be relayed
over several intermediate nodes to enable the communication between two nodes.
Therefore, these kinds of networks are also called multi-hop ad-hoc networks. The
proposed model is designed to improve the problems of real-time event-based
communication. It improves the packet delivery ratio by prior prediction and reduces
end-to-end packet delay. This in turn improves performance of the routing process
significantly and increases the Quality of Service (QoS).
Adaptive QoS Multicast Routing with Mobility Prediction in MANETs ijasuc
A Mobile Ad hoc NETwork (MANET) is a collection of wireless mobile hosts that form a temporary network
without a centralized administration or wired infrastructure. Due to the high mobility of nodes, the network
topology of MANETs changes very fast, making it more difficult to find the routes that message packets use.
Network control with Quality of Service (QoS) support is a key issue for multimedia applications in MANET.
Most of the real time applications have stringent requirements on bandwidth, delay, delay-jitter, packet loss
ratio, cost and other QoS metrics. This paper proposes a Multi-constrained QoS routing with mobility
prediction protocol. If the node has enough resources to transmit data packets, it uses the Global
Positioning System (GPS) to get the location information of the mobile nodes and selects the routing path
with the maximum Route Expiration Time (RET). A set of static and mobile agents are used to find the
multicast routes and transmit the packets. Extensive simulations have been conducted to evaluate the
performance of MC_MAODV using Network Simulator (NS-2). The simulation results show that the
proposed protocol achieves good performance in terms of improving packet delivery ratio and minimizing
end-to-end delay.
PERFORMANCES OF AD HOC NETWORKS UNDER DETERMINISTIC AND PROBABILISTIC CHANNEL...IJCNCJournal
Deterministic channel models have been widely used in simulation and modeling of ad hoc network for a long time. But, deterministic channel models are too simple to represent a real-world ad hoc network scenario. Recently, random channel models have drawn considerable attention of the researchers in this field. The results presented in the literature show that random channel models have a grave impact on the
performance of an ad hoc network. A comprehensive investigation on this issue is yet to be available in the
literature. In this investigation, we consider both deterministic and random channel models to investigate their effects on ad hoc networks. We consider two different types of routing protocols namely single path and multipath routing protocols. We choose Destination Sequence Distance Vector (DSDV), Dynamic Source Routing Protocol (DSR), and Ad-hoc On-Demand Distance Vector (AODV) as the single path routing protocols. On the other hand, we choose Ad-hoc On-Demand Multiple Path Distance Vector (AOMDV) as the multipath routing protocol. The results show that some single path routing protocol can outperform multipath routing protocol under both deterministic and random channel conditions. These results surprisingly contradict the popular claim that multipath routing protocol always outperforms single path routing protocol. A guideline for choosing an appropriate routing protocol for adhoc network has also been provided in this work.
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.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
DATA TRANSPARENT AUTHENTICATION USING QOD IN HYBRID NETWORKSEditor IJMTER
Hybrid networks are next generation of wireless networks that could be a
combination of Mobile wireless adhoc (MANET) networks and Wireless Infrastructure
networks. They are increasingly utilized in wireless communications that are extremely
supporting real time transmission with restricted Quality of Service. Invalid reservation and
race condition issues happens in MANET. In existing system, QoS-Oriented Distributed
routing protocol (QOD) is employed to boost the QoS support capability of hybrid networks,
it transforms the packet routing problem to resource scheduling problem that has 5
algorithms. They are, QoS guaranteed neighbor selection algorithm, Distributed packet
scheduling algorithm, Mobility based segment resizing algorithm, Traffic redundant
elimination algorithm and Data redundancy elimination based transmission algorithm. The
main drawback of hybrid networks is so far examined in minimum transmission hops and has
less beneficial feature with restricted number of mobile access points, mobility speeds, and
mobile workloads and with different network sizes. It will extremely perform on random
way point model and less in real mobility model. This paper present Data Transparent
Authentication to authenticates data streams by adjusting interpacket delay. Data Transparent
Authentication while not Communication overhead is an approach which reduces breakdown
of original information or sends out of band authentication data.
QOS ROUTING AND PERFORMANCE EVALUATION FOR MOBILE AD HOC NETWORKS USING OLSR ...ijasuc
Mobile Ad-Hoc network is a collection of mobile nodes in communication without using infrastructure.
As the real-time applications used in today’s wireless network grow, we need some schemes to provide
more suitable service for them. We know that most of actual schemes do not perform well on traffic which
is not strictly CBR. Therefore, in this paper we have studied the impact, respectively, of mobility models
and the density of nodes on the performances (End-to-End Delay, Throughput and Packet Delivery ratio)
of routing protocol (Optimized Link State Routing) OLSR by using in the first a real-time VBR (MPEG-4)
and secondly the Constant Bit Rate (CBR) traffic. Finally we compare the performance on both cases.
Experimentally, we considered the three mobility models as follows Random Waypoint, Random
Direction and Mobgen Steady State. The experimental results illustrate that the behavior of OLSR change
according to the model and the used traffics.
Traffic-aware adaptive server load balancing for softwaredefined networks IJECEIAES
Servers in data center networks handle heterogeneous bulk loads. Load balancing, therefore, plays an important role in optimizing network bandwidth and minimizing response time. A complete knowledge of the current network status is needed to provide a stable load in the network. The process of network status catalog in a traditional network needs additional processing which increases complexity, whereas, in software defined networking, the control plane monitors the overall working of the network continuously. Hence it is decided to propose an efficient load balancing algorithm that adapts SDN. This paper proposes an efficient algorithm TAASLB-traffic-aware adaptive server load balancing to balance the flows to the servers in a data center network. It works based on two parameters, residual bandwidth, and server capacity. It detects the elephant flows and forwards them towards the optimal server where it can be processed quickly. It has been tested with the Mininet simulator and gave considerably better results compared to the existing server load balancing algorithms in the floodlight controller. After experimentation and analysis, it is understood that the method provides comparatively better results than the existing load balancing algorithms.
Engineering Research Publication
Best International Journals, High Impact Journals,
International Journal of Engineering & Technical Research
ISSN : 2321-0869 (O) 2454-4698 (P)
www.erpublication.org
Joint Routing and Congestion Control in Multipath Channel based on Signal to ...IJECEIAES
Routing protocol and congestion control in Transmission Control Protocol (TCP) have important roles in wireless mobile network performance. In wireless communication, the stability of the path and successful data transmission will be influenced by the channel condition. This channel condition constraints come from path loss and the multipath channel fading. With these constraints, the algorithm in the routing protocol and congestion control is confronted with the uncertainty of connection quality and probability of successful packet transmission, respectively. It is important to investigate the reliability and robustness of routing protocol and congestion control algorithms in dealing with such situation. In this paper, we develop a detailed approach and analytical throughput performance with a cross layer scheme (CLS) between routing and congestion control mechanism based on signal to noise ratio (SNR) in Rician and Rayleigh as multipath fading channel. We proposed joint routing and congestion control TCP with a cross layer scheme model based on SNR (RTCP-SNR). We compare the performance of RTCP-SNR with conventional routing-TCP and routing-TCP that used CLS with routing aware (RTCP-RA) model. The analyses and the simulation results showed that RTCP-SNR in a multipath channel outperforms conventional routing-TCP and RTCP-RA.
Design and analysis of routing protocol for cognitive radio ad hoc networks i...IJECEIAES
Multi-hop routing protocol in cognitive radio mobile ad hoc networks (CRMANETs) is a critical issue. Furthermore, the routing metric used in multi-hop CRMANETs should reflect the bands availability, the links quality, the PU activities and quality of service (QoS) requirements of SUs. For the best of our knowledge, many of researchers investigated the performance of the different routing protocols in a homogeneous environment only. In this paper, we propose a heterogeneous cognitive radio routing protocol (HCR) operates in heterogeneous environment (i.e. the route from source to destination utilize the licensed and unlicensed spectrum bands). The proposed routing protocol is carefully developed to make a tradeoff between the channel diversity of the routing path along with the CRMANETs throughput. Using simulations, we discuss the performance of the proposed HCR routing protocol and compare it with the AODV routing protocol using a discrete-event simulation which we developed using JAVA platform.
ENERGY LOCATION AWARE ROUTING PROTOCOL (ELARP) FOR WIRELESS MULTIMEDIA SENSOR...ijcsit
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding
environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in
volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks
(WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end
delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover
multipath and sending data via these different paths improve the bandwidth and decrease the end to end
delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive
multipath routing protocol establishing three paths with awareness of node’s residual energy and distance.
ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for
multimedia data in terms of end to end delay and packet delivery ratio.
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.
Mobile ad hoc network is a reconfigurable network of mobile nodes connected by multi-hop wireless links and capable of operating without any fixed infrastructure support. In order to facilitate communication within such self-creating, self-organizing and self administrating network, a dynamic routing protocol is needed. The primary goal of such an ad hoc network routing protocol is to discover and establish a correct and efficient route between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This paper examines two routing protocols, both on-demand source routing, for mobile ad hoc networks– the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based and evaluates both routing protocols in terms of packet delivery fraction, normalized routing load, average end to end delay, throughput by varying number of nodes per sq. km, traffic sources and mobility. Simulation results show that in high
mobility (pause time 0s) scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
Design and implementation of new routingIJCNCJournal
Energy consumption is a key element in the Wireless Sensor Networks (WSNs) design. Indeed, sensor nodes are really constrained by energy supply. Hence, how to improve the network lifetime is a crucial and challenging task. Several techniques are available at different levels of the OSI model to maximize the WSN lifetime and especially at the network layer which uses routing strategies to maintain the routes in the network and guarantee reliable communication. In this paper we intend to propose a new protocol called
Combined Energy and Distance Metrics Dynamic Routing Protocol (CEDM-DR). Our new approach considers not only the distance between wireless sensors but also the energy of node acting as a router in order to find the optimal path and achieve a dynamic and adaptive routing.
The performance metrics exploited for the evaluation of our protocol are average energy consumed, network lifetime and packets lost. By comparing our proposed routing strategy to protocol widely used in WSN namely Ad hoc On demand Distance Vector(AODV), simulation results show that CEDM-DR strategy might effectively balance the sensor power consumption and permits accordingly to enhance the network
lifetime. As well, this new protocol yields a noticeable energy saving compared to its counterpart.
An Efficient Queuing Model for Resource Sharing in Cloud Computingtheijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
New Two-Step Method with Fifth-Order Convergence for Solving Nonlinear Equationsinventionjournals
International Journal of Mathematics and Statistics Invention (IJMSI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJMSI publishes research articles and reviews within the whole field Mathematics and Statistics, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online
Windstream Hosted Solutions: Public Cloud SecurityJason Proctor
Cloud computing presents a number of unique benefits as compared to traditional or virtualized IT environments. Cloud computing shifts capital expenses (CAPEX) to operational expenses (OPEX) and introduces a new
level of speed, flexibility and scale to the IT organization. These benefits help overcome challenges faced by IT organizations, including rapidly changing technology, budget constraints and time-to-market pressures.
While cloud services can yield a number of advantages, this new model for computing also raises a few new questions.
Zagami, J. (2012). Social Ecological Model Analysis for Institutional ICT Integration Efforts. In P. Resta (Ed.), Proceedings of Society for Information Technology & Teacher Education International Conference 2012 (pp. 1301-1306). Chesapeake, VA: AACE.
Retrieved from http://www.editlib.org/p/39760.
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.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
DATA TRANSPARENT AUTHENTICATION USING QOD IN HYBRID NETWORKSEditor IJMTER
Hybrid networks are next generation of wireless networks that could be a
combination of Mobile wireless adhoc (MANET) networks and Wireless Infrastructure
networks. They are increasingly utilized in wireless communications that are extremely
supporting real time transmission with restricted Quality of Service. Invalid reservation and
race condition issues happens in MANET. In existing system, QoS-Oriented Distributed
routing protocol (QOD) is employed to boost the QoS support capability of hybrid networks,
it transforms the packet routing problem to resource scheduling problem that has 5
algorithms. They are, QoS guaranteed neighbor selection algorithm, Distributed packet
scheduling algorithm, Mobility based segment resizing algorithm, Traffic redundant
elimination algorithm and Data redundancy elimination based transmission algorithm. The
main drawback of hybrid networks is so far examined in minimum transmission hops and has
less beneficial feature with restricted number of mobile access points, mobility speeds, and
mobile workloads and with different network sizes. It will extremely perform on random
way point model and less in real mobility model. This paper present Data Transparent
Authentication to authenticates data streams by adjusting interpacket delay. Data Transparent
Authentication while not Communication overhead is an approach which reduces breakdown
of original information or sends out of band authentication data.
QOS ROUTING AND PERFORMANCE EVALUATION FOR MOBILE AD HOC NETWORKS USING OLSR ...ijasuc
Mobile Ad-Hoc network is a collection of mobile nodes in communication without using infrastructure.
As the real-time applications used in today’s wireless network grow, we need some schemes to provide
more suitable service for them. We know that most of actual schemes do not perform well on traffic which
is not strictly CBR. Therefore, in this paper we have studied the impact, respectively, of mobility models
and the density of nodes on the performances (End-to-End Delay, Throughput and Packet Delivery ratio)
of routing protocol (Optimized Link State Routing) OLSR by using in the first a real-time VBR (MPEG-4)
and secondly the Constant Bit Rate (CBR) traffic. Finally we compare the performance on both cases.
Experimentally, we considered the three mobility models as follows Random Waypoint, Random
Direction and Mobgen Steady State. The experimental results illustrate that the behavior of OLSR change
according to the model and the used traffics.
Traffic-aware adaptive server load balancing for softwaredefined networks IJECEIAES
Servers in data center networks handle heterogeneous bulk loads. Load balancing, therefore, plays an important role in optimizing network bandwidth and minimizing response time. A complete knowledge of the current network status is needed to provide a stable load in the network. The process of network status catalog in a traditional network needs additional processing which increases complexity, whereas, in software defined networking, the control plane monitors the overall working of the network continuously. Hence it is decided to propose an efficient load balancing algorithm that adapts SDN. This paper proposes an efficient algorithm TAASLB-traffic-aware adaptive server load balancing to balance the flows to the servers in a data center network. It works based on two parameters, residual bandwidth, and server capacity. It detects the elephant flows and forwards them towards the optimal server where it can be processed quickly. It has been tested with the Mininet simulator and gave considerably better results compared to the existing server load balancing algorithms in the floodlight controller. After experimentation and analysis, it is understood that the method provides comparatively better results than the existing load balancing algorithms.
Engineering Research Publication
Best International Journals, High Impact Journals,
International Journal of Engineering & Technical Research
ISSN : 2321-0869 (O) 2454-4698 (P)
www.erpublication.org
Joint Routing and Congestion Control in Multipath Channel based on Signal to ...IJECEIAES
Routing protocol and congestion control in Transmission Control Protocol (TCP) have important roles in wireless mobile network performance. In wireless communication, the stability of the path and successful data transmission will be influenced by the channel condition. This channel condition constraints come from path loss and the multipath channel fading. With these constraints, the algorithm in the routing protocol and congestion control is confronted with the uncertainty of connection quality and probability of successful packet transmission, respectively. It is important to investigate the reliability and robustness of routing protocol and congestion control algorithms in dealing with such situation. In this paper, we develop a detailed approach and analytical throughput performance with a cross layer scheme (CLS) between routing and congestion control mechanism based on signal to noise ratio (SNR) in Rician and Rayleigh as multipath fading channel. We proposed joint routing and congestion control TCP with a cross layer scheme model based on SNR (RTCP-SNR). We compare the performance of RTCP-SNR with conventional routing-TCP and routing-TCP that used CLS with routing aware (RTCP-RA) model. The analyses and the simulation results showed that RTCP-SNR in a multipath channel outperforms conventional routing-TCP and RTCP-RA.
Design and analysis of routing protocol for cognitive radio ad hoc networks i...IJECEIAES
Multi-hop routing protocol in cognitive radio mobile ad hoc networks (CRMANETs) is a critical issue. Furthermore, the routing metric used in multi-hop CRMANETs should reflect the bands availability, the links quality, the PU activities and quality of service (QoS) requirements of SUs. For the best of our knowledge, many of researchers investigated the performance of the different routing protocols in a homogeneous environment only. In this paper, we propose a heterogeneous cognitive radio routing protocol (HCR) operates in heterogeneous environment (i.e. the route from source to destination utilize the licensed and unlicensed spectrum bands). The proposed routing protocol is carefully developed to make a tradeoff between the channel diversity of the routing path along with the CRMANETs throughput. Using simulations, we discuss the performance of the proposed HCR routing protocol and compare it with the AODV routing protocol using a discrete-event simulation which we developed using JAVA platform.
ENERGY LOCATION AWARE ROUTING PROTOCOL (ELARP) FOR WIRELESS MULTIMEDIA SENSOR...ijcsit
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding
environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in
volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks
(WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end
delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover
multipath and sending data via these different paths improve the bandwidth and decrease the end to end
delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive
multipath routing protocol establishing three paths with awareness of node’s residual energy and distance.
ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for
multimedia data in terms of end to end delay and packet delivery ratio.
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.
Mobile ad hoc network is a reconfigurable network of mobile nodes connected by multi-hop wireless links and capable of operating without any fixed infrastructure support. In order to facilitate communication within such self-creating, self-organizing and self administrating network, a dynamic routing protocol is needed. The primary goal of such an ad hoc network routing protocol is to discover and establish a correct and efficient route between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This paper examines two routing protocols, both on-demand source routing, for mobile ad hoc networks– the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based and evaluates both routing protocols in terms of packet delivery fraction, normalized routing load, average end to end delay, throughput by varying number of nodes per sq. km, traffic sources and mobility. Simulation results show that in high
mobility (pause time 0s) scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
Design and implementation of new routingIJCNCJournal
Energy consumption is a key element in the Wireless Sensor Networks (WSNs) design. Indeed, sensor nodes are really constrained by energy supply. Hence, how to improve the network lifetime is a crucial and challenging task. Several techniques are available at different levels of the OSI model to maximize the WSN lifetime and especially at the network layer which uses routing strategies to maintain the routes in the network and guarantee reliable communication. In this paper we intend to propose a new protocol called
Combined Energy and Distance Metrics Dynamic Routing Protocol (CEDM-DR). Our new approach considers not only the distance between wireless sensors but also the energy of node acting as a router in order to find the optimal path and achieve a dynamic and adaptive routing.
The performance metrics exploited for the evaluation of our protocol are average energy consumed, network lifetime and packets lost. By comparing our proposed routing strategy to protocol widely used in WSN namely Ad hoc On demand Distance Vector(AODV), simulation results show that CEDM-DR strategy might effectively balance the sensor power consumption and permits accordingly to enhance the network
lifetime. As well, this new protocol yields a noticeable energy saving compared to its counterpart.
An Efficient Queuing Model for Resource Sharing in Cloud Computingtheijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
New Two-Step Method with Fifth-Order Convergence for Solving Nonlinear Equationsinventionjournals
International Journal of Mathematics and Statistics Invention (IJMSI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJMSI publishes research articles and reviews within the whole field Mathematics and Statistics, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online
Windstream Hosted Solutions: Public Cloud SecurityJason Proctor
Cloud computing presents a number of unique benefits as compared to traditional or virtualized IT environments. Cloud computing shifts capital expenses (CAPEX) to operational expenses (OPEX) and introduces a new
level of speed, flexibility and scale to the IT organization. These benefits help overcome challenges faced by IT organizations, including rapidly changing technology, budget constraints and time-to-market pressures.
While cloud services can yield a number of advantages, this new model for computing also raises a few new questions.
Zagami, J. (2012). Social Ecological Model Analysis for Institutional ICT Integration Efforts. In P. Resta (Ed.), Proceedings of Society for Information Technology & Teacher Education International Conference 2012 (pp. 1301-1306). Chesapeake, VA: AACE.
Retrieved from http://www.editlib.org/p/39760.
AN IMPROVED ITERATIVE METHOD FOR SOLVING GENERAL SYSTEM OF EQUATIONS VIA GENE...Zac Darcy
Various algorithms are known for solving linear system of equations. Iteration methods for solving the
large sparse linear systems are recommended. But in the case of general n× m matrices the classic
iterative algorithms are not applicable except for a few cases. The algorithm presented here is based on the
minimization of residual of solution and has some genetic characteristics which require using Genetic
Algorithms. Therefore, this algorithm is best applicable for construction of parallel algorithms. In this
paper, we describe a sequential version of proposed algorithm and present its theoretical analysis.
Moreover we show some numerical results of the sequential algorithm and supply an improved algorithm
and compare the two algorithms.
Jean Cardinal (Computer Science Department, Université Libre de Bruxelles)
Sorting and a Tale of Two Polytopes
Algorithms & Permutations 2012, Paris.
http://igm.univ-mlv.fr/AlgoB/algoperm2012/
Backtracking based integer factorisation, primality testing and square root c...csandit
Breaking a big integer into two factors is a famous problem in the field of Mathematics and
Cryptography for years. Many crypto-systems use such a big number as their key or part of a
key with the assumption - it is too big that the fastest factorisation algorithms running on the
fastest computers would take impractically long period of time to factorise. Hence, many efforts
have been provided to break those crypto-systems by finding two factors of an integer for
decades. In this paper, a new factorisation technique is proposed which is based on the concept
of backtracking. Binary bit by bit operations are performed to find two factors of a given
integer. This proposed solution can be applied in computing square root, primality test, finding
prime factors of integer numbers etc. If the proposed solution is proven to be efficient enough, it
may break the security of many crypto-systems. Implementation and performance comparison of
the technique is kept for future research.
Startup & Change the World: Guide for Young Social Entrepreneursxmergnc
Get a copy: https://gumroad.com/l/AOg
Simple, yet comprehensive guide on social entrepreneurship. Part of the United Nations course curriculum on social entrepreneurship.
REDUCTION IN THE TRANSIENT TIME OF SHUNT ACTIVE FILTERS USING INTELLIGENT CON...ijscmc
This paper deals with the implementation of new proposed strategy for the reduction in the transient time of
shunt active filter using intelligent controllers. Intelligent control is a class of control techniques that use
various AI computing approaches like fuzzy logic, neural network, evolutionary computation, genetic
algorithm etc. The proposed strategy works on the principle of energy of the capacitor to maintain the DClink
voltage of shunt connected active filter and thus reduces the transient time whenever there is sudden
change in the load. A comparison using the PI controller, Fuzzy logic controller and Artificial neural
controller has been made using MATLAB Simulink Power System Toolbox.
Webinar Monitoring in era of cloud computingCREATE-NET
The webinar "Monitoring in era of cloud computing" covers the topics:
1. What is Monitoring
2. Ceilometer
- Architecture
- Agents (Compute/Central)
- Storage & API
- Quick Demo
3. Monasca
- Architecture
- Events/Messages
- Storage & API
- Quick Demo
Georgia Tech: Performance Engineering - Queuing Theory and Predictive ModelingBrian Wilson
This is one lecture in a semester long course \'CS4803EPR\' I put together and taught at Georgia Tech, entitled "Enterprise Computing Performance Engineering"
----
Performance Engineering Overview - Part 2…
Queuing Theory Overview
Early life-cycle performance modeling
Simple Distributed System Model
Sequence Diagrams
Global web tutors experts provides you help in writing all types of subjects assignment especially for Computer graphics Assignment help. If you need any help in any subject then you can avail our services via call, chat or email to our experts. Our experts are available 24*7.
Big Data and Advanced Data Intensive ComputingJongwook Woo
MapReduce is not working well at real time processing and iterative algorithm, which are mostly for machine learning and graph algorithms. This slide shows Spark, Giraph and Hadoop use cases in Science not in Business.
Adaptive Bandwidth Management Model for Wireless Mobile Ad-hoc NetworkIJCNCJournal
The quality of service (QoS) component in a mobile ad-hoc network has an active role in the current network scenario. In a dynamic mobile ad hoc network, ensuring optimum QoS with a scarce network resource is a significant challenge. To achieve QoS, it is essential to adopt some effective and efficient mechanisms. We have proposed an adaptive bandwidth manager model (ABMM) which uses a bandwidthsharing concept along with the flexible bandwidth reservation algorithm (FBRA) for an effective, quick and authentic data transfer. During real-time data transfer, to make communication effective, we make use of bandwidth-sharing network design problems and the concept of reserving bandwidth in high-performance networks. In our proposed model we are concentrating on the maximum utilization of resources, and using the scheduling concept to provide the minimum required bandwidth guarantee to QoS flows. Our goal is to reduce the delay in data transfer and enhance the throughput while properly utilizing the system resources. Our simulation result also shows that our model improves the network performance.
ADAPTIVE BANDWIDTH MANAGEMENT MODEL FOR WIRELESS MOBILE AD-HOC NETWORKIJCNCJournal
The quality of service (QoS) component in a mobile ad-hoc network has an active role in the current
network scenario. In a dynamic mobile ad hoc network, ensuring optimum QoS with a scarce network
resource is a significant challenge. To achieve QoS, it is essential to adopt some effective and efficient
mechanisms. We have proposed an adaptive bandwidth manager model (ABMM) which uses a bandwidthsharing concept along with the flexible bandwidth reservation algorithm (FBRA) for an effective, quick and
authentic data transfer. During real-time data transfer, to make communication effective, we make use of
bandwidth-sharing network design problems and the concept of reserving bandwidth in high-performance
networks. In our proposed model we are concentrating on the maximum utilization of resources, and using
the scheduling concept to provide the minimum required bandwidth guarantee to QoS flows. Our goal is to
reduce the delay in data transfer and enhance the throughput while properly utilizing the system resources.
Our simulation result also shows that our model improves the network performance.
Reliable and efficient data dissemination scheme in VANET: a review IJECEIAES
Vehicular ad-hoc network (VANET), identified as a mobile ad hoc network MANETs with several added constraints. Basically, in VANETs, the network is established on the fly based on the availability of vehicles on roads and supporting infrastructures along the roads, such as base stations. Vehicles and road-side infrastructures are required to provide communication facilities, particularly when enough vehicles are not available on the roads for effective communication. VANETs are crucial for providing a wide range of safety and non-safety applications to road users. However, the specific fundamental problem in VANET is the challenge of creating effective communication between two fast-moving vehicles. Therefore, message routing is an issue for many safety and non-safety of VANETs applications. The challenge in designing a robust but reliable message dissemination technique is primarily due to the stringent QoS requirements of the VANETs safety applications. This paper investigated various methods and conducted literature on an idea to develop a model for efficient and reliable message dissemination routing techniques in VANET.
A cross layer delay-aware node disjoint multipath routing algorithm for mobil...ijwmn
Mobile Ad Hoc Networks (MANETS) require reliable routing and Quality of Service(QoS) mechanism to
support diverse applications with varying and stringent requirements for delay, jitter, bandwidth, packets
loss. Routing protocols such as AODV, AOMDV, DSR and OLSR use shortest path with minimum hop
count as the main metric for path selection, hence are not suitable for delay sensitive real time
applications. To support such applications delay constrained routing protocols are employed. These
Protocols makes path selection between source and destination based on the delay over the discovered
links during routing discovery and routing table calculations. We propose a variation of a node-disjoint
Multipath QoS Routing protocol called Cross Layer Delay aware Node Disjoint Multipath AODV (CLDMAODV)
based on delay constraint. It employs cross-layer communications between MAC and routing
layers to achieve link and channel-awareness. It regularly updates the path status in terms of lowest delay
incurred at each intermediate node. Performance of the proposed protocol is compared with single path
AODV and NDMR protocols. Proposed CLDM-AODV is superior in terms of better packet delivery and
reduced overhead between intermediate nodes.
International Journal of Engineering Research and Applications (IJERA) aims to cover the latest outstanding developments in the field of all Engineering Technologies & science.
International Journal of Engineering Research and Applications (IJERA) is a team of researchers not publication services or private publications running the journals for monetary benefits, we are association of scientists and academia who focus only on supporting authors who want to publish their work. The articles published in our journal can be accessed online, all the articles will be archived for real time access.
Our journal system primarily aims to bring out the research talent and the works done by sciaentists, academia, engineers, practitioners, scholars, post graduate students of engineering and science. This journal aims to cover the scientific research in a broader sense and not publishing a niche area of research facilitating researchers from various verticals to publish their papers. It is also aimed to provide a platform for the researchers to publish in a shorter of time, enabling them to continue further All articles published are freely available to scientific researchers in the Government agencies,educators and the general public. We are taking serious efforts to promote our journal across the globe in various ways, we are sure that our journal will act as a scientific platform for all researchers to publish their works online.
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.
Rough set based QoS enabled multipath source routing in MANET IJECEIAES
The single constrained Quality of Service (QoS) routing in Mobile Ad-hoc NETwork (MANET) is disastrous in consideration of MANET characteristics, inference, collision and link failure as it maintains a single path. The QoS enabled routing yields better packet delivery and maintains consistency among nodes in the network by incorporating multi-constrained and multipath routing. The Dynamic Source Routing (DSR) is best suited source routing algorithm to maintain multipath information at the source node, but performance degrades with larger number of mobile nodes. Multilayer mechanism should be incorporated to maintain QoS metric information spreads across multiple layers of TCP/IP protocol stack. The proposed multipath QoS enabled source routing provides balanced routing by making use of all these features. The imprecise decision making strategy called Rough Set Theory (RST) is used at destination node for decision making. The Route REQuest (RREQ) messages coming from different routes are filtered by considering the QoS metrics of each and every route by making use of RST. The Route REPly (RREP) messages are generated and delivered to the source node for filtered RREQ messages. The proposed routing algorithm will reduce load on the network by reducing number of control messages exchanged for route establishment. This will evenly distribute load among all the nodes and it also avoid the scenarios like few nodes starved for resources. Finally, multipath routing always provides alternate routing option in case of route failure.
In this project, we proposed a framework to support heterogenous traffic with different QoS demand in
WiMAX. This framework dynamically changes the bandwidth allocation (BA) for ongoing and new arrival
connections based on network condition and service demand. The objective is to efficiently use the
available bandwidth and provide QoS support in a fair manner. Dynamic allocation of spectrum prior to
transmission can mitigate the starvation problem of Non Real time application. The WFQ based dynamic
bandwidth allocation framework uses architecture that has packet scheduler scheme (PS), call admission
policy and a dynamic bandwidth allocation mechanism. By the simulation result we have showed that this
architecture could provide QoS support by being fair to all classes of services.
Quality of Service Routing in Mobile Ad Hoc Networks Using Location and Energ...ijwmn
Mobile Ad hoc Networks are highly dynamic networks. Quality of Service (QoS) routing in such networks is usually limited by the network breakage due to either node mobility or energy depletion of the mobile nodes. Also, to fulfill certain quality parameters, presence of multiple node-disjoint paths becomes essential. Such paths aid in the optimal traffic distribution and reliability in case of path breakages. Thus, to cater such problem, we present a node-disjoint multipath protocol. The metric used to select the paths takes into account the stability of the nodes and the corresponding links. The proposed technique is also illustrated with an example.
QUALITY OF SERVICE ROUTING IN MOBILE AD HOC NETWORKS USING LOCATION AND ENERG...ijwmn
Mobile Ad hoc Networks are highly dynamic networks. Quality of Service (QoS) routing in such networks is usually limited by the network breakage due to either node mobility or energy depletion of the mobile nodes. Also, to fulfill certain quality parameters, presence of multiple node-disjoint paths becomes essential. Such paths aid in the optimal traffic distribution and reliability in case of path breakages. Thus, to cater such problem, we present a node-disjoint multi path protocol. The metric used to select the paths takes into account the stability of the nodes and the corresponding links. The proposed technique is also illustrated with an example.
A Cross-Layer Based Multipath Routing Protocol To Improve QoS In Mobile Adhoc...IDES Editor
In Mobile ad hoc networks, due to the high packet loss rates
and frequent topological changes, the unbalanced transport
layer and reserved amount of traffic is carried out by the
network. In a QoS based routing metric for MANETs, it is
necessary to combine the minimum available bandwidth and
end-to-end delay along with the congestion around a link. In
this paper, a cross layer based multipath routing (CBMR)
protocol to improve QoS in mobile ad hoc networks to allot
weights to individual links, depending on the metrics link
quality, channel quality and end-to-end delay is developed. In
order to validate load balancing and interference between the
links using the same channel, the individual link weights are
integrated into a routing metric. Therefore, the weight value
helps the routing protocol to avoid the routing traffic through
the congested area hence the traffic is balanced and the
network capacity is improved. Then the proportion of traffic
to be routed to each neighbor is selected to execute routing
such that the weight of the node is a minimum. We also
propose an enhanced TCP congestion control mechanism for
wireless networks, based on a cross-layer scheme. By our
simulation results, the robustness of our protocol achieves
increased packet delivery ratio with reduced latency was
demonstrated.
A cross layer delay-aware multipath routing algorithm for mobile adhoc networkscsandit
Mobile Ad Hoc Networks (MANETS) require reliable routing and Quality of Service(QoS)
mechanism to support diverse applications with varying and stringent requirements. Routing
protocols such as AODV, AOMDV, DSR and OLSR use minimum hop count as the metric for
path selection, hence are not suitable for delay sensitive real time applications. To support such
applications delay constrained routing protocols are employed. These Protocols makes path
selection based on the delay over the discovered links during routing discovery and routing
table calculations. We propose a variation of a node-disjoint Multipath QoS Routing protocol
called Cross Layer Delay aware Node Disjoint Multipath AODV (CLDM-AODV) based on
delay constraint. It employs cross-layer communications between MAC and routing layers to
achieve link and channel-awareness. It regularly updates the path status in terms of lowest
delay incurred at each intermediate node. Performance of the proposed protocol is compared
with single path AODV and NDMR protocols. Proposed CLDM-AODV is superior in terms of
better packet delivery and reduced overhead between intermediate nodes.
ACR: A CLUSTER-BASED ROUTING PROTOCOL FOR VANET ijwmn
Clustering is a technique used in network routing to enhance the performance and conserve the network
resources. This paper presents a cluster-based routing protocol for VANET utilizing a new addressing
scheme in which each node gets an address according to its mobility pattern. Hamming distance technique
is used then to partition the network in an address-centric manner. The simulation results show that this
protocol enhances routing reachability, whereas reduces routing end-to-end delay and traffic received
comparing with two benchmarks namely AODV and DSDV.
ACR: A CLUSTER-BASED ROUTING PROTOCOL FOR VANET ijwmn
Clustering is a technique used in network routing to enhance the performance and conserve the network resources. This paper presents a cluster-based routing protocol for VANET utilizing a new addressing scheme in which each node gets an address according to its mobility pattern. Hamming distance technique is used then to partition the network in an address-centric manner. The simulation results show that this protocol enhances routing reachability, whereas reduces routing end-to-end delay and traffic received
comparing with two benchmarks namely AODV and DSDV.
SNR/RP Aware Routing Algorithm: Cross-Layer Design for MANETSijwmn
Routing in MANET is complex due to the fact that the network graph is episodically connected and nodes get only intermittently connected because of nodes mobility, terrain, weather, and jamming that change topology rapidly. In this paper, we propose cross-layer design to achieve a reliable data transmission in MANET. A key challenge is to create a mechanism that can provide good delivery performance and high quality of service in intermittent networks. The key components of our approach include a cross-layer design (CLD) to improve information sharing between different protocol layers. In order to improve the end-to-end performance of MANET, we present mechanism that allows the network layer to adjust its routing protocol dynamically based on SNR and Received Power along the end-to-end routing path for each transmission link. We evaluate our approach using one of common MANET routing protocols, DSR, to illustrate that our CLD improved the performance of DSR.
Similar to IMPROVED QUALITY OF SERVICE PROTOCOL FOR REAL TIME TRAFFIC IN MANET (20)
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.
Search and Society: Reimagining Information Access for Radical FuturesBhaskar Mitra
The field of Information retrieval (IR) is currently undergoing a transformative shift, at least partly due to the emerging applications of generative AI to information access. In this talk, we will deliberate on the sociotechnical implications of generative AI for information access. We will argue that there is both a critical necessity and an exciting opportunity for the IR community to re-center our research agendas on societal needs while dismantling the artificial separation between the work on fairness, accountability, transparency, and ethics in IR and the rest of IR research. Instead of adopting a reactionary strategy of trying to mitigate potential social harms from emerging technologies, the community should aim to proactively set the research agenda for the kinds of systems we should build inspired by diverse explicitly stated sociotechnical imaginaries. The sociotechnical imaginaries that underpin the design and development of information access technologies needs to be explicitly articulated, and we need to develop theories of change in context of these diverse perspectives. Our guiding future imaginaries must be informed by other academic fields, such as democratic theory and critical theory, and should be co-developed with social science scholars, legal scholars, civil rights and social justice activists, and artists, among others.
State of ICS and IoT Cyber Threat Landscape Report 2024 previewPrayukth K V
The IoT and OT threat landscape report has been prepared by the Threat Research Team at Sectrio using data from Sectrio, cyber threat intelligence farming facilities spread across over 85 cities around the world. In addition, Sectrio also runs AI-based advanced threat and payload engagement facilities that serve as sinks to attract and engage sophisticated threat actors, and newer malware including new variants and latent threats that are at an earlier stage of development.
The latest edition of the OT/ICS and IoT security Threat Landscape Report 2024 also covers:
State of global ICS asset and network exposure
Sectoral targets and attacks as well as the cost of ransom
Global APT activity, AI usage, actor and tactic profiles, and implications
Rise in volumes of AI-powered cyberattacks
Major cyber events in 2024
Malware and malicious payload trends
Cyberattack types and targets
Vulnerability exploit attempts on CVEs
Attacks on counties – USA
Expansion of bot farms – how, where, and why
In-depth analysis of the cyber threat landscape across North America, South America, Europe, APAC, and the Middle East
Why are attacks on smart factories rising?
Cyber risk predictions
Axis of attacks – Europe
Systemic attacks in the Middle East
Download the full report from here:
https://sectrio.com/resources/ot-threat-landscape-reports/sectrio-releases-ot-ics-and-iot-security-threat-landscape-report-2024/
Accelerate your Kubernetes clusters with Varnish CachingThijs Feryn
A presentation about the usage and availability of Varnish on Kubernetes. This talk explores the capabilities of Varnish caching and shows how to use the Varnish Helm chart to deploy it to Kubernetes.
This presentation was delivered at K8SUG Singapore. See https://feryn.eu/presentations/accelerate-your-kubernetes-clusters-with-varnish-caching-k8sug-singapore-28-2024 for more details.
PHP Frameworks: I want to break free (IPC Berlin 2024)Ralf Eggert
In this presentation, we examine the challenges and limitations of relying too heavily on PHP frameworks in web development. We discuss the history of PHP and its frameworks to understand how this dependence has evolved. The focus will be on providing concrete tips and strategies to reduce reliance on these frameworks, based on real-world examples and practical considerations. The goal is to equip developers with the skills and knowledge to create more flexible and future-proof web applications. We'll explore the importance of maintaining autonomy in a rapidly changing tech landscape and how to make informed decisions in PHP development.
This talk is aimed at encouraging a more independent approach to using PHP frameworks, moving towards a more flexible and future-proof approach to PHP development.
Neuro-symbolic is not enough, we need neuro-*semantic*Frank van Harmelen
Neuro-symbolic (NeSy) AI is on the rise. However, simply machine learning on just any symbolic structure is not sufficient to really harvest the gains of NeSy. These will only be gained when the symbolic structures have an actual semantics. I give an operational definition of semantics as “predictable inference”.
All of this illustrated with link prediction over knowledge graphs, but the argument is general.
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...UiPathCommunity
💥 Speed, accuracy, and scaling – discover the superpowers of GenAI in action with UiPath Document Understanding and Communications Mining™:
See how to accelerate model training and optimize model performance with active learning
Learn about the latest enhancements to out-of-the-box document processing – with little to no training required
Get an exclusive demo of the new family of UiPath LLMs – GenAI models specialized for processing different types of documents and messages
This is a hands-on session specifically designed for automation developers and AI enthusiasts seeking to enhance their knowledge in leveraging the latest intelligent document processing capabilities offered by UiPath.
Speakers:
👨🏫 Andras Palfi, Senior Product Manager, UiPath
👩🏫 Lenka Dulovicova, Product Program Manager, UiPath
UiPath Test Automation using UiPath Test Suite series, part 3DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 3. In this session, we will cover desktop automation along with UI automation.
Topics covered:
UI automation Introduction,
UI automation Sample
Desktop automation flow
Pradeep Chinnala, Senior Consultant Automation Developer @WonderBotz and UiPath MVP
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered QualityInflectra
In this insightful webinar, Inflectra explores how artificial intelligence (AI) is transforming software development and testing. Discover how AI-powered tools are revolutionizing every stage of the software development lifecycle (SDLC), from design and prototyping to testing, deployment, and monitoring.
Learn about:
• The Future of Testing: How AI is shifting testing towards verification, analysis, and higher-level skills, while reducing repetitive tasks.
• Test Automation: How AI-powered test case generation, optimization, and self-healing tests are making testing more efficient and effective.
• Visual Testing: Explore the emerging capabilities of AI in visual testing and how it's set to revolutionize UI verification.
• Inflectra's AI Solutions: See demonstrations of Inflectra's cutting-edge AI tools like the ChatGPT plugin and Azure Open AI platform, designed to streamline your testing process.
Whether you're a developer, tester, or QA professional, this webinar will give you valuable insights into how AI is shaping the future of software delivery.
JMeter webinar - integration with InfluxDB and GrafanaRTTS
Watch this recorded webinar about real-time monitoring of application performance. See how to integrate Apache JMeter, the open-source leader in performance testing, with InfluxDB, the open-source time-series database, and Grafana, the open-source analytics and visualization application.
In this webinar, we will review the benefits of leveraging InfluxDB and Grafana when executing load tests and demonstrate how these tools are used to visualize performance metrics.
Length: 30 minutes
Session Overview
-------------------------------------------
During this webinar, we will cover the following topics while demonstrating the integrations of JMeter, InfluxDB and Grafana:
- What out-of-the-box solutions are available for real-time monitoring JMeter tests?
- What are the benefits of integrating InfluxDB and Grafana into the load testing stack?
- Which features are provided by Grafana?
- Demonstration of InfluxDB and Grafana using a practice web application
To view the webinar recording, go to:
https://www.rttsweb.com/jmeter-integration-webinar
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
Essentials of Automations: Optimizing FME Workflows with ParametersSafe Software
Are you looking to streamline your workflows and boost your projects’ efficiency? Do you find yourself searching for ways to add flexibility and control over your FME workflows? If so, you’re in the right place.
Join us for an insightful dive into the world of FME parameters, a critical element in optimizing workflow efficiency. This webinar marks the beginning of our three-part “Essentials of Automation” series. This first webinar is designed to equip you with the knowledge and skills to utilize parameters effectively: enhancing the flexibility, maintainability, and user control of your FME projects.
Here’s what you’ll gain:
- Essentials of FME Parameters: Understand the pivotal role of parameters, including Reader/Writer, Transformer, User, and FME Flow categories. Discover how they are the key to unlocking automation and optimization within your workflows.
- Practical Applications in FME Form: Delve into key user parameter types including choice, connections, and file URLs. Allow users to control how a workflow runs, making your workflows more reusable. Learn to import values and deliver the best user experience for your workflows while enhancing accuracy.
- Optimization Strategies in FME Flow: Explore the creation and strategic deployment of parameters in FME Flow, including the use of deployment and geometry parameters, to maximize workflow efficiency.
- Pro Tips for Success: Gain insights on parameterizing connections and leveraging new features like Conditional Visibility for clarity and simplicity.
We’ll wrap up with a glimpse into future webinars, followed by a Q&A session to address your specific questions surrounding this topic.
Don’t miss this opportunity to elevate your FME expertise and drive your projects to new heights of efficiency.
Key Trends Shaping the Future of Infrastructure.pdfCheryl Hung
Keynote at DIGIT West Expo, Glasgow on 29 May 2024.
Cheryl Hung, ochery.com
Sr Director, Infrastructure Ecosystem, Arm.
The key trends across hardware, cloud and open-source; exploring how these areas are likely to mature and develop over the short and long-term, and then considering how organisations can position themselves to adapt and thrive.
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf91mobiles
91mobiles recently conducted a Smart TV Buyer Insights Survey in which we asked over 3,000 respondents about the TV they own, aspects they look at on a new TV, and their TV buying preferences.
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf
IMPROVED QUALITY OF SERVICE PROTOCOL FOR REAL TIME TRAFFIC IN MANET
1. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.4, July 2013
DOI : 10.5121/ijcnc.2013.5407 75
IMPROVED QUALITY OF SERVICE PROTOCOL FOR
REAL TIME TRAFFIC IN MANET
Iftikhar Ahmad1
, Humaira Jabeen2
and Faisal Riaz3
1
Department of CS & IT Mirpur University of Science and Technology
Mirpur, AJK, Pakistan
ify_ia@yahoo.com
2
Department of Computer Science International Islamic University
Islamabad, Pakistan
humaira_jabeen_83@yahoo.com
3
Department of Computing and Technology, Iqra University Islamabad Campus
H9/1 Islamabad, Pakistan
fazi_ajku@yahoo.com
ABSTRACT
The technologies like Wi-Fi, Blue tooth, WiMax etc. have made Mobile Ad hoc Networks common in our
Real life. Multi-media applications need to be supported on MANET. A certain level of QoS (Quality of
Service) support is essential for Real time data. Our proposed protocol provides the required QoS without
having negative impact on Best Effort data traffic. An efficient rout discovery mechanism for AODV routing
protocol as well as transmission technique for real time data are proposed. This technique gives more
transmission opportunities to real time data traffic results in decreasing transmission delay and increasing
throughput. A modified version of the popular AODV routing protocol to provide QoS guarantee for real
time traffic in MANETs is proposed. The simulation shows better performance results for proposed
protocol over the basic AODV.
.
KEYWORDS
AODV, Best effort, rout discovery, transmission opportunity, Quality of service, Queuing delay, Real Time
traffic
1. INTRODUCTION
A mobile ad hoc network (MANET) [1] is a wireless network of autonomous mobile nodes, the
network having no infrastructure and runs on batteries. Communication occurs between nodes
without a central entity like a base station or an access point. This allows the mobile nodes to
setup cost effective networks quickly and without any fixed topology. MANET is originally
designed for use in military applications, but can also play an important role in relief and rescue
operations. Most recently, the application of MANETs in innovative paradigms such as Vehicle-
To-Vehicle communication and wireless sensor networks has also been explored. These networks
are primarily made to transmit quick information exchange between the participating nodes; the
existing routing protocols supports best effort type of traffic. The MANET protocols cannot
guarantee reliability and QoS because they contain self-configured nodes with a dynamic network
topology. The dynamic nature of the network topology is mainly attributed to the mobility of the
nodes. Maintaining accurate information about the status of a network for routing purposes
becomes difficult because of the constraints of the Mobile Ad hoc Network.
MANETs employ two basic types of routing protocols, namely table-driven protocols and on-
demand routing protocols. The table-driven protocols are proactive protocols that consume
2. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.4, July 2013
76
network bandwidth but have less routing overhead. On the other hand, the on demand routing
protocols are reactive protocols that exchange routing information only when needed. The on
demand protocols are often preferred in bandwidth constrained environments. Among the
available on demand protocols, the Ad-hoc On-demand Distance Vector (AODV) is most widely
used because of its simplicity, scalability, low computational complexity and low overhead.
AODV routes IP packets to the destination node by discovering the shortest path without giving
due consideration to network reliability and QoS [2]. This fundamental drawback limits the scope
of AODV as it cannot perform well for real time applications, which require certain QoS
guarantees like fixed bandwidth, low latency and jitter, less link failures, etc. As mentioned
earlier, these guarantees cannot be accommodated in the conventional AODV due to the
inherently dynamic nature of MANETs.
The conventional basic AODV discovers the route by broadcasting route request (RREQ)
messages throughout the network. Based on the responses received from the participating nodes,
the route with least number of hops to destination is selected for data transmission. Modified
versions of AODV also consider factors like traffic load on a route, link quality among nodes,
energy consumption, traffic flow type etc. This route discovery process is initiated when a new
node joins the network or when a link between the neighboring nodes breaks down. A node first
stores an incoming packet in its buffer and executes a queuing mechanism to place the stored data
packets on the transmission channel. The delay in a network increases with the size of the queue
in a buffer. If the length of a queue exceeds a certain threshold, packets are dropped. Traffic
congestion occurs when the rate of packet arrival in the buffer exceeds the rate of transmission.
Queuing delay, packet loss and traffic congestion should be controlled in order to support the real
time applications. This paper is extended version of QoS AODV routing protocol in to provide
QoS-based routing in MANETs.
A mechanism is proposed to provide QoS guarantee to support real time applications. More
scheduling priority is given to the data packets originating from real time applications.
The rest of this paper is organized as follows. Related work and problem definition is presented in
Section II. Best Effort Traffic aware rout discovery and packet forwarding mechanism is covered
in Section III, followed by implementation results and performance evaluation in Section IV. This
paper is concluded in Section V while the references are given towards the end of paper.
2. RELATED WORK
The Quality of Service based routing services has been presented to a greater extent in the
previous works. The work is done to meet the QoS needs of multimedia applications over the
MANET.
FQMM [3] has been presented as the first QoS model for MANET which is a hybrid of both
Integrated Service and Differentiated Services architectures. Salient features of FQMM include:
dynamics roles of nodes, hybrid provisioning and adaptive conditioning. The Ad hoc QoS on-
demand routing (AQOR) protocol has been proposed in [4] that deals with the bandwidth and end
to end delay requirements. On demand route discovery, signaling function and hop to hop routing
are the main components of the proposed protocol. But the protocol does not deal with the
queuing delay that is main requirement of the QoS model for real time applications. More recent
works on QoS issue are summarized in the following.
An on demand delay based quality of service (QoS) routing protocol (AODV-D) protocol [5] is
proposed for QoS routing to ensure that delay does not exceed a maximum value for the
MANETs. MAC layer channel contention information and number of packets in the interface
3. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.4, July 2013
77
queue are considered in addition to minimum hop criteria for route discovery in MANETs.
AODV-D focuses on reducing the network delay but does not consider the bandwidth
requirements of real time applications. A QoS routing algorithm, called QoS AODV (QAODV)
has been proposed in [6] as an extension to AODV-D. A weighted function of several parameters
is used to select optimal routes and to provide support for QoS and fault tolerance. QAODV has
also shown advantages in terms of throughput and delay. It has limited support for multimedia
applications.
QEAODV routing protocol [7] improves the normal route finding method of AODV for
providing QoS in MANETs. QEAODV establishes a path between the source and the destination
on the basis of meeting the application throughput requirement. QEAODV handles the channel
access contention effectively which is the inherent problem in MANET. Cluster based QoS
routing (CBQR) [8] is a table driven routing protocol that provides support for bandwidth
efficiency and not only deals with the bandwidth requirement over the wireless network but also
takes care regarding the stale routes, storage overheads and limited battery power. Another QoS
routing protocol (MDSR-AODV) for MANETs with Link Stability Model is proposed in [9].
MDSR-AODV makes routing decisions by taking into account the characteristics of the channel.
It finds paths with greater link stability factor in the route discovery phase. A long-lived path is
preferred for data transfer among the available options. by monitoring network topology changes
through delay prediction the route maintenance is done.
Dynamic Load-Aware Routing (DLAR) [10] protocol defines the network load of a mobile node
as the number of packets in its interface queue. Load-Balanced Ad hoc Routing (LBAR) [11]
protocol define network load in a node as the total number of routes passing through the node and
its neighbors. In [12] Load-Sensitive Routing (LSR) protocol the network load in a node is
defined as the summation of the number of packets being queued in the interface of the mobile
host and its neighboring hosts. Even though the load metric of LSR is more accurate than those of
DLAR or LBAR, but it does not consider the effect of access contentions in the MAC layer
.Therefore, LSR produce contention delay that increase overall delay of transmission.
The contention delay problem is minimized in Delay-Oriented Shortest Path Routing protocol
[13]. The protocol analyzed the medium access delay of a mobile node in IEEE 802.11 wireless
network.
In [14] a protocol is proposed which includes load parameter in the RREQ message that helps in
the selection of route with low congestion during route discovery process. This decreases the end
to end delay for real time traffic. Route maintenance is done through RODV by not sending the
error information back to the source results a decrease in routing overhead.
Aforementioned protocols used different techniques to increase the performance of the network.
We have seen different load and delay reduction methods in the literature. Number of techniques
for real time data transmission is proposed as well. Most interesting idea in QoS provision is by
adding messages during the route discovery phase that carry QoS requirements. These message
extensions are mostly about bandwidth requirements and delay threshold value. Almost every
protocol in HWN and MANET is fully or partially adopting the technique of adding extension to
RREQ message in order to provide QoS guarantees to the delay sensitive applications But we
have proposed new route discovery mechanism that not only taking care of overall traffic load on
the rout but specially Best Effort traffic status of the selected rout. New rout discovery
mechanism is suitable for real time multimedia traffic. In order to reduce overall delay a scheme
is proposed to minimize queuing delay without effecting Best Effort traffic on the network. The
literature review gives us an insight of different routing approaches that has been made for
4. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.4, July 2013
78
MANET to achieve optimal performance for real time data transmissions in the given network
scenarios. After deep literature understanding it is quite clear that because of the different nature
of MANET, not any single routing protocol work well with all network scenarios of the MANET.
3. RELATED WORK
In our proposed solution we use reactive routing protocol Ad hoc on Demand Distant Vector
Routing (AODV) for routing in Mobile ad hoc network. We have proposed two schemes, firstly
we modified existing rout discovery mechanism and secondly the packet forwarding technique.
3.1. Balanced Best Effort Traffic Aware Route Discovery
When a source node wants to communicate with another node for which it has no routing
information available. The route discovery process starts and Source node broadcasts RREQ
message to its neighbors. The RREQ message contains a reserved bits field in it. This field is
utilized to carries the load status information of each node in the rout. When a node receives the
Figure 1. Route request process
RREQ message, the node will add value to the value present in RREQ message’s reserved field.
At each node it is counted that how many number of Best Effort (BE) packets are there among
other type of packets in the queue (Buffer). At each node the number of BE packets in the queue
of that node is counted and then ratio of number of BE packets to the number of rest of the
packets of queue is calculated. Finally this ratio is added to the reserved field of the RREQ
message as shown in figure 3 above.
In the figure above the value below the node is indicating the number of BE packets in the queue
of that node. The R is the ratio of BE packets to the rest of the packets. The value of R above the
node is showing the addition of ratio to the reserved field.
This process is repeated at each node through which the RREQ message is passed and reached up
to the destination. The value of R is finally reached at the destination and the destination will
divide R with hop count value of the REEQ message it has received and produces the average R.
The destination will compare the average R value with all requests it received with same
sequence number and broad cast ID and unicast RREP message back to the neighbor whose
average R value is less. Figure 3 above is explaining the whole process in detail.
5. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.4, July 2013
79
In this way the destination will receive two RREQ messages with the same number of hop count
is 2 but with two different average R value. Now the destination will select the optimal path on
basis of average R on the nodes. Destination will compare both R, s value, higher R value means
more number of packets in the rout, and lesser value means less number of BE packets in the
route. Hence, the path shown below will be selected as the route from source to the destination.
The Figure 4 is also displaying the rout reply path that is finally selected for transmission.
Figure 2. Route reply through selected path
Actually, the destination will selects one of the RREQ messages and ignore others for route reply
on the basis of reserved value and it selects node D as in above figure 4. The destination nodes F
will unicast the RREP message to the source in the selected optimal path. By selecting routes in
this way we are able to overcome the limitation that the nodes with more BE packets load will
come in the active route. This will prevent the node with more BE traffic loads, not to take part in
the route if another route is available. We are selecting the path with nodes having fewer BE
traffic loads, the BE traffic will not be effected badly when our new packet forwarding procedure
is adopted and real time data is given priority.
3.2. Packet Forwarding Procedure
For forwarding of real time packets we modified existing packet scheduling mechanism of the
protocol. Normally packets those are waiting to be forwarded towards destination, both best effort
and real time are, buffered or stored in a queue on source node as well as on each intermediate
node. Without considering that whether it is a real time or a best effort packet, packets are sent
from queue one by one as they come to the head of the queue.
Source node first checks its sending buffer for packet of particular destination whenever source
node wants to communicate with destination node. The source can also act as intermediate node
for flows coming from other nodes so they can be best effort packets, real time packets and
control packets as well. Our proposed mechanism for QoS for real time traffic has main idea that
the real time packets resides for minimum time in Queue. Normally, source node checks packets
in sending buffer for a particular destination in the network. If node found packet in the queue
then simply forwards it one by one without checking its type. In our proposed solution we are
treating best effort packets and real time packets separately. Each node in the route first checks its
sending buffer for a packet of particular destination and at the same time the type of packet as
well. If the packet is RT then it is transmitted immediately.
For a larger time only real time packets from queue are transmitted in order to give more priority
to real time packets. A lesser time slot is reserved for BE packets. In this way more transmission
opportunity is given to RT data packets than BE data packets. The same procedure will be
followed by all the intermediate nodes in the route from source to the destination. By following
6. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.4, July 2013
80
this procedure the destination will receive more real time packets in less time than normal
scheduling procedure. Throughput for real time packets is increased. The following paragraphs
describe the packet forwarding procedure in detail.
Table 1. Packet Positions in the queue
Table 1 is displaying an example queue and respective positions of Real time (RT) and Best
Effort packets (BE). Packet position shows position of packet inside the queue. Packet position 1
represents Head of the queue and packet position 10 represents Tail of the queue. Packet type
shows type of packet i.e. either it is BE packet or RT packet. We assumed that maximum of ten
packets can be stored at any given time in the queue.
If one packet can be forwarded to the destination in 1ms then 5 packets can be transmitted in 5ms.
According to the normal scheduling procedure two real time and three best effort packets
forwarded to destination in first five seconds.
In such case the destination for real time traffic receives 2 packets in 5ms. When the load of best
effort traffic on the network increases then the number of real time packets forwarded to the
destination decreases by adopting normal procedure. Because the real time packets will get stock
in the queue and have to wait longer in the queue. As a result the throughput of real time traffic
becomes low that is not required QoS for real time traffic.
We proposed a new procedure when the node checks for the packets for a particular destination at
the same time node checks the type of packet and in first 5ms five real packets forwarded to
destination. More time slot for real time traffic and lesser wait in the queue which are the required
parameters for the real time traffic. So the destination receives more real time packets in less time
which increases the throughput of real time traffic.
Figure 3. Transmission of BE and RT traffic through network
For specific time period node search for real time packets only that means more transmission
opportunity is given to real time packets. The time slot for the real time traffic is reserved in a
sense that for a specific period of time the node checks only for real time packets in the queue. If
Packet Position 1 2 3 4 5 6 7 8 9 10
Packet Type
R
T
BE BE RT RT BE BE BE RT RT
7. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.4, July 2013
81
any RT packet is there during that time slot they will be sent immediately towards the destination
and node will never care for other type of packets at all during that particular time. Consequently,
a smaller time slot is reserved for BE packets. The proposed method is quite opposite to the
method of weighted fair queuing. In weighted fair queuing method each data flow is given fair
chance of transmission regardless of their packet type. Instead of fair chance we are giving more
transmission opportunity to the RT traffic then BE traffic.
The proposed procedure not only reserves more bandwidth to the real time traffic, it also reduces
queuing delay for RT packets. RT packets do not have to wait in the queue for longer time
because now RT packets are treated on priority basis, which were normally treated on first come
first serve basis. In first come first serve basis if a packet is on 9th position in the queue it will
have to wait for the eight packets to be transmitted. Now if the packet is RT then the position in
the queue will never matter for its transmission.
As shown in figure 1 mobile node 7 is moving and sending packets towards node 1 through node
3 and node 4. Node 5 is transmitting to node 0 through the path 5320 as well. Node 5
generates only RT traffic and node 7 generates only (BE) best effort traffic. Both node 5 and node
7 can send both types of data packets simultaneously but for simplicity we have implemented
likewise as in figure 1.
Table 2. Status of queue after new procedure
This thing makes statistics and calculation easier. Both type of traffic RT and BE passing through
node 3 and node 2. The queue status is shown in the figure 2 at a specific time interval during the
transmission.
Now with the new packet forwarding algorithm if in 1ms queue forwards one packet then during
8ms the queue sent 8 packets to the destinations. Three BE packets and five RT packets but
during first 5ms five RT packets from position 10, 9, 5, 4 and 1 are taken for forwarding.
RT packets are transmitted immediately, normally we can see that the packet at position 1 would
have to wait for 9ms and packets at 4th and 5th would have to for 5ms and 6ms. These times
delays are reduced by forwarding them according to new procedure. BE traffic is given low
bandwidth as they are required less bandwidth.
We gave more transmission opportunity to real time data packets as RT data packets require more
bandwidth and assured forwarding. Possibility of dropping of real time data packets in case of
congestion on the node in network is less. We gave less transmission opportunity to best effort
packets for routing as best effort packets requires no tight bound for its forwarding, through the
network. Hence, delay is minimized which results in to more throughput for real time traffic. One
thing is noticeable that BE traffic is suffered in certain extent. In order to overcome this problem
we did two things; one we have proposed new rout discovery mechanism in which a rout is
selected that have lesser BE effort traffic on it. Secondly, a certain transmission opportunity is
also given to the BE traffic.
Packet Position 1 2 3 4 5 6 7 8 9 10
Packet Type RT BE BE RT RT BE BE BE RT RT
8. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.4, July 2013
82
4. IMPLEMENTATION AND ANALYSIS
Papers We implemented our improved AODV QoS based in NS2 [15] and compare its
performance with basic AODV. Propagation model is Two Ray Ground and Mobility model is
Random Way Point [16] because these models are most widely implemented in simulations of
most literature work.
4.1. Traffic Generation
Two traffic generation applications in our simulation process are CBR and TCP. CBR to simulate
Real time flows, whereas TCP connection that simulates FTP to simulate best effort traffic. TCP
generate BE traffic that does not require any service quality during transmission.
4.2. NS-2Parameter Setting
Other parameters of NS2 are configured for our network scenario is shown in the Table 1. NS2 is
discrete network simulator that is used for implementation for performance comparison MANET
protocols.
Table 3. NS-2 Parameter Setting
4.3. Performance Metric
We compared our improved AODV protocol for real time applications with basic AODV without
scheduling mechanism. We evaluated the performance according to following metric for RT
traffic.
X dimension of topology 700
Y dimension of Topology 600
Routing protocol AODV
Link layer type LL
MAC type Mac/802_11
Interface Queue Queue/Drop Tail/PriQueue
Maximum packets in Ifq 20
Antenna model Antenna/Omni Antenna
Radio propagation model Propagation/TwoRay Ground
Network Interface Phy/WirelessPhy
Channel type Channel/Wireless Channel
Number of mobile nodes 15
Simulation time 40 Seconds
9. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.4, July 2013
83
4.3.1. Average Throughput
Throughput is the total number of RT packets received successfully in the given time at the
destination node.
4.3.2. Transmission Delay
Transmission delay includes queuing delay and overall transmission delay from source to
destination for real time traffic. In our case queuing delay is reduced which reduced overall
transmission delay.
4.4. Simulation Results
The Basic AODV is first implemented and run on given MANET scenario in NS-2 and
performance parameters are calculated. Results are generated in graphical form produced by
using trace files that is generated during simulation. Then our improved protocol for real time
traffic is implemented and results are produced in graphical form.
Results are compared by taking parameters (pause time) on X-axis and performance metric
throughput and delay on Y-axis. In the figure below at equal intervals the throughput is calculated
as shown in figures.
4.5. Comparison of Performance
Normally, throughput of RT packets is much less then throughput of BE packets as in figure 2. At
start throughput of both real time and best effort packets are equal but after that throughput of BE
packets increased significantly.
The difference of performance between basic AODV and our improved QoS AODV for real time
traffic with new rout discovery and packet forwarding procedure is clear as shown in figure
4.Throughput of our proposed protocol for real time packets is higher than the throughput of basic
AODV for real time. The overall delay of AODV is much larger then overall delay of our
proposed protocol, which is critical for real time application over MANET.
Now the comparison is performed only for real time packets to check and validate the
performance of our proposed protocol for real time transmission. The comparison is performed
between throughputs of real time packets reaches at destination.
In figure 4 and figure 5 shows throughput of RT packets, before and after the improved AODV.
In the start of transmission at t=5 sec there is no major difference between the two throughputs
but as the pause time increases, difference between two throughputs significantly increased.
10. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.4, July 2013
84
Figure 4. Throughput Vs Pause time without improvement
In case of basic AODV the total of 4700 of BE packets and 450 RT packets reached at the
destination as shown in figure 4. But in case of our improved AODV the total of 3500 BE packets
and 1550 RT packets successfully reached the destination as shown in figure 5. A greater
improvement is clearly displayed for RT transmission with a little decrease in performance for BE
transmission.
Figure 5. Throughput Vs Pause time of improved AODV
The figure 6 displays the throughput of basic AODV for RT transmission named as Normal
Throughput versus throughput of improved AODV named as RT Throughput. Our improvedQoS
AODV protocol shows greater improvements as indicated by blue line in figure 6.
11. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.4, July 2013
85
Figure 6. Throughput Vs pause time before and after improved AODV protocol
The figure 7 displays the delays of real time traffic, the blue line shows that the delay of improved
AODV for RT traffic and red line shows the delay of basic AODV. Our improved AODV
protocol decreases queuing delay and overall delay as well which further minimizes overall delay
for RT traffic. The transmission delay of improved AODV is much lower than the normal delay
of RT packets with basic AODV.
In case of basic AODV each RT packet takes round about 0.2ms on average. It means in 0.2ms
one packet reaches successfully at destination. In case of our proposed protocol each RT packet
takes round about 0.065ms on average. So, it is clearly seen that transmission delay for RT traffic
is greatly reduced when queuing delay is reduced, which is required for RT traffic over network.
Finally, it is proved from the performance analysis that the proposed improved AODV routing
protocol for real time traffic shows better results than basic AODV.One thing is noted that the
Best effort traffic is not badly affected which is given smaller transmission opportunity as
compare to the RT traffic. BE packets are now not got stocked in queue for longer than usual
because of balanced BE traffic aware rout discovery mechanism. Although, our scope is RT
traffic as proposed method is defined to support QoS for real time traffic over MANET.
Figure 7. Delays vs. Pause Time
12. International Journal of Computer Networks & Communications (IJCNC) Vol.5, No.4, July 2013
86
5. CONCLUSIONS
We proposed a protocol for real time traffic over the Mobile ad hoc networks by modifying basic
AODV. The rout discovery mechanism of basic AODV is modified and BE traffic aware rout
discovery mechanism is proposed. New rout discovery mechanism selects routs for transmission
that have lesser BE traffic on it. Another procedure is incorporated in basic AODV that give more
transmission opportunity for Real Time traffic in MANET. The proposed procedure assigns more
bandwidth to RT traffic and reduces transmission delay for RT data packets without effecting
Best Effort traffic. Now a RT data packet takes much less time to reach at destination as it
requires for efficient transmission. After the implementation the proposed protocol shows greater
improvement in throughput and reduces delay in greater extent as well. Hence, for the
transmission of real time data over the MANET of moderate density and mobility the proposed
improved QoS protocol is more suitable.
REFERENCES
[1] S. Corson and J. Macker, “Mobile Ad hoc Networking (MANET): Routing Protocol Performance issues
and Evaluation Considerations”, Network Working Group, RFC2501, January 1999.
[2] C. Perkins, E. Royer and S. Das, “Ad hoc On-demand Distance Vector (AODV) Routing”, IETF
RFC3561,July 2003.
[3] H. XIAO, Winston K.G. SEAH, Anthony LO and Kee Chiang CHUA “ Flexible Quality Service Model
for Ad-HOC Networks” In proceedings of the IEEE Vehicular Technology Conference, Tokyo, Japan,
May 2000.
[4] Qi Xue and Aura Ganz “Ad hoc QoS on-demand routing (AQOR) in mobile ad hoc networks” Journal
of Parallel and Distributed Computing,(63), 154-165, 2003.
[5] P. Macharla, R. Kumar, A. Sarje, and M. Misra “A QoS Routing Protocol for Delay-Sensitive
Applications in Mobile Ad Hoc Networks” 2nd International ICST Workshop on Intelligent Networks:
Adaptation, Communication & Reconfiguration 2008.
[6] S. Tabatabaei and K. Tabatabaei “Routing and quality of service support for mobile Ad hoc networks”
in proceeding of International conference on Computer Engineering and Technology, Chengdu, china,
April 2010
[7] D. S. Thenmozhi and R. Lakshmipathi “Quality of Service Enhanced Routing in Mobile Ad Hoc
Network” International Journal of Computer Science and Information Security, Vol 8, No. 5, August
2010. [2]Gizem, Aksahya & Ayese, Ozcan (2009) Coomunications & Networks, Network Books,
ABC Publishers.
[8] P. K. Suri, M .K. Soni and P. Tomar “Cluster Based QoS Routing Protocol for MANET” International
Journal of Computer Theory and Engineering, Vol. 2 No. 5, October 2010.
[9] P. R. J. Jeni, A.V. Juliat and B. Shaji “A novel QoS frame work for MDSRAODV Routing Protocol in
MANET” International Journal of Computer Science and Network Security, VOL.10 No.10, October
2010.
[10] S. –J. Lee and M. Gerla, “Dynamic Load-Aware Routing in Ad Hoc Networks,” in Proc. IEEE ICC’01,
Helsinki, Finland, June 2001.
[11] H. Hassanein and A. Zhou, “Routing with Load Balancing in Wireless Ad Hoc Networks,” in Proc.
ACM MSWiM, Rome, Itary, July 2001
[12] K. Wu and J. Harms, “Load-Sensitive Routing for Mobile Ad Hoc Networks,” in Proc. IEEE
ICCCN’01, Scottsdale, AZ, Oct. 2001.
[13] S-T. Sheu and J. Chen, “A Novel Delay-Oriented Shortest Path Routing Protocol for Mobile Ad Hoc
Networks,” in Proc. IEEE ICC’01, Helsinki,Finland, June 2001.
[14] Sanjeev Jain, Vankateswarla Pitti and Bhupendra Verma, “Real Time On-demand Distance Vector in
Mobile Ad hoc Networks”, Asian Journal of Information Technology 5(4): 454-459, 2005.
[15] M. Gunes¸ and M. Wenig ,”Models for Realistic Mobility and Radio Wave Propagation for Ad Hoc
Network Simulations” Springer-Verlag London Limited,2009.(A chapter of book “Guide to Wireless
Ad Hoc Networks” ).
[16] K. Fall and K. Varahan, editors, “NS Notes and Documentation” The VINT Project, UC Berkeley,
LBL, USC/ISI, and Xerox PARC, November 1997