Filters








41,764 Hits in 3.2 sec

Geographic Routing with Partial Position Information
english

Tony Ducrocq, Michaël Hauspie, Nathalie Mitton
2014 Proceedings of the 3rd International Conference on Sensor Networks  
5% of nodes are aware of their position.  ...  However they require that each node of the network is aware of its own position.  ...  The RREP packet then follows the reverse path and each node on the route saves the source of the RREP in its neighborhood table in order to create the reverse path.  ... 
doi:10.5220/0004872901650172 dblp:conf/sensornets/DucrocqHM14 fatcat:6f54bexvr5aefag6zkg4fviajy

Securing location aware services over VANET using geographical secure path routing

Vivek Pathak, Danfeng Yao, Liviu Iftode
2008 2008 IEEE International Conference on Vehicular Electronics and Safety  
We propose to secure location aware services over vehicular ad-hoc networks (VANET) with our geographical secure path routing protocol (GSPR).  ...  Our protocol also authenticates the routing paths taken by individual messages. This paper presents the design of the GSPR secure geographic routing protocol.  ...  Geographic routing makes all routing decisions based on the local one-hop neighborhood.  ... 
doi:10.1109/icves.2008.4640905 dblp:conf/icves/PathakYI08 fatcat:ajxasmnjhngc5dr6fw5rqunuja

Development of Energy-Efficient Routing Protocol in Wireless Sensor Networks Using Optimal Gradient Routing with On Demand Neighborhood Information

K. Nattar Kannan, B. Paramasivan
2014 International Journal of Distributed Sensor Networks  
In this paper, on demand acquisitions of neighborhood information are used to find the optimal routing paths that reduce the message exchange overhead.  ...  Routing protocols play a major role in WSNs for maintaining the routes and for ensuring reliable communication.  ...  Hence the optimal paths are selected by source and forwarding nodes themselves to hop neighborhoods toward the destination.  ... 
doi:10.1155/2014/208023 fatcat:l6yuqudjbvejhltwbpfao7dbuq

A network-aware MAC and routing protocol for effective load balancing in ad hoc wireless networks with directional antenna

Siuli Roy, Dola Saha, S. Bandyopadhyay, Tetsuro Ueda, Shinsuke Tanaka
2003 Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing - MobiHoc '03  
In our MAC protocol, each node keeps certain neighborhood status information dynamically in order that each node is aware of its neighborhood and communications going on in its neighborhood at that instant  ...  This would help each node to capture the approximate network status periodically that helps each node to become topology-aware and aware of communications going on in the network, although in an approximate  ...  NETWORK-AWARENESS In this paper, we propose a mechanism such that each node is not only neighborhood-aware but also network-aware.  ... 
doi:10.1145/778415.778427 dblp:conf/mobihoc/RoySBUT03 fatcat:eubum5n7avagllaoss4lzix5fu

A network-aware MAC and routing protocol for effective load balancing in ad hoc wireless networks with directional antenna

Siuli Roy, Dola Saha, S. Bandyopadhyay, Tetsuro Ueda, Shinsuke Tanaka
2003 Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing - MobiHoc '03  
In our MAC protocol, each node keeps certain neighborhood status information dynamically in order that each node is aware of its neighborhood and communications going on in its neighborhood at that instant  ...  This would help each node to capture the approximate network status periodically that helps each node to become topology-aware and aware of communications going on in the network, although in an approximate  ...  NETWORK-AWARENESS In this paper, we propose a mechanism such that each node is not only neighborhood-aware but also network-aware.  ... 
doi:10.1145/778425.778427 fatcat:nna2lcxtenbupbu4z27iyamr2e

A Hybrid Genetic Algorithm/Variable Neighborhood Search Approach to Maximizing Residual Bandwidth of Links for Route Planning [chapter]

Gajaruban Kandavanam, Dmitri Botvich, Sasitharan Balasubramaniam, Brendan Jennings
2010 Lecture Notes in Computer Science  
The approach combines the use of a new highly scalable hybrid GA-VNS algorithm (Genetic Algorithm with Variable Neighborhood Search) with the efficient and accurate estimation of QoS requirements using  ...  Given a QoS-aware demand matrix, experimental results indicate that the GA-VNS algorithm shows significantly higher success rate in terms of converging to optimum/near optimum solution in comparison to  ...  Provision of a traffic matrix that is QoS-aware in the sense that the demands for given source/destination pairs reflect effective bandwidth estimations means that the routing plan identified as a solution  ... 
doi:10.1007/978-3-642-14156-0_5 fatcat:a73lui6m45a4rndnlgttoaq64y

Real-time Power-Aware Routing in Sensor Networks

Octav Chipara, Zhimin He, Guoliang Xing, Qin Chen, Xiaorui Wang, Chenyang Lu, John Stankovic, Tarek Abdelzaher
2006 IEEE International Workshop on Quality of Service, IWQoS  
RPAR features a power-aware forwarding policy and an efficient neighborhood manager that are optimized for resource-constrained wireless sensors.  ...  To address this challenge, we propose the Real-time Power-Aware Routing (RPAR) protocol, which achieves application-specified communication delays at low energy cost by dynamically adapting transmission  ...  This shows that neighborhood management is an important issue in power-aware routing. The benefit of the new neighborhood manager is particularly evident for tight deadlines.  ... 
doi:10.1109/iwqos.2006.250454 dblp:conf/iwqos/ChiparaHXCWLSA06 fatcat:evpr2sn5vzh5vot3f7mlak4ihu

Fuzzy Clustering with Multi-Constraint QoS Service Routing in Wireless Sensor Networks

Jayashree Agarkhed, Vijayalaxmi Kadrolli, Siddarama R. Patil
2019 Journal of Telecommunications and Information Technology  
This paper presents a fuzzy logic-based, service differentiated, QoS aware routing protocol (FMSR) offering multipath routing for WSNs, with the purpose of providing a service differentiated path meant  ...  Next, the building of a routing follows, so as to establish multiple paths between nodes through the modified QoS k-nearest neighborhood, based on different QoS constraints and on optimum shortest paths  ...  Multiple paths are subsequently established between the source and the destination, leading through these neighborhood nodes, by means of the k-nearest neighborhood method, thus forming an optimal route  ... 
doi:10.26636/jtit.2019.127818 fatcat:az6dcqkvnfcknpzj22kmokfv4a

DIFFERENT TECHNIQUES TO REDUCE ROUTING OVERHEAD IN MANET

2017 International Journal of Recent Trends in Engineering and Research  
RREP (Route Reply), Ad hoc On-demand Distance Vector Routing (AODV) and Dynamic Source Routing (DSR) PIVOT( A Particular value decided as per criteria , it's a mathematical term) I.  ...  Cut Based On Demand Routing with Coordinate Awareness (CBORCA) works on Coordinate system with a method to reduce routing overhead by using concept of PIVOT in quadrants Keywords--RREQ( Route Request),  ...  If destination already has a route to the source , then it sends a route response (RREP) message along this route. Otherwise, the RREP message is sent on the reverse route to source.  ... 
doi:10.23883/ijrter.2017.3111.wdu5b fatcat:2nmhzxfdubbcbhrcpa6n2ad2kq

Exploiting Overhearing: Flow-Aware Routing for Improved Lifetime in Ad Hoc Networks

Nirisha Shrestha, Bernard Mans
2007 2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems  
By combining this awareness with batteryaware routing metrics, which includes the battery levels of the neighbors, we introduce various routing schemes that increase the network lifetime.  ...  In this paper, we propose that nodes exploit overheard packets to gather awareness of current neighboring flows and adapt their local routing dynamically.  ...  This is the time when the packet generation for a flow in the network stops due to the source depleting its battery, or due to the lack of a route (because of disconnection).  ... 
doi:10.1109/mobhoc.2007.4428650 dblp:conf/mass/ShresthaM07 fatcat:osbod7sb4ras5gqdelhr632n7u

Wireless Sensor Network Design by using Energy Aware Artificial Bee Colony and Duty Cycled Sleep Scheduling Algorithm

K. Anitha
2018 International Journal for Research in Applied Science and Engineering Technology  
In this ad-hoc network management protocol and services respectively is used to manage the network, Low Power Mode algorithm (LMP) and power-aware routing (PAR) are implemented in the dynamic source routing  ...  Various types of ad hoc routing protocols are available such that AODV, DSR, DSDV, TORA, among that DSR uses source routing instead of hop-by-hop routing therefore it discover the route by the packets  ...  Energy Aware Routing In landslide disaster condition the objective of the sensor network is to identify the threshold values of landslide trigging factors and send the information with minimum delay to  ... 
doi:10.22214/ijraset.2018.4385 fatcat:sfmb2uhadnfurdgcgkzbni7tii

Proximity Aware Routing in Ad Hoc Networks

Valerie Alandzi, Alejandro Quintero
2007 Journal of Computer Science  
We propose a novel positionbased routing protocol called Proximity Aware Routing for Ad-hoc networks (PARA) to address these issues.  ...  They rely on state concerning all links of the network or links on the route between a source and a destination.  ...  We have proposed a novel position-based routing protocol called Proximity Aware Routing for Ad-hoc networks (PARA) to address these issues.  ... 
doi:10.3844/jcssp.2007.533.539 fatcat:g5puz2qkijao3pzrlbu2eyvzhi

Towards secure multi-path routing for wireless mobile ad-hoc networks: A cross-layer strategy

Arjun P. Athreya, Patrick Tague
2011 2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks  
Multi-path routing establishes multiple paths between a source and destination node in a network. This helps in achieving reliability in mobile ad-hoc networks (MANETs).  ...  To achieve efficient, secure and reliable multi-path routing for MANETs, we propose a routing mechanism that uses crosslayer strategies.  ...  {η S , T S S , Data} K SD } K ji end if Dprocesses rreq and constructs a rrep packet D → last hop node on source route : Reversed Source Route {Source Route, η S , T S} K SD Fig 1.  ... 
doi:10.1109/sahcn.2011.5984886 dblp:conf/secon/AthreyaT11 fatcat:3uieon5prrgk7oomgkrwl4ia5y

A connection management protocol to support multimedia traffic in ad hoc wireless networks with directional antenna

S. Bandyopadhyay, K. Hasuike
2001 IEEE International Conference on Multimedia and Expo, 2001. ICME 2001.  
system topology-aware.  ...  Additionally, we have attempted to address the issue of managing an uninterrupted connection between a source and a destination over adaptively selected routes in temporal domain.  ...  As a consequence of topology-awareness, we have attempted to address the issue of managing an uninterrupted connection between a source and a destination over adaptively selected routes in temporal domain  ... 
doi:10.1109/icme.2001.1237902 dblp:conf/icmcs/BandyopadhyayH01 fatcat:q23cp7ch2zgxhk4fwyyd6lfvoe

MARIA: Interference-Aware Admission Control and QoS Routing in Wireless Mesh Networks

X. Cheng, P. Mohapatra, S.-J. Lee, S. Banerjee
2008 2008 IEEE International Conference on Communications  
In this paper we propose MARIA (Mesh Admission control and qos Routing with Interference Awareness), a scheme towards enhancing QoS support for multimedia in wireless mesh networks.  ...  We implement an on-demand routing scheme that explicitly incorporates the interference model in the route discovery process.  ...  INTERFERENCE-AWARE ADMISSION CONTROL AND QOS ROUTING Using the conflict graph based interference model and HELLO message exchanges, each node determines the flow information in its interference neighborhood  ... 
doi:10.1109/icc.2008.540 dblp:conf/icc/ChengMLB08 fatcat:w6a7l6arv5ctpdovzuf3rgj4qa
« Previous Showing results 1 — 15 out of 41,764 results