Recently, Content-Centric Networking (CCN) was intr
oduced and is expected as a new concept
of future internet architecture. Even though CCN is
initially studied for wired networks,
recently, it is also studied for wireless environme
nt. In this paper, we discuss improvement
method for efficient content flooding over wireless
CCNs. The proposed scheme of this paper
use MAC Address of nodes when Interest and Data Pac
ket are forwarded in order to limit the
area of flooding of packets. The proposed protocol
not only reduces the spread of Data packets,
but also offers priority of forwarding to nodes of
shortest path. As a consequence, it reduce
content download time which is proved by extensive
simulations.
Recital Study of Various Congestion Control Protocols in wireless networkiosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
A XMLRPC Approach to the Management of Cloud Infrastructureiosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Enhancing Cloud Computing Security for Data Sharing Within Group Membersiosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Adaptive resource allocation and internet traffic engineering on data networkcsandit
This research paper describes the issues of bandwidth allocation, optimum capacity allocation,network operational cost reduction, and improve Internet user experience. Traffic engineering (TE) is used to manipulate network traffic to achieve certain requirements and meets certain
needs. TE becomes one of the most important building blocks in the design of the Internet backbone infrastructure. Research objective: efficient allocation of bandwidth across multiple paths. Optimum path selection. Minimize network traffic delays and maximize bandwidth utilization over multiple network paths. The bandwidth allocation is performed proportionally over multiple paths based on the path capacity.
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.
Admission control for multihop wireless backhaul networks with qo sPfedya
This document proposes several schemes for admission control of connections with quality of service (QoS) requirements over a multihop wireless backhaul network. It first constructs tree topologies connecting wireless backhaul nodes to a wired gateway. It then admits either the best subset of connections while respecting their rate and delay requirements, or admits all connections with appropriate degradation of their QoS requirements. The key contributions are addressing both rate and delay requirements for connections, which has not been done before for wireless backhauls, and providing algorithms for admission control that deterministically guarantee delays.
Centrality-Based Network Coder Placement For Peer-To-Peer Content DistributionIJCNCJournal
Network coding has been shown to achieve optimal multicast throughput, yet at an expensive computation
cost: every node in the network has to code. Interested in minimizing resource consumption of network
coding while maintaining its performance, in this paper, we propose a practical network coder placement
algorithm which achieves comparable content distribution time as network coding, and at the same time,
substantially reduces the number of network coders compared to a full network coding solution in which all
peers have to encode, i.e. become encoders. Our algorithm is derived from two key elements. First, it is
based on the insight that coding at upstream peers eliminates information duplication to downstream peers,
which results in efficient content distribution. Second, our placement strategy exploits centrality
characteristics of the network topology to quickly determine key positions to place encoders. Performance
evaluation using various topology and algorithm parameters confirms the effectiveness of our proposed
method.
Dear Students
Ingenious techno Solution offers an expertise guidance on you Final Year IEEE & Non- IEEE Projects on the following domain
JAVA
.NET
EMBEDDED SYSTEMS
ROBOTICS
MECHANICAL
MATLAB etc
For further details contact us:
enquiry@ingenioustech.in
044-42046028 or 8428302179.
Ingenious Techno Solution
#241/85, 4th floor
Rangarajapuram main road,
Kodambakkam (Power House)
http://www.ingenioustech.in/
Recital Study of Various Congestion Control Protocols in wireless networkiosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
A XMLRPC Approach to the Management of Cloud Infrastructureiosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Enhancing Cloud Computing Security for Data Sharing Within Group Membersiosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Adaptive resource allocation and internet traffic engineering on data networkcsandit
This research paper describes the issues of bandwidth allocation, optimum capacity allocation,network operational cost reduction, and improve Internet user experience. Traffic engineering (TE) is used to manipulate network traffic to achieve certain requirements and meets certain
needs. TE becomes one of the most important building blocks in the design of the Internet backbone infrastructure. Research objective: efficient allocation of bandwidth across multiple paths. Optimum path selection. Minimize network traffic delays and maximize bandwidth utilization over multiple network paths. The bandwidth allocation is performed proportionally over multiple paths based on the path capacity.
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.
Admission control for multihop wireless backhaul networks with qo sPfedya
This document proposes several schemes for admission control of connections with quality of service (QoS) requirements over a multihop wireless backhaul network. It first constructs tree topologies connecting wireless backhaul nodes to a wired gateway. It then admits either the best subset of connections while respecting their rate and delay requirements, or admits all connections with appropriate degradation of their QoS requirements. The key contributions are addressing both rate and delay requirements for connections, which has not been done before for wireless backhauls, and providing algorithms for admission control that deterministically guarantee delays.
Centrality-Based Network Coder Placement For Peer-To-Peer Content DistributionIJCNCJournal
Network coding has been shown to achieve optimal multicast throughput, yet at an expensive computation
cost: every node in the network has to code. Interested in minimizing resource consumption of network
coding while maintaining its performance, in this paper, we propose a practical network coder placement
algorithm which achieves comparable content distribution time as network coding, and at the same time,
substantially reduces the number of network coders compared to a full network coding solution in which all
peers have to encode, i.e. become encoders. Our algorithm is derived from two key elements. First, it is
based on the insight that coding at upstream peers eliminates information duplication to downstream peers,
which results in efficient content distribution. Second, our placement strategy exploits centrality
characteristics of the network topology to quickly determine key positions to place encoders. Performance
evaluation using various topology and algorithm parameters confirms the effectiveness of our proposed
method.
Dear Students
Ingenious techno Solution offers an expertise guidance on you Final Year IEEE & Non- IEEE Projects on the following domain
JAVA
.NET
EMBEDDED SYSTEMS
ROBOTICS
MECHANICAL
MATLAB etc
For further details contact us:
enquiry@ingenioustech.in
044-42046028 or 8428302179.
Ingenious Techno Solution
#241/85, 4th floor
Rangarajapuram main road,
Kodambakkam (Power House)
http://www.ingenioustech.in/
This document proposes a new zone-based bandwidth allocation protocol for wireless networks. The key points are:
1. It divides the network into zones based on hop count from the initial relay station, and allocates bandwidth to each zone to improve quality of service.
2. Within each zone, the bandwidth allocated is distributed to mobile users based on their visiting probability and required bandwidth. This aims to maximize the average user satisfaction rate.
3. The protocol is evaluated through simulations using the Network Simulator 2 (NS2) tool. Results show the protocol improves bandwidth allocation efficiency and reduces quality of service degradation compared to other approaches.
Mobile systems face challenges when connecting to Next Generation Networks (NGN) due to differences between circuit-switched mobile networks and the IP-based NGN. A new Base Station Gateway is proposed to provide these connections. NGN aims to reduce costs and offer integrated services via common IP technology, while mobile networks have evolved through generations based on circuit switching and packet technologies. Connecting mobile networks to the NGN backbone allows access to NGN services but requires protocol conversion through mobile media gateways.
This document summarizes a presentation on efficient multimedia delivery in content-centric mobile networks. It discusses:
1) The challenges of today's host-centric communication networks and the promise of content-centric networking (CCN) as a better approach.
2) The state-of-the-art in CCN research related to architecture, routing, mobility management, multi-source content retrieval, and future edge networks.
3) The motivation for the presenter's thesis work, which aims to design a network architecture and routing protocol to efficiently support content delivery in mobile CCNs.
A CELLULAR BONDING AND ADAPTIVE LOAD BALANCING BASED MULTI-SIM GATEWAY FOR MO...pijans
As it is well known, the QoS(quality of service) provided by mobile Internet access point devices is far from
the QoS level offered by the common ADSL modem-router due to several reasons: in fact, mobile Internet
access networks are not designed to support real-time data traffic because of several drawbacks
concerning the wireless medium such as resource sharing, traffic congestion, radio link coverage etc.,
which impact directly such parameters as delay, jitter, and packet loss rate that are strictly connected to
the quality of user experience. The main scope of the present paper is to introduce a dual USIM HSPA
gateway for ad hoc and sensors networks thanks to which it will be possible to guarantee a QoS suitable
for a series of network-centric application such as real-time communications and monitoring, video
surveillance, real-time sensor networks, telemedicine, vehicular and mobile sensor networks and so on. The
main idea is to exploit multiple radio access networks in order to enhance the available end-to-end
bandwidth and the perceived quality of experience. The scope has been reached by combining multiple
radio access with dynamic load balancing and the VPN (virtual private network) bond technique.
CONCEPTUAL FRAMEWORK OF REDUNDANT LINK AGGREGATIONcseij
This is era of information blast. A huge quantity of information is pouring in from various sources. The
revolutionary advancement of Information and Communication technologies bring the world close
together.A pile of information in different formats is just a click away. Which motivate the organizations to
get more internet bandwidth to consume and publish theinformationoverexploding cloudof Internet. The
standard router redundancyprotocolis used to handle backup link showever it cannot aggregate
them.Whereas thelink standard aggregation protocol can aggregate the link but it support only Ethernet
technology.In this researchpaper a concept of Redundant Link Aggregation (RLA)is proposed. RLA can
aggregate and handle backup links with main links regardless of carriertechnology. Furthermore a
dataforwardingmechanism Odd Load Balancing (OLB) is also proposed for RLA scheme. For the sake of
performance evaluation, Redundant Link Aggregation (RLA) is compared with Virtual Router Redundancy
Protocol (VRRP). The simulation result reveals that Redundant Link Aggregation (RLA) can cover the
bandwidth demand of the network in peak hours by consuming backup links as well which with Virtual
Router Redundancy Protocol (VRRP)cannot.It is further noted thatOdd Load Balancing (OLB) feature can
be used to save the cost in terms of money per annum.
Analysis of Link State Resource Reservation Protocol for Congestion Managemen...ijgca
With the wide spread of WiFi hotspots, concentrated traffic workload on Smart Web (SW) can slow down
the network performance. This paper presents a congestion management strategy considering real time
activities in today’s smart web. With the SW context, cooperative packet recovery using resource
reservation procedure for TCP flows was adapted for mitigating packet losses. This is to maintain data
consistency between various access points of smart web hotspot. Using a real world scenario, it was
confirmed that generic TCP cannot handle traffic congestion in a SW hotspot network. With TCP in
scalable workload environments, continuous packet drops at the event of congestion remains obvious. This
is unacceptable for mission critical domains. An enhanced Link State Resource Reservation Protocol (LSRSVP)
which serves as dynamic feedback mechanism in smart web hotspots is presented. The contextual
behaviour was contrasted with the generic TCP model. For the LS-RSVP, a simulation experiment for TCP
connection between servers at the remote core layer and the access layer was carried out while using
selected benchmark metrics. From the results, under realistic workloads, a steady-state throughput
response was achieved by TCP LS-RSVP to about 3650Bits/secs compared with generic TCP plots in a
previous study. Considering network service availability, this was found to be dependent on fault-tolerance
of the hotspot network. From study, a high peak threshold of 0.009 (i.e. 90%) was observed. This shows
fairly acceptable service availability behaviour compared with the existing TCP schemes. For packet drop
effects, an analysis on the network behaviour with respect to the LS-RSVP yielded a drop response of about
0.000106 bits/sec which is much lower compared with the case with generic TCP with over 0.38 bits/sec.
The latency profile of average FTP download response was found to be 0.030secs, but with that of FTP
upload response, this yielded about 0.028 sec. The results from the study demonstrate efficiency and
optimality for realistic loads in Smart web contexts.
This document discusses network provisioning for multimedia services using traffic aggregation. It covers topics like network provisioning, packet aggregation, traffic engineering, dimensioning, traffic analysis and aggregation. Methods are proposed for optimizing network resource reservations to guarantee delay bounds for aggregated multimedia traffic, including using real video traces and generating synthetic aggregates. Network provisioning scenarios are described for provisioning using real traces, dynamic aggregates, traffic patterns, and optimizing bandwidth utilization.
This document provides an overview of the transport layer chapter from the textbook "Computer Networking: A Top Down Approach". It discusses the goals of understanding transport layer services like multiplexing and demultiplexing. It also covers the two main Internet transport protocols - UDP which provides connectionless unreliable data transfer, and TCP which provides connection-oriented reliable data transfer. The document outlines the rest of the chapter which will discuss TCP and UDP in more detail as well as principles of reliable data transfer and congestion control.
PERFORMANCE EVALUATION OF MOBILE IP ON MOBILE AD HOC NETWORKS USING NS2cscpconf
This document summarizes previous work on integrating Mobile IP with mobile ad hoc networks (MANETs) to provide Internet connectivity. It discusses several proposals that implemented Mobile IP on different MANET routing protocols, including proactive protocols like DSDV and reactive protocols like AODV. The document then reviews related work that evaluated the performance of Mobile IP on MANETs using simulations. It concludes by stating that this thesis will further evaluate and compare the performance of Mobile IP implemented on AODV, AOMDV and DSDV routing protocols using the NS2 simulator.
ENERGY CONSUMPTION REDUCTION IN WIRELESS SENSOR NETWORK BASED ON CLUSTERINGIJCNCJournal
One of the important issues in the routing protocol design in Wireless Sensor Networks (WSNs) is
minimizing energy consumption and maximizing network lift time. Nowadays networks and information
systems are one of the main parts of modern life that without them, people cannot live. On the hand, the
impairment of these networks leads to great and incalculable costs. In this paper, a new method based on
clustering has presented that problem of energy consumption is solved. The proposed algorithm is that
energy-based clustering can create clusters of the same energy level and distribute energy efficiency across
the WNS nodes. This proposed clustering protocol classify network nodes based on energy and
neighbourhood criteria and attempts to better balance energy in clusters and ultimately increase network
lifetime and maintain network coverage. Results are shown that the proposed algorithm is on average 40%
better than LEACH algorithm and 14% better than IBLEACH algorithm
this paper they introduced UWMAC, a transmitter-based CDMA MAC protocol for UWASNs that integrates a new closed-loop distributed algorithm to establish the optimum transmit power and code length to decrease the near-far impact. UW-MAC objective is to obtain three goals i.e. low channel access delay, high network throughput and low energy consumption. It is shown that UW-MAC maintains to simultaneously obtain limited channel access delay, high network throughput and low energy consumption in deep water communications, which are not critically influenced by multipath. Fatma Bouabdallah and Raouf Boutaba suggested UW-OFDMAC, a distributed Medium Access Control (MAC) protocol which
Practical active network services within content-aware gatewaysTal Lavian Ph.D.
The Internet has seen an increase in complexity due to the introduction of new types of networking devices and services, particularly at points of discontinuity known as network edges. As the networking industry continues to add revenue generating services at network edges, there is an increasing need to provide a systematic method for dynamically introducing and providing these new services in lieu of the ad-hoc approach that is in use today. To this end we support a phased approach to "activating" the Internet and suggest that there exists an immediate need for realizing Active Networks concepts at the network edges. In this context, we present our efforts towards the development of a Content-aware Active Gateway (CAG) architecture. With the help of two practical services running on our initial prototype, built from commercial networking devices, we give a qualitative and quantitative view of the CAG potential.
Application Aware Topology Generation for Surface Wave Networks-on-Chipzhao fu
This document summarizes a research paper that proposes a new algorithm called the maximal declining sorting algorithm (MDSA) to optimize network-on-chip (NoC) performance and power consumption. The MDSA aims to reduce communication time in NoCs by minimizing the number of hops between cores that communicate frequently. It does this by adding wireless transceivers between cores based on the product of their traffic volume and number of hops. The MDSA is shown to reduce communication time by up to 35.6% compared to the conventional genetic algorithm approach, and also lowers power consumption.
Spatial ReusabilityAware Routing in Multi-Hop Wireless Networks Using Single ...dbpublications
In Multi-hop wireless routing to successfully achieve high end to end throughput .To search a “best” node path from source node to the destination node .A large number of routing protocols use for minimum total transmission count/time for delivering a single packet, such transmission time minimizing protocols cannot be assured to successfully achieve maximum end to end throughput. Considering spatial reusability of the wireless media, increase the end-to-end throughput in multi-hop wireless network. To support a function in spatial reusability-aware Single path routing (SAAP) protocols, It compare with existing protocols, Results provide desired end to end throughputgain is up to 62.7%. and desired end to end delay.
Experimental evaluation of scalability and reliability of a feedback based up...ijma
As a result of rapidly changing traffic characteristics in QoS-enabled networks oftentimes renegotiating
the bandwidth requirements are needed. Once renegotiation is started, the sender keeps this process of
invoking renegotiation until new requirements can be fulfilled (or until connection is eventually
terminated.) The frequency of polling the network is delicate balance between huge traffic overhead traffic
with decreased throughput and under-utilization of the network. While driving optimal follow-up rate is a
hard problem, several efficient solutions have been proposed. We have earlier proposed a Scalable
Feedback Based UPC-Parameters Renegotiation Protocol for ATM networks which gives efficient solution
to this problem. The proposed solution minimizes the overhead by shifting the repeated polling away from
the senders/users. Experimental evaluation of scalability and reliability aspects of our solution is presented
in this paper.
3 S W 2009 I E E E Abstracts Java, N C C T Chennaincct
final Year Projects, Final Year Projects in Chennai, Software Projects, Embedded Projects, Microcontrollers Projects, DSP Projects, VLSI Projects, Matlab Projects, Java Projects, .NET Projects, IEEE Projects, IEEE 2009 Projects, IEEE 2009 Projects, Software, IEEE 2009 Projects, Embedded, Software IEEE 2009 Projects, Embedded IEEE 2009 Projects, Final Year Project Titles, Final Year Project Reports, Final Year Project Review, Robotics Projects, Mechanical Projects, Electrical Projects, Power Electronics Projects, Power System Projects, Model Projects, Java Projects, J2EE Projects, Engineering Projects, Student Projects, Engineering College Projects, MCA Projects, BE Projects, BTech Projects, ME Projects, MTech Projects, Wireless Networks Projects, Network Security Projects, Networking Projects, final year projects, ieee projects, student projects, college projects, ieee projects in chennai, java projects, software ieee projects, embedded ieee projects, "ieee2009projects", "final year projects", "ieee projects", "Engineering Projects", "Final Year Projects in Chennai", "Final year Projects at Chennai", Java Projects, ASP.NET Projects, VB.NET Projects, C# Projects, Visual C++ Projects, Matlab Projects, NS2 Projects, C Projects, Microcontroller Projects, ATMEL Projects, PIC Projects, ARM Projects, DSP Projects, VLSI Projects, FPGA Projects, CPLD Projects, Power Electronics Projects, Electrical Projects, Robotics Projects, Solor Projects, MEMS Projects, J2EE Projects, J2ME Projects, AJAX Projects, Structs Projects, EJB Projects, Real Time Projects, Live Projects, Student Projects, Engineering Projects, MCA Projects, MBA Projects, College Projects, BE Projects, BTech Projects, ME Projects, MTech Projects, M.Sc Projects, Final Year Java Projects, Final Year ASP.NET Projects, Final Year VB.NET Projects, Final Year C# Projects, Final Year Visual C++ Projects, Final Year Matlab Projects, Final Year NS2 Projects, Final Year C Projects, Final Year Microcontroller Projects, Final Year ATMEL Projects, Final Year PIC Projects, Final Year ARM Projects, Final Year DSP Projects, Final Year VLSI Projects, Final Year FPGA Projects, Final Year CPLD Projects, Final Year Power Electronics Projects, Final Year Electrical Projects, Final Year Robotics Projects, Final Year Solor Projects, Final Year MEMS Projects, Final Year J2EE Projects, Final Year J2ME Projects, Final Year AJAX Projects, Final Year Structs Projects, Final Year EJB Projects, Final Year Real Time Projects, Final Year Live Projects, Final Year Student Projects, Final Year Engineering Projects, Final Year MCA Projects, Final Year MBA Projects, Final Year College Projects, Final Year BE Projects, Final Year BTech Projects, Final Year ME Projects, Final Year MTech Projects, Final Year M.Sc Projects, IEEE Java Projects, ASP.NET Projects, VB.NET Projects, C# Projects, Visual C++ Projects, Matlab Projects, NS2 Projects, C Projects, Microcontroller Projects, ATMEL Projects, PIC Projects, ARM Projects, DSP Projects, VLSI Projects, FPGA Projects, CPLD Projects, Power Electronics Projects, Electrical Projects, Robotics Projects, Solor Projects, MEMS Projects, J2EE Projects, J2ME Projects, AJAX Projects, Structs Projects, EJB Projects, Real Time Projects, Live Projects, Student Projects, Engineering Projects, MCA Projects, MBA Projects, College Projects, BE Projects, BTech Projects, ME Projects, MTech Projects, M.Sc Projects, IEEE 2009 Java Projects, IEEE 2009 ASP.NET Projects, IEEE 2009 VB.NET Projects, IEEE 2009 C# Projects, IEEE 2009 Visual C++ Projects, IEEE 2009 Matlab Projects, IEEE 2009 NS2 Projects, IEEE 2009 C Projects, IEEE 2009 Microcontroller Projects, IEEE 2009 ATMEL Projects, IEEE 2009 PIC Projects, IEEE 2009 ARM Projects, IEEE 2009 DSP Projects, IEEE 2009 VLSI Projects, IEEE 2009 FPGA Projects, IEEE 2009 CPLD Projects, IEEE 2009 Power Electronics Projects, IEEE 2009 Electrical Projects, IEEE 2009 Robotics Projects, IEEE 2009 Solor Projects, IEEE 2009 MEMS Projects, IEEE 2009 J2EE P
USABILITY TESTING IN MOBILE APPLICATIONS INVOLVING PEOPLE WITH DOWN SYNDROME:...csandit
We present a review of research related to the usability testing of mobile applications including
participants with Down syndrome. The purpose is to identify good usability testing practices
and possible guidelines for this process when participants are people with this cognitive
disability. These practices and guidelines should account for their specific impairments. We
applied document analysis techniques to searches of scientific databases. The results were
filtered considering how well they matched the research topic. We processed and reported the
classified and summarized results. The main findings of this literature review is that mobile
applications usability testing including people with Down syndrome is an issue that has not be
comprehensively investigated. While there is some related research, this is incomplete, and
there is no single proposal that takes on board all the issues that could be taken into account.
Consequently, we propose to develop guidelines on the usability testing process involving
participants with Down syndrome.
IMPROVING SCHEDULING OF DATA TRANSMISSION IN TDMA SYSTEMScsandit
In an era where communication has a most important role in modern societies, designing efficient
algorithms for data transmission is of the outmost importance. TDMA is a technology used in many
communication systems such as satellites and cell phones. In order to transmit data in such systems we
need to cluster them in packages. To achieve a faster transmission we are allowed to preempt the
transmission of any packet in order to resume at a later time. Such preemptions though come with a delay
in order to setup for the next transmission. In this paper we propose an algorithm which yields improved
transmission scheduling. This algorithm we call MGA. We have proven an approximation ratio for MGA
and ran experiments to establish that it works even better in practice. In order to conclude that MGA will
be a very helpful tool in constructing an improved schedule for packet routing using preemtion with a setup
cost, we compare its results to two other efficient algorithms designed by researchers in the past.
Nonlinear Extension of Asymmetric Garch Model within Neural Network Framework csandit
The importance of volatility for all market partici
pants has led to the development and
application of various econometric models. The most
popular models in modelling volatility are
GARCH type models because they can account excess k
urtosis and asymmetric effects of
financial time series. Since standard GARCH(1,1) mo
del usually indicate high persistence in the
conditional variance, the empirical researches turn
ed to GJR-GARCH model and reveal its
superiority in fitting the asymmetric heteroscedast
icity in the data. In order to capture both
asymmetry and nonlinearity in data, the goal of thi
s paper is to develop a parsimonious NN
model as an extension to GJR-GARCH model and to det
ermine if GJR-GARCH-NN outperforms
the GJR-GARCH model.
AUTOMATED SHORT ANSWER GRADER USING FRIENDSHIP GRAPHScsandit
The paper proposes a method to assess short answer written by student using friendship matrix,
representation of friendship graph. The Short Answer is a type of answer which is based on
facts. These answers are quite different from long answers and Multiple Choice Question
(MCQ) type answers. The friendship graph is a graph which is based on friendship condition
i.e. the nodes have only one common neighbor. Friendship matrix is the matrix form of the
friendship graph. The student answer is stored in a friendship matrix and the teacher answer is
stored in another friendship matrix and both the matrices are compared. Based on the number
of errors encountered from student answer an error marks is calculated and that number is
subtracted from full marks to get student grade.
This paper stresses on the need of using Knowledge Management (KM) in the higher education
institutions of Saudi Arabia. The paper is based on the literature review and personal experience of the author in the education sector.The paper aims at highlighting the importance of KM for the educational institutions
particularly for developing countries. It also reviews the readiness of Saudi Arabia for KM application by illustrating different development initiatives taken by the Saudi government in different sectors. However, the literature also identifies many barriers on the way. Keeping the importance of KM for the higher education institutions in view, this paper proposes to adopt the model of Library Knowledge Management Center (LKMC) with needed
modifications for Universities of Saudi Arabia. This LKMC model was proposed by Parker,Nitse, and Flowers (2005) for the small business corporate for providing the Knowledge Management (KM) and Competitive Intelligence (CI) services. The paper discusses different components of the LKMC model and their relevance to the education sector.
Many virtual reality applications, such as training, urban design or gaming are based on a rich
semantic description of the environment. This paper describes a new representation of semantic
virtual worlds. Our model, called SVHsIEVs1should provide a consistent representation of the
following aspects: the simulated environment, its structure, and the knowledge items using
ontology, interactions and tasks that virtual humans can perform in the environment. Our first
main contribution is to show the influence of semantic virtual objects on the environment. Our
second main contribution is to use these semantic informations to manage he tasks of each
virtual object. We propose to define each task by a set of attributes and relationships, which
determines the links between attributes in tasks, and links between other tasks. The architecture
has been successfully tested in 3D dynamic environments for navigation in virtual urban
environments.
This document proposes a new zone-based bandwidth allocation protocol for wireless networks. The key points are:
1. It divides the network into zones based on hop count from the initial relay station, and allocates bandwidth to each zone to improve quality of service.
2. Within each zone, the bandwidth allocated is distributed to mobile users based on their visiting probability and required bandwidth. This aims to maximize the average user satisfaction rate.
3. The protocol is evaluated through simulations using the Network Simulator 2 (NS2) tool. Results show the protocol improves bandwidth allocation efficiency and reduces quality of service degradation compared to other approaches.
Mobile systems face challenges when connecting to Next Generation Networks (NGN) due to differences between circuit-switched mobile networks and the IP-based NGN. A new Base Station Gateway is proposed to provide these connections. NGN aims to reduce costs and offer integrated services via common IP technology, while mobile networks have evolved through generations based on circuit switching and packet technologies. Connecting mobile networks to the NGN backbone allows access to NGN services but requires protocol conversion through mobile media gateways.
This document summarizes a presentation on efficient multimedia delivery in content-centric mobile networks. It discusses:
1) The challenges of today's host-centric communication networks and the promise of content-centric networking (CCN) as a better approach.
2) The state-of-the-art in CCN research related to architecture, routing, mobility management, multi-source content retrieval, and future edge networks.
3) The motivation for the presenter's thesis work, which aims to design a network architecture and routing protocol to efficiently support content delivery in mobile CCNs.
A CELLULAR BONDING AND ADAPTIVE LOAD BALANCING BASED MULTI-SIM GATEWAY FOR MO...pijans
As it is well known, the QoS(quality of service) provided by mobile Internet access point devices is far from
the QoS level offered by the common ADSL modem-router due to several reasons: in fact, mobile Internet
access networks are not designed to support real-time data traffic because of several drawbacks
concerning the wireless medium such as resource sharing, traffic congestion, radio link coverage etc.,
which impact directly such parameters as delay, jitter, and packet loss rate that are strictly connected to
the quality of user experience. The main scope of the present paper is to introduce a dual USIM HSPA
gateway for ad hoc and sensors networks thanks to which it will be possible to guarantee a QoS suitable
for a series of network-centric application such as real-time communications and monitoring, video
surveillance, real-time sensor networks, telemedicine, vehicular and mobile sensor networks and so on. The
main idea is to exploit multiple radio access networks in order to enhance the available end-to-end
bandwidth and the perceived quality of experience. The scope has been reached by combining multiple
radio access with dynamic load balancing and the VPN (virtual private network) bond technique.
CONCEPTUAL FRAMEWORK OF REDUNDANT LINK AGGREGATIONcseij
This is era of information blast. A huge quantity of information is pouring in from various sources. The
revolutionary advancement of Information and Communication technologies bring the world close
together.A pile of information in different formats is just a click away. Which motivate the organizations to
get more internet bandwidth to consume and publish theinformationoverexploding cloudof Internet. The
standard router redundancyprotocolis used to handle backup link showever it cannot aggregate
them.Whereas thelink standard aggregation protocol can aggregate the link but it support only Ethernet
technology.In this researchpaper a concept of Redundant Link Aggregation (RLA)is proposed. RLA can
aggregate and handle backup links with main links regardless of carriertechnology. Furthermore a
dataforwardingmechanism Odd Load Balancing (OLB) is also proposed for RLA scheme. For the sake of
performance evaluation, Redundant Link Aggregation (RLA) is compared with Virtual Router Redundancy
Protocol (VRRP). The simulation result reveals that Redundant Link Aggregation (RLA) can cover the
bandwidth demand of the network in peak hours by consuming backup links as well which with Virtual
Router Redundancy Protocol (VRRP)cannot.It is further noted thatOdd Load Balancing (OLB) feature can
be used to save the cost in terms of money per annum.
Analysis of Link State Resource Reservation Protocol for Congestion Managemen...ijgca
With the wide spread of WiFi hotspots, concentrated traffic workload on Smart Web (SW) can slow down
the network performance. This paper presents a congestion management strategy considering real time
activities in today’s smart web. With the SW context, cooperative packet recovery using resource
reservation procedure for TCP flows was adapted for mitigating packet losses. This is to maintain data
consistency between various access points of smart web hotspot. Using a real world scenario, it was
confirmed that generic TCP cannot handle traffic congestion in a SW hotspot network. With TCP in
scalable workload environments, continuous packet drops at the event of congestion remains obvious. This
is unacceptable for mission critical domains. An enhanced Link State Resource Reservation Protocol (LSRSVP)
which serves as dynamic feedback mechanism in smart web hotspots is presented. The contextual
behaviour was contrasted with the generic TCP model. For the LS-RSVP, a simulation experiment for TCP
connection between servers at the remote core layer and the access layer was carried out while using
selected benchmark metrics. From the results, under realistic workloads, a steady-state throughput
response was achieved by TCP LS-RSVP to about 3650Bits/secs compared with generic TCP plots in a
previous study. Considering network service availability, this was found to be dependent on fault-tolerance
of the hotspot network. From study, a high peak threshold of 0.009 (i.e. 90%) was observed. This shows
fairly acceptable service availability behaviour compared with the existing TCP schemes. For packet drop
effects, an analysis on the network behaviour with respect to the LS-RSVP yielded a drop response of about
0.000106 bits/sec which is much lower compared with the case with generic TCP with over 0.38 bits/sec.
The latency profile of average FTP download response was found to be 0.030secs, but with that of FTP
upload response, this yielded about 0.028 sec. The results from the study demonstrate efficiency and
optimality for realistic loads in Smart web contexts.
This document discusses network provisioning for multimedia services using traffic aggregation. It covers topics like network provisioning, packet aggregation, traffic engineering, dimensioning, traffic analysis and aggregation. Methods are proposed for optimizing network resource reservations to guarantee delay bounds for aggregated multimedia traffic, including using real video traces and generating synthetic aggregates. Network provisioning scenarios are described for provisioning using real traces, dynamic aggregates, traffic patterns, and optimizing bandwidth utilization.
This document provides an overview of the transport layer chapter from the textbook "Computer Networking: A Top Down Approach". It discusses the goals of understanding transport layer services like multiplexing and demultiplexing. It also covers the two main Internet transport protocols - UDP which provides connectionless unreliable data transfer, and TCP which provides connection-oriented reliable data transfer. The document outlines the rest of the chapter which will discuss TCP and UDP in more detail as well as principles of reliable data transfer and congestion control.
PERFORMANCE EVALUATION OF MOBILE IP ON MOBILE AD HOC NETWORKS USING NS2cscpconf
This document summarizes previous work on integrating Mobile IP with mobile ad hoc networks (MANETs) to provide Internet connectivity. It discusses several proposals that implemented Mobile IP on different MANET routing protocols, including proactive protocols like DSDV and reactive protocols like AODV. The document then reviews related work that evaluated the performance of Mobile IP on MANETs using simulations. It concludes by stating that this thesis will further evaluate and compare the performance of Mobile IP implemented on AODV, AOMDV and DSDV routing protocols using the NS2 simulator.
ENERGY CONSUMPTION REDUCTION IN WIRELESS SENSOR NETWORK BASED ON CLUSTERINGIJCNCJournal
One of the important issues in the routing protocol design in Wireless Sensor Networks (WSNs) is
minimizing energy consumption and maximizing network lift time. Nowadays networks and information
systems are one of the main parts of modern life that without them, people cannot live. On the hand, the
impairment of these networks leads to great and incalculable costs. In this paper, a new method based on
clustering has presented that problem of energy consumption is solved. The proposed algorithm is that
energy-based clustering can create clusters of the same energy level and distribute energy efficiency across
the WNS nodes. This proposed clustering protocol classify network nodes based on energy and
neighbourhood criteria and attempts to better balance energy in clusters and ultimately increase network
lifetime and maintain network coverage. Results are shown that the proposed algorithm is on average 40%
better than LEACH algorithm and 14% better than IBLEACH algorithm
this paper they introduced UWMAC, a transmitter-based CDMA MAC protocol for UWASNs that integrates a new closed-loop distributed algorithm to establish the optimum transmit power and code length to decrease the near-far impact. UW-MAC objective is to obtain three goals i.e. low channel access delay, high network throughput and low energy consumption. It is shown that UW-MAC maintains to simultaneously obtain limited channel access delay, high network throughput and low energy consumption in deep water communications, which are not critically influenced by multipath. Fatma Bouabdallah and Raouf Boutaba suggested UW-OFDMAC, a distributed Medium Access Control (MAC) protocol which
Practical active network services within content-aware gatewaysTal Lavian Ph.D.
The Internet has seen an increase in complexity due to the introduction of new types of networking devices and services, particularly at points of discontinuity known as network edges. As the networking industry continues to add revenue generating services at network edges, there is an increasing need to provide a systematic method for dynamically introducing and providing these new services in lieu of the ad-hoc approach that is in use today. To this end we support a phased approach to "activating" the Internet and suggest that there exists an immediate need for realizing Active Networks concepts at the network edges. In this context, we present our efforts towards the development of a Content-aware Active Gateway (CAG) architecture. With the help of two practical services running on our initial prototype, built from commercial networking devices, we give a qualitative and quantitative view of the CAG potential.
Application Aware Topology Generation for Surface Wave Networks-on-Chipzhao fu
This document summarizes a research paper that proposes a new algorithm called the maximal declining sorting algorithm (MDSA) to optimize network-on-chip (NoC) performance and power consumption. The MDSA aims to reduce communication time in NoCs by minimizing the number of hops between cores that communicate frequently. It does this by adding wireless transceivers between cores based on the product of their traffic volume and number of hops. The MDSA is shown to reduce communication time by up to 35.6% compared to the conventional genetic algorithm approach, and also lowers power consumption.
Spatial ReusabilityAware Routing in Multi-Hop Wireless Networks Using Single ...dbpublications
In Multi-hop wireless routing to successfully achieve high end to end throughput .To search a “best” node path from source node to the destination node .A large number of routing protocols use for minimum total transmission count/time for delivering a single packet, such transmission time minimizing protocols cannot be assured to successfully achieve maximum end to end throughput. Considering spatial reusability of the wireless media, increase the end-to-end throughput in multi-hop wireless network. To support a function in spatial reusability-aware Single path routing (SAAP) protocols, It compare with existing protocols, Results provide desired end to end throughputgain is up to 62.7%. and desired end to end delay.
Experimental evaluation of scalability and reliability of a feedback based up...ijma
As a result of rapidly changing traffic characteristics in QoS-enabled networks oftentimes renegotiating
the bandwidth requirements are needed. Once renegotiation is started, the sender keeps this process of
invoking renegotiation until new requirements can be fulfilled (or until connection is eventually
terminated.) The frequency of polling the network is delicate balance between huge traffic overhead traffic
with decreased throughput and under-utilization of the network. While driving optimal follow-up rate is a
hard problem, several efficient solutions have been proposed. We have earlier proposed a Scalable
Feedback Based UPC-Parameters Renegotiation Protocol for ATM networks which gives efficient solution
to this problem. The proposed solution minimizes the overhead by shifting the repeated polling away from
the senders/users. Experimental evaluation of scalability and reliability aspects of our solution is presented
in this paper.
3 S W 2009 I E E E Abstracts Java, N C C T Chennaincct
final Year Projects, Final Year Projects in Chennai, Software Projects, Embedded Projects, Microcontrollers Projects, DSP Projects, VLSI Projects, Matlab Projects, Java Projects, .NET Projects, IEEE Projects, IEEE 2009 Projects, IEEE 2009 Projects, Software, IEEE 2009 Projects, Embedded, Software IEEE 2009 Projects, Embedded IEEE 2009 Projects, Final Year Project Titles, Final Year Project Reports, Final Year Project Review, Robotics Projects, Mechanical Projects, Electrical Projects, Power Electronics Projects, Power System Projects, Model Projects, Java Projects, J2EE Projects, Engineering Projects, Student Projects, Engineering College Projects, MCA Projects, BE Projects, BTech Projects, ME Projects, MTech Projects, Wireless Networks Projects, Network Security Projects, Networking Projects, final year projects, ieee projects, student projects, college projects, ieee projects in chennai, java projects, software ieee projects, embedded ieee projects, "ieee2009projects", "final year projects", "ieee projects", "Engineering Projects", "Final Year Projects in Chennai", "Final year Projects at Chennai", Java Projects, ASP.NET Projects, VB.NET Projects, C# Projects, Visual C++ Projects, Matlab Projects, NS2 Projects, C Projects, Microcontroller Projects, ATMEL Projects, PIC Projects, ARM Projects, DSP Projects, VLSI Projects, FPGA Projects, CPLD Projects, Power Electronics Projects, Electrical Projects, Robotics Projects, Solor Projects, MEMS Projects, J2EE Projects, J2ME Projects, AJAX Projects, Structs Projects, EJB Projects, Real Time Projects, Live Projects, Student Projects, Engineering Projects, MCA Projects, MBA Projects, College Projects, BE Projects, BTech Projects, ME Projects, MTech Projects, M.Sc Projects, Final Year Java Projects, Final Year ASP.NET Projects, Final Year VB.NET Projects, Final Year C# Projects, Final Year Visual C++ Projects, Final Year Matlab Projects, Final Year NS2 Projects, Final Year C Projects, Final Year Microcontroller Projects, Final Year ATMEL Projects, Final Year PIC Projects, Final Year ARM Projects, Final Year DSP Projects, Final Year VLSI Projects, Final Year FPGA Projects, Final Year CPLD Projects, Final Year Power Electronics Projects, Final Year Electrical Projects, Final Year Robotics Projects, Final Year Solor Projects, Final Year MEMS Projects, Final Year J2EE Projects, Final Year J2ME Projects, Final Year AJAX Projects, Final Year Structs Projects, Final Year EJB Projects, Final Year Real Time Projects, Final Year Live Projects, Final Year Student Projects, Final Year Engineering Projects, Final Year MCA Projects, Final Year MBA Projects, Final Year College Projects, Final Year BE Projects, Final Year BTech Projects, Final Year ME Projects, Final Year MTech Projects, Final Year M.Sc Projects, IEEE Java Projects, ASP.NET Projects, VB.NET Projects, C# Projects, Visual C++ Projects, Matlab Projects, NS2 Projects, C Projects, Microcontroller Projects, ATMEL Projects, PIC Projects, ARM Projects, DSP Projects, VLSI Projects, FPGA Projects, CPLD Projects, Power Electronics Projects, Electrical Projects, Robotics Projects, Solor Projects, MEMS Projects, J2EE Projects, J2ME Projects, AJAX Projects, Structs Projects, EJB Projects, Real Time Projects, Live Projects, Student Projects, Engineering Projects, MCA Projects, MBA Projects, College Projects, BE Projects, BTech Projects, ME Projects, MTech Projects, M.Sc Projects, IEEE 2009 Java Projects, IEEE 2009 ASP.NET Projects, IEEE 2009 VB.NET Projects, IEEE 2009 C# Projects, IEEE 2009 Visual C++ Projects, IEEE 2009 Matlab Projects, IEEE 2009 NS2 Projects, IEEE 2009 C Projects, IEEE 2009 Microcontroller Projects, IEEE 2009 ATMEL Projects, IEEE 2009 PIC Projects, IEEE 2009 ARM Projects, IEEE 2009 DSP Projects, IEEE 2009 VLSI Projects, IEEE 2009 FPGA Projects, IEEE 2009 CPLD Projects, IEEE 2009 Power Electronics Projects, IEEE 2009 Electrical Projects, IEEE 2009 Robotics Projects, IEEE 2009 Solor Projects, IEEE 2009 MEMS Projects, IEEE 2009 J2EE P
USABILITY TESTING IN MOBILE APPLICATIONS INVOLVING PEOPLE WITH DOWN SYNDROME:...csandit
We present a review of research related to the usability testing of mobile applications including
participants with Down syndrome. The purpose is to identify good usability testing practices
and possible guidelines for this process when participants are people with this cognitive
disability. These practices and guidelines should account for their specific impairments. We
applied document analysis techniques to searches of scientific databases. The results were
filtered considering how well they matched the research topic. We processed and reported the
classified and summarized results. The main findings of this literature review is that mobile
applications usability testing including people with Down syndrome is an issue that has not be
comprehensively investigated. While there is some related research, this is incomplete, and
there is no single proposal that takes on board all the issues that could be taken into account.
Consequently, we propose to develop guidelines on the usability testing process involving
participants with Down syndrome.
IMPROVING SCHEDULING OF DATA TRANSMISSION IN TDMA SYSTEMScsandit
In an era where communication has a most important role in modern societies, designing efficient
algorithms for data transmission is of the outmost importance. TDMA is a technology used in many
communication systems such as satellites and cell phones. In order to transmit data in such systems we
need to cluster them in packages. To achieve a faster transmission we are allowed to preempt the
transmission of any packet in order to resume at a later time. Such preemptions though come with a delay
in order to setup for the next transmission. In this paper we propose an algorithm which yields improved
transmission scheduling. This algorithm we call MGA. We have proven an approximation ratio for MGA
and ran experiments to establish that it works even better in practice. In order to conclude that MGA will
be a very helpful tool in constructing an improved schedule for packet routing using preemtion with a setup
cost, we compare its results to two other efficient algorithms designed by researchers in the past.
Nonlinear Extension of Asymmetric Garch Model within Neural Network Framework csandit
The importance of volatility for all market partici
pants has led to the development and
application of various econometric models. The most
popular models in modelling volatility are
GARCH type models because they can account excess k
urtosis and asymmetric effects of
financial time series. Since standard GARCH(1,1) mo
del usually indicate high persistence in the
conditional variance, the empirical researches turn
ed to GJR-GARCH model and reveal its
superiority in fitting the asymmetric heteroscedast
icity in the data. In order to capture both
asymmetry and nonlinearity in data, the goal of thi
s paper is to develop a parsimonious NN
model as an extension to GJR-GARCH model and to det
ermine if GJR-GARCH-NN outperforms
the GJR-GARCH model.
AUTOMATED SHORT ANSWER GRADER USING FRIENDSHIP GRAPHScsandit
The paper proposes a method to assess short answer written by student using friendship matrix,
representation of friendship graph. The Short Answer is a type of answer which is based on
facts. These answers are quite different from long answers and Multiple Choice Question
(MCQ) type answers. The friendship graph is a graph which is based on friendship condition
i.e. the nodes have only one common neighbor. Friendship matrix is the matrix form of the
friendship graph. The student answer is stored in a friendship matrix and the teacher answer is
stored in another friendship matrix and both the matrices are compared. Based on the number
of errors encountered from student answer an error marks is calculated and that number is
subtracted from full marks to get student grade.
This paper stresses on the need of using Knowledge Management (KM) in the higher education
institutions of Saudi Arabia. The paper is based on the literature review and personal experience of the author in the education sector.The paper aims at highlighting the importance of KM for the educational institutions
particularly for developing countries. It also reviews the readiness of Saudi Arabia for KM application by illustrating different development initiatives taken by the Saudi government in different sectors. However, the literature also identifies many barriers on the way. Keeping the importance of KM for the higher education institutions in view, this paper proposes to adopt the model of Library Knowledge Management Center (LKMC) with needed
modifications for Universities of Saudi Arabia. This LKMC model was proposed by Parker,Nitse, and Flowers (2005) for the small business corporate for providing the Knowledge Management (KM) and Competitive Intelligence (CI) services. The paper discusses different components of the LKMC model and their relevance to the education sector.
Many virtual reality applications, such as training, urban design or gaming are based on a rich
semantic description of the environment. This paper describes a new representation of semantic
virtual worlds. Our model, called SVHsIEVs1should provide a consistent representation of the
following aspects: the simulated environment, its structure, and the knowledge items using
ontology, interactions and tasks that virtual humans can perform in the environment. Our first
main contribution is to show the influence of semantic virtual objects on the environment. Our
second main contribution is to use these semantic informations to manage he tasks of each
virtual object. We propose to define each task by a set of attributes and relationships, which
determines the links between attributes in tasks, and links between other tasks. The architecture
has been successfully tested in 3D dynamic environments for navigation in virtual urban
environments.
Improved algorithm for road region segmentation based on sequential monte car...csandit
In recent years, many researchers and car makers put a lot of intensive effort into development
of autonomous driving systems. Since visual information is the main modality used by human
driver, a camera mounted on moving platform is very important kind of sensor, and various
computer vision algorithms to handle vehicle surrounding situation are under intensive
research. Our final goal is to develop a vision based lane detection system with ability to
handle various types of road shapes, working on both structured and unstructured roads, ideally
under presence of shadows. This paper presents a modified road region segmentation algorithm
based on sequential Monte-Carlo estimation. Detailed description of the algorithm is given,
and evaluation results show that the proposed algorithm outperforms the segmentation
algorithm developed as a part of our previous work, as well as an conventional algorithm based
on colour histogram.
Investigation of Chaotic-Type Features in Hyperspectral Satellite Datacsandit
This document analyzes the use of Lyapunov exponents to determine chaotic structure in hyperspectral satellite data. It investigates an EO-1 Hyperion hyperspectral image of a mixed forest site in Turkey. Lyapunov exponents are calculated from reconstructed phase spaces of spectral signals for different object classes. Positive and negative Lyapunov exponents indicate chaotic behavior is present. The results demonstrate Lyapunov exponents can be used as discriminative features to improve hyperspectral image classification accuracy by capturing the chaotic structures in the data.
The Effect of Social Welfare System Based on the Complex Networkcsandit
With the passage of time, the development of communication technology and transportation
broke the isolation among people. Relationship tends to be complicated, pluralism, dynamism.
In the network where interpersonal relationship and evolved complex net based on game theory
work serve respectively as foundation architecture and theoretical model, with the combination
of game theory and regard public welfare as influencing factor, we artificially initialize that
closed network system. Through continual loop operation of the program ,we summarize the
changing rule of the cooperative behavior in the interpersonal relationship, so that we can
analyze the policies about welfare system about whole network and the relationship of
frequency of betrayal in cooperative behavior. Most analytical data come from some simple
investigations and some estimates based on internet and environment and the study put
emphasis on simulating social network and analyze influence of social welfare system on
Cooperative Behavior .
Comparative Performance Analysis of Machine Learning Techniques for Software ...csandit
Machine learning techniques can be used to analyse data from different perspectives and enable
developers to retrieve useful information. Machine learning techniques are proven to be useful
in terms of software bug prediction. In this paper, a comparative performance analysis of
different machine learning techniques is explored for software bug prediction on public
available data sets. Results showed most of the machine learning methods performed well on
software bug datasets.
The Chaotic Structure of Bacterial Virulence Protein Sequencescsandit
This document discusses analyzing the chaotic structure of bacterial virulence protein sequences using their amino acid physicochemical properties. It proposes a method involving two main steps: 1) Analyzing the amino acid sequence of a given protein using Lyapunov exponents to determine if it exhibits chaotic behavior according to chaos theory. 2) If the results characterize the complete distribution in phase space like a deterministic system, the related protein is considered to have a chaotic structure. The method is tested on adhesin and non-adhesin protein datasets. Results show that physicochemical feature vectors generated from the chaotic structure analysis perform best for classification, supporting the hypothesis that bacterial virulence protein sequences have chaotic structures derived from the physicochemical properties of their constituent amino acids
Implemenation of Vedic Multiplier Using Reversible Gates csandit
With DSP applications evolving continuously, there is continuous need for improved multipliers which are faster and power efficient. Reversible logic is a new and promising field which addresses the problem of power dissipation. It has been shown to consume zero power theoretically. Vedic mathematics techniques have always proven to be fast and efficient for solving various problems. Therefore, in this paper we implement Urdhva Tiryagbhyam algorithm using reversible logic thereby addressing two important issues – speed and power consumption of implementation of multipliers. In this work, the design of 4x4 Vedic multiplier is optimized by reducing the number of logic gates, constant inputs, and garbage outputs. This multiplier can find its application in various fields like convolution, filter applications, cryptography, and communication.
Fault-Tolerance Aware Multi Objective Scheduling Algorithm for Task Schedulin...csandit
Computational Grid (CG) creates a large heterogeneous and distributed paradigm to manage and execute the applications which are computationally intensive. In grid scheduling tasks are assigned to the proper processors in the grid system to for its execution by considering the execution policy and the optimization objectives. In this paper, makespan and the faulttolerance of the computational nodes of the grid which are the two important parameters for the task execution, are considered and tried to optimize it. As the grid scheduling is considered to be NP-Hard, so a meta-heuristics evolutionary based techniques are often used to find a solution for this. We have proposed a NSGA II for this purpose. The performance estimation ofthe proposed Fault tolerance Aware NSGA II (FTNSGA II) has been done by writing program in Matlab. The simulation results evaluates the performance of the all proposed algorithm and the results of proposed model is compared with existing model Min-Min and Max-Min algorithm which proves effectiveness of the model.
QOS-B ASED P ERFORMANCE E VALUATION OF C HANNEL -A WARE /QOS-A WARE S CHEDULI...csandit
This document evaluates the quality of service performance of three channel-aware/QoS-aware scheduling algorithms (Modified Largest Weighted Delay First, Exponential Rule, Logarithmic Rule) for video applications over LTE and LTE-Advanced networks. It first provides background on LTE network architecture and operation. It then describes how the simulator was modified to implement carrier aggregation in LTE-Advanced, allowing evaluation of scheduling performance with increased bandwidth. Simulation results show that carrier aggregation improved average throughput, reduced packet loss and delay, and increased fairness compared to LTE without aggregation.
O N T HE D ISTRIBUTION OF T HE M AXIMAL C LIQUE S IZE F OR T HE V ERTICES IN ...csandit
The high-level contributions of this paper are as f
ollows: We modify an existing branch-and-
bound based exact algorithm (for maximum clique siz
e of an entire graph) to determine the
maximal clique size that the individual vertices in
the graph are part of. We then run this
algorithm on six real-world network graphs (ranging
from random networks to scale-free
networks) and analyze the distribution of the maxim
al clique size of the vertices in these graphs.
We observe five of the six real-world network graph
s to exhibit a Poisson-style distribution for
the maximal clique size of the vertices. We analyze
the correlation between the maximal clique
size and the clustering coefficient of the vertices
, and find these two metrics to be poorly
correlated for the real-world network graphs. Final
ly, we analyze the Assortativity index of the
vertices of the real-world network graphs and obser
ve the graphs to exhibit positive
assortativity with respect to maximal clique size a
nd negative assortativity with respect to node
degree; nevertheless, we observe the Assortativity
index of the real-world network graphs with
respect to both the maximal clique size and node de
gree to increase with decrease in the
spectral radius ratio for node degree, indicating a
positive correlation between the maximal
clique size and node degree.
IMAGE REGISTRATION USING ADVANCED TOPOLOGY PRESERVING RELAXATION LABELING csandit
This paper presents a relaxation labeling technique with newly defined compatibility measures
for solving a general non-rigid point matching problem. In the literature, there exists a point
matching method using relaxation labeling, however, the compatibility coefficients always take
a binary value zero or one depending on whether a point and a neighboring point have
corresponding points. Our approach generalizes this relaxation labeling approach. The
compatibility coefficients take n-discrete values which measures the correlation between edges.
We use log-polar diagram to compute correlations. Through simulations, we show that this
topology preserving relaxation method improves the matching performance significantly
compared to other state-of-the-art algorithms such as shape context, thin plate spline-robust
point matching, robust point matching by preserving local neighborhood structures and
coherent point drift.
Associating events with people on social networks using a prioricsandit
In social media, same news or events are associated with two or more people, sometimes with different perspective. The representation of the news or events varies from person to person, perspective to perspective or time to time. In this paper, we present a simple model to associate
events with different people (Personalities). To demonstrate our model, we have used real world social networks data (i.e. from Twitter) and results show the accuracy of the model.
X-TREPAN : A Multi Class Regression and Adapted Extraction of Comprehensible ...csandit
The document describes an algorithm called X-TREPAN that extracts decision trees from trained neural networks. X-TREPAN is an enhancement of the TREPAN algorithm that allows it to handle both multi-class classification and multi-class regression problems. It can also analyze generalized feed forward networks. The algorithm was tested on several real-world datasets and was found to generate decision trees with good classification accuracy while also maintaining comprehensibility.
The document provides an overview of Janet Abbate's book "Inventing the Internet" which explores the history of the development of the Internet from 1959 to 1994. The book examines the social and cultural factors influencing the Internet's evolution from ARPANET to a global network. It analyzes how the Internet was shaped by collaboration and conflict between various players including government, military, computer scientists, and businesses. The author traces the technological development of the Internet and links it to organizational, social, and cultural changes during that period.
The project aims to implement Multi-Interface Multi-Channel (MIMC) for hybrid wireless mesh networks to improve performance metrics like packet loss, throughput, and delay. It will enhance the Optimized Link State Routing (OLSR) protocol to incorporate MIMC by evaluating channel quality, selecting best channels, and using an enhanced routing metric considering channel alternation, quality, and hop count. The implementation will be done in C++ using the NS-2 network simulator, for which a multiple interface plugin is already available, making the project technically feasible.
Evaluating content-centric communication over power line communication infras...Khaled Ben Driss
"Evaluating content-centric networking over PLC infrastructure for smart grids" (ci-joint), cet article sera présenté à la conférence AWICT du 07 au 09 Octobre 2015 (http://www.awict.net/)
ANALYSIS OF LINK STATE RESOURCE RESERVATION PROTOCOL FOR CONGESTION MANAGEMEN...ijgca
With the wide spread of WiFi hotspots, concentrated traffic workload on Smart Web (SW) can slow down the network performance. This paper presents a congestion management strategy considering real time activities in today’s smart web. With the SW context, cooperative packet recovery using resource reservation procedure for TCP flows was adapted for mitigating packet losses. This is to maintain data consistency between various access points of smart web hotspot. Using a real world scenario, it was confirmed that generic TCP cannot handle traffic congestion in a SW hotspot network. With TCP in scalable workload environments, continuous packet drops at the event of congestion remains obvious. This is unacceptable for mission critical domains. An enhanced Link State Resource Reservation Protocol (LSRSVP) which serves as dynamic feedback mechanism in smart web hotspots is presented. The contextual behaviour was contrasted with the generic TCP model. For the LS-RSVP, a simulation experiment for TCP connection between servers at the remote core layer and the access layer was carried out while using selected benchmark metrics. From the results, under realistic workloads, a steady-state throughput response was achieved by TCP LS-RSVP to about 3650Bits/secs compared with generic TCP plots in a previous study. Considering network service availability, this was found to be dependent on fault-tolerance of the hotspot network. From study, a high peak threshold of 0.009 (i.e. 90%) was observed. This shows fairly acceptable service availability behaviour compared with the existing TCP schemes. For packet drop effects, an analysis on the network behaviour with respect to the LS-RSVP yielded a drop response of about 0.000106 bits/sec which is much lower compared with the case with generic TCP with over 0.38 bits/sec. The latency profile of average FTP download response was found to be 0.030secs, but with that of FTP upload response, this yielded about 0.028 sec. The results from the study demonstrate efficiency and optimality for realistic loads in Smart web contexts.
Secured Seamless Wi-Fi Enhancement in Dynamic Vehiclesijcnes
At present, cellular networks provide ubiquitous Internet connection, but with relatively expensive cost. Furthermore, the cellular networks have been proven to be insufficient for the surging amount of data from Internet enabled mobile devices. Due to the explosive growth of the subscriber number and the mobile data, cellular networks are suffering overload, and the users are experiencing service quality degradation. In this project implement seamless and efficient Wi-Fi based Internet access from moving vehicles. In our proposed implementation, a group of APs are employed to communicate with a client (called AP diversity), and the transmission succeeds if any AP in the group accomplishes the delivery with the client (called opportunistic transmission). Such AP diversity and opportunistic transmission are exploited to overcome the high packet loss rate, which is achieved by configuring all the APs with the same MAC and IP addresses. With such a configuration, a client gets a graceful illusion that only one (virtual) AP exists, and will always be associated with this virtual AP. Uplink communications, when the client transmits a packet to the virtual AP, actually multiple APs within its transmission range are able to receive it. The transmission is successful as long as at least one AP receives the packet correctly. Proposed implementation will show that outperforms existing schemes remarkably.
This paper provides a comparison of the current Internet architecture based on TCP/IP and the proposed future Internet architecture of Named Data Networking (NDN). It discusses key differences in their approaches, components, packet formats, and security implementations. The TCP/IP model uses IP addresses and has a client-server request model, while NDN is information-centric, names content directly, and uses an interest-initiated model. NDN aims to more efficiently distribute popular content, optimize bandwidth usage, and reduce congestion compared to the TCP/IP architecture.
Study and analysis of mobility, security, and caching issues in CCN IJECEIAES
This document summarizes a study that analyzed mobility, security, and caching issues in Content-Centric Networking (CCN). It discussed the basics of CCN including its key components like the Forwarding Information Base, Pending Interest Table, and Content Store. It then analyzed mobility management in CCN, comparing different schemes for handling consumer and producer mobility. It also discussed security schemes in CCN and reviewed different caching studies. The document aimed to identify open research challenges in these three important areas of CCN and discuss future trends for its large-scale deployment.
FAST PACKETS DELIVERY TECHNIQUES FOR URGENT PACKETS IN EMERGENCY APPLICATIONS...IJCNCJournal
Internet of Things (IoT) has been receiving a lot of interest around the world in academia, industry and telecommunication organizations. In IoT, many constrained devices can communicate with each other which generate a huge number of transferred packets. These packets have different priorities based on the applications which are supported by IoT technology. Emergency applications such as calling an ambulance in a car accident scenario need fast and reliable packets delivery in order to receive an immediate response from a service provider. When a client sends his request with specific requirements, fast and reliable return contents (packets) should be fulfilled, otherwise, the network resources may be wasted and undesirable circumstances may be counted. Content-Centric Networking (CCN) has become a promising network paradigm that satisfies the requirements of fast packets delivery for emergency applications of IoT. In this paper, we propose fast packets delivery techniques based on CCN for IoT environment, these techniques are suitable for urgent packets in emergency applications that need fast delivery. The simulation results show how the proposed techniques can achieve high throughput, a large number of request messages, fast response time and a low number of lost packets in comparison with the normal CCN.
A Study on Quality Of Service (QOS) in Ubiquitous Wireless Sensor NetworksIRJET Journal
This document discusses connecting wireless sensor networks to TCP/IP protocol stacks to improve quality of service in ubiquitous wireless sensor networks. It first provides background on wireless sensor networks and issues with directly using TCP/IP in such networks due to their constrained resources and wireless links. It then examines existing approaches like using application-level gateways and delay tolerant networks. The document proposes using an onboard gateway approach to connect different network types while adopting TCP/IP protocol stacks in wireless sensor networks. This would help integrate sensor networks with external TCP/IP networks and allow improved quality of service in ubiquitous wireless sensor environments.
This presentation summarizes research on efficient multimedia delivery in content-centric mobile networks. It discusses motivations like seamless delivery across heterogeneous networks and emerging multimedia technologies. It reviews related work on content-centric networking architectures like CCN, DONA, and JUNO. It also examines state-of-the-art approaches for mobility management, routing, multi-path transport, and edge networks. The presentation outlines the relationships between chapters, which will cover an advanced CCN architecture, H-routing, mobility prediction, selective forwarding, P2P content retrieval, and enabling real-time access.
Developing QoS by Priority Routing for Real Time Data in Internet of Things (...IJCNCJournal
- The document discusses developing quality of service (QoS) in Internet of Things (IoT) networks by using priority routing for real-time data.
- It proposes a novel solution that integrates mobile ad hoc networks (MANETs) to improve delivery of high priority real-time application data over low latency MANET paths.
- Experimental results showed the proposed approach was effective in reducing network overhead and congestion, while also improving routing protocol performance in terms of packet delay and throughput.
Multi Bandwidth Data path design for 5G Wireless SystemsChaitanya Krishna
The document discusses the design of a multi-bandwidth data path for 5G wireless mobile systems. It provides an overview of the evolution of wireless mobile communications through the generations from 1G to 5G. It then describes the proposed multi-bandwidth data path model and architecture, which would allow data requests and replies to use different networks to improve efficiency. The performance of the proposed design is analyzed based on buffer requirements and simulation results. The design aims to make better use of network resources but future work is still needed to address issues like congestion relief.
Hop Count Based Interest Selection and Content Forwarding Scheme for Vehicula...IJCNCJournal
Vehicular Named Data Networks (VNDN) face challenges in efficiently disseminating content due to high mobility and intermittent connectivity. To address these challenges, a Hop Count based Interest Selection and Content Forwarding (HISCF) scheme for VNDNs is proposed. The scheme focuses on mitigating interest flooding, reducing data packet duplication, and alleviating network congestion. HISCF consists of two components: interest selection and content forwarding. The selection process chooses a vehicle based on hop count and Interest Satisfaction Ratio (ISR) to forward the interest packet. Content forwarding is performed considering a hop count limit and pending interests, ensuring efficient content delivery. The HISCF scheme is evaluated using extensive simulations in ns-3 with ndnSIM. Performance metrics such as Data Packet Replication Count (DPRC), total number of interest packets forwarded, Interest Response Time (IRT) and routing overhead are analysed. Results show that HISCF outperforms naïve VNDN, reducing DPRC, minimizing interest packets forwarded, and decreasing average IRT. The findings demonstrate that HISCF effectively mitigates interest broadcast storms, reduces data packet duplication, and improves content delivery efficiency in VNDNs. This study contributes to VNDN research advancement and provides insights for designing effective content forwarding mechanisms in vehicular networks.
Hop Count Based Interest Selection and Content Forwarding Scheme for Vehicula...IJCNCJournal
Vehicular Named Data Networks (VNDN) face challenges in efficiently disseminating content due to high mobility and intermittent connectivity. To address these challenges, a Hop Count based Interest Selection and Content Forwarding (HISCF) scheme for VNDNs is proposed. The scheme focuses on mitigating interest flooding, reducing data packet duplication, and alleviating network congestion. HISCF consists of two components: interest selection and content forwarding. The selection process chooses a vehicle based on hop count and Interest Satisfaction Ratio (ISR) to forward the interest packet. Content forwarding is performed considering a hop count limit and pending interests, ensuring efficient content delivery. The HISCF scheme is evaluated using extensive simulations in ns-3 with ndnSIM. Performance metrics such as Data Packet Replication Count (DPRC), total number of interest packets forwarded, Interest Response Time (IRT) and routing overhead are analysed. Results show that HISCF outperforms naïve VNDN, reducing DPRC, minimizing interest packets forwarded, and decreasing average IRT. The findings demonstrate that HISCF effectively mitigates interest broadcast storms, reduces data packet duplication, and improves content delivery efficiency in VNDNs. This study contributes to VNDN research advancement and provides insights for designing effective content forwarding mechanisms in vehicular networks.
A New Efficient Cache Replacement Strategy for Named Data NetworkingIJCNCJournal
The Information-Centric Network (ICN) is a future internet architecture with efficient content retrieval and distribution. Named Data Networking (NDN) is one of the proposed architectures for ICN. NDN’s innetwork caching improves data availability, reduce retrieval delays, network load, alleviate producer load, and limit data traffic. Despite the existence of several caching decision algorithms, the fetching and distribution of contents with minimum resource utilization remains a great challenge. In this paper, we introduce a new cache replacement strategy called Enhanced Time and Frequency Cache Replacement strategy (ETFCR) where both cache hit frequency and cache retrieval time are used to select evicted data chunks. ETFCR adds time cycles between the last two requests to adjust data chunk’s popularity and cache hits. We conducted extensive simulations using the ccnSim simulator to evaluate the performance of ETFCR and compare it to that of some well-known cache replacement strategies. Simulations results show that ETFCR outperforms the other cache replacement strategies in terms of cache hit ratio, and lower content retrieval delay.
A NEW EFFICIENT CACHE REPLACEMENT STRATEGY FOR NAMED DATA NETWORKINGIJCNCJournal
The Information-Centric Network (ICN) is a future internet architecture with efficient content retrieval and distribution. Named Data Networking (NDN) is one of the proposed architectures for ICN. NDN’s innetwork caching improves data availability, reduce retrieval delays, network load, alleviate producer load, and limit data traffic. Despite the existence of several caching decision algorithms, the fetching and distribution of contents with minimum resource utilization remains a great challenge. In this paper, we introduce a new cache replacement strategy called Enhanced Time and Frequency Cache Replacement strategy (ETFCR) where both cache hit frequency and cache retrieval time are used to select evicted data chunks. ETFCR adds time cycles between the last two requests to adjust data chunk’s popularity and cache hits. We conducted extensive simulations using the ccnSim simulator to evaluate the performance of ETFCR and compare it to that of some well-known cache replacement strategies. Simulations results show that ETFCR outperforms the other cache replacement strategies in terms of cache hit ratio, and lower content retrieval delay.
AN ADVANCED QOS ANALYSIS AND EVALUATION METHOD FOR MOBILE INTERNET ACCESS ijwmn
The paper proposes a new method for the analysis and evaluation of the Quality of Service (QoS) in a
mobile Internet access scenario. In particular, the paper proposes a throughput evaluation method based
on PathChirp algorithm. The end-to-end bandwidth was estimated by means of the Self Loading of Periodic
Streams (SloPS) technique. The obtained measurements were then analyzed by estimating the degree of
correlation with other parameters that characterize the data transmission such as power, round trip time,
etc. Finally, in order to have greater spatial resolution performance guaranteed by an Internet service
provider, a 3D reconstruction method based on using drones is proposed and some preliminary results are
discussed.
AN ADVANCED QOS ANALYSIS AND EVALUATION METHOD FOR MOBILE INTERNET ACCESS ijwmn
The paper proposes a new method for the analysis and evaluation of the Quality of Service (QoS) in a
mobile Internet access scenario. In particular, the paper proposes a throughput evaluation method based
on PathChirp algorithm. The end-to-end bandwidth was estimated by means of the Self Loading of Periodic
Streams (SloPS) technique. The obtained measurements were then analyzed by estimating the degree of
correlation with other parameters that characterize the data transmission such as power, round trip time,
etc. Finally, in order to have greater spatial resolution performance guaranteed by an Internet service
provider, a 3D reconstruction method based on using drones is proposed and some preliminary results are
discussed.
An approximation delay between consecutive requests for congestion control in...IJECEIAES
This research presents a way to avoid network congestion during unicast CoAP-based group communication using increased delays between consecutive requests (DCR) in LoWPAN border routers to limit request send rates. It also provides a way to determine DCR values that are suitable for various network group sizes with differing node counts. The optimal DCR is obtained using the least squares approximation method and the relative minimum. Results from experimentation shows a positive relation, that is, an increase in group size necessitates an increase in DCR value. Experiments in various group sizes show favorable network performance and support the proposed congestion control method using DCR.
Similar to Enhanced Protocol for Wireless Content-Centric Network (20)
Sri Guru Hargobind Ji - Bandi Chor Guru.pdfBalvir Singh
Sri Guru Hargobind Ji (19 June 1595 - 3 March 1644) is revered as the Sixth Nanak.
• On 25 May 1606 Guru Arjan nominated his son Sri Hargobind Ji as his successor. Shortly
afterwards, Guru Arjan was arrested, tortured and killed by order of the Mogul Emperor
Jahangir.
• Guru Hargobind's succession ceremony took place on 24 June 1606. He was barely
eleven years old when he became 6th Guru.
• As ordered by Guru Arjan Dev Ji, he put on two swords, one indicated his spiritual
authority (PIRI) and the other, his temporal authority (MIRI). He thus for the first time
initiated military tradition in the Sikh faith to resist religious persecution, protect
people’s freedom and independence to practice religion by choice. He transformed
Sikhs to be Saints and Soldier.
• He had a long tenure as Guru, lasting 37 years, 9 months and 3 days
AI in customer support Use cases solutions development and implementation.pdfmahaffeycheryld
AI in customer support will integrate with emerging technologies such as augmented reality (AR) and virtual reality (VR) to enhance service delivery. AR-enabled smart glasses or VR environments will provide immersive support experiences, allowing customers to visualize solutions, receive step-by-step guidance, and interact with virtual support agents in real-time. These technologies will bridge the gap between physical and digital experiences, offering innovative ways to resolve issues, demonstrate products, and deliver personalized training and support.
https://www.leewayhertz.com/ai-in-customer-support/#How-does-AI-work-in-customer-support
Applications of artificial Intelligence in Mechanical Engineering.pdfAtif Razi
Historically, mechanical engineering has relied heavily on human expertise and empirical methods to solve complex problems. With the introduction of computer-aided design (CAD) and finite element analysis (FEA), the field took its first steps towards digitization. These tools allowed engineers to simulate and analyze mechanical systems with greater accuracy and efficiency. However, the sheer volume of data generated by modern engineering systems and the increasing complexity of these systems have necessitated more advanced analytical tools, paving the way for AI.
AI offers the capability to process vast amounts of data, identify patterns, and make predictions with a level of speed and accuracy unattainable by traditional methods. This has profound implications for mechanical engineering, enabling more efficient design processes, predictive maintenance strategies, and optimized manufacturing operations. AI-driven tools can learn from historical data, adapt to new information, and continuously improve their performance, making them invaluable in tackling the multifaceted challenges of modern mechanical engineering.
Accident detection system project report.pdfKamal Acharya
The Rapid growth of technology and infrastructure has made our lives easier. The
advent of technology has also increased the traffic hazards and the road accidents take place
frequently which causes huge loss of life and property because of the poor emergency facilities.
Many lives could have been saved if emergency service could get accident information and
reach in time. Our project will provide an optimum solution to this draw back. A piezo electric
sensor can be used as a crash or rollover detector of the vehicle during and after a crash. With
signals from a piezo electric sensor, a severe accident can be recognized. According to this
project when a vehicle meets with an accident immediately piezo electric sensor will detect the
signal or if a car rolls over. Then with the help of GSM module and GPS module, the location
will be sent to the emergency contact. Then after conforming the location necessary action will
be taken. If the person meets with a small accident or if there is no serious threat to anyone’s
life, then the alert message can be terminated by the driver by a switch provided in order to
avoid wasting the valuable time of the medical rescue team.
Levelised Cost of Hydrogen (LCOH) Calculator ManualMassimo Talia
The aim of this manual is to explain the
methodology behind the Levelized Cost of
Hydrogen (LCOH) calculator. Moreover, this
manual also demonstrates how the calculator
can be used for estimating the expenses associated with hydrogen production in Europe
using low-temperature electrolysis considering different sources of electricity
This presentation is about Food Delivery Systems and how they are developed using the Software Development Life Cycle (SDLC) and other methods. It explains the steps involved in creating a food delivery app, from planning and designing to testing and launching. The slide also covers different tools and technologies used to make these systems work efficiently.
Blood finder application project report (1).pdfKamal Acharya
Blood Finder is an emergency time app where a user can search for the blood banks as
well as the registered blood donors around Mumbai. This application also provide an
opportunity for the user of this application to become a registered donor for this user have
to enroll for the donor request from the application itself. If the admin wish to make user
a registered donor, with some of the formalities with the organization it can be done.
Specialization of this application is that the user will not have to register on sign-in for
searching the blood banks and blood donors it can be just done by installing the
application to the mobile.
The purpose of making this application is to save the user’s time for searching blood of
needed blood group during the time of the emergency.
This is an android application developed in Java and XML with the connectivity of
SQLite database. This application will provide most of basic functionality required for an
emergency time application. All the details of Blood banks and Blood donors are stored
in the database i.e. SQLite.
This application allowed the user to get all the information regarding blood banks and
blood donors such as Name, Number, Address, Blood Group, rather than searching it on
the different websites and wasting the precious time. This application is effective and
user friendly.
2. 176 Computer Science & Information Technology (CS & IT)
request the content in a different time and different area. In this case, the content server will send
same content 10 times from U.S. to Korea. This is very inefficient way to provide content. In
order efficiently to request and provide the content itself, Content Centric Network (CCN)
concept has been proposed in year 2009 by Van Jacobson [1]. In CCN, when the first content is
delivered, we allow some server or router in Korea to store the content. Therefore, the second
user’s request on the same content can be provided from the nearby server or router, not far from
server in U.S. Furthermore, CCN proposes to use a content name to request/distribute content
instead of using IP address. That is, while current Internet focuses on “where to get” using IP
address, CCN focuses on “what to get” using content name itself.
Even though initial studies for CCN have been conducted on the wired networks, recent studies
moves to CCN-based wireless networks and is actively being conducted [2]-[10] because as
mentioned earlier, people enjoys contents through smart handheld devices while they are moving.
However, the research on wireless CCN is still early-state and there are many issues to be
resolved. One of issue is long delay to download contents because of broadcasting and flooding-
based transmissions adopted by wireless CCN. In this paper, we focus on how to reduce flooded
traffics in wireless CCN in order to reduce download time of contents. To resolve the issue, we
propose a novel protocol to reduce the number of content request messages, named Interest
packet, flooded over the networks. As a result, the proposed protocol reduces collisions and
wasted time in wireless CCN.
In Section 2, the fundamentals of CCN and some prior arts related with wireless CCNs are
introduced. In Section 3, after motivation of this research is introduced, the proposed protocol is
described. In Section 4, the proposed protocol is evaluated in terms of the content download time
and conclusions are made in Section 5.
2. PRIOR ART
CCN is composed of three devices and three packets [1]. Three devices are consumer, provider,
and intermediate nodes, and three packets are Interest, Data, and Announcement packets. Each
device consists of three components: Content Store (CS), Pending Interest Table (PIT), and
Forwarding Information Base (FIB). A consumer requests a content by sending an Interest packet
and the Interest packet is flooded over a network by all intermediate nodes. Once receiving the
Interest packet, a node to check its CS if it has the content. If it has, it sends Data packets in the
manner of broadcasting and it becomes a provider. If it doesn’t, it records the information of
Interest packet in its PIT and broadcasts the Interest packet to Networks. Therefore, any node that
has request content can be a provider which is a content server in terms of conventional IP-based
networks. When receiving a Data packet, then it checks PIT to ensure any node requested the
content before. If yes, it broadcasts the Data packet. Otherwise, it discards the packet. In CCN, a
provider can broadcast announcement packet to let nodes in network know specific content that
the node has in CS.
After the concept of CCN was proposed, studies on wireless CCN have been actively performed
[2]-[10]. Enhanced-Content-centric multiHop wireless NETwork (E-CHANET) is designed for
wireless networks adopting CCN concept [2]. In E-CHANET, Announcement packet and FIB
component are removed from the system. Instead, to cope with erroneous wireless channel, it
uses Interest-Data-based two-way handshake performed between consumer and provider.
Therefore, every Data packet transmission is requested by one Interest packet. If there is a lost
3. Computer Science & Information Technology (CS & IT) 177
Data packet, same Interest packet is retransmitted. Calculating wait-time for receiving the
requested Data packet and handoff method between different providers are also designed. The
CCN communication method is also applied to vehicular networks [4]. CarSpeak enables a car to
query and access sensory information captured by other cars in a manner similar to a way to
request a content in content-centric approach. Authors in [4] try to solve packet loss problem
caused by node mobility in CCN-based MANETs. In [4], both of broadcast and unicast are used
for the transmissions of Interest packets, and additional function is added which is to validate if
the next hop node is available when a node receives Interest or Data packet. Flooding issue in
CCN has been studied in [5][6]. In [5], the shortest hop count is found by flooding Interest
packets and then Data packet is flooded back to consumer within the hop count. In [6], the
authors proposed a new scheme called Neighborhood-Aware Interest Forwarding (NAIF) for
NDN-based mobile ad hoc networks. This scheme basically reduces the flooding overhead in the
network. In which, the intermediate node locally decide to propagate or drop the received Interest
packet based on the forwarding rate. Authors in [7] propose a scheme for multihop based wireless
CCN. Two additional packets, called EFS-ACK and EFS are also utilized in addition to the
Interest and Data packets. In [8], the authors present an energy aware forwarding scheme for
multihop wireless ad hoc networks. In which, the packets are forwarded based on node's residual
energy. Authors in [9] propose forwarding strategies (i.e. BF, PAF) for wireless CCN ad hoc
networks. These schemes are deeply analyze and well evaluated. Furthermore, the authors also
highlight the advantages and shortcoming of both approaches. Kim et al., in [10], present a novel
scheme, named AIRDrop in which communication is based on unicast manner. Proposed
AIRDrop scheme also takes into account the extra tables and buffers during its communication
operations.
Figure. 1. Revised packet formats for the proposed protocol: (a) Interest packet and (b) Data packet
3. PROPOSED PROTOCOL
3.1. Motivation
Although previously proposed protocols for CCN-based wireless networks provide advantages
for delivering contents, their performance is still struggling in terms of content download time.
One of the reasons is inefficient Data packet forwarding mechanism. In wireless environments,
using broadcasting manner, the direction of packet flows cannot be controlled, so that too much
flooding causes delays to download contents. Since many wireless routing protocols uses
unicasting and IP addresses, so that packet’s flow can be controlled using IP addresses. However,
because wireless CCNs do not use IP address and use broadcasting address for MAC protocol, it
MACAddrList
HopCnt
MACAddrList
MaxHopCnt
(a) (b)
4. 178 Computer Science & Information Technology (CS & IT)
is hard to restrict flooding area and control the content flows. On the other hand, totally removing
flooding in wireless CCNs also removes advantage of CCNs’ nature which is to spread contents
over the networks for possible upcoming content request. Therefore, the objective of this paper is
to propose a protocol for wireless CCNs which not only limits flooding of Data packets in a
certain range over the networks, but also speeds up content download time using a shortest path
from a provider to a consumer.
In the proposed protocol, the way to forward Interest packet is same as that of E-CHANET.
However, whenever nodes forwards the packet, they add their MAC addresses in the packet.
When the list of MAC addresses of the Interest packet arriving firstly at a provider, it will be used
as the shortest path for Data packet’s forwarding. Furthermore, since nodes in the list are allowed
to have priorities to access the channel, Data packets can be arrived at a consumer faster
comparing to the conventional wireless CCNs. Unlike common unicasting routing protocols used
in wireless ad-hoc networks, the Data packets is not forwarded only by the nodes in the list. The
packet is also forwarded in some area of the nodes in the list. That is, the Data packets are
flooded in a restricted area around the shortest path. Therefore, it achieves not only a better
content download time, but also flooding of Data packets.
3.2. New Frames
In the proposed protocol, Interest and Data packets’ formats of E-CHANET are modified as
shown in Fig.1. As shown in Fig. 1(a), for the Interest packet of the proposed protocol, one field,
called MACAddrList, is added at the end of the packet. This field includes MAC addresses of
intermediate nodes between a consumer and a provider. When a node receives an Interest packet
and decides to forward it, it adds its MAC address in the field. Therefore, MAC addresses are
accumulated in the field as the Interest packet is forwarded to a Provider, so that the size of the
field is varied according to the number of nodes forwarding the Interest packet before it arrives at
a provider. This filed is also used for Data packet as shown in Fig. 1(b). The list of addresses in
the field of Interest packet is copied to the field of Data packet by a provider before the Data
packet is transmitted. While a node adds its MAC address into MACAddrList field when
receiving an Interest packet, it removes its MAC address from the field of Data packet when it
receives the data packet and its address is in the field. MaxHopCnt is the number of MAC
addresses indicating how many nodes the Interest packet have come through from a consumer to
the provider. HopCnt field in Data packet indicates how many hops the Data packet can be
forwarded. That is, this limits forwarding Data packet unnecessary further. When a node receives
a Data packet, it recalculates HopCnt which is explained in detail in Section 3.3. HopCnt is
differently calculated depend on whether or not the node itself is in MACAddrList.
3.3. Operation of the proposed protocol
In this section, operations of the protocol are explained in two parts: cases when a node receives
Interest packet and Data packet.
Process when a node receives an Interest packet.
The procedure of the proposed protocol when a node receiving an Interest packet is shown in Fig.
2.
5. Computer Science & Information Technology (CS & IT) 179
Figure. 2. Procedure of the proposed protocol when a node receives Interest packet
When a node receives an Interest packet, it performs the process defined from conventional
wireless CCN such as E-CHANET. That is, it checks CS and PIT and decides whether or not to
forward the packet. If the node acts as a relay node and the received Interest packet needs to be
forwarded, it add the last 24bits of its MAC address to MACAddrList field in the received Interest
packet and forwards the packet to the neighbours. If the packet is already received before, the
node discards the packet.
If the node becomes a provider (that means it has the requested contents in its CS), it checks if it
already received an Interest packet requesting same content and nonce number. If it did, it
discards the packet. Otherwise, it records the first packet requesting the content with the nonce is
received, and then at first, it copies the list in MACAddrList field in the Interest packet to
MACAddrList field in Data packet to be sent. Secondly, it set HopCnt field to N times the number
of MAC addresses in the field. Finally, it sends the Data packet to Consumer.
In the process, when a provider receives an Interest packet, it sets MaxHopCnt to N x the number
of MAC addresses in MACAddrList of the Interest packet.
Process when a node receives a Data packet.
When a node receives Data packet, it processes conventional CCN process. Then it checks if it
need to forward the received Data packet. If it does not need to forward the packet, it discards the
packet. If it need to forward it, but HopCnt is 0, it discards the packet. Otherwise, the node
checks if there is its own MAC address in the MACAddrList of the Data packet. If there is,
HopCnt of the Data packet is set to MaxHopCnt and the node’s own MAC address is removed
from MACAddrList of the packet. In addition, after choosing random number between 0 and Ws,
Receive
Interest
Operate basic
CCN procedure
Forward?
Add MAC Address into
MACAddrList of Interest
packet
Forward Interest
Discard
Interest
packet
Yes
No Am I
Provider?
No
Yes
Copy MACAddrList from Interest
packet to Data packet
HopCnt = MaxhopCnt =
N x # of MAC addresses in the list
Send Data packet
Is it the 1st
Interest?
No
Yes
6. 180 Computer Science & Information Technology (CS & IT)
it sets its deferring time, DeferT, to the random number x slot time, SlotT. After waiting DeferT,
it forwards the Data packet to neighbours. If there isn’t its own MAC address in the
MACAddrList of the Data packet, the node checks if HopCnt of the packet equals to 1. If it is,
HopCnt is set to 0. Otherwise, HopCnt is set to the integer that is not higher than root of HopCnt
of the packet. After choosing random number between 0 and Wn, it sets its DeferT, to the random
number x SlotT. After waiting DeferT, the packet is forwarded to the neighbours.
The proposed protocol provides two unique characteristics to efficiently forward Data packets.
The first characteristic is to limit the Data packet’s flooding by exponentially reducing HopCnt as
explained in Step 4-2a. If a node receiving the Data packet coming from the non-shortest path,
the Data packet is forwarded within number of hops. If it is coming from the shortest path, its
Data packet is flooded as many hops as MaxHopCnt as explained in Step 4-1a. Therefore, it
maintains an advantage of conventional CCN’s flooding as well as prevents from unnecessary
packet flooding. The second characteristic is to give transmission priority to nodes on the shortest
path as explained in Step 4-1c and 4-2c. In conventional wireless CCNs, since all data packets are
broadcasted in MAC payer, there is no retransmissions and backoff time increase. Because of
this, it causes lots of collisions due to concurrent transmissions. Therefore, to resolve concurrent
transmissions, CCN layer provides Deferred Time which a node waits random time before
transmission. In this case, to give better transmission opportunity to the nodes along with the
shortest path, the proposed protocol allows them to choose random number from the smaller
range of numbers (0~Ws) than other nodes. The other nodes choose the random number from the
wider range of numbers (0~Wn). As a result, nodes on the shortest path have the higher
transmission opportunities than others.
Figure. 3. Network Topology for the simulations
Consumer Provider
7. Computer Science & Information Technology (CS & IT) 181
Figure. 4. Average content download time as a function of the distance between a consumer-provider pair
4. PERFORMANCE EVALUATIONS
In this section, the proposed protocol is comparatively evaluated with E-CHANET-based
protocol. For evaluation studies, we have used ndnSIM [10] software module that is based on
Network Simulator-3 (NS-3) version 3.16. In the simulations, one content consists of 100 packets
and payload length of a data packet is set to 1200 bytes. Physical layer transmission rate is set to
6Mbps and 5GHz-carrier frequency-based IEEE802.11a standard is adopted. Medium access
control protocol is based on IEEE802.11e standard. For the channel model, log normal path loss
model with path loss exponent 3 is used. The simulations results are collected from 100 times
simulations and one simulation completed when a consumer receives all 100 chunks packets from
a provider.
The performances are evaluated as functions of network sizes by varying distances of a
consumer-provider pair and the number of lines of Y-axis in grid topology. The topology for the
simulations are shown in Fig. 3. Fixing a consumer’s location, performances are evaluated
varying distances to a provider. The distances are 5, 10, 15, 20 hops. In addition to varying
distances between the consumer and the provider, the grid sizes are varied as like 5 and 15 lines.
1 line means there is only one path between the consumer and the provider. That is, the number
of hop indicates the number of relay nodes in x-axis over grid topology while the number of lines
indicates the number of relay nodes in y-axis in the topology. Therefore, we evaluates the
performances over 8 sizes of networks (4 types of hops and 2 types of lines).
Fig. 4 shows the average content download time as varying the distance between a consumer and
provider when the numbers of lines are 5 and 15. As mentioned before, the distance is
represented using the number of hops between the consumer-provider pair and the distance is
varied from 5 to 20 hops. As shown in the figure, the proposed protocol reduces the download
time from 16% to 52% comparing to E-CHANET protocol. From the figure, as the distance
increases, the reduction of download time is larger. The reason is because E-CHANET protocol
makes more packets flooded over the networks as the distance increase. Since higher traffics over
5 10 15 20
0
5
10
15
20
25
30
35
40
Number of Hops
AverageContentsDownloadTime(sec)
E-CHANET w/ 5-line
Proposed w/ 5-line
E-CHANET w/ 15-line
Proposed w/ 15-line
E-CHANET
15 lines
5 lines
Proposed
8. 182 Computer Science & Information Technology (CS & IT)
the networks causes higher download time because of packet losses due to collisions and longer
backoff time in MAC layer. It is noticed that there is exceptionally long download time of E-
CHANET protocol in 5 lines in Fig. 4. This can be explained from Fig. 5 showing the average
number of retries. As Fig. 5 shows, E-CHANET protocol has the highest number of retries. Since
the forwarding path becomes narrower, the advantage of E-CHANET protocol’s flooding-based
Data packet forwarding decreases. Even though flooding-based packet forwarding method cause
lots of collisions because too many nodes are participating in transmissions, the packet can
eventually delivered to the consumer through many alternative paths because it is flooded.
However, in the narrower network like 5 lines, the number of alternative paths are limited,
so that the advantage of flooding decreases. Therefore, the number of retransmissions
increases which leads the download time’s increase.
Figure. 5. Average number of retries as a function of the distance between a consumer-provider pair
5. CONCLUSIONS
In this paper, a novel protocol for wireless CCNs is proposed. Even though the protocol uses
broadcasting and flooding-based Data packet forwarding, by restricting flooding area and giving
transmission priority to a nodes on the shortest path, the protocol resolves the long content
download time issue. The proposed protocol is evaluated throughout extensive simulations and it
is proved that the objective of the proposed protocol successfully achieved by reducing a content
download time up to 50% comparing to the conventional protocol.
ACKNOWLEDGEMENTS
This research was supported in parts by Basic Science Research Program through the National
Research Foundation of Korea (NRF) funded by the Ministry of Education
(2013R1A1A2005692) and in parts by the International Science and Business Belt Program
through the Ministry of Science, ICT and Future Planning (2015K000270).
9. Computer Science & Information Technology (CS & IT) 183
REFERENCES
[1] V. Jacobson, D.K. Smetters, J.D. Thornton, M.F. Plass, N.H. Briggs, and R.L. Braynard,
“Networking named content,” Proc. Int. Conf. on Emerging Networking Experiments and
Technologies, (CoNEXT’09), Rome, Italy, Dec. 2009. pp. 1-12.
[2] M. Amadeo, A. Molinaro, and G. Ruggeri, "E-CHANET: routing, forwarding and transport in
information-centric multihop wireless networks," Computer Communications, vol. 36, no. 7, pp. 792-
803, April 2013.
[3] M Amadeo, C Campolo, and A Molinaro, "Enhancing content-centric networking for vehicular
environments," Computer Networks, vol. 57, no. 16, pp. 3222-3234, November. 2013.
[4] O. Adem, S. Kang, Y.B. Ko, "Packet Loss Avoidance in Content Centric Mobile Adhoc Netowrks,"
15th International Conference on Advanced Communication Technology (ICACT’13), pp. 245-250,
PyeongChang, Korea, January 2013.
[5] H. Han, M. Wu, Q. Hu, and N. Wang, "Best Route, Error Broadcast: A Content-Centric Forwarding
Protocol for MANETs," IEEE 80th Vehicular Technology Conference (VTC Fall), pp. 14-17,
Vancouver, Canada, September 2014.
[6] Y.-T. Yu, B.R. Dilmaghani, S. Calo, M.Y. Sanadidi, and M. Gerla, “Interest propagation in named
data manets," in Proc. of IEEE International Conference on Computing, Networking, and
Communications (ICNC’2013), pp. 1118-1122, San Diego, CA, January 2013.
[7] D. Kim and Y.-B. Ko, “A novel message broadcasting strategy for reliable content retrieval in multi-
hop wireless content centric networks,” In Proceedings of the 9th ACM International Conference on
Ubiquitous Information Management and Communication, Bali, Indonesia, January 2015.
[8] R.A. Rehman and B.-S. Kim, “Energy aware forwarding in content centric based multihop wireless
ad hoc networks,” IEICE transactions on on Fundamentals of Electronics, Communications and
Computer Sciences,vol. E98-A, no. 12, pp. 2738-2742, December 2015.
[9] M. Amadeo, C. Campolo, and A. Molinaro, “Forwarding strategies in named data wireless ad hoc
networks: Design and evaluation,” Journal of Network and Computer Applications, vol. 50, pp. 148-
158, April 2015.
[10] D. Kim, J.-H. Kim, C. Moon, J. Choi, and I. Yeom, “Efficient content delivery in mobile ad-hoc
networks using ccn,” Ad Hoc Networks, vol. 36, pp. 81-99, January 2016.
[11] A. Afanasyev, I. Moiseenko, and L. Zhang, “ndnSIM: NDN simulator for NS-3,” Technical Report
NDN-0005, NDN, October 2012.