This paper presents a novel scheme that provides high level of security and privacy in a Wireless Mesh Network (WMN).We combine an approach of Network Coding with multiple layered encryption of onion routing for a WMN.An added superior feature provides higher level of security and privacy.Sensitive network information is confined to 1-hop neighborhood which is available anyways in a wireless medium with nodes using a bivariate polynomial.The only routing information divulged to a relay node is about next hop.No plain text is ever transmitted and all data can only be decrypted by its source and destination.Prior work finds it difficult to enforce encryption with network coding without divulging in complete routing information,hence losing privacy and anonymity.We compare our scheme with other existing approach for several networks.The preliminary results show this work to provide superior security and anonymity at low overhead cost.

We consider models of telecommunication systems that incorporate probability, dense real-time and data. We present a new formal abstraction method for computing minimum and maximum reachability probabilities for such models. Our approach uses strictly local formal abstract steps to reduce both the size of abstract specifications generated and the complexity of operations needed, in comparison to previous approaches of this kind. A selection of large case studies are implemented the techniques and evaluate, which include some infinite-state probabilistic real time models, demonstrating improvements over existing tools in several cases. The capacity of metro and access networks are extended the reach and split ratio of the conventional Long - Reach Passive Optical Networks (LR-PONs). The efficient solutions of LR-PONs are appeared in feeder distances around 100km and high split ratios up to 1000-way . Among many existing approaches, one of the most e ffective options to improve network performance in LR-PONs are the multi-thread based dynamic bandwidth allocation (DBA) scheme where several bandwidth allocation processes are performed in parallel is considered. Without proper intercommunication between the overlapped threads, multi-thread DBA may lose e fficiency and even perform worse than the conventional single thread algorithm. Real Time Probabilistic Systems are used to evaluate a typical PON systems performance. This approach is more convenient, flexible, and lower cost than the former simulation method, which do not need develop special hardware and software tools. Moreover, how changes in performance depend on changes in the particular modes can be easily analysis by supplying ranges for parameter values. The proposed algorithm with traditional DBA is compared, and shows its advantage on average packet delay. The key parameters of the algorithm are analysed and optimized, such as initiating and tuning multiple threads, inter -thread scheduling, and fairness among users. The algorithms advantage in numerical results are decreased the average packet delay and improve network throughput under varying offered loads.

A Mobile Ad hoc network (MANET) is a self configurable network connected by wireless links. This type of network is only suitable for temporary communication links as it is infrastructure-less and there is no centralised control. Providing QoS aware routing is a challenging task in this type of network due to dynamic topology and limited resources. The main purpose of QoS aware routing is to find a feasible path from source to destination which will satisfy two or more end to end QoS constrains. Therefore, the task of designing an efficient routing algorithm which will satisfy all the quality of service requirements and be robust and adaptive is considered as a highly challenging problem. In this work we have designed a new efficient and energy aware multipath routing algorithm based on ACO framework, inspired by the behaviours of biological ants. Basically by considering QoS constraints and artificial ants we have designed an intelligent version of classical Temporally Ordered Routing Algorithm (TORA) which will increase network lifetime and decrease packet loss and average end to end delay that makes this algorithm suitable for real time and multimedia applications.