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.
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. Consequently, many routing algorithms
have come into existence to satisfy the needs of
communications in such networks. Researchers have
conducted many simulations comparing the performance of
these routing protocols under various conditions and
constraints. One question that arises is whether speed of nodes
affects the relative performance of routing protocols being
studied. This paper addresses the question by simulating two
routing protocols AODV and DSDV. Protocols were
simulated using the ns-2 and were compared in terms of
packet delivery fraction, normalized routing load and average
delay, while varying number of nodes, and speed.
Abstract: This paper presents the results related to the
interference reduction technique in multistage multiuser detector for
asynchronous DS-CDMA system. To meet the real-time
requirements for asynchronous multiuser detection, a bit streaming,
cascade architecture is used. An asynchronous multiuser detection
involves block-based computations and matrix inversions. The paper
covers iterative-based suboptimal schemes that have been studied to
decrease the computational complexity, eliminate the need for matrix
inversions, decreases the execution time, reduces the memory
requirements and uses joint estimation and detection process that
gives better performance than the independent parameter estimation
method. The stages of the iteration use cascaded and bits processed
in a streaming fashion. The simulation has been carried out for
asynchronous DS-CDMA system by varying one parameter, i.e.,
number of users. The simulation result exhibits that system gives
optimum bit error rate (BER) at 3rd stage for 15-users.