Modeling and analyzing the convergence property of the BGP routing protocol in SPIN

Chen, Zhe; Zhang, Daqiang; Ma, Yinxue

doi:10.1007/s11235-014-9870-y

Cited by 2 publications

(2 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The protocol is convergent, if and only if, for any network running the protocol, all channels are eventually always empty [33]. That is to say, the routing protocol converges for the destination if the source has found best route to the destination.…”

Section: Simulation and Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Reliable routing in wireless sensor networks based on coalitional game theory

Ran

Yue

et al. 2016

IET Communications

View full text Add to dashboard Cite

Nodes in wireless sensor networks (WSNs) have the potential to be selfish without transmitting packets in routing. This study mainly focuses on the problem of reliable delivery mechanism in WSNs, and the authors' objective is to ensure stable cooperation among nodes for packets delivery and minimum routing cost at the same time. Based on the performance metrics in terms of the rate of packets forwarding, correctly reporting event, and energy remain, the authors present a coalitional game model with a characteristic function to be shared among coalition members. Then an efficient and fast convergence coalition formation algorithm is proposed to obtain the stable coalition partition in the game. Finally, on the basis of the coalitional game model, the authors design a reliable coalition formation routing (RCFR) protocol, which selects route according to the principle of lowest cost. Simulation experiments are conducted to analyse the performance of RCFR, compared with original ad hoc on-demand distance vector routing and the method proposed by Kazemeyni. The results show that RCFR effectively enhances packet delivery ratio, decreases routing establishing time, balances energy consumption, and reduces average signalling overhead.

show abstract

Section: Simulation and Resultsmentioning

confidence: 99%

“…The problem of stable paths can be formulated as a 4‐tuple, elaborated in [33]. The stable paths problem is solvable, if there exists a stable path assignment.…”

Section: Coalition‐based Routing Protocolmentioning

confidence: 99%