# Crafting a Real-Time Information Aggregator for Mobile Messaging

Authors: Jenq-Shiou Leu
Journal: Journal of Computer Systems, Networks, and Communications
 (2010)

---

## Abstract

Mobile messaging is evolving beyond SMS (Short Message Service) text messaging with the introduction of MMS (Multimedia Messaging Service). In the past, such a scheme is used for peer-to-peer communication. Messages are generally displayed on a cellular phone with a limited-sized screen. However, such a visualizing process is not suitable to broadcast real-time SMS/MMS messages to people in public. To facilitate the instancy and publicity, we develop a real-time information aggregator—Visualizing SMS and MMS Messages System (VSMMS)—to realize the concept by integrating SMS and MMS messaging over GSM/GPRS/UMTS onto a remote display device. The device exhibits messages on a larger display device in public. VSMMS features a revolutionized variation of mass media broadcasting. In this paper, we practically illustrate how to design and implement VSMMS and use a M/M/1 model to conduct a theoretical analysis about the message delay in the system queue. Meanwhile, we make an empirical performance evaluation about the message transmission time over different networks.


---

## Body

## 1. Introduction

SMS [1] enables mobile subscribers to send and receive instant messages of up to 160 bytes. Some real-time information can be delivered to message receivers by SMS messages from applications, for example, delivering system failure information to the administrators [2], monitoring remote data [3]. SMS also supports many interdisciplinary applications, like Classroom Feedback Systems (CFSs) [4] to raise large-class interactivity among teachers and students. It has exploded in popularity with cell phones and other communications devices that support text messaging. A general SMS messaging system architecture includes a Short Message Service Center (SMSC), a SMS broker, and a content provider [5]. Compared with SMS, MMS [6] provides a richer message service within images, audio, text, video clips, and combinations of these. However, the screen size of cellular phone on which messages are shown is very limited. Therefore, a comprehensive displaying mechanism can enrich the visualization of mobile message communications.Based on the above, we combined the Java Web Service, Java Secure Socket Extension, and Java Swing [7] to develop the VSMMS on a larger display device such as PDP within a computer. Additionally, the system contains an optional interface of previewing all incoming messages by an administrator to prevent the device from displaying improper contents in public. This system can be applied to broadcast instant information sent from cellular phones onto the display device.The rest of this paper is organized as follows. Section2 depicts the system architecture of VSMMS and how to implement such a system, including the process flow and related system components. Section 3 presents system service analyses. Section 4 shows the comparisons between the modern messaging communication systems and VSMMS as well as some potential applications of VSMMS. Concluding remarks are finally drawn in Section 5.


## 2. Architecture Design and Implementation

### 2.1. System Components

VSMMS is composed of four modules as follows and the system architecture is shown in Figure1:(1)
SMS/MMS Messages Receiver,(2)
Message Queue,(3)
Message Verifier (Optional),(4)
Message Displayer,(5)
Exhibited Message Selector.Figure 1
VSMMS system architecture.


### 2.2. Processing Flow

Figure2 describes the message processing logic flow.Figure 2
Message Processing Logic Flow.(1) SMS messages and MMS messages are composed and sent by mobile handsets and then delivered to SMSC and MMSC, respectively.(2) These incoming messages are forwarded to ”Message Receiver” first and stored in the unverified message queue.(3) After the administrator preview by using “Message Verifier” and then designate these messages to be approved or disapproved for display.(4) “Exhibited Message Selector” then selects the candidate messages for “Message Displayer” to display based on different algorithms and applications.


### 2.3. Detailed Descriptions for System Component

#### 2.3.1. SMS/MMS Message Receiver

This module is responsible for receiving all incoming messages from GSM and GPRS/UMTS networks. Two significant submodules—SMS Message Receiver and MMS Message Receiver, connect to SMSC and MMSC, respectively, to receive incoming messages. The former one links up with SMSC (SMS Centre) via SMPP [8] over IP. The latter one communicates with MMSC (MMS Centre) via MM7 interface [9] over SOAP/HTTP/IP. Detailed protocol stacks are illustrated in Figure 3. All messages targeting at the specific service ID are conveyed from SMSC/MMSC to such a receiver and put into the message queue to be further processed.Figure 3
SMS/MMS messaging to VSMMS protocol stack.


#### 2.3.2. SMS/MMS Message Queue

Message Queue stores all incoming messages. Each entity in the queue contains the generic information listed in Table1. Such information can provide necessary parameters to the latter Exhibited Message Selector on a selection basis, for example, “MessageType”, “CreatedTime”, and “LastDisplayedTime” according to different scheduling mechanisms.Table 1
Attributes of messages.
AttributesDescriptionIDMessage entity IDMessage IDSMS/MMS message IDCreatedTimemessage created timePriority*Selected to be exhibited priorityMSISDNSender’s phone numberTextText part in messageImageImage part in messageMessageTypeWhat type the message isLastExhibitedTimeLast exhibited timeFlag**Verification state*For priority driven selection.**If the message does not need to be verified before exhibited, the “Flag” for messages in the queue is set to be “Approved” by default.


#### 2.3.3. Message Verifier (Optional)

Since the service ID is opened for all users, a simple mechanism to administer contents in messages can avoid displaying improper contents from malicious senders. An authorized checker can utilize Message Verifier to verify all incoming messages via a web-based interface. After finding out thatthere exist some unverified messages in the system, the checker can examine all constituents in each message, including the text description or media content,to decide which message can be approved or disapproved to publish. By selecting the “Approve” or “Disapprove” radio button as shown in Figure4, all verified messages can be submitted to the system for displaying.Figure 4
An optional web-based interface to preview message contents.


#### 2.3.4. Exhibited Message Selector

Exhibited Message Selector performs a selection among approved messages for Message Displayer. Each region in the layout of Message Displayer has an independent message assigned by Exhibited Message Selector. Such a component can be implemented by different scheduling algorithms, such as First-Come-First-Served (FCFS), Round-Robin manner, or priority-driven manner by referring to necessary fields, such as “CreatedTime” and “Priority”. In order to conduct a selection with fairness for all approved messages for exhibition, we exploit a hybrid way of the FCFS mechanism for fresh messages and Least Recent Used (LRU) mechanism for old messages by referring to “LastExhibitedTime” as an aging factor for re-exhibition. The detailed scheme is depicted in Algorithm1.Algorithm 1:Algorithm of FCFS-based selection with LRU re-exhibition.
// SelectK messages in the approved message queue asrequested(1) Count all fresh messages, which are not yet exhibited,(withNULL value in “LastExhibitedTime” field) and setsuch the said count toN(2)  If  N>KThen2.1 Designate the precedingK messages among these Nmessages by referring to “CreatedTime” as selected onesElse2.2 Designate theseN messages as selected ones2.3 Designate the precedingK-N messages among oldmessages (with non-NULL value in “LastExhistedTime”field) by referring to “LastExhibitedTime” as selected onesEnd IF(3) Update “LastExhibitedTime” values for these K.messages as the current time(4) Return these K messages IDs


#### 2.3.5. Message Displayer

This module is used to exhibit approved message contents, which are selected by Exhibited Message Selector, in the Approved Message Queue. The physical layout may depend on different applications and comprise several independent regions. Figure5 illustrates a sample display layout. The top area is a marquee, which exhibits text message contents. The bottom area consists of four regions. MMS message contents are displayed concurrently in these four regions which include an image part and a text one accordingly. These regions can have their own display durations determined by Message Displayer. Additionally, these independent regions always ask for a new message content to display toward Exhibited Message Selector when the corresponding display durations are expired. Figure 6 shows VSMMS implemented on a computer-embedded PDP.Figure 5
Layout of message displayer.Figure 6
VSMMS on a computer-embedded PDP.


## 2.1. System Components

VSMMS is composed of four modules as follows and the system architecture is shown in Figure1:(1)
SMS/MMS Messages Receiver,(2)
Message Queue,(3)
Message Verifier (Optional),(4)
Message Displayer,(5)
Exhibited Message Selector.Figure 1
VSMMS system architecture.


## 2.2. Processing Flow

Figure2 describes the message processing logic flow.Figure 2
Message Processing Logic Flow.(1) SMS messages and MMS messages are composed and sent by mobile handsets and then delivered to SMSC and MMSC, respectively.(2) These incoming messages are forwarded to ”Message Receiver” first and stored in the unverified message queue.(3) After the administrator preview by using “Message Verifier” and then designate these messages to be approved or disapproved for display.(4) “Exhibited Message Selector” then selects the candidate messages for “Message Displayer” to display based on different algorithms and applications.


## 2.3. Detailed Descriptions for System Component

### 2.3.1. SMS/MMS Message Receiver

This module is responsible for receiving all incoming messages from GSM and GPRS/UMTS networks. Two significant submodules—SMS Message Receiver and MMS Message Receiver, connect to SMSC and MMSC, respectively, to receive incoming messages. The former one links up with SMSC (SMS Centre) via SMPP [8] over IP. The latter one communicates with MMSC (MMS Centre) via MM7 interface [9] over SOAP/HTTP/IP. Detailed protocol stacks are illustrated in Figure 3. All messages targeting at the specific service ID are conveyed from SMSC/MMSC to such a receiver and put into the message queue to be further processed.Figure 3
SMS/MMS messaging to VSMMS protocol stack.


### 2.3.2. SMS/MMS Message Queue

Message Queue stores all incoming messages. Each entity in the queue contains the generic information listed in Table1. Such information can provide necessary parameters to the latter Exhibited Message Selector on a selection basis, for example, “MessageType”, “CreatedTime”, and “LastDisplayedTime” according to different scheduling mechanisms.Table 1
Attributes of messages.
AttributesDescriptionIDMessage entity IDMessage IDSMS/MMS message IDCreatedTimemessage created timePriority*Selected to be exhibited priorityMSISDNSender’s phone numberTextText part in messageImageImage part in messageMessageTypeWhat type the message isLastExhibitedTimeLast exhibited timeFlag**Verification state*For priority driven selection.**If the message does not need to be verified before exhibited, the “Flag” for messages in the queue is set to be “Approved” by default.


### 2.3.3. Message Verifier (Optional)

Since the service ID is opened for all users, a simple mechanism to administer contents in messages can avoid displaying improper contents from malicious senders. An authorized checker can utilize Message Verifier to verify all incoming messages via a web-based interface. After finding out thatthere exist some unverified messages in the system, the checker can examine all constituents in each message, including the text description or media content,to decide which message can be approved or disapproved to publish. By selecting the “Approve” or “Disapprove” radio button as shown in Figure4, all verified messages can be submitted to the system for displaying.Figure 4
An optional web-based interface to preview message contents.


### 2.3.4. Exhibited Message Selector

Exhibited Message Selector performs a selection among approved messages for Message Displayer. Each region in the layout of Message Displayer has an independent message assigned by Exhibited Message Selector. Such a component can be implemented by different scheduling algorithms, such as First-Come-First-Served (FCFS), Round-Robin manner, or priority-driven manner by referring to necessary fields, such as “CreatedTime” and “Priority”. In order to conduct a selection with fairness for all approved messages for exhibition, we exploit a hybrid way of the FCFS mechanism for fresh messages and Least Recent Used (LRU) mechanism for old messages by referring to “LastExhibitedTime” as an aging factor for re-exhibition. The detailed scheme is depicted in Algorithm1.Algorithm 1:Algorithm of FCFS-based selection with LRU re-exhibition.
// SelectK messages in the approved message queue asrequested(1) Count all fresh messages, which are not yet exhibited,(withNULL value in “LastExhibitedTime” field) and setsuch the said count toN(2)  If  N>KThen2.1 Designate the precedingK messages among these Nmessages by referring to “CreatedTime” as selected onesElse2.2 Designate theseN messages as selected ones2.3 Designate the precedingK-N messages among oldmessages (with non-NULL value in “LastExhistedTime”field) by referring to “LastExhibitedTime” as selected onesEnd IF(3) Update “LastExhibitedTime” values for these K.messages as the current time(4) Return these K messages IDs


### 2.3.5. Message Displayer

This module is used to exhibit approved message contents, which are selected by Exhibited Message Selector, in the Approved Message Queue. The physical layout may depend on different applications and comprise several independent regions. Figure5 illustrates a sample display layout. The top area is a marquee, which exhibits text message contents. The bottom area consists of four regions. MMS message contents are displayed concurrently in these four regions which include an image part and a text one accordingly. These regions can have their own display durations determined by Message Displayer. Additionally, these independent regions always ask for a new message content to display toward Exhibited Message Selector when the corresponding display durations are expired. Figure 6 shows VSMMS implemented on a computer-embedded PDP.Figure 5
Layout of message displayer.Figure 6
VSMMS on a computer-embedded PDP.


## 2.3.1. SMS/MMS Message Receiver

This module is responsible for receiving all incoming messages from GSM and GPRS/UMTS networks. Two significant submodules—SMS Message Receiver and MMS Message Receiver, connect to SMSC and MMSC, respectively, to receive incoming messages. The former one links up with SMSC (SMS Centre) via SMPP [8] over IP. The latter one communicates with MMSC (MMS Centre) via MM7 interface [9] over SOAP/HTTP/IP. Detailed protocol stacks are illustrated in Figure 3. All messages targeting at the specific service ID are conveyed from SMSC/MMSC to such a receiver and put into the message queue to be further processed.Figure 3
SMS/MMS messaging to VSMMS protocol stack.


## 2.3.2. SMS/MMS Message Queue

Message Queue stores all incoming messages. Each entity in the queue contains the generic information listed in Table1. Such information can provide necessary parameters to the latter Exhibited Message Selector on a selection basis, for example, “MessageType”, “CreatedTime”, and “LastDisplayedTime” according to different scheduling mechanisms.Table 1
Attributes of messages.
AttributesDescriptionIDMessage entity IDMessage IDSMS/MMS message IDCreatedTimemessage created timePriority*Selected to be exhibited priorityMSISDNSender’s phone numberTextText part in messageImageImage part in messageMessageTypeWhat type the message isLastExhibitedTimeLast exhibited timeFlag**Verification state*For priority driven selection.**If the message does not need to be verified before exhibited, the “Flag” for messages in the queue is set to be “Approved” by default.


## 2.3.3. Message Verifier (Optional)

Since the service ID is opened for all users, a simple mechanism to administer contents in messages can avoid displaying improper contents from malicious senders. An authorized checker can utilize Message Verifier to verify all incoming messages via a web-based interface. After finding out thatthere exist some unverified messages in the system, the checker can examine all constituents in each message, including the text description or media content,to decide which message can be approved or disapproved to publish. By selecting the “Approve” or “Disapprove” radio button as shown in Figure4, all verified messages can be submitted to the system for displaying.Figure 4
An optional web-based interface to preview message contents.


## 2.3.4. Exhibited Message Selector

Exhibited Message Selector performs a selection among approved messages for Message Displayer. Each region in the layout of Message Displayer has an independent message assigned by Exhibited Message Selector. Such a component can be implemented by different scheduling algorithms, such as First-Come-First-Served (FCFS), Round-Robin manner, or priority-driven manner by referring to necessary fields, such as “CreatedTime” and “Priority”. In order to conduct a selection with fairness for all approved messages for exhibition, we exploit a hybrid way of the FCFS mechanism for fresh messages and Least Recent Used (LRU) mechanism for old messages by referring to “LastExhibitedTime” as an aging factor for re-exhibition. The detailed scheme is depicted in Algorithm1.Algorithm 1:Algorithm of FCFS-based selection with LRU re-exhibition.
// SelectK messages in the approved message queue asrequested(1) Count all fresh messages, which are not yet exhibited,(withNULL value in “LastExhibitedTime” field) and setsuch the said count toN(2)  If  N>KThen2.1 Designate the precedingK messages among these Nmessages by referring to “CreatedTime” as selected onesElse2.2 Designate theseN messages as selected ones2.3 Designate the precedingK-N messages among oldmessages (with non-NULL value in “LastExhistedTime”field) by referring to “LastExhibitedTime” as selected onesEnd IF(3) Update “LastExhibitedTime” values for these K.messages as the current time(4) Return these K messages IDs


## 2.3.5. Message Displayer

This module is used to exhibit approved message contents, which are selected by Exhibited Message Selector, in the Approved Message Queue. The physical layout may depend on different applications and comprise several independent regions. Figure5 illustrates a sample display layout. The top area is a marquee, which exhibits text message contents. The bottom area consists of four regions. MMS message contents are displayed concurrently in these four regions which include an image part and a text one accordingly. These regions can have their own display durations determined by Message Displayer. Additionally, these independent regions always ask for a new message content to display toward Exhibited Message Selector when the corresponding display durations are expired. Figure 6 shows VSMMS implemented on a computer-embedded PDP.Figure 5
Layout of message displayer.Figure 6
VSMMS on a computer-embedded PDP.


## 3. System Service Analysis

### 3.1. Message Delay Analysis

We analyze the message delay in the message queue of VSMMS by a M/M/1 queuing conceptual model shown in Figure7. The assumptions and parameters exploited in the model are illustrated below.(1)
The new SMS and MMS message arrival into the approved message queue of VSMMS SMS/MMS are Poisson distributions with ratesλSMS and λMMS, respectively. The total message arrival rate is λ=λSMS+λMMS.(2)
The exhibition time of a message is assumed to be exponentially distributed with mean1/μ. All stored messages are displayed according to FIFO scheduling.(3)
The message queue in VSMMS is a finite storage with a capacity ofM messages.Figure 7
A queuing model for the VSMMS message queue.Performance analysis of the VSMMS message queue can be induced by describing the queue as a Markov chain. Figure8 shows the transitions among different states where the state i indicates that there are i messages in the queue.Figure 8
An M/M/1 Markov chain representation for the VSMMS message queue.LetPi  denote the steady-state probability of being in the state i. Using balance equations, we can get the following result:(1)Pi=∏j=1i(λμ)P0=P0(λμ)i,1≤i≤M+1,
where P0 can be as ∑i=0M+1Pi=1.Letai denotes the probability of having i messages in the queue just before a message arrives and gets accepted by the VSMMS. Such a message never sees the queue in the state M+1,that is, blocking state.ai can be shown by the following result [10, 11].(2)ai=Pi1-PM+1.
The message delay (W) is defined as the time between the acceptance of a message in VSMMS and the time the message starts to be transmitted. Two notations Fz(t) and fz(t) are used for the following analyses. Fz(t) and fz(t) denote the distribution and density function of a random variable z, where(3)fz(t)=ddxFz(t).
Assume that a message arrives to the queue when there are i messages in the queue (i.e., the queue is in the state i). Let mi denote this message. If 1≤i≤M+1, then mi is accepted and the queue state would change into i+1. If i=0, then mi would be immediately processed, otherwise it must wait in the queue till the i message has been processed. Suppose the queue is consisted of these i messages which are ahead of mi at some moment. Let ti denote the time required for the message population to decrease from i to i-1 (1≤i≤M). Then, ti is exponentially distributed with the rate parameter μ, and we can obtain (4)fti(t)=μe-μt.
Let Ti denote the message delay of mi, that is, the amount of time mi must wait before its transmission starts. Then we can get(5)Ti=t1+t2+⋯+ti=Ti-1+ti,fori≥1,T0=0.
The mean message delay is therefore given by(6)E[Ti]=∑j=1iE[tj]=∑j=1i1μ=iμ.


### 3.2. Transmission Time Analysis

VSMMS offers an instant way to gather and broadcast instant messages from anywhere under cellular network coverage, for example, 53.6 kbps over GPRS or 384 kbps over UMTS for a limited radio resource. The consumed time of message transmission may be an attractive issue. Normally SMS messages fly over SS7 control channels, the transmission time for SMS messages is far below the one consumed by transmitting MMS messages. (Figure9 shows the average transmission time of SMS/MMS messaging over GSM/GPRS/UMTS while delivering 102-byte SMS messages and 24-kbyte MMS message to VSMMS.) Hence, the focusing scenario is to compose and deliver MMS messages to VSMMS. The consumed time for such a scenario is shown by (7)(SizeMMSTRGPRS/UMTSUL+SizeMMSTRGPRS/UMTS_DL)×8seconds,
where SizeMMS denotes the MMS message size in kbyte; TRGPRS/UMTS_DL and TRGPRS/UMTS_UL denote GRPS/UMTS transmission rates in kbits per second for the downlink and uplink, respectively.Figure 9
Average transmission time of SMS/MMS messaging over GSM/GPRS/UMTS.For example, the size of an MMS message is 26.8 kbytes and the GPRS transmission rate is 53.6 kbps. The total consumed time from posting to being received by VSMMS is 4~5 seconds.


## 3.1. Message Delay Analysis

We analyze the message delay in the message queue of VSMMS by a M/M/1 queuing conceptual model shown in Figure7. The assumptions and parameters exploited in the model are illustrated below.(1)
The new SMS and MMS message arrival into the approved message queue of VSMMS SMS/MMS are Poisson distributions with ratesλSMS and λMMS, respectively. The total message arrival rate is λ=λSMS+λMMS.(2)
The exhibition time of a message is assumed to be exponentially distributed with mean1/μ. All stored messages are displayed according to FIFO scheduling.(3)
The message queue in VSMMS is a finite storage with a capacity ofM messages.Figure 7
A queuing model for the VSMMS message queue.Performance analysis of the VSMMS message queue can be induced by describing the queue as a Markov chain. Figure8 shows the transitions among different states where the state i indicates that there are i messages in the queue.Figure 8
An M/M/1 Markov chain representation for the VSMMS message queue.LetPi  denote the steady-state probability of being in the state i. Using balance equations, we can get the following result:(1)Pi=∏j=1i(λμ)P0=P0(λμ)i,1≤i≤M+1,
where P0 can be as ∑i=0M+1Pi=1.Letai denotes the probability of having i messages in the queue just before a message arrives and gets accepted by the VSMMS. Such a message never sees the queue in the state M+1,that is, blocking state.ai can be shown by the following result [10, 11].(2)ai=Pi1-PM+1.
The message delay (W) is defined as the time between the acceptance of a message in VSMMS and the time the message starts to be transmitted. Two notations Fz(t) and fz(t) are used for the following analyses. Fz(t) and fz(t) denote the distribution and density function of a random variable z, where(3)fz(t)=ddxFz(t).
Assume that a message arrives to the queue when there are i messages in the queue (i.e., the queue is in the state i). Let mi denote this message. If 1≤i≤M+1, then mi is accepted and the queue state would change into i+1. If i=0, then mi would be immediately processed, otherwise it must wait in the queue till the i message has been processed. Suppose the queue is consisted of these i messages which are ahead of mi at some moment. Let ti denote the time required for the message population to decrease from i to i-1 (1≤i≤M). Then, ti is exponentially distributed with the rate parameter μ, and we can obtain (4)fti(t)=μe-μt.
Let Ti denote the message delay of mi, that is, the amount of time mi must wait before its transmission starts. Then we can get(5)Ti=t1+t2+⋯+ti=Ti-1+ti,fori≥1,T0=0.
The mean message delay is therefore given by(6)E[Ti]=∑j=1iE[tj]=∑j=1i1μ=iμ.


## 3.2. Transmission Time Analysis

VSMMS offers an instant way to gather and broadcast instant messages from anywhere under cellular network coverage, for example, 53.6 kbps over GPRS or 384 kbps over UMTS for a limited radio resource. The consumed time of message transmission may be an attractive issue. Normally SMS messages fly over SS7 control channels, the transmission time for SMS messages is far below the one consumed by transmitting MMS messages. (Figure9 shows the average transmission time of SMS/MMS messaging over GSM/GPRS/UMTS while delivering 102-byte SMS messages and 24-kbyte MMS message to VSMMS.) Hence, the focusing scenario is to compose and deliver MMS messages to VSMMS. The consumed time for such a scenario is shown by (7)(SizeMMSTRGPRS/UMTSUL+SizeMMSTRGPRS/UMTS_DL)×8seconds,
where SizeMMS denotes the MMS message size in kbyte; TRGPRS/UMTS_DL and TRGPRS/UMTS_UL denote GRPS/UMTS transmission rates in kbits per second for the downlink and uplink, respectively.Figure 9
Average transmission time of SMS/MMS messaging over GSM/GPRS/UMTS.For example, the size of an MMS message is 26.8 kbytes and the GPRS transmission rate is 53.6 kbps. The total consumed time from posting to being received by VSMMS is 4~5 seconds.


## 4. Analytical Comparison and Potential Applications

Compared to modern messaging communication systems, such as Mobile Messaging System and Digital Broadcasting System [12], VSMMS features one-to-many medium-sized broadcasting on a centralized display device with high mobility and instancy support via cellular networks. Furthermore, VSMMS can be easily extended and adapted to the future all-IP networks. The major differences between the contemporary messaging communication systems and VSMMS are depicted in Table 2.Table 2
Comparisons of the contemporary messaging communication systems and VSMMS.
Mobile messaging systemVSMMSDigital broadcasting systemCommunication model1 to 11 to Many in One Centralized Receiver1 to Many with scattered receiversMobility for message creatorHighHighLowImmediateness of message deliveryHighHighLowScale for message receivingSmallMediumLargeCarrier networkCellular network (GSM/GPRS/UMTS)Cellular network (can be easily extended to any all-IP networks)Broadcasting network (DAB/DVB)Message capacityLow (limited by handset form factor)High (System-based, extendable)High (System-based, extendable)VSMMS can be one of the following variations but not limited.


### 4.1. Real-Time Traffic Information Sharing

Traffic jam is getting worse for lack of real-time traffic information. Drivers can use MMS-enabled handsets within a digital cam to capture and advertise the visible traffic condition in public, instead of only oral reporting.


### 4.2. Home Appliance within a Family Bulletin Board

A dedicated channel in a traditional TV allocated for unfolding SMS/MMS messages enables people to communicate with one another like a family bulletin board.


### 4.3. Dynamic Poster Framework

To substitute for the traditional public bulletin board, a multimedia display terminal with wireless instead of wired communication capability enables the flexibility of dynamic advertisement or announcement in a public area, especially for location-oriented affairs like community information,weather information.


### 4.4. Real-Time Visualization for Televoting Statistics

Tele-voting service can establish direct connections with radio-stations listeners, TV viewers, and readers of newspapers and magazines. Such a visualization process can make mobile voting mechanism more evident.


## 4.1. Real-Time Traffic Information Sharing

Traffic jam is getting worse for lack of real-time traffic information. Drivers can use MMS-enabled handsets within a digital cam to capture and advertise the visible traffic condition in public, instead of only oral reporting.


## 4.2. Home Appliance within a Family Bulletin Board

A dedicated channel in a traditional TV allocated for unfolding SMS/MMS messages enables people to communicate with one another like a family bulletin board.


## 4.3. Dynamic Poster Framework

To substitute for the traditional public bulletin board, a multimedia display terminal with wireless instead of wired communication capability enables the flexibility of dynamic advertisement or announcement in a public area, especially for location-oriented affairs like community information,weather information.


## 4.4. Real-Time Visualization for Televoting Statistics

Tele-voting service can establish direct connections with radio-stations listeners, TV viewers, and readers of newspapers and magazines. Such a visualization process can make mobile voting mechanism more evident.


## 5. Conclusion

The prototype system presented in this paper has been successfully implemented and demonstrated. We have realized an extended idea to visualize instant SMS/MMS messages openly on a larger device, instead of a limited-sized screen on personal cellular phones in the past. Such an implementation also improves the traditional peer-to-peer mobile communication. Users compose SMS or MMS messages within real-time information by handset and send them to a specific service ID via SMSC/MMSC. Afterward all incoming messages are processed by VSMMS and shown on a remote display device. VSMMS is suitable to be deployed for real-time information sharing in public. To avoid displaying improper contents in public, the system includes an optional web-based interface to help the administrator verify the incoming contents. VSMMS features a novel messaging communication scheme for mass media broadcasting.



---

*Source: 209617-2010-09-02.xml*