This document summarizes a research paper that proposes a scalable and power-efficient routing solution for mobile ad hoc networks (MANETs). The paper describes a cluster-based MANET architecture and develops a graph theoretic routing algorithm that finds paths from source to destination nodes using routes with minimum cumulative degree. Simulation results show that the algorithm provides efficient routing paths even as the number of nodes increases, and uses multi-hop connectivity to transmit packets using minimum power irrespective of the number of nodes in the network. The algorithm is shown to be scalable and power efficient compared to other routing methods.
A novel routing technique for mobile ad hoc networks (manet)ijngnjournal
Actual network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable and efficient. Each routing protocol should support small as well as large
scale networks very efficiently. As the number of node increase, it increases the management functionality
of the network. Graph theoretic approach traditionally was applied to networks where nodes are static or
fixed. In this paper, we have applied the graph theoretic routing to MANET where nodes are mobile. Here,
we designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Each cluster supports a few nodes with a cluster head. The intracluster
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. 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-toend.
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. We also showed the total
number of required intermediate nodes in the transmission from source to destination. 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. Our simulation results show that
the proposed graph theoretic routing approach will reduce the overall delay and improves the physical
layer data frame transmission.
Adaptive QoS Multicast Routing with Mobility Prediction in MANETs ijasuc
A Mobile Ad hoc NETwork (MANET) is a collection of wireless mobile hosts that form a temporary network
without a centralized administration or wired infrastructure. Due to the high mobility of nodes, the network
topology of MANETs changes very fast, making it more difficult to find the routes that message packets use.
Network control with Quality of Service (QoS) support is a key issue for multimedia applications in MANET.
Most of the real time applications have stringent requirements on bandwidth, delay, delay-jitter, packet loss
ratio, cost and other QoS metrics. This paper proposes a Multi-constrained QoS routing with mobility
prediction protocol. If the node has enough resources to transmit data packets, it uses the Global
Positioning System (GPS) to get the location information of the mobile nodes and selects the routing path
with the maximum Route Expiration Time (RET). A set of static and mobile agents are used to find the
multicast routes and transmit the packets. Extensive simulations have been conducted to evaluate the
performance of MC_MAODV using Network Simulator (NS-2). The simulation results show that the
proposed protocol achieves good performance in terms of improving packet delivery ratio and minimizing
end-to-end delay.
A QUALITY OF SERVICE ARCHITECTURE FOR RESOURCE PROVISIONING AND RATE CONTROL ...ijasuc
Prioritized flow control is a type of QoS provisioning in which each class is provided a different QoS by
assigning priority to one class over another in terms of allocating resources. It is an effective means to
provide service differentiation to different class of service in mobile ad hoc networks. So the objective is to
achieve a desired level of service to high-priority flows so that the wireless medium is completely utilized
using adaptive rate control. In this paper, we propose to design QoS architecture for Bandwidth
Management and Rate Control in MANET. Our proposed QoS architecture contains an adaptive
bandwidth management technique which measures the available bandwidth at each node in real-time and
it is then propagated on demand by the QoS routing protocol. The source nodes perform call admission
control for different priority of flows based on the bandwidth information provided by the QoS routing.
The network bandwidth utilization is monitored continuously and network congestion is detected in
advance. Then a rate control mechanism is used to regulate best-effort traffic.
A 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.
Quadrant Based DIR in CWin Adaptation Mechanism for Multihop Wireless NetworkIJCI JOURNAL
In Multihop Wireless Networks, traffic forwarding capability of each node varies according to its level of contention. Each node can yield its channel access opportunity to its neighbouring nodes, so that all the nodes can evenly share the channel and have similar forwarding capability. In this manner the wireless channel is utilized effectively, which is achieved using Contention Window Adaptation Mechanism (CWAM). This mechanism achieves a higher end-to-end throughout but consumes the network power to a higher level. So, a newly proposed algorithm Quadrant- Based Directional Routing Protocol (Q-DIR) is implemented as a cross-layer with CWAM, to reduce the total network power consumption through limited flooding and also reduce the routing overheads, which eventually increases overall network throughput. This algorithm limits the broadcast region to a quadrant where the source node and the destination nodes are located. Implementation of the algorithm is done in Linux based NS-2 simulator
EFFICIENT PACKET DELIVERY APPROACH FOR ADHOC WIRELESS NETWORKS cscpconf
A wireless ad-hoc network is a collection of nodes which are selfconfiguring,
connected by wireless links. The nodes are free to move randomly and
organize themselves arbitrarily; thus, the network's topology may change rapidly and
unpredictably. These kinds of networks are very flexible and they do not require any
existing infrastructure. Therefore, ad-hoc wireless networks are suitable for temporary
communication links. The biggest challenge in these kinds of networks is to find a path
between the communication end points of nodes that are mobile. Due to the limited
transmission range of wireless interfaces, the communication traffic has to be relayed
over several intermediate nodes to enable the communication between two nodes.
Therefore, these kinds of networks are also called multi-hop ad-hoc networks. The
proposed model is designed to improve the problems of real-time event-based
communication. It improves the packet delivery ratio by prior prediction and reduces
end-to-end packet delay. This in turn improves performance of the routing process
significantly and increases the Quality of Service (QoS).
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.
A novel routing technique for mobile ad hoc networks (manet)ijngnjournal
Actual network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable and efficient. Each routing protocol should support small as well as large
scale networks very efficiently. As the number of node increase, it increases the management functionality
of the network. Graph theoretic approach traditionally was applied to networks where nodes are static or
fixed. In this paper, we have applied the graph theoretic routing to MANET where nodes are mobile. Here,
we designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Each cluster supports a few nodes with a cluster head. The intracluster
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. 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-toend.
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. We also showed the total
number of required intermediate nodes in the transmission from source to destination. 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. Our simulation results show that
the proposed graph theoretic routing approach will reduce the overall delay and improves the physical
layer data frame transmission.
Adaptive QoS Multicast Routing with Mobility Prediction in MANETs ijasuc
A Mobile Ad hoc NETwork (MANET) is a collection of wireless mobile hosts that form a temporary network
without a centralized administration or wired infrastructure. Due to the high mobility of nodes, the network
topology of MANETs changes very fast, making it more difficult to find the routes that message packets use.
Network control with Quality of Service (QoS) support is a key issue for multimedia applications in MANET.
Most of the real time applications have stringent requirements on bandwidth, delay, delay-jitter, packet loss
ratio, cost and other QoS metrics. This paper proposes a Multi-constrained QoS routing with mobility
prediction protocol. If the node has enough resources to transmit data packets, it uses the Global
Positioning System (GPS) to get the location information of the mobile nodes and selects the routing path
with the maximum Route Expiration Time (RET). A set of static and mobile agents are used to find the
multicast routes and transmit the packets. Extensive simulations have been conducted to evaluate the
performance of MC_MAODV using Network Simulator (NS-2). The simulation results show that the
proposed protocol achieves good performance in terms of improving packet delivery ratio and minimizing
end-to-end delay.
A QUALITY OF SERVICE ARCHITECTURE FOR RESOURCE PROVISIONING AND RATE CONTROL ...ijasuc
Prioritized flow control is a type of QoS provisioning in which each class is provided a different QoS by
assigning priority to one class over another in terms of allocating resources. It is an effective means to
provide service differentiation to different class of service in mobile ad hoc networks. So the objective is to
achieve a desired level of service to high-priority flows so that the wireless medium is completely utilized
using adaptive rate control. In this paper, we propose to design QoS architecture for Bandwidth
Management and Rate Control in MANET. Our proposed QoS architecture contains an adaptive
bandwidth management technique which measures the available bandwidth at each node in real-time and
it is then propagated on demand by the QoS routing protocol. The source nodes perform call admission
control for different priority of flows based on the bandwidth information provided by the QoS routing.
The network bandwidth utilization is monitored continuously and network congestion is detected in
advance. Then a rate control mechanism is used to regulate best-effort traffic.
A 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.
Quadrant Based DIR in CWin Adaptation Mechanism for Multihop Wireless NetworkIJCI JOURNAL
In Multihop Wireless Networks, traffic forwarding capability of each node varies according to its level of contention. Each node can yield its channel access opportunity to its neighbouring nodes, so that all the nodes can evenly share the channel and have similar forwarding capability. In this manner the wireless channel is utilized effectively, which is achieved using Contention Window Adaptation Mechanism (CWAM). This mechanism achieves a higher end-to-end throughout but consumes the network power to a higher level. So, a newly proposed algorithm Quadrant- Based Directional Routing Protocol (Q-DIR) is implemented as a cross-layer with CWAM, to reduce the total network power consumption through limited flooding and also reduce the routing overheads, which eventually increases overall network throughput. This algorithm limits the broadcast region to a quadrant where the source node and the destination nodes are located. Implementation of the algorithm is done in Linux based NS-2 simulator
EFFICIENT PACKET DELIVERY APPROACH FOR ADHOC WIRELESS NETWORKS cscpconf
A wireless ad-hoc network is a collection of nodes which are selfconfiguring,
connected by wireless links. The nodes are free to move randomly and
organize themselves arbitrarily; thus, the network's topology may change rapidly and
unpredictably. These kinds of networks are very flexible and they do not require any
existing infrastructure. Therefore, ad-hoc wireless networks are suitable for temporary
communication links. The biggest challenge in these kinds of networks is to find a path
between the communication end points of nodes that are mobile. Due to the limited
transmission range of wireless interfaces, the communication traffic has to be relayed
over several intermediate nodes to enable the communication between two nodes.
Therefore, these kinds of networks are also called multi-hop ad-hoc networks. The
proposed model is designed to improve the problems of real-time event-based
communication. It improves the packet delivery ratio by prior prediction and reduces
end-to-end packet delay. This in turn improves performance of the routing process
significantly and increases the Quality of Service (QoS).
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.
Rough set based QoS enabled multipath source routing in MANET IJECEIAES
The single constrained Quality of Service (QoS) routing in Mobile Ad-hoc NETwork (MANET) is disastrous in consideration of MANET characteristics, inference, collision and link failure as it maintains a single path. The QoS enabled routing yields better packet delivery and maintains consistency among nodes in the network by incorporating multi-constrained and multipath routing. The Dynamic Source Routing (DSR) is best suited source routing algorithm to maintain multipath information at the source node, but performance degrades with larger number of mobile nodes. Multilayer mechanism should be incorporated to maintain QoS metric information spreads across multiple layers of TCP/IP protocol stack. The proposed multipath QoS enabled source routing provides balanced routing by making use of all these features. The imprecise decision making strategy called Rough Set Theory (RST) is used at destination node for decision making. The Route REQuest (RREQ) messages coming from different routes are filtered by considering the QoS metrics of each and every route by making use of RST. The Route REPly (RREP) messages are generated and delivered to the source node for filtered RREQ messages. The proposed routing algorithm will reduce load on the network by reducing number of control messages exchanged for route establishment. This will evenly distribute load among all the nodes and it also avoid the scenarios like few nodes starved for resources. Finally, multipath routing always provides alternate routing option in case of route failure.
EEDTCA: Energy Efficient, Reduced Delay and Minimum Distributed Topology Cont...Editor IJCATR
Processing packets across Mobile Ad hoc Network, Topology control minimize interference among node in a network, increase the network capacity and extend lifetime of the network. Emerging research in mobile ad hoc networks (MANETs) says, there is a growing requirement of quality of service (QoS) in terms of delay. In order to resolve the delay problem, it is essential to consider topology control in delay constrained environment with energy efficient. In this paper, we discuss reduced delay and minimum distributed topology control algorithm for mobile ad hoc networks. In this proposed system, we study on the delay-constrained topology control problem, and take into account delay and energy efficiency. Simulation results are presented demonstrating the effectiveness of this new technique as compared to other approaches to topology control.
EEDTCA: Energy Efficient, Reduced Delay and Minimum Distributed Topology Cont...Editor IJCATR
Processing packets across Mobile Ad hoc Network, Topology control minimize interference among node in a network, increase the network capacity and extend lifetime of the network. Emerging research in mobile ad hoc networks (MANETs) says, there is a growing requirement of quality of service (QoS) in terms of delay. In order to resolve the delay problem, it is essential to consider topology control in delay constrained environment with energy efficient. In this paper, we discuss reduced delay and minimum distributed topology control algorithm for mobile ad hoc networks. In this proposed system, we study on the delay-constrained topology control problem, and take into account delay and energy efficiency. Simulation results are presented demonstrating the effectiveness of this new technique as compared to other approaches to topology control.
21 9149 simulation analysis for consistent path identification edit septianIAESIJEECS
As the demand for Mobile Ad hoc Network (MANET) applications grows, so does their use of many essential services where node consistent and stability of the communication paths are of great importance. In this scheme, we propose Simulation Analysis for Consistent Path Identification to Refine the Network Lifetime (CPIR). This technique offers more stable path and transmits the data through the consistent nodes. This article is focused on protecting the route from the inconsistent node in mobile communications to improve the network performance and reduce the energy consumption in the network. The simulation results demonstrate that CPIR provided reduce the energy utilization and improved both the longer lifetimes and increased number of packets delivered.
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT On the real time hardware implementa...IEEEGLOBALSOFTTECHNOLOGIES
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09849539085, 09966235788 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2Rijujournal
In multi-radio wireless mesh networks, one node is eligible to transmit packets over multiple channels to different destination nodes simultaneously. This feature of multi-radio wireless mesh network makes high throughput for the network and increase the chance for multi path routing. This is because the multiple channel availability for transmission decreases the probability of the most elegant problem called as interference problem which is either of interflow and intraflow type. For avoiding the problem like interference and maintaining the constant network performance or increasing the performance the WMN need to consider the packet aggregation and packet forwarding. Packet aggregation is process of collecting several packets ready for transmission and sending them to the intended recipient through the channel, while the packet forwarding holds the hop-by-hop routing. But choosing the correct path among different available multiple paths is most the important factor in the both case for a routing algorithm. Hence the most challenging factor is to determine a forwarding strategy which will provide the schedule for each node for transmission within the channel. In this research work we have tried to implement two forwarding strategies for the multi path multi radio WMN as the approximate solution for the above said problem. We have implemented Global State Routing (GSR) which will consider the packet forwarding concept and Aggregation Aware Layer 2 Routing (AAL2R) which considers the both concept i.e. both packet forwarding and packet aggregation. After the successful implementation the network performance has been measured by means of simulation study.
Qo s oriented distributed routing protocols : anna university 2nd review pptAAKASH S
To find a QoS path between source and destination, Which satisfies
The QoS requirements for each admitted connection and
Optimizes the use of network resources
Quality encompasses the data loss, latency, jitter, efficient use of network resources,..
QoS mechanisms for unfairness: managing queuing behavior, shaping traffic, control admission, routing, …
Usually, a hybrid network has widespread base stations
The data transmission in hybrid networks has two features:
An AP can be a source or a destination to any mobile node
It allows a stream to have anycast transmission along multiple transmission paths to its destination through base stations
The number of transmission hops between a mobile node and an AP is small
It enables a source node to connect to an AP through an intermediate node
In this paper introduce the QoS-Oriented Distributed routing protocol(QOD)
This QOD protocol makes five contributions:
QoS-guaranteed neighbor selection algorithm
Distributed packet scheduling algorithm
Mobility-based segment resizing algorithm
Soft-deadline based forwarding scheduling algorithm
Data redundancy elimination based transmission
MULTICASTING BASED ENHANCED PROACTIVE SOURCE ROUTING IN MANETSIJCNCJournal
Mobile Ad-hoc Network (MANET) is an accumulation of movable nodes organizing a irregular topology without centralized administration. In a MANET, multicasting is a significant technique for utilizing data communication system. Multicasting based enhanced proactive source routing is proposed in this paper for Mobile Ad hoc Networks. It explains an innovative multicasting algorithm that considers the transmission energy and residual energy while forwarding the data packets. It improves the network throughput and raises the network lifetimes. Simulation analysis is carried in this proposed system and this method shows improved performance over the existing system.
AN EFFECTIVE CONTROL OF HELLO PROCESS FOR ROUTING PROTOCOL IN MANETSIJCNCJournal
In the mobile ad hoc network (MANET) update of link connectivity is necessary to refresh the neighbor tables in data transfer. A existing hello process periodically exchanges the link connectivity information, which is not adequate for dynamic topology. Here, slow update of neighbour table entries causes link failures which affect performance parameter as packet drop, maximum delay, energy consumption, and reduced throughput. In the dynamic hello technique, new neighbour nodes and lost neighbour nodes are used to compute link change rate (LCR) and hello-interval/refresh rate (r). Exchange of link connectivity information at a fast rate consumes unnecessary bandwidth and energy. In MANET resource wastage can be controlled by avoiding the re-route discovery, frequent error notification, and local repair in the entire network. We are enhancing the existing hello process, which shows significant improvement in performance.
Efficient and stable route selection by using cross layer concept for highly...Roopali Singh
Efficient and stable route selection by using cross layer concept for highly mobile network with predictive features by Rupali Singh, Gajendra Singh Dhakad
published in International Journal of Research & Technology, Volume 3, Issue 4_November_2015
The maximization of a networks lifetime is an important part of research in the present scenario. In ad hoc network, the topology of network changes frequently due to the mobility of mobile nodes where the communication is possible without any network infrastructure. Mobile nodes have limited energy resources so that the energy efficient routing should be provided which increases the life time of the network. The existing routing mechanisms do not consider energy of nodes for data transmission. In this paper a novel approach is analyzed to improve the networks lifetime where the data transfer is based on the minimum hop count and residual energy of the mobile nodes. The analysis is carried out by using the network simulator and the simulation results shows that the proposed work provides an energy efficient routing in ad hoc networks.
A NOVEL HYBRID OPPORTUNISTIC SCALABLE ENERGY EFFICIENT ROUTING DESIGN FOR LOW...IJCNCJournal
Opportunistic Routing (OR) scheme increases the transmission reliability despite the lossy wireless radio links by exploiting the broadcast nature of the wireless medium. However, OR schemes in low power Wireless Sensor Network (WSN) leads to energy drain in constrained sensor nodes due to constant
overhearing, periodic beaconing for Neighbourhood Management (NM) and increase in packet header length to append priority wise sorted Forwarding Candidates Set (FCS) prior to data transmission. The timer-based coordination mechanism incurs the least overhead to coordinate among the FCS that has successfully received the data packet for relaying the data in a multi-hop manner. This timer-based mechanism suffers from duplicate transmissions if the FCS is either not carefully selected or coordinated. The focus of this work is to propose a hybrid opportunistic energy efficient routing design for large scale, low power and lossy WSN. This design avoids periodic 'hello' beacons for NM, limits constant overhearing and increase in packet header length. There are two modes of operation i) opportunistic ii) unicast mode. The sender node adopts opportunistic forwarding for its initial data packet transmission and instead of pre-computing the FCS, it is dynamically computed in a completely distributed manner. The
eligible nodes to be part of FCS will be neighbour nodes at lower corona level than the sender with respect to the sink and remaining energy above the minimum threshold. The nodes part of FCS based on crosslayered multi-metrics and fuzzy decision logic determines its priority level to compute Dynamic Holding
Delay (DHD) for effective timer coordination. The differentiated back off implementation along with DHD enables the higher priority candidate that had received data packet to forward the packet first and facilitates others to cancel its timer upon overhearing. The sender node switches to unicast mode of
forwarding for successive transmissions by choosing the forwarding node with maximum trust value as it
denotes the stability of the temporally varying link with respect to the forwarder. The sender node will revert to opportunistic mode to increase transmission reliability in case of link-level transmission error or no trustworthy forwarders. Simulation results in NS2 show significant increase in Packet Delivery Ratio (PDR),decrease in both average energy consumption per node and Normalized Energy Consumption (NEC) per packet in comparison with existing protocols.
Wireless Sensor Network Using Six Sigma Multi Hop RoutingIOSR Journals
The most significant problem in the design of wireless sensor networks is to coordinate the sensors
with dynamism into a wireless communication network and route sensed data to the base station. The energy
efficiency is the most important key point of the network routing designing. This paper presents the efficient
multi hop routing algorithm to extend the lifetime of sensor networks and focuses by employing six sigma
principles to obtain the Quality of Service. To attain QoS support, we have to find either a route to assure the
application requirements or offering network response to the application when the requirements cannot be met.
Link Prediction And Link Establishment Based On Network Nodes Life Time In Mo...inventionjournals
In this paper we propose a new modified adhoc routing algorithm for adhoc network that locally repairs a link failure and also conflicts the noise and link modification simultaneously. Due to topology changes caused by nodes’ mobility in adhoc network, the link routes get disconnected frequently. Our proposed scheme does a local repair of link failure and also takes care of malicious nodes with the help of a reliability measure while performing route discovery using link-prediction routing algorithm(LPRA). These two performance metrics are integrated by Route link-prediction algorithm. This algorithm is carried out as follows, Select the least dynamic route link with the longest lifetime for persistent data forwarding. Node Lifetime and link lifetime prediction methods. The receiver can measure the signal strength when it receives the packets from sender in same power level and then it calculates the distance between two nodes by applying the radio propagation model in LPRA using adhoc network. Simulation results show that our proposed schemeperforms better in comparison to a popular existing technique
How has trust between people changed and how does it affect human social patterns? Juan Cartagena looks examines the future impact in our society when networks of trust get leveraged.
Presented at Crowdsourcing Week Global 2016. Learn more and join the next event: www.crowdsourcingweek.com
Mobile devices, specifically smartphones, have become ubiquitous. For this reason, businesses are starting
to develop “Bring Your Own Device” policies to allow their employees to use their owned devices in the
workplace. BYOD offers many potential advantages: enhanced productivity, increased revenues, reduced
mobile costs and IT efficiencies. However, due to emerging attacks and limitations on device resources, it is
difficult to trust these devices with access to critical proprietary information. Therefore, in this paper, the
potential attacks of BYOD and taxonomy of BYOD attacks are presented. Advanced persistent threat (APT)
and malware attack are discussed in depth in this paper. Next, the proposed solution to mitigate the attacks
of BYOD is discussed. Lastly, the evaluations of the proposed solutions based on the X.800 security
architecture are presented.
Opportunistic use of the 2.63.5 ghz band for broadband services in the west a...ijmnct
Wireless technology is increasing rapidly, and the vision of pervasive wireless computing and
communications offers the promise of many societal and individual benefits. While consumer devices such
as cell phones, PDAs and laptops receive a lot of attention, the impact of wireless technology is much
broader, e.g., through sensor networks for safety applications and home automation, smart grid control,
medical wearable and embedded wireless devices, and entertainment systems. One of these wireless
technologies is the Worldwide Interoperability for Microwave Access (WiMAX) technology. The explosion
of wireless applications in some parts of the world has created an ever-increasing demand for more radio
spectrum. This is not the case in the West African Sub-Region, especially Ghana where the 2.6GHz and
3.5GHz broadband access bands offering 190MHz and 140MHz bandwidth is underutilized. In this paper,
we look at usage of deployed 4G-WiMAX network in Ghana and advocate the need for policy to promote
the usage of licensed bands opportunistically by wireless devices and/or networks for application in
security, smart grid control, e-learning, telemedicine, e-governance, home and factory automation
At this present scenario, the demand of the system capacity is very high in wireless network. MIMO
technology is used from the last decade to provide this requirement for wireless network antenna
technology. MIMO channels are mostly used for advanced antenna array technology. But it is most
important to control the error rate with enhanced system capacity in MIMO for present-day progressive
wireless communication. This paper explores the frame error rate with respect to different path gain of
MIMO channel. This work has been done in different fading scenario and produces a comparative analysis
of MIMO on the basis of those fading models in various conditions. Here, it is to be considered that
modulation technique as QPSK to observe these comparative evaluations for different Doppler frequencies.
From the comparative analysis, minimum amount of frame error rate is viewed for Rician distribution at
LOS path Doppler shift of 0 Hz. At last, this work is concluded with a comparative bit error rate study on
the basis of singular parameters at different SNR levels to produce the system performance for uncoded
QPSK modulation.
Rough set based QoS enabled multipath source routing in MANET IJECEIAES
The single constrained Quality of Service (QoS) routing in Mobile Ad-hoc NETwork (MANET) is disastrous in consideration of MANET characteristics, inference, collision and link failure as it maintains a single path. The QoS enabled routing yields better packet delivery and maintains consistency among nodes in the network by incorporating multi-constrained and multipath routing. The Dynamic Source Routing (DSR) is best suited source routing algorithm to maintain multipath information at the source node, but performance degrades with larger number of mobile nodes. Multilayer mechanism should be incorporated to maintain QoS metric information spreads across multiple layers of TCP/IP protocol stack. The proposed multipath QoS enabled source routing provides balanced routing by making use of all these features. The imprecise decision making strategy called Rough Set Theory (RST) is used at destination node for decision making. The Route REQuest (RREQ) messages coming from different routes are filtered by considering the QoS metrics of each and every route by making use of RST. The Route REPly (RREP) messages are generated and delivered to the source node for filtered RREQ messages. The proposed routing algorithm will reduce load on the network by reducing number of control messages exchanged for route establishment. This will evenly distribute load among all the nodes and it also avoid the scenarios like few nodes starved for resources. Finally, multipath routing always provides alternate routing option in case of route failure.
EEDTCA: Energy Efficient, Reduced Delay and Minimum Distributed Topology Cont...Editor IJCATR
Processing packets across Mobile Ad hoc Network, Topology control minimize interference among node in a network, increase the network capacity and extend lifetime of the network. Emerging research in mobile ad hoc networks (MANETs) says, there is a growing requirement of quality of service (QoS) in terms of delay. In order to resolve the delay problem, it is essential to consider topology control in delay constrained environment with energy efficient. In this paper, we discuss reduced delay and minimum distributed topology control algorithm for mobile ad hoc networks. In this proposed system, we study on the delay-constrained topology control problem, and take into account delay and energy efficiency. Simulation results are presented demonstrating the effectiveness of this new technique as compared to other approaches to topology control.
EEDTCA: Energy Efficient, Reduced Delay and Minimum Distributed Topology Cont...Editor IJCATR
Processing packets across Mobile Ad hoc Network, Topology control minimize interference among node in a network, increase the network capacity and extend lifetime of the network. Emerging research in mobile ad hoc networks (MANETs) says, there is a growing requirement of quality of service (QoS) in terms of delay. In order to resolve the delay problem, it is essential to consider topology control in delay constrained environment with energy efficient. In this paper, we discuss reduced delay and minimum distributed topology control algorithm for mobile ad hoc networks. In this proposed system, we study on the delay-constrained topology control problem, and take into account delay and energy efficiency. Simulation results are presented demonstrating the effectiveness of this new technique as compared to other approaches to topology control.
21 9149 simulation analysis for consistent path identification edit septianIAESIJEECS
As the demand for Mobile Ad hoc Network (MANET) applications grows, so does their use of many essential services where node consistent and stability of the communication paths are of great importance. In this scheme, we propose Simulation Analysis for Consistent Path Identification to Refine the Network Lifetime (CPIR). This technique offers more stable path and transmits the data through the consistent nodes. This article is focused on protecting the route from the inconsistent node in mobile communications to improve the network performance and reduce the energy consumption in the network. The simulation results demonstrate that CPIR provided reduce the energy utilization and improved both the longer lifetimes and increased number of packets delivered.
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT On the real time hardware implementa...IEEEGLOBALSOFTTECHNOLOGIES
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09849539085, 09966235788 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2Rijujournal
In multi-radio wireless mesh networks, one node is eligible to transmit packets over multiple channels to different destination nodes simultaneously. This feature of multi-radio wireless mesh network makes high throughput for the network and increase the chance for multi path routing. This is because the multiple channel availability for transmission decreases the probability of the most elegant problem called as interference problem which is either of interflow and intraflow type. For avoiding the problem like interference and maintaining the constant network performance or increasing the performance the WMN need to consider the packet aggregation and packet forwarding. Packet aggregation is process of collecting several packets ready for transmission and sending them to the intended recipient through the channel, while the packet forwarding holds the hop-by-hop routing. But choosing the correct path among different available multiple paths is most the important factor in the both case for a routing algorithm. Hence the most challenging factor is to determine a forwarding strategy which will provide the schedule for each node for transmission within the channel. In this research work we have tried to implement two forwarding strategies for the multi path multi radio WMN as the approximate solution for the above said problem. We have implemented Global State Routing (GSR) which will consider the packet forwarding concept and Aggregation Aware Layer 2 Routing (AAL2R) which considers the both concept i.e. both packet forwarding and packet aggregation. After the successful implementation the network performance has been measured by means of simulation study.
Qo s oriented distributed routing protocols : anna university 2nd review pptAAKASH S
To find a QoS path between source and destination, Which satisfies
The QoS requirements for each admitted connection and
Optimizes the use of network resources
Quality encompasses the data loss, latency, jitter, efficient use of network resources,..
QoS mechanisms for unfairness: managing queuing behavior, shaping traffic, control admission, routing, …
Usually, a hybrid network has widespread base stations
The data transmission in hybrid networks has two features:
An AP can be a source or a destination to any mobile node
It allows a stream to have anycast transmission along multiple transmission paths to its destination through base stations
The number of transmission hops between a mobile node and an AP is small
It enables a source node to connect to an AP through an intermediate node
In this paper introduce the QoS-Oriented Distributed routing protocol(QOD)
This QOD protocol makes five contributions:
QoS-guaranteed neighbor selection algorithm
Distributed packet scheduling algorithm
Mobility-based segment resizing algorithm
Soft-deadline based forwarding scheduling algorithm
Data redundancy elimination based transmission
MULTICASTING BASED ENHANCED PROACTIVE SOURCE ROUTING IN MANETSIJCNCJournal
Mobile Ad-hoc Network (MANET) is an accumulation of movable nodes organizing a irregular topology without centralized administration. In a MANET, multicasting is a significant technique for utilizing data communication system. Multicasting based enhanced proactive source routing is proposed in this paper for Mobile Ad hoc Networks. It explains an innovative multicasting algorithm that considers the transmission energy and residual energy while forwarding the data packets. It improves the network throughput and raises the network lifetimes. Simulation analysis is carried in this proposed system and this method shows improved performance over the existing system.
AN EFFECTIVE CONTROL OF HELLO PROCESS FOR ROUTING PROTOCOL IN MANETSIJCNCJournal
In the mobile ad hoc network (MANET) update of link connectivity is necessary to refresh the neighbor tables in data transfer. A existing hello process periodically exchanges the link connectivity information, which is not adequate for dynamic topology. Here, slow update of neighbour table entries causes link failures which affect performance parameter as packet drop, maximum delay, energy consumption, and reduced throughput. In the dynamic hello technique, new neighbour nodes and lost neighbour nodes are used to compute link change rate (LCR) and hello-interval/refresh rate (r). Exchange of link connectivity information at a fast rate consumes unnecessary bandwidth and energy. In MANET resource wastage can be controlled by avoiding the re-route discovery, frequent error notification, and local repair in the entire network. We are enhancing the existing hello process, which shows significant improvement in performance.
Efficient and stable route selection by using cross layer concept for highly...Roopali Singh
Efficient and stable route selection by using cross layer concept for highly mobile network with predictive features by Rupali Singh, Gajendra Singh Dhakad
published in International Journal of Research & Technology, Volume 3, Issue 4_November_2015
The maximization of a networks lifetime is an important part of research in the present scenario. In ad hoc network, the topology of network changes frequently due to the mobility of mobile nodes where the communication is possible without any network infrastructure. Mobile nodes have limited energy resources so that the energy efficient routing should be provided which increases the life time of the network. The existing routing mechanisms do not consider energy of nodes for data transmission. In this paper a novel approach is analyzed to improve the networks lifetime where the data transfer is based on the minimum hop count and residual energy of the mobile nodes. The analysis is carried out by using the network simulator and the simulation results shows that the proposed work provides an energy efficient routing in ad hoc networks.
A NOVEL HYBRID OPPORTUNISTIC SCALABLE ENERGY EFFICIENT ROUTING DESIGN FOR LOW...IJCNCJournal
Opportunistic Routing (OR) scheme increases the transmission reliability despite the lossy wireless radio links by exploiting the broadcast nature of the wireless medium. However, OR schemes in low power Wireless Sensor Network (WSN) leads to energy drain in constrained sensor nodes due to constant
overhearing, periodic beaconing for Neighbourhood Management (NM) and increase in packet header length to append priority wise sorted Forwarding Candidates Set (FCS) prior to data transmission. The timer-based coordination mechanism incurs the least overhead to coordinate among the FCS that has successfully received the data packet for relaying the data in a multi-hop manner. This timer-based mechanism suffers from duplicate transmissions if the FCS is either not carefully selected or coordinated. The focus of this work is to propose a hybrid opportunistic energy efficient routing design for large scale, low power and lossy WSN. This design avoids periodic 'hello' beacons for NM, limits constant overhearing and increase in packet header length. There are two modes of operation i) opportunistic ii) unicast mode. The sender node adopts opportunistic forwarding for its initial data packet transmission and instead of pre-computing the FCS, it is dynamically computed in a completely distributed manner. The
eligible nodes to be part of FCS will be neighbour nodes at lower corona level than the sender with respect to the sink and remaining energy above the minimum threshold. The nodes part of FCS based on crosslayered multi-metrics and fuzzy decision logic determines its priority level to compute Dynamic Holding
Delay (DHD) for effective timer coordination. The differentiated back off implementation along with DHD enables the higher priority candidate that had received data packet to forward the packet first and facilitates others to cancel its timer upon overhearing. The sender node switches to unicast mode of
forwarding for successive transmissions by choosing the forwarding node with maximum trust value as it
denotes the stability of the temporally varying link with respect to the forwarder. The sender node will revert to opportunistic mode to increase transmission reliability in case of link-level transmission error or no trustworthy forwarders. Simulation results in NS2 show significant increase in Packet Delivery Ratio (PDR),decrease in both average energy consumption per node and Normalized Energy Consumption (NEC) per packet in comparison with existing protocols.
Wireless Sensor Network Using Six Sigma Multi Hop RoutingIOSR Journals
The most significant problem in the design of wireless sensor networks is to coordinate the sensors
with dynamism into a wireless communication network and route sensed data to the base station. The energy
efficiency is the most important key point of the network routing designing. This paper presents the efficient
multi hop routing algorithm to extend the lifetime of sensor networks and focuses by employing six sigma
principles to obtain the Quality of Service. To attain QoS support, we have to find either a route to assure the
application requirements or offering network response to the application when the requirements cannot be met.
Link Prediction And Link Establishment Based On Network Nodes Life Time In Mo...inventionjournals
In this paper we propose a new modified adhoc routing algorithm for adhoc network that locally repairs a link failure and also conflicts the noise and link modification simultaneously. Due to topology changes caused by nodes’ mobility in adhoc network, the link routes get disconnected frequently. Our proposed scheme does a local repair of link failure and also takes care of malicious nodes with the help of a reliability measure while performing route discovery using link-prediction routing algorithm(LPRA). These two performance metrics are integrated by Route link-prediction algorithm. This algorithm is carried out as follows, Select the least dynamic route link with the longest lifetime for persistent data forwarding. Node Lifetime and link lifetime prediction methods. The receiver can measure the signal strength when it receives the packets from sender in same power level and then it calculates the distance between two nodes by applying the radio propagation model in LPRA using adhoc network. Simulation results show that our proposed schemeperforms better in comparison to a popular existing technique
How has trust between people changed and how does it affect human social patterns? Juan Cartagena looks examines the future impact in our society when networks of trust get leveraged.
Presented at Crowdsourcing Week Global 2016. Learn more and join the next event: www.crowdsourcingweek.com
Mobile devices, specifically smartphones, have become ubiquitous. For this reason, businesses are starting
to develop “Bring Your Own Device” policies to allow their employees to use their owned devices in the
workplace. BYOD offers many potential advantages: enhanced productivity, increased revenues, reduced
mobile costs and IT efficiencies. However, due to emerging attacks and limitations on device resources, it is
difficult to trust these devices with access to critical proprietary information. Therefore, in this paper, the
potential attacks of BYOD and taxonomy of BYOD attacks are presented. Advanced persistent threat (APT)
and malware attack are discussed in depth in this paper. Next, the proposed solution to mitigate the attacks
of BYOD is discussed. Lastly, the evaluations of the proposed solutions based on the X.800 security
architecture are presented.
Opportunistic use of the 2.63.5 ghz band for broadband services in the west a...ijmnct
Wireless technology is increasing rapidly, and the vision of pervasive wireless computing and
communications offers the promise of many societal and individual benefits. While consumer devices such
as cell phones, PDAs and laptops receive a lot of attention, the impact of wireless technology is much
broader, e.g., through sensor networks for safety applications and home automation, smart grid control,
medical wearable and embedded wireless devices, and entertainment systems. One of these wireless
technologies is the Worldwide Interoperability for Microwave Access (WiMAX) technology. The explosion
of wireless applications in some parts of the world has created an ever-increasing demand for more radio
spectrum. This is not the case in the West African Sub-Region, especially Ghana where the 2.6GHz and
3.5GHz broadband access bands offering 190MHz and 140MHz bandwidth is underutilized. In this paper,
we look at usage of deployed 4G-WiMAX network in Ghana and advocate the need for policy to promote
the usage of licensed bands opportunistically by wireless devices and/or networks for application in
security, smart grid control, e-learning, telemedicine, e-governance, home and factory automation
At this present scenario, the demand of the system capacity is very high in wireless network. MIMO
technology is used from the last decade to provide this requirement for wireless network antenna
technology. MIMO channels are mostly used for advanced antenna array technology. But it is most
important to control the error rate with enhanced system capacity in MIMO for present-day progressive
wireless communication. This paper explores the frame error rate with respect to different path gain of
MIMO channel. This work has been done in different fading scenario and produces a comparative analysis
of MIMO on the basis of those fading models in various conditions. Here, it is to be considered that
modulation technique as QPSK to observe these comparative evaluations for different Doppler frequencies.
From the comparative analysis, minimum amount of frame error rate is viewed for Rician distribution at
LOS path Doppler shift of 0 Hz. At last, this work is concluded with a comparative bit error rate study on
the basis of singular parameters at different SNR levels to produce the system performance for uncoded
QPSK modulation.
Transmit antenna subset selection in mimo ofdm system using adaptive mutuatio...ijmnct
Multiple input multiple output techniques are considered attractive for future wireless communication
systems, due to the continuing demand for high data rates, spectral efficiency, suppress interference ability
and robustness of transmission. MIMO-OFDM is very helpful to transmit high data rate in wireless
transmission and provides good maximum system capacity by getting the advantages of both MIMO and
OFDM. The main problem in this system is that increase in number of transmit and receive antennas lead
to hardware complexity. To tackle this issue, an effective optimal transmit antenna subset selection method
is proposed in paper with the aid of Adaptive Mutation Genetic Algorithm (AGA). Here, the selection of
transmit antenna subsets are done by the adaptive mutation of Genetic Algorithm in MIMO-OFDM system.
For all the mutation points, the fitness function are evaluated and from that value, best fitness based
mutation points are chosen. After the selection of best mutation points, the mutation process is carried out,
accordingly. The implementation of proposed work is done in the working platform MATLAB and the
performance are evaluated with various selection of transmit antenna subsets. Moreover, the comparison
results between the existing GA with mutation and the proposed GA with adaptive mutation are discussed.
Hence, using the proposed work, the selection of transmit antenna with the maximum capacity is made and
which leads to the reduced hardware complexity and undisturbed data rate in the MIMO-OFDM system
In this paper, Space Time Block Code (STBC), Spatial Multiplexing (SM) and hybrid model with OFDM
are designed for Rayleigh fading channel. Combination of SM and STBC forms hybrid MIMO model. The
performances of the above mentioned models with different modulations such as Quadrature Phase Shift
Keying (QPSK) and Quadrature Amplitude Modulation (QAM) with multiple antennas are measured with
respect to BER. In this paper, it is shown that Hybrid MIMO provides low BER. Thus, in wireless
communication, hybrid model improves the data rate and link reliability.
Secured transmission through multi layer perceptron in wireless communication...ijmnct
In this paper, a multilayer perceptron guided encryption/decryption (STMLP) in wireless communication
has been proposed for exchange of data/information. Multilayer perceptron transmitting systems at both
ends generate an identical output bit and the network are trained based on the output which is used to
synchronize the network at both ends and thus forms a secret-key at end of synchronizations of the
networks. Weights or hidden units of the hidden layer help to form a secret session key. The plain text is
encrypted through chaining , cascaded xoring of multilayer perceptron generated session key. If size of the
final block of plain text is less than the size of the key then this block is kept unaltered. Receiver will use
identical multilayer perceptron generated session key for performing deciphering process for getting the
plain text. Parametric tests have been done and results are compared in terms of Chi-Square test, response
time in transmission with some existing classical techniques, which shows comparable results for the
proposed technique. Variation numbers of input vectors and hidden layers will increase the confusion
/diffusion of the schemeand hence increase the security. As a result variable energy based techniques may
be achieved which may be applicable devices/interface of the heterogeneous sizes of the network/device.
1- Mobile ad hoc networks are formed dynamically by an
autonomous system of mobile nodes that are connected
via wireless links.
2- Multihop communication- node communicate with the
help of two or more node from source to destination.
3- No existing fixed infrastructure or centralized administration –No base station.
4- Mobile nodes are free to move randomly-Network topology changes frequently
5- May Operate as standalone fashion or also can be connected to the larger internet.
6- Each node work as router
Primary Goals of Security in MANET
To assure a reliable data transfer over the communication networks and to protect the system resources a number of security services are classified in five categories:-
1-Authentication:- The process of identifying an individual , usually based on a username and password.
2- Confidentially:- Confidentiality aims at protecting the data from disclosure to unauthorized person.
Network attacks against confidentiality
* Packet capturing
Password attack
Port scanning
Dumpster Diving
Wiretapping
Phishing and Pharming
2-Non repudiation:- Integrity guarantees that a message being transferred is never corrupted.
3- Integrity:- Integrity guarantees that a message being transferred is never corrupted.
network attack against integrity
Salami attack
trust relationship attacks
Man in the middle attack
Session hijacking attacks
4- Availability:- Its ensure that data ,network resources or network services are available to legitimate user when required.
network attack against availability
Denial of services attacks
Distributed denial of services attack
SYN flood attacks and ICMP flood attacks
Electrical power attacks
Server Room environment attacks
Key management
The security in networking is in many cases dependent on proper key management.
Key management consists of various services, of which each is vital for the security
of the networking systems
* Trust model:-Its must determine how much different element in the network can trust each other.
* Cryptosystem:- Public and symmetric key mechanism can be applied .
* Key creation:- It must determine which parties are allowed to generate key to themselves.
* Key storage :- In adhoc network any network element may have to store its own key and possibly key of other element as well.
* Key distribution:- The key management service must ensure that the generated keys are securely distributed to their owners.
Energy Saving DSR and Probabilistic Rebroadcast Mechanism are used to Increas...IJTET Journal
Abstract- MANETs are infrastructure less and can be set up anytime anywhere. Due to high mobility of nodes in mobile ad hoc networks (MANETs), there exist frequent link breakages which lead to frequent path failures and route discoveries. The overhead of a route discovery cannot be neglected. In a route discovery, broadcasting is a fundamental and effective data broadcasting mechanism, where a mobile node blindly rebroadcasts the first received route request packets unless it has a route to the destination, and thus it causes the broadcast storm problem and without consider the nodes energy level of route selection it leads to reduce the network lifetime. In this paper proposed to focus is on a two mechanism ESDSR and Neighbor coverage based Probabilistic rebroadcast to overcome those problems. A Energy Saving Dynamic Source Routing in MANETs (ESDSR) which will efficiently utilize the battery power consideration in the route selection time of mobile nodes in such a way that the network will get more life time and Neighbor coverage based Probabilistic rebroadcast mechanism, which can significantly decrease the number of retransmissions so as to reduce the routing overhead, and can also improve the routing performance. The simulation was carried out using the NS-2 network simulator.
Energy Consumption in Ad Hoc Network With Agents Minimizing the Number of Hop...CSCJournals
Wireless mobile ad-hoc network (MANET) is a special kind of network, where all of the nodes move in time. Node is intended to help relaying packets of neighboring nodes using multi-hop routing mechanism in order to solve problem of dead communication. MANET which engages broadcasting and contains multiple hops becomes increasingly vulnerable to problems such as mobile node’s energy degradation, routing problem and rapid increasing of overhead packets. This paper provides an extensive study of energy consumption in the MANET that consists of several network areas with the presence agents. Agents will minimize number of hops and its affect in linearity with the delay. As nodes grow, either in data transmission services or coverage of node’s communication or more agents stand in overlapped locations, accordingly data exchange and topology development to adapt the network are becoming an important issue. As a result, agents are needed to support process automation, high-level connectivity and intelligent service on that such environment. We evaluate the agents’ performance and network energy consumption for supporting MANET. The proposed agents provides service packets transmission between networks; e.g. determine appropriate relay nodes dynamically, maintain the transmission between networks through another nodes, share the topology knowledge among agents, and route packets between source and final destination that are unable to communicate directly. The achievement on research with this approach is conducted via simulation study. A similar network without agents is presented to derive such referential bounds by using appropriate functions of network agents. The proposed algorithm is confirmed with composite simulation results.
M-EPAR to Improve the Quality of the MANETsIJERA Editor
In MANET, power aware is important challenge issue to improve the communication energy efficiency at individual nodes. We propose modified efficient power aware routing (M-EPAR), a new power aware routing protocol that increases the network lifetime of MANET. Designing a power aware routing algorithm or technique is one of the most important point considered in Mobile Ad Hoc Networks. These nodes are driven by reactive protocols where broadcasting is mandatory to form a path between two nodes. So in case of death of the node resulting out of less battery calls for re-routing. Since many existing techniques focuses on energy aware routing this paper presents combination of energy aware routing merged with link quality determined by packet drop rate. The proposed scheme has outperformed the existing technique in terms of packet delivery ratio, throughput and energy consumption.
ENERGY LOCATION AWARE ROUTING PROTOCOL (ELARP) FOR WIRELESS MULTIMEDIA SENSOR...ijcsit
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding
environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in
volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks
(WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end
delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover
multipath and sending data via these different paths improve the bandwidth and decrease the end to end
delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive
multipath routing protocol establishing three paths with awareness of node’s residual energy and distance.
ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for
multimedia data in terms of end to end delay and packet delivery ratio.
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks (WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover multipath and sending data via these different paths improve the bandwidth and decrease the end to end delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive multipath routing protocol establishing three paths with awareness of node’s residual energy and distance. ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for multimedia data in terms of end to end delay and packet delivery ratio.
The present paper describes a novel Raspberry Pi and Arduino UNO architecture used as a meteorological station. One of the advantages of the proposed architecture is the huge quantity of sensors developed for its usage; practically one can find them for any application, and weather sensing is not an exception. The principle followed is to configure Raspberry as a collector for measures obtained from Arduino, transmitting occurs via USB; meanwhile, Raspberry broadcasts them via a web page. For such activity is possible thanks to Raspbian, a Linux-based operating system. It has a lot of libraries and resources available, among them Apache Web Server, that gives the possibility to host a web-page. On it, the user can observe temperature, humidity, solar radiance, and wind speed and direction. Information on the web-page is refreshed each five minute; however, measurements arrive at Raspberry every ten seconds. This low refreshment rate was determined because weather variables normally do not abruptly change. As an additional feature, system stores all information on the log file, this gives the possibility for future analysis and processing.
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks (WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end delay. Multipath routing is to discover multipath during route discovery from source to sink. Discover multipath and sending data via these different paths improve the bandwidth and decrease the end to end delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive multipath routing protocol establishing three paths with awareness of node’s residual energy and distance. ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for multimedia data in terms of end to end delay and packet delivery ratio.
Cross layer design for power control and linkIJCNCJournal
Frequent changes in network topology due to mobility and limited battery power of the mobile devices are the key challenges in the adhoc networks. The depletion of power source may cause early unavailability of nodes and thus links in the network. The mobility of nodes causes frequent routes breaks and adversely affects the required performance of the applications. We propose a cross layer design for the dynamic power control protocol and link prediction (DPCPLP) that provides a combined solution for power conservation as well as link availability. This combines the effect of optimum transmit power and received signal strength based link availability estimation with AODV routing protocol using cross layer approach.
This method proposes to use optimum transmit power for transmitting the packets to a neighboring node to
increase the battery life of adhoc nodes and received signal strength based link prediction to increase the
availability of the links. In this paper, the transmit power and received signal strength of the packets are
cross-layer interaction parameters to provide the combined solution for power conservation and reliable
route formation with increased availability of links and thus the routes amongst sources and destinations. Further, this increases network and nodes’ lifetime and capacity. It improves throughput and packet delivery ratio by spatial reuse, prior prediction of link breaks and initiating the route repair. It also reduces
end-to-end delay and power consumption by use of optimum transmit power. Through simulations, we have
shown that our proposed protocol shows better performance.
Wireless Sensor Networks (WSNs)have sensor nodes that sense and extract information from surrounding environment, processing information locally then transmit it to sink wirelessly. Multimedia data is larger in volume than scalar data, thus transmitting multimedia data via Wireless Multimedia Sensor Networks (WMSNs) requires stick constraints on quality of services in terms of energy, throughput and end to end delay.Multipath routing is to discover multipath during route discovery from source to sink. Discover multipath and sending data via these different paths improve the bandwidth and decrease the end to end delay. This paper introduces an Energy Location Aware Routing Protocol (ELARP) which is reactive multipath routing protocol establishing three paths with awareness of node’s residual energy and distance. ELARP has experimented with NS2 simulator. The simulation results show that ELARP enhances QoS for multimedia data in terms of end to end delay and packet delivery ratio.
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.
CONGESTION AWARE LINK COST ROUTING FOR MANETSIJCNCJournal
Due to the dynamic topology, self-configuration and decentralized nature of Mobile Ad hoc Network
(MANET), it provides many benefits in wireless networks and is easy to deploy. But the transmission of
data over ad hoc networks has elevated many technical issues for successful routing. Congestion is one of
the important issues which cause performance degradation of a network, due to long delay and high packet
loss. This paper proposes a Congestion aware Link Cost Routing for MANET where the protocol finds a
path with optimized linked cost based on SNR, Link delay, and the and remaining battery power. Along
with this optimization, in this protocol, every node finds its congestion status and participates in the route
discovery on the basis of its status. Data forwarding is also done based on the congestion status at the time
of forwarding. The protocol results in better performance in terms of packet delivery fraction, end to end
delay, throughput, and packet drop when compared to existing protocols.
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
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.
Nearest Adjacent Node Discovery Scheme for Routing Protocol in Wireless Senso...IOSR Journals
The broad significance of Wireless Sensor Networks is in most emergency and disaster rescue
domain. The routing process is the main challenges in the wireless sensor network due to lack of physical links.
The objective of routing is to find optimum path which is used to transferring packets from source node to
destination node. Routing should generate feasible routes between nodes and send traffic along the selected path
and also achieve high performance. This paper presents a nearest adjacent node scheme based on shortest path
routing algorithm. It is plays an important role in energy conservation. It finds the best location of nearest
adjacent nodes by involving the least number of nodes in transmission of data and set large number of nodes to
sleep in idle mode. Based on simulation result we shows the significant improvement in energy saving and
enhance the life of the network
Design and implementation of new routingIJCNCJournal
Energy consumption is a key element in the Wireless Sensor Networks (WSNs) design. Indeed, sensor nodes are really constrained by energy supply. Hence, how to improve the network lifetime is a crucial and challenging task. Several techniques are available at different levels of the OSI model to maximize the WSN lifetime and especially at the network layer which uses routing strategies to maintain the routes in the network and guarantee reliable communication. In this paper we intend to propose a new protocol called
Combined Energy and Distance Metrics Dynamic Routing Protocol (CEDM-DR). Our new approach considers not only the distance between wireless sensors but also the energy of node acting as a router in order to find the optimal path and achieve a dynamic and adaptive routing.
The performance metrics exploited for the evaluation of our protocol are average energy consumed, network lifetime and packets lost. By comparing our proposed routing strategy to protocol widely used in WSN namely Ad hoc On demand Distance Vector(AODV), simulation results show that CEDM-DR strategy might effectively balance the sensor power consumption and permits accordingly to enhance the network
lifetime. As well, this new protocol yields a noticeable energy saving compared to its counterpart.
Q-LEARNING BASED ROUTING PROTOCOL TO ENHANCE NETWORK LIFETIME IN WSNSIJCNCJournal
In resource constraint Wireless Sensor Networks (WSNs), enhancement of network lifetime has been one of the significantly challenging issues for the researchers. Researchers have been exploiting machine learning techniques, in particular reinforcement learning, to achieve efficient solutions in the domain of WSN. The objective of this paper is to apply Q-learning, a reinforcement learning technique, to enhance the lifetime of the network, by developing distributed routing protocols. Q-learning is an attractive choice for routing due to its low computational requirements and additional memory demands. To facilitate an agent running at each node to take an optimal action, the approach considers node’s residual energy, hop length to sink and transmission power. The parameters, residual energy and hop length, are used to calculate the Q-value, which in turn is used to decide the optimal next-hop for routing. The proposed protocols’ performance is evaluated through NS3 simulations, and compared with AODV protocol in terms of network lifetime, throughput and end-to-end delay.
Similar to A scalable and power efficient solution for routing in mobile ad hoc network (manet) (20)
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...DanBrown980551
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
Let's dive deeper into the world of ODC! Ricardo Alves (OutSystems) will join us to tell all about the new Data Fabric. After that, Sezen de Bruijn (OutSystems) will get into the details on how to best design a sturdy architecture within ODC.
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf91mobiles
91mobiles recently conducted a Smart TV Buyer Insights Survey in which we asked over 3,000 respondents about the TV they own, aspects they look at on a new TV, and their TV buying preferences.
UiPath Test Automation using UiPath Test Suite series, part 3DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 3. In this session, we will cover desktop automation along with UI automation.
Topics covered:
UI automation Introduction,
UI automation Sample
Desktop automation flow
Pradeep Chinnala, Senior Consultant Automation Developer @WonderBotz and UiPath MVP
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
Key Trends Shaping the Future of Infrastructure.pdfCheryl Hung
Keynote at DIGIT West Expo, Glasgow on 29 May 2024.
Cheryl Hung, ochery.com
Sr Director, Infrastructure Ecosystem, Arm.
The key trends across hardware, cloud and open-source; exploring how these areas are likely to mature and develop over the short and long-term, and then considering how organisations can position themselves to adapt and thrive.
Connector Corner: Automate dynamic content and events by pushing a buttonDianaGray10
Here is something new! In our next Connector Corner webinar, we will demonstrate how you can use a single workflow to:
Create a campaign using Mailchimp with merge tags/fields
Send an interactive Slack channel message (using buttons)
Have the message received by managers and peers along with a test email for review
But there’s more:
In a second workflow supporting the same use case, you’ll see:
Your campaign sent to target colleagues for approval
If the “Approve” button is clicked, a Jira/Zendesk ticket is created for the marketing design team
But—if the “Reject” button is pushed, colleagues will be alerted via Slack message
Join us to learn more about this new, human-in-the-loop capability, brought to you by Integration Service connectors.
And...
Speakers:
Akshay Agnihotri, Product Manager
Charlie Greenberg, Host
Search and Society: Reimagining Information Access for Radical FuturesBhaskar Mitra
The field of Information retrieval (IR) is currently undergoing a transformative shift, at least partly due to the emerging applications of generative AI to information access. In this talk, we will deliberate on the sociotechnical implications of generative AI for information access. We will argue that there is both a critical necessity and an exciting opportunity for the IR community to re-center our research agendas on societal needs while dismantling the artificial separation between the work on fairness, accountability, transparency, and ethics in IR and the rest of IR research. Instead of adopting a reactionary strategy of trying to mitigate potential social harms from emerging technologies, the community should aim to proactively set the research agenda for the kinds of systems we should build inspired by diverse explicitly stated sociotechnical imaginaries. The sociotechnical imaginaries that underpin the design and development of information access technologies needs to be explicitly articulated, and we need to develop theories of change in context of these diverse perspectives. Our guiding future imaginaries must be informed by other academic fields, such as democratic theory and critical theory, and should be co-developed with social science scholars, legal scholars, civil rights and social justice activists, and artists, among others.
Essentials of Automations: Optimizing FME Workflows with ParametersSafe Software
Are you looking to streamline your workflows and boost your projects’ efficiency? Do you find yourself searching for ways to add flexibility and control over your FME workflows? If so, you’re in the right place.
Join us for an insightful dive into the world of FME parameters, a critical element in optimizing workflow efficiency. This webinar marks the beginning of our three-part “Essentials of Automation” series. This first webinar is designed to equip you with the knowledge and skills to utilize parameters effectively: enhancing the flexibility, maintainability, and user control of your FME projects.
Here’s what you’ll gain:
- Essentials of FME Parameters: Understand the pivotal role of parameters, including Reader/Writer, Transformer, User, and FME Flow categories. Discover how they are the key to unlocking automation and optimization within your workflows.
- Practical Applications in FME Form: Delve into key user parameter types including choice, connections, and file URLs. Allow users to control how a workflow runs, making your workflows more reusable. Learn to import values and deliver the best user experience for your workflows while enhancing accuracy.
- Optimization Strategies in FME Flow: Explore the creation and strategic deployment of parameters in FME Flow, including the use of deployment and geometry parameters, to maximize workflow efficiency.
- Pro Tips for Success: Gain insights on parameterizing connections and leveraging new features like Conditional Visibility for clarity and simplicity.
We’ll wrap up with a glimpse into future webinars, followed by a Q&A session to address your specific questions surrounding this topic.
Don’t miss this opportunity to elevate your FME expertise and drive your projects to new heights of efficiency.
Essentials of Automations: Optimizing FME Workflows with Parameters
A scalable and power efficient solution for routing in mobile ad hoc network (manet)
1. International Journal of Mobile Network Communications & Telematics ( IJMNCT) Vol. 4, No.2, April 2014
DOI : 10.5121/ijmnct.2014.4201 1
A SCALABLE AND POWER-EFFICIENT SOLUTION
FOR ROUTING IN MOBILE AD HOC NETWORKS
(MANET)
Kirtikumar K. Patel1
Dhadesugoor.R.Vaman2
Prairie View A & M University
Prairie View, TX-77446
1
– Doctoral Candidate; Electrical and Computer Engineering Department
2
– Texas A&M University System Regents Professor, Electrical and Computer
Engineering Department
ABSTRACT
Mobile Ad Hoc Network (MANET) is a very dynamic and infrastructure-less ad hoc network. The actual
network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable. MANET is a resource limited network and therefore the developed routing
algorithm for packet transmission should be power and bandwidth efficient. These kinds of dynamic
networks should operate with minimal management overhead. The management functionality of the
network increases with number of nodes and reduces the performance of the network. Here, in this paper,
we have designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Graph theoretic routing algorithm is used to develop route for packet
transmission by using the minimum resources. In this paper, we developed routing algorithm for cluster
based MANET and finds a path from source to destination using minimum cumulative degree path. Our
simulation results show that this routing algorithm provide efficient routing path with the increasing
number of nodes and uses multi-hop connectivity for intra-cluster to utilize minimum power for packet
transmission irrespective of number of nodes in the network.
KEYWORDS
MANET, routing, mobility, Graph Theory, Scalable, Power efficient, wireless network
1. INTRODUCTION
Mobile Ad Hoc Network (MANET) [1] is often characterized as a system of dynamic nodes that
communicate over wireless links. It does not use towers or base stations to perform packet
transmission [2, 3]. It has all mobile nodes and they move freely in the network independent of
each other. Also, each node is able to send and receive data from other nodes in the network as
well as it can work as a router. Also, MANET is both power and bandwidth constrained and yet it
is expected to provide multi-service provisioning with end-to-end Quality of Service (QoS)
provisioning to end users. QoS in MANET is defined as the collective effect of service
performance with constraints on delay, jitter, system buffer, network bandwidth, number of hops,
power at each node, node mobility in MANET, and packet loss. When a source node is unable to
send packet to destination node, it uses another intermediate node as relay to forward packet to
the destination node. Using this multi-hop connectivity for the packet transmission, we can save
power at each intermediate node [4, 5]. However, since the nodes move freely, maintaining
continuous path connectivity imposes additional complexity. MANETs rely on all participating
2. International Journal of Mobile Network Communications & Telematics ( IJMNCT) Vol. 4, No.2, April 2014
2
nodes to share the task of routing and forwarding peer traffic. Thus, it is very necessary to
develop a routing algorithm which can be efficient and resource saving as well in terms of power
and bandwidth usage. It can improve the overall efficiency of the network to provide quality of
service (QoS) assurance for the required application. Also, the performance efficiency achived
with a small set of nodes must be scalable for large set of nodes. Furthermore, in MANET, fast
and unpredictable topology changes due to nodes mobility, and channel capacity vary due to
environmental effects. Thus, it is more prone to errors compared with that of wired networks and
reduces the overall network throughput than equivalent wired network.
This paper is organized as follows. Section II describes literature review. The basic system design
is described in Section III followed by acceptable performance of graph theoretic routing
algorithm in section IV. Section V concludes the paper.
2. BACKGROUND
A communication system requires packet transmission process. This packet transmission can be
done after finding a path from source to destination. Thus, a routing path is required to deliver a
packet from source to destination in the network. There are many routing algorithms have been
developed by researchers for different kind of networks [6, 7, 8, 9, 10, 11, 12]. We had discussed
many routing protocols with their advantages and limitations in our previous research [4, 5] and
these limitations prohibit them to be useful for deployment in a scalable MANET. Most of these
algorithms which have evolved over years for wired internet are not suitable for scalable MANET
application. MANET is wireless ad hoc network which consists of mobile nodes. Also, wireless
channel is more prone to error than wired channel. It can be influenced by obstacles, weather
conditions and different kind of disturbance occurred in wireless channel. Reactive routing
protocols use flooding technique to find the new route if an existing route breaks and thus it will
direct to more packet loss in deciding the on-demand routing algorithm. It uses much network
overhead in finding the new route and ad-hoc networks have very limited resources therefore it’s
not adequate idea to use more resources to find new route even if there is no guarantee that new
selected route will be more effective than previous one. In comparison, proactive routing
protocols provide higher routing efficiency in scattered traffic pattern and high mobility network.
It maintains all the routes periodically thus it is very feasible to change the route at any point. It
avoids finding of new route on demand. This technique does not use flooding technique and
therefore it doesn’t add any extra overhead to packet and saves available bandwidth usage
accordingly. In our previous papers, we demonstrated a reason to develop a scalable and power
efficient routing algorithm which can provides preemptive action and handles mobility by using
multi-hop connectivity and send packets through less contended path. Many researchers provide
their multi-hop connectivity based on shortest path and minimum power. But this shortest path is
not always efficient in terms of provide efficient transmission which utilize less amount of
resources and minimize the total transmission delay.
As per author’s knowledge, there is no research published which can help to find a route for
packet transmission over minimum contended path. Here we are presenting an idea to route
packets through minimum cumulative degree path using the graph theoretic routing algorithm for
cluster-based MANET where degree is calculated as number of incoming links to particular node
[13, 14, 15, 16].
3. International Journal of Mobile Network Communications & Telematics ( IJMNCT) Vol. 4, No.2, April 2014
3
3. SYSTEM MODEL
We have considered a cluster based MANET architecture and it is explained in detail in our
previous research paper [4] as well as it is shown in Fig.1 as below. The proposed scheme
develops a route for packet transmission from the source node to a destination node based on the
available degree and congestion at each node. This newly developed routing algorithm reduces
the scheduling time at each node by selecting the least congested node first in routing path;
consequently this reduces the overall delay and accomplishes the targeted QoS for the application.
In addition, it is proactive routing and it saves bandwidth and power at each intermediate node
consequently to increase efficiency of the MANET. In this section, we will show that our
designed algorithm is scalable and it is power efficient. Here we used multi-hop connectivity for
the packet transmission and our simulation results show that the multi-hop connectivity is more
power efficient than the direct transmission. It also proves that the developed routing algorithm is
scalable. The newly developed route will always be efficient in terms of transmission
delay and network throughput despite of the increasing nodes in the network.
Figure 1. MANET Architecture
3.1. Power Efficiency
In packet transmission from a source to the destination, we should consider the processing power
as well as the transmission power for the packet. Processing power is the power which is used to
calculate the route as well as to generate a new packet to send. The main aim of power control is
to reduce the total power consumption at each node and increase the network lifetime by
increasing the residual power of battery. However we can achieve multiple benefits by controlling
the transmission power in an ad hoc network and alleviate the impact of interference by using less
amount of power at each node using multi-hop connectivity to satisfy QoS requirement for the
appropriate application. Optimal power consumption in ad hoc network can be achieved by
following techniques.
4. International Journal of Mobile Network Communications & Telematics ( IJMNCT) Vol. 4, No.2, April 2014
4
Power required to transmit a packet from source to destination is calculated based on the distance
between them. For a transmission from source node k to destination node j at data rate R,
separated by a distance dkj, the transmitter power at k is modeled by eq. 1 as shown below.
* kj
P R dα
=
(1)
Where α is the channel loss exponent (typically between 2 and 4, depending on the channel
medium) [17]. Throughout this research, we assume α = 3. We are working in wireless medium
and channel conditions are not fixed in wireless medium. Sometimes there may some interference
available in channel thus at that time our = 4 and in case of absence of interference α = 2. There is
always zero probability of having interference, Therefore, for the better safe side, we considered α
= 3. It is obvious that the direct communication requires higher transmission power from source
node than Multihop communication.
1 2 3 1 2 3( ... ...n nd d d d d d d dα α α α α
+ + + + ) >> + + + +
(2)
From equation 2, we can say that the long range transmission consume more power in
transmission than total sum of several shorter range transmission [18, 19]. Therefore, each node
can save power and increase the network lifetime.
3.2. Scalability
A network size can be very depending on the application. Ad hoc network is mainly used in
Battle field theatre applications and emergency disaster management. In this kind of applications,
network size can’t be predicted in advance and therefore, all solutions related to mobile ad hoc
network should be scalable as well as power efficient. Routing in mobile ad hoc network has been
an interesting topic for research since long time. Also, graph theory has been applied to lot of
static problems. Here, we developed a graph theoretic based routing algorithm for dynamic ad hoc
network. Routing algorithm should be designed in such a way that it doesn’t affect the network
performance even if the number of nodes increases as per the desired application. In our previous
research [5], we have designed an algorithm to determine the number of intermediate nodes based
on the location of destination node and source node. Using the method of power circle, we can
find the total number of intermediate nodes which can relay the information from the source node
to the destination node. We also showed that the algorithm is capable of handling the mobility of
the nodes. Our routing scheme is applicable to the inter-cluster as well as intra-cluster
connectivity.
5. International Journal of Mobile Network Communications & Telematics ( IJMNCT) Vol. 4, No.2, April 2014
5
4. Simulation Results
We had simulated the MANET architecture on MATLAB software. In order to perform this
simulation, we developed a MANET where all nodes are randomly distributed and its area 200 x
200 meters. We have also allowed each node to move randomly and independent. Figure 2
demonstrate the random distribution of 50 nodes in the whole network. To prove the scalability of
the network, we vary network size till 200 nodes. We have selected a random source and a
destination node which can communicate by selecting a path from our developed routing
algorithm using minimum cumulative degree.
Figure 2. Random distribution of nodes in the network
4.1. Power Efficiency
MANET is combination of mobile nodes which has limited power. Thus, in order to prove the
power efficiency of the graph theoretic routing algorithm, we have simulated different number of
source-destination pairs and measure the power of each transmission. Figure 3 shows that the
multi-hop connectivity gives better power utilization at each node. Using multi-hop connectivity
we can save power at each intermediate node and increase the network life consequently. For the
case shown in Fig.4, source node sends packets to destination node using one intermediate node
and the power calculation for this case is calculated using the equation. 1 as indicated in table 1.
Also, for the same source and destination pair, the source node sends packet to the destination
node using two intermediate nodes as shown in Fig. 5 and its power is calculated in table 2. By
comparing table 1 and 2, we can conclude that using multi-hop connectivity, each node has to
utilize less amount of power rather than direct transmission. In addition, in this case, the total
power required to send packet from the source node to the destination node is lesser when source
node utilize two intermediate nodes.
0 20 40 60 80 100 120 140 160 180 200
0
20
40
60
80
100
120
140
160
180
200
Node Location in MANET at initialization
Node location in X axis
NodelocationinYaxis
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
6. International Journal of Mobile Network Communications & Telematics ( IJMNCT) Vol. 4, No.2, April 2014
6
Figure 3. Direct Transmission Vs. Multi-hop Transmission
Figure 4. Source to Destination Connectivity using Single Intermediate Hop
Table 1. Power Calculation for Case shown in Fig. 4
0 10 20 30 40 50 60 70 80 90 100
1.04
1.06
1.08
1.1
1.12
1.14
1.16
1.18
1.2
Required Power for Packet Transmission
Number of Source-Destination Pair
Requiredpower(mw)
Direct Transmission (mean - 1.1435)
multi-hop transmission (mean - 1.1049)
0 50 100 150 200 250 300 350
-50
0
50
100
150
200
250
300
1
2
3
4
56
7
8
9
10
11
12 13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
2829
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
Node Location in Different Circles at Initialization
Node location on X axis
NodelocationonYaxis
7. International Journal of Mobile Network Communications & Telematics ( IJMNCT) Vol. 4, No.2, April 2014
7
From Node 41
to node 7
From Node 7
to node 16
Total
Required Transmission
power (mw)
0.497 4.518 5.0162
Figure 5. Source to Destination Connectivity using Two Intermediate Nodes
Table 2.Power Calculation for Case shown in Fig. 5
From Node
41 to node 7
From Node 7
to node 4
From node 4
to node 16
Total
Required
Transmission power
(mw)
0.186 2.164 2.627 4.978
We also measure the end-to-end power for 50 and 100 source destination pairs and it is illustrated
in Fig. 6 and Fig. 7 respectively. These simulation results shows that the overall transmission
power for different source-destination pair for two separate algorithms. It proves that the power
required by graph theoretic routing algorithm is lesser than the shortest path algorithm. We also
increase number of nodes in the network to verify the power efficiency of the designed algorithm
and proved that the graph theoretic routing algorithm performs better than the shortest degree path
algorithm. It is shown in Fig. 8.
0 50 100 150 200 250 300 350
-50
0
50
100
150
200
250
300
1
23
4
5
6
7
8
9
10
11
12
13
14 15
16
17
18
19
20
21
22
23
24
25
26
27
2829
30
31
32
33
3435
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
Node Location in Different Circles After Movement of Nodes
Node location on X axis
NodelocationonYaxis
8. International Journal of Mobile Network Communications & Telematics ( IJMNCT) Vol. 4, No.2, April 2014
8
Figure 6. Total Required power for each source-destination pair
Figure 7. Total required power for each source-destination pair
0 5 10 15 20 25 30 35 40 45 50
1
1.5
2
2.5
3
3.5
4
4.5
5
Total Required Transmission Power
Processingpower(mw)
Number of Source-Destination Pair
Minimum Cumulative Degree Algorithm (mean - 3.0983)
Shortest Distance Path (mean - 3.1197)
0 10 20 30 40 50 60 70 80 90 100
1
1.5
2
2.5
3
3.5
4
4.5
5
Total Required Transmission Power
Processingpower(mw)
Number of Source-Destination Pair
Minimum Cumulative Degree Algorithm (2.8730)
Shortest Distance Path (mean - 2.9224)
9. International Journal of Mobile Network Communications & Telematics ( IJMNCT) Vol. 4, No.2, April 2014
9
Figure 8. Total required power for different size of networks
4.2. Scalability
To demonstrate the scalability for the MANET using minimum degree based routing algorithm,
we have only considered intra-cluster connectivity in this research paper. Here we have simulated
a MANET for 100 different source-destination pairs and each time source-destination pairs
selected randomly. For the first case as shown in Fig. 9 we have simulated 50 pairs and we can
see that minimum degree based routing path has less number of degree with compared to shortest
distance path. Shortest distance path routing algorithm derives a path without knowledge of
congestion at each node based on its degree and graph theoretic routing develops route based on
node’s available congestion. Thus, degree is directly proportional to delay of packet transmission
and therefore, minimum degree algorithm provides lesser delay in packet transmission. In the
second case, we have increased our simulation for 100 different random source-destination node
pairs and we got the same result as we got in Fig. 10. We also extended our research to prove
scalability of the algorithm, we varies network size from initial condition to 200 nodes. And each
time we have some source-destination pairs. Fig. 11 shows the mean value of total cumulative
degree in each case. It also shows that as number of nodes increases, our newly developed
algorithm gives better performance and reduces overall delay and increase throughput of the
network.
0 20 40 60 80 100 120 140 160 180 200
2.2
2.4
2.6
2.8
3
3.2
3.4
3.6
3.8
Required power with increasing number of nodes
Processingpower(mw)
Nodes
Minimum Cumulative Degree Algorithm (mean - 3.1775)
Shortest Distance Path (mean - 3.2909)
10. International Journal of Mobile Network Communications & Telematics ( IJMNCT) Vol. 4, No.2, April 2014
10
Figure 9. Cumulative degree for each source-destination pair
Figure 10. Cumulative Degree for each source-destination pair
0 5 10 15 20 25 30 35 40 45 50
0
5
10
15
20
25
30
Cumulative Degree for Different Algorithms
MinimumCumulativeDegree
Number of Source-Destination pair
Minimum Cumulative Degree Path
Shortest Distance Path
0 10 20 30 40 50 60 70 80 90 100
0
5
10
15
20
25
X: 47
Y: 13
Cumulative Degree for Different Algorithms
MinimumCumulativeDegree
Number of Source-Destination pair
X: 47
Y: 19
X: 68
Y: 9
X: 68
Y: 20X: 24
Y: 15
X: 24
Y: 22
Minimum Cumulative Degree Path
Shortest Distance Path
11. International Journal of Mobile Network Communications & Telematics ( IJMNCT) Vol. 4, No.2, April 2014
11
Figure 11. Cumulative Degree for different size of networks
5. Conclusion
MANET is a dynamic network and therefore, it is a critical to route packet in this kind of
network. Here, we developed a graph theoretic routing algorithm for inter-cluster as well as intra-
cluster network. We designed all identical nodes except cluster head and thus we reduced
management overhead in order to provide highly efficient routing for the packets to deliver at
destination. By simplifying and using the minimum cumulative degree path as a preferred route to
destination, we can minimize the overall delay and increase the throughput as well as network life
by using multi-hop connectivity to save power at each intermediate node. In addition, our
simulation results proves that the average processing power required at nodes with buffer is
higher as compared to node without buffer in ad hoc network. Also, this routing algorithm is
scalable and provides preemptive action which reduces the overall packet loss and able to provide
efficient packet transmission.
ACKNOWLEDGEMENTS
This research work is supported in part by the National Science Foundation NSF 0931679. The
views and conclusions contained in this document are those of the authors and should not be
interpreted as representing the official policies, either expressed or implied, of the National
Science Foundation or the U. S. Government.
0 20 40 60 80 100 120 140 160 180 200
0
5
10
15
20
25
30
Cumulative Degree with increasing number of nodes
CumulativeDegree
Nodes
Minimum Cumulative Degree Algorithm
Shortest Distance Path
12. International Journal of Mobile Network Communications & Telematics ( IJMNCT) Vol. 4, No.2, April 2014
12
REFERENCES
[1] http://datatracker.ietf.org/wg/manet/charter/
[2] K. Srinivas and A. A. Chari, “Cross layer congestion control in MANETs and current state of art,”
International Journal of Computer Applications, vol. 29, no. 6, pp. 28-35, September 2011
[3] Ad Hoc Networking, edited by C. E. Perkins, Addison Wesley, 2001.
[4] K. Patel, D.R.Vaman,” Graph Theoretic Routing Algorithm (GTRA) For Mobile Ad-Hoc
Networks (MANET)”, International Journal on Applications of Graph Theory in Wireless Ad hoc
Networks and Sensor Networks (GRAPH-HOC), Vol 5, No. 4, ,December 2013
[5] K. Patel, D.R.Vaman,” A Novel routing technique for Mobile Ad-Hoc Networks (MANET)”,
International Journal of Next-Generation Networks, March, 2014. (Accepted)
[6] D.R.Vaman, K.Patel ,”Mobility Handing for Mobile Ad Hoc Networks, IEEE Globecomm,2014.
(Submitted and Under Review).
[7] Abolhasan, M., Wysocki, T., & Dutkiewicz, E. (2004). A review of routing protocols for mobile
ad hoc networks. Ad hoc networks, 2(1), 1-22.
[8] S. R. Das, R. Castaneda and J. Yan, “Simulation Based Performance Evaluation of Mobile, Ad
Hoc Network Routing Protocols,” ACM/Baltzer Mobile Networks and Applications (MONET)
Journal, July 2000, pages 179-189.
[9] J. Broch, D.A. Maltz, D.B. Johnson, Y.-C. Hu, and J. Jetcheva, “A Performance Comparison of
Multi-Hop Wireless Ad Hoc Network Routing Protocols,” in Proceedings of ACM/IEEE
MOBICOM’98, Dallas, TX, Oct. 1998, pp. 85-97.
[10] M. Royer and C.-K. Toh, ”A Review of Current Routing Protocols for Ad-Hoc Mobile Wireless
Networks”, IEEE Personal Communications Magazine, April 1999, pp. 46-55.
[11] Iwata, C.-C. Chiang, G. Pei, M. Gerla, and T.-W. Chen, ”Scalable Routing Strategies for Ad-hoc
Wireless Networks,” IEEE Journal on Selected Areas in Communications, Aug. 1999, pp. 1369-
1379.
[12] S.-J. Lee, C.-K. Toh, and M. Gerla, ”Performance Evaluation of Table- Driven and On-Demand
Ad Hoc Routing Protocols,” in Proceedings of IEEE PIMRC’99, Osaka, Japan, Sep. 1999, pp.
297-301.
[13] Lih-Hsing Hsu , Cheng-Kuan Lin, Graph Theory and Interconnection Networks, CRC Press, Inc.,
Boca Raton, FL, 2009
[14] Jean-Claude Fournier, Graph Theory and Applications with exercises and problems, ISBN:
9781848210707,Feb’09.
[15] M. A. Rajan, M. G. Chandra, L. C. Reddy and P. Hiremath, “Concepts of Graph Theory Relevant
to Ad-hoc Networks”. International Journal of Computers, Communications & Control, Vol. 3,
No.Suppl, pp. 465-469, 2008.
[16] Meghanathan, Natarajan, “Applications of Graph Theory Algorithms in Mobile Ad hoc
Networks”.
[17] Marks, R.J.; Das, A.K.; El-Sharkawi, M.; Arabshahi, P.; Gray, A., "Minimum power broadcast
trees for wireless networks: optimizing using the viability lemma," Circuits and Systems, 2002.
ISCAS 2002. IEEE International Symposium on , vol.1, no., pp.I-273,I-276 vol.1, 2002
[18] Peng Cheng; Chuah, Chen-Nee; Xin Liu, "Energy-aware node placement in wireless sensor
networks," Global Telecommunications Conference, 2004. GLOBECOM '04. IEEE , vol.5, no.,
pp.3210,3214 Vol.5, 29 Nov.-3 Dec. 2004.
[19] Min, R., Chandrakasan, A. (2001, November). Energy-efficient communication for ad-hoc
wireless sensor networks. In Signals, Systems and Computers, 2001. Conference Record of the
Thirty-Fifth Asilomar Conference on (Vol. 1, pp. 139-143). IEEE.
Authors
Kirtikumar K. Patel received the B.S. degree in Electronics and Communication Engineering from
Hemchandracharya North Gujarat University, India, and M.S. degree in Electrical Engineering from Lamar
University, United States of America in 2006 and 2008, respectively. He is currently working towards his
PhD degree in the Department of Electrical and Computer Engineering at the Prairie View A&M
University, a member of the Texas A&M University System. His current research interests include mobile
ad hoc network, routing algorithms, Communication and signal processing as well as graph theory
applications and contention resolution algorithms.
13. International Journal of Mobile Network Communications & Telematics ( IJMNCT) Vol. 4, No.2, April 2014
13
Dhadesugoor R. Vaman is Texas Instrument Endowed Chair Professor and Founding Director of ARO
Center for Battlefield Communications (CeBCom) Research, ECE Department, Prairie View A&M
University (PVAMU). He has more than 38 years of research experience in telecommunications and
networking area. Currently, he has been working on the control based mobile ad hoc and sensor networks
with emphasis on achieving bandwidth efficiency using KV transform coding; integrated power control,
scheduling and routing in cluster based network architecture; QoS assurance for multi-service applications;
and efficient network management. Prior to joining PVAMU, Dr. Vaman was the CEO of Megaxess (now
restructured as MXC) which developed a business ISP product to offer differentiated QoS assured multi-
services with dynamic bandwidth management and successfully deployed in several ISPs. Prior to being a
CEO, Dr. Vaman was a Professor of EECS and founding Director of Advanced Telecommunications
Institute, Stevens Institute of Technology (1984-1998); Member, Technology Staff in COMSAT (Currently
Lockheed Martin) Laboratories (1981-84) and Network Analysis Corporation (CONTEL)(1979-81);
Research Associate in Communications Laboratory, The City College of New York (1974-79); and
Systems Engineer in Space Applications Center (Indian Space Research Organization) (1971-1974). He
was also the Chairman of IEEE 802.9 ISLAN Standards Committee and made numerous technical
contributions and produced 4 standards. Dr. Vaman has published over 200 papers in journals and
conferences; widely lectured nationally and internationally; has been a key note speaker in many IEEE and
other conferences, and industry forums. He has received numerous awards and patents, and many of his
innovations have been successfully transferred to industry for developing commercial products.