• 한국정보통신설비학회:학술대회논문집
• /
• 2006.08a
• /
• pp.43-46
• /
• 2006

IEEE 802.16 WirelessMAN aiming to broadband wireless access (BWA) is evolving to 4G mobile communication system through the standardization of IEEE 802.16e supporting mobility on existing fixed WirelessMAN system. It is necessary for hand-over to provide seamless data service while MS (Mobile Station) moves to another BS (Base Station). Because the performance of handover affects packet loss or delay of any communications, it must consider low latency handover mechanism in packet based network. In this paper, we describes handover scheme of IEEE 802.16e with the cell edge interference problem and shows the way to solve the problem in frequency reuse one deployment. Our scheme reduces the handover latency and packet loss probability.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.3
• /
• pp.268-274
• /
• 2013

In this paper, the performance analysis of optics-based sensor node localization using ToF (Time of Flight) scheme is conducted. Generally, the position of the sensor node is calculated on the base station. And the base station scans neighboring sensor nodes with a laser. The laser which is reflected from one sensor node, however, can be reached to the base station at different angles according to the scanning resolution. This means that the error of the reached angle can increase and one node may be recognized as different nodes. Also the power of laser can decrease because the laser signal spread. Thus the sensor node which is located at a long distance from the base station cannot be detected. In order to overcome these problems which can be occurred in localization using ToF, the beam spot, the scanning resolution, the size of reflector and the power of laser at the sensor node were analyzed. It can be expected that the consequence of analysis can be provided in acquisition of accurate position of sensor node and construction of optics-based sensor node localization system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12B
• /
• pp.2298-2319
• /
• 1999

In this paper, we propose a new moving mobile base station (MMBS) scheme for very low power and micro-size RMIMS (radio-interfaced micro information monitoring system) terminals. RMIMS terminals can be used in various application service areas such as pollution monitoring, environment surveillance, traffic monitoring, emergency monitoring (e.g., building, bridge, railroad breakdown), security monitoring (e.g., theft, alarm) and military application. For these applications based on wireless transmission technologies, sensor type RMIMS terminals must satisfy low cost and low power design (e.g., solar power, life limited battery) requirement. In RMIMS terminal design, this low power requirement limits transmission range of uplink or reverse link and means small cell size. Also these applications using RMIMS terminals may have a little bit non real-time traffic characteristic and low scattering density in service area.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.6
• /
• pp.2111-2131
• /
• 2015

Tiered wireless sensor network is a network model of flexibility and robustness, which consists of the traditional resource-limited sensor nodes and the resource-abundant storage nodes. In such architecture, collected data from the sensor nodes are periodically submitted to the nearby storage nodes for archive purpose. When a query is requested, storage nodes also process the query and return qualified data as the result to the base station. The role of the storage nodes leads to an attack prone situation and leaves them more vulnerable in a hostile environment. If any of them is compromised, fake data may be injected into and/or qualified data may be discarded. And the base station would receive incorrect answers incurring malfunction to applications. In this paper, an efficient verifiable top-k query processing scheme called EVTQ is proposed, which is capable of verifying the authentication and completeness of the results. Collected data items with the embedded information of ordering and adjacent relationship through a hashed message authentication coding function, which serves as a validation code, are submitted from the sensor nodes to the storage nodes. Any injected or incomplete data in the returned result from a corresponded storage node is detected by the validation code at the base station. For saving communication cost, two optimized solutions that fuse and compress validation codes are presented. Experiments on communication cost show the proposed method is more efficiency than previous works.

• Journal of information and communication convergence engineering
• /
• v.5 no.2
• /
• pp.93-97
• /
• 2007

In this paper, centralized access control and slot allocation algorithm is proposed for wireless networks. The proposed algorithm is characterized by the contention-based reservation. In order to reduce the collision probability of reservation request, the base station calculates and broadcasts the transmission probability of reservation requests, and the wireless terminal transmits its reservation request with the received transmission probability. The scheduler allocates the uplink data slots based on the successful reservation requests. Simulation results show that the proposed algorithms can provide high channel utilization, and furthermore, maintains constant delay performance in the heavy traffic environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4A
• /
• pp.394-400
• /
• 2010

Mobile Multi-hop Relaying (MMR) system can provide increased system capacity of wireless access network by coverage extension and enhanced transmission rate within the Base Station (BS) coverage area. The previous researches for the MMR system with a non-transparent mode Relay Station (RS) do not consider channel selection procedure of Mobile Station (MS), co-channel interference and Multi-hop Relay Base Station (MR-BS) coverage and RS coverage ratio in MMR system. In this paper, we investigate the performance of MMR uplink system in multicell environments with various topologies. The performance is presented in terms of call blocking probability, channel utilization, outage probability and system throughput by varying offered load. It is found that, for certain system parameters, the MMR uplink system achieve the maximum system throughput when MR-BS coverage to RS coverage ratio is 7.

• Journal of electromagnetic engineering and science
• /
• v.15 no.1
• /
• pp.14-19
• /
• 2015

In multicellular wireless networks, intercell interference limits system performance, especially cell edge user performance. One promising approach to solve this problem is the intercell interference coordination (ICIC) scheme. In this paper, we propose a new ICIC scheme based on a resource partitioning approach to enhance cell edge user performance in a wireless multicellular system. The most important feature of the proposed scheme is that the algorithm is performed at each base station in a distributed manner and therefore minimizes the required information exchange between neighboring base stations. The proposed scheme has benefits in a practical environment where the traffic load distribution is not uniform among base stations and the backhaul capacity between the base stations is limited.

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

The Snoop in the BS (Base Station) performs a local retransmission over wired-wireless networks to recover packet loss quickly. However, when the MH (Mobile Host) leaves the reception range of the signal, the local retransmission causes performance to degrade. In this paper, we minimize the packet loss and local retransmission caused by the unreachability from BS to MH to improve network performance. To do this, we suggest to add RSS(Received Signal Strengths) flag bit in ACK packet of MH. By using this flag bit, the BS decides whether it retransmits or not to minimize packet loss. The result of the simulation by ns-2 shows a big improvement of performance in the networks.

• IE interfaces
• /
• v.23 no.2
• /
• pp.108-117
• /
• 2010

Wireless sensor network may be installed where it is hard to access or where one has to constantly gather data without any human's monitoring. Sensors which compose a sensor network are usually small with poor battery capacities and thus energy-efficient usage is very important because of difficulties in replacing or recharging the batteries to make the lifetime of the whole sensor network longer. LEACH protocol, a well-known hierarchical routing protocol, may resolve this problem by distributing the role of cluster header evenly to the sensor nodes in the whole area of network at each round. In this thesis, we introduce a variant of LEACH protocol which considers the distance between base station and sensors in the way that if a node is far from the base station then the probability that this node becomes a cluster header is low. Experiments to evaluate the energy efficiency and the ability to collect the information show that the proposed method in this paper has maintained much wider sensing area while keeping the energy efficiency same as LEACH.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.1
• /
• pp.1-13
• /
• 1998

The next generation of wireless network will be problably developed as a mobile communications which will support ATM-based multiMedium traffic. We need to develop an dffective MAC protocol in order to support multimedia traffic having variety of QoS characteristics on wireless neteworks. In this paper, we propose a MAC protocol a MAC protocol where mobile terminals having cells to transmit, request slots to base station through requested slot then the base station analyze parameters from mobile and allocate slots to mobile according to priority. The multimedia slot allocation(MSA) protocol divides multimedias applications into real-time/ variant and non real-time services. Entire slots of the frameare partitioned proportionallyby sizeof bandwidth according to types of services, so that related services can use allocated-slots in priority. The proposed algorithm guarantees real time operation since real-time service share slots allocated for non real-real services. The algorithm whih divides slots of the frame is called as an Algorithm A, otherwise as an Algorithm B. The simulation compares by average delay time and cell loss probability between Algorithm and Algorithm B by increasing number of mobile terminal using the proposed MAC protocol. the simulation result for real-time services shows that average delay time and cell loss probability of Algorithm A is better than those of Algorithm B.