Search results for: Proactive Source Routing (PSR)
1671 Kinematic Parameters for Asa River Routing
Authors: A. O. Ogunlela, B. Adelodun
Abstract:
Flood routing is used in estimating the travel time and attenuation of flood waves as they move downstream a river or channel. The routing procedure is usually classified as hydrologic or hydraulic. Hydraulic methods utilize the equations of continuity and motion. Kinematic routing, a hydraulic technique was used in routing Asa River at Ilorin. The river is of agricultural and industrial importance to Ilorin, the capital of Kwara State, Nigeria. This paper determines the kinematic parameters of kinematic wave velocity, time step, time required to traverse, weighting factor and change in length. Values obtained were 4.67 m/s, 19 secs, 21 secs, 0.75 and 100 m, respectively. These parameters adequately reflect the watershed and flow characteristics essential for the routing. The synthetic unit hydrograph was developed using the Natural Resources Conservation Service (NRCS) method. 24-hr 10yr, 25yr, 50yr and 100yr storm hydrographs were developed from the unit hydrograph using convolution procedures and the outflow hydrographs were obtained for each of 24-hr 10yr, 25yr, 50yr and 100yr indicating 0.11 m3/s, 0.10 m3/s, 0.10 m3/s and 0.10 m3/s attenuations respectively.
Keywords: Asa River, Kinematic parameters, Routing
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 22871670 Energy Aware Adhoc On-demand Multipath Distance Vector Protocol for QoS Routing
Authors: J. Seetaram, P. Satish Kumar
Abstract:
Mobile Adhoc Networks (MANETs) are infrastructure-less, dynamic network of collections of wireless mobile nodes communicating with each other without any centralized authority. A MANET is a mobile device of interconnections through wireless links, forming a dynamic topology. Routing protocols have a big role in data transmission across a network. Routing protocols, two major classifications are unipath and multipath. This study evaluates performance of an on-demand multipath routing protocol named Adhoc On-demand Multipath Distance Vector routing (AOMDV). This study proposes Energy Aware AOMDV (EAAOMDV) an extension of AOMDV which decreases energy consumed on a route.Keywords: Mobile Adhoc Network (MANET), unipath, multipath, Adhoc On-demand Multipath Distance Vector routing (AOMDV).
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 21141669 Performance Evaluation of Energy Efficient Communication Protocol for Mobile Ad Hoc Networks
Authors: Toshihiko Sasama, Kentaro Kishida, Kazunori Sugahara, Hiroshi Masuyama
Abstract:
A mobile ad hoc network is a network of mobile nodes without any notion of centralized administration. In such a network, each mobile node behaves not only as a host which runs applications but also as a router to forward packets on behalf of others. Clustering has been applied to routing protocols to achieve efficient communications. A CH network expresses the connected relationship among cluster-heads. This paper discusses the methods for constructing a CH network, and produces the following results: (1) The required running costs of 3 traditional methods for constructing a CH network are not so different from each other in the static circumstance, or in the dynamic circumstance. Their running costs in the static circumstance do not differ from their costs in the dynamic circumstance. Meanwhile, although the routing costs required for the above 3 methods are not so different in the static circumstance, the costs are considerably different from each other in the dynamic circumstance. Their routing costs in the static circumstance are also very different from their costs in the dynamic circumstance, and the former is one tenths of the latter. The routing cost in the dynamic circumstance is mostly the cost for re-routing. (2) On the strength of the above results, we discuss new 2 methods regarding whether they are tolerable or not in the dynamic circumstance, that is, whether the times of re-routing are small or not. These new methods are revised methods that are based on the traditional methods. We recommended the method which produces the smallest routing cost in the dynamic circumstance, therefore producing the smallest total cost.Keywords: cluster, mobile ad hoc network, re-routing cost, simulation
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 13381668 Mobile Ad Hoc Networks and It’s Routing Protocols
Authors: Rakesh Kumar, Piush Verma, Yaduvir Singh
Abstract:
A mobile ad hoc network (MANET) is a self configuring network, without any centralized control. The topology of this network is not always defined. The main objective of this paper is to introduce the fundamental concepts of MANETs to the researchers and practitioners, who are involved in the work in the area of modeling and simulation of MANETs. This paper begins with an overview of mobile ad hoc networks. Then it proceeds with the overview of routing protocols used in the MANETS, their properties and simulation methods. A brief tabular comparison between the routing protocols is also given in this paper considering different routing protocol parameters. This paper introduces a new routing scheme developed by the use of evolutionary algorithms (EA) and analytical hierarchy process (AHP) which will be used for getting the optimized output of MANET. In this paper cryptographic technique, ceaser cipher is also employed for making the optimized route secure.
Keywords: AHP, AODV, Cryptography, EA, MANET, Optimized output.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 40081667 An Approach for Reducing the End-to-end Delay and Increasing Network Lifetime in Mobile Adhoc Networks
Authors: R. Asokan, A. M. Natarajan
Abstract:
Mobile adhoc network (MANET) is a collection of mobile devices which form a communication network with no preexisting wiring or infrastructure. Multiple routing protocols have been developed for MANETs. As MANETs gain popularity, their need to support real time applications is growing as well. Such applications have stringent quality of service (QoS) requirements such as throughput, end-to-end delay, and energy. Due to dynamic topology and bandwidth constraint supporting QoS is a challenging task. QoS aware routing is an important building block for QoS support. The primary goal of the QoS aware protocol is to determine the path from source to destination that satisfies the QoS requirements. This paper proposes a new energy and delay aware protocol called energy and delay aware TORA (EDTORA) based on extension of Temporally Ordered Routing Protocol (TORA).Energy and delay verifications of query packet have been done in each node. Simulation results show that the proposed protocol has a higher performance than TORA in terms of network lifetime, packet delivery ratio and end-to-end delay.Keywords: EDTORA, Mobile Adhoc Networks, QoS, Routing, TORA
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 23791666 A Survey on Opportunistic Routing in Mobile Ad Hoc Networks
Authors: R. Poonkuzhali, M. Y. Sanavullah, A. Sabari, T. Dhivyaa
Abstract:
Opportunistic Routing (OR) increases the transmission reliability and network throughput. Traditional routing protocols preselects one or more predetermined nodes before transmission starts and uses a predetermined neighbor to forward a packet in each hop. The opportunistic routing overcomes the drawback of unreliable wireless transmission by broadcasting one transmission can be overheard by manifold neighbors. The first cooperation-optimal protocol for Multirate OR (COMO) used to achieve social efficiency and prevent the selfish behavior of the nodes. The novel link-correlation-aware OR improves the performance by exploiting the miscellaneous low correlated forward links. Context aware Adaptive OR (CAOR) uses active suppression mechanism to reduce packet duplication. The Context-aware OR (COR) can provide efficient routing in mobile networks. By using Cooperative Opportunistic Routing in Mobile Ad hoc Networks (CORMAN), the problem of opportunistic data transfer can be tackled. While comparing to all the protocols, COMO is the best as it achieves social efficiency and prevents the selfish behavior of the nodes.Keywords: CAOR, COMO, COR, CORMAN, MANET, Opportunistic Routing, Reliability, Throughput.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 18681665 Evaluation of Energy-Aware QoS Routing Protocol for Ad Hoc Wireless Sensor Networks
Authors: M.K.Jeya Kumar
Abstract:
Many advanced Routing protocols for wireless sensor networks have been implemented for the effective routing of data. Energy awareness is an essential design issue and almost all of these routing protocols are considered as energy efficient and its ultimate objective is to maximize the whole network lifetime. However, the introductions of video and imaging sensors have posed additional challenges. Transmission of video and imaging data requires both energy and QoS aware routing in order to ensure efficient usage of the sensors and effective access to the gathered measurements. In this paper, the performance of the energy-aware QoS routing Protocol are analyzed in different performance metrics like average lifetime of a node, average delay per packet and network throughput. The parameters considered in this study are end-to-end delay, real time data generation/capture rates, packet drop probability and buffer size. The network throughput for realtime and non-realtime data was also has been analyzed. The simulation has been done in NS2 simulation environment and the simulation results were analyzed with respect to different metrics.
Keywords: Cluster nodes, end-to-end delay, QoS routing, routing protocols, sensor networks, least-cost-path.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 19321664 The Study of the Correlation of Proactive Coping and Retirement Planning: An Example of Senior Civil Servants in Taiwan
Authors: Ya-Hui Lee, Chien-Hung Hsieh, Ching-Yi Lu
Abstract:
Demographic aging is the major problem that Taiwanese society is facing, and retirement life adaptation is the most concerning issue. In recent years, studies have suggested that in order to have successful aging and retirement planning, a view for the future is necessary. In Taiwan, civil servants receive better pensions and retirement benefits than do other industries. Therefore, their retirement preparation is considerably more significant than other senior groups in Taiwan. The purpose of this study is to understand the correlation of proactive coping and retirement planning of senior civil servants in Taiwan. The method is conducted by questionnaire surveys, with 342 valid questionnaires collected. The results of this study are: 1. The background variables of the interviewees, including age, perceived economic statuses, and retirement statuses, are all significantly related to their proactive coping and retirement planning. 2. Regarding age, the interviewees with ages 55 and above have better proactive coping and retirement planning than those with ages 45 and below. 3. In the aspect of perceived economic statuses, the participants who feel “very good” economic statuses have better proactive coping ability and retirement readiness than those who feel “bad” and “very bad”. 4. Retirees have better proactive coping and retirement planning than those who are still working. 5. Monthly income is significant in retirement planning only. The participants’ retirement planning would be better if they have higher incomes. Furthermore, the participants’ retirement planning would be better if their revenue were €1453~€1937, than if their revenue were below €968. 6. There are positive correlations between proactive coping and retirement planning. 7. Proactive coping can predict retirement planning. The result of this study will be provided as references to the Taiwan government for educational retirement planning policies.
Keywords: Civil servants, proactive coping, retirement planning.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 17561663 A Subjectively Influenced Router for Vehicles in a Four-Junction Traffic System
Authors: Anilkumar Kothalil Gopalakrishnan
Abstract:
A subjectively influenced router for vehicles in a fourjunction traffic system is presented. The router is based on a 3-layer Backpropagation Neural Network (BPNN) and a greedy routing procedure. The BPNN detects priorities of vehicles based on the subjective criteria. The subjective criteria and the routing procedure depend on the routing plan towards vehicles depending on the user. The routing procedure selects vehicles from their junctions based on their priorities and route them concurrently to the traffic system. That is, when the router is provided with a desired vehicles selection criteria and routing procedure, it routes vehicles with a reasonable junction clearing time. The cost evaluation of the router determines its efficiency. In the case of a routing conflict, the router will route the vehicles in a consecutive order and quarantine faulty vehicles. The simulations presented indicate that the presented approach is an effective strategy of structuring a subjective vehicle router.Keywords: Backpropagation Neural Network, Backpropagationalgorithm, Greedy routing procedure, Subjective criteria, Vehiclepriority, Cost evaluation, Route generation
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 13821662 Cluster-Based Multi-Path Routing Algorithm in Wireless Sensor Networks
Authors: Si-Gwan Kim
Abstract:
Small-size and low-power sensors with sensing, signal processing and wireless communication capabilities is suitable for the wireless sensor networks. Due to the limited resources and battery constraints, complex routing algorithms used for the ad-hoc networks cannot be employed in sensor networks. In this paper, we propose node-disjoint multi-path hexagon-based routing algorithms in wireless sensor networks. We suggest the details of the algorithm and compare it with other works. Simulation results show that the proposed scheme achieves better performance in terms of efficiency and message delivery ratio.Keywords: Clustering, multi-path, routing protocol, sensor network.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 24581661 Back Bone Node Based Black Hole Detection Mechanism in Mobile Ad Hoc Networks
Authors: Nidhi Gupta, Sanjoy Das, Khushal Singh
Abstract:
Mobile Ad hoc Network is a set of self-governing nodes which communicate through wireless links. Dynamic topology MANETs makes routing a challenging task. Various routing protocols are there, but due to various fundamental characteristic open medium, changing topology, distributed collaboration and constrained capability, these protocols are tend to various types of security attacks. Black hole is one among them. In this attack, malicious node represents itself as having the shortest path to the destination but that path not even exists. In this paper, we aim to develop a routing protocol for detection and prevention of black hole attack by modifying AODV routing protocol. This protocol is able to detect and prevent the black hole attack. Simulation is done using NS-2, which shows the improvement in network performance.Keywords: Ad hoc, AODV, Back Bone, routing, Security.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 21481660 A Distributed Weighted Cluster Based Routing Protocol for Manets
Authors: Naveen Chauhan, L.K. Awasthi, Narottam chand, Vivek Katiyar, Ankit Chug
Abstract:
Mobile ad-hoc networks (MANETs) are a form of wireless networks which do not require a base station for providing network connectivity. Mobile ad-hoc networks have many characteristics which distinguish them from other wireless networks which make routing in such networks a challenging task. Cluster based routing is one of the routing schemes for MANETs in which various clusters of mobile nodes are formed with each cluster having its own clusterhead which is responsible for routing among clusters. In this paper we have proposed and implemented a distributed weighted clustering algorithm for MANETs. This approach is based on combined weight metric that takes into account several system parameters like the node degree, transmission range, energy and mobility of the nodes. We have evaluated the performance of proposed scheme through simulation in various network situations. Simulation results show that proposed scheme outperforms the original distributed weighted clustering algorithm (DWCA).Keywords: MANETs, Clustering, Routing, WirelessCommunication, Distributed Clustering
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 18821659 A New Routing Algorithm: MIRAD
Authors: Amir Gholami Pastaki, Ali Reza Sahab, Seyed Mehdi Sadeghi
Abstract:
LSP routing is among the prominent issues in MPLS networks traffic engineering. The objective of this routing is to increase number of the accepted requests while guaranteeing the quality of service (QoS). Requested bandwidth is the most important QoS criterion that is considered in literatures, and a various number of heuristic algorithms have been presented with that regards. Many of these algorithms prevent flows through bottlenecks of the network in order to perform load balancing, which impedes optimum operation of the network. Here, a modern routing algorithm is proposed as MIRAD: having a little information of the network topology, links residual bandwidth, and any knowledge of the prospective requests it provides every request with a maximum bandwidth as well as minimum end-to-end delay via uniform load distribution across the network. Simulation results of the proposed algorithm show a better efficiency in comparison with similar algorithms.Keywords: new generation networks, QoS, traffic engineering, MPLS, QoS based routing, LSP
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 19071658 Effects of Network Dynamics on Routing Efficiency in P2P Networks
Authors: Mojca Ciglaric, Andrej Krevl, Matjaž Pancur, Tone Vidmar
Abstract:
P2P Networks are highly dynamic structures since their nodes – peer users keep joining and leaving continuously. In the paper, we study the effects of network change rates on query routing efficiency. First we describe some background and an abstract system model. The chosen routing technique makes use of cached metadata from previous answer messages and also employs a mechanism for broken path detection and metadata maintenance. Several metrics are used to show that the protocol behaves quite well even with high rate of node departures, but above a certain threshold it literally breaks down and exhibits considerable efficiency degradation.Keywords: Network dynamics, overlay network, P2P system, routing efficiency.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 13491657 Evaluation of Context Information for Intermittent Networks
Authors: S. Balaji, E. Golden Julie, Y. Harold Robinson
Abstract:
The context aware adaptive routing protocol is presented for unicast communication in intermittently connected mobile ad hoc networks (MANETs). The selection of the node is done by the Kalman filter prediction theory and it also makes use of utility functions. The context aware adaptive routing is defined by spray and wait technique, but the time consumption in delivering the message is too high and also the resource wastage is more. In this paper, we describe the spray and focus routing scheme for avoiding the existing problems.
Keywords: Context aware adaptive routing, Kalman filter prediction, spray and wait, spray and focus, intermittent networks.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 8981656 Load Balancing in Genetic Zone Routing Protocol for MANETs
Authors: P. Sateesh Kumar , S. Ramachandram
Abstract:
Genetic Zone Routing Protocol (GZRP) is a new hybrid routing protocol for MANETs which is an extension of ZRP by using Genetic Algorithm (GA). GZRP uses GA on IERP and BRP parts of ZRP to provide a limited set of alternative routes to the destination in order to load balance the network and robustness during node/link failure during the route discovery process. GZRP is studied for its performance compared to ZRP in many folds like scalability for packet delivery and proved with improved results. This paper presents the results of the effect of load balancing on GZRP. The results show that GZRP outperforms ZRP while balancing the load.Keywords: MANET, routing, ZRP, Genetic algorithm, GZRP, load balancing
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 21851655 Tabu Search Approach to Solve Routing Issues in Communication Networks
Authors: Anant Oonsivilai, Wichai Srisuruk, Boonruang Marungsri, Thanatchai Kulworawanichpong
Abstract:
Optimal routing in communication networks is a major issue to be solved. In this paper, the application of Tabu Search (TS) in the optimum routing problem where the aim is to minimize the computational time and improvement of quality of the solution in the communication have been addressed. The goal is to minimize the average delays in the communication. The effectiveness of Tabu Search method is shown by the results of simulation to solve the shortest path problem. Through this approach computational cost can be reduced.Keywords: Communication networks, optimum routing network, tabu search algorithm, shortest path.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 20861654 Energy-Aware Routing in Mobile Wireless Sensor Networks
Authors: R. Geetha, G. Umarani Srikanth, S. Prabhu
Abstract:
Wireless sensor networks are resource constrained networks, where energy is the major resource in such networks. Therefore, energy conservation is major aspect in the deployment of Wireless Sensor Network. This work makes use of an extended Greedy Perimeter Stateless Routing (eGPSR) protocol that mainly focuses on energy efficient data transmission. This data transmission is based on the fact that the message that is sent to a distant node consumes more energy than the message that is sent to a short range transmission. Every cluster contains a head set that consists of many virtual cluster heads. Routing is decided by head set members. The energy level of the received signal is the major constraint to choose head set from its members. The experimental result shows that the use of eGPSR in routing has improved throughput with comparatively less delay.
Keywords: eGPSR, energy efficiency, routing, wireless sensor networks, WSN.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 9131653 An Enhanced Associativity Based Routing with Fuzzy Based Trust to Mitigate Network Attacks
Authors: K. Geetha, P. Thangaraj
Abstract:
Mobile Ad Hoc Networks (MANETs) is a collection of mobile devices forming a communication network without infrastructure. MANET is vulnerable to security threats due to network’s limited security, dynamic topology, scalability and the lack of central management. The Quality of Service (QoS) routing in such networks is limited by network breakage caused by node mobility or nodes energy depletions. The impact of node mobility on trust establishment is considered and its use to propagate trust through a network is investigated in this paper. This work proposes an enhanced Associativity Based Routing (ABR) with Fuzzy based Trust (Fuzzy- ABR) routing protocol for MANET to improve QoS and to mitigate network attacks.Keywords: Mobile Ad hoc Networks (MANET), Associativity Based Routing (ABR), Fuzzy based Computed Trust.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 25461652 Integer Programming Model for the Network Design Problem with Facility Dependent Shortest Path Routing
Authors: Taehan Lee
Abstract:
We consider a network design problem which has shortest routing restriction based on the values determined by the installed facilities on each arc. In conventional multicommodity network design problem, a commodity can be routed through any possible path when the capacity is available. But, we consider a problem in which the commodity between two nodes must be routed on a path which has shortest metric value and the link metric value is determined by the installed facilities on the link. By this routing restriction, the problem has a distinct characteristic. We present an integer programming formulation containing the primal-dual optimality conditions to the shortest path routing. We give some computational results for the model.Keywords: Integer programming, multicommodity network design, routing, shortest path.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 10461651 An Overview of Energy Efficient Routing Protocols for Acoustic Sensor Network
Authors: V. P. Dhivya, R. Arthi
Abstract:
Underwater acoustic network is one of the rapidly growing areas of research and finds different applications for monitoring and collecting various data for environmental studies. The communication among dynamic nodes and high error probability in an acoustic medium forced to maximize energy consumption in Underwater Sensor Networks (USN) than in traditional sensor networks. Developing energy-efficient routing protocol is the fundamental and a curb challenge because all the sensor nodes are powered by batteries, and they cannot be easily replaced in UWSNs. This paper surveys the various recent routing techniques that mainly focus on energy efficiency.
Keywords: Acoustic channels, Energy efficiency, Routing in sensor networks, Underwater Sensor Network.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 29821650 Bee Optimized Fuzzy Geographical Routing Protocol for VANET
Authors: P. Saravanan, T. Arunkumar
Abstract:
Vehicular Adhoc Network (VANET) is a new technology which aims to ensure intelligent inter-vehicle communications, seamless internet connectivity leading to improved road safety, essential alerts, and access to comfort and entertainment. VANET operations are hindered by mobile node’s (vehicles) uncertain mobility. Routing algorithms use metrics to evaluate which path is best for packets to travel. Metrics like path length (hop count), delay, reliability, bandwidth, and load determine optimal route. The proposed scheme exploits link quality, traffic density, and intersections as routing metrics to determine next hop. This study enhances Geographical Routing Protocol (GRP) using fuzzy controllers while rules are optimized with Bee Swarm Optimization (BSO). Simulations results are compared to conventional GRP.
Keywords: Bee Swarm Optimization (BSO), Geographical Routing Protocol (GRP), Vehicular Adhoc Network (VANET).
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 24461649 Trust Based Energy Aware Reliable Reactive Protocol in Mobile Ad Hoc Networks
Authors: M. Pushpalatha, Revathi Venkataraman, T. Ramarao
Abstract:
Trust and Energy consumption is the most challenging issue in routing protocol design for Mobile ad hoc networks (MANETs), since mobile nodes are battery powered and nodes behaviour are unpredictable. Furthermore replacing and recharging batteries and making nodes co-operative is often impossible in critical environments like military applications. In this paper, we propose a trust based energy aware routing model in MANET. During route discovery, node with more trust and maximum energy capacity is selected as a router based on a parameter called 'Reliability'. Route request from the source is accepted by a node only if its reliability is high. Otherwise, the route request is discarded. This approach forms a reliable route from source to destination thus increasing network life time, improving energy utilization and decreasing number of packet loss during transmission.Keywords: Mobile Ad Hoc Networks, Trust, Energy, Reliability, AODV, TEA-AODV.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 26051648 Analysis of Equal cost Adaptive Routing Algorithms using Connection-Oriented and Connectionless Protocols
Authors: ER. Yashpaul Singh, A. Swarup
Abstract:
This research paper evaluates and compares the performance of equal cost adaptive multi-path routing algorithms taking the transport protocols TCP (Transmission Control Protocol) and UDP (User Datagram Protocol) using network simulator ns2 and concludes which one is better.Keywords: Multi-path routing algorithm, Datagram, Virtual Circuit, Throughput, Network services.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 14901647 Effects of Signaling on the Performance of Directed Diffusion Routing Protocol
Authors: Apidet Booranawong
Abstract:
In an original directed diffusion routing protocol, a sink requests sensing data from a source node by flooding interest messages to the network. Then, the source finds the sink by sending exploratory data messages to all nodes that generate incoming interest messages. This protocol signaling can cause heavy traffic in the network, an interference of the radio signal, collisions, great energy consumption of sensor nodes, etc. According to this research problem, this paper investigates the effect of sending interest and exploratory data messages on the performance of directed diffusion routing protocol. We demonstrate the research problem occurred from employing directed diffusion protocol in mobile wireless environments. For this purpose, we perform a set of experiments by using NS2 (network simulator 2). The radio propagation models; Two-ray ground reflection with and without shadow fading are included to investigate the effect of signaling. The simulation results show that the number of times of sent and received protocol signaling in the case of sending interest and exploratory data messages are larger than the case of sending other protocol signals, especially in the case of shadowing model. Additionally, the number of exploratory data message is largest in one round of the protocol procedure.
Keywords: Directed diffusion, Flooding, Interest message, Exploratory data message, Radio propagation model.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 17731646 A Taxonomy of Routing Protocols in Wireless Sensor Networks
Authors: A. Kardi, R. Zagrouba, M. Alqahtani
Abstract:
The Internet of Everything (IoE) presents today a very attractive and motivating field of research. It is basically based on Wireless Sensor Networks (WSNs) in which the routing task is the major analysis topic. In fact, it directly affects the effectiveness and the lifetime of the network. This paper, developed from recent works and based on extensive researches, proposes a taxonomy of routing protocols in WSNs. Our main contribution is that we propose a classification model based on nine classes namely application type, delivery mode, initiator of communication, network architecture, path establishment (route discovery), network topology (structure), protocol operation, next hop selection and latency-awareness and energy-efficient routing protocols. In order to provide a total classification pattern to serve as reference for network designers, each class is subdivided into possible subclasses, presented, and discussed using different parameters such as purposes and characteristics.
Keywords: WSNs, sensor, routing protocols, survey.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 10261645 Performance Analysis of Bluetooth Low Energy Mesh Routing Algorithm in Case of Disaster Prediction
Authors: Asmir Gogic, Aljo Mujcic, Sandra Ibric, Nermin Suljanovic
Abstract:
Ubiquity of natural disasters during last few decades have risen serious questions towards the prediction of such events and human safety. Every disaster regardless its proportion has a precursor which is manifested as a disruption of some environmental parameter such as temperature, humidity, pressure, vibrations and etc. In order to anticipate and monitor those changes, in this paper we propose an overall system for disaster prediction and monitoring, based on wireless sensor network (WSN). Furthermore, we introduce a modified and simplified WSN routing protocol built on the top of the trickle routing algorithm. Routing algorithm was deployed using the bluetooth low energy protocol in order to achieve low power consumption. Performance of the WSN network was analyzed using a real life system implementation. Estimates of the WSN parameters such as battery life time, network size and packet delay are determined. Based on the performance of the WSN network, proposed system can be utilized for disaster monitoring and prediction due to its low power profile and mesh routing feature.Keywords: Bluetooth low energy, disaster prediction, mesh routing protocols, wireless sensor networks.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 28371644 Performance Comparison and Analysis of Table-Driven and On-Demand Routing Protocols for Mobile Ad-hoc Networks
Authors: Narendra Singh Yadav, R.P.Yadav
Abstract:
Mobile ad hoc network is a collection of mobile nodes communicating through wireless channels without any existing network infrastructure or centralized administration. Because of the limited transmission range of wireless network interfaces, multiple "hops" may be needed to exchange data across the network. In order to facilitate communication within the network, a routing protocol is used to discover routes between nodes. The primary goal of such an ad hoc network routing protocol is correct and efficient route establishment between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This paper examines two routing protocols for mobile ad hoc networks– the Destination Sequenced Distance Vector (DSDV), the table- driven protocol and the Ad hoc On- Demand Distance Vector routing (AODV), an On –Demand protocol and evaluates both protocols based on packet delivery fraction, normalized routing load, average delay and throughput while varying number of nodes, speed and pause time.Keywords: AODV, DSDV, MANET, relative performance
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 37531643 How to Build and Evaluate a Solution Method: An Illustration for the Vehicle Routing Problem
Authors: Nicolas Zufferey
Abstract:
The vehicle routing problem (VRP) is a famous combinatorial optimization problem. Because of its well-known difficulty, metaheuristics are the most appropriate methods to tackle large and realistic instances. The goal of this paper is to highlight the key ideas for designing VRP metaheuristics according to the following criteria: efficiency, speed, robustness, and ability to take advantage of the problem structure. Such elements can obviously be used to build solution methods for other combinatorial optimization problems, at least in the deterministic field.
Keywords: Vehicle routing problem, Metaheuristics, Combinatorial optimization.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 20621642 Survey on Energy Efficient Routing Protocols in Mobile Ad Hoc Networks
Authors: Swapnil Singh, Sanjoy Das
Abstract:
Mobile Ad-Hoc Network (MANET) is a network without infrastructure dynamically formed by autonomous system of mobile nodes that are connected via wireless links. Mobile nodes communicate with each other on the fly. In this network each node also acts as a router. The battery power and the bandwidth are very scarce resources in this network. The network lifetime and connectivity of nodes depend on battery power. Therefore, energy is a valuable constraint which should be efficiently used. In this paper we survey various energy efficient routing protocols. The energy efficient routing protocols are classified on the basis of approaches they use to minimize the energy consumption. The purpose of this paper is to facilitate the research work and combine the existing solution and to develop a more energy efficient routing mechanism.
Keywords: Delaunay Triangulation, deployment, energy efficiency, MANET.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 3028