Abstract — Today, municipalities are planning to deploy metroscale two-tier wireless mesh networks at a rapid pace. Fittingly, the IEEE 802.11s standard is being developed to allow interoperability between heterogeneous mesh network devices. In this article, we describe and discuss how the initial standard addresses key factors for standardization of these networks: (i) efficient allocation of mesh resources at the routing and MAC layers, (ii) protection and conservation of the network resources via security and energy efficiency, and (iii) assurance of fairness and elimination of spatial bias via mesh congestion control. We draw upon examples from existing two-tier deployments, simulations, and analytical models to motivate these enhancements within the standard. I.

Consensus is central to several applications including collaborative ones which a wireless ad-hoc network can facilitate for mobile users in terrains with no infrastructure support for communication. We solve the consensus problem in a sparse network in which a node can at times have no other node in its wireless range and useful end-to-end connectivity between nodes can just be a temporary feature that emerges at arbitrary intervals of time for any given node pair. Efficient one-to-many dissemination, essential for consensus, now becomes a challenge: enough number of destinations cannot deliver a multicast unless nodes retain the multicast message for exercising opportunistic forwarding. Seeking to keep storage and bandwidth costs low, we propose two protocols. An eventually relinquishing (<>RC) protocol that does not store messages for long is used for attempting at consensus, and an eventually quiescent (<>QC) one that stops forwarding messages after a while is used for concluding consensus. Use of <>RC protocol poses additional challenges for consensus, when the fraction, (f/n), of nodes that can crash is: (1/4)<=(f/n)<(1/2). Consensus latency and packet overhead are measured through simulations and both decrease considerably even for a modest increase in network density.

Abstract-Recently multicast routing protocols in Mobile Ad-hoc Networks (MANETs) are emerging for wireless group communication. This includes application such as multipoint data dissemination and multiparty conferencing which made the analytical design and development of the MANETs in a very efficient manner. For MANETs there are several multicast routing protocols are available, but they perform well under specific scenarios only. The topology of a MANET changes adequately based on the random mobility of network nodes, unlike the network topology of a wired network which is static. Multicast routing protocol outperforms the basic broadcast routing by sharing the resources along general links, while sending information to a set of predefined multiple destinations in a concurrent way. Due to the lack of redundancy in multipath and multicast structures, the multicast routing protocols are vulnerable to the component failure in ad-hoc networks. So it is the dire need to solve the problem optimally. One of the efficient techniques for solving the optimization problem is the Genetic Algorithm (GA). The key factors that determine the performance of GA is by the well designed architecture of chromosomes and operators in the intelligent algorithm. This paper proposes a new genetic algorithm based Multicast Ad-hoc On demand Distance Vector Protocol for MANETs (GA-MAODV), which improves the packet delivery ratio of the routing messages. The GAbased MAODV allows each node in the network to send out multicast data packets, and the multicast data packets are broadcast when propagating along the multicast group tree. Keywords:- multicasting, routing protocols, MANETs, MAODV, Genetic Algorithm. I.