Multi-part words in English language are hyphenated and hyphen is used to separate different parts. Persian language consists of multi-part words as well. Based on Persian morphology, half-space character is needed to separate parts of multi-part words where in many cases people incorrectly use space character instead of half-space character. This common incorrectly use of space leads to some s...

Multi-hop relay channels use multiple relay stages, each with multiple relay nodes, to facilitate communication between a source and destination. Previously, distributed space-time coding was used to maximize diversity gain. Assuming a low-rate feedback link from the destination to each relay stage and the source, this paper proposes end-to-end antenna selection strategies as an alternative to ...

A mobile ad hoc network (MANET) is characterized by multi-hop wireless links in the absence of cellular infrastructure and frequent host mobility. In this paper, a new on-demand routing protocol is proposed, named on-demand routing protocol with backtracking (ORB), for multi-hop mobile ad hoc networks. Suppose a source host wants to deliver a message to a destination in a MANET. First, the sour...

Traditionally, route discovery in MANETs operates in unilateral (source-initiated) manner. We propose a new scheme called bilateral route discovery (BRD), where both source and destination actively participate in a route discovery process. BRD has the potential to reduce the control overhead by one half. As an underlying protocol for BRD, we propose gratuitous route error reporting (GRER) to no...

All previously proposed position based routing algorithms for wireless ad hoc networks were based on forwarding the actual message along multiple paths toward an area where destination is hopefully located (except our previous report [SV]). In [SV], we proposed to reduce significantly the communication overhead by changing the routing strategy. The source node issues several search 'tickets' (e...

Most previously proposed position based routing algorithms for wireless ad hoc networks were based on forwarding the actual message along multiple paths toward an area where destination is hopefully located. The significant communication overhead can be avoided if the routing strategy is changed. We propose that the source node issues several search 'tickets' (each ticket is a 'short' message c...