The Experts below are selected from a list of 13611 Experts worldwide ranked by ideXlab platform
Mary Wu - One of the best experts on this subject based on the ideXlab platform.
-
a cost matrix Agent for shortest path routing in ad hoc networks
Journal of Network and Computer Applications, 2010Co-Authors: Mary WuAbstract:Wireless ad hoc networks do not rely on an existing infrastructure. They are organized as a network with Nodes that act as hosts and routers to treat packets. With their frequent changes in topology, ad hoc networks do not rely on the same routing methods as for pre-established wired networks; they require routing methods for mobile wireless networks. To select a path from a source to a destination in dynamic ad hoc networks, an efficient and reliable routing method is very important. In this paper, we introduce a cost-matrix-based routing algorithm. An Agent Node creates topology information in the form of the adjacency-cost matrix which shows link costs of the network.Based on the adjacency-cost matrix, the minimum-cost matrix and the next-Node matrices can be calculated. Based on the minimum-cost matrix and the next-Node matrices, the minimum cost between source and destination Nodes and between intermediate Nodes on the minimum-cost paths can be calculated. The matrices are periodically distributed by the Agent to the other Nodes. Based on the minimum-cost matrix and the next-Node matrices, each Node decides the minimum-cost path to its destination. Because none of the Nodes except the Agent needs to gather network topology information, the control overhead of the proposed method is small compared with those of the general table-driven routing protocols.
Chonggun Kim - One of the best experts on this subject based on the ideXlab platform.
-
a routing protocol based on adjacency matrix in ad hoc mobile networks
International Conference on Advanced Language Processing and Web Information Technology, 2008Co-Authors: Zhipeng Liu, Jeongmi Kim, Bokman Lee, Chonggun KimAbstract:Ad hoc network is self-organized network which distinguished by the randomly changing topology. So the routing protocol for ad hoc wireless network must be adaptive to frequent topology changes caused by the Nodes mobility. But if every Node maintains the whole topology information, the routing update must involve a huge state propagation control overhead. For this problem, on-demand routing protocols mainly execute the path-finding and communication process only when it is required, in which the maintenance overhead can be decreased efficiently. Since each new connection requires a new route discovery process, the on-demand routing mechanism can bring about a high delay for connection setup and bandwidth consumption. In this paper, we propose a routing protocol based on adjacency matrix. The Agent Node gathers topology knowledge and creates the adjacency matrix for topology. All available routes from a source to a destination can be calculated using the adjacency matrix, which is updated periodically or on-demand. All the Nodes in the network maintain the adjacency matrix distributed from the Agent. The efficiency and performance of the proposed routing protocol are verified by computer simulations.
Ellcy M. Priana - One of the best experts on this subject based on the ideXlab platform.
-
Trust based Clustering and Secure Authentication for Multicast in AD-Hoc
2016Co-Authors: Ellcy M. PrianaAbstract:Ad-hoc network is a dynamic wireless network, composed of mobile Nodes without the aid of centralized administration, where Nodes have limited transmission range. Security is challenging issue due to the mobility of Nodes can lead to dynamic topology, intermediate Nodes act as a router can forward packets. Therefore authentication the source and forwarding packets with cryptographic mechanism and valid MACs is inappropriate because the data with encrypted key can send in same path can be modified by the attacker Node. This paper presents a clustering mechanism with multi-hop communication and the source authentication is also done. The Agent Node is developed to verify the key with encrypted data is modified or not. The key management is done by the Agent Node. This ensure the source forwarding data is modified can be send using different path using dynamic selection of paths. The multicast protocol with hierarchical routing will increase the scalability. Index Terms Secure authentication, multicast communication, key managament. 1
Zhipeng Liu - One of the best experts on this subject based on the ideXlab platform.
-
a routing protocol based on adjacency matrix in ad hoc mobile networks
International Conference on Advanced Language Processing and Web Information Technology, 2008Co-Authors: Zhipeng Liu, Jeongmi Kim, Bokman Lee, Chonggun KimAbstract:Ad hoc network is self-organized network which distinguished by the randomly changing topology. So the routing protocol for ad hoc wireless network must be adaptive to frequent topology changes caused by the Nodes mobility. But if every Node maintains the whole topology information, the routing update must involve a huge state propagation control overhead. For this problem, on-demand routing protocols mainly execute the path-finding and communication process only when it is required, in which the maintenance overhead can be decreased efficiently. Since each new connection requires a new route discovery process, the on-demand routing mechanism can bring about a high delay for connection setup and bandwidth consumption. In this paper, we propose a routing protocol based on adjacency matrix. The Agent Node gathers topology knowledge and creates the adjacency matrix for topology. All available routes from a source to a destination can be calculated using the adjacency matrix, which is updated periodically or on-demand. All the Nodes in the network maintain the adjacency matrix distributed from the Agent. The efficiency and performance of the proposed routing protocol are verified by computer simulations.
Sun Jiangtao - One of the best experts on this subject based on the ideXlab platform.
-
block chain consensus method based on dpos and Nodes
2017Co-Authors: Li Da-hai, Tang Jian, Cui Meng, Xu Wei, Sun JiangtaoAbstract:The invention provides a block chain consensus method based on a DPOS and Nodes. The method comprises the following steps that a transaction Node generates a transaction request of executing an intelligent contract and broadcasts the transaction request to a block chain network; an accounting Node receives the transaction request, then executes the intelligent contract according to the transaction request, stores a generated contract execution result and a transaction request in a newly-generated block and broadcasts the block to the block chain network; and an Agent Node receives the block, then executes the intelligent contract according to the transaction request and verifies the contract execution result. By using the technical scheme provided in the invention, a common Node does not need to verify the contract execution result so that a calculating capability of a whole network can be effectively increased.