This document provides an introductory overview of ad-hoc networks, including:
1) A definition of ad-hoc networks as decentralized wireless networks that self-configure without preexisting infrastructure;
2) A discussion of mobile ad-hoc networks (MANETs) and wireless sensor networks as examples of ad-hoc networks;
3) An overview of challenges in providing quality of service in ad-hoc networks given their dynamic topology.
EFFICIENT REAL-TIME VIDEO TRANSMISSION IN WIRELESS MESH NETWORK IJORCS
We are experiencing rapid improvement in video transmission and picture quality. The technologies are supporting us with real-time video transmissions such as video conferences and webinars. Soon reliable, simple, low cost real-time video will become essential, providing its extensive support to mobiles; PDA’s etc. These enhancements are going to affect the consumer behaviour, business culture. Video transmission includes transmitting packets through Wireless Mesh Network (WMN), which turned out to be a challenging scenario for real-time video services. Due to the existing nature of wireless networks include the presence of unpredictable delays and high packet error rates due to the error-prone nature of the wireless links. In this paper, we will propose a model which provides high capacity data transfer with reduced delay. We have simulated and achieved results with higher throughput.
Quantative Analysis and Evaluation of Topology Control Schemes for Utilizing ...ijsrd.com
By virtue of their robustness, cost-effectiveness, self-organizing and self-configuring nature, WMNs have emerged as a new network paradigm for a wide range of applications, such as public safety and emergency response communications, intelligent transportation systems, and community networks. It is anticipated that WMNs will not only resolve the limitations of wireless ad hoc networks, local area networks (WLANs), personal area networks (WPANs), and metropolitan area networks (WMANs) but also significantly improve such networks’ performance. One fundamental problem of WMNs with a limited number of radio interfaces and orthogonal channels is that the performance degrades significantly as the network size grows. This results from increased interference between nodes and diminished spatial reuse over the network. In this paper, it is proposed to evaluate the performance of two different channel assignment schemes namely common channel assignment (CCA) and centralized tabu-based search algorithm under WCETT routing protocols for varying traffic load in terms of packet delivery ratio, throughput, average end to end delay and routing overhead using NS2 network simulator. WCETT protocol uses the weighted sum of the cumulative expected transmission time and the maximal value of efficient channels among all channels.
Analysis of Handoff techniques used for hybrid networks: cellular/WLAN IJORCS
Most real life networks are hybrid networks. A hybrid network combines the best features of two or more networks. In networking terminology, a hybrid network according to “Information Technology control and Audit” are reliable and versatile. They provide large numbers of connections and data transmission paths to users. These hybrid networks may be treated as network nodes for analysis purpose. The two radio access technologies (RATs) are considered with cellular/WLAN depending on whether it is voice/ data, video. For observing practical result, some setups are required in laboratory which includes interface from personal computer to mobile terminal and vice-versa. The network simulator (Ns-2) is used for analysis purpose. The results shows the parameters like energy good put, Bandwidth utilization, packet delivery ratio, energy good put and energy consumed are improved after using hybrid networks.
EFFICIENT REAL-TIME VIDEO TRANSMISSION IN WIRELESS MESH NETWORK IJORCS
We are experiencing rapid improvement in video transmission and picture quality. The technologies are supporting us with real-time video transmissions such as video conferences and webinars. Soon reliable, simple, low cost real-time video will become essential, providing its extensive support to mobiles; PDA’s etc. These enhancements are going to affect the consumer behaviour, business culture. Video transmission includes transmitting packets through Wireless Mesh Network (WMN), which turned out to be a challenging scenario for real-time video services. Due to the existing nature of wireless networks include the presence of unpredictable delays and high packet error rates due to the error-prone nature of the wireless links. In this paper, we will propose a model which provides high capacity data transfer with reduced delay. We have simulated and achieved results with higher throughput.
Quantative Analysis and Evaluation of Topology Control Schemes for Utilizing ...ijsrd.com
By virtue of their robustness, cost-effectiveness, self-organizing and self-configuring nature, WMNs have emerged as a new network paradigm for a wide range of applications, such as public safety and emergency response communications, intelligent transportation systems, and community networks. It is anticipated that WMNs will not only resolve the limitations of wireless ad hoc networks, local area networks (WLANs), personal area networks (WPANs), and metropolitan area networks (WMANs) but also significantly improve such networks’ performance. One fundamental problem of WMNs with a limited number of radio interfaces and orthogonal channels is that the performance degrades significantly as the network size grows. This results from increased interference between nodes and diminished spatial reuse over the network. In this paper, it is proposed to evaluate the performance of two different channel assignment schemes namely common channel assignment (CCA) and centralized tabu-based search algorithm under WCETT routing protocols for varying traffic load in terms of packet delivery ratio, throughput, average end to end delay and routing overhead using NS2 network simulator. WCETT protocol uses the weighted sum of the cumulative expected transmission time and the maximal value of efficient channels among all channels.
Analysis of Handoff techniques used for hybrid networks: cellular/WLAN IJORCS
Most real life networks are hybrid networks. A hybrid network combines the best features of two or more networks. In networking terminology, a hybrid network according to “Information Technology control and Audit” are reliable and versatile. They provide large numbers of connections and data transmission paths to users. These hybrid networks may be treated as network nodes for analysis purpose. The two radio access technologies (RATs) are considered with cellular/WLAN depending on whether it is voice/ data, video. For observing practical result, some setups are required in laboratory which includes interface from personal computer to mobile terminal and vice-versa. The network simulator (Ns-2) is used for analysis purpose. The results shows the parameters like energy good put, Bandwidth utilization, packet delivery ratio, energy good put and energy consumed are improved after using hybrid networks.
An Adaptive Load Sharing Algorithm for Heterogeneous Distributed SystemIJORCS
Due to the restriction of designing faster and faster computers, one has to find the ways to maximize the performance of the available hardware. A distributed system consists of several autonomous nodes, where some nodes are busy with processing, while some nodes are idle without any processing. To make better utilization of the hardware, the tasks or load of the overloaded node will be sent to the under loaded node that has less processing weight to minimize the response time of the tasks. Load balancing is a tool used effectively for balancing the load among the systems. Dynamic load balancing takes into account of the current system state for migration of the tasks from heavily loaded nodes to the lightly loaded nodes. In this paper, we devised an adaptive load-sharing algorithm to balance the load by taking into consideration of connectivity among the nodes, processing capacity of each node and link capacity.
An Enhanced Framework for Improving Spatio-Temporal Queries for Global Positi...IJORCS
To efficiently process continuous spatio-temporal queries, we need to efficiently and effectively handle large number of moving objects and continuous updates on these queries. In this paper, we propose a framework that employs a new indexing algorithm that is built on top of SQL Server 2008 and avoid the overhead related to R-Tree indexing. To answer range queries, we utilize dynamic materialized view concept to efficiently handle update queries. We propose an adaptive safe region to reduce communication costs between the client and the server and to minimize position update load. Caching of results was utilized to enhance the overall performance of the framework. To handle concurrent spatio-temporal queries, we utilize publish/subscribe paradigm to group similar queries and efficiently process these requests. Experiments show that the overall proposed framework performance was able to outperform R-Tree index and produce promising and satisfactory results.
Commentz-Walter: Any Better than Aho-Corasick for Peptide Identification? IJORCS
An algorithm for locating all occurrences of a finite number of keywords in an arbitrary string, also known as multiple strings matching, is commonly required in information retrieval (such as sequence analysis, evolutionary biological studies, gene/protein identification and network intrusion detection) and text editing applications. Although Aho-Corasick was one of the commonly used exact multiple strings matching algorithm, Commentz-Walter has been introduced as a better alternative in the recent past. Comments-Walter algorithm combines ideas from both Aho-Corasick and Boyer Moore. Large scale rapid and accurate peptide identification is critical in computational proteomics. In this paper, we have critically analyzed the time complexity of Aho-Corasick and Commentz-Walter for their suitability in large scale peptide identification. According to the results we obtained for our dataset, we conclude that Aho-Corasick is performing better than Commentz-Walter as opposed to the common beliefs.
IJORCS now welcomes research manuscripts for its next issue, Volume 2, Issue 6. Authors are encouraged to contribute to IJORCS by submitting articles that clarify new research results, projects, surveying works and industrial experiences that describe significant advances in field of computer science.
IJORCS,Call For Papers- Volume 3, Issue 1,December 2012IJORCS
Welcoming the research scholars, scientists around the globe in the Open Access Dimension, IJORCS is now
accepting manuscripts for its next issue (Volume 3, Issue 1). Authors are encouraged to contribute to the research
community by submitting to IJORCS, articles that clarify new research results, projects, surveying works and
industrial experiences that describe significant advances in field of computer science.
Enhancement of DES Algorithm with Multi State LogicIJORCS
The principal goal to design any encryption algorithm must be the security against unauthorized access or attacks. Data Encryption Standard algorithm is a symmetric key algorithm and it is used to secure the data. Enhanced DES algorithm works on increasing the key length or complex S-BOX design or increased the number of states in which the information is to be represented or combination of above criteria. By increasing the key length, the number of combinations for key will increase which is hard for the intruder to do the brute force attack. As the S-BOX design will become the complex there will be a good avalanche effect. As the number of states increases in which the information is represented, it is hard for the intruder to crack the actual information. Proposed algorithm replace the predefined XOR operation applied during the 16 round of the standard algorithm by a new operation called “Hash function” depends on using two keys. One key used in “F” function and another key consists of a combination of 16 states (0,1,2…13,14,15) instead of the ordinary 2 state key (0, 1). This replacement adds a new level of protection strength and more robustness against breaking methods.
Welcoming the research scholars, scientists around the globe in the Open Access Dimension, IJORCS is now accepting manuscripts for its next issue (Volume 4, Issue 4). Authors are encouraged to contribute to the research community by submitting to IJORCS, articles that clarify new research results, projects, surveying works and industrial experiences that describe significant advances in field of computer science.
All paper submissions (http://www.ijorcs.org/submit-paper) are received and managed electronically by IJORCS Team. Detailed instructions about the submission procedure are available on IJORCS website (http://www.ijorcs.org/author-guidelines)
IJCER (www.ijceronline.com) International Journal of computational Engineerin...ijceronline
Call for paper 2012, hard copy of Certificate, research paper publishing, where to publish research paper,
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJCER, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, research and review articles, IJCER Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathematics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer review journal, indexed journal, research and review articles, engineering journal, www.ijceronline.com, research journals,
yahoo journals, bing journals, International Journal of Computational Engineering Research, Google journals, hard copy of Certificate,
journal of engineering, online Submission
Performance Evaluation of ad-hoc Network Routing Protocols using ns2 SimulationIDES Editor
Ad-hoc networks are basically peer to peer multihop
mobile wireless networks in which the information packets
are transmitted in a ‘store and forward’ manner from a source
to an arbitrary destination via intermediate nodes. The main
objective of this paper is to evaluate the performance of various
ad-hoc networks routing protocols viz. DSDV (Destination
Sequence Distance Vector), DSR (Dynamic Source Routing)
and AODV (Ad-hoc On Demand Distance Vector). The
comparison of these protocols is based on different
performance metrics, which are throughput, packet delivery
ratio, routing overheads, packet drop and average end to end
delay. The performance evaluation has been done by using
simulation tool NS2 (Network Simulator) which is the main
simulator.
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 Protocol/Scheme to mitigate DDos attacks using AODV Protocolijsrd.com
MANET(Mobile Adhoc Network) is an emerging technology and have great strength to be applied in battlefields and commercial applications such as traffic surveillance, MANET is infrastructure less without any centralized controller. Each node contains routing capability. Each device in a MANET is independent and can move in any direction. One of the major challenges wireless mobile ad-hoc networks face today is security, because no central controller exists. MANETs are a kind of wireless ad hoc networks that usually has a routable networking environment on top of a link layer ad hoc network. There are many security attacks in MANET and DDoS (Distributed denial of service) is one of them. Our main objective is seeing the effect of DDoS in routing, Packet Drop Rate, End to End Delay, no. of Collisions due to attack on network. And with these parameters and many more also we build secure IDS to detect this kind of attack and block it. In this thesis main objective is to study and implement the security against the DDOS attack. DDoS (Distributed Denial of Service) attacks in the networks are required to be prevented, as early as possible before reaching the victim node. DDos attack causes depletion of the network resources such as network bandwidth, disk space, CPU time, data structures, and network connections. Dealing with DDoS attacks is difficult due to their properties such as dynamic attack rates, big scale of botnets. DDos attack become more difficult to handle if it occurs in wireless network because of the properties of ad hoc network such as dynamic topologies, low battery life, Unicast routing Multicast routing , Frequency of updates or network overhead , scalability , mobile agent based routing ,power aware routing etc. Thus it is better to prevent the distributed denial of service attack rather than allowing it to occur and then taking the necessary steps to handle it. The following quantitative metrics Packet Delivery Ratio (PDR), Number of Collisions are to be used to evaluate the performance of DDoS attacks and their prevention techniques under different combinations in the fixed mobile ad hoc network. In our simulation, the effect of DDoS attacks under different number of attackers is studied.
Definition
A decentralized type of wireless network, allowing people and devices to seamlessly internetwork in areas with no pre-existing communication infrastructure, It can turn the dream of networking at any place and at time into reality. We are almost there by the way .Ex- Bluetooth enabled mobile phones such as 3G, laptops, handheld digital devices, personal digital assistants, or wearable computers
An Adaptive Load Sharing Algorithm for Heterogeneous Distributed SystemIJORCS
Due to the restriction of designing faster and faster computers, one has to find the ways to maximize the performance of the available hardware. A distributed system consists of several autonomous nodes, where some nodes are busy with processing, while some nodes are idle without any processing. To make better utilization of the hardware, the tasks or load of the overloaded node will be sent to the under loaded node that has less processing weight to minimize the response time of the tasks. Load balancing is a tool used effectively for balancing the load among the systems. Dynamic load balancing takes into account of the current system state for migration of the tasks from heavily loaded nodes to the lightly loaded nodes. In this paper, we devised an adaptive load-sharing algorithm to balance the load by taking into consideration of connectivity among the nodes, processing capacity of each node and link capacity.
An Enhanced Framework for Improving Spatio-Temporal Queries for Global Positi...IJORCS
To efficiently process continuous spatio-temporal queries, we need to efficiently and effectively handle large number of moving objects and continuous updates on these queries. In this paper, we propose a framework that employs a new indexing algorithm that is built on top of SQL Server 2008 and avoid the overhead related to R-Tree indexing. To answer range queries, we utilize dynamic materialized view concept to efficiently handle update queries. We propose an adaptive safe region to reduce communication costs between the client and the server and to minimize position update load. Caching of results was utilized to enhance the overall performance of the framework. To handle concurrent spatio-temporal queries, we utilize publish/subscribe paradigm to group similar queries and efficiently process these requests. Experiments show that the overall proposed framework performance was able to outperform R-Tree index and produce promising and satisfactory results.
Commentz-Walter: Any Better than Aho-Corasick for Peptide Identification? IJORCS
An algorithm for locating all occurrences of a finite number of keywords in an arbitrary string, also known as multiple strings matching, is commonly required in information retrieval (such as sequence analysis, evolutionary biological studies, gene/protein identification and network intrusion detection) and text editing applications. Although Aho-Corasick was one of the commonly used exact multiple strings matching algorithm, Commentz-Walter has been introduced as a better alternative in the recent past. Comments-Walter algorithm combines ideas from both Aho-Corasick and Boyer Moore. Large scale rapid and accurate peptide identification is critical in computational proteomics. In this paper, we have critically analyzed the time complexity of Aho-Corasick and Commentz-Walter for their suitability in large scale peptide identification. According to the results we obtained for our dataset, we conclude that Aho-Corasick is performing better than Commentz-Walter as opposed to the common beliefs.
IJORCS now welcomes research manuscripts for its next issue, Volume 2, Issue 6. Authors are encouraged to contribute to IJORCS by submitting articles that clarify new research results, projects, surveying works and industrial experiences that describe significant advances in field of computer science.
IJORCS,Call For Papers- Volume 3, Issue 1,December 2012IJORCS
Welcoming the research scholars, scientists around the globe in the Open Access Dimension, IJORCS is now
accepting manuscripts for its next issue (Volume 3, Issue 1). Authors are encouraged to contribute to the research
community by submitting to IJORCS, articles that clarify new research results, projects, surveying works and
industrial experiences that describe significant advances in field of computer science.
Enhancement of DES Algorithm with Multi State LogicIJORCS
The principal goal to design any encryption algorithm must be the security against unauthorized access or attacks. Data Encryption Standard algorithm is a symmetric key algorithm and it is used to secure the data. Enhanced DES algorithm works on increasing the key length or complex S-BOX design or increased the number of states in which the information is to be represented or combination of above criteria. By increasing the key length, the number of combinations for key will increase which is hard for the intruder to do the brute force attack. As the S-BOX design will become the complex there will be a good avalanche effect. As the number of states increases in which the information is represented, it is hard for the intruder to crack the actual information. Proposed algorithm replace the predefined XOR operation applied during the 16 round of the standard algorithm by a new operation called “Hash function” depends on using two keys. One key used in “F” function and another key consists of a combination of 16 states (0,1,2…13,14,15) instead of the ordinary 2 state key (0, 1). This replacement adds a new level of protection strength and more robustness against breaking methods.
Welcoming the research scholars, scientists around the globe in the Open Access Dimension, IJORCS is now accepting manuscripts for its next issue (Volume 4, Issue 4). Authors are encouraged to contribute to the research community by submitting to IJORCS, articles that clarify new research results, projects, surveying works and industrial experiences that describe significant advances in field of computer science.
All paper submissions (http://www.ijorcs.org/submit-paper) are received and managed electronically by IJORCS Team. Detailed instructions about the submission procedure are available on IJORCS website (http://www.ijorcs.org/author-guidelines)
IJCER (www.ijceronline.com) International Journal of computational Engineerin...ijceronline
Call for paper 2012, hard copy of Certificate, research paper publishing, where to publish research paper,
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJCER, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, research and review articles, IJCER Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathematics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer review journal, indexed journal, research and review articles, engineering journal, www.ijceronline.com, research journals,
yahoo journals, bing journals, International Journal of Computational Engineering Research, Google journals, hard copy of Certificate,
journal of engineering, online Submission
Performance Evaluation of ad-hoc Network Routing Protocols using ns2 SimulationIDES Editor
Ad-hoc networks are basically peer to peer multihop
mobile wireless networks in which the information packets
are transmitted in a ‘store and forward’ manner from a source
to an arbitrary destination via intermediate nodes. The main
objective of this paper is to evaluate the performance of various
ad-hoc networks routing protocols viz. DSDV (Destination
Sequence Distance Vector), DSR (Dynamic Source Routing)
and AODV (Ad-hoc On Demand Distance Vector). The
comparison of these protocols is based on different
performance metrics, which are throughput, packet delivery
ratio, routing overheads, packet drop and average end to end
delay. The performance evaluation has been done by using
simulation tool NS2 (Network Simulator) which is the main
simulator.
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 Protocol/Scheme to mitigate DDos attacks using AODV Protocolijsrd.com
MANET(Mobile Adhoc Network) is an emerging technology and have great strength to be applied in battlefields and commercial applications such as traffic surveillance, MANET is infrastructure less without any centralized controller. Each node contains routing capability. Each device in a MANET is independent and can move in any direction. One of the major challenges wireless mobile ad-hoc networks face today is security, because no central controller exists. MANETs are a kind of wireless ad hoc networks that usually has a routable networking environment on top of a link layer ad hoc network. There are many security attacks in MANET and DDoS (Distributed denial of service) is one of them. Our main objective is seeing the effect of DDoS in routing, Packet Drop Rate, End to End Delay, no. of Collisions due to attack on network. And with these parameters and many more also we build secure IDS to detect this kind of attack and block it. In this thesis main objective is to study and implement the security against the DDOS attack. DDoS (Distributed Denial of Service) attacks in the networks are required to be prevented, as early as possible before reaching the victim node. DDos attack causes depletion of the network resources such as network bandwidth, disk space, CPU time, data structures, and network connections. Dealing with DDoS attacks is difficult due to their properties such as dynamic attack rates, big scale of botnets. DDos attack become more difficult to handle if it occurs in wireless network because of the properties of ad hoc network such as dynamic topologies, low battery life, Unicast routing Multicast routing , Frequency of updates or network overhead , scalability , mobile agent based routing ,power aware routing etc. Thus it is better to prevent the distributed denial of service attack rather than allowing it to occur and then taking the necessary steps to handle it. The following quantitative metrics Packet Delivery Ratio (PDR), Number of Collisions are to be used to evaluate the performance of DDoS attacks and their prevention techniques under different combinations in the fixed mobile ad hoc network. In our simulation, the effect of DDoS attacks under different number of attackers is studied.
Definition
A decentralized type of wireless network, allowing people and devices to seamlessly internetwork in areas with no pre-existing communication infrastructure, It can turn the dream of networking at any place and at time into reality. We are almost there by the way .Ex- Bluetooth enabled mobile phones such as 3G, laptops, handheld digital devices, personal digital assistants, or wearable computers
A Survey of Various Routing and Channel Assignment Strategies for MR-MC WMNsijsrd.com
One fundamental problem of WMNs with a limited number of radio interfaces and orthogonal channels is that the performance degrades significantly as the network size grows. This results from increased interference between nodes and diminished spatial reuse over the network. A WMN node needs to share a common channel with each of its neighbours in the communication range, requiring it to set up a virtual link. Moreover, to reduce network interference, a node should minimize the number of neighbours that it shares a common channel with. The objective of a channel assignment strategy is to ensure efficient utilization of the available channels (e.g., by minimizing interference) while maximizing connectivity in the network. However, since these two requirements are conflicting with each other, the goal is to achieve a balance between these two. The major constraints which need to be satisfied by a channel assignment scheme include fixed number of channels in the network, limited number of radios in mesh nodes, common channel between two communicating nodes, and limited channel capacity. Also, a channel assignment scheme should take the amount of traffic load supported by each mesh node into consideration.
Implementation of Vertical Handoff Algorithm between IEEE 802.11 WLAN & CDMA ...IOSR Journals
Abstract : Wireless communications is the fastest growing segment of the communications industry. Everyone wants the quality of services anytime & anywhere. Wireless networks can integrate various heterogeneous radio access technologies as GSM, WLAN, Wimax etc. WiMAX is an IP based, wireless broadband access technology that provides performance similar to 802.11/Wi-Fi networks with the coverage and QOS (quality of service) of cellular networks. WiMAX is also an acronym meaning "Worldwide Interoperability for Microwave Access (WiMAX). The main promise of interconnecting these heterogeneous networks is to provide high performance in achieving a high data rate and support real time applications. These services require various networks (such as CDMA2000 and Wireless LAN) to be integrated into IP-based networks, which further require a seamless vertical handoff to 4th generation wireless networks. When a mobile host (MH) changes its point of attachment, its IP address gets changed. MH should be able to maintain all the existing connections using the new IP address. This process of changing a connection from one IP address to another one in IP network is called handoff. Vertical handoff is switching from one network to another while maintaining the session. Vertical Handoff (VHO) is a major concern for different heterogeneous networks. VHO can be user requested or based on some criteria already designed by the researcher of that particular algorithm. The main objective is to implement efficient & effective handoff scheme between two heterogeneous network ie. 802.11 WLAN & CDMA. Keywords - CDMA , 4G, Vertical Handoff, WLAN
Implementation of Vertical Handoff Algorithm between IEEE 802.11 WLAN & CDMA ...IOSR Journals
Wireless communications is the fastest growing segment of the communications industry. Everyone
wants the quality of services anytime & anywhere. Wireless networks can integrate various heterogeneous radio
access technologies as GSM, WLAN, Wimax etc. WiMAX is an IP based, wireless broadband access technology
that provides performance similar to 802.11/Wi-Fi networks with the coverage and QOS (quality of service) of
cellular networks. WiMAX is also an acronym meaning "Worldwide Interoperability for Microwave Access
(WiMAX). The main promise of interconnecting these heterogeneous networks is to provide high performance in
achieving a high data rate and support real time applications. These services require various networks (such as
CDMA2000 and Wireless LAN) to be integrated into IP-based networks, which further require a seamless
vertical handoff to 4th generation wireless networks. When a mobile host (MH) changes its point of attachment,
its IP address gets changed. MH should be able to maintain all the existing connections using the new IP
address. This process of changing a connection from one IP address to another one in IP network is called
handoff. Vertical handoff is switching from one network to another while maintaining the session. Vertical
Handoff (VHO) is a major concern for different heterogeneous networks. VHO can be user requested or based
on some criteria already designed by the researcher of that particular algorithm. The main objective is to
implement efficient & effective handoff scheme between two heterogeneous network ie. 802.11 WLAN &
CDMA
Edhole School provides best Information about Schools in India, Delhi, Noida, Gurgaon. Here you will get about the school, contact, career, etc. Edhole Provides best study material for school students.
Help the Genetic Algorithm to Minimize the Urban Traffic on IntersectionsIJORCS
Control of traffic lights at the intersections of the main issues is the optimal traffic. Intersections to regulate traffic flow of vehicles and eliminate conflicting traffic flows are used. Modeling and simulation of traffic are widely used in industry. In fact, the modeling and simulation of an industrial system is studied before creating economically and when it is affordable. The aim of this article is a smart way to control traffic. The first stage of the project with the objective of collecting statistical data (cycle time of each of the intersection of the lights of vehicles is waiting for a red light) steps where the data collection found optimal amounts next it is. Introduced by genetic algorithm optimization of parameters is performed. GA begin with coding step as a binary variable (the range specified by the initial data set is obtained) will start with an initial population and then a new generation of genetic operators mutation and crossover and will Finally, the members of the optimal fitness values are selected as the solution set. The optimal output of Petri nets CPN TOOLS modeling and software have been implemented. The results indicate that the performance improvement project in intersections traffic control systems. It is known that other data collected and enforced intersections of evolutionary methods such as genetic algorithms to reduce the waiting time for traffic lights behind the red lights and to determine the appropriate cycle.
License plate recognition system is one of the core technologies in intelligent traffic control. In this paper, a new and tunable algorithm which can detect multiple license plates in high resolution applications is proposed. The algorithm aims at investigation into and identification of the novel Iranian and some European countries plate, characterized by both inclusion of blue area on it and its geometric shape. Obviously, the suggested algorithm contains suitable velocity due to not making use of heavy pre-processing operation such as image-improving filters, edge-detection operation and omission of noise at the beginning stages. So, the recommended method of ours is compatible with model-adaptation, i.e., the very blue section of the plate so that the present method indicated the fact that if several plates are included in the image, the method can successfully manage to detect it. We evaluated our method on the two Persian single vehicle license plate data set that we obtained 99.33, 99% correct recognition rate respectively. Further we tested our algorithm on the Persian multiple vehicle license plate data set and we achieved 98% accuracy rate. Also we obtained approximately 99% accuracy in character recognition stage.
FPGA Implementation of FIR Filter using Various Algorithms: A RetrospectiveIJORCS
This Paper is a review study of FPGA implementation of Finite Impulse response (FIR) with low cost and high performance. The key observation of this paper is an elaborate analysis about hardware implementations of FIR filters using different algorithm i.e., Distributed Arithmetic (DA), DA-Offset Binary Coding (DA-OBC), Common Sub-expression Elimination (CSE) and sum-of-power-of-two (SOPOT) with less resources and without affecting the performance of the original FIR Filter.
Using Virtualization Technique to Increase Security and Reduce Energy Consump...IJORCS
An approach has been presented in this paper in order to generate a secure environment on internet Based Virtual Computing platform and also to reduce energy consumption in green cloud computing. The proposed approach constantly checks the accuracy of stored data by means of a central control service inside the network environment and also checks system security through isolating single virtual machines using a common virtual environment. This approach has been simulated on two types of Virtual Machine Manager (VMM) Quick EMUlator (Qemu), HVM (Hardware Virtual Machine) Xen and outputs of the simulation in VMInsight show that when service is getting singly used, the overhead of its performance will be increased. As a secure system, the proposed approach is able to recognize malicious behaviors and assure service security by means of operational integrity measurement. Moreover, the rate of system efficiency has been evaluated according to the amount of energy consumption on five applications (Defragmentation, Compression, Linux Boot Decompression and Kernel Boot). Therefore, this has been resulted that to secure multi-tenant environment, managers and supervisors should independently install a security monitoring system for each Virtual Machines (VMs) which will come up to have the management heavy workload of. While the proposed approach, can respond to all VM’s with just one virtual machine as a supervisor.
Algebraic Fault Attack on the SHA-256 Compression FunctionIJORCS
The cryptographic hash function SHA-256 is one member of the SHA-2 hash family, which was proposed in 2000 and was standardized by NIST in 2002 as a successor of SHA-1. Although the differential fault attack on SHA-1compression function has been proposed, it seems hard to be directly adapted to SHA-256. In this paper, an efficient algebraic fault attack on SHA-256 compression function is proposed under the word-oriented random fault model. During the attack, an automatic tool STP is exploited, which constructs binary expressions for the word-based operations in SHA-256 compression function and then invokes a SAT solver to solve the equations. The simulation of the new attack needs about 65 fault injections to recover the chaining value and the input message block with about 200 seconds on average. Moreover, based on the attack on SHA-256 compression function, an almost universal forgery attack on HMAC-SHA-256 is presented. Our algebraic fault analysis is generic, automatic and can be applied to other ARX-based primitives.
Hybrid Simulated Annealing and Nelder-Mead Algorithm for Solving Large-Scale ...IJORCS
This paper presents a new algorithm for solving large scale global optimization problems based on hybridization of simulated annealing and Nelder-Mead algorithm. The new algorithm is called simulated Nelder-Mead algorithm with random variables updating (SNMRVU). SNMRVU starts with an initial solution, which is generated randomly and then the solution is divided into partitions. The neighborhood zone is generated, random number of partitions are selected and variables updating process is starting in order to generate a trail neighbor solutions. This process helps the SNMRVU algorithm to explore the region around a current iterate solution. The Nelder- Mead algorithm is used in the final stage in order to improve the best solution found so far and accelerates the convergence in the final stage. The performance of the SNMRVU algorithm is evaluated using 27 scalable benchmark functions and compared with four algorithms. The results show that the SNMRVU algorithm is promising and produces high quality solutions with low computational costs.
Welcoming the research scholars, scientists around the globe in the Open Access Dimension, IJORCS is now accepting manuscripts for its next issue (Volume 4, Issue 2). Authors are encouraged to contribute to the research community by submitting to IJORCS, articles that clarify new research results, projects, surveying works and industrial experiences that describe significant advances in field of computer science.
To view complete list of topics coverage of IJORCS, Aim & Scope, please visit, www.ijorcs.org/scope
Welcoming the research scholars, scientists around the globe in the Open Access Dimension, IJORCS is now accepting manuscripts for its next issue (Volume 4, Issue 1). Authors are encouraged to contribute to the research community by submitting to IJORCS, articles that clarify new research results, projects, surveying works and industrial experiences that describe significant advances in field of computer science.
Voice Recognition System using Template MatchingIJORCS
It is easy for human to recognize familiar voice but using computer programs to identify a voice when compared with others is a herculean task. This is due to the problem that is encountered when developing the algorithm to recognize human voice. It is impossible to say a word the same way in two different occasions. Human speech analysis by computer gives different interpretation based on varying speed of speech delivery. This research paper gives detail description of the process behind implementation of an effective voice recognition algorithm. The algorithm utilize discrete Fourier transform to compare the frequency spectra of two voice samples because it remained unchanged as speech is slightly varied. Chebyshev inequality is then used to determine whether the two voices came from the same person. The algorithm is implemented and tested using MATLAB.
Channel Aware Mac Protocol for Maximizing Throughput and FairnessIJORCS
The proper channel utilization and the queue length aware routing protocol is a challenging task in MANET. To overcome this drawback we are extending the previous work by improving the MAC protocol to maximize the Throughput and Fairness. In this work we are estimating the channel condition and Contention for a channel aware packet scheduling and the queue length is also calculated for the routing protocol which is aware of the queue length. The channel is scheduled based on the channel condition and the routing is carried out by considering the queue length. This queue length will provide a measurement of traffic load at the mobile node itself. Depending upon this load the node with the lesser load will be selected for the routing; this will effectively balance the load and improve the throughput of the ad hoc network.
A Review and Analysis on Mobile Application Development Processes using Agile...IJORCS
Over a last decade, mobile telecommunication industry has observed a rapid growth, proved to be highly competitive, uncertain and dynamic environment. Besides its advancement, it has also raised number of questions and gained concern both in industry and research. The development process of mobile application differs from traditional softwares as the users expect same features similar to their desktop computer applications with additional mobile specific functionalities. Advanced mobile applications require assimilation with existing enterprise computing systems such as databases, legacy applications and Web services. In addition, the lifecycle of a mobile application moves much faster than that of a traditional Web application and therefore the lifecycle management associated therein must be adjusted accordingly. The Security and application testing are more stimulating and interesting in mobile application than in Web applications since the technology in mobile devices progresses rapidly and developers must stay in touch with the latest developments, news and trends in their area of work. With the rising competence of software market, researchers are seeking more flexible methods that can adjust to dynamic situations where software system requirements are changing over time, producing valuable software in short duration and within low budget. The intrinsic uncertainty and complexity in any software project therefore requires an iterative developmental plan to cope with uncertainty and a large number of unknown variables. Agile Methodologies were thus introduced to meet the new requirements of the software development companies. The agile methodologies aim at facilitating software development processes where changes are acceptable at any stage and provide a structure for highly collaborative software development. Therefore, the present paper aims in reviewing and analysing different prevalent methodologies utilizing agile techniques that are currently in use for the development of mobile applications. This paper provides a detailed review and analysis on the use of agile methodologies in the proposed processes associated with mobile application skills and highlights its benefit and constraints. In addition, based on this analysis, future research needs are identified and discussed.
Congestion Prediction and Adaptive Rate Adjustment Technique for Wireless Sen...IJORCS
In general, nodes in Wireless Sensor Networks (WSNs) are equipped with limited battery and computation capabilities but the occurrence of congestion consumes more energy and computation power by retransmitting the data packets. Thus, congestion should be regulated to improve network performance. In this paper, we propose a congestion prediction and adaptive rate adjustment technique for Wireless Sensor Networks. This technique predicts congestion level using fuzzy logic system. Node degree, data arrival rate and queue length are taken as inputs to the fuzzy system and congestion level is obtained as an outcome. When the congestion level is amidst moderate and maximum ranges, adaptive rate adjustment technique is triggered. Our technique prevents congestion by controlling data sending rate and also avoids unsolicited packet losses. By simulation, we prove the proficiency our technique. It increases system throughput and network performance significantly.
A Study of Routing Techniques in Intermittently Connected MANETsIJORCS
A Mobile Ad hoc Network (MANET) is a self-configuring infrastructure less network of mobile devices connected by wireless. These are a kind of wireless Ad hoc Networks that usually has a routable networking environment on top of a Link Layer Ad hoc Network. The routing approach in MANET includes mainly three categories viz., Reactive Protocols, Proactive Protocols and Hybrid Protocols. These traditional routing schemes are not pertinent to the so called Intermittently Connected Mobile Ad hoc Network (ICMANET). ICMANET is a form of Delay Tolerant Network, where there never exists a complete end – to – end path between two nodes wishing to communicate. The intermittent connectivity araise when network is sparse or highly mobile. Routing in such a spasmodic environment is arduous. In this paper, we put forward the indication of prevailing routing approaches for ICMANET with their benefits and detriments
Improving the Efficiency of Spectral Subtraction Method by Combining it with ...IJORCS
In the field of speech signal processing, Spectral subtraction method (SSM) has been successfully implemented to suppress the noise that is added acoustically. SSM does reduce the noise at satisfactory level but musical noise is a major drawback of this method. To implement spectral subtraction method, transformation of speech signal from time domain to frequency domain is required. On the other hand, Wavelet transform displays another aspect of speech signal. In this paper we have applied a new approach in which SSM is cascaded with wavelet thresholding technique (WTT) for improving the quality of speech signal by removing the problem of musical noise to a great extent. Results of this proposed system have been simulated on MATLAB.
The Design of Cognitive Social Simulation Framework using Statistical Methodo...IJORCS
Modeling the behavior of the cognitive architecture in the context of social simulation using statistical methodologies is currently a growing research area. Normally, a cognitive architecture for an intelligent agent involves artificial computational process which exemplifies theories of cognition in computer algorithms under the consideration of state space. More specifically, for such cognitive system with large state space the problem like large tables and data sparsity are faced. Hence in this paper, we have proposed a method using a value iterative approach based on Q-learning algorithm, with function approximation technique to handle the cognitive systems with large state space. From the experimental results in the application domain of academic science it has been verified that the proposed approach has better performance compared to its existing approaches.
A PSO-Based Subtractive Data Clustering AlgorithmIJORCS
There is a tremendous proliferation in the amount of information available on the largest shared information source, the World Wide Web. Fast and high-quality clustering algorithms play an important role in helping users to effectively navigate, summarize, and organize the information. Recent studies have shown that partitional clustering algorithms such as the k-means algorithm are the most popular algorithms for clustering large datasets. The major problem with partitional clustering algorithms is that they are sensitive to the selection of the initial partitions and are prone to premature converge to local optima. Subtractive clustering is a fast, one-pass algorithm for estimating the number of clusters and cluster centers for any given set of data. The cluster estimates can be used to initialize iterative optimization-based clustering methods and model identification methods. In this paper, we present a hybrid Particle Swarm Optimization, Subtractive + (PSO) clustering algorithm that performs fast clustering. For comparison purpose, we applied the Subtractive + (PSO) clustering algorithm, PSO, and the Subtractive clustering algorithms on three different datasets. The results illustrate that the Subtractive + (PSO) clustering algorithm can generate the most compact clustering results as compared to other algorithms.
Dynamic Map and Diffserv Based AR Selection for Handoff in HMIPv6 Networks IJORCS
In HMIPv6 Networks, most of the existing handoff decision mechanisms deal mainly with the selection of Mobility Anchor Point (MAP), ignoring the selection of access router (AR) under each MAP. In this paper, we propose a new mechanism called “Dynamic MAP and Diffserv based ARs selection for Handoff in HMIPv6 networks” and it deals with selecting the MAP as well as ARs. MAP will be selected dynamically by checking load, session mobility ratio (SMR), Binding update cost and Location Rate. After selecting the best MAP, the Diffserv approach is used to select the AR under the MAP, based on its resource availability. The AR is implemented at the edge router of Diffserv. DiffServ can be used to provide low-latency to critical network traffic such as voice or streaming media while providing simple best-effort service to non-critical services such as web traffic or file transfers. By using this mechanism, we can assure that better resource utilization and throughput can be attained during Handoff in HMIPv6 networks.
From Physical to Virtual Wireless Sensor Networks using Cloud Computing IJORCS
In the modern world, billions of physical sensors are used for various dedications: Environment Monitoring, Healthcare, Education, Defense, Manufacturing, Smart Home, Agriculture Precision and others. Nonetheless, they are frequently utilized by their own applications and thereby snubbing the significant possibilities of sharing the resources in order to ensure the availability and performance of physical sensors. This paper assumes that the immense power of the Cloud can only be fully exploited if it is impeccably integrated into our physical lives. The principal merit of this work is a novel architecture where users can share several types of physical sensors easily and consequently many new services can be provided via a virtualized structure that allows allocation of sensor resources to different users and applications under flexible usage scenarios within which users can easily collect, access, process, visualize, archive, share and search large amounts of sensor data from different applications. Moreover, an implementation has been achieved using Arduino-Atmega328 as hardware platform and Eucalyptus/Open Stack with Orchestra-Juju for Private Sensor Cloud. Then this private Cloud has been connected to some famous public clouds such as Amazon EC2, ThingSpeak, SensorCloud and Pachube. The testing was successful at 80%. The recommendation for future work would be to improve the effectiveness of virtual sensors by applying optimization techniques and other methods.
Prediction of Atmospheric Pressure at Ground Level using Artificial Neural Ne...IJORCS
Prediction of Atmospheric Pressure is one important and challenging task that needs lot of attention and study for analyzing atmospheric conditions. Advent of digital computers and development of data driven artificial intelligence approaches like Artificial Neural Networks (ANN) have helped in numerical prediction of pressure. However, very few works have been done till now in this area. The present study developed an ANN model based on the past observations of several meteorological parameters like temperature, humidity, air pressure and vapour pressure as an input for training the model. The novel architecture of the proposed model contains several multilayer perceptron network (MLP) to realize better performance. The model is enriched by analysis of alternative hybrid model of k-means clustering and MLP. The improvement of the performance in the prediction accuracy has been demonstrated by the automatic selection of the appropriate cluster.
DevOps and Testing slides at DASA ConnectKari Kakkonen
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
Generative AI Deep Dive: Advancing from Proof of Concept to ProductionAggregage
Join Maher Hanafi, VP of Engineering at Betterworks, in this new session where he'll share a practical framework to transform Gen AI prototypes into impactful products! He'll delve into the complexities of data collection and management, model selection and optimization, and ensuring security, scalability, and responsible use.
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
Pushing the limits of ePRTC: 100ns holdover for 100 daysAdtran
At WSTS 2024, Alon Stern explored the topic of parametric holdover and explained how recent research findings can be implemented in real-world PNT networks to achieve 100 nanoseconds of accuracy for up to 100 days.
Threats to mobile devices are more prevalent and increasing in scope and complexity. Users of mobile devices desire to take full advantage of the features
available on those devices, but many of the features provide convenience and capability but sacrifice security. This best practices guide outlines steps the users can take to better protect personal devices and information.
Sudheer Mechineni, Head of Application Frameworks, Standard Chartered Bank
Discover how Standard Chartered Bank harnessed the power of Neo4j to transform complex data access challenges into a dynamic, scalable graph database solution. This keynote will cover their journey from initial adoption to deploying a fully automated, enterprise-grade causal cluster, highlighting key strategies for modelling organisational changes and ensuring robust disaster recovery. Learn how these innovations have not only enhanced Standard Chartered Bank’s data infrastructure but also positioned them as pioneers in the banking sector’s adoption of graph technology.
A tale of scale & speed: How the US Navy is enabling software delivery from l...sonjaschweigert1
Rapid and secure feature delivery is a goal across every application team and every branch of the DoD. The Navy’s DevSecOps platform, Party Barge, has achieved:
- Reduction in onboarding time from 5 weeks to 1 day
- Improved developer experience and productivity through actionable findings and reduction of false positives
- Maintenance of superior security standards and inherent policy enforcement with Authorization to Operate (ATO)
Development teams can ship efficiently and ensure applications are cyber ready for Navy Authorizing Officials (AOs). In this webinar, Sigma Defense and Anchore will give attendees a look behind the scenes and demo secure pipeline automation and security artifacts that speed up application ATO and time to production.
We will cover:
- How to remove silos in DevSecOps
- How to build efficient development pipeline roles and component templates
- How to deliver security artifacts that matter for ATO’s (SBOMs, vulnerability reports, and policy evidence)
- How to streamline operations with automated policy checks on container images
UiPath Test Automation using UiPath Test Suite series, part 5DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 5. In this session, we will cover CI/CD with devops.
Topics covered:
CI/CD with in UiPath
End-to-end overview of CI/CD pipeline with Azure devops
Speaker:
Lyndsey Byblow, Test Suite Sales Engineer @ UiPath, Inc.
Goodbye Windows 11: Make Way for Nitrux Linux 3.5.0!SOFTTECHHUB
As the digital landscape continually evolves, operating systems play a critical role in shaping user experiences and productivity. The launch of Nitrux Linux 3.5.0 marks a significant milestone, offering a robust alternative to traditional systems such as Windows 11. This article delves into the essence of Nitrux Linux 3.5.0, exploring its unique features, advantages, and how it stands as a compelling choice for both casual users and tech enthusiasts.
Essentials of Automations: The Art of Triggers and Actions in FMESafe Software
In this second installment of our Essentials of Automations webinar series, we’ll explore the landscape of triggers and actions, guiding you through the nuances of authoring and adapting workspaces for seamless automations. Gain an understanding of the full spectrum of triggers and actions available in FME, empowering you to enhance your workspaces for efficient automation.
We’ll kick things off by showcasing the most commonly used event-based triggers, introducing you to various automation workflows like manual triggers, schedules, directory watchers, and more. Plus, see how these elements play out in real scenarios.
Whether you’re tweaking your current setup or building from the ground up, this session will arm you with the tools and insights needed to transform your FME usage into a powerhouse of productivity. Join us to discover effective strategies that simplify complex processes, enhancing your productivity and transforming your data management practices with FME. Let’s turn complexity into clarity and make your workspaces work wonders!
Maruthi Prithivirajan, Head of ASEAN & IN Solution Architecture, Neo4j
Get an inside look at the latest Neo4j innovations that enable relationship-driven intelligence at scale. Learn more about the newest cloud integrations and product enhancements that make Neo4j an essential choice for developers building apps with interconnected data and generative AI.
UiPath Test Automation using UiPath Test Suite series, part 6DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 6. In this session, we will cover Test Automation with generative AI and Open AI.
UiPath Test Automation with generative AI and Open AI webinar offers an in-depth exploration of leveraging cutting-edge technologies for test automation within the UiPath platform. Attendees will delve into the integration of generative AI, a test automation solution, with Open AI advanced natural language processing capabilities.
Throughout the session, participants will discover how this synergy empowers testers to automate repetitive tasks, enhance testing accuracy, and expedite the software testing life cycle. Topics covered include the seamless integration process, practical use cases, and the benefits of harnessing AI-driven automation for UiPath testing initiatives. By attending this webinar, testers, and automation professionals can gain valuable insights into harnessing the power of AI to optimize their test automation workflows within the UiPath ecosystem, ultimately driving efficiency and quality in software development processes.
What will you get from this session?
1. Insights into integrating generative AI.
2. Understanding how this integration enhances test automation within the UiPath platform
3. Practical demonstrations
4. Exploration of real-world use cases illustrating the benefits of AI-driven test automation for UiPath
Topics covered:
What is generative AI
Test Automation with generative AI and Open AI.
UiPath integration with generative AI
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
GraphSummit Singapore | The Art of the Possible with Graph - Q2 2024Neo4j
Neha Bajwa, Vice President of Product Marketing, Neo4j
Join us as we explore breakthrough innovations enabled by interconnected data and AI. Discover firsthand how organizations use relationships in data to uncover contextual insights and solve our most pressing challenges – from optimizing supply chains, detecting fraud, and improving customer experiences to accelerating drug discoveries.
Dr. Sean Tan, Head of Data Science, Changi Airport Group
Discover how Changi Airport Group (CAG) leverages graph technologies and generative AI to revolutionize their search capabilities. This session delves into the unique search needs of CAG’s diverse passengers and customers, showcasing how graph data structures enhance the accuracy and relevance of AI-generated search results, mitigating the risk of “hallucinations” and improving the overall customer journey.
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
2. 34 Mehtab Singh Kahlon
networks is a challenging issue, taking power
consumption into consideration. One critical issue for
all kinds of mobile nodes supported by battery powers
is power saving. Without power, any mobile node will
become useless. Battery power being limited,
extending the lifetime of batteries is an important
issue, especially for Mobile Ad Hoc Networks
(MANETs). To reduce the energy consumption in
mobile devices, there have been efforts in physical and
data link layers as well as in the network layer related
to the routing protocol. The purpose of power-aware
routing protocols is to maximize the network lifetime
[2].
Fig.2: Mobile ad hoc network
VI. APPLICATIONS OF AD HOC NETWORKS
III. QUALITY OF SERVICE (QOS)
A. Conferencing
Quality of Service (QoS) is not easily achieved in
ad hoc networks. To provide QoS routing in Ad hoc Perhaps the prototypical application requiring the
networks, it is not just sufficient to provide a basic establishment of an ad hoc network is mobile
routing functionality where only a feasible route is conferencing. When mobile computer users gather
found, other aspects like the bandwidth constraints due outside their normal office environment, the business
to shared media, dynamic topology due to network infrastructure is often missing. But the need
continuously changing topology and the power for collaborative computing might be even more
consumption due to limited battery powers must also important here than in the everyday office
be considered. The nodes in the Ad hoc network move environment. Indeed, the whole point of the meeting
randomly, hence, the topology changes continuously might be to make some further progress on a particular
resulting in route breakage. Thus, the route breakage collaborative project. Given that today’s project
must first be detected and a new route should be found environments are heavily computerized, for projects in
to the destination in advance. The quality-of-service a very broad range of industries the need for being able
(QoS) routing in an ad hoc network is difficult because to create an ad hoc network seems clear.
the network topology may change constantly, and the B. Home Networking
available state information for routing is inherently
imprecise [3, 4]. As another example, consider the scenario that will
likely result if wireless computers become popular at
IV. LOCATION-AIDED ROUTING (LAR) home. These computers will probably be taken to and
The LAR protocols use location information (which from the office work environment and on business
may be out of date, by the time it is used) to reduce the trips. It is quite possible that such computers will not
search space for a desired route. Limiting the search have topologically related IP addresses, especially if
space results in fewer route discovery messages. they are connected at the offices of each parent or at
Location information used in the LAR protocol may be the children’s school. Keeping in mind the
provided by the Global Positioning System (GPS). convenience that an unchanging IP address affords to
With the availability of GPS, it is possible for a mobile the user, it would be nice to allow the various mobile
host to know its physical location [3]. In reality, computers to operate an ad hoc network in the home,
position information provided by GPS includes some even if the home maintains its own subnet with more
amount of error, which is the difference between GPS- or less permanently situated network nodes.
calculated coordinates and the real coordinates. For
instance, NAVSTAR Global Positioning System has
positional accuracy of about 50–100 m and
Differential GPS offers accuracies of a few meters [5].
V. ENERGY RELATED ISSUE
In ad hoc networks, each device plays the role of a
router and has limited battery energy. In addition, the
network topology can constantly change. Thus, it is
widely accepted that conventional routing protocols
are not appropriate for mobile ad hoc networks and
consequently, the design of routing protocols for such Fig.3: Home Networking
www.ijorcs.org