论文部分内容阅读
A dynamic protocol stack(DPS) for ad hoc networks, together with a protocol stack construction scheme that is modeled as a multiconstrained knapsack problem is proposed. Compared to the traditional static protocol stack, DPS operates in a dynamic and adaptive manner and is scalable to network condition changes. In addition, a protocol construction algorithm is proposed to dynamically construct of the protocol stack each network node. Simulation results show that, the processing and forwarding performance of our scheme is close to 1 Gb/s, and the performance of our algorithm is close to that of the classical algorithms with much lower complexity.
A dynamic protocol stack (DPS) for ad hoc networks, together with a protocol stack construction scheme that is modeled as a multiconstrained knapsack problem is proposed. Compared to the traditional static protocol stack, DPS operates in a dynamic and adaptive manner and is scalable to Network results changes. In addition, a protocol construction algorithm is proposed to dynamically construct the protocol stack each network node. Simulation results show that, the processing and forwarding performance of our scheme is close to 1 Gb / s, and the performance of our algorithm is close to that of the classical algorithms with much lower complexity.