International Journal of Wireless and Mobile Computing 

About: International Journal of Wireless and Mobile Computing is an academic journal published by Inderscience Publishers. The journal publishes majorly in the area(s): Computer science & Wireless network. It has an ISSN identifier of 1741-1084. Over the lifetime, 769 publications have been published receiving 3910 citations.

Grain: a stream cipher for constrained environments

Abstract: A new stream cipher, Grain, is proposed. The design targets hardware environments where gate count, power consumption and memory is very limited. It is based on two shift registers and a non-linear output function. The cipher has the additional feature that the speed can be increased at the expense of extra hardware. The key size is 80 bits and no attack faster than exhaustive key search has been identified. The hardware complexity and throughput compares favourably to other hardware oriented stream ciphers like E0 and A5/1.

Grain-128a: a new version of Grain-128 with optional authentication

Abstract: A new version of the stream cipher Grain-128 is proposed. The new version, Grain-128a, is strengthened against all known attacks and observations on the original Grain-128, and has built-in support for optional authentication. The changes are modest, keeping the basic structure of Grain-128. This gives a high confidence in Grain-128a and allows for easy updating of existing implementations.

Efficient and Robust Multicast Routing in Mobile Ad Hoc Networks

Abstract: Efficient and Robust Multicast Routing in Mobile Ad Hoc Networks Ravindra Vaishampayan Department of Computer Science University of California Santa Cruz ravindra@cseucscedu Abstract— This paper argues that tree based protocols can have packet delivery ratios comparable to mesh based protocols if the tree construction algorithm can fix and detect broken links quickly, and at the same time have a much lower data packet overhead due to the absence of redundancy We present such a protocol and call it robust multicasting in ad hoc networks using trees (ROMANT) ROMANT does not require a unicast routing protocol or the preassignment of cores to groups We compare ROMANT with ODMRP and MAODV which are the state of the art in mesh based and tree based protocols respectively The results from a wide range of scenarios of varying mobility, group members, number of senders, traffic load and number of multicast groups show that ROMANT attains a comparable or better packet delivery ratio than ODMRP and MAODV, and a much lower control overhead which is almost constant for a fixed number of groups, and varies sublinearly with increasing groups Keywords— Ad hoc networks, multicast mesh, multicast tree routing, multicasting, I I NTRODUCTION Mobile ad hoc networks have applications in a wide range of areas including disaster relief and military Most of these scenarios need one to many or many to many communication In fact, some networks may need multicast routing only and not need unicast routing at all This makes multicasting a very important feature in such networks As a result, it is important to have a multicasting protocol that provides a high packet delivery ratio even in extreme conditions (eg, high mobility and high traffic load) It is equally important for such protocols to have a low over- head, because bandwidth and battery power are extremely precious in these kinds of networks Over the past few years, several multicast routing proto- cols have been proposed for ad hoc networks [1], [2], [3], [16] For the purposes of our discussion, the approaches taken to date can be classified into tree-based and mesh- based approaches A tree-based multicast routing protocol establishes and maintains either a shared multicast routing tree or multiple source-based multicast routing trees (one for each group source) to deliver data packets from sources to receivers of a multicast group Recent examples of tree-based multicast routing approaches are the multicast ad hoc on-demand distance vector protocol (MAODV) [4], and the adaptive JJ Garcia-Luna-Aceves Department of Computer Engineering University of California Santa Cruz jj@cseucscedu demand-driven multicast routing protocol (ADMR) [8] In contrast, a mesh-based multicast routing protocol maintains a mesh consisting of a connected component of the network containing all the receivers of a group Two well-known examples of mesh-based multicast routing protocols are the core assisted mesh protocol (CAMP) [1] and the on-demand multicast routing protocol (ODMRP) [2] MAODV maintains a shared tree for each multicast group, consisting of only receivers and relays Sources wishing to send to the group acquire routes to the group on demand in a way similar to the ad hoc on demand distance vector (AODV) [17] protocol Each multicast tree has a group leader, which is the first node to join the group in the connected component The group leader in each connected component periodically transmits a group hello packet to become aware of reconnections Receivers join the shared tree with a special route request The route replies coming from different multicast tree members specify the number of hops to the nearest tree member The node wishing to join the tree joins through the node reporting the freshest route with the minimum hop count to the tree ADMR maintains source-based trees, ie, a multicast tree for each source of a multicast group A new receiver performs a network-wide flood of a multicast solicitation packet when it needs to join a multicast tree Each group source replies to the solicitation, and the receiver sends a re- ceiver join packet to each source answering its solicitation An individual source-based tree is maintained by periodic keep-alive packets from the source, which allow routers to detect link breaks in the tree by the absence of data or keep-alive packets A new source of a multicast group also sends a network-wide flood to allow existing group receivers to send receiver joins to the source MZR [15] like ADMR, maintains source based trees MZR performs zonal routing; hence, the flooding of control packets is less expensive Compared to approaches based on shared trees, the use of source-based trees creates much more state at routers participating in many groups, each with multiple sources ODMRP requires control packets originating at each source of a multicast group to be flooded throughout the ad hoc network The control packet floods help repair the link breaks that occur between floods The limitations of ODMRP are the need for network-wide packet floods and requiring that the sources of multicast packets for a

ARM: anonymous routing protocol for mobile ad hoc networks

Abstract: In this paper we describe a novel anonymous on-demand routing protocol for wireless Mobile Ad Hoc Networks (MANETs) that is secure against both nodes that actively participate in the network and a passive global adversary who monitors all network traffic. Finally, we provided a detailed analysis of the privacy offered by hiding routes in limited broadcast groups, and padding messages.

Bounds on hop distance in greedy routing approach in wireless ad hoc networks

Abstract: Wireless ad hoc networks are generally characterised by random node locations and multi-hop routes. A quantitative knowledge of the relation between hop count and Euclidean distance could provide a better understanding of important network parameters such as end-to-end delay, power consumption along the route, and node localisation. In this paper, we present an analytic approach to capture the statistics on hop count for a given source-to-destination Euclidean distance in a greedy routing approach. We also show that, for a given hop count, the bounds on Euclidean distance can be computed from the distribution characteristics of per-hop progress.