It is a big challenge to develop routing protocol that can meet different application needs and optimize routing paths according to the topology change in mobile ad hoc networks. The existing work presented two self-adaptive on-demand geographic routing schemes to build efficient paths based on the needs of user applications and adapt to various scenarios for provide efficient and reliable routing. To overcome the impact due to inaccurate local topology knowledge, the topology information is updated at a node in the specific time periods. The on-demand routing mechanism reduces to control overhead made on geographic routing. The route optimization scheme adapts routing path according to the topology changes and actual data traffic requirements. Adaptive parameter setting scheme is introduced to allow each node to determine and adjust the protocol parameter values independently. However, existing work did not address resource parameters such as energy, bandwidth and data loss. The proposal presents and Integrated Resource Adaptive on Demand Geographic Routing (IRA-ODGR) for MANET. The node energy resource is optimized with path energy consumption rate and bandwidth utilization of the path is analysed. Loss rate is reduced in geographic routing with dynamic routes. The simulation conducted to demonstrate IRA-ODGR routing protocols.
International Journal of Computational Engineering Research(IJCER)ijceronline
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
Improved routing scheme with ACO in WSN in comparison to DSDVijsrd.com
Routing is the process of selecting best paths in a network in terms of energy and distance. In adhoc it is critical to collect the information in an efficient manner as it has limitations in terms of centralized congestion. In such case to perform the effective communication there is the requirement of some such routing approach that can provide the routing with optimized path. In this work, ACO based routing approach is defined to generate the optimized path in comparison to DSDV over the network. The presented approach is implemented in matlab environment and obtained results shows the effective results in terms of optimized path.
POSITION BASED ADAPTIVE ROUTING FOR VANETSIJCNCJournal
Routing plays a very significant role in multi hop data dissemination in Vehicular Ad-Hoc Networks
(VANETs). Wehave proposed a Position based Adaptive Routing (PAR) protocol which is scalable for different
network densities in VANETs. This scheme uses Preferred Group Broadcasting (PGB) for route discovery.
In this mode, after broadcasting the request for route discovery the source node starts listening to
the channel. If the packet is not further rebroadcasted by any neighbor in a set timeout, then it repeats the
broadcast. This process is repeated until the request reaches the destination. The destination keeps on accumulating
route requests coming from different paths until predefined time. It then chooses the least cost
path as route reply. It uses the set of traversed anchors for sending the unicast route reply to the source
node. PAR uses Advance Greedy Forwarding (AGF) for data forwarding and greedily forwards the data
packet to the next anchor towards destination node. It switches to carry and forward mode once it finds
partitions in the network. The intermediate vehicle buffers the packet until next junction and switches back
to position based scheme and greedily forwards to next node in range which is closest to the destination. To
have an end to end connectedpath, it uses guards to guard anchors tied to different junction and geographical
locations in the network. The algorithm is scalable and exploits advantages of existing techniques
already developed for specific scenarios in VANET. Results show that the service ratio and packet
delay of PAR are higher than its counterparts.
GRAPH THEORETIC ROUTING ALGORITHM (GTRA) FOR MOBILE AD-HOC NETWORKS (MANET)graphhoc
Battlefield theater applications require supporting large number of nodes. It can facilitate many multi-hop
paths between each source and destination pairs. For scalability, it is critical that for supporting network
centric applications with large set of nodes require hierarchical approach to designing networks. In this
research we consider using Mobile Ad Hoc Network (MANET) with multiple clusters. Each cluster
supports a few nodes with a cluster head. The intra-cluster connectivity amongst the nodes within the
cluster is supported by multi-hop connectivity to ensure handling mobility in such a way that no service
disruption can occur. The inter-cluster connectivity is also achieved by multi-hop connectivity. However,
for inter-cluster communications, only cluster heads are connected. The selection of intra-cluster
communications and inter-cluster communications allow scalability of the network to support multiservices
applications end-to-end with a desired Quality of Service (QoS). This paper proposes graph
theoretic approach to establish efficient connection between a source and a destination within each cluster
in intra-cluster network and between clusters in inter-cluster network. Graph theoretic approach
traditionally was applied networks where nodes are static or fixed. In this paper, we have applied the
graph theoretic routing to MANET where nodes are mobile. One of the important challenges in MANET is
to support an efficient routing algorithm for multi-hop communications across many nodes which are
dynamic in nature. However, dynamic behavior of the nodes requires greater understanding of the node
degree and mobility at each instance of time in order to maintain end-to-end QoS for multi-service
provisioning. This paper demonstrates graph theoretic approach produces an optimum multi-hop
connectivity path based on cumulative minimum degree that minimizes the contention and scheduling
delay end-to-end. It is applied to both intra-cluster communications as well as inter-cluster
communications. The performance shows that having a multi-hop connectivity for intra-cluster
communications is more power efficient compared to broadcast of information with maximum power
coverage. Each cluster performs similarly and the algorithm is also used for inter-cluster communications.
Our simulation results show that the proposed graph theoretic routing approach will reduce the overall
delay and improves the physical layer data frame transmission.
Power Aware Geocast Based Geocast Region Tracking Using Mobile Node in Wirele...inventionjournals
One of the most significant challenges introduced by mobile networks is the difficulty in coping withthe unpredictable movement of Geocast mobile nodes. If, instead, the Geocast mobile nodes could be programmed totravel through the world in a predictable and useful manner, the task of designing algorithms for mobile networks would be significantly simplified.Geocasting represents today a challengingfield of research due to the numerous application scenariosoffered by ad hoc and sensor networks. Recently, the some Geocast routing protocols have beenproposed, most of which are basically inherited from unicastrouting solutions and consequently are not optimizedfor Geocast applications. Another, more interesting, classof region, which will be referred to as position-awareGeocast routing Algorithm, follow a progressive reductionin the distance to the destination, every time a relaynode must be chosen for forwarding a data packet. Thisallows to avoid the unnecessary dissemination of datapackets to nodes farther away from the destination andthe consequent useless energy consumption. This paperwill focus on the exploitation of this interesting positionawareapproach which seems to be more suitable forthe scenarios under consideration.
GPSFR: GPS-Free Routing Protocol for Vehicular Networks with Directional Ante...ijwmn
Efficient and practical communications between large numbers of vehicles are critical in providing high level of safety and convenience to drivers. Crucial real-time information on road hazard, traffic conditions and driver services must be communicated to vehicles rapidly even in adverse environments, such as “urban canyons” and tunnels. We propose a novel routing protocol in vehicular networks that does not require position information (e.g. from GPS) but instead rely on relative position that can be determined dynamically. This GPS-Free Geographic Routing (GPSFR) protocol uses the estimated relative position of vehicles and greedily chooses the best next hop neighbor based on a Balance Advance (BADV) metric which balances between proximity and link stability in order to improve routing performance. In this paper, we focuses primarily on the complexity of routing in highways and solves routing problems that arise when vehicles are near interchanges, curves, and merge or exit lanes of highways. Our simulation results show that by taking relative velocity into account, GPSFR reduces link breakage to only 27% that of GPSR in the dense network. Consequently, GPSFR outperforms GPSR in terms of higher data delivery ratio, lower delay, less sensitivity of the network density and route paths’length
International Journal of Computational Engineering Research(IJCER)ijceronline
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
Improved routing scheme with ACO in WSN in comparison to DSDVijsrd.com
Routing is the process of selecting best paths in a network in terms of energy and distance. In adhoc it is critical to collect the information in an efficient manner as it has limitations in terms of centralized congestion. In such case to perform the effective communication there is the requirement of some such routing approach that can provide the routing with optimized path. In this work, ACO based routing approach is defined to generate the optimized path in comparison to DSDV over the network. The presented approach is implemented in matlab environment and obtained results shows the effective results in terms of optimized path.
POSITION BASED ADAPTIVE ROUTING FOR VANETSIJCNCJournal
Routing plays a very significant role in multi hop data dissemination in Vehicular Ad-Hoc Networks
(VANETs). Wehave proposed a Position based Adaptive Routing (PAR) protocol which is scalable for different
network densities in VANETs. This scheme uses Preferred Group Broadcasting (PGB) for route discovery.
In this mode, after broadcasting the request for route discovery the source node starts listening to
the channel. If the packet is not further rebroadcasted by any neighbor in a set timeout, then it repeats the
broadcast. This process is repeated until the request reaches the destination. The destination keeps on accumulating
route requests coming from different paths until predefined time. It then chooses the least cost
path as route reply. It uses the set of traversed anchors for sending the unicast route reply to the source
node. PAR uses Advance Greedy Forwarding (AGF) for data forwarding and greedily forwards the data
packet to the next anchor towards destination node. It switches to carry and forward mode once it finds
partitions in the network. The intermediate vehicle buffers the packet until next junction and switches back
to position based scheme and greedily forwards to next node in range which is closest to the destination. To
have an end to end connectedpath, it uses guards to guard anchors tied to different junction and geographical
locations in the network. The algorithm is scalable and exploits advantages of existing techniques
already developed for specific scenarios in VANET. Results show that the service ratio and packet
delay of PAR are higher than its counterparts.
GRAPH THEORETIC ROUTING ALGORITHM (GTRA) FOR MOBILE AD-HOC NETWORKS (MANET)graphhoc
Battlefield theater applications require supporting large number of nodes. It can facilitate many multi-hop
paths between each source and destination pairs. For scalability, it is critical that for supporting network
centric applications with large set of nodes require hierarchical approach to designing networks. In this
research we consider using Mobile Ad Hoc Network (MANET) with multiple clusters. Each cluster
supports a few nodes with a cluster head. The intra-cluster connectivity amongst the nodes within the
cluster is supported by multi-hop connectivity to ensure handling mobility in such a way that no service
disruption can occur. The inter-cluster connectivity is also achieved by multi-hop connectivity. However,
for inter-cluster communications, only cluster heads are connected. The selection of intra-cluster
communications and inter-cluster communications allow scalability of the network to support multiservices
applications end-to-end with a desired Quality of Service (QoS). This paper proposes graph
theoretic approach to establish efficient connection between a source and a destination within each cluster
in intra-cluster network and between clusters in inter-cluster network. Graph theoretic approach
traditionally was applied networks where nodes are static or fixed. In this paper, we have applied the
graph theoretic routing to MANET where nodes are mobile. One of the important challenges in MANET is
to support an efficient routing algorithm for multi-hop communications across many nodes which are
dynamic in nature. However, dynamic behavior of the nodes requires greater understanding of the node
degree and mobility at each instance of time in order to maintain end-to-end QoS for multi-service
provisioning. This paper demonstrates graph theoretic approach produces an optimum multi-hop
connectivity path based on cumulative minimum degree that minimizes the contention and scheduling
delay end-to-end. It is applied to both intra-cluster communications as well as inter-cluster
communications. The performance shows that having a multi-hop connectivity for intra-cluster
communications is more power efficient compared to broadcast of information with maximum power
coverage. Each cluster performs similarly and the algorithm is also used for inter-cluster communications.
Our simulation results show that the proposed graph theoretic routing approach will reduce the overall
delay and improves the physical layer data frame transmission.
Power Aware Geocast Based Geocast Region Tracking Using Mobile Node in Wirele...inventionjournals
One of the most significant challenges introduced by mobile networks is the difficulty in coping withthe unpredictable movement of Geocast mobile nodes. If, instead, the Geocast mobile nodes could be programmed totravel through the world in a predictable and useful manner, the task of designing algorithms for mobile networks would be significantly simplified.Geocasting represents today a challengingfield of research due to the numerous application scenariosoffered by ad hoc and sensor networks. Recently, the some Geocast routing protocols have beenproposed, most of which are basically inherited from unicastrouting solutions and consequently are not optimizedfor Geocast applications. Another, more interesting, classof region, which will be referred to as position-awareGeocast routing Algorithm, follow a progressive reductionin the distance to the destination, every time a relaynode must be chosen for forwarding a data packet. Thisallows to avoid the unnecessary dissemination of datapackets to nodes farther away from the destination andthe consequent useless energy consumption. This paperwill focus on the exploitation of this interesting positionawareapproach which seems to be more suitable forthe scenarios under consideration.
GPSFR: GPS-Free Routing Protocol for Vehicular Networks with Directional Ante...ijwmn
Efficient and practical communications between large numbers of vehicles are critical in providing high level of safety and convenience to drivers. Crucial real-time information on road hazard, traffic conditions and driver services must be communicated to vehicles rapidly even in adverse environments, such as “urban canyons” and tunnels. We propose a novel routing protocol in vehicular networks that does not require position information (e.g. from GPS) but instead rely on relative position that can be determined dynamically. This GPS-Free Geographic Routing (GPSFR) protocol uses the estimated relative position of vehicles and greedily chooses the best next hop neighbor based on a Balance Advance (BADV) metric which balances between proximity and link stability in order to improve routing performance. In this paper, we focuses primarily on the complexity of routing in highways and solves routing problems that arise when vehicles are near interchanges, curves, and merge or exit lanes of highways. Our simulation results show that by taking relative velocity into account, GPSFR reduces link breakage to only 27% that of GPSR in the dense network. Consequently, GPSFR outperforms GPSR in terms of higher data delivery ratio, lower delay, less sensitivity of the network density and route paths’length
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.
A Proactive Greedy Routing Protocol Precludes Sink-Hole Formation in Wireless...ijwmn
The International Journal of Wireless & Mobile Networks (IJWMN) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Wireless & Mobile Networks. The journal focuses on all technical and practical aspects of Wireless & Mobile Networks. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced wireless & mobile networking concepts and establishing new collaborations in these areas.
PERFORMANCE ANALYSIS OF OLSR PROTOCOL IN MANET CONSIDERING DIFFERENT MOBILITY...ijwmn
A Mobile Ad Hoc Network (MANET) is created when an independent mobile node network is connected
dynamically via wireless links. MANET is a self-organizing network that does not rely on pre-existing
infrastructure such as wired or wireless network routers. Mobile nodes in this network move randomly,
thus, the topology is always changing. Routing protocols in MANET are critical in ensuring dependable
and consistent connectivity between the mobile nodes. They conclude logically based on the interaction
between mobile nodes in MANET routing and encourage them to choose the optimum path between source
and destination. Routing protocols are classified as proactive, reactive, or hybrid. The focus of this project
will be on Optimized Link State Routing (OLSR) protocol, a proactive routing technique. OLSR is known as
the optimized variant of link state routing in which packets are sent throughout the network using the
multipoint relay (MPR) mechanism. This article evaluates the performance of the OLSR routing protocol
under condition of changing mobility speed and network density. The study's performance indicators are
average packet throughput, packet delivery ratio (PDR), and average packet latency. Network Simulator 2
(NS-2) and an external patch UM-OLSR are used to simulate and evaluate the performance of such
protocol. As a result of research, the approach of implementing the MPR mechanism are able to minimise
redundant data transmission during the normal message broadcast. The MPRs enhance the link state
protocols’ traditional diffusion mechanism by selecting the right MPRs. Hence, the number of undesired
broadcasts can be reduced and limited. Further research will focus on different scenario and environment
using different mobility model
IRJET-Mobility Aware Refined Counter Based Broadcasting Model of MANETIRJET Journal
Manjusha Deshmukh,Ratnadeep Deshmukh, Sangeeta Kakarwal, "Mobility Aware Refined Counter Based Broadcasting Model of MANET", International Research Journal of Engineering and Technology (IRJET), Vol2,issue-01 March 2015. p-ISSN:2395-0056, e-ISSN:2395-0072. www.irjet.net ,published by Fast Track Publications
Abstract
The MANET is a special type of wireles mobile network in which mobile hosts can communicate without any aid of established infrastructure. Broadcast or flooding is a dissemination technique oparamount importance in mobile ad-hoc networks MANETs are generating lots of interest due to their dynamic topology and decentralized administration Due to the mobility of nodes there are many problem occurred during the packet transmission. Basic routing protocols such as Ad hoc on Demand Distance Vecto(AODV), Dynamic source routing (DSR) could lead toissues such as Broadcast Storm Problem, Large power consumption, link failure due to mobility. Counter based approaches inhibit a node from broadcasting a packet based on number of copies of the broadcaspacket received by the node within a random accessdelay time. It relies on the threshold value to decide whether or not to forward broadcast packet. In this paper, model is proposed which refines the counter based threshold based on network density and the mobility of nodes. The paper refined the sparse threshold as low sparse threshold and high sparse threshold and dense threshold as low dense threshold and high dense threshold.
Abstract—Geographic routing also called as Geo routing is a routing principle which relies on the Geographic position information. Geographic routing is the most commonly used routing for MANETs. In Geographic routing each node should be aware of its neighbor’s location to maintain the local topology accuracy. Hence, each node should update its location information through a message called beacon. Existing mechanisms invoke periodic beacon update scheme which consumes the network resources such as energy and bandwidth specifically when the network traffic is high, it creates packet loss in the network and it leads to retransmission of data packet causing additional delay and energy consumption. In this work, adaptive position update is proposed which dynamically adjusts the beacon updation frequency according to the varying network conditions.APU makes use of mobility prediction rule and on demand learning rule for beacon updation.
Auction Game Theory Based Adaptive Position Update Strategy for Geographic Ro...IJSRD
The Auction game based Adaptive Position Update strategy for geographic routing, which dynamically adjusts the frequency of position updates based on the mobility dynamics of the nodes and the forwarding patterns in the network. Adaptive position update is based on three simple principles: first principle is nodes whose movements are harder to predict update their positions more frequently (and vice versa), then the second principle is nodes closer to forwarding paths update their positions more frequently (and vice versa) and last principle is Forwarding nodes are selected based on distance and residual energy with bidding among the neighbors. Several experimental analyses, which is validated by NS2 simulations of a well-known geographic routing protocol, Greedy Perimeter Stateless Routing Protocol (GPSR), shows that game based Adaptive Position Update strategy for geographic routing can significantly improve the packet delivery ratio and improve the routing performance in terms of throughput in comparison with periodic beaconing and other recently proposed updating schemes. Finally give a better result in throughput and packet delivery ration by incurring a relatively smaller delay in delivering the packets. As the no. of nodes increases, this results in better packet delivery ratio of around 98%. The tradeoff between packet delivery ratio and Routing Over Head is slightly increased, The benefits of our work further confirmed by undertaking evaluations in realistic network scenarios, which account for localization error, realistic radio propagation, and sparse network.
International Journal of Engineering Inventions (IJEI) provides a multidisciplinary passage for researchers, managers, professionals, practitioners and students around the globe to publish high quality, peer-reviewed articles on all theoretical and empirical aspects of Engineering and Science.
Reducing Packet Transmission Delay in Vehicular Ad Hoc Networks using Edge No...CSCJournals
VANETs (Vehicular Ad hoc Networks) are highly mobile wireless ad hoc networks and will play an important role in public safety communications and commercial applications. Routing of data in VANETs is a challenging task due to rapidly changing topology and high speed mobility of vehicles. Conventional routing protocols in MANETs (Mobile Ad hoc Networks) are unable to fully address the unique characteristics in vehicular networks. In this paper, we propose EBGR (Edge Node Based Greedy Routing), a greedy position based routing approach to forward packets to the node present in the edge of the limited transmission range of source/forwarding node as most suitable next hop, with consideration of nodes moving in the direction of the destination. We propose Revival Mobility model (RMM) to evaluate the performance of our routing technique. This paper presents a detailed description of our approach and simulation results show that end to end delay in packet transmission is minimized considerably compared to current routing protocols of VANET.
Evaluation of Energy Consumption of Reactive and Proactive Routing Protocols ...IJCNCJournal
Mobile Ad hoc Network (MANET) is a distributed, infrastructure-less and decentralized network. A routing
protocol in MANET is used to find routes between mobile nodes to facilitate communication within the
network. Numerous routing protocols have been proposed for MANET. Those routing protocols are
designed to adaptively accommodate for dynamic unpredictable changes in network's topology. The mobile
nodes in MANET are often powered by limited batteries and network lifetime relies heavily on the energy
consumption of nodes. In consequence, the lack of a mobile node can lead to network partitioning. In this
paper we analyse, evaluate and measure the energy efficiency of three prominent MANET routing protocols
namely DSR, AODV and OLSR in addition to modified protocols. These routing protocols follow the
reactive and the proactive routing schemes. A discussion and comparison highlighting their particular
merits and drawbacks are also presented. Evaluation study and simulations are performed using NS-2 and
its accompanying tools for analysis and investigation of results.
A comparative study in wireless sensor networksijwmn
Sensor networks consist of a large number of small, low-powered wireless nodes with limited computation,
communication, and sensing abilities, in a battery-powered sensor network, energy and communication
bandwidth are a precious resources. Thus, there is a need to adapt the networking process to match the
application in order to minimize the resources consumed and extend the life of the network. In this paper,
we introduce a comparative study in different routing algorithms that propose vital solutions to the most
important issues that should be taken into account when designing wireless network which are reliability,
lifetime, communication bandwidth, transmission rand, and finally the limited energy issue, so we will
introduce their algorithms and discuss how did they propose to solve such of these challenges and finally
we will do some evaluation to each approach.
A CRITICAL REVIEW OF THE ROUTING PROTOCOLS FOR COGNITIVE RADIO NETWORKS AND A...cscpconf
We present a critical review and analysis of different categories of routing protocols for cognitive radio networks. We first classify the available solutions to two broad categories: those
based on full spectrum knowledge (typically used to establish performance benchmarks) and those based on local spectrum knowledge (used for real-time implementation). The full spectrum knowledge based routing solutions are analyzed from a graph-theoretic point of view, and we review the layered graph, edge coloring and conflict graph models. We classify the various local spectrum knowledge based routing protocols into the following five categories: Minimum power, Minimum delay, Maximum throughput, Geographic and Class-based routing. A total of 25 routing protocols proposed for cognitive radio networks have been reviewed. We discuss the working principle and analyze the pros and cons of the routing protocols. Finally, we propose an idea of a load balancing-based local spectrum knowledge-based routing protocol for cognitive radio ad hoc networks.
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.
A Study of Various Projected Data Based Pattern Mining Algorithmsijsrd.com
The time required for generating frequent patterns plays an important role. Some algorithms are designed, considering only the time factor. Our study includes depth analysis of algorithms and discusses some problems of generating frequent pattern from the various algorithms. We have explored the unifying feature among the internal working of various mining algorithms. The work yields a detailed analysis of the algorithms to elucidate the performance with standard dataset like Mushroom etc. The comparative study of algorithms includes aspects like different support values, size of transactions.
Energy-Efficient Image Transmission over OFDM Channel Using Huffman Codingijsrd.com
In this paper, Energy efficient image transmission using Huffman coding over OFDM channel has been proposed, which combines wavelet-based image decomposition and Huffman coding. Wavelet image transform provides data decomposition in multiple levels of resolution, so the image can be divided into packets with different priorities. The consumed energy when DWT is applied is clearly lower compared to the case without DWT. Using Huffman coding scheme, compress the low frequency band. In the proposed scheme, lower-resolution version of the compressed image obtained via discrete wavelet transform (DWT) is used. And show that the proposed strategy (DWT with Huffman coding)is more energy efficient than previous work (DWT without Huffman coding).In addition show that error rate(BER) is low compared to existing system(DWT without Huffman coding).
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.
A Proactive Greedy Routing Protocol Precludes Sink-Hole Formation in Wireless...ijwmn
The International Journal of Wireless & Mobile Networks (IJWMN) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Wireless & Mobile Networks. The journal focuses on all technical and practical aspects of Wireless & Mobile Networks. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced wireless & mobile networking concepts and establishing new collaborations in these areas.
PERFORMANCE ANALYSIS OF OLSR PROTOCOL IN MANET CONSIDERING DIFFERENT MOBILITY...ijwmn
A Mobile Ad Hoc Network (MANET) is created when an independent mobile node network is connected
dynamically via wireless links. MANET is a self-organizing network that does not rely on pre-existing
infrastructure such as wired or wireless network routers. Mobile nodes in this network move randomly,
thus, the topology is always changing. Routing protocols in MANET are critical in ensuring dependable
and consistent connectivity between the mobile nodes. They conclude logically based on the interaction
between mobile nodes in MANET routing and encourage them to choose the optimum path between source
and destination. Routing protocols are classified as proactive, reactive, or hybrid. The focus of this project
will be on Optimized Link State Routing (OLSR) protocol, a proactive routing technique. OLSR is known as
the optimized variant of link state routing in which packets are sent throughout the network using the
multipoint relay (MPR) mechanism. This article evaluates the performance of the OLSR routing protocol
under condition of changing mobility speed and network density. The study's performance indicators are
average packet throughput, packet delivery ratio (PDR), and average packet latency. Network Simulator 2
(NS-2) and an external patch UM-OLSR are used to simulate and evaluate the performance of such
protocol. As a result of research, the approach of implementing the MPR mechanism are able to minimise
redundant data transmission during the normal message broadcast. The MPRs enhance the link state
protocols’ traditional diffusion mechanism by selecting the right MPRs. Hence, the number of undesired
broadcasts can be reduced and limited. Further research will focus on different scenario and environment
using different mobility model
IRJET-Mobility Aware Refined Counter Based Broadcasting Model of MANETIRJET Journal
Manjusha Deshmukh,Ratnadeep Deshmukh, Sangeeta Kakarwal, "Mobility Aware Refined Counter Based Broadcasting Model of MANET", International Research Journal of Engineering and Technology (IRJET), Vol2,issue-01 March 2015. p-ISSN:2395-0056, e-ISSN:2395-0072. www.irjet.net ,published by Fast Track Publications
Abstract
The MANET is a special type of wireles mobile network in which mobile hosts can communicate without any aid of established infrastructure. Broadcast or flooding is a dissemination technique oparamount importance in mobile ad-hoc networks MANETs are generating lots of interest due to their dynamic topology and decentralized administration Due to the mobility of nodes there are many problem occurred during the packet transmission. Basic routing protocols such as Ad hoc on Demand Distance Vecto(AODV), Dynamic source routing (DSR) could lead toissues such as Broadcast Storm Problem, Large power consumption, link failure due to mobility. Counter based approaches inhibit a node from broadcasting a packet based on number of copies of the broadcaspacket received by the node within a random accessdelay time. It relies on the threshold value to decide whether or not to forward broadcast packet. In this paper, model is proposed which refines the counter based threshold based on network density and the mobility of nodes. The paper refined the sparse threshold as low sparse threshold and high sparse threshold and dense threshold as low dense threshold and high dense threshold.
Abstract—Geographic routing also called as Geo routing is a routing principle which relies on the Geographic position information. Geographic routing is the most commonly used routing for MANETs. In Geographic routing each node should be aware of its neighbor’s location to maintain the local topology accuracy. Hence, each node should update its location information through a message called beacon. Existing mechanisms invoke periodic beacon update scheme which consumes the network resources such as energy and bandwidth specifically when the network traffic is high, it creates packet loss in the network and it leads to retransmission of data packet causing additional delay and energy consumption. In this work, adaptive position update is proposed which dynamically adjusts the beacon updation frequency according to the varying network conditions.APU makes use of mobility prediction rule and on demand learning rule for beacon updation.
Auction Game Theory Based Adaptive Position Update Strategy for Geographic Ro...IJSRD
The Auction game based Adaptive Position Update strategy for geographic routing, which dynamically adjusts the frequency of position updates based on the mobility dynamics of the nodes and the forwarding patterns in the network. Adaptive position update is based on three simple principles: first principle is nodes whose movements are harder to predict update their positions more frequently (and vice versa), then the second principle is nodes closer to forwarding paths update their positions more frequently (and vice versa) and last principle is Forwarding nodes are selected based on distance and residual energy with bidding among the neighbors. Several experimental analyses, which is validated by NS2 simulations of a well-known geographic routing protocol, Greedy Perimeter Stateless Routing Protocol (GPSR), shows that game based Adaptive Position Update strategy for geographic routing can significantly improve the packet delivery ratio and improve the routing performance in terms of throughput in comparison with periodic beaconing and other recently proposed updating schemes. Finally give a better result in throughput and packet delivery ration by incurring a relatively smaller delay in delivering the packets. As the no. of nodes increases, this results in better packet delivery ratio of around 98%. The tradeoff between packet delivery ratio and Routing Over Head is slightly increased, The benefits of our work further confirmed by undertaking evaluations in realistic network scenarios, which account for localization error, realistic radio propagation, and sparse network.
International Journal of Engineering Inventions (IJEI) provides a multidisciplinary passage for researchers, managers, professionals, practitioners and students around the globe to publish high quality, peer-reviewed articles on all theoretical and empirical aspects of Engineering and Science.
Reducing Packet Transmission Delay in Vehicular Ad Hoc Networks using Edge No...CSCJournals
VANETs (Vehicular Ad hoc Networks) are highly mobile wireless ad hoc networks and will play an important role in public safety communications and commercial applications. Routing of data in VANETs is a challenging task due to rapidly changing topology and high speed mobility of vehicles. Conventional routing protocols in MANETs (Mobile Ad hoc Networks) are unable to fully address the unique characteristics in vehicular networks. In this paper, we propose EBGR (Edge Node Based Greedy Routing), a greedy position based routing approach to forward packets to the node present in the edge of the limited transmission range of source/forwarding node as most suitable next hop, with consideration of nodes moving in the direction of the destination. We propose Revival Mobility model (RMM) to evaluate the performance of our routing technique. This paper presents a detailed description of our approach and simulation results show that end to end delay in packet transmission is minimized considerably compared to current routing protocols of VANET.
Evaluation of Energy Consumption of Reactive and Proactive Routing Protocols ...IJCNCJournal
Mobile Ad hoc Network (MANET) is a distributed, infrastructure-less and decentralized network. A routing
protocol in MANET is used to find routes between mobile nodes to facilitate communication within the
network. Numerous routing protocols have been proposed for MANET. Those routing protocols are
designed to adaptively accommodate for dynamic unpredictable changes in network's topology. The mobile
nodes in MANET are often powered by limited batteries and network lifetime relies heavily on the energy
consumption of nodes. In consequence, the lack of a mobile node can lead to network partitioning. In this
paper we analyse, evaluate and measure the energy efficiency of three prominent MANET routing protocols
namely DSR, AODV and OLSR in addition to modified protocols. These routing protocols follow the
reactive and the proactive routing schemes. A discussion and comparison highlighting their particular
merits and drawbacks are also presented. Evaluation study and simulations are performed using NS-2 and
its accompanying tools for analysis and investigation of results.
A comparative study in wireless sensor networksijwmn
Sensor networks consist of a large number of small, low-powered wireless nodes with limited computation,
communication, and sensing abilities, in a battery-powered sensor network, energy and communication
bandwidth are a precious resources. Thus, there is a need to adapt the networking process to match the
application in order to minimize the resources consumed and extend the life of the network. In this paper,
we introduce a comparative study in different routing algorithms that propose vital solutions to the most
important issues that should be taken into account when designing wireless network which are reliability,
lifetime, communication bandwidth, transmission rand, and finally the limited energy issue, so we will
introduce their algorithms and discuss how did they propose to solve such of these challenges and finally
we will do some evaluation to each approach.
A CRITICAL REVIEW OF THE ROUTING PROTOCOLS FOR COGNITIVE RADIO NETWORKS AND A...cscpconf
We present a critical review and analysis of different categories of routing protocols for cognitive radio networks. We first classify the available solutions to two broad categories: those
based on full spectrum knowledge (typically used to establish performance benchmarks) and those based on local spectrum knowledge (used for real-time implementation). The full spectrum knowledge based routing solutions are analyzed from a graph-theoretic point of view, and we review the layered graph, edge coloring and conflict graph models. We classify the various local spectrum knowledge based routing protocols into the following five categories: Minimum power, Minimum delay, Maximum throughput, Geographic and Class-based routing. A total of 25 routing protocols proposed for cognitive radio networks have been reviewed. We discuss the working principle and analyze the pros and cons of the routing protocols. Finally, we propose an idea of a load balancing-based local spectrum knowledge-based routing protocol for cognitive radio ad hoc networks.
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.
A Study of Various Projected Data Based Pattern Mining Algorithmsijsrd.com
The time required for generating frequent patterns plays an important role. Some algorithms are designed, considering only the time factor. Our study includes depth analysis of algorithms and discusses some problems of generating frequent pattern from the various algorithms. We have explored the unifying feature among the internal working of various mining algorithms. The work yields a detailed analysis of the algorithms to elucidate the performance with standard dataset like Mushroom etc. The comparative study of algorithms includes aspects like different support values, size of transactions.
Energy-Efficient Image Transmission over OFDM Channel Using Huffman Codingijsrd.com
In this paper, Energy efficient image transmission using Huffman coding over OFDM channel has been proposed, which combines wavelet-based image decomposition and Huffman coding. Wavelet image transform provides data decomposition in multiple levels of resolution, so the image can be divided into packets with different priorities. The consumed energy when DWT is applied is clearly lower compared to the case without DWT. Using Huffman coding scheme, compress the low frequency band. In the proposed scheme, lower-resolution version of the compressed image obtained via discrete wavelet transform (DWT) is used. And show that the proposed strategy (DWT with Huffman coding)is more energy efficient than previous work (DWT without Huffman coding).In addition show that error rate(BER) is low compared to existing system(DWT without Huffman coding).
Impact of Clipping and Filtering on Peak to Average Power Ratio of OFDM Systemijsrd.com
Orthogonal Frequency Division Multiplexing (OFDM) is an emerging field of research in the field of 4G broadband wireless communications due to its robustness against multipath fading and relatively simple implementation. Peak to Average Power Ratio (PAPR) is the limiting factor for an OFDM system as it consists of large number of independent subcarriers as a result of which the amplitude of such a signal can have high peak values which degrades the system performance. Such a signal when amplified by a Power Amplifier without processing results spectral regrowth and intermodulation among subcarrier. Hence this non linearity destroys the orthogonally of the OFDM signal and introduces out-of-band radiation and in band distortions causing significant performance degradation. The clipping and filtering method is analysed which is an efficient and simple method to reduce the PAPR. We have shown the effects of clipping and filtering on the performance of OFDM, including the power spectral density, the crest factor, and the bit-error rate.
A Quick Glance over the Digital Watermarkingijsrd.com
Digital watermarking is a process for modifying physical or electronic media to embed a machine-readable code into the media. The media may be modified such that the embedded code is imperceptible or nearly imperceptible to the user, yet may be detected through an automated detection process. Watermarking is the art of imperceptibly embedding a message into a work. More than 700 years ago in Fabriano (Italy), paper watermarks appeared in handmade paper, in order to identify its provenance, format, and quality. In this context, the watermark is a kind of invisible signature that allows identifying the creator or the owner of a document, and to detect possible copyright violations, and especially non-authorized copying [1]. More recently, different watermarking techniques and strategies have been proposed in order to solve a number of problems, ranging from the detection of content manipulations, to information hiding (steganography), to document usage tracing. In particular, the insertion of multiple watermarks to trace a document during its lifecycle is a very interesting and challenging application [1]. The main property of the proposed method is that it allows the insertion of multiple watermarks by different users, who sequentially come into play one after the other and do not need any extra information besides the public keys. This characteristic makes the present approach more attractive than previously available solutions.
Effect of Compression Ratio on Performance of Combined Cycle Gas Turbineijsrd.com
It is known the performance of a gas turbine (GT) has strong dependence of climate conditions. A suitable solution to minimize this negative effect is to raise inlet turbine temperature and reduce temperature of inlet air to GT compressor. Combined cycles gas turbines (CCGT) are a lot used to acquire a high-efficiency power plant. Increases the peak compression ratio has been proposed to improve the combined-cycle gas-turbine performance. The code of the performance model for CCGT power plant was developed utilizing the MATLAB software. The simulating results show that the overall efficiency increases with the increase of the peak compression ratio. The total power output increases with the increase of the peak compression ratio. The peak overall efficiency occurs at the higher compression ratio with low ambient temperature and higher turbine inlet temperature. The overall thermal efficiencies for CCGT are higher compared to gas-turbine plants.
Secure System based on Dynamic Features of IRIS Recognitionijsrd.com
Basically, the idea behind this system is improvement in cybernetics, the biometric person identification technique based on the pattern of the human iris is well suited to be applied to access control. The human eye is sensitive to visible light. Security systems having realized the value of biometrics for two basic purposes: to verify or identify users. In this busy world, identification should be fast and efficient. In this paper I focus on an efficient methodology for identification and verification for iris detection using Haar transform and Minimum hamming distance. I use canny operator for the edge detection. This biological phenomenon contracts and dilates the two pupils synchronously when illuminating one of the eyes by visible light .I applied the Haar wavelet compressing the data. By comparing the quantized vectors using the Hamming Distance operator, we determine finally whether two irises are similar. The result shows that system is quite effective.
Adaptive Signal Processing has been playing a key role confining itself not just to the field of communications but also had spread into the fields of embedded systems, biological instruments, astronomy, image processing and many other fields. Adaptive filters are slowly replacing traditional filters in many areas. The development of new techniques and trends of adaptation algorithms has provided us with a broader sense of understanding the adaptation phenomena. In this paper some basic algorithms such as Least-Mean-Squares, Leaky-LMS, Normalized-LMS, and Recursive-Least-Squares algorithms have been studied and the convergence of these algorithms has been studied. The study convergence of the algorithms gives us a better picture of how fast the algorithms converge to optimum values. This is an issue of consideration in real-time signal processing as the signal processor implementing these kinds of algorithms has to be converging fast enough to the optimum values to save time and memory.
Cost Effective and Innovative Housing Technologyijsrd.com
Shelter is amongst the three basic human needs but now-a-days, about two-third of the total Indian population does not have their own shelter. This two-third population belongs to the middle and lower income class. These people find it difficult to construct their houses at an affordable cost by using conventional construction technology. It is found in many cases that people serve their whole life constructing their own house, but fail. The mission and dream of these people can be achieved by appropriate use of cost effective and innovative construction technology. As a whole, the housing shortage of the country can be overcome within lesser funds, without compromising with the quality control and structural stability of the structure. Note: This technology is only applicable for single or two storied buildings and can be applied in most of the soil and climatic conditions.
Software Development Life Cycle: Traditional and Agile- A Comparative Studyijsrd.com
In the field of software development, software development lifecycle is the most important component. There is a number of software development methodologies used in software industry today. The paper discussed below focuses on the modern SDLC which are traditional methods and the agile methods. It also explains the compensation and shortcomings of the traditional as well as agile methods. Along with this, it suggests some improvements which could help in improving current agile development
Earthquakes are very serious problems since they affect human life in various ways. The Earthquakes are mainly prevented by two methods namely Base Isolation Methods and Seismic Dampers. The present paper deals with 1.Increase natural period of structure by "Base Isolation Techniques".2.Increase damping of the system by "Energy Dissipation Devices". In brief manner. This paper explains the main theme of the above methods and their preventive methods about Earthquakes. The present paper deals with structures which resist Earthquakes. It explains the frames which help in resisting Earthquakes. In total, this present paper deals with Methods of resisting Earthquakes and Frames resisting them and also the prominent techniques followed to resist Earthquakes.
Classification of Malware based on Data Mining Approachijsrd.com
In recent years, the number of malware families/variants has exploded dramatically. Automatic malware classification is becoming an important research area. Using data mining, we identify seven key features within the Microsoft PE file format that can be fed to machine learning algorithms to classify malware. In this paper, resting on the analysis of Windows API execution sequences called by PE files, we develop the Intelligent Malware Detection System (IMDS) using Objective- Oriented Association (OOA) mining based classification. IMDS is an integrated system consisting of three major modules: PE parser, OOA rule generator, and rule based classifier. An OOA_Fast_FP Growth algorithm is adapted to efficiently generate OOA rules for classification. Promising experimental results demonstrate that the accuracy and efficiency of our IMDS system outperform popular anti-virus software such as Norton Antivirus and McAfee Virus Scan, as well as previous data mining based detection systems which employed Naive Bayes, Support Vector Machine (SVM) and Decision Tree techniques.
Comparative Analysis of Power System Stabilizer using Artificial Intelligence...ijsrd.com
Power system stabilizers (PSSs) are used to enhance the damping during low frequency oscillations. The paper presents study of power system stabilizer using fuzzy logic and neural network to enhance stability of single machine infinite bus system. In this paper basic problem of conventional power system stabilizer for stability enhancement is defined which is traditionally used. Artificial intelligence techniques provide one alternative for stability enhancement and speed deviation (Δw). The proposed method using Artificial intelligence techniques achieves better improvement than conventional power system stabilizer. Fuzzy logic rules were developed for triangular membership function of input and output variables. Neuro controller is implemented and it is compared with reference model. The system is simulated in SIMULINK environment and the performances of conventional, Fuzzy based and Neural network based power system stabilizers are compared.
Pressure swing adsorption a Cleaner techniques to reduce emissionijsrd.com
Reduction of the absorber size of a medical oxygen concentrator (MOC) employing a generic pressure swing adsorption (PSA) technology is an ongoing research and development activity. The MOC typically produces a 90_93% O2-enriched product gas from ambient air at a rate of e10 L/minute (LPM) for individual use. Adsorbent columns packed with very small adsorbent particles are used to enhance the adsorption kinetics for rapid PSA cycle operation. An experimental mini-PSA set up was used to measure the performance of a simulated Skarstrom-like PSA cycle using a commercial sample of LiX Zeolite as the air separation sorbent
Simulation Study of FIR Filter based on MATLABijsrd.com
First, the rapid design of FIR digital filter was completed by using the Signal Processing Toolbox FDA Tool, the case filter design of a composite signal by filtering, to prove that the content filter designed for filtering. MATLAB and Simulink programs of the filter were used to verify the performance of the filter in MATLAB. Experimental results show that the low-pass filter filters the high frequency component of input signals mixed. Comparison of two types of simulation, the latter method was more convenient quickly, and reduces the workload.
Boiler Efficiency Improvement through Analysis of Lossesijsrd.com
Thermal is the main source for power generation in India. The percentage of thermal power generation as compare to other sources is 65 %. The main objective of thermal power plant is to fulfill the energy demands of the market and to achieve these demands; plant requires technical availability with the parts reliability and maintenance strategy. This paper deals with the determination of current operating efficiency of Boiler and calculates major losses for Vindhyachal Super thermal power plant (India) of 210 MW units. Then identify the causes of performance degradation. Also find the major causes of heat losses by Fault Tree Analysis (FTA) and recommends its appropriate strategy to reduce major losses. The aim of performance monitoring is continuous evaluation of degradation i.e. decrease in performance of the steam boiler. These data enable additional information which is helpful in problem identification, improvement of boiler performance and making economic decisions about maintenance schedule.
Auction Game Theory Based Adaptive Position Update Strategy for Geographic Ro...IJSRD
The Auction game based Adaptive Position Update strategy for geographic routing, which dynamically adjusts the frequency of position updates based on the mobility dynamics of the nodes and the forwarding patterns in the network. Adaptive position update is based on three simple principles: first principle is nodes whose movements are harder to predict update their positions more frequently (and vice versa), then the second principle is nodes closer to forwarding paths update their positions more frequently (and vice versa) and last principle is Forwarding nodes are selected based on distance and residual energy with bidding among the neighbors. Several experimental analyses, which is validated by NS2 simulations of a well-known geographic routing protocol, Greedy Perimeter Stateless Routing Protocol (GPSR), shows that game based Adaptive Position Update strategy for geographic routing can significantly improve the packet delivery ratio and improve the routing performance in terms of throughput in comparison with periodic beaconing and other recently proposed updating schemes. Finally give a better result in throughput and packet delivery ration by incurring a relatively smaller delay in delivering the packets. As the no. of nodes increases, this results in better packet delivery ratio of around 98%. The tradeoff between packet delivery ratio and Routing Over Head is slightly increased, The benefits of our work further confirmed by undertaking evaluations in realistic network scenarios, which account for localization error, realistic radio propagation, and sparse network.
Dvr based hybrid routing protocols in mobile ad-hoc network application and c...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
VARIABLE RANGE ENERGY EFFICIENT LOCATION AIDED ROUTING FOR MANETcscpconf
A Mobile Ad-Hoc Network (MANET) is a temporary, infrastructure-less and distributed network
having mobile nodes. MANET has limited resources like bandwidth and energy. Due to limited
battery power nodes die out early and affect the network lifetime. To make network energy
efficient, we have modified position based Location Aided Routing (LAR1) for energy
conservation in MANET. The proposed protocol is known as Variable Range Energy aware
Location Aided Routing (ELAR1-VAR). The proposed scheme controls the transmission power
of a node according to the distance between the nodes. It also includes energy information on
route request packet and selects the energy efficient path to route data packets. The comparative
analysis of proposed scheme and LAR1 is done by using the QualNet simulator. ELAR1-VAR
protocol improves the network lifetime by reducing energy consumption by 20% for dense and
mobile network while maintaining the packet delivery ratio above 90%.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Geographical routing protocols for mobile ad hoc networks a survey on their ...eSAT Journals
Abstract Mobile Ad Hoc network is an autonomous system of mobile nodes connected by wireless links forming a temporary network without the aid of any centralized administration or infrastructure. Each node operates not only as an end system but also as a router to forward packets. The nodes are free to move themselves into a network. These networks have no fixed topology due to the high degree of node mobility. To accommodate the changing topology, special routing protocols are needed. The goal of the routing protocol is to have an efficient route establishment between a pair of nodes, so that messages can be delivered in a timely manner. Mobile Ad Hoc routing protocols are divided into Flat routing, Hierarchical routing, Geographical routing, Power aware routing and Multicast routing. It is difficult to determine which protocols may perform well under a number of different network scenarios. This paper provides an overview of geographical routing protocols proposed in the literature and performance comparison of geographical routing protocols. Index Terms: Mobile Ad Hoc Network, Geographical Routing protocols.
LOAD BALANCING AND PROVIDING SECURITY USING RSA IN WIRELESS SENSOR NETWORKSIJARIIT
This paper presents load balancing and provides security using RSA algorithm. This is brief introduction to handle the traffic on node. This represents the converge-casting protocol in wireless sensor networks. The protocol is localized and distributed, and adapts efficiently to vary traffic. Graphs are analyzed using NS-2 simulator, here end-to-end packet latency, packet delivery ratio, throughput are analyzed. This is done for 30 nodes in NS-2 simulation.
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.
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.
Efficient Routing Protocol in the Mobile Ad-hoc Network (MANET) by using Gene...IOSR Journals
An Ad hoc network is a collection of wireless mobile hosts forming a temporary network without the
aid of any centralized administration or standard support services. MANET can be defined using unstable
network infrastructure, self-organizing network topology and independent node mobility. This becomes
obtainable due to their routing techniques; in other terms, routing is a backbone for MANET. However, due to
network load routing performance of MANET is degraded thus, some optimization on network routing strategy
is required.
In this paper, we introduce a new technique by using the concept of Genetic algorithm (GA) with
AODV Protocol to make routing decision in computer network.
The goal of this paper is to find the optimal path between the source and destination nodes and increased the
QoS and Throughput. We implemented and compare this a new technique with the traditional AODV, and we
shows that the new technique is better performance than the traditional AODV.
Survey of Reactive Routing Protocols for MANETIOSR Journals
Abstract : A MANET is a collection of mobile nodes by wireless links forming a dynamic topology without any network infrastructure such as routers, servers, access points/cables or centralized administration. The nodes are free to move about and organize themselves into a network. These nodes change position frequently. The main classes of routing protocols are Proactive, Reactive and Hybrid. A Reactive (on-demand) routing strategy is a popular routing category for wireless ad hoc routing. It is a relatively new routing philosophy that provides a scalable solution to relatively large network topologies. The design follows the idea that each node tries to reduce routing overhead by sending routing packets whenever a communication is requested. DSR and AODV are reactive route discovery algorithms where a mobile device of MANET connects by gateway only when it is needed. The performance differentials are analyzed using varying performance metrics. These simulations are carried out using the ns-2 network simulator. Keywords – AODV, DSR, MANET, NS-2, Reactive routing protocols, Survey.
Survey of Reactive Routing Protocols for MANETIOSR Journals
A MANET is a collection of mobile nodes by wireless links forming a dynamic topology without any
network infrastructure such as routers, servers, access points/cables or centralized administration. The nodes
are free to move about and organize themselves into a network. These nodes change position frequently. The
main classes of routing protocols are Proactive, Reactive and Hybrid. A Reactive (on-demand) routing strategy
is a popular routing category for wireless ad hoc routing. It is a relatively new routing philosophy that provides
a scalable solution to relatively large network topologies. The design follows the idea that each node tries to
reduce routing overhead by sending routing packets whenever a communication is requested. DSR and AODV
are reactive route discovery algorithms where a mobile device of MANET connects by gateway only when it is
needed. The performance differentials are analyzed using varying performance metrics. These simulations are
carried out using the ns-2 network simulator
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.
Multipath Fault Tolerant Routing Protocol in MANET pijans
Mobile ad hoc networks (MANETs) consist of a collection of wireless mobile nodes which dynamically
exchange data among themselves without the reliance on a fixed base station or a wired backbone network
and it the makes the routing a crucial issue to the design of the MANET. Multiple path routing protocols
are shown to be performance-effective alternatives over single-path routing for ad hoc networks and it
represents a promising routing method for wireless mobile ad hoc networks. Multi-path routing achieves
load balancing and is more resilient to route failures..In this paper we propose an energy efficient
multipath fault tolerant routing protocol to improve the reliability of data routing in Mobile ad hoc
networks. The proposed RFTA is a multi objective routing protocol that meets diverse application
requirements by considering the changing conditions of the network. The efficiency of the proposed
protocol has been evaluated on different scenarios and there has been a noticeable improvement in the
packet delivery ratio and also in the reduction of end-to-end delay comparing to SMR,SMS and MDSR.
Location and Mobility Optimized On-demand Geographical Multipath Routing Prot...Eswar Publications
The advancement of science and technology had made mobile ad hoc network an important tool to access network of next generation. Recently, numerous multipath routing protocols for mobile ad hoc network are reported in literature. Each routing methods works based on their salient feature, but failed to control congestion, energy efficiency, overhead packets, signal stability during data transmission which leads to edge effect, signal decay and bottleneck situation of the bandwidth consumption. In this paper a novel approach havely Geographical Distance based Ad Hoc On-demand Distance Vector Routing (GD-AOMDV), which selects the path based on transmission distance value to limit and control the congestion and control overheads has been proposed. The salient feature of the proposed model is that it establishes a relationship between path distance and MANET design parameters
including transmission range, consumption of energy and bandwidth. The accuracy of the proposed scheme is
analyzed and validated with the experimental results in respect to various flow using NS2 simulations.
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.
Due to availability of internet and evolution of embedded devices, Internet of things can be useful to contribute in energy domain. The Internet of Things (IoT) will deliver a smarter grid to enable more information and connectivity throughout the infrastructure and to homes. Through the IoT, consumers, manufacturers and utility providers will come across new ways to manage devices and ultimately conserve resources and save money by using smart meters, home gateways, smart plugs and connected appliances. The future smart home, various devices will be able to measure and share their energy consumption, and actively participate in house-wide or building wide energy management systems. This paper discusses the different approaches being taken worldwide to connect the smart grid. Full system solutions can be developed by combining hardware and software to address some of the challenges in building a smarter and more connected smart grid.
A Survey Report on : Security & Challenges in Internet of Thingsijsrd.com
In the era of computing technology, Internet of Things (IoT) devices are now popular in each and every domains like e-governance, e-Health, e-Home, e-Commerce, and e-Trafficking etc. Iot is spreading from small to large applications in all fields like Smart Cities, Smart Grids, Smart Transportation. As on one side IoT provide facilities and services for the society. On the other hand, IoT security is also a crucial issues.IoT security is an area which totally concerned for giving security to connected devices and networks in the IoT .As, IoT is vast area with usability, performance, security, and reliability as a major challenges in it. The growth of the IoT is exponentially increases as driven by market pressures, which proportionally increases the security threats involved in IoT The relationship between the security and billions of devices connecting to the Internet cannot be described with existing mathematical methods. In this paper, we explore the opportunities possible in the IoT with security threats and challenges associated with it.
In today’s emerging world of Internet, each and every thing is supposed to be in connected mode with the help of billions of smart devices. By connecting all the devises used in our day to day life, make our life trouble less and easy. We are incorporated in a world where we are used to have smart phones, smart cars, smart gadgets, smart homes and smart cities. Different institutes and researchers are working for creating a smart world for us but real question which we need to emphasis on is how to make dumb devises talk with uncommon hardware and communication technology. For the same what kind of mechanism to use with various protocols and less human interaction. The purpose is to provide the key area for application of IoT and a platform on which various devices having different mechanism and protocols can communicate with an integrated architecture.
Study on Issues in Managing and Protecting Data of IOTijsrd.com
This paper discusses variety of issues for preserving and managing data produced by IoT. Every second large amount of data are added or updated in the IoT databases across the heterogeneous environment. While managing the data each phase of data processing for IoT data is exigent like storing data, querying, indexing, transaction management and failure handling. We also refer to the problem of data integration and protection as data requires to be fit in single layout and travel securely as they arrive in the pool from diversified sources in different structure. Finally, we confer a standardized pathway to manage and to defend data in consistent manner.
Interactive Technologies for Improving Quality of Education to Build Collabor...ijsrd.com
Today with advancement in Information Communication Technology (ICT) the way the education is being delivered is seeing a paradigm shift from boring classroom lectures to interactive applications such as 2-D and 3-D learning content, animations, live videos, response systems, interactive panels, education games, virtual laboratories and collaborative research (data gathering and analysis) etc. Engineering is emerging with more innovative solutions in the field of education and bringing out their innovative products to improve education delivery. The academic institutes which were once hesitant to use such technology are now looking forward to such innovations. They are adopting the new ways as they are realizing the vast benefits of using such methods and technology. The benefits are better comprehensibility, improved learning efficiency of students, and access to vast knowledge resources, geographical reach, quick feedback, accountability and quality research. This paper focuses on how engineering can leverage the latest technology and build a collaborative learning environment which can then be integrated with the national e-learning grid.
Internet of Things - Paradigm Shift of Future Internet Application for Specia...ijsrd.com
In the world more than 15% people are living with disability that also include children below age of 10 years. Due to lack of independent support services specially abled (handicap) people overly rely on other people for their basic needs, that excludes them from being financially and socially active. The Internet of Things (IoT) can give support system and a better quality of life as well as participation in routine and day to day life. For this purpose, the future solutions for current problems has been introduced in this paper. Daunting challenges have been considered as future research and glimpse of the IoT for specially abled person is given in the paper.
A Study of the Adverse Effects of IoT on Student's Lifeijsrd.com
Internet of things (IoT) is the most powerful invention and if used in the positive direction, internet can prove to be very productive. But, now a days, due to the social networking sites such as Face book, WhatsApp, twitter, hike etc. internet is producing adverse effects on the student life, especially those students studying at college Level. As it is rightly said, something which has some positive effects also has some of the negative effects on the other hand. In this article, we are discussing some adverse effects of IoT on student’s life.
Pedagogy for Effective use of ICT in English Language Learningijsrd.com
The use of information and communications technology (ICT) in education is a relatively new phenomenon and it has been the educational researchers' focus of attention for more than two decades. Educators and researchers examine the challenges of using ICT and think of new ways to integrate ICT into the curriculum. However, there are some barriers for the teachers that prevent them to use ICT in the classroom and develop supporting materials through ICT. The purpose of this study is to examine the high school English teachers’ perceptions of the factors discouraging teachers to use ICT in the classroom.
In recent years usage of private vehicles create urban traffic more and more crowded. As result traffic becomes one of the important problems in big cities in all over the world. Some of the traffic concerns are traffic jam and accidents which have caused a huge waste of time, more fuel consumption and more pollution. Time is very important parameter in routine life. The main problem faced by the people is real time routing. Our solution Virtual Eye will provide the current updates as in the real time scenario of the specific route. This research paper presents smart traffic navigation system, based on Internet of Things, which is featured by low cost, high compatibility, easy to upgrade, to replace traditional traffic management system and the proposed system can improve road traffic tremendously.
Ontological Model of Educational Programs in Computer Science (Bachelor and M...ijsrd.com
In this work there is illustrated an ontological model of educational programs in computer science for bachelor and master degrees in Computer science and for master educational program “Computer science as second competence†by Tempus project PROMIS.
Understanding IoT Management for Smart Refrigeratorijsrd.com
Lately the concept of Internet of Things (IoT) is being more elaborated and devices and databases are proposed thereby to meet the need of an Internet of Things scenario. IoT is being considered to be an integral part of smart house where devices will be connected to each other and also react upon certain environmental input. This will eventually include the home refrigerator, air conditioner, lights, heater and such other home appliances. Therefore, we focus our research on the database part for such an IoT’ fridge which we called as smart Fridge. We describe the potentials achievable through a database for an IoT refrigerator to manage the refrigerator food and also aid the creation of a monthly budget of the house for a family. The paper aims at the data management issue based on a proposed design for an intelligent refrigerator leveraging the sensor technology and the wireless communication technology. The refrigerator which identifies products by reading the barcodes or RFID tags is proposed to order the required products by connecting to the Internet. Thus the goal of this paper is to minimize human interaction to maintain the daily life events.
DESIGN AND ANALYSIS OF DOUBLE WISHBONE SUSPENSION SYSTEM USING FINITE ELEMENT...ijsrd.com
Double wishbone designs allow the engineer to carefully control the motion of the wheel throughout suspension travel. 3-D model of the Lower Wishbone Arm is prepared by using CAD software for modal and stress analysis. The forces and moments are used as the boundary conditions for finite element model of the wishbone arm. By using these boundary conditions static analysis is carried out. Then making the load as a function of time; quasi-static analysis of the wishbone arm is carried out. A finite element based optimization is used to optimize the design of lower wishbone arm. Topology optimization and material optimization techniques are used to optimize lower wishbone arm design.
A Review: Microwave Energy for materials processingijsrd.com
Microwave energy is a latest largest growing technique for material processing. This paper presents a review of microwave technologies used for material processing and its use for industrial applications. Advantages in using microwave energy for processing material include rapid heating, high heating efficiency, heating uniformity and clean energy. The microwave heating has various characteristics and due to which it has been become popular for heating low temperature applications to high temperature applications. In recent years this novel technique has been successfully utilized for the processing of metallic materials. Many researchers have reported microwave energy for sintering, joining and cladding of metallic materials. The aim of this paper is to show the use of microwave energy not only for non-metallic materials but also the metallic materials. The ability to process metals with microwave could assist in the manufacturing of high performance metal parts desired in many industries, for example in automotive and aeronautical industries.
Web Usage Mining: A Survey on User's Navigation Pattern from Web Logsijsrd.com
With an expontial growth of World Wide Web, there are so many information overloaded and it became hard to find out data according to need. Web usage mining is a part of web mining, which deal with automatic discovery of user navigation pattern from web log. This paper presents an overview of web mining and also provide navigation pattern from classification and clustering algorithm for web usage mining. Web usage mining contain three important task namely data preprocessing, pattern discovery and pattern analysis based on discovered pattern. And also contain the comparative study of web mining techniques.
APPLICATION OF STATCOM to IMPROVED DYNAMIC PERFORMANCE OF POWER SYSTEMijsrd.com
Application of FACTS controller called Static Synchronous Compensator STATCOM to improve the performance of power grid with Wind Farms is investigated .The essential feature of the STATCOM is that it has the ability to absorb or inject fastly the reactive power with power grid . Therefore the voltage regulation of the power grid with STATCOM FACTS device is achieved. Moreover restoring the stability of the power system having wind farm after occurring severe disturbance such as faults or wind farm mechanical power variation is obtained with STATCOM controller . The dynamic model of the power system having wind farm controlled by proposed STATCOM is developed . To validate the powerful of the STATCOM FACTS controller, the studied power system is simulated and subjected to different severe disturbances. The results prove the effectiveness of the proposed STATCOM controller in terms of fast damping the power system oscillations and restoring the power system stability.
Making model of dual axis solar tracking with Maximum Power Point Trackingijsrd.com
Now a days solar harvesting is more popular. As the popularity become higher the material quality and solar tracking methods are more improved. There are several factors affecting the solar system. Major influence on solar cell, intensity of source radiation and storage techniques The materials used in solar cell manufacturing limit the efficiency of solar cell. This makes it particularly difficult to make considerable improvements in the performance of the cell, and hence restricts the efficiency of the overall collection process. Therefore, the most attainable maximum power point tracking method of improving the performance of solar power collection is to increase the mean intensity of radiation received from the source used. The purposed of tracking system controls elevation and orientation angles of solar panels such that the panels always maintain perpendicular to the sunlight. The measured variables of our automatic system were compared with those of a fixed angle PV system. As a result of the experiment, the voltage generated by the proposed tracking system has an overall of about 28.11% more than the fixed angle PV system. There are three major approaches for maximizing power extraction in medium and large scale systems. They are sun tracking, maximum power point (MPP) tracking or both.
A REVIEW PAPER ON PERFORMANCE AND EMISSION TEST OF 4 STROKE DIESEL ENGINE USI...ijsrd.com
In day today's relevance, it is mandatory to device the usage of diesel in an economic way. In present scenario, the very low combustion efficiency of CI engine leads to poor performance of engine and produces emission due to incomplete combustion. Study of research papers is focused on the improvement in efficiency of the engine and reduction in emissions by adding ethanol in a diesel with different blends like 5%, 10%, 15%, 20%, 25% and 30% by volume. The performance and emission characteristics of the engine are tested observed using blended fuels and comparative assessment is done with the performance and emission characteristics of engine using pure diesel.
Study and Review on Various Current Comparatorsijsrd.com
This paper presents study and review on various current comparators. It also describes low voltage current comparator using flipped voltage follower (FVF) to obtain the single supply voltage. This circuit has short propagation delay and occupies a small chip area as compare to other current comparators. The results of this circuit has obtained using PSpice simulator for 0.18 μm CMOS technology and a comparison has been performed with its non FVF counterpart to contrast its effectiveness, simplicity, compactness and low power consumption.
Reducing Silicon Real Estate and Switching Activity Using Low Power Test Patt...ijsrd.com
Power dissipation is a challenging problem for today's system-on-chip design and test. This paper presents a novel architecture which generates the test patterns with reduced switching activities; it has the advantage of low test power and low hardware overhead. The proposed LP-TPG (test pattern generator) structure consists of modified low power linear feedback shift register (LP-LFSR), m-bit counter, gray counter, NOR-gate structure and XOR-array. The seed generated from LP-LFSR is EXCLUSIVE-OR ed with the data generated from gray code generator. The XOR result of the sequence is single input changing (SIC) sequence, in turn reduces the switching activity and so power dissipation will be very less. The proposed architecture is simulated using Modelsim and synthesized using Xilinx ISE9.2.The Xilinx chip scope tool will be used to test the logic running on FPGA.
Defending Reactive Jammers in WSN using a Trigger Identification Service.ijsrd.com
In the last decade, the greatest threat to the wireless sensor network has been Reactive Jamming Attack because it is difficult to be disclosed and defend as well as due to its mass destruction to legitimate sensor communications. As discussed above about the Reactive Jammers Nodes, a new scheme to deactivate them efficiently is by identifying all trigger nodes, where transmissions invoke the jammer nodes, which has been proposed and developed. Due to this identification mechanism, many existing reactive jamming defending schemes can be benefited. This Trigger Identification can also work as an application layer .In this paper, on one side we provide the several optimization problems to provide complete trigger identification service framework for unreliable wireless sensor networks and on the other side we also provide an improved algorithm with regard to two sophisticated jamming models, in order to enhance its robustness for various network scenarios.
Overview of the fundamental roles in Hydropower generation and the components involved in wider Electrical Engineering.
This paper presents the design and construction of hydroelectric dams from the hydrologist’s survey of the valley before construction, all aspects and involved disciplines, fluid dynamics, structural engineering, generation and mains frequency regulation to the very transmission of power through the network in the United Kingdom.
Author: Robbie Edward Sayers
Collaborators and co editors: Charlie Sims and Connor Healey.
(C) 2024 Robbie E. Sayers
Cosmetic shop management system project report.pdfKamal Acharya
Buying new cosmetic products is difficult. It can even be scary for those who have sensitive skin and are prone to skin trouble. The information needed to alleviate this problem is on the back of each product, but it's thought to interpret those ingredient lists unless you have a background in chemistry.
Instead of buying and hoping for the best, we can use data science to help us predict which products may be good fits for us. It includes various function programs to do the above mentioned tasks.
Data file handling has been effectively used in the program.
The automated cosmetic shop management system should deal with the automation of general workflow and administration process of the shop. The main processes of the system focus on customer's request where the system is able to search the most appropriate products and deliver it to the customers. It should help the employees to quickly identify the list of cosmetic product that have reached the minimum quantity and also keep a track of expired date for each cosmetic product. It should help the employees to find the rack number in which the product is placed.It is also Faster and more efficient way.
Student information management system project report ii.pdfKamal Acharya
Our project explains about the student management. This project mainly explains the various actions related to student details. This project shows some ease in adding, editing and deleting the student details. It also provides a less time consuming process for viewing, adding, editing and deleting the marks of the students.
Industrial Training at Shahjalal Fertilizer Company Limited (SFCL)MdTanvirMahtab2
This presentation is about the working procedure of Shahjalal Fertilizer Company Limited (SFCL). A Govt. owned Company of Bangladesh Chemical Industries Corporation under Ministry of Industries.
CFD Simulation of By-pass Flow in a HRSG module by R&R Consult.pptxR&R Consult
CFD analysis is incredibly effective at solving mysteries and improving the performance of complex systems!
Here's a great example: At a large natural gas-fired power plant, where they use waste heat to generate steam and energy, they were puzzled that their boiler wasn't producing as much steam as expected.
R&R and Tetra Engineering Group Inc. were asked to solve the issue with reduced steam production.
An inspection had shown that a significant amount of hot flue gas was bypassing the boiler tubes, where the heat was supposed to be transferred.
R&R Consult conducted a CFD analysis, which revealed that 6.3% of the flue gas was bypassing the boiler tubes without transferring heat. The analysis also showed that the flue gas was instead being directed along the sides of the boiler and between the modules that were supposed to capture the heat. This was the cause of the reduced performance.
Based on our results, Tetra Engineering installed covering plates to reduce the bypass flow. This improved the boiler's performance and increased electricity production.
It is always satisfying when we can help solve complex challenges like this. Do your systems also need a check-up or optimization? Give us a call!
Work done in cooperation with James Malloy and David Moelling from Tetra Engineering.
More examples of our work https://www.r-r-consult.dk/en/cases-en/
Fundamentals of Electric Drives and its applications.pptx
Integrated Resource Adaptive On Demand Geographic Routing (IRA-ODGR) for MANET
1. IJSRD - International Journal for Scientific Research & Development| Vol. 1, Issue 6, 2013 | ISSN (online): 2321-0613
All rights reserved by www.ijsrd.com 1282
Abstract— It is a big challenge to develop routing protocol
that can meet different application needs and optimize
routing paths according to the topology change in mobile ad
hoc networks. The existing work presented two self-
adaptive on-demand geographic routing schemes to build
efficient paths based on the needs of user applications and
adapt to various scenarios for provide efficient and reliable
routing. To overcome the impact due to inaccurate local
topology knowledge, the topology information is updated at
a node in the specific time periods. The on-demand routing
mechanism reduces to control overhead made on geographic
routing. The route optimization scheme adapts routing path
according to the topology changes and actual data traffic
requirements. Adaptive parameter setting scheme is
introduced to allow each node to determine and adjust the
protocol parameter values independently. However, existing
work did not address resource parameters such as energy,
bandwidth and data loss. The proposal presents and
Integrated Resource Adaptive on Demand Geographic
Routing (IRA-ODGR) for MANET. The node energy
resource is optimized with path energy consumption rate
and bandwidth utilization of the path is analysed. Loss rate
is reduced in geographic routing with dynamic routes. The
simulation conducted to demonstrate IRA-ODGR routing
protocols.
Keywords: Routing protocols, wireless communication, ad
hoc networks, geographic route, adaptive, on-demand, and
topology.
I. INTRODUCTION
A mobile ad-hoc network (MANET) is a self-configuring
infrastructure less network of mobile devices connected by
wireless. Ad hoc is Latin and means "for this purpose". Each
device in a MANET is free to move independently in any
direction, and will therefore change its links to other devices
frequently. Each must forward traffic unrelated to its own
use, and therefore be a router. The primary challenge in
building a MANET is equipping each device to
continuously maintain the information required to properly
route traffic. Such networks may operate by themselves or
may be connected to the larger Internet. MANETs are a kind
of wireless ad hoc networks that usually has a routable
networking environment on top of a Link Layer ad hoc
network.
It is challenging to develop robust routing protocol for
dynamic Mobile Ad Hoc Networks (MANET). Geographic
routing protocols are generally more scalable and reliable
than conventional topology-based routing protocols with
their forwarding decisions based on the local topology.
Geographic routing assumes mobile nodes are aware of their
own positions through certain positioning system (e.g.,
GPS), and a source can obtain the destination’s position
through some kind of location service However, inaccurate
local topology knowledge and the out-dated destination
position information can lead to inefficient geographic
forwarding and even routing failure. Proactive local position
distribution can hardly adapt to the traffic demand. It is also
difficult to pre-set protocol parameters correctly to fit in
different environments. We have developed two self-
adaptive on-demand geographic routing schemes.
The local topology is updated in a timely manner according
to network dynamics and traffic demands. Our route
optimization scheme adapts the routing path according to
both topology changes and actual data traffic requirements.
Each node can determine and adjust the protocol parameter
values independently according to different network
environments, data traffic conditions and node's own
requirements. The integrated Resource Adaptive On
Demand Geographic Routing is the efficient communication
in dynamic MANET topologies. The optimization of on
demand geographic routing is done based on measured
values of node energy at various time intervals. The node
energy level varies for different traffic load conditions that
keep update the energy levels of the intermediary node in
the selected path between source and destination (S-D).
Another resource is the data loss occurrence on the path
during routing and data forwarding. Geographic routing path
are analysed for the transmission throughput it based on
which path allocation is done for the S-D pairs in network.
Fig 1: Mobile Ad hoc Network
Integrated Resource Adaptive On Demand
Geographic Routing (IRA-ODGR) for MANET
M J.Kalaiselvi1
K.Sathishkumar2
1
M.E. Student, CSE 2
Assistant Professor, M.E., (Ph.D.)
1,2
PGP College of Engineering and Technology, Namakkal
2. Integrated Resource Adaptive On Demand Geographic Routing (IRA-ODGR) for MANET
(IJSRD/Vol. 1/Issue 6/2013/003)
All rights reserved by www.ijsrd.com 1283
II. LITERATURE SURVEY
The multiple directional cover sets (MDCS) problem of
organizing the directions of sensors into a group of non-
disjoint cover sets to extend the network lifetime. One cover
set in which the directions cover all the targets is activated at
one time. MDCS-Greedy is not based on the optimization
problem, which has much shorter runtime. Finally, a
distributed algorithm called MDCS-Dist is presented [1].
The inherent locality of our scheme makes it fault tolerant
both to node failure and to network partitions. When the
network partitions, nodes within a connected component can
locate each other because the location service is also
collocated with them within the component. As for node
failures, when some node containing location information
fails, there is sufficient redundancy at incrementally
increasing distances in the network to transparently make up
for it [2].
CBF improves position-based forwarding in five important
aspects: first, removing the beacons eliminates a major part
of routing overhead which occurs independently of actual
data traffic. Second, the nodes do not have to store
neighbour tables, reducing their individual resource usage.
Third, the neighbour tables may be inconsistent, in
particular if the beacon interval is long, if beacons are lost,
or if nodes change their positions very frequently.
Inconsistent neighbour tables can lead, among other things,
to the following problem: when a neighbour is selected for
forwarding it may already have moved out of transmission
range [3]. This work suggests an approach to utilize location
information (for instance, obtained using the global
positioning system) to improve performance of routing
protocols for ad hoc networks [4].
Supporting scalable and efficient routing and service
provision in Mobile Ad Hoc Networks (MANET) has been a
big research challenge. Conventional topology-based unicast
and multicast protocols are normally hard to scale due to the
big overhead in their routing schemes. Supported by these
routing protocols, conventional service discovery schemes
also have limited scalability and efficiency [5]. Structure-
Aware Self-Adaptive sensor system, SASA, aims to address
the challenges and provide a feasible framework for
underground monitoring in coal mines. The design
objectives of SASA include: (1) to rapidly detect the
collapse area and report to the sink node; (2) to maintain the
system integrity when the sensor network structure is
altered; and (3) provide a sound and robust mechanism for
efficiently handling queries over the sensor network under
unstable circumstances [6].
The work describes the first distributed algorithms for
routing that do not require duplication of packets or memory
at the nodes and yet guarantee that a packet is delivered to
its destination. These algorithms can be extended to yield
algorithms for broadcasting and geocaching that do not
require packet duplication [7]. GPSR makes greedy
forwarding decisions using only information about a router’s
immediate neighbours in the network topology. When a
packet reaches a region where greedy forwarding is
impossible, the algorithm recovers by routing around the
perimeter of the region [8]. Routing algebra system
investigates the compatibilities between routing metrics and
three geographic routing protocols including greedy, face
and combined-greedy face routing. Four important algebraic
properties, respectively named odd symmetry, transitivity,
source independence and local minimum freeness, are
defined in this algebra system [9].
Geographic Routing (GR) algorithms require nodes to
periodically transmit HELLO messages to allow neighbors
know their positions (beaconing mechanism). To reduce the
control overhead due to theses messages, beacon-less
routing algorithms have recently been proposed. However,
existing beacon-less algorithms have not considered realistic
physical layers. Therefore, those algorithms can not work
properly in realistic scenarios [10].
The phases involved in the proposed schemes are
1 MANET On Demand Routing
2 Self-Adaptive Geographic Routing
3 Optimization and Route Adaption
4 Energy and Bandwidth Routing
5 Resource Adaptive On Demand Routing
A. MANET On Demand Routing
The on demand routing only create and maintain the routes
on demand and topology of MANET is dynamic. On
demand protocols is used to network-range or restricted-
range flooding for route discovery that maintenance limits
the scalability that need of search for an end-to-end path
prior to the packet transmission incurs large transmission
delay. It needs to support long-term and continuous traffic.
Data traffic is sporadic that nodes are involved in long
period of services with only occasional data exchanges for
collaboration or upon events.
B. Self-Adaptive Geographic Routing
Each and every mobile node is aware of its own position
through GPS or in-door localization technique. The source
obtains the destination’s position through location service. It
makes use of broadcast feature of wireless network to
improve routing performance and mobile nodes enable
promiscuous mode on network interfaces. It provides
transmission paths based on the need of applications and to
reduce control overhead. Routing path is built and position
information is distributed on traffic demand. Flexible
position distribution mechanism forwarding nodes are
notified of topology change in a timely manner and more
efficient routing is achieved. Optimization schemes are
designed to make routing paths adaptive to the change of
topology and traffic. Robust to position inaccuracy routing
scheme handle destination position inaccuracy. Each and
every node can set and adapt protocol parameters
independently based on environment change and its own
condition.
C. Optimization and Route Adaption
Route optimization adapts the path according to topology
change and traffic conditions. The validity of cached
topology information is evaluated before packet forwarding
to avoid forwarding failure due to out-dated neighbour
information. Routing path is optimized with cooperation of
the forwarding node and its neighbours. To avoid non-
optimal routing due to the inaccuracy in topology
knowledge and validity estimation of next hop after the
route searching phase. Current best next hop is cached for a
period when there is no significant topology change and
3. Integrated Resource Adaptive On Demand Geographic Routing (IRA-ODGR) for MANET
(IJSRD/Vol. 1/Issue 6/2013/003)
All rights reserved by www.ijsrd.com 1284
reduce the delay and control overhead for route searching.
Optimization for forwarding path is local topology change
that cached next hop may no longer be the best one towards
destination. To achieve more optimal routing the neighbours
monitor whether forwarding path makes correct forwarding
decisions that improve transmission path opportunistically.
D. Energy and Bandwidth Routing
Intermediate node in the routing path is kept update of its
energy drain rate based on traffic load variation and node
energy drain rate changes according to application demand.
Intermediate node in the routing path is kept update of its
energy drain rate. Path is generalized to accommodate the
data transmission bandwidth capacity. Node mobility affects
the resource capability of the network path. Dynamic
network characteristic have influence of bandwidth
availability to the nodes in the route path. The bandwidth
consumption resource is optimized with path energy
consumption rate. Power resource required to locate node
position is measured with localized node batteries of the
path.
E. Resource Adaptive On Demand Routing
The resource adaption is made for on demand geographic
routing that data loss occurrence on the path during routing
and data forwarding are measured. To minimize the loss
with adaptive resource usage across the network throughput
of on demand routing is calculated to know the data delivery
rate on the adaptive routing path. Transmission Geographic
routing path are analysed for the transmission throughput
that path allocated for respective S-D pairs are resource
minimized. Resources constrained are sorted out with path
of less resource usage on specific time period.
III. EXPERIMENTAL RESULTS AND CONCLUSION
In this section we evaluate performance of integrated
resource adaptive geographic Routing for Dynamic Ad hoc
Networks through NS2 simulation. One of the major
contributions of this work is the designing routing protocols
based on the Integrated Resource Adaptive on Demand
Geographic Routing. To confirm the analytical results, we
implemented Integrated Resource Adaptive on Demand
Geographic Routing in the network simulator ns-2 and
evaluated the performance of services.
Mobility
Rates
Existing Holistic
Geographic
Routing Schemes
Proposed Integrated
Resource Adaptive On
Demand Geographic
Routing
2 500 865
4 430 790
6 360 643
8 240 510
10 100 460
Table 1: Node Energy
In order to construct performance evaluations, we have
simulated Integrated Resource Adaptive on Demand
Geographic Routing using the NS2 simulator which
simulates several integrated resource adaptive on MANET.
The performance of Integrated Resource Adaptive on
Demand Geographic Routing is evaluated by the following
Metrics.
1 Node Energy
2 Path Bandwidth
3 Path Loss Rate
Mobility
Rates
Existing Holistic
Geographic
Routing Schemes
Proposed Integrated
Resource Adaptive On
Demand Geographic
Routing
2 500 865
4 430 790
6 360 643
8 240 510
10 100 460
Table 1: Node Energy
Fig. 2: Node Energy
Figure 2 demonstrates the node energy. X axis represents
mobility rates whereas Y axis denotes the node energy using
both the existing Holistic Geographic Routing Schemes and
proposed Integrated Resource Adaptive on Demand
Geographic Routing. When the rate of mobility increased
node energy gets decreased. All the curves show a more of
less yet steady descendant when mobility rates increases.
Figure 2 shows better energy for node of Integrated
Resource Adaptive on Demand Geographic Routing.
Integrated Resource Adaptive on Demand Geographic
Routing achieves 20% to 40% more node energy result.
Node
Density
Existing
Holistic
Geographic
Routing
Schemes
Proposed Integrated
Resource Adaptive On
Demand Geographic
Routing
10 60 20
20 100 40
30 120 60
40 160 80
50 200 100
Table 2: Path Bandwidth
4. Integrated Resource Adaptive On Demand Geographic Routing (IRA-ODGR) for MANET
(IJSRD/Vol. 1/Issue 6/2013/003)
All rights reserved by www.ijsrd.com 1285
Fig 3: Path Bandwidth
Figure 3 demonstrates the path bandwidth. X axis represents
node density whereas Y axis denotes the path bandwidth
using both the existing Holistic Geographic Routing
Schemes and proposed Integrated Resource Adaptive on
Demand Geographic Routing.
When the node density increased path bandwidth also gets
increased. Figure 3 shows the effectiveness of path
bandwidth over different node density than existing Holistic
Geographic Routing Schemes and proposed Integrated
Resource Adaptive on Demand Geographic Routing.
Integrated Resource Adaptive on Demand Geographic
Routing achieves 30% to 45% less path bandwidth when
compared with existing schemes.
Node
Density
Existing
Holistic
Geographic
Routing
Schemes
Proposed Integrated
Resource Adaptive On
Demand Geographic
Routing
10 3.5 1.8
20 4.7 2.4
30 5.6 3.9
40 6.1 4.1
50 7.8 5.5
Table 3: Path Loss Rate
Fig 4: Path Loss Rate
Figure 4 describes the path loss rate. X axis represents the
node density whereas Y axis denotes the path loss rate using
both the Holistic Geographic Routing Schemes and
proposed Integrated Resource Adaptive on Demand
Geographic Routing. When the node density increased, path
loss rate also gets increases accordingly. The rate of path
loss is illustrated using the existing Holistic Geographic
Routing Schemes and proposed Integrated Resource
Adaptive on Demand Geographic Routing. Figure 4 shows
better performance of Proposed Integrated Resource
Adaptive on Demand Geographic Routing in terms of path
loss than existing Holistic Geographic Routing Schemes and
proposed Integrated Resource Adaptive on Demand
Geographic Routing. Integrated Resource Adaptive on
Demand Geographic Routing achieves 50 to 65% less path
loss rate variation when compared with existing system.
IV. CONCLUSION
The focus of this paper is to design adaptive geographic
routing protocols to achieve higher performance in a mobile
ad hoc network and meet the need of various applications
which may have different traffic patterns. The neighbour
detection is based on measured control message strength
among neighbours and hence considers the impact of
channel fading. The Integrated Resource Adaptive On
Demand Geographic Routing is implemented for efficient
communication in dynamic MANET topologies. Loss rate is
reduced in geographic routing with dynamic routes and
minimal bandwidth consumption. Increased throughput on
the geographic routing of dynamic traffic condition and
network life time.
REFERENCES
[1] Yanli Cai, Wei Lou, Minglu Li, Xiang-Yang Li.
Energy Efficient Target-Oriented Scheduling in
Directional Sensor Networks. IEEE Trans. on
Computers, 58(9), Page(s):1259 - 1274, Sept. 2009.
[2] I. Abraham, D. Dolev and D. Malkhi. LLS: a locality
aware location service for mobile ad hoc
networks. In Workshop on Discrete Algothrithms
and Methods for MOBILE Computing and
Communications (DialM), 2004.
[3] H. Fussler, J. Widmer, M. Kasemann, M. Mauve and
H. Hartenstein. Beaconless position-based routing for
mobile ad-hoc networks. Tech. Rep.TR-03-001, Dept.
Math. and Comp. Science, Unive. Mannheim,
Germany, 2003.
[4] Y. Ko and N. Vaidya. Location-aided routing (LAR)
in mobile ad hoc networks. In Wireless Networks,
Judy 2000.
[5] X. Xiang and X. Wang. A Scalable Geographic
Service Provision Framework for Mobile Ad Hoc
Networks. In IEEE International Conference on
Pervasive Computing and Communications, White
Plains, New York, March 2007.
[6] M. Li and Y. Liu. Underground Coal Mine
Monitoring with Wireless Sensor Networks. In ACM
Transactions on Sensor Networks, Volume 5 Issue 2,
March 2009.
[7] P. Bose, P. Morin, I. Stojmenovic and J. Urrutia.
Routing with guaranteed delivery in ad hoc wireless
5. Integrated Resource Adaptive On Demand Geographic Routing (IRA-ODGR) for MANET
(IJSRD/Vol. 1/Issue 6/2013/003)
All rights reserved by www.ijsrd.com 1286
networks. In Wireless Networks, Springer
Netherlands, Volume 7, Number 6, pages: 1572-8196
Nov. 2001.
[8] B. Karp and H. T. Kung. Greedy perimeter stateless
routing for wireless networks. In Proceedings of the
ACM/IEEE International Conference on Mobile
Computing and Networking (MOBICOM), pages
243–254, August 2000.
[9] Y. Li, Y. Yang, and X. Lu, Routing Metric Designs
for Greedy, Face and Combined-Greedy-Face
Routing. Proc. IEEE INFOCOM 09, Page(s):64 -
72, Apr. 2009.
[10] J. A. Sanchez, R. Marin-Perez, and P. M. Ruiz,
BOSS: Beacon-less on demand strategy for
geographic routing in wireless sensor networks. The
4th Internatonal Conference on Mo