Sciweavers

IJSNET
2008
126views more  IJSNET 2008»
13 years 11 months ago
Reliable and energy-efficient routing protocol in dense wireless sensor networks
Delivering sensed data to the sink reliably in sensor networks calls for a scalable, energy-efficient, and error-resilient routing solution. In this paper, a reliable energy-effic...
Min Chen, Taekyoung Kwon, Shiwen Mao, Yong Yuan, V...
IJNSEC
2008
132views more  IJNSEC 2008»
13 years 11 months ago
Optimal Energy-Delay Routing Protocol with Trust Levels for Wireless Ad Hoc Networks
This paper presents the Trust Level Routing (TLR) protocol, an extension of the optimized energy-delay routing (OEDR) protocol, focusing on the integrity, reliability and survivab...
Eyad Taqieddin, S. Jagannathan, Ann Miller
CAL
2007
13 years 11 months ago
Logic-Based Distributed Routing for NoCs
—The design of scalable and reliable interconnection networks for multicore chips (NoCs) introduces new design constraints like power consumption, area, and ultra low latencies. ...
José Flich, José Duato
IJIPT
2008
191views more  IJIPT 2008»
13 years 11 months ago
ARPM: Agent-based Routing Protocol for MANET
Mobile ad-hoc networks (MANETs) are infrastructure-less networks where no central network management exists, composed of mobile nodes over wireless links. Network topology in MANE...
Helen Bakhsh, Manal Abdullah
IJAHUC
2008
80views more  IJAHUC 2008»
13 years 11 months ago
Performance evaluation of node density-based adaptive routing scheme for disruption tolerant networks
: Traditional ad hoc routing protocols do not work in intermittently connected networks since end-to-end paths may not exist in such networks. Hence, routing mechanisms that can wi...
Mooi Choo Chuah, Peng Yang
DM
2006
70views more  DM 2006»
13 years 11 months ago
The carvingwidth of hypercubes
The notion of the carvingwidth of a graph was introduced by Seymour and Thomas [Call routing and the ratcatcher, Combinatorica
L. Sunil Chandran, Telikepalli Kavitha
COR
2006
94views more  COR 2006»
13 years 11 months ago
A comparison of two different formulations for arc routing problems on mixed graphs
Arc Routing Problems on mixed graphs have been modelled in the literature either using just one variable per edge or associating to each edge two variables, each one representing ...
Angel Corberán, Enrique Mota, José M...
COR
2006
93views more  COR 2006»
13 years 11 months ago
Solving capacitated arc routing problems using a transformation to the CVRP
A well known transformation by Pearn, Assad and Golden reduces a Capacitated Arc Routing Problem (CARP) into an equivalent Capacitated Vehicle Routing Problem (CVRP). However, tha...
Humberto Longo, Marcus Poggi de Aragão, Edu...
COMCOM
2006
100views more  COMCOM 2006»
13 years 11 months ago
A secure alternate path routing in sensor networks
This paper presents a secure alternate path routing in sensor networks. Our alternate path scheme makes the routing protocol resilient in the presence of malicious nodes that laun...
Suk-Bok Lee, Yoon-Hwa Choi
COMCOM
2006
80views more  COMCOM 2006»
13 years 11 months ago
The prediction-based routing in optical transport networks
In optical networks, the traditional routing problem is generally decoupled into two subproblems, the route selection and the wavelength assignment. Usual RWA (Routing and Wavelen...
Eva Marín-Tordera, Xavier Masip-Bruin, Serg...