MBCOMS1:A Framework for VoIP Speech
Data Generation Using Asterisk
State-of-the-art approaches for automatic
recognition of speech, speaker or language specific information from spoken
data rely on statistical techniques that require large databases for training
and testing. Application of these techniques on Voice over Internet Protocol
(VoIP) environment requires studying them under different codec and network
conditions. Though earlier works have studied and reported the same, a
framework for automatic generation of VoIP speech is lacking. A number of
speech corpus for different applications are available for microphone speech.
As domain specific performance needs to be evaluated in matched acoustic
characteristics and application conditions, methods that enable automatic
generation of target speech from the available microphone speech are important
to a researcher in saving time and effort. We present a framework based on
Asterisk, a freely available open source Internet Protocol-Public Exchange
(IP-PBX) software for realization of VoIP speech from the available microphone
speech corpus in network conditions that is reflective of actual VoIP channels
MBCOMS2:Item-Level RFID in a Retail Supply Chain With Stock-Out-Based
Substitution
In this paper, we present a model to help evaluate the impact of an introduction of item-level radio-frequency identification (RFID) in a retail environment where stock-out-based substitution is common.
There are two main thrust areas in this work. First, we examine the impact of RFID in a centralized setting where retailer and manufacturer are one entity. This thrust area is concerned with evaluating the profitability of RFID and exploring which product properties favor an RFID implementation. Second, we examine the impact of RFID in a decentralized setting, where retailer and manufacturer independently maximize their profits. We investigate the problem of sharing the costs of RFID, from both the perspective of tag costs and fixed costs. Our research shows that the presence of substitution at the shelf plays a major role in determining the expected benefits of an RFID implementation, as well as in determining the optimal allocation of these benefits among retailer and manufacturer. It is therefore critically important that decision makers make strong efforts to correctly account for subsitution effects when evaluating potential item-level RFID implementations in the retail sector
ERP Application Request Details
MBCOMS3:RFID
Data Processing in Supply Chain Management Using a Path Encoding Scheme
RFID technology can be applied to a broad range of areas. In particular, RFID is very useful in the area of business, such as supply chain management. However, the amount of RFID data in such an environment is huge. Therefore, much time is needed to extract valuable information from RFID data for supply chain management. In this paper, we present an efficient method to process a massive amount of RFID data for supply chain management. We first define query templates to analyze the supply chain. We then propose an effective path encoding scheme that encodes the flows of products. However, if the flows are long, the numbers in the path encoding scheme that correspond to the flows will be very large. We solve this by providing a method that divides flows. To retrieve the time information for products efficiently, we utilize a numbering scheme for the XML area. Based on the path encoding scheme and the numbering scheme, we devise a storage scheme that can process tracking queries and path oriented queries efficiently on an RDBMS. Finally, we propose a method that translates the queries to SQL queries. Experimental results show that our approach can process the queries efficiently
MBCOMS4:RFID-based
localization and tracking technologies
Radio frequency identification usually incorporates a tag into an object for the purpose of identification or localization using radio signals. It has gained much attention recently due to its advantages in terms of low cost and ease of deployment. This article presents an overview of RFID-based localization and tracking technologies, including tag-based (e.g., LANDMARC), reader-based (e.g., reverse RFID), transceiver-free, and hybrid approaches. These technologies mainly use the readily available resource of radio signal strength information or RSS change information to localize the target objects. A number of well-known approaches and their limitations are introduced. This article also indicates the challenges and possible solutions in the near and long terms. The challenges include multipath propagation, interference, and localizing multiple objects, among others. Most of these challenges exist not only for RFID-based localization, but also for other RF-based localization technologies.
|
MBCOMS5:Real-Time Location Systems for Hospital Emergency Response Real-time location systems can help hospitals execute a coordinated response during a disaster. However, before implementing an RTLS in such a setting, management must consider the various technologies and the associated benefits, drawbacks, and challenges. |
MBCOMS6:The concept of Secure Mobile Wallet
This paper describes our concept, design and current implementation of the Secure Mobile Wallet. Mobile Wallet is an application stored in mobile phones providing to subscribers the possibility to perform various mobile financial transactions. In our approach Secure Mobile Wallet is stored and running in the Javacard SIM chip, called UICC. It comprises several Javacard applets supporting several types of financial transactions - mobile banking, mobile payments, mobile commerce, mobile micro-loans, mobile ticketing, mobile promotions, and so on. Secure Mobile Wallet supports over-the-air (OTA) transactions based on SMS, GPRS, or mobile Internet protocols and also over-the-counter (OTC) transactions based on NFC or Bluetooth protocols. For users, messages and data stored in the Secure Mobile Wallet are managed and maintained using both, OTA and OTC, protocols. Security is guaranteed by a combination of symmetric and asymmetric cryptography. As a client's application, the Secure Mobile Wallet is integrated into our larger, secure mobile transactions system – SAFE
MBCOMS7:Application development with
J2ME for mobile phone
With mobile
commerce technology continuously being taken more into use and introduced in
new markets, the transition to mobile commerce
(m-commerce) will make mobile shopping exceedingly
popular. In the near future mobile shopping will
probably replace today's markets or shopping complex. This project presents a mobile application which is built using Mobile Information Device Profile (MIDP) of the Java 2
Platform Micro Edition (J2ME), that enable users to purchase flowers without a
trip to the market or elsewhere. Users can access the application or service
through mobile phones and view the available items.
The application has been deployed and run on an emulator (Wireless Toolkit 2.5
Beta) with a DefaultColorPhone as the default emulator
MBCOMS8:Monorail Car's Wireless
Control System based on Smartphone Platform
To meet the
mountainous districts situation in China, this paper introduces a monorail
car's wireless control system used in orchard which is based on smart phone and
GPRS wireless communication technology. The system can obtain monorail car's
speed and position information by rotary encoder, control and transmit data by
wireless communication. A SMS module on Windows
Mobile Embedded OS 6.1 is developed based on GSM
protocol system. Smart phone can receive car's initial information and send
orders to the on-vehicle controller for operating the car by GSM message. It describes how the hardware platform works
and how to accomplish the design with software. Meanwhile, it tests the data
transmission time and makes improvement. The rational design makes it easier to
operate, which is proved to be available by tests
MBCOMS9:Hands-free messaging
application (iSay-SMS): A proposed framework
Mobile phones have become a necessity in people's life today as almost everyone will have at least one with them. Short message service (SMS) which is an important component in mobile phones is growing popular among mobile phone subscribers. The use of SMS nowadays is more than the calling function itself. In order to make the SMS function in mobile phones more efficient and attractive, speech recognition which allows users to use it for voice messages and enables users to speak in a natural way to communicate with others through their mobile phones is introduced. However, speech recognition technology to SMS is in the form of standard language is contradicted with the popularity of SMS that is used in the form of text abbreviation or short form. The research was conducted to find a solution for speech recognition technologies to enable it to transfer human speech into personalized text abbreviations. Studies and findings had been conducted regarding the possible technologies to solve problems such as voice-tag, architecture of ASR (Automatic Speech Recognition) system and Part-of-speech (POS). The problem with the inability to transfer speech to text abbreviation will be solved by adding a personalized data dictionary that enables users to save their own personalized words by integrating the voice-tag and part-of-speech tagging (POS) technology into iSay-SMS to help in saving and retrieving the text abbreviations. In addition, proposed framework of iSay-SMS is designed in such a way that promotes its marketability and increases the acceptance among the mobile phone subscribers
MBCOMS10:A Speech Remote Control System Realization Based
on Computer Telecommunication Integration
Speech control is a hotspot in intelligent control technology. Automatic speech control means that machines can recognize the context of human's voice, and carry on the human's mind based on the recognition results. A speech remote control system is been realized based on computer telecommunication integration and Web Service in this project. And the system structure, technical implement and main function modules have been introduced in detail.
MBCOMS11:Automated voice based home navigation
system for the elderly and the physically challenged
In this paper, we propose an
Intelligent Home Navigation System (IHNS) which comprises of a wheelchair, voice module and navigation module. It can be used by an
elderly or physically challenged person to move inside the home without any
difficulty. It's common that the elders forget the way to the different rooms
in house and the physically challenged people find it hard to move the wheel
chair without external aid. By making use of IHNS, elderly and the physically
challenged can go to different rooms in the house like kitchen, living room,
dining room etc by just speaking a word which is predefined to that particular
room. The voice of the person is detected by voice capture module which will be compared by voice recognition module with predefined voices loaded in to the system. According to the received voice, the destination is automatically understood and the
wheelchair moves according to the route which is predefined. It is also
equipped with obstacle avoidance technique, where the person may not be able to
provide proper voices at the right time. The wheel
chair can automatically navigate from one point to the other in the home as per
predefined route based on the voice
received. Thus the above proposed system can be used by elderly and physically
challenged people in day to day life even if they are alone at home
We consider a body-area sensor
network (BSN) consisting of multiple small, wearable
sensor nodes deployed on a
human body to track body
motions. Concerning that human bodies are relatively small and
wireless packets are subject to more serious contention and
collision, this paper addresses the data compression problem in a BSN. We observe that, when body
parts move, although sensor nodes in vicinity may compete strongly with each other, the
transmitted data usually exist some levels of
redundancy and even strong temporal
and spatial correlations. Unlike traditional data
compression approaches for large-scale and multihop sensor networks, our scheme is specifically designed for BSNs,
where nodes are likely fully connected and
overhearing among sensor nodes is possible. In our scheme, an offline phase is conducted in advance to learn the temporal
and spatial correlations of sensing data. Then,
a partial ordering of sensor
nodes is determined to represent their transmission priorities so as to
facilitate data compression
during the online phase. We present algorithms to determine such partial
ordering and discuss the design of the underlying
MAC protocol to support our compression model. An
experimental case study in
Pilates exercises for patient rehabilitation is reported. The results show that
our schemes reduce more than 70 percent of overall transmitted data compared with previous approaches
MBCOMV 2 :On Efficient
and Scalable Support of Continuous Queries in Mobile Peer-to-Peer Environments
In
this paper, we propose an efficient and scalable query processing framework for continuous
spatial queries (range and
k-nearest-neighbor queries) in
mobile peer-to-peer (P2P) environments, where no fixed communication infrastructure
or centralized/distributed servers are available. Due to
the limitations in mobile
P2P environments, for example, user mobility,
limited battery power, limited communication range, and
scarce communication bandwidth, it is costly to
maintain the exact answer of continuous
spatial queries. To this
end, our framework enables the user to find an
approximate answer with quality guarantees. In
particular, we design two key features to adapt continuous spatial query
processing to mobile P2P environments. 1) Each mobile
user can specify his or her desired quality of
services (QoS) for a query answer in a personalized QoS profile. The QoS profile consists of two parameters, namely, coverage and
accuracy. The coverage parameter indicates the desired level of completeness of the
available information for computing an approximate answer, and
the accuracy parameter indicates the desired level of
accuracy of the approximate answer. 2) We design a continuous
answer maintenance scheme to enable the user to collaborate with other peers to
continuously maintain a query answer. With these two
features in our framework, the user can obtain a query answer from a local cache if the answer satisfies
his or her QoS requirements. Otherwise, the user enlists neighbors for help to share their cached information to
refine the answer. If the refined answer still cannot satisfy the QoS
requirements, the user broadcasts the query to the peers residing within the required search area of the query to find the most accurate answer. Experiment results show
that our framework is efficient and
scalable and provides an
effective trade-off between the communication overhead and
the quality of query
answers.
MBCOMV 2 :Managing Power Saving Classes in
IEEE 802.16 Wireless MANs: A Fold-and-Demultiplex Method
In
IEEE 802.16, power management at the
Mobile Subscriber Station (MSS) side is always an important issue. The standard
defines three types of power saving
classes (PSCs). A PSC can
bind one or multiple traffic flows. However, given multiple flows in an MSS, the standard does not define how to form PSCs,
how to organize the cooperation of multiple PSCs to obtain better energy
efficiency, and how to guarantee QoS of these flows.
Given a set of flows and
their QoS parameters, the objective of this paper is to define multiple PSCs and their listen-and-sleep-related
parameters and packet-scheduling policy such that
the unavailability intervals of the MSS can be maximized and
the QoS of each flow can be guaranteed. To achieve this, we propose a novel fold-and-demultiplex method for an IEEE 802.16 network with PSCs of
types I and II together with an
earliest-next-bandwidth-first packet scheduler. Given a
set of traffic flows in an MSS, the fold-and-demultiplex
method first gives each flow a
tentative PSC satisfying its bandwidth requirement. Then we fold them together into one long series so as to calculate
the total bandwidth requirement. Finally, we demultiplex
the series into multiple PSCs, each supporting one or multiple flows. It ends up
with high energy efficiency of MSSs while meets flows' bandwidth requirements.
Furthermore, our packet scheduler ensures that real-time flows' delay
constraints can be met. To the best of our knowledge, this is the first result
offering bounded packet delays under MSS's sleep-and-listen
behaviors
MBCOMV 3 :A Set-Theoretic Approach to
Collaborative Position Location for Wireless Networks
In this work, we propose a
set-theoretic approach to collaborative position location for wireless networks. The proposed
method borrows the concept from the parallel projection method (PPM),
originally developed for signal recovery with
inconsistent convex feasibility sets, modifies and extends the technique to an iterative and distributed numerical algorithm to estimate node locations,
based on incomplete and noisy internode distance estimates. We demonstrate that
in the case of noncollaborative position location, the proposed method is analytically equivalent to the parallel implementation of Kaczmarz Algorithm that
is guaranteed to converge to
a local minimizer and thus a
stationary point. For collaborative
position location, the
proposed iterative PPM is computationally much more efficient than existing
methods such as SDP and MDS-MAP, while achieving comparable or better
localization accuracy and robustness to
non-line-of-sight (NLOS) bias. Finally, our proposed method can be implemented
in a parallel and distributed fashion, and is
scalable for large network
deployment.
MBCOMV 4 :Verifiable Privacy-Preserving
Sensor Network Storage for Range Query
We consider a hybrid two-tiered sensor
network consisting of regular sensors
and special sensors with large storage
capacity, called storage nodes. In this structure,
regular sensors "push” their raw data to nearby
storage nodes and the sink diffuses queries only to storage nodes
and "pull” the reply from them. We investigate security and privacy threats when the sensor
network is deployed in an untrusted or hostile
environment. The major concern is that storage nodes
might easily become the target for the adversary to
compromise due to their important role. A compromised storage
node may leak the data stored there to the adversary breaching the data privacy. Also, it may send wrong information as the reply
to a query breaking the data integrity. This paper
focuses on range query, a
fundamental operation in a sensor network. The solution framework includes a privacy-preserving storage scheme which utilizes a bucketing technique to mix
the data in a certain range, and a verifiable query protocol which
employs encoding numbers to enable the sink to validate the reply. We further
study the performance of event detection, an application implemented by range query. Our simulation
results illustrate that our schemes are efficient for
communication and effective for privacy
and security protection.
MBCOMV 5 :Hedonic Coalition Formation for
Distributed Task Allocation among Wireless Agents
Autonomous wireless agents such as unmanned aerial vehicles, mobile base
stations, cognitive devices, or self-operating wireless
nodes present a great potential for deployment in
next-generation wireless networks. While current
literature has been mainly focused on the use of agents
within robotics or software engineering applications, this paper proposes a
novel usage model for self-organizing agents suitable for wireless communication networks. In the proposed model, a
number of agents are required to collect data from
several arbitrarily located tasks. Each task represents a queue of packets that require collection
and subsequent wireless transmission by the agents to a central receiver. The problem is modeled as a hedonic coalition formation game between the agents
and the tasks that interact in order to form
disjoint coalitions. Each formed coalition is modeled as a polling system consisting of a
number of agents, designated as collectors, which
move between the different tasks present in the coalition, collect and transmit the packets. Within each coalition, some agents might
also take the role of a relay for improving the
packet success rate of the transmission. The proposed hedonic
coalition formation
algorithm allows the tasks and the agents to take distributed
decisions to join or leave a coalition, based on the
achieved benefit in terms of effective throughput, and the cost in terms of
polling system delay. As a result of these decisions, the agents
and tasks structure themselves into independent
disjoint coalitions which constitute a Nash-stable
network partition. Moreover, the proposed coalition formation algorithm allows the agents
and tasks to adapt the topology to environmental
changes, such as the arrival of new tasks, the
removal of existing tasks, or the mobility of the tasks. Simulation results show how the proposed algorithm
allows the agents and tasks
to self-organize into independent coalitions, while
improving the performance, in terms of ave- - rage player (agent
or task) payoff, of at least 30.26 percent (for a network of five agents
with up to 25 tasks) relatively to a scheme that
allocates nearby tasks equally among
agents.
MBCOMV 6 :ALARM: Anonymous Location-Aided
Routing in Suspicious MANETs
In
most common mobile ad hoc networking (MANET)
scenarios, nodes establish communication based on long-lasting public
identities. However, in some hostile and suspicious settings, node identities must not be exposed
and node movements should be untraceable. Instead, nodes need to communicate on
the basis of their current locations. While such MANET
settings are not very common, they do occur in
military and law enforcement domains and require high security and privacy
guarantees. In this paper, we address a number of
issues arising in suspicious
location-based MANET
settings by designing and analyzing a privacy-preserving and secure link-state
based routing protocol (ALARM).
ALARM uses nodes' current locations to securely
disseminate and construct topology snapshots and forward data. With the aid of
advanced cryptographic techniques (e.g., group signatures), ALARM provides both security and privacy features,
including node authentication, data integrity, anonymity, and untraceability
(tracking-resistance). It also offers protection against passive and active
insider and outsider attacks. To the best of our knowledge, this work
represents the first comprehensive study of security, privacy, and performance
tradeoffs in the context of link-state MANET routing
MBCOMV 7 :Common Radio Resource Management
Algorithms for Multimedia Heterogeneous Wireless Networks
Heterogeneous
wireless systems are envisaged as the integration
and joint cooperative management of diverse radio access networks and
technologies through which network providers can
satisfy the wide variety of user/service demands in a more efficient manner by
exploiting their varying characteristics and properties. To achieve this
objective, a key tool is common radio
resource management
technique designed to jointly manage the radio resources from different radio
access technologies. In this context, this work proposes and optimizes new common radio resource management techniques
designed to efficiently distribute traffic among the available radio access technologies while providing adequate quality
of service levels under heterogeneous traffic
scenarios. The obtained results demonstrate the ability of the proposed
solutions to provide high user/service satisfaction levels while adequately
exploiting the overall system resources
MBCOMV 8 :Endpoint-Based
Call Admission Control and Resource Management for VoWLAN -
This
paper examines two specific aspects of resource management in Wireless Local Area Networks (WLANs)-Call Admission Control (CAC) and handling of
Link Adaptation (LA) events. A self-consistent system to manage these for Voice over Internet Protocol (VoIP) over an IEEE
802.11 WLAN is presented. The proposed CAC scheme is based
on the Endpoint Admission
Control (EAC) paradigm, where the endpoints probe
the network to determine if the call can be
supported with acceptable Quality of Service (QoS). The proposed scheme was
evaluated on an experimental testbed and test results
show that correct admission decisions were made
under various network configurations. The scheme also determines if LA has
resulted in the system becoming congested and, if
so, the voice codec of the handset which has undergone LA is adapted so as to
restore the system to its earlier state, thereby alleviating the congestion.
The proposed scheme was evaluated on the experimental testbed and test results show that the codec adaptation scheme was
very effective at overcoming the effects of LA for
VoIP over WLAN.
MBCOMV 9 :Traffic-Differentiation-Based
Modular QoS Localized Routing for Wireless Sensor Networks
A new localized quality
of service (QoS) routing
protocol for wireless sensor networks (WSN) is
proposed in this paper. The proposed protocol targets WSN's applications having
different types of data traffic. It is based on differentiating QoS
requirements according to the data type, which enables to provide several and
customized QoS metrics for
each traffic category. With each packet, the
protocol attempts to fulfill the required data-related QoS
metric(s) while considering power efficiency. It is modular
and uses geographical information, which eliminates the need of propagating routing information. For link
quality estimation, the protocol employs distributed, memory and computation
efficient mechanisms. It uses a multisink single-path approach to increase
reliability. To our knowledge, this protocol is the first that makes use of the
diversity in data traffic while considering latency,
reliability, residual energy in sensor nodes, and
transmission power between nodes to cast QoS metrics
as a multiobjective problem. The proposed protocol can operate with any medium
access control (MAC) protocol, provided that it employs an acknowledgment (ACK)
mechanism. Extensive simulation study with scenarios of 900 nodes shows the
proposed protocol outperforms all comparable state-of-the-art QoS and localized routing protocols. Moreover, the protocol has been
implemented on sensor motes and tested in a sensor network testbed.