This thesis examines cross-layer interactions between middleware and routing protocols in mobile ad hoc networks (MANETs). The author developed CrossROAD, a middleware that optimizes the establishment and maintenance of a structured overlay network through interactions with the routing layer. An XL-plugin was also created to extend the proactive routing protocol UniKOLSR to support service discovery and allow information sharing between the middleware and routing layers. Experimental results showed CrossROAD performed well with low delays and supported mobility. Future work could explore using different routing protocols and evaluating applications' quality of service in larger, more mobile MANET environments.
LOAD BALANCING AND PROVIDING SECURITY USING RSA IN WIRELESS SENSOR NETWORKSIJARIIT
This paper presents load balancing and provides security using RSA algorithm. This is brief introduction to handle the traffic on node. This represents the converge-casting protocol in wireless sensor networks. The protocol is localized and distributed, and adapts efficiently to vary traffic. Graphs are analyzed using NS-2 simulator, here end-to-end packet latency, packet delivery ratio, throughput are analyzed. This is done for 30 nodes in NS-2 simulation.
Black Hole Detection in AODV Using Hexagonal Encryption in Manet’sIJMER
In MANETs (mobile ad hoc network), security is common problem and lack of issues in
MANET network. When comparing to wired network, MANETs are harmed to security attacks due to the
scarcity of a trusted centralized enforce authority and limited resources. This paper proposed a technique
to avoid Blackhole node behaviour in AODV (Ad Hoc On-Demand Distance Vector) using Hexagonal
Encryption inNS2. Hexagonal Encryption has been chosen for low cost and high computation speed up.
Compared to existing blackhole detection technique, this proposed technique obtains better result by
stimulating in NS2.
Performance Evaluation of ad-hoc Network Routing Protocols using ns2 SimulationIDES Editor
Ad-hoc networks are basically peer to peer multihop
mobile wireless networks in which the information packets
are transmitted in a ‘store and forward’ manner from a source
to an arbitrary destination via intermediate nodes. The main
objective of this paper is to evaluate the performance of various
ad-hoc networks routing protocols viz. DSDV (Destination
Sequence Distance Vector), DSR (Dynamic Source Routing)
and AODV (Ad-hoc On Demand Distance Vector). The
comparison of these protocols is based on different
performance metrics, which are throughput, packet delivery
ratio, routing overheads, packet drop and average end to end
delay. The performance evaluation has been done by using
simulation tool NS2 (Network Simulator) which is the main
simulator.
Disruption Tolerant Network Coding scenarios often rises from mobile wireless networks where due to limited transmission power, fast node mobility,sparse node density, and frequent equipment failures, there is often no contemporaneous path from the source to destination nodes. Before going to the depth of DTN, it is recommended to review traditional non-coding routing schemes for broadcast and unicast applications in DTNs, and the basic operations of Random Linear Coding (RLC).
Delay tolerant network routing protocol a comprehensive survey with hybrid...eSAT Journals
Abstract
Delay –disruption Tolerant networks are sparse wireless network which is recently being used by the existing /current network for the purpose to connect devices or the underdeveloped area of the world that works in challenging environment. In DTN there majority of time does not exist the total path from source to target which is leads to the difficulty of how to route the packet in such environment. A communications network which is accomplished of storing packets temporarily in intermediate nodes, until the time an end-to-end route is re-established or regenerated is known as a delay tolerant networks. Routing in such network is very difficult and for that different routing protocols are developed. In this Survey paper we discuss about various routing Strategy and at the end compared the different routing protocol with their various performance metrics.
Keywords: Delay tolerant networks (DTNs), Erasure coding, Replication, Routing.
LOAD BALANCING AND PROVIDING SECURITY USING RSA IN WIRELESS SENSOR NETWORKSIJARIIT
This paper presents load balancing and provides security using RSA algorithm. This is brief introduction to handle the traffic on node. This represents the converge-casting protocol in wireless sensor networks. The protocol is localized and distributed, and adapts efficiently to vary traffic. Graphs are analyzed using NS-2 simulator, here end-to-end packet latency, packet delivery ratio, throughput are analyzed. This is done for 30 nodes in NS-2 simulation.
Black Hole Detection in AODV Using Hexagonal Encryption in Manet’sIJMER
In MANETs (mobile ad hoc network), security is common problem and lack of issues in
MANET network. When comparing to wired network, MANETs are harmed to security attacks due to the
scarcity of a trusted centralized enforce authority and limited resources. This paper proposed a technique
to avoid Blackhole node behaviour in AODV (Ad Hoc On-Demand Distance Vector) using Hexagonal
Encryption inNS2. Hexagonal Encryption has been chosen for low cost and high computation speed up.
Compared to existing blackhole detection technique, this proposed technique obtains better result by
stimulating in NS2.
Performance Evaluation of ad-hoc Network Routing Protocols using ns2 SimulationIDES Editor
Ad-hoc networks are basically peer to peer multihop
mobile wireless networks in which the information packets
are transmitted in a ‘store and forward’ manner from a source
to an arbitrary destination via intermediate nodes. The main
objective of this paper is to evaluate the performance of various
ad-hoc networks routing protocols viz. DSDV (Destination
Sequence Distance Vector), DSR (Dynamic Source Routing)
and AODV (Ad-hoc On Demand Distance Vector). The
comparison of these protocols is based on different
performance metrics, which are throughput, packet delivery
ratio, routing overheads, packet drop and average end to end
delay. The performance evaluation has been done by using
simulation tool NS2 (Network Simulator) which is the main
simulator.
Disruption Tolerant Network Coding scenarios often rises from mobile wireless networks where due to limited transmission power, fast node mobility,sparse node density, and frequent equipment failures, there is often no contemporaneous path from the source to destination nodes. Before going to the depth of DTN, it is recommended to review traditional non-coding routing schemes for broadcast and unicast applications in DTNs, and the basic operations of Random Linear Coding (RLC).
Delay tolerant network routing protocol a comprehensive survey with hybrid...eSAT Journals
Abstract
Delay –disruption Tolerant networks are sparse wireless network which is recently being used by the existing /current network for the purpose to connect devices or the underdeveloped area of the world that works in challenging environment. In DTN there majority of time does not exist the total path from source to target which is leads to the difficulty of how to route the packet in such environment. A communications network which is accomplished of storing packets temporarily in intermediate nodes, until the time an end-to-end route is re-established or regenerated is known as a delay tolerant networks. Routing in such network is very difficult and for that different routing protocols are developed. In this Survey paper we discuss about various routing Strategy and at the end compared the different routing protocol with their various performance metrics.
Keywords: Delay tolerant networks (DTNs), Erasure coding, Replication, Routing.
In the last decade Peer to Peer technology has been thoroughly explored, becauseit overcomes many limitations compared to the traditional client server paradigm. Despite its advantages over a traditional approach, the ubiquitous availability of high speed, high bandwidth and low latency networks has supported the traditional client-server paradigm. Recently, however, the surge of streaming services has spawned renewed interest in Peer to Peer technologies. In addition, services like geolocation databases and browser technologies like Web-RTC make a hybrid approach attractive.
In this paper we present algorithms for the construction and the maintenance of a hybrid P2P overlay multicast tree based on topological distances. The essential idea of these algorithms is to build a multicast tree by choosing neighbours close to each other. The topological distances can be easily obtained by the browser using the geolocation API. Thus the implementation of algorithms can be done web-based in a distributed manner.
We present proofs of our algorithms as well as experimental results and evaluations.
These days, the interests in challenged networks are increasing and many researches are performed to seek a reliable end-to-end connectivity under harsh environments, which have a long propagation delay, high error rates, low data rate, and intermittent connectivity. Delay Tolerant Network was introduced to provide challenged networks with reliable transmission and interoperability with an overlay network concept. In this paper, we present comprehensive overview of Delay Tolerant Network and introduce a study case about the implementation of this network. This paper is designed to encourage the exploration of this field by giving basic concept and also motivate to investigate this area by presenting a study case at the end section.
---
Please contact to lailiaidi@gmail.com for download request
IMPROVING THE PERFORMACE OF DATA AGGREGATION IN WIRELESS SENSOR NETWORKEditor IJMTER
In this paper data aggregation using multipath routing is proposed. In existing system, under hybrid scheme, it each sensor nodes generates information by sensing its physical environment and transmit to sink by multi hop communication. In network aggregation computation intermediate forwarding nodes can substantially increase the network life time but amount of data contained in single packet and make the system vulnerability to packet loss. Instead of retransmission it takes the additional time. Ad hoc On Demand Distance Vector routing protocol is used to improving the performance of data aggregation due to avoiding these problems.
Delay Tolerant Networks(DTN) are a class of emerg- ing networks which experience intermittent connectivity and lack end-to-end paths due to absence of well-defined infrastructure. In this paper we explore the nuances of multicasting in DTNs. Multicasting enables efficient distribution of messages to a group of users, a paradigm that can be applicable in the context of DTNs. While multicasting in internet and ad-hoc networks has been studied extensively, realizing the same in DTNs is non- trivial given that many factors have to be considered. This paper, presents an implementation of multicast routing for various protocols in DTNs using ONE simulator. It also provides the analysis and performance results for the various protocols studies against the different movement models.
This presentation covers some of the routing protocols for Delay Tolerant Networks (DTN) along with the overview of the Opportunistic Networking Environment which can be used for performance evaluation/comparison of/among these DTN protocols.
P.S. This presentation is for educational purpose only. It is not meant for any commercialization at all.
Abstract Mobile Ad Hoc Network(MANETs) is a wireless communications technology in which devices may move around. There is no fixed structure or network that all the participating nodes form. It is a very flexible network. These characteristicsof MANET make it very unsafe and prone to various attacks.Although many research focus on how to deliver packets fromone node to another, very less importance had been given tothe security. Current techniques of addressing security on thefixed structured wired network are only useful to protect thetransmitted message on the end nodes, the security of routinginformation among the mobile nodes in the hostile environmentwhere mobile Ad Hoc networks are usually used has beeninadequately addressed. Security and routing has been treatedseparately incase of wired network but that cannot be done inwireless network since routing itself can be a major reason fordata loss or theft if done in a casual manner making it prone toattack from malicious node.Hence the routing and security hasto be looked into as one and not separately. Making the routingsecured can make the MANET a more reliable network. We havemade the routing mechanism secured but extending Fuzzy logic toit. Fuzzy logic in deciding the route makes it less prone to attacksand thus ensuring enhanced security. The proposed scheme ofsecure routing will be demonstrated by using simulation on NS2. Keywords AODV, SAODV, Fuzzy Logic, Black holeattack.
Developing QoS by Priority Routing for Real Time Data in Internet of Things (...IJCNCJournal
In networks, many application protocols such as CoAP, REST, XMPP ,AMQP have been proposed for IoT communication which includes p2p or S2S. In MANET Network convergence does the way for improvements in Internet of Things (IoT) communication with high potential for a wide range of applications. Each protocol focuses on some aspects of communication in the IoT. Hence, these application protocols have indicated of how IoT has integrated to enhanced and developed of a new service that require to guarantees
the wide range offered by the quality of services. In this paper, we will introduce a smart pathway that can be bridge the gap between IoT services with its real data traffic. Therefore, we enhanced the MANET routing protocol for computing two or more paths to pass the more that one high priority real traffic data via these paths to improve the gloomy picture of this protocol in the context of IoT. In particular, the good services
with high timely delivery of urgent data such as real time data environmental monitoring. After surveying the published and available protocol interoperability given for urban sensing. In this research, we have proposed a novel solution to integrate MANET overlays, and collaboratively formed over MANET, to boost urban data in IoT. Overlays are used to dynamic differentiate and fasten the delivery of high priority real application time data over low-latency MANET paths by integrating with the original specifications. Our experimental results showed the effectiveness on the network such as the overhead and network congestion. In addition, the initial
results of the light-weight improved the routing protocol over the baseline protocols in terms of the delay of reciveing the packets between nodes which lead to increase the throughput by reducing loss packets.
In the last decade Peer to Peer technology has been thoroughly explored, becauseit overcomes many limitations compared to the traditional client server paradigm. Despite its advantages over a traditional approach, the ubiquitous availability of high speed, high bandwidth and low latency networks has supported the traditional client-server paradigm. Recently, however, the surge of streaming services has spawned renewed interest in Peer to Peer technologies. In addition, services like geolocation databases and browser technologies like Web-RTC make a hybrid approach attractive.
In this paper we present algorithms for the construction and the maintenance of a hybrid P2P overlay multicast tree based on topological distances. The essential idea of these algorithms is to build a multicast tree by choosing neighbours close to each other. The topological distances can be easily obtained by the browser using the geolocation API. Thus the implementation of algorithms can be done web-based in a distributed manner.
We present proofs of our algorithms as well as experimental results and evaluations.
These days, the interests in challenged networks are increasing and many researches are performed to seek a reliable end-to-end connectivity under harsh environments, which have a long propagation delay, high error rates, low data rate, and intermittent connectivity. Delay Tolerant Network was introduced to provide challenged networks with reliable transmission and interoperability with an overlay network concept. In this paper, we present comprehensive overview of Delay Tolerant Network and introduce a study case about the implementation of this network. This paper is designed to encourage the exploration of this field by giving basic concept and also motivate to investigate this area by presenting a study case at the end section.
---
Please contact to lailiaidi@gmail.com for download request
IMPROVING THE PERFORMACE OF DATA AGGREGATION IN WIRELESS SENSOR NETWORKEditor IJMTER
In this paper data aggregation using multipath routing is proposed. In existing system, under hybrid scheme, it each sensor nodes generates information by sensing its physical environment and transmit to sink by multi hop communication. In network aggregation computation intermediate forwarding nodes can substantially increase the network life time but amount of data contained in single packet and make the system vulnerability to packet loss. Instead of retransmission it takes the additional time. Ad hoc On Demand Distance Vector routing protocol is used to improving the performance of data aggregation due to avoiding these problems.
Delay Tolerant Networks(DTN) are a class of emerg- ing networks which experience intermittent connectivity and lack end-to-end paths due to absence of well-defined infrastructure. In this paper we explore the nuances of multicasting in DTNs. Multicasting enables efficient distribution of messages to a group of users, a paradigm that can be applicable in the context of DTNs. While multicasting in internet and ad-hoc networks has been studied extensively, realizing the same in DTNs is non- trivial given that many factors have to be considered. This paper, presents an implementation of multicast routing for various protocols in DTNs using ONE simulator. It also provides the analysis and performance results for the various protocols studies against the different movement models.
This presentation covers some of the routing protocols for Delay Tolerant Networks (DTN) along with the overview of the Opportunistic Networking Environment which can be used for performance evaluation/comparison of/among these DTN protocols.
P.S. This presentation is for educational purpose only. It is not meant for any commercialization at all.
Abstract Mobile Ad Hoc Network(MANETs) is a wireless communications technology in which devices may move around. There is no fixed structure or network that all the participating nodes form. It is a very flexible network. These characteristicsof MANET make it very unsafe and prone to various attacks.Although many research focus on how to deliver packets fromone node to another, very less importance had been given tothe security. Current techniques of addressing security on thefixed structured wired network are only useful to protect thetransmitted message on the end nodes, the security of routinginformation among the mobile nodes in the hostile environmentwhere mobile Ad Hoc networks are usually used has beeninadequately addressed. Security and routing has been treatedseparately incase of wired network but that cannot be done inwireless network since routing itself can be a major reason fordata loss or theft if done in a casual manner making it prone toattack from malicious node.Hence the routing and security hasto be looked into as one and not separately. Making the routingsecured can make the MANET a more reliable network. We havemade the routing mechanism secured but extending Fuzzy logic toit. Fuzzy logic in deciding the route makes it less prone to attacksand thus ensuring enhanced security. The proposed scheme ofsecure routing will be demonstrated by using simulation on NS2. Keywords AODV, SAODV, Fuzzy Logic, Black holeattack.
Developing QoS by Priority Routing for Real Time Data in Internet of Things (...IJCNCJournal
In networks, many application protocols such as CoAP, REST, XMPP ,AMQP have been proposed for IoT communication which includes p2p or S2S. In MANET Network convergence does the way for improvements in Internet of Things (IoT) communication with high potential for a wide range of applications. Each protocol focuses on some aspects of communication in the IoT. Hence, these application protocols have indicated of how IoT has integrated to enhanced and developed of a new service that require to guarantees
the wide range offered by the quality of services. In this paper, we will introduce a smart pathway that can be bridge the gap between IoT services with its real data traffic. Therefore, we enhanced the MANET routing protocol for computing two or more paths to pass the more that one high priority real traffic data via these paths to improve the gloomy picture of this protocol in the context of IoT. In particular, the good services
with high timely delivery of urgent data such as real time data environmental monitoring. After surveying the published and available protocol interoperability given for urban sensing. In this research, we have proposed a novel solution to integrate MANET overlays, and collaboratively formed over MANET, to boost urban data in IoT. Overlays are used to dynamic differentiate and fasten the delivery of high priority real application time data over low-latency MANET paths by integrating with the original specifications. Our experimental results showed the effectiveness on the network such as the overhead and network congestion. In addition, the initial
results of the light-weight improved the routing protocol over the baseline protocols in terms of the delay of reciveing the packets between nodes which lead to increase the throughput by reducing loss packets.
The presentation describes the different cloud federation scenarios, ranging from a federation built on commercial cloud providers that offer no real support for federation to one built on data centers of the same organization where the sites are completely dedicated to supporting all aspects of federation. The level of federation is defined based on the amount of information disclosed and how much control over the resources is provided across sites. The talk also presents the existing challenges for interoperability in federated and hybrid cloud computing scenarios, and ends with real-life examples of multi-cloud environments running OpenNebula.
Transform and Bridge the Digital Disconnect with SAP SolutionsCapgemini
Discover a customer information system that delivers utility and property tax bills to citizens using a CRM and billing solution, a multichannel foundation, and a computing platform, all from SAP.
See how the City of Kitchener, with Capgemini, started a transformation journey to deliver top services to those who have chosen Kitchener as their home.
Presented at SAPPHIRE NOW 2016.
Federated Cloud Computing - The OpenNebula Experience v1.0sIgnacio M. Llorente
The talk mostly focuses on private cloud computing to support Science and High Performance Computing environments, the different architectures to federate cloud infrastructures, the existing challenges for cloud interoperability, and the OpenNebula's vision for the future of existing Grid infrastructures.
IEEE CCNC 2011: Kalman Graffi - LifeSocial.KOM: A Secure and P2P-based Soluti...Kalman Graffi
The phenomenon of online social networks reaches millions of users in the Internet nowadays. In these, users present themselves, their interests and their social links which they use to interact with other users. We present in this paper LifeSocial.KOM, a p2p-based platform for secure online social networks which provides the functionality of common online social networks in a totally distributed and secure manner. It is plugin-based, thus extendible in its functionality, providing secure communication and access-controlled storage as well as monitored quality of service, addressing the needs of both, users and system providers. The platform operates solely on the resources of the users, eliminating the concentration of crucial operational costs for one provider. In a testbed evaluation, we show the feasibility of the approach and point out the potential of the p2p paradigm in the field of online social networks.
The Modern Data Architecture for Predictive Analytics with Hortonworks and Re...Revolution Analytics
Hortonworks and Revolution Analytics have teamed up to bring the predictive analytics power of R to Hortonworks Data Platform.
Hadoop, being a disruptive data processing framework, has made a large impact in the data ecosystems of today. Enabling business users to translate existing skills to Hadoop is necessary to encourage the adoption and allow businesses to get value out of their Hadoop investment quickly. R, being a prolific and rapidly growing data analysis language, now has a place in the Hadoop ecosystem.
This presentation covers:
- Trends and business drivers for Hadoop
- How Hortonworks and Revolution Analytics play a role in the modern data architecture
- How you can run R natively in Hortonworks Data Platform to simply move your R-powered analytics to Hadoop
Presentation replay at:
http://www.revolutionanalytics.com/news-events/free-webinars/2013/modern-data-architecture-revolution-hortonworks/
Routing Protocols of Distributed Hash Table Based Peer to Peer NetworksIOSR Journals
Distributed hash tables (DHTs) is an extremely attractive study theme during the part of P2P
networks; such networks be fetching especially admired in functions similar to file sharing. The idea of the
Distributed Hash Table is given that the technique to explore the resources (especially files) within a P2P
network. A DHT protocol usually affords a solitary task to the P2P function: afford a key and find out the
node (or may be nodes) which is responsible for such key [1][3]. Each and every one function (such as
really recover the resource or storing the resource on the node afford for it) is offered by superior levels of the
P2P function. In such article our objective is to discover the security measures and determine them on
accessible routing procedures of such networks. The Chord [4] (a DHT protocol) is selected as the objective
approach for a variety of reasons it resolve be enclosed in this paper
Slides from my presentation on Lambda Architecture at Indix, presented at Fifth Elephant 2014.
It talks about our experience in using Lambda Architecture at Indix, to build a large scale analytics system on unstructured, dynamically changing data sources using Hadoop, HBase, Scalding, Spark and Solr.
Structured Approach to Solution ArchitectureAlan McSweeney
The role of solution architecture is to identify answer to a business problem and set of solution options and their components. There will be many potential solutions to a problem with varying degrees of suitability to the underlying business need. Solution options are derived from a combination of Solution Architecture Dimensions/Views which describe characteristics, features, qualities, requirements and Solution Design Factors, Limitations And Boundaries which delineate limitations. Use of structured approach can assist with solution design to create consistency. The TOGAF approach to enterprise architecture can be adapted to perform some of the analysis and design for elements of Solution Architecture Dimensions/Views.
Future Research Directions on Opportunistic Routing in Wireless Mesh Networks...Tutors India
Are You Interested In Publishing Papers In Ieee And Other Important Conferences? Are You Having Difficulty Developing A Program, Code, Or Algorithm Based On Your Concept? The Idea Of Conceiving A Concept Appeals To You, But You Are Not Sure How To Proceed. A 100% Custom-written Master's Dissertation Will Help You Complete Your Undergraduate/postgraduate Degree Successfully With Our Programming And Algorithm Assistance.
A Team Of Uk Researchers And Writers Working With Tutors India Will Develop A Model Master's Dissertation Programming And Algorithm That Is Flawlessly Structured, Accurate, Comprehensive, Well-documented, Well-sourced, Professional, And Written In Perfect English Based On Your University Guidelines And Instructions.
For More Details:
https://www.tutorsindia.com/our-services/development/coding-and-algorithm/
Our Recent Blog
https://www.tutorsindia.com/blog/research-directions-opportunistic-routing-wireless-mesh-networks/
Contact us
IND: +91 8754446690
UK: +44-1143520021
Performance Evaluation of LEACH Protocol for Wireless Sensor NetworkAM Publications
This paper gives performance of LEACH protocol. LEACH is the first network protocol that uses hierarchical
routing for wireless sensor networks to increase the life time of network. All the nodes in a network organize themselves into
local clusters, with one node acting as the cluster-head. All non-cluster-head nodes transmit their data to the cluster-head,
while the cluster-head node receive data from all the cluster members, perform signal processing functions on the data (e.g.,
data aggregation), and transmit data to the remote base station. Therefore, being a cluster-head node is much more energyintensive
than being a non-cluster-head node. Thus, when a cluster-head node dies all the nodes that belong to the cluster lose
communication ability. This paper gives performance of LEACH protocol considering parameters i) Packet Delivery Ratio ii)
Throughput iii) Delay iv) lifetime.
PERFORMANCE STUDIES ON THE VARIOUS ROUTING PROTOCOLS IN AD-HOC NETWORKSJYoTHiSH o.s
Every protocol has its advantages and disadvantages in different scenarios. The choice of a routing protocol should be made carefully after considering every aspect we provided in this section (and possibly more).
Modue 1 part 1 of computer networks for your university examsvish21ainds
A computer network (CN) is a group of devices that share resources over a network, with each device represented as a network node. The devices communicate with each other using standard protocols to send or receive data.
Computers on a network can be linked through cables, radio waves, telephone lines, infrared light beams, or satellites. The network can also include other devices that help in communication, known as network devices.
Here are some types of computer networks:
PAN (Personal Area Network): The smallest and simplest type of network
LAN (Local Area Network): The most frequently used network, connecting computers within a limited area, such as a single office or building
MAN (Metropolitan Area Network): A type of network
WAN (Wide Area Network): An enterprise network spanning cities, buildings, and even countries
Wireless networking is about creating and managing wireless connections, commonly used in Wi-Fi. This involves setting up Wi-Fi routers, securing them with passwords, and allowing devices to connect to a network without using physical cables.
Modue 1 part 1 of computer networks for your university exams
Andrea Sini Thesis
1. UNIVERSITY OF PISAUNIVERSITY OF PISA
ENGINEERING DEPARTMENTENGINEERING DEPARTMENT
COMPUTER ENGINEERINGCOMPUTER ENGINEERING
Cross-layer interactions middleware-routingCross-layer interactions middleware-routing
in MANET environment:in MANET environment:
design, implementation and evaluationdesign, implementation and evaluation
Master’s ThesisMaster’s Thesis
Candidate:Candidate:
Andrea SiniAndrea Sini
Supervisors:Supervisors:
Prof. Giuseppe AnastasiProf. Giuseppe Anastasi
Prof. Marco AvvenutiProf. Marco Avvenuti
Dr. Marco ContiDr. Marco Conti
Eng. Franca DelmastroEng. Franca Delmastro
2. IndexIndex
• Current status: MANET networks, routingCurrent status: MANET networks, routing
protocols and P2P systemsprotocols and P2P systems
• Cross-layer architectureCross-layer architecture
• CrossROAD: P2P system optimized for ad hocCrossROAD: P2P system optimized for ad hoc
networksnetworks
• Implementation of a cross-layer architectureImplementation of a cross-layer architecture
limited to the interaction between middlewarelimited to the interaction between middleware
and routingand routing
• Test and experimental resultsTest and experimental results
• Conclusions and future developmentsConclusions and future developments
3. Introduction to MANETIntroduction to MANET
networksnetworks
• MANETMANET (Mobile Ad hoc NETwork) network:(Mobile Ad hoc NETwork) network:
is a wireless network between mobile devices thatis a wireless network between mobile devices that
communicate with each other without using a fixedcommunicate with each other without using a fixed
infrastructureinfrastructure
• Each node communicatesEach node communicates
directly with the nodes in itsdirectly with the nodes in its
coverage range (providing theycoverage range (providing they
are on the same frequency)are on the same frequency)
• Highly dynamicHighly dynamic
• Without a central controlWithout a central control
• Self-organizing systemSelf-organizing system
Main Features:Main Features:
4. Ad hoc networks routing protocolsAd hoc networks routing protocols
• Routing protocols are needed to establish communication paths between nodes that are not under radio coverageRouting protocols are needed to establish communication paths between nodes that are not under radio coverage
• In traditional cable networks, some special nodes (In traditional cable networks, some special nodes (routerrouter) forward packets from the sender node towards the receiver node) forward packets from the sender node towards the receiver node
• In an ad hoc network ALL the nodes shall performIn an ad hoc network ALL the nodes shall perform routingrouting activity to implement aactivity to implement a multihopmultihop
• Each node cooperates to forward the message until reaching the destinationEach node cooperates to forward the message until reaching the destination
Source
Node
Destionation
Node
5. Ad hoc networks routing protocols (2)Ad hoc networks routing protocols (2)
• Routing protocols in a MANET environment are classifiedRouting protocols in a MANET environment are classified
as:as: proactiveproactive (OLSR, TORA,etc.),(OLSR, TORA,etc.), reactivereactive (AODV, DSR etc.)(AODV, DSR etc.)
andand hybridhybrid (ZRP etc.)(ZRP etc.)
Proactive: by periodically exchanging control information
they maintain updated the routes to reach all the networks’s
nodes
High overhead
Immediate availability of routes
6. P2P systems and ad hocP2P systems and ad hoc
networksnetworks
• A P2P network is a distributed system, usuallyA P2P network is a distributed system, usually
without a centralized control, in which each nodewithout a centralized control, in which each node
has normally the same functionalities and thehas normally the same functionalities and the
communication is symmetriccommunication is symmetric
• Similarities between P2P systems and ad hocSimilarities between P2P systems and ad hoc
networks:networks:
– Service and data distribution is well suited forService and data distribution is well suited for
the ad hoc networks decentralized structurethe ad hoc networks decentralized structure
– In both cases interactions are temporaryIn both cases interactions are temporary
– Resources distributed between heterogeneousResources distributed between heterogeneous
nodesnodes
– Failures and disconnection managementFailures and disconnection management
7. Pastry protocolPastry protocol
• Pastry: P2P system for the distribution and retrieval ofPastry: P2P system for the distribution and retrieval of
information in a network based on the establishment ofinformation in a network based on the establishment of
a structured overlaya structured overlay
• The overlay is a circular addressThe overlay is a circular address
space on 128 bit in which data andspace on 128 bit in which data and
nodes are logically mapped throughnodes are logically mapped through
a Distributed Hash Table (DHT)a Distributed Hash Table (DHT)
• There is no relation between logicalThere is no relation between logical
distance and physical distance betweendistance and physical distance between
two nodestwo nodes
• Data are represented by a coupleData are represented by a couple
(key,value)(key,value)
• Pastry uses a subject based routing toPastry uses a subject based routing to
forward and recover data on the overlayforward and recover data on the overlay
2128
- 10
33301201
23301201
23301101
23000101
22301203
10233102
Key = 23302121
8. Pastry in a MANET environmentPastry in a MANET environment
• Advantages:Advantages:
• Disadvantages:Disadvantages:
• High overhead to manage the overlay and keep
updated routing tables, through remote connections
(TCP and UDP)
• Lack of correspondence between physical and logical
distances can reduce system performance
• Even workload distribution on network’s nodes
• Scalability (cost to forward and retrieve information
O(log N))
• There are many distributed applications based on
this routing strategy
9. Cross-Layer ArchitectureCross-Layer Architecture
• A cross-layer architecture allows direct interactionA cross-layer architecture allows direct interaction
between nonadjacent protocol stack layersbetween nonadjacent protocol stack layers
• Some issues cannot be effectivels solved by a singleSome issues cannot be effectivels solved by a single
protocol stack layer.protocol stack layer.
• We have developed a first prototypeWe have developed a first prototype
of cross-layer interactions to connectof cross-layer interactions to connect
thethe middlewaremiddleware level with thelevel with the
routingrouting level in order to optimize thelevel in order to optimize the
establishment and maintenance of aestablishment and maintenance of a
structured overlaystructured overlay
10. CrossROAD ArchitectureCrossROAD Architecture
• CrossROADCrossROAD (CROSS-layer Ring Overlay for AD Hoc(CROSS-layer Ring Overlay for AD Hoc
Networks)Networks): a middleware protocol optimizing overlay: a middleware protocol optimizing overlay
establishment and maintenance through a cross-layerestablishment and maintenance through a cross-layer
interaction with the routing layerinteraction with the routing layer
• CrossROAD optimizes Pastry functionalities leveraging onCrossROAD optimizes Pastry functionalities leveraging on
network’s topology information retrieved from a proactivenetwork’s topology information retrieved from a proactive
routing protocolrouting protocol
• Each overlay is linked to a given service and it is thereforeEach overlay is linked to a given service and it is therefore
required to develop a Service Discovery Protocolrequired to develop a Service Discovery Protocol
• In each routing packet are embedded the information relatedIn each routing packet are embedded the information related
to the services offered by each nodeto the services offered by each node
11. CrossROAD Architecture (2)CrossROAD Architecture (2)
NeSt
Network
Data
Abstraction
Middleware
Data
Abstraction
CrossROAD
Network
Node A
CrossROAD
Network
NeSt
Network
Data
Abstraction
Middleware
Data
Abstraction
Node B
Publish
service
LSU package containing
services publications and
topology updates
Update
topology
and remote
servicesApplication
Message
Verify internal
data
structures
12. XL-plugin ArchitectureXL-plugin Architecture
• Dynamic Link Library extending the proactive routing protocolDynamic Link Library extending the proactive routing protocol
UniKOLSR for the interaction with CrossROAD and toUniKOLSR for the interaction with CrossROAD and to
implement an effectiveimplement an effective Service DiscoveryService Discovery systemsystem
• XL-plugin is written in languageXL-plugin is written in language CC forfor GNU/Linux systems andGNU/Linux systems and
an internalan internal multithreadmultithread architecturearchitecture
• It leverages on the periodical issue ofIt leverages on the periodical issue of LSULSU packetspackets of UniKOLSRof UniKOLSR
to transport information on services available in the networkto transport information on services available in the network
• Each service is identified by the couple (Each service is identified by the couple (serviceID,portserviceID,port))
• XL-plugin returns a CrossROAD list of nodes offering a givenXL-plugin returns a CrossROAD list of nodes offering a given
service, indicating the IP address and port number on which theservice, indicating the IP address and port number on which the
service is offeredservice is offered
13. XL-plugin Architecture (2)XL-plugin Architecture (2)
CrossROAD
Plugin
Local Data Structures
Socket Parser Packet Parser
Information
repositories
Scheduler
UniKOLSR
IPC
IPC
Direct interaction with the
UniKOLSR internal
schedulerRecord socket
and parsing
functions
14. XL-plugin Architecture (3)XL-plugin Architecture (3)
Appl. CrossROAD XL-plugin OLSRD
Create CR entity
PublishService(S_id,port
)
Update Local
Services and
generate OLSR
Msg
Send OLSRMsg
Create
LSU pkt
Verify Global
Services and wait
other nodes
Send nodes list
Setup overlay
CrossROADCrossROAD
15. XL-plugin Architecture (4)XL-plugin Architecture (4)
sendMsg(key,m)
lookup(S_id) Read GlobalServices
and wait nodes list
Verify overlay
consistency
Send nodes list
bestMatch
Appl. CrossROAD XL-plugin OLSRD
sendDestIP
16. Tests and experimental outcomesTests and experimental outcomes
• All the experiments were held in the CNRAll the experiments were held in the CNR
Resarch Area in Pisa (Italy)Resarch Area in Pisa (Italy)
• Laptops used were equipped with Intel PentiumLaptops used were equipped with Intel Pentium
4 and Intel Centrino CPUs4 and Intel Centrino CPUs
• Internal network cards Intel Pro WirelessInternal network cards Intel Pro Wireless
IPW2100 and PCMCIA DLINK DWL 650IPW2100 and PCMCIA DLINK DWL 650
• Nodes B and G were doing exclusively routing activityNodes B and G were doing exclusively routing activity
(UniKOLSR extende with XL-plugin); the remaining nodes(UniKOLSR extende with XL-plugin); the remaining nodes
are art of the CrossROAD or Pastry overlayare art of the CrossROAD or Pastry overlay
F
H G
C B A
D E
18. Delay analysisDelay analysis
• Objective:Objective: assess the time required to build theassess the time required to build the
overlay with CrossROADoverlay with CrossROAD
• First experiment:First experiment: Second node actives theSecond node actives the
overlay at one hop of distance from the firstoverlay at one hop of distance from the first
• Second experiment:Second experiment: Second node actives theSecond node actives the
overlay at 3 hops of distance from the firstoverlay at 3 hops of distance from the first
Delay building theDelay building the
overlayoverlay
First nodeFirst node Other nodesOther nodes
(starting from the(starting from the
second)second)
Second node at 1 hopSecond node at 1 hop
of distanceof distance
180 msec.180 msec. 40 msec.40 msec.
Second node at 3 hopSecond node at 3 hop
of distanceof distance
325 msec.325 msec. 30 msec.30 msec.
19. Mobility and partitioning analysisMobility and partitioning analysis
• Objective:Objective: evaluate CrossROAD in a possibileevaluate CrossROAD in a possibile
mobility scenario and network partitioningmobility scenario and network partitioning
Invia
messaggio
al nodo B
E
DCB
A
x
C
C
Invia
messaggio
al nodo D
C
C
Send a
message to
node B
20. Conclusion and futureConclusion and future
developmentsdevelopments
• The experimental analysis has shown the correctThe experimental analysis has shown the correct
working and the excellent performances of theworking and the excellent performances of the
proposed solutionproposed solution
• Future developments:Future developments:
– Use XL-plugin with other routing protocolsUse XL-plugin with other routing protocols
– Run experiments in medium-big size MANETRun experiments in medium-big size MANET
environments with greater mobilityenvironments with greater mobility
– Verify applications QoS on this type ofVerify applications QoS on this type of
architecturearchitecture