This document summarizes a research paper that proposes a new routing protocol for mobile ad hoc networks (MANETs) that considers link stability and quality of service (QoS) metrics. The protocol estimates link quality based on node mobility prediction using GPS data. It calculates a "cost" metric factoring in link stability and power consumption to select paths with more stable, lower-cost links. Simulation results show the proposed protocol achieves higher throughput and packet delivery ratio compared to existing protocols, with lower control overhead. Future work could incorporate additional link quality metrics and statistical classifiers to further optimize path selection in MANETs.
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.
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.
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.
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
Mobile Ad Hoc Network (MANET) is a very dynamic and infrastructure-less ad hoc network. The actual
network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable. MANET is a resource limited network and therefore the developed routing
algorithm for packet transmission should be power and bandwidth efficient. These kinds of dynamic
networks should operate with minimal management overhead. The management functionality of the
network increases with number of nodes and reduces the performance of the network. Here, in this paper,
we have designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Graph theoretic routing algorithm is used to develop route for packet
transmission by using the minimum resources. In this paper, we developed routing algorithm for cluster
based MANET and finds a path from source to destination using minimum cumulative degree path. Our
simulation results show that this routing algorithm provide efficient routing path with the increasing
number of nodes and uses multi-hop connectivity for intra-cluster to utilize minimum power for packet
transmission irrespective of number of nodes in the network.
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).
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.t
Packet Transfer Rate & Robust Throughput for Mobile Adhoc NetworkEswar Publications
An ad-hoc wireless network is highly different considering dynamic stochastic process of its underlying links, leads to link breaks during data transaction. Hence, to provide free flow data transaction, many routing algorithms have the property of link recovery and maintenance procedures to minimize the loss of data during transmission. However these routing method do not guarantee reliable data transmission in some special application conditions with wide requirements on Packet delivery ratio and link quality of the network. Routing is a critical issue in MANET and hence the focus of this paper is the performance analysis of different routing protocols used in the
wireless network. We evaluate the ability of a mobile ad hoc wireless network to distribute flows across robust routes by introducing the robust throughput measure as a performance metric. The utility gained by the delivery of flow messages is based on the level of interruption experienced by the underlying transaction. We describe the mathematical calculation of a network’s robust throughput measure, as well as its robust throughput capacity. We introduce the robust flow admission and routing algorithm (RFAR) to provide for the timely and robust transport of flow transactions across mobile ad hoc wireless systems.
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.
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.
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.
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
Mobile Ad Hoc Network (MANET) is a very dynamic and infrastructure-less ad hoc network. The actual
network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable. MANET is a resource limited network and therefore the developed routing
algorithm for packet transmission should be power and bandwidth efficient. These kinds of dynamic
networks should operate with minimal management overhead. The management functionality of the
network increases with number of nodes and reduces the performance of the network. Here, in this paper,
we have designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Graph theoretic routing algorithm is used to develop route for packet
transmission by using the minimum resources. In this paper, we developed routing algorithm for cluster
based MANET and finds a path from source to destination using minimum cumulative degree path. Our
simulation results show that this routing algorithm provide efficient routing path with the increasing
number of nodes and uses multi-hop connectivity for intra-cluster to utilize minimum power for packet
transmission irrespective of number of nodes in the network.
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).
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.t
Packet Transfer Rate & Robust Throughput for Mobile Adhoc NetworkEswar Publications
An ad-hoc wireless network is highly different considering dynamic stochastic process of its underlying links, leads to link breaks during data transaction. Hence, to provide free flow data transaction, many routing algorithms have the property of link recovery and maintenance procedures to minimize the loss of data during transmission. However these routing method do not guarantee reliable data transmission in some special application conditions with wide requirements on Packet delivery ratio and link quality of the network. Routing is a critical issue in MANET and hence the focus of this paper is the performance analysis of different routing protocols used in the
wireless network. We evaluate the ability of a mobile ad hoc wireless network to distribute flows across robust routes by introducing the robust throughput measure as a performance metric. The utility gained by the delivery of flow messages is based on the level of interruption experienced by the underlying transaction. We describe the mathematical calculation of a network’s robust throughput measure, as well as its robust throughput capacity. We introduce the robust flow admission and routing algorithm (RFAR) to provide for the timely and robust transport of flow transactions across mobile ad hoc wireless systems.
QoS Oriented Coding For Mobility Constraint in Wireless Networksiosrjce
IOSR Journal of Electronics and Communication Engineering(IOSR-JECE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of electronics and communication engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in electronics and communication engineering. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Modified q aware scheduling algorithm for improved fairness in 802.16 j networksIJCNCJournal
Deployment of Multi-hop Relays in WiMax based Cellu
lar Networks is considered as a cost effective
solution to increase the Coverage area of Base Stat
ion and also to improve the Network Capacity with h
igh
quality short links. Scheduling became a challengin
g task in these Multi-hop Relay Wireless Cellular
Networks of IEEE 802.16j standard. H. Chen, X. Xie
and H. Wu proposed a Q-aware Scheduling
Algorithm in which back-pressure flow control mecha
nism is used to reflect current Q size of the Relay
s
and considered high back-pressure links to include
in Concurrent Transmission Scenarios, to maximize t
he
throughput. This focus on high back-pressure links,
leads to starvation of Mobile Stations having low
back-
pressure links, resulting unfairness in some cases.
To remedy this situation, a Fair Link Inclusion (F
LI)
mechanism is applied in Greedy Algorithm of Q-aware
Scheduling Algorithm. Simulation results show that
Modified Q-aware Scheduling Algorithm with FLI mech
anism has reasonable improvement in fairness and
maintaining steady throughput when compared with ex
isting algorithms.
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.
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2Rijujournal
In multi-radio wireless mesh networks, one node is eligible to transmit packets over multiple channels to different destination nodes simultaneously. This feature of multi-radio wireless mesh network makes high throughput for the network and increase the chance for multi path routing. This is because the multiple channel availability for transmission decreases the probability of the most elegant problem called as interference problem which is either of interflow and intraflow type. For avoiding the problem like interference and maintaining the constant network performance or increasing the performance the WMN need to consider the packet aggregation and packet forwarding. Packet aggregation is process of collecting several packets ready for transmission and sending them to the intended recipient through the channel, while the packet forwarding holds the hop-by-hop routing. But choosing the correct path among different available multiple paths is most the important factor in the both case for a routing algorithm. Hence the most challenging factor is to determine a forwarding strategy which will provide the schedule for each node for transmission within the channel. In this research work we have tried to implement two forwarding strategies for the multi path multi radio WMN as the approximate solution for the above said problem. We have implemented Global State Routing (GSR) which will consider the packet forwarding concept and Aggregation Aware Layer 2 Routing (AAL2R) which considers the both concept i.e. both packet forwarding and packet aggregation. After the successful implementation the network performance has been measured by means of simulation study.
PERFORMANCE ANALYSIS OF WIRELESS MESH NETWORK USING ADAPTIVE INFORMANT FACTOR...IJCSES Journal
Wireless mesh network (WMN) has become an important leading technology which provides several types of useful applications such as community network, broadband home network and internet access, etc. The rise in the size of users in WMN has created a degradation of efficiency in a network especially in dense areas due to the clumsy channel allocation and hence creating many challenges for enhancing the users experience, network quality and throughput. Therefore in this paper, we proposed OCA based AIF model that can access the channel information and then it process to improve the RF channel association. The proposed OCA-AIF will function for each period when some interference is detected via AIF and we further extend this analysis by taking in to consideration the influence of interference to provide a high quality indicator in network. The analysis of result shows the optimization by our proposed approach which increases as per the increment of relay nodes (RNs).
Network parameters impact on dynamic transmission power control in vehicular ...ijngnjournal
the throughput of the wireless vehicular network and decrease the delay of the message communication
between vehicular nodes on the highway. Whenever an event occurs on the highway, the reliability
of the communication in the vehicular network becomes so vital so that event created messages should
reach to all the moving network nodes. It becomes necessary that there should be no interference from
outside of the network and all the neighbor nodes should lie in the transmission range of the
reference vehicular node. Transmission range is directly proportional to the transmission power the
moving node. If the transmission power will be high, the interference increases that can cause higher
delay in message reception at receiver end, hence the performance of the network decreased. In this
paper, it is analyzed that how transmission power can be controlled by considering other different
parameter of the network such as; density, distance between moving nodes, different types of messages
dissemination with their priority, selection of an antenna also affects on the transmission power. The
dynamic control of transmission power in VANET serves also for the optimization of the resources
where it needs, can be decreased and increased depending on the circumstances of the network.
Different applications and events of different types also cause changes in transmission power to enhance
the reachability. The analysis in this paper is comprised of density, distance with single hop and multi
hop message broadcasting based dynamic transmission power control as well as antenna selection and
applications based. Some summarized tables are produced according to the respective parameters of
the vehicular network. At the end some valuable observations are made and discussed in detail. This
paper concludes with a grand summary of all the protocols discussed in it.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
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.
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.
An Efficient and Stable Routing Algorithm in Mobile Ad Hoc NetworkIJCNCJournal
Mobile Ad hoc Network (MANET) is mainly designed to set up communication among devices in infrastructure-less wireless communication network. Routing in this kind of communication network is highly affected by its restricted characteristics such as frequent topological changes and limited battery power. Several research works have been carried out to improve routing performance in MANET. However, the overall performance enhancement in terms of packet delivery, delay and control message overhead is still not come into the wrapping up. In order to overcome the addressed issues, an Efficient and Stable-AODV (EFST-AODV) routing scheme has been proposed which is an improvement over AODV to establish a better quality route between source and destination. In this method, we have modified the route request and route reply phase. During the route request phase, cost metric of a route is calculated on the basis of parameters such as residual energy, delay and distance. In a route reply phase, average residual energy and average delay of overall path is calculated and the data forwarding decision is taken at the source node accordingly. Simulation outcomes reveal that the proposed approach gives better results in terms of packet delivery ratio, delay, throughput, normalized routing load and control message overhead as compared to AODV.
Dear Student,
DREAMWEB TECHNO SOLUTIONS is one of the Hardware Training and Software Development centre available in
Trichy. Pioneer in corporate training, DREAMWEB TECHNO SOLUTIONS provides training in all software
development and IT-related courses, such as Embedded Systems, VLSI, MATLAB, JAVA, J2EE, CIVIL,
Power Electronics, and Power Systems. It’s certified and experienced faculty members have the
competence to train students, provide consultancy to organizations, and develop strategic
solutions for clients by integrating existing and emerging technologies.
ADD: No:73/5, 3rd Floor, Sri Kamatchi Complex, Opp City Hospital, Salai Road, Trichy-18
Contact @ 7200021403/04
phone: 0431-4050403
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.
JCWAEED: JOINT CHANNEL ASSIGNMENT AND WEIGHTED AVERAGE EXPECTED END-TO-END DE...csandit
In recent years, multi-channel multi-radio Wireless Mesh network has become one of the most important technologies in the evolution of next-generation networks. Its multi-hop, selforganization,self-healing and simple deployment is an effective way to solve the bottleneck problem of last mile. In this paper, we propose a new routing metric called WAEED, deployed in JCWAEED protocol, a joint channel assignment and weighted average expected end-to-end delay routing protocol which considers both interference suppression with factor IF and end-toend delay. Additionally, we give the exact calculation formula of transmission delay and queuing delay. Simulations results demonstrate that JCWAEED outperforms other joint design routing protocols in terms of throughput, end-to-end delay and packet loss rate.
Packet delivery ratio, delay, throughput, routing overhead etc are the strict quality of service requirements
for applications in Ad hoc networks. So, the routing protocol not only finds a suitable path but also the path
should satisfy the QoS constraints also. Quality of services (QoS) aware routing is performed on the basis
of resource availability in the network and the flow of QoS requirement. In this paper we developed a
source routing protocol which satisfying the link bandwidth and end –to- end delay factor. Our protocol
will find multiple paths between the source and the destination, out of those one will be selected for data
transfer and others are reserve at the source node those can be used for route maintenance purpose. The
path selection is strictly based on the bandwidth and end-to-end delay in case two or more then two paths
are having the same values for QoS constraints then we will use hop as a parameter for path selection.
IOSR Journal of Applied Physics (IOSR-JAP) is an open access international journal that provides rapid publication (within a month) of articles in all areas of physics and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in applied physics. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Spatial Correlation Based Medium Access Control Protocol Using DSR & AODV Rou...IOSR Journals
Abstract : In Wireless sensor network sensor nodes have a limited battery life and their efficient utilization is
a very much importent task. Their are many ways are proposed for efficient utilization of energy.For efficient
energy utilization many topologies,protocals are proposed by the help of which we can maximize the battery
life. In this paper we propesed a methode in which a correlation is made between all the sensor nodes including
ME(mobile element). A Vector Quantization methode are used for distance calculation between all the sensor
nodes and mobile element. After finding the corrélation we used the DSR & AODV routing Protocol. The
performance of the proposed protocol has been examined and evaluated with the NS-2 simulator in terms of
packet drop ratio and energy consumption. The simulation result shows that the proposed protocol with AODV
routing gives a batter result compared with same protocol with DSR routing.
Keywords: ME, DVT, DSR, AODV, Wireless Sensor Network, Efficient Energy Utilization
QoS Oriented Coding For Mobility Constraint in Wireless Networksiosrjce
IOSR Journal of Electronics and Communication Engineering(IOSR-JECE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of electronics and communication engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in electronics and communication engineering. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Modified q aware scheduling algorithm for improved fairness in 802.16 j networksIJCNCJournal
Deployment of Multi-hop Relays in WiMax based Cellu
lar Networks is considered as a cost effective
solution to increase the Coverage area of Base Stat
ion and also to improve the Network Capacity with h
igh
quality short links. Scheduling became a challengin
g task in these Multi-hop Relay Wireless Cellular
Networks of IEEE 802.16j standard. H. Chen, X. Xie
and H. Wu proposed a Q-aware Scheduling
Algorithm in which back-pressure flow control mecha
nism is used to reflect current Q size of the Relay
s
and considered high back-pressure links to include
in Concurrent Transmission Scenarios, to maximize t
he
throughput. This focus on high back-pressure links,
leads to starvation of Mobile Stations having low
back-
pressure links, resulting unfairness in some cases.
To remedy this situation, a Fair Link Inclusion (F
LI)
mechanism is applied in Greedy Algorithm of Q-aware
Scheduling Algorithm. Simulation results show that
Modified Q-aware Scheduling Algorithm with FLI mech
anism has reasonable improvement in fairness and
maintaining steady throughput when compared with ex
isting algorithms.
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.
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2Rijujournal
In multi-radio wireless mesh networks, one node is eligible to transmit packets over multiple channels to different destination nodes simultaneously. This feature of multi-radio wireless mesh network makes high throughput for the network and increase the chance for multi path routing. This is because the multiple channel availability for transmission decreases the probability of the most elegant problem called as interference problem which is either of interflow and intraflow type. For avoiding the problem like interference and maintaining the constant network performance or increasing the performance the WMN need to consider the packet aggregation and packet forwarding. Packet aggregation is process of collecting several packets ready for transmission and sending them to the intended recipient through the channel, while the packet forwarding holds the hop-by-hop routing. But choosing the correct path among different available multiple paths is most the important factor in the both case for a routing algorithm. Hence the most challenging factor is to determine a forwarding strategy which will provide the schedule for each node for transmission within the channel. In this research work we have tried to implement two forwarding strategies for the multi path multi radio WMN as the approximate solution for the above said problem. We have implemented Global State Routing (GSR) which will consider the packet forwarding concept and Aggregation Aware Layer 2 Routing (AAL2R) which considers the both concept i.e. both packet forwarding and packet aggregation. After the successful implementation the network performance has been measured by means of simulation study.
PERFORMANCE ANALYSIS OF WIRELESS MESH NETWORK USING ADAPTIVE INFORMANT FACTOR...IJCSES Journal
Wireless mesh network (WMN) has become an important leading technology which provides several types of useful applications such as community network, broadband home network and internet access, etc. The rise in the size of users in WMN has created a degradation of efficiency in a network especially in dense areas due to the clumsy channel allocation and hence creating many challenges for enhancing the users experience, network quality and throughput. Therefore in this paper, we proposed OCA based AIF model that can access the channel information and then it process to improve the RF channel association. The proposed OCA-AIF will function for each period when some interference is detected via AIF and we further extend this analysis by taking in to consideration the influence of interference to provide a high quality indicator in network. The analysis of result shows the optimization by our proposed approach which increases as per the increment of relay nodes (RNs).
Network parameters impact on dynamic transmission power control in vehicular ...ijngnjournal
the throughput of the wireless vehicular network and decrease the delay of the message communication
between vehicular nodes on the highway. Whenever an event occurs on the highway, the reliability
of the communication in the vehicular network becomes so vital so that event created messages should
reach to all the moving network nodes. It becomes necessary that there should be no interference from
outside of the network and all the neighbor nodes should lie in the transmission range of the
reference vehicular node. Transmission range is directly proportional to the transmission power the
moving node. If the transmission power will be high, the interference increases that can cause higher
delay in message reception at receiver end, hence the performance of the network decreased. In this
paper, it is analyzed that how transmission power can be controlled by considering other different
parameter of the network such as; density, distance between moving nodes, different types of messages
dissemination with their priority, selection of an antenna also affects on the transmission power. The
dynamic control of transmission power in VANET serves also for the optimization of the resources
where it needs, can be decreased and increased depending on the circumstances of the network.
Different applications and events of different types also cause changes in transmission power to enhance
the reachability. The analysis in this paper is comprised of density, distance with single hop and multi
hop message broadcasting based dynamic transmission power control as well as antenna selection and
applications based. Some summarized tables are produced according to the respective parameters of
the vehicular network. At the end some valuable observations are made and discussed in detail. This
paper concludes with a grand summary of all the protocols discussed in it.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
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.
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.
An Efficient and Stable Routing Algorithm in Mobile Ad Hoc NetworkIJCNCJournal
Mobile Ad hoc Network (MANET) is mainly designed to set up communication among devices in infrastructure-less wireless communication network. Routing in this kind of communication network is highly affected by its restricted characteristics such as frequent topological changes and limited battery power. Several research works have been carried out to improve routing performance in MANET. However, the overall performance enhancement in terms of packet delivery, delay and control message overhead is still not come into the wrapping up. In order to overcome the addressed issues, an Efficient and Stable-AODV (EFST-AODV) routing scheme has been proposed which is an improvement over AODV to establish a better quality route between source and destination. In this method, we have modified the route request and route reply phase. During the route request phase, cost metric of a route is calculated on the basis of parameters such as residual energy, delay and distance. In a route reply phase, average residual energy and average delay of overall path is calculated and the data forwarding decision is taken at the source node accordingly. Simulation outcomes reveal that the proposed approach gives better results in terms of packet delivery ratio, delay, throughput, normalized routing load and control message overhead as compared to AODV.
Dear Student,
DREAMWEB TECHNO SOLUTIONS is one of the Hardware Training and Software Development centre available in
Trichy. Pioneer in corporate training, DREAMWEB TECHNO SOLUTIONS provides training in all software
development and IT-related courses, such as Embedded Systems, VLSI, MATLAB, JAVA, J2EE, CIVIL,
Power Electronics, and Power Systems. It’s certified and experienced faculty members have the
competence to train students, provide consultancy to organizations, and develop strategic
solutions for clients by integrating existing and emerging technologies.
ADD: No:73/5, 3rd Floor, Sri Kamatchi Complex, Opp City Hospital, Salai Road, Trichy-18
Contact @ 7200021403/04
phone: 0431-4050403
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.
JCWAEED: JOINT CHANNEL ASSIGNMENT AND WEIGHTED AVERAGE EXPECTED END-TO-END DE...csandit
In recent years, multi-channel multi-radio Wireless Mesh network has become one of the most important technologies in the evolution of next-generation networks. Its multi-hop, selforganization,self-healing and simple deployment is an effective way to solve the bottleneck problem of last mile. In this paper, we propose a new routing metric called WAEED, deployed in JCWAEED protocol, a joint channel assignment and weighted average expected end-to-end delay routing protocol which considers both interference suppression with factor IF and end-toend delay. Additionally, we give the exact calculation formula of transmission delay and queuing delay. Simulations results demonstrate that JCWAEED outperforms other joint design routing protocols in terms of throughput, end-to-end delay and packet loss rate.
Packet delivery ratio, delay, throughput, routing overhead etc are the strict quality of service requirements
for applications in Ad hoc networks. So, the routing protocol not only finds a suitable path but also the path
should satisfy the QoS constraints also. Quality of services (QoS) aware routing is performed on the basis
of resource availability in the network and the flow of QoS requirement. In this paper we developed a
source routing protocol which satisfying the link bandwidth and end –to- end delay factor. Our protocol
will find multiple paths between the source and the destination, out of those one will be selected for data
transfer and others are reserve at the source node those can be used for route maintenance purpose. The
path selection is strictly based on the bandwidth and end-to-end delay in case two or more then two paths
are having the same values for QoS constraints then we will use hop as a parameter for path selection.
IOSR Journal of Applied Physics (IOSR-JAP) is an open access international journal that provides rapid publication (within a month) of articles in all areas of physics and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in applied physics. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Spatial Correlation Based Medium Access Control Protocol Using DSR & AODV Rou...IOSR Journals
Abstract : In Wireless sensor network sensor nodes have a limited battery life and their efficient utilization is
a very much importent task. Their are many ways are proposed for efficient utilization of energy.For efficient
energy utilization many topologies,protocals are proposed by the help of which we can maximize the battery
life. In this paper we propesed a methode in which a correlation is made between all the sensor nodes including
ME(mobile element). A Vector Quantization methode are used for distance calculation between all the sensor
nodes and mobile element. After finding the corrélation we used the DSR & AODV routing Protocol. The
performance of the proposed protocol has been examined and evaluated with the NS-2 simulator in terms of
packet drop ratio and energy consumption. The simulation result shows that the proposed protocol with AODV
routing gives a batter result compared with same protocol with DSR routing.
Keywords: ME, DVT, DSR, AODV, Wireless Sensor Network, Efficient Energy Utilization
The Analysis of Plyometric Training Program on University Handball PlayersIOSR Journals
Abstract: The purpose of this study was to find out the efficiency of composed plyometric training program on
beginners Handball players force capabilities in their usual training period. The plyometric training program
was applied during 16 week period where was attended twenty-one 12-19 years old beginners Handball
players. Twelve of them were female and nine male handball players. There were three control tastings. All
subjects participated in following tests: standing long jump, depth leap long jump, medicine ball throws up in
10 seconds; medicine ball overhead throws forward against the wall in 10 seconds, maximal vertical jumps to
the maximal height in 10 seconds, maximal vertical jump height. Testing results statistical analysis has shown
athletes legs and arms speed force reliable improvement. Standing long jump, depth leap long jump and
maximal vertical jump height test results, what has shown legs explosive power, has not shown remarkable
reliable difference (P>0.05) . Medicine ball throws and maximal vertical jumps to the maximal height in 10
seconds, what show speed force improvement, showed reliable difference (P<0.01).
Key words: TRAINING METHOD, LEGS AND ARMS SPEED FORCE TRAINING.
A Quantified Approach for large Dataset Compression in Association MiningIOSR Journals
Abstract: With the rapid development of computer and information technology in the last several decades, an
enormous amount of data in science and engineering will continuously be generated in massive scale; data
compression is needed to reduce the cost and storage space. Compression and discovering association rules by
identifying relationships among sets of items in a transaction database is an important problem in Data Mining.
Finding frequent itemsets is computationally the most expensive step in association rule discovery and therefore
it has attracted significant research attention. However, existing compression algorithms are not appropriate in
data mining for large data sets. In this research a new approach is describe in which the original dataset is
sorted in lexicographical order and desired number of groups are formed to generate the quantification tables.
These quantification tables are used to generate the compressed dataset, which is more efficient algorithm for
mining complete frequent itemsets from compressed dataset. The experimental results show that the proposed
algorithm performs better when comparing it with the mining merge algorithm with different supports and
execution time.
Keywords: Apriori Algorithm, mining merge Algorithm, quantification table
Discovery of superluminal velocities of X-rays and Bharat Radiation challengi...IOSR Journals
The current paper reports discovery of superluminal velocities of X-rays, and Bharat Radiation in 12.87 to 31 nm range from solar spectra. The discovery challenges the 100 year old Albert Einstein’s assertion that nothing can go faster than velocity of light c in vacuum while formulating E = mc2 in his special theory of relativity reported in 1905 [1]. Several solar spectra recorded at various wavelengths by Woods et al in 2011 demonstrated GOES X-rays arriving earlier than 13.5 nm emission, which in turn arriving earlier than 33.5 nm emission [2]. Finally, the investigators faced difficulty in concluding that short wavelengths traveled fast because of lack of information whether all the three emissions originated from the same source and at the same time. Very recently the author has reported GOES X-rays (7.0 nm) cause 13.5 nm (Bharat Radiation), which in turn causes 33.5 nm Extreme ultraviolet (EUV) emission from same excited atoms present in solar flare by Padmanabha Rao Effect [3, 4]. Based on these findings, the author succeeded in explaining how the solar spectral findings provide direct evidences on superluminal velocities of GOES X-ray and 13.5 nm Bharat Radiation emissions, when 33.5 nm EUV emission is considered travelling at velocity of light c. Among X-ray wavelengths, the short wavelength 7.0 nm X-rays traveled faster than 9.4 nm X-rays, while X-rays go at superluminal velocities. Among Bharat radiation wavelengths, short wavelengths showed fast travel, while Bharat Radiation goes at superluminal velocities as compared to 33.5 EUV emission.
Characterization of Manganese doped ZnO (MZO) thin films by Spin Coating Tech...IOSR Journals
Doping is a widely used to improve the structural and optical properties of semiconductors. However deposition route is also very important to get nanostructure with different properties. ZnO nanostructures doped with Mn having 5% doping concentrations by weight percentage have been synthesized in the laboratory using Spin coating technique. Scanning Electron Microscope (SEM) image shows the around one millimeter and X-ray diffractometer studies shows that the average diameter of the particles is 25 nm. From the UV-Vis studies the annealing temperature increases the crystal size decreases and the bandgap values increases accordingly.
Network Lifetime Analysis of Routing Protocols of Short Network in QualnetIOSR Journals
A Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes that communicates with
each other without using any existing infrastructure, access point or centralized administration. Mobile ad-hoc
network have the attributes such as wireless connection, continuously changing topology, distributed operation
and ease of deployment. In this paper we have compared the energy consumption of reactive, proactive &
hybrid routing protocol AODV,DSR,RIP & ZRP by using different mobility model. We have analyzed the
Network lifetime of protocols by varying pay load, mobility, pause time and type of traffic (CBR). A detailed
simulation has been carried out in qualnet. The metrics used for performance analysis are energy consumed &
battery consumption. It has been observed that RIP has better network lifetime than other
Applying Regression Model to Predict the Effects of Shaft and Bearing Deviati...IOSR Journals
This work presents formulation of linear regression model for the effect of shaft and bearing deviations on the clearance of the assembly of mating parts. The model validation confirmed the existence of statistical relationships between clearance and shaft and bearing deviations. Applying data collected from direct measurement of shafts and bearings produced in the workshop, R2 values of 99.7% was obtained for assembly of mating parts model ; thus, indicating that about 99.7% of the parts produced are interchangeable, thus reducing the probability of producing scraps to the barest minimum. The results obtained using critical parameters of assembly of mating parts and multiple linear regression models give good estimation and are validated with experimental values with an error much lesser than 4% error. The regression model also showed that given the shaft and bearing deviations, the expected clearance can be determined, thus, enabling the quality control personnel to significantly monitor and reduce variation in the assembly of mating parts
Effect of astaxanthin on ethylene glycol induced nephrolithiasisIOSR Journals
Nephrolithiasis is one of the most common and painful of urological disorders with a high prevalence rate. The role of calcium oxalate crystals, which are the predominant component of kidney stones in generating oxidative stress, have been clearly demonstrated in previous studies. Astaxanthin, found in marine organisms is a dietary xanthophyll carotenoid with enhanced antioxidative properties and pharmacological effects. In the present study, we have investigated the effect of this natural antioxidant, at a daily dose of 25mg/kg in experimental calcium oxalate nephrolithiasis in male Wistar rats. Liver function markers, hepatic antioxidants, albumin creatinine ratios, renal calcium content and changes in body and kidney weight have been studied to evaluate the effect of this carotenoid in vivo. The effect of citrate, a component of most pharmaceutical drugs for management of nephrolithiasis has also been evaluated for the purpose of comparison with astaxanthin treatment. Astaxanthin is seen to exert a protective effect on the liver and kidney tissues in ethylene glycol treated rats by improving the liver function, restoring the activity of the hepatic antioxidant enzymes, decreasing the albumin creatinine ratios and calcium levels and maintaining the organ to body weight ratio. Our results also indicate that astaxanthin administration is more beneficial than citrate treatment
A Comparison Based Study on Biometrics for Human RecognitionIOSR Journals
Abstract: A biometric system provides automatic recognition of an individual based on a unique feature or
characteristic possessed by the individual. These biometric characteristic may physiological or behavioral.
Unlike other identification methods such as id proof, tokens and password, the distinct aspect of biometric
recognition comes into light from randomly distributed features in human being. In this paper, I describe the
novel comparison based upon various aspects to make easy selection for biometric device deployment in specific
environment. This paper proposes a comparison among all kind of biometric system available in the society.
The existing computer security systems used at various places like banking, passport, credit cards, smart cards,
PIN , access control and network security are using username and passwords for person identification.
Biometric systems also introduce an aspect of user convenience; it means one can be authorized by representing
himself or herself. In this paper, the main focus is on working principal of biometric technique, the various
biometrics systems and their comparisons.
Keywords: Biometrics, authentication, identification, recognition
Assessment of Combinatorial Support Assemblies and Their Energy Matrixes in H...IOSR Journals
The bolt and nut coupling are fundamental design requirement for machines and steel structures and
their relevance and utilization are of topmost priority in the areas of their application. The paper viewed the
component parts and dimensions of this coupling from the perspective of energy content delivery, balancing and
equilibrium. This result from the fact that the supply of compression torque on the coupling converts ingrained
residual energy in the individual parts into utility energy assets for the support and sustenance of structures of
interest. The mechanics and practicality of this energy matrix theory has been investigated using congruent
scientific analysis, conventional tables, lab test data and graphics which depicts boundary behavioral
tendencies resulting from structural realignments in the face of increasing load value. The extreme limit of this
realignments, culminate in varying degrees of yield conditions particular viewed as deformation, which occurs
at the point of lowest energy availability in the coupled system.
Effects of Harness Running, Sand Running, Weight - Jacket Running and Weight ...IOSR Journals
Abstract: Background: The purpose of the study was to find the effects of Harness Running, Sand Running,
Weight-Jacket Running and Weight training on the performance of Dribbling and kicking among the Burdwan
Distrist School going soccer players.
Method-100 male students from the different schools of the Burdwan distrist were randomly selected as subjects
and there age were 14-18 years served as Harness Running group (HRG), second group served as Sand
Running group (SRG), third group served as Weight-Jacket Running group (WJRG), fourth group served as
Weight training group (WTG) and the fifth group served as Control group (CTG).Ten weeks training were given
for experiment accordingly. The control group was not given any training except of their routine. The selected
subjects were measure of the following soccer skills of Kicking and Dribbling. ANCOVA was calculation for
statistical treatment.
Finding: From the finding implies that the Weight Jacket Group was more effective in decreasing the time taken
and increasing the distance then all other training programs after ten weeks of training on Dribbling and
kicking.
Conclusions: In dribbling Weight Jacket Group showed higher adjusted post-test mean difference with Control
Group in comparison to other three training groups which is 0.8, higher than the critical difference 0.51
required being significant at 0.05 levels.
In kicking Weight Jacket Running Group showed higher adjusted post-test mean difference with Control Group
in comparison to other three training groups which are 2.50, higher than the critical difference 1.60 required
being significant at 0.05 levels.
Keywords: Harness Running, Sand Running, Weight-Jacket Running, Weight training, agility, Dribbling and
kicking
An Exploration of HCI Design Features and Usability Techniques in GamingIOSR Journals
Abstract: This Conference paper explores the human computer interaction design features relating to gaming
industry. The HCI user design interface development and HCI Usability expectations are discussed in this
paper. HCI design features of Simple Sudoku and Contemporary HCI Expectations are also discussed. And
suggestions are given to develop the Simple Sudoku as per HCI standards and expectations.
Keywords: Brain Computer Interface, Gestures Recognition, Hand Gestures in 3D, Pattern Language
Management Tool, Real Time Strategy Games
Design and Analysis of Impregnation Chamber Used In Vacuum Pressure Impregnat...IOSR Journals
The simple explanation is that in nature and in manufacturing, things leak. Vacuum impregnation
stops leak. The ultimate goal of vacuum impregnation is to seal leak/migration paths without impacting the
functional, assembly or appearance characteristics of a part. The impregnation chamber which is used in VPI
process operates maximum up to 80 to 150 psi.it is important to analyse and design the pressure vessel that will
provide safety, durability and serviceability to the company. Accomplishing this task will require a very good
understanding of behaviour and a good knowledge of parameters that affecting the pressure vessel due to
varying loads, pressure and thickness of shell element. The most important one is that the given geometry of
pressure vessel must be analysed to assure it should meet the design standards
A Study To Locate The Difference Between Active And Passive Recovery After St...IOSR Journals
Abstract: Exercise recovery involves a number of Post-exercise Steps that are essential for any exercise
regime, regardless of fitness level, the type of physical activity or the exercise intensity. Exercise recovery does
not take long or require much effort, but it is often neglected. The exercise recovery is mainly of two types one is
Active Recovery and the other is passive Recovery. Active Recovery is the term used for cooling down (with slow
jogging, stretching etc. ) after a high intensive work out and Passive Recovery is Stopping dead, doing nothing
again until he head out on his next run a couple of days later. The results of a study suggest that an active
recovery of 3 minutes between High intensity, short duration exercise bouts significantly increase peak power
and average power compared to a passive recovery, irrespective of changes in blood lactate levels. Several
research studies have been conducted in this specific area in the international level but the effort is supposed to
be weaker with respect to Indian Sport Scientists. Feeling the importance of recovery in the sport field and
considering its application in a wider range or rather as an effort to make it much more acceptable to the sport
society the investigator under the guidance of her supervisor envisaged to conduct the study entitled “A study to
locate the difference between active and passive recovery after strenuous workout.” The subjects for the present
study were 20 male trained athletes from Howrah and Purba Medinipur districts of West Bengal who were
selected randomly from a coaching camp. In the present study, the investigator has considered the following
things such as their – Age, sex, Height of the subject, Resting Heart Rate, Post Exercise Heart Rate, After Active
Recovery Heart Rate, After Passive Recovery Heart Rate. The scholar made the athletes to run 600 mts. and
recorded their Heart Rate just after completion of the workout and also recorded their HR after one minute of
complete rest the same procedure was repeated but in between the athletes were directed to perform active
recovery i.e. slow jogging. From data analysis it appears that the Active recovery is superior in comparison to
the Passive recovery because the recovery range is greater. Thus the scholar arrived at the explicit conclusion
that active recovery is better than passive recovery between exercise bouts or after strenuous workout.
Key Words: Active recovery, Passive Recovery, Strenuous workout.
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.
Analysis of Neighbor Knowledge Based Bcast Protocol Performance For Multihop ...pijans
Reliable group communication is a challenging issue for most Mobile Ad-hoc Networks (MANETs) due to
dynamic nature of wireless mobile nodes, group key establishment and management, ensuring secure
information exchange and Quality of Service (QoS) in data transfer. Recently multicast and broadcast
routing protocols are emerging for supporting QoS aware group communication. In MANETs QoS
requirements can be quantified by a set of measurable pre-specified service attributes such as packet
delivery ratio, end-to-end delay, packet loss probability, network control overhead, throughput,
bandwidth, power consumption, service coverage area etc. In this paper, the performance of a neighbor
knowledge based broadcast protocol is analyzed using different QoS metrics (packet delivery ratio, end-toend delay, packet loss probability and network control overhead). BCAST is used as broadcast protocol.
The performance differentials are analyzed using NS-2 network simulator for varying number of data
senders (multicast group size) and data sending rate (offered traffic to the network) over QoS aware group
communication. Simulation results show that BCAST performs well in most cases and provides robust
performance even with high traffic environments.
Analysis of Neighbor Knowledge Based Bcast Protocol Performance For Multihop ...pijans
Reliable group communication is a challenging issue for most Mobile Ad-hoc Networks (MANETs) due to
dynamic nature of wireless mobile nodes, group key establishment and management, ensuring secure
information exchange and Quality of Service (QoS) in data transfer. Recently multicast and broadcast
routing protocols are emerging for supporting QoS aware group communication. In MANETs QoS
requirements can be quantified by a set of measurable pre-specified service attributes such as packet
delivery ratio, end-to-end delay, packet loss probability, network control overhead, throughput,
bandwidth, power consumption, service coverage area etc. In this paper, the performance of a neighbor
knowledge based broadcast protocol is analyzed using different QoS metrics (packet delivery ratio, end-toend delay, packet loss probability and network control overhead). BCAST is used as broadcast protocol.
The performance differentials are analyzed using NS-2 network simulator for varying number of data
senders (multicast group size) and data sending rate (offered traffic to the network) over QoS aware group
communication. Simulation results show that BCAST performs well in most cases and provides robust
performance even with high traffic environments.
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.
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.
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.
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
Efficient and stable route selection by using cross layer concept for highly...Roopali Singh
Efficient and stable route selection by using cross layer concept for highly mobile network with predictive features by Rupali Singh, Gajendra Singh Dhakad
published in International Journal of Research & Technology, Volume 3, Issue 4_November_2015
A QUALITY OF SERVICE ARCHITECTURE FOR RESOURCE PROVISIONING AND RATE CONTROL ...ijasuc
Prioritized flow control is a type of QoS provisioning in which each class is provided a different QoS by
assigning priority to one class over another in terms of allocating resources. It is an effective means to
provide service differentiation to different class of service in mobile ad hoc networks. So the objective is to
achieve a desired level of service to high-priority flows so that the wireless medium is completely utilized
using adaptive rate control. In this paper, we propose to design QoS architecture for Bandwidth
Management and Rate Control in MANET. Our proposed QoS architecture contains an adaptive
bandwidth management technique which measures the available bandwidth at each node in real-time and
it is then propagated on demand by the QoS routing protocol. The source nodes perform call admission
control for different priority of flows based on the bandwidth information provided by the QoS routing.
The network bandwidth utilization is monitored continuously and network congestion is detected in
advance. Then a rate control mechanism is used to regulate best-effort traffic.
A QUALITY OF SERVICE ARCHITECTURE FOR RESOURCE PROVISIONING AND RATE CONTROL ...ijasuc
Prioritized flow control is a type of QoS provisioning in which each class is provided a different QoS by
assigning priority to one class over another in terms of allocating resources. It is an effective means to
provide service differentiation to different class of service in mobile ad hoc networks. So the objective is to
achieve a desired level of service to high-priority flows so that the wireless medium is completely utilized
using adaptive rate control. In this paper, we propose to design QoS architecture for Bandwidth
Management and Rate Control in MANET. Our proposed QoS architecture contains an adaptive
bandwidth management technique which measures the available bandwidth at each node in real-time and
it is then propagated on demand by the QoS routing protocol. The source nodes perform call admission
control for different priority of flows based on the bandwidth information provided by the QoS routing.
The network bandwidth utilization is monitored continuously and network congestion is detected in
advance. Then a rate control mechanism is used to regulate best-effort traffic.
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.
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.
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
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.
Link Stability and Energy Aware routing Protocol for Mobile Adhoc NetworkIOSR Journals
Abstract: MOBILE ad hoc networks (MANETs) have more popularity among mobile network devices and
wireless communication technologies. A MANET is multihop mobile wireless network that have neither a fixed
infrastructure nor a central server. Every node in a MANET will act as a router, and also communicates with
each other. The mobility constraints in mobile nodes will lead to problems in link stability. Energy saving, path
duration and stability will be two major efforts and to satisfy them can be difficult task. A self node which is
present in the network may also consume little energy during the transmission. This proposed approach tries to
account for link stability and for minimum drain rate energy consumption. In order to verify the correctness of
the proposed solution a objective optimization formulation has been designed and a novel routing protocol
called Link-Stability and Energy aware Routing protocols is proposed. This novel routing scheme has been
compared with other two protocols: PERRA and GPSR. The protocol performance has been evaluated in terms
of Data Packet Delivery Ratio, Normalized Control Overhead, Link duration, Nodes lifetime, and Average
energy consumption.
Keywords-component; Energy Consumption, Link Stability, Routing, Self node
Similar to Link Stability Based On Qos Aware On - Demand Routing In Mobile Ad Hoc Networks (20)
DevOps and Testing slides at DASA ConnectKari Kakkonen
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Tobias Schneck
As AI technology is pushing into IT I was wondering myself, as an “infrastructure container kubernetes guy”, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefit’s both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
Connector Corner: Automate dynamic content and events by pushing a buttonDianaGray10
Here is something new! In our next Connector Corner webinar, we will demonstrate how you can use a single workflow to:
Create a campaign using Mailchimp with merge tags/fields
Send an interactive Slack channel message (using buttons)
Have the message received by managers and peers along with a test email for review
But there’s more:
In a second workflow supporting the same use case, you’ll see:
Your campaign sent to target colleagues for approval
If the “Approve” button is clicked, a Jira/Zendesk ticket is created for the marketing design team
But—if the “Reject” button is pushed, colleagues will be alerted via Slack message
Join us to learn more about this new, human-in-the-loop capability, brought to you by Integration Service connectors.
And...
Speakers:
Akshay Agnihotri, Product Manager
Charlie Greenberg, Host
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
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.
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/
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
Let's dive deeper into the world of ODC! Ricardo Alves (OutSystems) will join us to tell all about the new Data Fabric. After that, Sezen de Bruijn (OutSystems) will get into the details on how to best design a sturdy architecture within ODC.
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.
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...Ramesh Iyer
In today's fast-changing business world, Companies that adapt and embrace new ideas often need help to keep up with the competition. However, fostering a culture of innovation takes much work. It takes vision, leadership and willingness to take risks in the right proportion. Sachin Dev Duggal, co-founder of Builder.ai, has perfected the art of this balance, creating a company culture where creativity and growth are nurtured at each stage.
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...
Link Stability Based On Qos Aware On - Demand Routing In Mobile Ad Hoc Networks
1. IOSR Journal of Computer Engineering (IOSRJCE)
ISSN: 2278-0661, ISBN: 2278-8727 Volume 5, Issue 3 (Sep-Oct. 2012), PP 52-57
www.iosrjournals.org
www.iosrjournals.org 52 | Page
Link Stability Based On Qos Aware On - Demand Routing In
Mobile Ad Hoc Networks
Prof.Rekha Patil1
, Megha Rani.R2
, Prof.Rajkumar Bainoor3
1,2
(Department of Computer Science and Engineering, PDA College of Engineering, Gulbarga, India)
3
(Department of E & CE, PDA College of Engineering, Gulbarga, India )
Abstract: MANET is a autonomous network where communicating entities can communicate without the aid of
any downlink power controller called base stations. The wide deployment of MANET, demand for providing
different quality of service (QoS) in the network has increased much. QoS routing strategy focused on routing
strategy for different QoS in this dynamic network. Hence the task of QoS routing is to optimize the network
resource utilization while satisfying the application requirements. Therefore there is no centralized control over
links. Further the link quality varies due to mobility of nodes. Existing routing protocols like Ad hoc on demand
routing protocol (AODV) or other quality of service routing have a scope of not making the changes in link
quality once the path is established and cost matrix is set to zero and link quality is not taken in to consideration
to select the stable paths. Therefore the performance of such system degrades with high mobility. Hence in this
work we emphasis on incorporating link quality estimation based on mobility prediction of nodes incorporate
same in the routing decision further new routes are accumulated and the primary transmission path is changed
in case of a better route interms of link quality is obtained. In this paper we mingle the idea of link stability and
cost matrix, power consumption to uncover better path interms of both stability and cost along with QoS
support.
Keywords: MANET, Performance metrics, Quality of Service, Routing
I. Introduction
A mobile ad hoc network is envisaged as a collection of mobile nodes with no fixed infrastructure and
with no central authority. Extensive use of portable mobile devices and the increasing demand of connectivity
among the devices have made mobile ad hoc network as one of the flourishing frontier of wireless research. Ad
hoc network is a network in which each node is willing to forward data for other nodes and the determination of
which nodes forward data is made dynamically based on the network connectivity [1]. Variety of applications
exist like personal area networking, disaster management , relief and rescue operation, military, business and
other scientific applications. Mobile ad hoc network is a self configured and self maintained network with no
centralized authority
Every node in the MANET acts as both a host and a router and must perform some network function.
With the development of the MANET, more importance is given to QoS routing strategy. QoS routing strategy
[3] focused on routing strategy for different QoS in this dynamic network. Variable link conditions are intrinsic
characteristics in most Mobile ad hoc networks. Rerouting among mobile nodes causes network topology in[2]
to change dynamically. MANET nodes move in unpredictable manner links between nodes are set up to carry
out the communication between the nodes once they become aware of each other. Several QoS routing protocol
is being proposed over the years. This claims to provide optimum routing and packet delivery solution to
MANET. Most of these QoS techniques are node centric which means the time of processing route request
decides if it can provide sufficient QoS to path before forwarding route request. But variations in link quality
should incorporate quality of all links through which data transmission is possible. There are major factors like
mobility, cost, power and energy efficiency need to be considered to assure better network performance.
Especially while assuring QoS in MANET environment nodes should not die due to power constraints or the
links should not expire due to mobility in the middle of the transmission. So our target is to choose a more stable
path considering higher link stability and less cost along with power variation. Considering these parameters we
present a routing algorithm which performs better in terms of cost and link quality. Simulation justifies our
claim in the latter section.
II. Related Work
An Ad hoc network is a network in which each node is willing to forward data for other nodes and the
determination of which nodes forward data is made dynamically based on the network connectivity an important
property of ad hoc network is the multi-hop capability and applications of mobile ad hoc network are discussed
[4] towards efficient delivery of services.
2. Link Stability Based on QoS Aware on - Demand Routing in Mobile Ad hoc Networks
www.iosrjournals.org 53 | Page
A good number of routing protocols [5] already been proposed for mobile ad hoc network. Proposed
routing protocols are often subdivided in two categories: Proactive (table driven) and reactive (on demand)
routing protocol. The on demand routing protocol AODV (Ad hoc on demand routing protocol) is a novel
algorithm for the operation of Ad hoc networks this protocol is an excellent choice for ad hoc network
establishment is proposed in[6][7] the phases involved in AODV are path discovery, route table management,
path maintenance,(RREQ,RREP,RERR) are the control messages used for establishing paths in the MANET.
Periodic hello messages can be used to ensure symmetric links as well as to detect link failures. [8] When a node
sends unsolicited RREP message to each of the source sending the traffic through the failed link to their
neighbors.
The Cross Layer violates the OSI layered architecture but keep the impact of design violations as small
as possible. Such violation of a layered architecture is cross layer design interfaces are created between the
layers in the CLD [9-11]. The most suitable design for communication in wireless networks is Cross Layer
Design (CLD). There are various cross layer design methods available. A simple and effective design of the
cross layer architecture has been chosen to improve the performance of lot of services in ad hoc networks. In
our paper, we are using upward information flow. A higher-layer protocol that require some information from
the lower layer(s) at runtime results in creation of a new interface from the lower layers to the higher layer.
In this paper the author discusses various QoS aware routing protocols and parameters [12].QoS aware
routing is of great importance in MANETs since it can improve the performance and allow critical information
to flow even under difficult conditions [15] there is necessity to measure link stability in order to provide QoS
while selecting route. One of the main challenges in providing QoS in MANETs is mobility of the nodes, which
makes connectivity unpredictable. QoS routing in MANET is usually limited by the network breakage due to
either node mobility or energy depletion of the mobile nodes. Link duration and link quality are measured [13].
The major problem with Ad hoc network is link quality variations due to mobility [14] of nodes. Link
stability, distance, velocity between nodes is discussed in [15][16] link quality is the most promised parameters,
since it define the ability of a link and devices to support the density of the traffic for the period of connection.
The link state between two neighbors can be affected by many parameters [17] such as distance, power and
mobility. Link stability models are discussed in [18] where link stability estimation model is proposed using
periodic beacons signals. Different characteristics of link stability are discussed [19].
III. Proposed Work
Ad hoc wireless routing protocols typically select the route with the low cost or minimum hop count to
the destination. However, routes chosen according to such criteria tend to include longer hop length links with
possibly bad signal quality links. So, the routing protocol must be improved by eliminating the usage of routes
with bad links.
The main scope of our work is to ensure QoS through link quality in MANET along with ensuring
transmission through best path in terms of less power loss. Link quality is one of the challenges in MANET
which effects the transmission quality, used to transmit real time traffic. This work can be used to find the stable
paths with minimum probability of link failures in the path. Power loss can also be a parameter for representing
link stability.
In this proposed work we emphasis on incorporating link quality estimation based on mobility
prediction of nodes incorporate same in the (AODV) routing decision to avoid routing through the bad quality
links and establish new routes and transmission path is changed a better route in terms of link quality is
obtained. A technique is proposed for estimating the link quality between the nodes. Each node finds its position
through the GPS (Global Positioning System) i.e., every physical node is equipped with a GPS [20].Where each
every node broadcasts X, Y to the neighbors through hello packet.
The distance between the nodes is calculated based on positional coordinates x1, x2, y1 and y2 for the
two nodes which are in the transmission range r and considering velocity v1,v2 and direction θ1 and θ2
respectively. The distance is given by:
D = x2 − x1 2 + y2 − y1 2 (1)
Where D is the distance between two nodes, t is the time period
Link stability between the nodes is calculated by:
Lst=Range/Distance (2)
Finally the link stability is calculated in terms of cost between the nodes. Cost is the major factor based
on which the path is considered as stable.
Cost= Lst +1/power (3)
This positional data is also appended in route request and send to destination. The path with minimum
cost and power variation is selected as stable path.
3. Link Stability Based on QoS Aware on - Demand Routing in Mobile Ad hoc Networks
www.iosrjournals.org 54 | Page
IV. System Design And Implementation
NO
NO
YES
YES
Figure 1: The flow chart of proposed work.
This paper has been implemented to know whether the paths used for routing the packets by nodes are
stable or not?
AODV routing protocol is used for routing the packets in the network. The fig (1) illustrates that when
nodes are in mobile, using GPS the positional coordinates x, y, v(velocity), theta,displacement are calculated.
start
Nodes in movement
Calculate the
pos(x,y),v,theta,displ
Generate RREQ
Append the positional
data
Cost=Lst-1/power
Cost <
previous
cost
Considered as stable
paths
Source node reestablishes
by RREQ
Destination generate RREP
Send data
Paths
available
?
Stop
4. Link Stability Based on QoS Aware on - Demand Routing in Mobile Ad hoc Networks
www.iosrjournals.org 55 | Page
These parameters are appended in RREQ and based on cost the path is selected for routing. If the cost is high
than the previous path then that path is rejected. The path with the low cost is selected as a stable for routing.
V. Simulation
To study the performance of our proposed algorithm simulation was conducted using OMNeT++ [21]
which supports complete physical, data link and MAC layer models for simulating wireless ad hoc networks.
OMNeT++is a freely distributed, object oriented, modular, discrete event simulator written in c++. It is designed
for general- purpose discrete-event simulation, and provides model libraries for communication protocols and
network systems. We simulated network of mobile nodes placed randomly in an area of 300*400 square meters,
with mobile nodes ranging from 10 to 50.A source and a destination is selected randomly. Free space
propogation model is assumed as the channel model. Each node is assumed to have constant transmission range
of 250meters. Mobility pattern of the mobile nodes is generated using Random way point model. A mobile node
selects another node in the network and constantly moves towards it at a given velocity. Once it reaches there, it
waits for some pause time and selects another node and again starts moving. By observing the performance of
the network under mobility we can test the stability of the design in real time scenario. Speed of mobile node is
assigned a value between 1 to 4 meters/sec. Initially all the mobile nodes would be given some initial energy
(10000). As the packets are to be transmitted through the nodes, they would lose some energy. It is assumed
from previous research [22](as the size of each packet is constant), that the radio interface , when powered on,
consumes 0.3mW while actually while receiving a packet and 0.9mW while transmitting a packet. As the
communication in MANET is normally a cross layered approach, upward information flow model is very
efficient in designing and modeling the network. The performance parameters studied for simulation study are
throughput, latency, packet delivery ratio and control overhead by varying the pause time ,simulation time and
load.
5.1 Results
Figure 2: Packet delivery ratio Vs Pause time
Fig (2) shows packet delivery ratio achieved by proposed protocol. Improved packet delivery ratio is achieved
due to the fact that the proposed protocol is to choose stable paths. Increasing the pause time effects the
proposed system. Packet delivery ratio does not effect with increasing pause time.
Figure 3: Packet delivery ratio vs Simulation time
0
20
40
60
80
100
20 30 43 50 60 80
PACKETDELIVERY
RATIO
PAUSE TIME
PAUSE TIME VS PACKET
DELIVERY RATIO
PROP-PDR
PRE-PDR
0
20
40
60
80
100
500
1000
1500
2000
PACKETDELIVERYRATIO
SIMTIME
SIMTIME VS PDR
PROP-PDR
PRE-PDR
5. Link Stability Based on QoS Aware on - Demand Routing in Mobile Ad hoc Networks
www.iosrjournals.org 56 | Page
Fig(3) shows the packet delivery ratio is better for proposed system than the existing system .As the simulation
time is increased the packet delivery ratio is not effected.
Figure 4: Control overhead Vs Simulation time
The control overhead is always almost constant in proposed system. Control overhead is less when compared
to the present system. The system performs better when control overhead is increased.
Figure 5: Throughput Vs Load
The throughput obtained is better for proposed as compared to present. As the rate of transmission of
packets (load) increases the throughput increases for our proposed system. The cross layer approach enables to
transmit at a rate to obtain high throughput.
5.2 Performance Metrics
Throughput: Network throughput is the average rate of successful bits delivery over a communication channel.
Channel utilization per second is known as throughput. The throughput is usually measured in bits per second
(bits/s or bps).
Control overhead: It is defined as number of control packets transmitted for every data packet delivered.
Packet delivery ratio: It is defined by a factor of number of packets received by number of packets transmitted.
Pause time: It is the time period between two subsequent movements in the mobility model of a node.
Packet rate (load): The number of packets per second going in or coming out of a given server.
Latency: It is the amount of time a message takes to traverse a system.
VI. CONCLUSION And FUTURE WORK
We present a new technique for simulation study to ensure several challenges in continuous and quality
transmission one of the major causes for performance degradation like packet drops are due to link losses and
link quality variations. Several link aware routings are also proposed which primarily determines the link quality
on power or signal to noise ratio. But experimental studies have shown that one of the major causes for link
failure is mobility of nodes, which directly effects the power losses in the transmission.
0
5
10
15
20
CONTROLOVERHEAD
SIMTIME
SIMTIME VS CONTROL
OVERHEAD
PROP-
CNTOV
PRE-CNTOV
0
2
4
6
8
10
100200300400500600
THROUGHPUT
LOAD
LOAD VS THROUGHPUT
PROP-THRU
PRE-THRU
6. Link Stability Based on QoS Aware on - Demand Routing in Mobile Ad hoc Networks
www.iosrjournals.org 57 | Page
Therefore in this work we propose link quality aware routing where link quality is measured using
prediction of node positions through the past history of nodes mobility. We also propose a unique mechanism of
accumulating new path as and when a path with better link quality is available. The cost matrix is calculated
based on link stability between nodes and power is also calculated. It has some limitation random mobility of
nodes with very high speed produces improper link quality measurements, multipath fading and wide channel
noise affects the link quality. In MANET link quality is one of the challenges which effects the transmission
quality, which is used to transmit real time traffic like multimedia etc.
A discrete-event C++ based simulator OMNeT++ can efficiently simulate proposed work. From the
simulation results we can conclude that the throughput and packet delivery ratio are significantly improved in
the proposed work. Control overhead is reduced to ensure better performance. There is however slight increase
in latency which is attributed by more packet delivery and layer updation.
The system can be further included by incorporating more matrices for link quality assessment like
channel noise, channel capacity, bit error rate , packet collisions and so on and by determining the best path
using statistical classifier Baysen or nearest neighbor classifier.
References
[1] Okeke, S. S. N, and Nwabueze, C.A., Mobile Ad hoc Network (MANET) architecture and implementation Analysis, Natural and
Applied Sciences Journal Vol.11 No.1.
[2] M-Mamum-Or-Rashid and Choong Seon Hong, LSLP: Link stability and lifetime prediction Based QoS Aware Routing for
MANET, Department of Computer Engineering.
[3] Yihai Zhang, Quality of Service for Ad hoc on-demand Distance Vector Routing, 1996.
[4] Jiazi YI, Polytech Nantes, A Survey on the Applications of MANET, Feb 2008.
[5] C E perkins and P.Bhagwat, Highly Dynamic Destination Sequenced, distance vector routing(DSDV) for mobile computers, In
Proc. ACM SIGCOMM, pp.234-244, 1994.
[6] Charles E perkins and Elizabeth M Royer, Ad hoc on-demand Distance Vector routing.
[7] Charles E Perkins and Elizabeth M. Royer, Samir R. Das and Mahesh K., Performance Comparision of Two on-demand Routing
Protocols for Ad hoc Networks, IEEE personal communications, Feb 2001, pp-16-28.
[8] Laura Marie Fenny, A Energy Consumption Model for Performance Analysis of Routing Protocols for Mobile Ad hoc Networks,
Mobile Networks and applications, Vol 6, pp-239-249,2001.
[9] Philip Hurni, Cross-Layer Design in Wireless Networks, April 2008.
[10] Jeffery Mehlman,” Cross-Layer Design : A Case for Standardization”,Jmehlman@stanford.edu.
[11] Vineet Srivastava, Mehul Otani, Cross-Layer Design: A survey and the Road Ahead, IEEE communications Magazine, December
2005.
[12] Shan Gong, Quality of Service Aware Routing Protocols for Mobile Ad hoc Networks, 2006.
[13] Shuchita Upadhayaya, Charu Gandhi, QoS Routing using Link and Node Stability in Mobile Ad hoc Networks, Journal of
Theoritical and Applied Information Technology 2009.
[14] Fan Bai and Ahmed Helmy, A Survey of Mobility models in Wireless Ad hoc Networks.
[15] S. Muthuramlingam and R. Rajaram, A Transmission Range Based Clustering Algorithm for Topology Control MANET,
International Journal on applications of graph theory in Wireless ad hoc networks Vol2,No.3,September 2010.
[16] Aarthi Agarwal, Samir R Das, Dead Reckoning in Mobile Ad hoc Networks, Computer Science and Engineering Department.
[17] Benamar KADRI, Djilali MOUSSAOUI, Mohammed FEHAM, Link Quality Based Ant Routing Algorithm for
MANETs(LQARA), 2011 PGNeT.
[18] Min-Gu lee and Suggu lee, A link Stability Model and Stable Routing for Mobile Adhoc Networks, Electrical and Computer
Engineering Division.
[19] Michael Gerharz, Christian dewaal, Matthias Frank peter Martini, Link Stability in Mobile Wireless Ad hoc Networks, Institute of
Computer Science.
[20] Sr dan Capkun, Maher Hamdi, Jean-pierre, GPS-Free Positioning in Mobile Ad hoc Networks, 2001.
[21] Andras Verga, OMNeT++, www.omnetpp.org.
[22] L.M. Fenny , Energy Consumption Model for Performance analysis of Routing Protocols for Mobile Ad hoc Networks , ACM J.
of Mobile Networks and Applications,Vol.6 issue 3, June 2001.