Optimal Linear Network Coding Design for Secure Unicast with Multiple Streams

IEEE INFOCOM 2010, San Diego, CA, 14-19 March 2010Linear network coding is a promising technology that can maximize the throughput capacity of communication network. Despite this salient feature, there are still many challenges to be addressed, and security is clearly one of the most important challenges. In this paper, we will address the design of secure linear network coding. Specifically, we will investigate the network coding design that can both satisfy the weakly secure requirements and maximize the transmission data rate of multiple unicast streams between the same source and destination pair, which has not been addressed in the literature. In our study, we first prove that the secure unicast routing problem is equivalent to a constrained link-disjoint path problem. We then develop efficient algorithm that can find the optimal unicast topology in a polynomial amount of time. Based on the topology, we design deterministic linear network code that is weakly secure and can be constructed at the source node. And finally, we investigate the potential of random linear code for weakly secure unicast and prove the low bound of the probability that a random linear code is weakly secure.Department of Computin

Implementation of Majority Based voting protocol in group based system with re-ranking

A Mobile Ad Hoc Network is a decentralized kind of remote system. It doesn't have any altered foundation and the hubs can impart straightforwardly between one another. Because of its open nature issues like security and vitality utilization emerges. This paper presents an in number encryption calculation keeping in mind the end goal to expand dependability and security for MANETs. At the point when huge volume of information is to be sent, information pressure method is a straightforward procedure, with the advantage of diminishing the transmission rate that devours less transfer speed and low power. Lempel �Ziv � Welch (LZW) pressure calculation when connected on coded message assists in furnishing security with low battery utilization. Such a plan composed practically speaking will help in building secure MANET based application

A Novel Encryption Scheme for Providing Security and Energy Efficiency in Mobile Ad-Hoc Networks

A Mobile Ad Hoc Network is a decentralized kind of remote system. It doesn't have any altered foundation and the hubs can impart straightforwardly between one another. Because of its open nature issues like security and vitality utilization emerges. This paper presents an in number encryption calculation keeping in mind the end goal to expand dependability and security for MANETs. At the point when huge volume of information is to be sent, information pressure method is a straightforward procedure, with the advantage of diminishing the transmission rate that devours less transfer speed and low power. Lempel –Ziv – Welch (LZW) pressure calculation when connected on coded message assists in furnishing security with low battery utilization. Such a plan composed practically speaking will help in building secure MANET based application

A Novel Encryption Scheme for Providing Security and Energy Efficiency in Mobile Ad Hoc Networks

A Mobile Ad Hoc Network is a decentralized kind of remote system. It doesn't have any altered foundation and the hubs can impart straightforwardly between one another. Because of its open nature issues like security and vitality utilization emerges. This paper presents an in number encryption calculation keeping in mind the end goal to expand dependability and security for MANETs. At the point when huge volume of information is to be sent, information pressure method is a straightforward procedure, with the advantage of diminishing the transmission rate that devours less transfer speed and low power. Lempel �Ziv � Welch (LZW) pressure calculation when connected on coded message assists in furnishing security with low battery utilization. Such a plan composed practically speaking will help in building secure MANET based application

Performance Modelling and Optimisation of Multi-hop Networks

A major challenge in the design of large-scale networks is to predict and optimise the total time and energy consumption required to deliver a packet from a source node to a destination node. Examples of such complex networks include wireless ad hoc and sensor networks which need to deal with the effects of node mobility, routing inaccuracies, higher packet loss rates, limited or time-varying effective bandwidth, energy constraints, and the computational limitations of the nodes. They also include more reliable communication environments, such as wired networks, that are susceptible to random failures, security threats and malicious behaviours which compromise their quality of service (QoS) guarantees. In such networks, packets traverse a number of hops that cannot be determined in advance and encounter non-homogeneous network conditions that have been largely ignored in the literature. This thesis examines analytical properties of packet travel in large networks and investigates the implications of some packet coding techniques on both QoS and resource utilisation. Specifically, we use a mixed jump and diffusion model to represent packet traversal through large networks. The model accounts for network non-homogeneity regarding routing and the loss rate that a packet experiences as it passes successive segments of a source to destination route. A mixed analytical-numerical method is developed to compute the average packet travel time and the energy it consumes. The model is able to capture the effects of increased loss rate in areas remote from the source and destination, variable rate of advancement towards destination over the route, as well as of defending against malicious packets within a certain distance from the destination. We then consider sending multiple coded packets that follow independent paths to the destination node so as to mitigate the effects of losses and routing inaccuracies. We study a homogeneous medium and obtain the time-dependent properties of the packet’s travel process, allowing us to compare the merits and limitations of coding, both in terms of delivery times and energy efficiency. Finally, we propose models that can assist in the analysis and optimisation of the performance of inter-flow network coding (NC). We analyse two queueing models for a router that carries out NC, in addition to its standard packet routing function. The approach is extended to the study of multiple hops, which leads to an optimisation problem that characterises the optimal time that packets should be held back in a router, waiting for coding opportunities to arise, so that the total packet end-to-end delay is minimised

Multicast Scheduling and Resource Allocation Algorithms for OFDMA-Based Systems: A Survey

Multicasting is emerging as an enabling technology for multimedia transmissions over wireless networks to support several groups of users with flexible quality of service (QoS)requirements. Although multicast has huge potential to push the limits of next generation communication systems; it is however one of the most challenging issues currently being addressed. In this survey, we explain multicast group formation and various forms of group rate determination approaches. We also provide a systematic review of recent channel-aware multicast scheduling and resource allocation (MSRA) techniques proposed for downlink multicast services in OFDMA based systems. We study these enabling algorithms, evaluate their core characteristics, limitations and classify them using multidimensional matrix. We cohesively review the algorithms in terms of their throughput maximization, fairness considerations, performance complexities, multi-antenna support, optimality and simplifying assumptions. We discuss existing standards employing multicasting and further highlight some potential research opportunities in multicast systems