• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.7
• /
• pp.37-48
• /
• 2014

Wireless mesh networks have emerged as a key technology in environment that needs wireless multi-hop communication without infrastructure and IEEE 802.11s mesh network standard have currently been established. One of big differences between this standard and the legacy IEEE 802.11 is that MCCA MAC is included to support QoS. MCCA supports bandwidth reservations between neighbors, so it can satisfy the QoS of bandwidth guarantee. However, MCCA has dis-advantages as follow; 1) it can not guarantee end-to-end bandwidth, 2) in multi-interface multi-channel wireless environments, the IEEE 802.11s does not provide a bandwidth reservation protocol and a wireless channel assignment etc. In this paper, we have proposed MIMC R-HWMP, which expands R-HWMP that was proposed in our previous work[3], to support multi-interface multi-channel. By simulation, we showed end-to-end bandwidth guarantee and the increase in the available bandwidth in multi-interface multi-channel wireless mesh networks.

• Journal of Korea Multimedia Society
• /
• v.16 no.9
• /
• pp.1077-1088
• /
• 2013

As broadcasting is the process that a node sends a packet to all nodes in the network. it is basic process used for discovering of a routes to a node and disseminating of control information message in Mobile Ad hoc NETwork (MANET). In this paper, we propose dynamically adjusted probabilistic mechanism based on distance ratio and node density for broadcasting in MANETs. The distance ratio can be calculated as the ratio of the radio strength length to the distance from sender of a node, and node density can be get from 1-hop nodes of neighbours. A mobile node receiving broadcast packets determines the probability of rebroadcasting considering distance ratio and node density of itself. Rebroadcast probability will be set as low value to a node which is located in nearby area of sender and has high 1-hop node density, So it reduces packets transmission caused by the early die-out of rebroadcast packets. Compared with the simple flooding and fixed probabilistic flooding by simulation, our approach shows better performances results. Proposed algorithm can reduce the rebroadcast packet delivery more than 30% without scanting reachability, where as it shows up to 96% reachability compared with flooding.

• Journal of Korea Multimedia Society
• /
• v.9 no.2
• /
• pp.244-254
• /
• 2006

This paper presents an efficient hybrid technique to compact the trie indexing the huge forward table small enough to be stored into cache for speeding up IP lookup. It combines two techniques, an encoding scheme called bit-map and a controlled-prefix expanding scheme to replace slow memory search with few fast-memory accesses and computations. For compaction, the bit-map represents each index and child pointer with one bit respectively. For example, when one node denotes n bits, the bit-map gives a high compression rate by consumes $2^{n-1}$ bits for $2^n$ index and child link pointers branched out of the node. The controlled-prefix expanding scheme determines the number of address bits represented by all root node of each trie's level. At this time, controlled-prefix scheme use a dynamic programming technique to get a smallest trie memory size with given number of trie's level. This paper proposes standard that can choose suitable trie structure depending on memory size of system and the required IP lookup speed presenting optimal memory size and the lookup speed according to trie level number.

• Journal of Korea Multimedia Society
• /
• v.11 no.10
• /
• pp.1446-1459
• /
• 2008

In an infrastructure-based wireless network, an access point is used for all communications among mobile devices. However, when a mobile device moves into a dead Bone, a connectivity disruption between the mobile device and the access point occurs. Such connectivity disruption consequently leads to another connectivity disruption between the mobile device moving toward the dead zone and other wireless-enabled devices located within the area of the infrastructure-based wireless network. To cope with the connectivity disruption in the infrastructure-based wireless network the ad hoc network that dynamically forms a network without any preexisting communication infrastructure needs to be set up to provide seamless connections among mobile devices. In this paper, we propose the DNSQ-MAC (Dynamic Network State aware QoS-Medium Access Control) technique that meets the deadlines of MAC frames forwarded over hop-by-hop multipaths and guarantees the QoS performance of an ad hoc-based wireless network. Mobile devices incorporating the DNSQ-MAC technique are capable of adjusting to the new dynamic network status in order to enhance the QoS performance in the ad hoc-based wireless network. A case study which exploits the Qualnet simulator shows that the proposed DNSQ-MAC technique can guarantee the deadlines of MAC frames forwarded over hop-by-hop multipaths and enhance the QoS performance of various routing protocols and packet schedulers running on the network layer above the MAC layer.

• The KIPS Transactions:PartC
• /
• v.13C no.5 s.108
• /
• pp.621-626
• /
• 2006

A mobile ad hoc network (MANET) is an infrastructureless network that supports multi-hop communication. For the MANET nodes wishing to communicate with nodes in the wired Internet, the global Internet connectivity is required and this functionality can be achieved with the help of the Internet gateway. For the support of reliability and flexibility, multiple Internet gateways can be provisioned for a MANET. In this case, load-balancing becomes one of the important issues since the network performance such as the network throughput can be improved if the loads of the gateways are well-balanced. In this paper, we categorize the load-balancing mechanisms and propose a new metric for load-balancing. Simulation results show that our proposed mechanism using the hop distance and the number of routing table entries as a load-balancing metric enhances the overall network throughput.

• Journal of Korea Spatial Information System Society
• /
• v.12 no.1
• /
• pp.10-17
• /
• 2010

Sensor nodes used in Geosensor network are resource limited and power constrained. So it is necessary to research on routing protocols to gather data by using energy efficiently. Wireless sensor networks collect data gathered from sensor nodes by transfering it to the sink using multihop. However, it has two problems. First, the existing works require unnecessary data transmission for choosing a proper parent node to transfer data. Secondly, they have a large number of data transmission because each sensor node has a different path. To solves the problems, we, in this paper, propose a designated path based data aggregation scheme for efficient energy management in WSNs. The proposed scheme can reduce unnecessary data transmission by pre-determining a set of paths and can enable all the sensor nodes to participate in gathering data by running them in round-robin fashion. We show from performance analysis that the proposed scheme is more energy efficient than the existing directed diffusion(DD) and the hierarchical data aggregation(HDA).

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.12
• /
• pp.30-45
• /
• 2014

Recently, multimedia application users who demand for ubiquitous computing environment are rapidly increasing, and wireless mesh network is receiving attention as a cost-effective key technology for next generation wireless networking. When multiple flows are transmitting data at the same time in the network, routing for path selection of each flow and link resource allocation for data transmission of each flow are one of the key factors that influence to the effectiveness of the network directly. In this paper, we consider problems for path discovery and resource allocation of links at the same time and we propose an algorithm based on mathematical modeling using a technique for cross-layer optimization design in STDMA-based wireless mesh networks that can enhance transfer performance for each flow. We show by performance analysis that the proposed algorithm can enhance the throughput performance by maximally utilizing given bandwidth resources when the number of flows increase in multi-hop wireless mesh networks.

• Journal of Digital Convergence
• /
• v.11 no.10
• /
• pp.419-429
• /
• 2013

The Wireless sensor network(WSN) consisting of a large number of sensors aims to gather data in a variety of environments. The sensor nodes operate on battery of limited power. so, To extend network life time is major goals of research in the WSN. In this paper, we state the key point of a energy consumption with minimum&load balancing. The proposed protocol guarantee balance of number of cluster member nodes using the node memory threshold and optimization of distribution of cluster head using the optimized clustering method. The results show that the proposed protocol could support the load balancing and high energy efficiency by distributing the clusters with a reasonable number of member nodes. The simulation results show that our schme ensure longer life time in WSN as compare with existing schemes such as LEACH and CBLM.

• Journal of KIISE:Information Networking
• /
• v.36 no.5
• /
• pp.456-469
• /
• 2009

We develop a new wireless link quality metric, ECOT(Estimated Channel Occupancy Time) that enables a high throughput route setup in wireless mesh networks. The key feature of ECOT is to be applicable to diverse mesh network environments where IEEE 802.11 MAC (Medium Access Control) variants are used. We take into account the exact operational features of 802.11 MAC protocols, such as 802.11 DCF(Distributed Coordination Function), 802.11e EDCA(Enhanced Distributed Channel Access) with BACK (Block Acknowledgement), and 802.11n A-MPDU(Aggregate MAC Protocol Data Unit), and derive the integrated link metric based on which a high throughput end-to-end path is established. Through extensive simulation in random-topology settings, we evaluate the performance of proposed link metric and present that ECOT shows 8.5 to 354.4% throughput gain over existing link metrics.

• Journal of Korea Society of Industrial Information Systems
• /
• v.14 no.1
• /
• pp.64-72
• /
• 2009

Previous research on sensor networks mainly focused on efficient transmission of data from sensors to fixed sink nodes. Recently there has been active research on mobile sink nodes, but the re-search of an environment where both fixed sink nodes and mobile sinks are present at the same time is rather scarce. This paper proposes a technique for context gathering by mobile devices with the sink functionality added through fixed sinks under a previously built, cluster based multi hop sensor network environment. To this end, clustering of mobile devices were done based on the fixed sinks of a previously built sensor network, and by using appropriate fixed sinks, context gathering was made possible. By mathematical comparison with TTDD routing protocol, which was proposed for mobile sinks, it was conformed that performance increases in energy with the number of mobile sinks, and with the number of movements by mobile devices.