SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Wang L) ;lar1:(bth)"

Sökning: WFRF:(Wang L) > Blekinge Tekniska Högskola

  • Resultat 1-3 av 3
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Chen, Yuanfang, et al. (författare)
  • The scheme of mitigating the asymmetric links problem in wireless sensor networks
  • 2010
  • Konferensbidrag (refereegranskat)abstract
    • This paper investigates the radio irregularity (RI) phenomenon and its impact on communication performance in wireless sensor networks (WSNs). Based on the theoretical analysis, we find that the RI phenomenon induces the asymmetric links problem. According to this discovery, we propose a novel HCT (Hop-count Correction Tree) scheme to handle this problem. HCT utilizes graph theoretical method to get a search tree and correct the hop count error that appears in the adjacent nodes. Practical results obtained from testbed experiments demonstrate that this solution can greatly improve localization accuracy in the presence of RI
  •  
2.
  • Liu, F., et al. (författare)
  • Analysis of network trust dynamics based on the evolutionary game
  • 2015
  • Ingår i: SCIENTIA IRANICA. - : Elsevier. - 1026-3098. ; 22:6, s. 2548-2557
  • Tidskriftsartikel (refereegranskat)abstract
    • Trust, as a multi-disciplinary research domain, is of high importance in the area of network security and it has increasingly become an important mechanism to solve the issues of distributed network security. Trust is also an effective mechanism to simplify complex society, and is the source to promote personal or social cooperation. From the perspective of network ecological evolution, we propose the model of the P2P Social Ecological Network. Based on game theory, we also put forward network trust dynamics and network eco-evolution by analysis of network trust and the development of the dynamics model. In this article, we further analyze the dynamic equation, and the evolutionary trend of the trust relationship between nodes using the replicator dynamics principle. Finally, we reveal the law of trust evolution dynamics, and the simulation results clearly describe that the dynamics of trust can be effective in promoting the stability and evolution of networks. (C) 2015 Sharif University of Technology. All rights reserved.
  •  
3.
  • Yuan, Z., et al. (författare)
  • Analysis on capacity and delay for redundant multiple source routing in mobile ad hoc networks
  • 2010
  • Konferensbidrag (refereegranskat)abstract
    • We consider the realtime services over on-demand routing protocols in ad hoc networks, where infrastructure does not exist and the network topology is highly dynamic and time-varying due to node mobilities. To reduce the end-to-end delay, we have proposed two efficient routing protocols: MSR (Multipath Source Routing) and RSR (Redundant Source Routing) in our previous work. Simulations have shown the good performance for the realtime services. Moreover, we also propose a new on-demand routing protocol RMSR (Redundant Multipath Source Routing) and show the performance of RMSR, which is an extension of MSR and RSR. The performance of the network using the RMSR algorithm in terms of network capacity and end-to-end queuing delay is analyzed by computing the number of active links. Compared with DSR, we can figure out the network capacity which is not increased by redundant packets and improve network delay from O(N) to O(log N) (where N is the number of the nodes).
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-3 av 3
Typ av publikation
konferensbidrag (2)
tidskriftsartikel (1)
Typ av innehåll
refereegranskat (3)
Författare/redaktör
Wang, L (3)
Duong, Quang Trung (2)
Shu, Lei (2)
Liu, F. (1)
Zhao, H (1)
Johnson, Henric (1)
visa fler...
Chen, Yuanfang (1)
Yuan, Z (1)
Li, Mingchu (1)
Meng, C. (1)
visa färre...
Lärosäte
Språk
Engelska (3)
Forskningsämne (UKÄ/SCB)
Teknik (2)
Naturvetenskap (1)

År

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy