oalib

Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99

Submit

Any time

2020 ( 2 )

2019 ( 12 )

2018 ( 65 )

2017 ( 84 )

Custom range...

Search Results: 1 - 10 of 4536 matches for " TIMESERVING ROUTING PROTOCOL "
All listed articles are free for downloading (OA Articles)
Page 1 /4536
Display every page Item
Timeserving Routing Protocol Implementation to accomplish best throughput and fairness
Narasimha Rao V L Potta,B. Sarath Kumar
International Journal of Computer & Electronics Research , 2012,
Abstract: The latest technology for next generation Wireless networking is Wireless Mesh Networks (WMNs), with low cost and easy deploying. The WMNs are desirable for communication paradigm. The WMNs are more advantageous over other wireless networks. The existing routing protocols which transmits the traffic through pre-determined path which don’t provide security. This paper proposes a routing protocol called simplistic constructive routing protocol (SPRP) which supports multiple flows in wireless mesh networks. There are four major components in the SPRP which provides fairness and high throughput: 1) To minimize the multiple data transmissions Constructive forwarding path selection to provide multiple paths while minimizing duplicate transmissions, 2) Constructive rate control to determine an appropriate transfer rate according to the current network conditions. 3) Inter node loss recovery to efficiently find and resend lost packets, and 4) clock-based forwarding to let only the priority node to forward the traffic. Our result shows that SPRP significantly performs existing routing and a pivotal time serving routing protocol.
Subarea Tree Routing (STR) in Multi-hop Wireless Ad hoc Networks  [PDF]
Guikai LIU, Chunli SHAN, Gang WEI, Hongjiang WANG
Wireless Sensor Network (WSN) , 2009, DOI: 10.4236/wsn.2009.11006
Abstract: Subarea Tree Routing (STR), a new routing protocol for multi-hop wireless ad hoc networks, is proposed. The novelty of the STR protocol is to divide the whole network into many subareas constructed as a result of establishing subarea trees. Its main idea is to identify root nodes by manual configuration or auto-discovery process firstly, then the root nodes originate the process of establishing subarea trees, and finally each node either joins in a subarea tree or become an interconnect node. STR belongs to hierarchical routing protocol and does not attempt to consistently maintain routing information in every node. Furthermore, through the use of tree’s intrinsic routing function, the STR protocol exhibits hybrid behavior of proactive and on-demand routing protocols. We prove the correctness of STR, and our simulation results show that the pro-posed scheme achieves lower route discovery delays, lower route discovery load and better performance of normalized routing load in large, mobile, ad hoc networks as compared with AODV.
BEAR: A Balanced Energy-Aware Routing Protocol for Wireless Sensor Networks  [PDF]
Ehsan Ahvar, Mahmood Fathy
Wireless Sensor Network (WSN) , 2010, DOI: 10.4236/wsn.2010.210095
Abstract: Energy aware routing protocols can be classified into energy saver and energy manager. Energy saver protocols decrease energy consumption totally. Most of them try to find the shortest path between source and destination to reduce energy consumption. But energy manager protocols balance energy consumption in network to avoid network partitioning. Finding best route only based on energy balancing consideration may lead to long path with high delay and decreases network lifetime. On the other hand, finding best route only with the shortest distance consideration may lead to network partitioning. This paper improves SEER [1] routing protocol. Traditional SEER is only energy saver and has poor idea about energy balancing. Our proposed protocol, named BEAR, considers energy balancing and optimal distance both. It finds a fair tradeoff between energy balancing and optimal distance by learning automata concept. We simulate and evaluate routing protocols by Glomosim [2] simulator.
A Load Balance Clustering Routing Algorism Based on SOM  [PDF]
Shan Zhong, Guihua Wang, Xiaohui Leng, Xiaona Wang, Lian Xue, Yue Gu
Journal of Software Engineering and Applications (JSEA) , 2012, DOI: 10.4236/jsea.2012.511101
Abstract: In order to solve the uneven node load in the tradition clustering routing protocols, a new clustering algorism based on SOM is proposed. Firstly, the network radio model and the energy consumption model are defined. A new algorism using SOM to form the cluster and select the cluster head is defined. In the clustering node remain energy and the Euclidean distance from cluster head to the cluster member are considered. The experiment shows our method has the longer life cycle and less total energy consumption. It is an effective clustering protocol.
Survey of Clustering Schemes in Mobile Ad hoc Networks  [PDF]
Abdelhak Bentaleb, Abdelhak Boubetra, Saad Harous
Communications and Network (CN) , 2013, DOI: 10.4236/cn.2013.52B002
Abstract: Mobile ad-hoc networks (MANETs) are a specific kind of wireless networks that can be quickly deployed without pre- existing infrastructures. They are used in different contexts such as collaborative, medical, military or embedded applications. However, MANETs raise new challenges when they are used in large scale network that contain a large number of nodes. Subsequently, many clustering algorithms have emerged. In fact, these clustering algorithms allow the structuring of the network into groups of entities called clusters creating a hierarchical structure. Each cluster contains a particular node called cluster head elected as cluster head according to a specific metric or a combination of metrics such as identity, degree, mobility, weight, density, etc. MANETs has drawbacks due to both the characteristics of the transmission medium (transmission medium sharing, low bandwidth, etc.) and the routing protocols (information diffusion, path finding, etc.). Clustering in mobile ad hoc networks plays a vital role in improving resource management and network performance (routing delay, bandwidth consumption and throughput). In this paper, we present a study and analyze of some existing clustering approaches for MANETs that recently appeared in literature, which we classify as: Identifier Neighbor based clustering, Topology based clustering, Mobility based clustering, Energy based clustering, and Weight based clustering. We also include clustering definition, review existing clustering approaches, evaluate their performance and cost, discuss their advantages, disadvantages, features and suggest a best clustering approach.
Performance Analysis of Adjusted Counter Based Broadcasting in Mobile Ad Hoc Networks  [PDF]
Muneer Bani Yassein, Balqees Abd Hameed, Wail Mardini, Yaser Khamayseh
Communications and Network (CN) , 2013, DOI: 10.4236/cn.2013.54044
Abstract:

Mobile Ad Hoc Network (MANET) is a reliable system formed by co-operating and independent nodes that connect and communicate with each other wirelessly without pre-existing infrastructure. In such a network, the easiest way to broadcast the packets to all network nodes is flooding. However, flooding leads to serious drawbacks such as collision, contention and redundant retransmission. These drawbacks are known as the broadcast storm problem. This research proposes an adaptive algorithm in order to decrease the overall network overhead and minimize the problems associated to flooding. Moreover this research concentrates on studying the effect of using different mobility models that provide general idea about nodes movement, status and locations. In particular the performance of Random Waypoint and File mobility models in terms of their effect on network communication is evaluated. Moreover, this research provides performance evaluation of different traffic types such as Constant Bit Rate (CBR) and Traffic GEN. Results from Qualnet simulations have revealed that the new proposed algorithm outperforms flooding in terms of different metrics: reducing end-to-end delay in addition to minimizing the normalized routing load and maximizing the packets delivery ratio, in addition to concluding that Traffic GEN outperforms the CBR in terms of throughput. Moreover the CBR traffic has higher delay values than Traffic GEN.

A New Efficient Routing Protocol for MANET
Himanshu Ratawl,,Bharti Nagpal
International Journal of Innovative Technology and Exploring Engineering , 2013,
Abstract: MANET can be defined as a accumulation of mobile hosts which move in different directions and speeds with no need to create connectivity with existing network infrastructure. Various routing protocols have been made from the time of the existence of ad hoc networks. We proposes a new routing protocol for ad hoc networks which will reduce network overhead, power consumption, Multi-user Interference (MUI), and provide link reliability.
A Review of Routing Protocols for MANET
Prashant Kumar Shukla,Dr. R. Singhai
International Journal of Engineering Innovations and Research , 2012,
Abstract: A Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without using any centralized access point, infrastructure, or centralized administration. Data transmission between two nodes in MANET’s may be requires multiple hops as the nodes transmission range is limited. Mobility of the different nodes makes the situation even more complicated. Multiple routing protocols especially for these conditions have been developed during the last few years, to find optimized routes from a source to some destination. Ad-hoc network suffer from the lot of issues i.e. congestion, Throughput, delay, security, network overhead. Packet delivery ratio is the issues of ongoing research. This survey gives a comprehensive overview of AODV (Ad-hoc on demand Distance Vector Routing) detailed comparison of different research on AODV has been presented. Open research direction is also discussed to serve as a starting point to future protocol design and evaluation.
A Min-process Checkpointing Protocol for Deterministic Mobile Ad Hoc Networks
Praveen,Parveen Kumar
International Journal of Engineering Science and Technology , 2011,
Abstract: The mobile ad hoc network architecture consists of a set of mobile hosts that can communicate with each other without the assistance of a base station. Nodes within each other radio range communicate directly via wireless links while these which are far apart rely on other nodes to relay messages. Node mobility causes frequentchanges in topology. Fault-tolerance is an important design issue in building a reliable Ad hoc network. This paper considers checkpointing recovery schemes for the mobile ad-hoc network environment to introduce software based fault tolerance. In this paper we propose a new anti-message logging based non-intrusiveminimum process checkpointing scheme for ad hoc networks. We assume that it uses Cluster Based Routing Protocol (CBRP) which belongs to a class of Hierarchical Reactive routing protocols. It produces a consistent set of checkpoints; the algorithm makes sure that only minimum number of nodes in the cluster is required to take checkpoints; it uses very few control messages. Performance analysis shows that our algorithm outperforms the existing related works and is a novel idea in the field.
Optimize OLSR with Cognitive in Wireless Mesh Network
Manpreet Kaur,Kunwarpal
International Journal of Engineering and Advanced Technology , 2013,
Abstract: In this paper, we review the COLSR; Cognitive Optimized Link State Routing in Wireless Mesh Network. COLSR is the extension of OLSR Protocol. With the use of COLSR the throughput and performance are enhanced. COLSR provide better solution to the problem of congestion on the nodes, with surely data are transmitted. In this paper, we also discuss the enhancement of OLSR which is purely different from existing OLSR, and also discuss the generation, reputed-trust mechanism along with weighting mechanism from the nodes and COLSR perform re-routing for degrade the packet dropping problem and enhance throughput devoid of congestion on nodes in WMN
Page 1 /4536
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.