Zobrazeno 1 - 10
of 27
pro vyhledávání: '"Hon Sun Chiu"'
Publikováno v:
Journal of Communications Software and Systems, Vol 2, Iss 2, Pp 131-140 (2006)
Data transmission in a mobile ad hoc network is performed within an untrusted wireless environment. It is subjected to many kinds of security attacks. In a wormhole attack, two malicious nodes work together to tunnel packets from one to the other, ma
Externí odkaz:
https://doaj.org/article/c8695e7d12934cc7bf6ff5f677f4f5d7
Autor:
Hon-Sun Chiu
Publikováno v:
Data in Brief, Vol 26, Iss, Pp-(2019)
Data in Brief
Data in Brief
While learning through mobile devices, or mobile learning, has been proven feasible [1,2], its effectiveness is still in doubt as contradictory research results were observed [3–5]. In this dataset, the data collected from the experiments on mobile
Publikováno v:
IEEE Transactions on Wireless Communications. 8:1706-1715
The capacity of an IEEE 802.11-based multi-hop wireless network is limited. By effectively utilizing multiple non-overlapping channels and multiple interfaces, collision and co-channel interference can be reduced. This allows more concurrent transmis
Autor:
Kwan L. Yeung, Hon Sun Chiu
Publikováno v:
WCNC
With the increasing popularity of wireless mesh networks (WMNs), broadcasting traffic (e.g. IP-TV) will contribute a large portion of network load. In this paper, we consider a multi-channel multi-interface WMN with real time broadcast call arrivals.
Publikováno v:
ICC
We consider multi-channel multi-interface wireless mesh networks with a schedule-based MAC protocol, where conflict-free transmission is ensured by requiring links assigned with the same channel and within the mutual interference range of each other
Publikováno v:
MobiHoc
This paper presents a distributed polynomial algorithm for finding the maximum bandwidth path in Wireless Mesh Networks (WMNs). Our proposed algorithm can be applied for designing the proactive hop-by-hop routing protocol with bandwidth guarantee. To
Publikováno v:
WCNC
Widest spanning tree is a broadcast tree with its bottleneck link bandwidth maximized. It provides a cost effective broadcasting solution in multi-channel multi-interface wireless mesh networks. To find the widest spanning tree, existing algorithms j
Publikováno v:
WCNC
Efficient broadcast schemes are essential in wireless mesh networks (WMNs) for minimizing the content update time. In this paper, we consider the widest spanning tree problem in a multi-channel multi-interface WMN, where the width of a tree is determ