Abstract: In wireless multihop networks, transmission capacity of each wireless node is relatively low and wireless signal transmissions of neighbor wireless nodes might interfere each other. Thus, it is difficult for a wireless multihop transmission route to provide required throughput to a network application. The authors have proposed a method to provide required throughput by combination of multiple wireless multihop transmission routes with joins and branches based on Ford-Fulkerson algorithm for maximum flow calculation in wired networks. Here, by using capacities of wireless nodes and flows along wireless links in wireless multihop networks, flow increasing wireless multihop routes are searched and detected until the required throughput can be provided. However, there are no cut-off conditions of search for flow increasing wireless multihop transmission routes, longer calculation time cannot be avoided. This paper proposes the cut-off conditions based on the current assignment of flow in

• Publication Date: 26-Feb-2017
• DOI: 10.15224/978-1-63248-117-7-49
• Views: 0
• Downloads: 0

Abstract: BHASKAR BISWASA new key agreement scheme based on elgamal and triple decomposition problem over non commutative platforms is presented. An understanding of the new scheme over braid groups is provided and the strengths of it over an earlier scheme that rely on a similar system based on other decomposition problems are discussed. The new scheme provides better security over earlier schemes on non-commutative platforms by countering the linear algebra and length based attacks.

• Publication Date: 26-Feb-2017
• DOI: 10.15224/978-1-63248-117-7-50
• Views: 0
• Downloads: 0