Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: In the current work the effects of hop-by-hop packet loss and retransmissions via ARQ protocols are investigated within a Mobile Ad-hoc NET-work (MANET). A success probability function is related to each link, which can be controlled by por and rate allocation. The expression for the network's stability region is initially derived where the success function plays a critical role. The investigation considers functions with specific properties which are shown to be satisfied for various expressions of the success probability related to different modulation and coding schemes as ll as outage events. A Network Utility Maximization problem (NUM) with stability constraints is further formulated which decomposes into the input rate control and the scheduling problem. Under certain assumptions the latter is relaxed to a simpler form. This allows application of supermodular game theory and the algorithmic approach in is adapted to include the family of success functions of interest. It is shown finally that interference measurements per node drastically reduce the amount of information exchange required for solving the scheduling problem.
['Anastasios Giovanidis', 'Slawomir Stanczak']
I am writing a research paper on a idea Stability and Distributed Power Control in MANETs with Per Hop Retransmissions
[{"from": "human", "value": "I am writing a research paper on a idea Stability and Distributed Power Control in MANETs with Per Hop Retransmissions"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: In the current work the effects of hop-by-hop packet loss and retransmissions via ARQ protocols are investigated within a Mobile Ad-hoc NET-work (MANET). A success probability function is related to each link, which can be controlled by por and rate allocation. The expression for the network's stability region is initially derived where the success function plays a critical role. The investigation considers functions with specific properties which are shown to be satisfied for various expressions of the success probability related to different modulation and coding schemes as ll as outage events. A Network Utility Maximization problem (NUM) with stability constraints is further formulated which decomposes into the input rate control and the scheduling problem. Under certain assumptions the latter is relaxed to a simpler form. This allows application of supermodular game theory and the algorithmic approach in is adapted to include the family of success functions of interest. It is shown finally that interference measurements per node drastically reduce the amount of information exchange required for solving the scheduling problem."}]