• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10d
• /
• pp.556-559
• /
• 2007

Due to its ease of deployment, low cost, self-configuring and self-healing capabilities, Wireless Mesh Networks (WMNs) have emerged as a key technology to be used in a wide scale applications in personal, local, campus, and metropolitan areas. Security and more specifically privacy is an important issue in this type of multi-hop WMN which has given a little attention in the research community. We focus on privacy compromise of a mesh client in a community mesh network that may lead an attacker to reveal mesh clients identity. his other profiles and gain information about mobility. In this paper. we have presented an authentication mechanism with the aid of blind signature that ensures a mesh client to anonymously authenticate itself with a nearby mesh router and thereby preserve identity privacy We have also presented the security and performance analysis of the proposed scheme.

• Management Science and Financial Engineering
• /
• v.6 no.2
• /
• pp.29-45
• /
• 2000

We consider the design of a two-level telecommunication network having logical full-mesh/star topology, with the implementation of conduit systems taken together. The design problem is then viewed as consisting of three subproblems: locating hub facilities, placing a conduit network, and installing cables therein to configure the logical full-mesh/star network. Without partitioning into subproblems as done in the conventional approach, the whole problem is directly dealt with in a single integrated framework, inspired by some recent successes with the approach. We successfully formulate the problem as a variant of the classical multicommodity flow model for the fixed charge network design problem, aided by network augmentation, judicious commodity definition, and some flow restrictions. With our optimal model, we solve some randomly generated sample problems by using CPLEX MIP program. From the computational experiments, it seems that our model can be applied to the practical problem effectively.

• Journal of Institute of Control, Robotics and Systems
• /
• v.22 no.11
• /
• pp.984-990
• /
• 2016

In wireless mesh sensor networks (WMSNs), sensor nodes are connected in the form of a mesh topology and transfer sensor data by multi-hop routing. A data aggregation method for WMSNs is required to minimize the number of routing hops and the energy consumption of each node with limited battery power. This paper presents a shortest path data aggregation method for WMSNs. The proposed method utilizes a simple hash function based on shuffled row major indexing for addressing sensor nodes. This allows sensor data to be aggregated without complex routing tables and calculation for deciding the next hop. The proposed data aggregation algorithms work in a fractal fashion with different mesh sizes. The method repeatedly performs gathering and moves sensor data to sink nodes in higher-level clusters. The proposed method was implemented and simulations were performed to confirm the accuracy of the proposed algorithms.

• ETRI Journal
• /
• v.36 no.6
• /
• pp.931-941
• /
• 2014

Many methodologies for clock mesh networks have been introduced for two-dimensional integrated circuit clock distribution networks, such as methods to reduce the total wirelength for power consumption and to reduce the clock skew variation through consideration of buffer placement and sizing. In this paper, we present a methodology for clock mesh to reduce both the clock skew and the total wirelength in three-dimensional integrated circuits. To reduce the total wirelength, we construct a smaller mesh size on a die where the clock source is not directly connected. We also insert through-silicon vias (TSVs) to distribute the clock signal using an effective clock TSV insertion algorithm, which can reduce the total wirelength on each die. The results of our proposed methods show that the total wirelength was reduced by 12.2%, the clock skew by 16.11%, and the clock skew variation by 11.74%, on average. These advantages are possible through increasing the buffer area by 2.49% on the benchmark circuits.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.8
• /
• pp.393-398
• /
• 2005

In interconnection networks, a Hamiltonian path has been utilized in many applications such as the implementation of linear array and multicasting. In this paper, we consider the Hamiltonian properties of mesh networks which are used as the topology of parallel machines. If a network is strongly Hamiltonian laceable, the network has the longest path joining arbitrary two nodes. We show that a two-dimensional mesh M(m, n) is strongly Hamiltonian laceabie, if $m{\geq}4,\;n{\geq}4(m{\geq}3,\;n{\geq}3\;respectively)$, and the number of nodes is even(odd respectively). A mesh is a spanning subgraph of many interconnection networks such as tori, hypercubes, k-ary n-cubes, and recursive circulants. Thus, our result can be applied to discover the fault-hamiltonicity of such networks.

• International Journal of Computer Science & Network Security
• /
• v.21 no.4
• /
• pp.1-8
• /
• 2021

The subject of navigation has drawn a large interest in the last few years. Navigation problem (or path planning) finds the path between two points, source location and destination location. In smart cities, solving navigation problem is essential to all residents and visitors of such cities to guide them to move easily between locations. Also, the navigation problem is very important in case of moving robots that move around the city or part of it to get some certain tasks done such as delivering packages, delivering food, etc. In either case, solution to the navigation is essential. The core to navigation systems is the navigation algorithms they employ. Navigation algorithms can be classified into navigation algorithms that depend on maps and navigation without the use of maps. The map contains all available routes and its directions. In this proposal, we consider the first class. In this paper, we are interested in getting path planning solutions very fast. In doing so, we employ a parallel platform, Reconfigurable mesh (R-Mesh), to compute the path from source location to destination location. R-Mesh is a parallel platform that has very fast solutions to many problems and can be deployed in moving vehicles and moving robots. This paper presents two algorithms for path planning. The first assumes maps with linear streets. The second considers maps with branching streets. In both algorithms, the quality of the path is evaluated in terms of the length of the path and the number of turns in the path.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.2
• /
• pp.254-259
• /
• 2008

Mesh WLANs, which consist of wireless mesh routers connecting each other in a mesh topology and self-operate after their autoconfiguration, have several advantages in convenience, swiftness and flexibility of deployment and operation over existing WLANs the expansions of which are done by connecting the APs with wires. However, many technical issues still remain to be solved. Among them, network performance degradations due to the interference between the adjacent hops in multi-hop mesh WLANs, and the reusability of the existing wireless network protocols are critical problems to be answered. This work evaluates the VoIP support performance of IEEE 802.11a/g-based mesh WLANs with multiple wireless interfaces with simulations. The results show that there exit an unfairness in VoIP packet delay performances among mobile routers located at different hops, and that although the capacity of the admitted calls can be increased by increasing the size of voice packet payload it is far less than the expected one. This suggests that the existing 802.11 MAC protocols have their limitation when applied in mesh networks and their enhancement or even a newer one nay be required.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.1
• /
• pp.233-239
• /
• 2015

The demand of remote control and monitoring for efficiency and applications of LED streetlight is increasing continuously because the demand of LED streetlight was increase last few years. Existing street light remote control system is wired using a power line network. The wireless connection exists, but due to its low data transmission rate, it cannot support specialized applications. It can only support simple control and monitoring. In this paper, we propose a system that uses a IEEE 802.11s wireless mesh network based on WLAN, as a backbone network for remote control and monitoring of the LED street lights along with other specialized applications. Using the wireless mesh network for remote control and monitoring the LED street lights, the same can be used to act like a public Wi-Fi access point. We have designed Wi-Fi integrated LED streetlight controller and implemented our system. We evaluated the performance of our system on a real test bed. Our proposed system is expected to perform the role of a U-city infrastructure by utilizing the wireless mesh network.

• Journal of KIISE
• /
• v.41 no.10
• /
• pp.810-823
• /
• 2014

The wireless mesh network based on IEEE 802.11s provides a routing based on a destination address as it inherits legacy internet architecture. However, this architecture interested in not 'what' which is originally the users goal but 'where'. Futhermore, because of the rapid increase of the number of mobile devices recently, the mobile traffic increases geometrically. It reduces the network effectiveness as increasing many packets which have same payload in the situation of many users access to the same contents. In this paper, we propose an OpenFlow-based contents routing for the wireless mesh network(WMN) to solve this problem. We implement contents layer to the legacy network layer which mesh network uses and the routing technique based on contents identifier for efficient contents routing. In addition we provide flexibility as we use OpenFlow. By using this, we implement caching technique to improve effectiveness of network as decreasing the packet which has same payload in WSN. We measure the network usage to compare the flooding technique, we measure the delay to compare environment using caching and non caching. As a result of delay measure it shows 20% of performance improve, and controller message decrease maximum 89%.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.5
• /
• pp.959-975
• /
• 2011

Wireless mesh networks enlarge the wireless coverage area by interconnecting relatively stationary wireless routers (mesh routers). As wireless mesh networks are envisioned to provide high-bandwidth broadband Internet service to a large community of users, the Internet gateway, which acts as a central point of Internet attachment for the mesh networks, is likely to suffer heavily from the scramble for shared wireless resources because of aggregated traffic toward the Internet. It causes performance decrement on end-to-end transmissions. We propose a scheme to balance the load in a mesh network based on link quality variation to different Internet gateways. Moreover, under the mesh coverage, mobile nodes can move around and connect to nearby mesh routers while still keeping the connections to the Internet through the best gateway in terms of link quality. In this structure, gateways perform the balancing procedure through wired links. Information about gateways and mobile node's location is distributed appropriately so that every mesh router can quickly recognize the best gateway as well as the positions of mobile nodes. This distributed information assists mobile nodes to perform fast handoff. Significant benefits are shown by the performance analysis.